Richard D. Wesel

According to our database1, Richard D. Wesel authored at least 186 papers between 1994 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Awards

IEEE Fellow

IEEE Fellow 2020, "for contributions to channel coding and reliable communication".

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
CRC-Aided High-Rate Convolutional Codes With Short Blocklengths for List Decoding.
IEEE Trans. Commun., January, 2024

2023
Probabilistic Shaping for Trellis-Coded Modulation With CRC-Aided List Decoding.
IEEE Trans. Commun., March, 2023

Systematic Transmission With Fountain Parity Checks for Erasure Channels With Stop Feedback.
CoRR, 2023

Achievable Rates and Low-Complexity Encoding of Posterior Matching for the BSC.
CoRR, 2023

Design, Performance, and Complexity of CRC-Aided List Decoding of Convolutional and Polar Codes for Short Messages.
CoRR, 2023

Probabilistic Shaping for Asymmetric Channels and Low-Density Parity-Check Codes.
Proceedings of the 12th International Symposium on Topics in Coding, 2023

ELF Codes: Concatenated Codes with an Expurgating Linear Function as the Outer Code.
Proceedings of the 12th International Symposium on Topics in Coding, 2023

Efficient Maximum-Likelihood Decoding for TBCC and CRC-TBCC Codes via Parallel List Viterbi.
Proceedings of the 12th International Symposium on Topics in Coding, 2023

Suppressing Error Floors in SCPPM via an Efficient CRC-aided List Viterbi Decoding Algorithm.
Proceedings of the 12th International Symposium on Topics in Coding, 2023

2022
Sequential Transmission Over Binary Asymmetric Channels With Feedback.
IEEE Trans. Inf. Theory, 2022

CRC-Aided List Decoding of Convolutional Codes in the Short Blocklength Regime.
IEEE Trans. Inf. Theory, 2022

Reconstruction-Computation-Quantization (RCQ): A Paradigm for Low Bit Width LDPC Decoding.
IEEE Trans. Commun., 2022

Efficient Computation of Viterbi Decoder Reliability With an Application to Variable-Length Coding.
IEEE Trans. Commun., 2022

On CRC-Aided, Dual-Trellis, List Decoding for High-Rate Convolutional Codes with Short Blocklengths.
CoRR, 2022

Variable-Length Coding for Binary-Input Channels With Limited Stop Feedback.
CoRR, 2022

Variable-Length Stop-Feedback Codes With Finite Optimal Decoding Times for BI-AWGN Channels.
Proceedings of the IEEE International Symposium on Information Theory, 2022

Efficiently Computable Converses for Finite-Blocklength Communication.
Proceedings of the IEEE International Symposium on Information Theory, 2022

Achieving Short-Blocklength RCU Bound via CRC List Decoding of TCM with Probabilistic Shaping.
Proceedings of the IEEE International Conference on Communications, 2022

High-Rate Convolutional Codes with CRC-Aided List Decoding for Short Blocklengths.
Proceedings of the IEEE International Conference on Communications, 2022

Neural Normalized Min-Sum Message-Passing vs. Viterbi Decoding for the CCSDS Line Product Code.
Proceedings of the IEEE International Conference on Communications, 2022

CRC-Aided List Decoding of Convolutional and Polar Codes for Short Messages in 5G.
Proceedings of the IEEE International Conference on Communications, 2022

Shaped TCM with List Decoding that Exceeds the RCU Bound by Optimizing a Union Bound on FER.
Proceedings of the IEEE Global Communications Conference, 2022

CRC-Aided Short Convolutional Codes and RCU Bounds for Orthogonal Signaling.
Proceedings of the IEEE Global Communications Conference, 2022

Optimizing Write Voltages for Independent, Equal-Rate Pages in Flash Memory.
Proceedings of the 56th Asilomar Conference on Signals, Systems, and Computers, ACSSC 2022, Pacific Grove, CA, USA, October 31, 2022

2021
Causal (Progressive) Encoding over BinarySymmetric Channels with Noiseless Feedback.
CoRR, 2021

Neural-Network-Optimized Degree-Specific Weights for LDPC MinSum Decoding.
Proceedings of the 11th International Symposium on Topics in Coding, 2021

Causal (Progressive) Encoding over Binary Symmetric Channels with Noiseless Feedback.
Proceedings of the IEEE International Symposium on Information Theory, 2021

Timely Transmissions Using Optimized Variable Length Coding.
Proceedings of the 2021 IEEE Conference on Computer Communications Workshops, 2021

FPGA Implementations of Layered MinSum LDPC Decoders Using RCQ Message Passing.
Proceedings of the IEEE Global Communications Conference, 2021

2020
Capacities and Optimal Input Distributions for Particle-Intensity Channels.
IEEE Trans. Mol. Biol. Multi Scale Commun., 2020

Decoding Rate-Compatible 5G-LDPC Codes With Coarse Quantization Using the Information Bottleneck Method.
IEEE Open J. Commun. Soc., 2020

Finite-Support Capacity-Approaching Distributions for AWGN Channels.
CoRR, 2020

Probabilistically Shaped 4-PAM for Short-Reach IM/DD Links with a Peak Power Constraint.
CoRR, 2020

Finite-Support Capacity-Approaching Distributions for AWGN Channels.
Proceedings of the IEEE Information Theory Workshop, 2020

Finite-Blocklength Performance of Sequential Transmission over BSC with Noiseless Feedback.
Proceedings of the IEEE International Symposium on Information Theory, 2020

An Efficient Algorithm for Designing Optimal CRCs for Tail-Biting Convolutional Codes.
Proceedings of the IEEE International Symposium on Information Theory, 2020

Low Complexity Algorithms for Transmission of Short Blocks over the BSC with Full Feedback.
Proceedings of the IEEE International Symposium on Information Theory, 2020

Information Bottleneck Decoding of Rate-Compatible 5G-LDPC Codes.
Proceedings of the 2020 IEEE International Conference on Communications, 2020

A Reconstruction-Computation-Quantization (RCQ) Approach to Node Operations in LDPC Decoding.
Proceedings of the IEEE Global Communications Conference, 2020

Comparison of Integrated and Independent RF/FSO Transceivers on a Fading Optical Channel.
Proceedings of the 54th Asilomar Conference on Signals, Systems, and Computers, 2020

2019
Quasi-Cyclic Protograph-Based Raptor-Like LDPC Codes for Short Block-Lengths.
IEEE Trans. Inf. Theory, 2019

Variable-Length Coding With Shared Incremental Redundancy: Design Methods and Examples.
IEEE Trans. Commun., 2019

A Systematic Approach to Incremental Redundancy With Application to Erasure Channels.
IEEE Trans. Commun., 2019

Finite-Blocklength Performance of Sequential Transmission over BSC with Noiseless Feedback.
CoRR, 2019

On the Most Informative Boolean Functions of the Very Noisy Channel.
Proceedings of the IEEE International Symposium on Information Theory, 2019

A List-Decoding Approach to Low-Complexity Soft Maximum-Likelihood Decoding of Cyclic Codes.
Proceedings of the 2019 IEEE Global Communications Conference, 2019

Decoding Flash Memory with Progressive Reads and Independent vs. Joint Encoding of Bits in a Cell.
Proceedings of the 2019 IEEE Global Communications Conference, 2019

List-Decoded Tail-Biting Convolutional Codes with Distance-Spectrum Optimal CRCS for 5G.
Proceedings of the 2019 IEEE Global Communications Conference, 2019

2018
Joint Design of Convolutional Code and CRC under Serial List Viterbi Decoding.
CoRR, 2018

Efficient Binomial Channel Capacity Computation with an Application to Molecular Communication.
Proceedings of the 2018 Information Theory and Applications Workshop, 2018

Linear Rate-Compatible Codes with Degree-1 Extending Variable Nodes Under Iterative Decoding.
Proceedings of the 2018 IEEE International Symposium on Information Theory, 2018

A Systematic Approach to Incremental Redundancy over Erasure Channels.
Proceedings of the 2018 IEEE International Symposium on Information Theory, 2018

Serial List Viterbi Decoding with CRC: Managing Errors, Erasures, and Complexity.
Proceedings of the IEEE Global Communications Conference, 2018

Transmission Lengths That Maximize Throughput of Variable-Length Coding & ACK/NACK Feedback.
Proceedings of the IEEE Global Communications Conference, 2018

Channel Code Analysis and Design Using Multiple Variable-Length Codes in Parallel without Feedback.
Proceedings of the IEEE Global Communications Conference, 2018

Efficient Computation of Convolutional Decoder Reliability Without a CRC.
Proceedings of the 52nd Asilomar Conference on Signals, Systems, and Computers, 2018

2017
Allocating Redundancy Between Erasure Coding and Channel Coding When Fading Channel Diversity Grows With Codeword Length.
IEEE Trans. Commun., 2017

Sequential differential optimization of incremental redundancy transmission lengths: An example with tail-biting convolutional codes.
Proceedings of the 2017 Information Theory and Applications Workshop, 2017

An information density approach to analyzing and optimizing incremental redundancy with feedback.
Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017

Approaching capacity using incremental redundancy without feedback.
Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017

Design of improved quasi-cyclic protograph-based Raptor-like LDPC codes for short block-lengths.
Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017

2016
Using Dynamic Allocation of Write Voltage to Extend Flash Memory Lifetime.
IEEE Trans. Commun., 2016

Optimizing Transmission Lengths for Limited Feedback With Nonbinary LDPC Examples.
IEEE Trans. Commun., 2016

Optimizing Transmission Lengths for Limited Feedback with Non-Binary LDPC Examples.
CoRR, 2016

Optimality and Rate-Compatibility for Erasure-Coded Packet Transmissions when Fading Channel Diversity Increases with Packet Length.
CoRR, 2016

Some results on spatially coupled protograph LDPC codes.
Proceedings of the 2016 Information Theory and Applications Workshop, 2016

Universal rate-compatible LDPC code families for any increment ordering.
Proceedings of the 9th International Symposium on Turbo Codes and Iterative Information Processing, 2016

2015
Variable-Length Convolutional Coding for Short Blocklengths With Decision Feedback.
IEEE Trans. Commun., 2015

Convolutional-Code-Specific CRC Code Design.
IEEE Trans. Commun., 2015

Protograph-Based Raptor-Like LDPC Codes.
IEEE Trans. Commun., 2015

Protograph-based Raptor-like LDPC codes for the binary erasure channel.
Proceedings of the 2015 Information Theory and Applications Workshop, 2015

RCA analysis of the polar codes and the use of feedback to aid polarization at short blocklengths.
Proceedings of the IEEE International Symposium on Information Theory, 2015

On the girth of (3, L) quasi-cyclic LDPC codes based on complete protographs.
Proceedings of the IEEE International Symposium on Information Theory, 2015

Histogram-based Flash channel estimation.
Proceedings of the 2015 IEEE International Conference on Communications, 2015

Optimizing pilot length for a Go/No-Go decision in two-state block fading channels with feedback.
Proceedings of the 2015 IEEE International Conference on Communications, 2015

Dynamic voltage allocation with quantized voltage levels and simplified channel modeling.
Proceedings of the 49th Asilomar Conference on Signals, Systems and Computers, 2015

2014
Coded Cooperative Data Exchange in Multihop Networks.
IEEE Trans. Inf. Theory, 2014

Reliability-Output Decoding of Tail-Biting Convolutional Codes.
IEEE Trans. Commun., 2014

Enhanced Precision Through Multiple Reads for LDPC Decoding in Flash Memories.
IEEE J. Sel. Areas Commun., 2014

Feedback systems using non-binary LDPC codes with a limited number of transmissions.
Proceedings of the 2014 IEEE Information Theory Workshop, 2014

Increasing flash memory lifetime by dynamic voltage allocation for constant mutual information.
Proceedings of the 2014 Information Theory and Applications Workshop, 2014

Optimized degree distributions for binary and non-binary LDPC codes in Flash memory.
Proceedings of the International Symposium on Information Theory and its Applications, 2014

Short-blocklength non-binary LDPC codes with feedback-dependent incremental transmissions.
Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

Design of high-rate irregular non-binary LDPC codes using algorithmic stopping-set cancellation.
Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

Asymptotic expansion and error exponent for two-phase feedback codes on DMCs.
Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

Achievability bounds for rate-compatible codes.
Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

2013
Optimal Encoding for Discrete Degraded Broadcast Channels.
IEEE Trans. Inf. Theory, 2013

The Cycle Consistency Matrix Approach to Absorbing Sets in Separable Circulant-Based LDPC Codes.
IEEE Trans. Inf. Theory, 2013

Reliability-output Decoding of Tail-biting Codes.
CoRR, 2013

Feedback Communication Systems with Limitations on Incremental Redundancy.
CoRR, 2013

Firing the genie: Two-phase short-blocklength convolutional coding with feedback.
Proceedings of the 2013 Information Theory and Applications Workshop, 2013

Reliability-based error detection for feedback communication with low latency.
Proceedings of the 2013 IEEE International Symposium on Information Theory, 2013

Variable-length coding with feedback: Finite-length codewords and periodic decoding.
Proceedings of the 2013 IEEE International Symposium on Information Theory, 2013

2012
Nonlinear Trellis Codes for Binary-Input Binary-Output Multiple-Access Channels with Single-User Decoding.
IEEE Trans. Commun., 2012

LDPC Decoding with Limited-Precision Soft Information in Flash Memories
CoRR, 2012

The Cycle Consistency Matrix Approach to LDPC Absorbing Sets in Separable Circulant-Based Codes
CoRR, 2012

Mutual-Information Optimized Quantization for LDPC Decoding of Accurately Modeled Flash Data
CoRR, 2012

Chernoff bounds for analysis of rate-compatible sphere-packing with numerous transmissions.
Proceedings of the 2012 IEEE Information Theory Workshop, 2012

A rate-compatible sphere-packing analysis of feedback coding with limited retransmissions.
Proceedings of the 2012 IEEE International Symposium on Information Theory, 2012

Protograph-based Raptor-like LDPC codes with low thresholds.
Proceedings of IEEE International Conference on Communications, 2012

2011
Optimal Allocation of Redundancy Between Packet-Level Erasure Coding and Physical-Layer Channel Coding in Fading Channels.
IEEE Trans. Commun., 2011

Designing Nonlinear Turbo Codes with a Target Ones Density
CoRR, 2011

Superposition coding to support multiple streams, priorities, and channel capacities in the context of GMSK.
Proceedings of the MILCOM 2011, 2011

LDPC absorbing sets, the null space of the cycle consistency matrix, and Tanner's constructions.
Proceedings of the Information Theory and Applications Workshop, 2011

Incremental redundancy: A comparison of a sphere-packing analysis and convolutional codes.
Proceedings of the Information Theory and Applications Workshop, 2011

Absorbing set spectrum approach for practical code design.
Proceedings of the 2011 IEEE International Symposium on Information Theory Proceedings, 2011

Multiterminal source coding with an entropy-based distortion measure.
Proceedings of the 2011 IEEE International Symposium on Information Theory Proceedings, 2011

Controlling LDPC Absorbing Sets via the Null Space of the Cycle Consistency Matrix.
Proceedings of IEEE International Conference on Communications, 2011

A Sphere-Packing Analysis of Incremental Redundancy with Feedback.
Proceedings of IEEE International Conference on Communications, 2011

Soft Information for LDPC Decoding in Flash: Mutual-Information Optimized Quantization.
Proceedings of the Global Communications Conference, 2011

On q-ary LDPC Code Design for a Low Error Floor.
Proceedings of the Global Communications Conference, 2011

Protograph-Based Raptor-Like LDPC Codes for Rate Compatibility with Short Blocklengths.
Proceedings of the Global Communications Conference, 2011

Minimizing weighted sum finish time for one-to-many file transfer in peer-to-peer networks.
Proceedings of the 49th Annual Allerton Conference on Communication, 2011

Weighted universal recovery, practical secrecy, and an efficient algorithm for solving both.
Proceedings of the 49th Annual Allerton Conference on Communication, 2011

2010
LDPC Decoders with Informed Dynamic Scheduling.
IEEE Trans. Commun., 2010

Minimizing weighted sum delay for one-to-many file transfer in peer-to-peer networks
CoRR, 2010

A deterministic approach to rate-compatible fountain communication.
Proceedings of the Information Theory and Applications Workshop, 2010

Efficient universal recovery in broadcast networks.
Proceedings of the 48th Annual Allerton Conference on Communication, 2010

2009
Multiple-rate low-density parity-check codes with constant blocklength.
IEEE Trans. Commun., 2009

The Single Source Two Terminal Network with Network Coding
CoRR, 2009

Optimal natural encoding scheme for discrete multiplicative degraded broadcast channels.
Proceedings of the IEEE International Symposium on Information Theory, 2009

A Cross-Layer Perspective on Rateless Coding for Wireless Channels.
Proceedings of IEEE International Conference on Communications, 2009

2008
Optimal Transmission Strategy and Explicit Capacity Region for Broadcast Z Channels.
IEEE Trans. Inf. Theory, 2008

Universal serially concatenated trellis coded modulation for space-time channels.
IEEE Trans. Commun., 2008

Demonstration of Uncoordinated Multiple Access in Optical Communications.
IEEE Trans. Circuits Syst. I Regul. Pap., 2008

Optimal Independent Encoding Schemes for Several Classes of Discrete Degraded Broadcast Channels
CoRR, 2008

Analytical Framework for Optimizing Weighted Average Download Time in Peer-to-Peer Networks
CoRR, 2008

Nonlinear Turbo Codes for Higher-Order Modulations.
Proceedings of IEEE International Conference on Communications, 2008

Lower-Complexity Layered Belief-Propagation Decoding of LDPC Codes.
Proceedings of IEEE International Conference on Communications, 2008

2007
A Study on Universal Codes With Finite Block Lengths.
IEEE Trans. Inf. Theory, 2007

The Universal Operation of LDPC Codes Over Scalar Fading Channels.
IEEE Trans. Commun., 2007

A Tighter Bhattacharyya Bound for Decoding Error Probability.
IEEE Commun. Lett., 2007

Informed Dynamic Scheduling for Belief-Propagation Decoding of LDPC Codes.
Proceedings of IEEE International Conference on Communications, 2007

On the Design of Arbitrarily Low-Rate Turbo-Codes.
Proceedings of the Global Communications Conference, 2007

2006
Universal Space-Time Codes From Demultiplexed Trellis Codes.
IEEE Trans. Commun., 2006

Surrogate-channel design of universal LDPC codes.
IEEE Commun. Lett., 2006

Trellis Codes with Low Ones Density for the OR Multiple Access Channel.
Proceedings of the Proceedings 2006 IEEE International Symposium on Information Theory, 2006

Universal Space-Time Serially Concatenated Trellis Coded Modulations.
Proceedings of the Global Telecommunications Conference, 2006. GLOBECOM '06, San Francisco, CA, USA, 27 November, 2006

Non-linear Turbo Codes for Interleaver-Division Multiple Access on the OR Channel.
Proceedings of the Global Telecommunications Conference, 2006. GLOBECOM '06, San Francisco, CA, USA, 27 November, 2006

High Speed Channel Coding Architectures for the Uncoordinated OR Channel.
Proceedings of the 2006 IEEE International Conference on Application-Specific Systems, 2006

2005
Correction to "Universal trellis codes for diagonally layered space-time systems".
IEEE Trans. Signal Process., 2005

On the capacity of network coding for random networks.
IEEE Trans. Inf. Theory, 2005

Hamming codes are rate-efficient array codes.
Proceedings of the Global Telecommunications Conference, 2005. GLOBECOM '05, St. Louis, Missouri, USA, 28 November, 2005

Dual-mode decoding of product codes with application to tape storage.
Proceedings of the Global Telecommunications Conference, 2005. GLOBECOM '05, St. Louis, Missouri, USA, 28 November, 2005

2004
Reduced-state representations for trellis codes using constellation symmetry.
IEEE Trans. Commun., 2004

Selective avoidance of cycles in irregular LDPC code construction.
IEEE Trans. Commun., 2004

Superposition turbo TCM for multirate broadcast.
IEEE Trans. Commun., 2004

Efficient Computation of Trellis Code Generating Functions.
IEEE Trans. Commun., 2004

Streaming Encryption for a Secure Wavelength and Time Domain Hopped Optical Network.
Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC'04), 2004

Analysis of an algorithm for irregular LDPC code construction.
Proceedings of the 2004 IEEE International Symposium on Information Theory, 2004

Rotationally invariant space time constellations.
Proceedings of the 2004 IEEE International Symposium on Information Theory, 2004

Construction of short block length irregular low-density parity-check codes.
Proceedings of IEEE International Conference on Communications, 2004

Channel-eigenvector invariant space time constellations.
Proceedings of the Global Telecommunications Conference, 2004. GLOBECOM '04, Dallas, Texas, USA, 29 November, 2004

Universal space-time codes from two-dimensional trellis codes.
Proceedings of the Global Telecommunications Conference, 2004. GLOBECOM '04, Dallas, Texas, USA, 29 November, 2004

2003
Universal trellis codes for diagonally layered space-time systems.
IEEE Trans. Signal Process., 2003

Universal space-time trellis codes.
IEEE Trans. Inf. Theory, 2003

Construction of irregular LDPC codes with low error floors.
Proceedings of IEEE International Conference on Communications, 2003

Superposition turbo TCM for multi-rate broadcast.
Proceedings of IEEE International Conference on Communications, 2003

Further error event diagram reduction using algorithmic techniques.
Proceedings of IEEE International Conference on Communications, 2003

Serially concatenated trellis coded modulation for the compound periodic erasures channel.
Proceedings of IEEE International Conference on Communications, 2003

2002
Multi-input multi-output fading channel tracking and equalization using Kalman estimation.
IEEE Trans. Signal Process., 2002

Optimal bi-level quantization of i.i.d. sensor observations for binary hypothesis testing.
IEEE Trans. Inf. Theory, 2002

Speech transmission using rate-compatible trellis codes and embedded source coding.
IEEE Trans. Commun., 2002

Reduced complexity iterative demodulation and decoding of serial concatenated continuous phase modulation.
Proceedings of the IEEE International Conference on Communications, 2002

Trellis coding for diagonally layered space-time systems.
Proceedings of the IEEE International Conference on Communications, 2002

Robustness of LDPC codes on periodic fading channels.
Proceedings of the Global Telecommunications Conference, 2002

2001
Constellation labeling for linear encoders.
IEEE Trans. Inf. Theory, 2001

Quasi-convexity and optimal binary fusion for distributed detection with identical sensors in generalized Gaussian noise.
IEEE Trans. Inf. Theory, 2001

Adaptive bit-interleaved coded modulation.
IEEE Trans. Commun., 2001

Turbo-encoder design for symbol-interleaved parallel concatenated trellis-coded modulation.
IEEE Trans. Commun., 2001

Joint iterative channel estimation and decoding in flat correlated Rayleigh fading.
IEEE J. Sel. Areas Commun., 2001

Robustness of space-time turbo codes.
Proceedings of the IEEE International Conference on Communications, 2001

Bandwidth-efficient, low-latency adaptive coded modulation schemes for time-varying channels.
Proceedings of the IEEE International Conference on Communications, 2001

Code design metrics for space-time systems under arbitrary fading.
Proceedings of the IEEE International Conference on Communications, 2001

Turbo codes with non-uniform constellations.
Proceedings of the IEEE International Conference on Communications, 2001

Minimality for punctured convolutional codes.
Proceedings of the IEEE International Conference on Communications, 2001

Trellis turbo-codes in flat Rayleigh fading with diversity.
Proceedings of the Global Telecommunications Conference, 2001

Bit vs. symbol interleaving for parallel concatenated trellis coded modulation.
Proceedings of the Global Telecommunications Conference, 2001

2000
Trellis codes for periodic erasures.
IEEE Trans. Commun., 2000

Parallel concatenated turbo codes for continuous phase modulation.
Proceedings of the 2000 IEEE Wireless Communications and Networking Conference, 2000

Edge Profile Optimal Constellation Labeling.
Proceedings of the 2000 IEEE International Conference on Communications: Global Convergence Through Communications, 2000

Adaptive Multi-Input Multi-Output Fading Channel Equalization Using Kalman Estimation.
Proceedings of the 2000 IEEE International Conference on Communications: Global Convergence Through Communications, 2000

1999
Trellis code design for periodic interleavers.
IEEE Commun. Lett., 1999

Embedded joint source-channel coding of speech using symbol puncturing of trellis codes.
Proceedings of the 1999 IEEE International Conference on Acoustics, 1999

1998
Achievable Rates for Tomlinson-Harashima Precoding.
IEEE Trans. Inf. Theory, 1998

1994
Bayes Risk Weighted VQ and Learning VQ.
Proceedings of the IEEE Data Compression Conference, 1994


  Loading...