Scholars@Duke
Henry Pfister

Henry Pfister

Jeffrey N. Vinik Professor of Electrical and Computer Engineering
Electrical and Computer Engineering
henry.pfister@duke.edu
90984, 315 Gross Hall, Durham, NC 27708
140 Science Dr., 305 Gross Hall, Durham, NC 27708

Selected Publications

Reed-Muller Codes on BMS Channels Achieve Vanishing Bit-Error Probability for all Rates Below Capacity

Journal Article IEEE Transactions on Information Theory · February 1, 2024 This paper considers the performance of Reed-Muller (RM) codes transmitted over binary memoryless symmetric (BMS) channels under bitwise maximum-a-posteriori (bit-MAP) decoding. Its main result is that, for a fixed BMS channel, the family of binary RM code ... Full text Cite

Attacks on Perception-Based Control Systems: Modeling and Fundamental Limits

Journal Article IEEE Transactions on Automatic Control · January 1, 2024 We study the performance of perception-based control systems in the presence of attacks and provide methods for modeling and analysis of their resiliency to stealthy attacks on both physical and perception-based sensing. Specifically, we consider a general ... Full text Cite

Quantum State Compression with Polar Codes

Conference IEEE International Symposium on Information Theory - Proceedings · January 1, 2024 In the quantum compression scheme proposed by Schumacher, Alice compresses a message that Bob decompresses. In that approach, there is some probability of failure and, even when successful, some distortion of the state. For sufficiently large blocklengths, ... Full text Cite

Belief Propagation Decoding of Quantum LDPC Codes with Guided Decimation

Conference IEEE International Symposium on Information Theory - Proceedings · January 1, 2024 Quantum low-density parity-check (QLDPC) codes have emerged as a promising technique for quantum error correction. A variety of decoders have been proposed for QLDPC codes and many utilize belief propagation (BP) decoding in some fashion. However, the use ... Full text Cite

Code Rate Optimization via Neural Polar Decoders

Conference IEEE International Symposium on Information Theory - Proceedings · January 1, 2024 In this work, we explore the enhancement of polar codes for channels with memory, focusing on achieving low decoding complexity and optimizing input distributions for maximum transmission rates. Polar codes are known for their efficient decoding, exhibitin ... Full text Cite

Data-driven Neural Polar Decoders for Unknown Channels with and without Memory

Journal Article IEEE Transactions on Information Theory · January 1, 2024 In this work, a novel data-driven methodology for designing neural polar decoders for channels with and without memory is proposed. The methodology is suitable for the case where the channel is given as a "black-box"and the designer has access to the chann ... Full text Cite

Successive Cancellation Decoding of Single Parity-Check Product Codes: Analysis and Improved Decoding

Journal Article IEEE Transactions on Information Theory · February 1, 2023 A product code with single parity-check component codes can be described via the tools of a multi-kernel polar code, where the rows of the generator matrix are chosen according to the constraints imposed by the product code construction. Following this obs ... Full text Cite

Achieving Capacity on Non-Binary Channels with Generalized Reed-Muller Codes

Conference IEEE International Symposium on Information Theory - Proceedings · January 1, 2023 Recently, the authors showed that Reed-Muller (RM) codes achieve capacity on binary memoryless symmetric (BMS) channels with respect to bit error rate. This paper extends that work by showing that RM codes defined on non-binary fields, known as generalized ... Full text Cite

Data-Driven Polar Codes for Unknown Channels With and Without Memory

Conference IEEE International Symposium on Information Theory - Proceedings · January 1, 2023 In this work, a novel data-driven methodology for designing polar codes is proposed. The methodology is suitable for the case where the channel is given as a "black-box"and the designer has access to the channel for generating observations of its inputs an ... Full text Cite

Belief-Propagation with Quantum Messages for Polar Codes on Classical-Quantum Channels

Conference IEEE International Symposium on Information Theory - Proceedings · January 1, 2023 This paper considers the design and decoding of polar codes for general classical-quantum (CQ) channels. It focuses on decoding via belief-propagation with quantum messages (BPQM) and, in particular, the idea of paired-measurement BPQM (PM-BPQM) decoding. ... Full text Cite

Belief Propagation for Classical and Quantum Systems: Overview and Recent Results

Journal Article IEEE BITS the Information Theory Magazine · December 1, 2022 Full text Cite

An Information-Theoretic Perspective on Successive Cancellation List Decoding and Polar Code Design

Journal Article IEEE Transactions on Information Theory · September 1, 2022 This work identifies information-theoretic quantities that are closely related to the required list size on average for successive cancellation list (SCL) decoding to implement maximum-likelihood decoding over general binary memoryless symmetric (BMS) chan ... Full text Cite

Adaptive procedures for discriminating between arbitrary tensor-product quantum states

Journal Article Physical Review A · July 1, 2022 Discriminating between quantum states is a fundamental task in quantum information theory. Given two quantum states ρ+ and ρ-, the Helstrom measurement distinguishes between them with minimal probability of error. However, finding and experimentally implem ... Full text Cite

Polar Codes for the Deletion Channel: Weak and Strong Polarization

Journal Article IEEE Transactions on Information Theory · April 1, 2022 This paper presents the first proof of polarization for the deletion channel with a constant deletion rate and a regular hidden-Markov input distribution. A key part of this work involves representing the deletion channel using a trellis and describing the ... Full text Cite

Reinforcement Learning with Neural Networks for Quantum Multiple Hypothesis Testing

Journal Article Quantum · January 1, 2022 Reinforcement learning with neural networks (RLNN) has recently demonstrated great promise for many problems, including some problems in quantum information theory. In this work, we apply RLNN to quantum hypothesis testing and determine the optimal measure ... Full text Cite

Belief Propagation with Quantum Messages for Symmetric Classical-Quantum Channels

Conference 2022 IEEE Information Theory Workshop, ITW 2022 · January 1, 2022 Belief propagation (BP) is a classical algorithm that approximates the marginal distribution associated with a factor graph by passing messages between adjacent nodes in the graph. It gained popularity in the 1990's as a powerful decoding algorithm for LDP ... Full text Cite

Resiliency of Perception-Based Controllers Against Attacks

Conference Proceedings of Machine Learning Research · January 1, 2022 This work focuses on resiliency of learning-enabled perception-based controllers for nonlinear dynamical systems. We consider systems equipped with an end-to-end controller, mapping the perception (e.g., camera images) and sensor measurements to control in ... Cite

Belief propagation with quantum messages for quantum-enhanced classical communications

Journal Article npj Quantum Information · December 1, 2021 For space-based laser communications, when the mean photon number per received optical pulse is much smaller than one, there is a large gap between communications capacity achievable with a receiver that performs individual pulse-by-pulse detection, and th ... Full text Cite

Reed-Muller Codes on BMS Channels Achieve Vanishing Bit-Error Probability for All Rates Below Capacity

Conference · October 27, 2021 Featured Publication This paper considers the performance of Reed-Muller (RM) codes transmitted over binary memoryless symmetric (BMS) channels under bitwise maximum-a-posteriori (bit-MAP) decoding. Its main result is that, for a fixed BMS channel, the family of binary RM code ... Link to item Cite

Polar Codes for Channels with Insertions, Deletions, and Substitutions

Journal Article IEEE International Symposium on Information Theory - Proceedings · July 12, 2021 This paper presents a coding scheme for an insertion deletion substitution channel. We extend a previous scheme for the deletion channel where polar codes are modified by adding 'guard bands' between segments. In the new scheme, each guard band is comprise ... Full text Cite

Trellis BMA: Coded Trace Reconstruction on IDS Channels for DNA Storage

Journal Article IEEE International Symposium on Information Theory - Proceedings · July 12, 2021 Sequencing a DNA strand, as part of the read process in DNA storage, produces multiple noisy copies which can be combined to produce better estimates of the original strand; this is called trace reconstruction. One can reduce the error rate further by intr ... Full text Cite

On the Duality between the BSC and Quantum PSC

Conference IEEE International Symposium on Information Theory - Proceedings · July 12, 2021 In 2018, Renes [IEEE Trans. Inf. Theory, vol. 64, no. 1, pp. 577-592 (2018)] developed a general theory of channel duality for classical-input quantum-output channels. His result shows that a number of well-known duality results for linear codes on the bin ... Full text Cite

Hölder Bounds for Sensitivity Analysis in Causal Reasoning

Journal Article · July 9, 2021 We examine interval estimation of the effect of a treatment T on an outcome Y given the existence of an unobserved confounder U. Using H\"older's inequality, we derive a set of bounds on the confounding bias |E[Y|T=t]-E[Y|do(T=t)]| based on the degree of u ... Open Access Link to item Cite

Pruning and Quantizing Neural Belief Propagation Decoders

Journal Article IEEE Journal on Selected Areas in Communications · July 1, 2021 We consider near maximum-likelihood (ML) decoding of short linear block codes. In particular, we propose a novel decoding approach based on neural belief propagation (NBP) decoding recently introduced by Nachmani et al. in which we allow a different parity ... Full text Cite

A Belief Propagation-based Quantum Joint-Detection Receiver for Superadditive Optical Communications

Conference 2021 Conference on Lasers and Electro-Optics, CLEO 2021 - Proceedings · May 1, 2021 We design a quantum joint-detection receiver for binary-phase-shift-keyed optical communications using belief propagation with quantum messages. For an exemplary tree code, the receiver attains the block-Helstrom limit in discriminating the codewords and a ... Cite

A Belief Propagation-based Quantum Joint-Detection Receiver for Superadditive Optical Communications

Conference 2021 Conference on Lasers and Electro-Optics, CLEO 2021 - Proceedings · May 1, 2021 We design a quantum joint-detection receiver for binary-phase-shift-keyed optical communications using belief propagation with quantum messages. For an exemplary tree code, the receiver attains the block-Helstrom limit in discriminating the codewords and a ... Full text Cite

An Information-Theoretic Perspective on Successive Cancellation List Decoding and Polar Code Design

Journal Article · March 30, 2021 This work identifies information-theoretic quantities that are closely related to the required list size on average for successive cancellation list (SCL) decoding to implement maximum-likelihood decoding over general binary memoryless symmetric (BMS) chan ... Link to item Cite

A Semiclassical Proof of Duality Between the Classical BSC and the Quantum PSC

Journal Article · March 16, 2021 In 2018, Renes [IEEE Trans. Inf. Theory, vol. 64, no. 1, pp. 577-592 (2018)] (arXiv:1701.05583) developed a general theory of channel duality for classical-input quantum-output (CQ) channels. That result showed that a number of well-known duality results f ... Link to item Cite

Model-Based Machine Learning for Joint Digital Backpropagation and PMD Compensation

Journal Article Journal of Lightwave Technology · February 15, 2021 In this article, we propose a model-based machine-learning approach for dual-polarization systems by parameterizing the split-step Fourier method for the Manakov-PMD equation. The resulting method combines hardware-friendly time-domain nonlinearity mitigat ... Full text Cite

Physics-Based Deep Learning for Fiber-Optic Communication Systems

Journal Article IEEE Journal on Selected Areas in Communications · January 1, 2021 We propose a new machine-learning approach for fiber-optic communication systems whose signal propagation is governed by the nonlinear Schrödinger equation (NLSE). Our main observation is that the popular split-step method (SSM) for numerically solving the ... Full text Cite

Learned decimation for neural belief propagation decoders (invited paper)

Conference ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings · January 1, 2021 We introduce a two-stage decimation process to improve the performance of neural belief propagation (NBP), recently introduced by Nachmani et al., for short low-density paritycheck (LDPC) codes. In the first stage, we build a list by iterating between a co ... Full text Cite

A belief propagation-based quantum joint-detection receiver for superadditive optical communications

Conference Optics InfoBase Conference Papers · January 1, 2021 We design a quantum joint-detection receiver for binary-phase-shift-keyed optical communications using belief propagation with quantum messages. For an exemplary tree code, the receiver attains the block-Helstrom limit in discriminating the codewords and a ... Cite

Understanding Phase Transitions via Mutual Information and MMSE

Chapter · January 1, 2021 The ability to understand and solve high-dimensional inference problems is essential for modern data science. This chapter examines high-dimensional inference problems through the lens of information theory and focuses on the standard linear model as a can ... Full text Cite

Learned Decimation for Neural Belief Propagation Decoders

Journal Article · November 4, 2020 We introduce a two-stage decimation process to improve the performance of neural belief propagation (NBP), recently introduced by Nachmani et al., for short low-density parity-check (LDPC) codes. In the first stage, we build a list by iterating between a c ... Link to item Cite

Kerdock Codes Determine Unitary 2-Designs

Journal Article IEEE Transactions on Information Theory · October 1, 2020 The non-linear binary Kerdock codes are known to be Gray images of certain extended cyclic codes of length N = 2m over Z4. We show that exponentiating these Z4-valued codewords by i ≜-1 produces stabilizer states, that are quantum states obtained using onl ... Full text Cite

Successive Cancellation Decoding of Single Parity-Check Product Codes: Analysis and Improved Decoding

Journal Article · August 16, 2020 A product code with single parity-check component codes can be described via the tools of a multi-kernel polar code, where the rows of the generator matrix are chosen according to the constraints imposed by the product code construction. Following this obs ... Link to item Cite

On optimality of css codes for transversal t

Journal Article IEEE Journal on Selected Areas in Information Theory · August 1, 2020 In order to perform universal fault-tolerant quantum computation, one needs to implement a logical non-Clifford gate. Consequently, it is important to understand codes that implement such gates transversally. In this paper, we adopt an algebraic approach t ... Full text Cite

Bounds on the List Size of Successive Cancellation List Decoding

Conference SPCOM 2020 - International Conference on Signal Processing and Communications · July 1, 2020 Successive cancellation list decoding of polar codes provides very good performance for short to moderate block lengths. However, the list size required to approach the performance of maximum-likelihood decoding is still not well understood theoretically. ... Full text Cite

Revisiting Efficient Multi-Step Nonlinearity Compensation with Machine Learning: An Experimental Demonstration

Journal Article Journal of Lightwave Technology · June 15, 2020 Efficient nonlinearity compensation in fiber-optic communication systems is considered a key element to go beyond the 'capacity crunch'. One guiding principle for previous work on the design of practical nonlinearity compensation schemes is that fewer step ... Full text Cite

Adaptive Procedures for Discriminating Between Arbitrary Tensor-Product Quantum States

Journal Article IEEE International Symposium on Information Theory - Proceedings · June 1, 2020 Discriminating between quantum states is a fundamental task in quantum information theory. Given two quantum states, ρ+ and ρ-, the Helstrom measurement distinguishes between them with minimal probability of error. However, finding and experimentally imple ... Full text Cite

Classical Coding Problem from Transversal T Gates

Journal Article IEEE International Symposium on Information Theory - Proceedings · June 1, 2020 Universal quantum computation requires the implementation of a logical non-Clifford gate. In this paper, we characterize all stabilizer codes whose code subspaces are preserved under physical T and T† gates. For example, this could enable magic state disti ... Full text Cite

Pruning Neural Belief Propagation Decoders

Journal Article IEEE International Symposium on Information Theory - Proceedings · June 1, 2020 We consider near maximum-likelihood (ML) decoding of short linear block codes based on neural belief propagation (BP) decoding recently introduced by Nachmani et al.. While this method significantly outperforms conventional BP decoding, the underlying pari ... Full text Cite

Successive Cancellation Inactivation Decoding for Modified Reed-Muller and eBCH Codes

Journal Article IEEE International Symposium on Information Theory - Proceedings · June 1, 2020 A successive cancellation (SC) decoder with inactivations is proposed as an efficient implementation of SC list (SCL) decoding over the binary erasure channel. The proposed decoder assigns a dummy variable to an information bit whenever it is erased during ... Full text Cite

Quantum Advantage via Qubit Belief Propagation

Conference IEEE International Symposium on Information Theory - Proceedings · June 1, 2020 Quantum technologies are maturing by the day and their near-term applications are now of great interest. Deep-space optical communication involves transmission over the pure-state classical-quantum channel. For optimal detection, a joint measurement on all ... Full text Cite

Decoding Reed-Muller Codes Using Redundant Code Constraints

Conference IEEE International Symposium on Information Theory - Proceedings · June 1, 2020 The recursive projection-aggregation (RPA) decoding algorithm for Reed-Muller (RM) codes was recently introduced by Ye and Abbe. We show that the RPA algorithm is closely related to (weighted) belief-propagation (BP) decoding by interpreting it as a messag ... Full text Cite

Reinforcement Learning with Neural Networks for Quantum Multiple Hypothesis Testing

Conference IEEE International Symposium on Information Theory - Proceedings · June 1, 2020 Reinforcement learning with neural networks (RLNN) has recently demonstrated great promise for many problems, including some problems in quantum information theory. In this work, we apply reinforcement learning to quantum hypothesis testing, where one desi ... Full text Cite

Efficient Maximum-Likelihood Decoding of Reed-Muller RM(m-3,m) Codes

Conference IEEE International Symposium on Information Theory - Proceedings · June 1, 2020 Reed-Muller (RM) codes, a classical family of codes known for their elegant algebraic structure, have recently been shown to achieve capacity under maximum-likelihood (ML) decoding on the binary erasure channel and this has rekindled interest in their effi ... Full text Cite

Logical Clifford Synthesis for Stabilizer Codes

Journal Article IEEE Transactions on Quantum Engineering · January 1, 2020 Quantum error-correcting codes are used to protect qubits involved in quantum computation. This process requires logical operators to be translated into physical operators acting on physical quantum states. In this article, we propose a mathematical framew ... Full text Cite

Model-based machine learning for joint digital backpropagation and PMD compensation

Conference Optics InfoBase Conference Papers · January 1, 2020 We propose a model-based machine-learning approach for polarization-multiplexed systems by parameterizing the split-step method for the Manakov-PMD equation. This approach performs hardware-friendly DBP and distributed PMD compensation with performance clo ... Full text Cite

Reinforcement Learning for Channel Coding: Learned Bit-Flipping Decoding

Journal Article 2019 57th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2019 · September 1, 2019 In this paper, we use reinforcement learning to find effective decoding strategies for binary linear codes. We start by reviewing several iterative decoding algorithms that involve a decision-making process at each step, including bit-flipping (BF) decodin ... Full text Cite

Near-Optimal Finite-Length Scaling for Polar Codes Over Large Alphabets

Journal Article IEEE Transactions on Information Theory · September 2019 Full text Cite

Unifying the Clifford hierarchy via symmetric matrices over rings

Journal Article Physical Review A · August 7, 2019 The Clifford hierarchy of unitary operators is a foundational concept for universal quantum computation. It was introduced to show that universal quantum computation can be realized via quantum teleportation, given access to certain standard resources. Whi ... Full text Cite

Understanding Phase Transitions via Mutual Information and MMSE

Journal Article · July 3, 2019 The ability to understand and solve high-dimensional inference problems is essential for modern data science. This article examines high-dimensional inference problems through the lens of information theory and focuses on the standard linear model as a can ... Link to item Cite

Learned Belief-Propagation Decoding with Simple Scaling and SNR Adaptation

Journal Article IEEE International Symposium on Information Theory - Proceedings · July 1, 2019 We consider the weighted belief-propagation (WBP) decoder recently proposed by Nachmani et al. where different weights are introduced for each Tanner graph edge and optimized using machine learning techniques. Our focus is on simple-scaling models that use ... Full text Cite

Kerdock Codes Determine Unitary 2-Designs

Journal Article IEEE International Symposium on Information Theory - Proceedings · July 1, 2019 The binary non-linear Kerdock codes are Gray images of {\mathbb{Z}-4}-linear Kerdock codes of length N =2m. We show that exponentiating \imath = \sqrt { - 1} by these {\mathbb{Z}-4}-valued codewords produces stabilizer states, which are the common eigenvec ... Full text Cite

Polar Codes for the Deletion Channel: Weak and Strong Polarization

Journal Article IEEE International Symposium on Information Theory - Proceedings · July 1, 2019 This paper presents the first proof of polarization for the deletion channel with a constant deletion rate and a regular hidden-Markov input distribution. A key part of this work involves representing the deletion channel using a trellis and describing the ... Full text Cite

The Replica-Symmetric Prediction for Random Linear Estimation With Gaussian Matrices Is Exact

Journal Article IEEE Transactions on Information Theory · April 1, 2019 This paper considers the fundamental limit of random linear estimation for i.i.d. signal distributions and i.i.d. Gaussian measurement matrices. Its main contribution is a rigorous characterization of the asymptotic mutual information (MI) and minimum mean ... Full text Cite

Minimal sets to destroy the k-core in random networks.

Journal Article Physical review. E · February 2019 We study the problem of finding the smallest set of nodes in a network whose removal results in an empty k-core, where the k-core is the subnetwork obtained after the iterative removal of all nodes of degree smaller than k. This problem is also known in th ... Full text Cite

Enhancing Capacity of Spatial Multiplexing Systems Using Reconfigurable Cavity-Backed Metasurface Antennas in Clustered MIMO Channels

Journal Article IEEE Transactions on Communications · February 1, 2019 We propose a spatial multiplexing system using reconfigurable cavity-backed metasurface antennas. The metasurface antennas consist of a printed cavity with dynamically tunable metamaterial radiators patterned on one side and fed by multiple radio frequency ... Full text Cite

Revisiting multi-step nonlinearity compensation with machine learning

Journal Article IET Conference Publications · January 1, 2019 For the efficient compensation of fiber nonlinearity, one of the guiding principles appears to be: fewer steps are better and more efficient. We challenge this assumption and show that carefully designed multi-step approaches can lead to better performance ... Cite

Adversarial Defense of Image Classification Using a Variational Auto-Encoder

Journal Article · December 6, 2018 Deep neural networks are known to be vulnerable to adversarial attacks. This exposes them to potential exploits in security-sensitive applications and highlights their lack of robustness. This paper uses a variational auto-encoder (VAE) to defend against a ... Link to item Cite

ASIC Implementation of Time-Domain Digital Backpropagation with Deep-Learned Chromatic Dispersion Filters

Journal Article European Conference on Optical Communication, ECOC · November 14, 2018 We consider time-domain digital backpropagation with chromatic dispersion filters jointly optimized and quantized using machine-learning techniques. Compared to the baseline implementations, we show improved BER performance and >40% power dissipation reduc ... Full text Cite

Wideband Time-Domain Digital Backpropagation via Subband Processing and Deep Learning

Journal Article European Conference on Optical Communication, ECOC · November 14, 2018 We propose a low-complexity sub-banded DSP architecture for digital backpropagation where the walk-off effect is compensated using simple delay elements. For a simulated 96-Gbaud signal and 2500 km optical link, our method achieves a 2.8 dB SNR improvement ... Full text Cite

Synthesis of Logical Clifford Operators via Symplectic Geometry

Journal Article IEEE International Symposium on Information Theory - Proceedings · August 15, 2018 Quantum error-correcting codes can be used to protect qubits involved in quantum computation. This requires that logical operators acting on protected qubits be translated to physical operators (circuits) acting on physical quantum states. We propose a mat ... Full text Cite

Deep Learning of the Nonlinear Schrödinger Equation in Fiber-Optic Communications

Journal Article IEEE International Symposium on Information Theory - Proceedings · August 15, 2018 An important problem in fiber-optic communications is to invert the nonlinear Schrödinger equation in real time to reverse the deterministic effects of the channel. Interestingly, the popular split-step Fourier method (SSFM) leads to a computation graph th ... Full text Cite

Decoding Reed-Muller Codes Using Minimum- Weight Parity Checks

Journal Article IEEE International Symposium on Information Theory - Proceedings · August 15, 2018 Reed-Muller (RM) codes exhibit good performance under maximum-likelihood (ML) decoding due to their highly-symmetric structure. In this paper, we explore the question of whether the code symmetry of RM codes can also be exploited to achieve near-ML perform ... Full text Cite

Mutual Information as a Function of Matrix SNR for Linear Gaussian Channels

Conference IEEE International Symposium on Information Theory - Proceedings · August 15, 2018 This paper focuses on the mutual information and minimum mean-squared error (MMSE) as a function a matrix-valued signal-to-noise ratio (SNR) for a linear Gaussian channel with arbitrary input distribution. As shown by Lamarca, the mutual-information is a c ... Full text Cite

On Low-Complexity Decoding of Product Codes for High-Throughput Fiber-Optic Systems

Journal Article International Symposium on Turbo Codes and Iterative Information Processing, ISTC · July 2, 2018 We study low-complexity iterative decoding algorithms for product codes. We revisit two algorithms recently proposed by the authors based on bounded distance decoding (BDD) of the component codes that improve the performance of conventional iterative BDD ( ... Full text Cite

What can machine learning teach us about communications?

Journal Article 2018 IEEE Information Theory Workshop, ITW 2018 · July 2, 2018 Rapid improvements in machine learning over the past decade are beginning to have far-reaching effects. For communications, engineers with limited domain expertise can now use off-the-shelf learning packages to design high-performance systems based on simu ... Full text Cite

Approaching Miscorrection-Free Performance of Product Codes with Anchor Decoding

Journal Article IEEE Transactions on Communications · July 1, 2018 Product codes (PCs) protect a 2-D array of bits using short component codes. Assuming transmission over the binary symmetric channel, the decoding is commonly performed by iteratively applying bounded-distance decoding to the component codes. For this codi ... Full text Cite

Nonlinear interference mitigation via deep neural networks

Conference 2018 Optical Fiber Communications Conference and Exposition, OFC 2018 - Proceedings · June 13, 2018 A neural-network-based approach is presented to efficiently implement digital backpropagation (DBP). For a 32×100 km fiber-optic link, the resulting 'learned' DBP significantly reduces the complexity compared to conventional DBP implementations. ... Cite

Nonlinear interference mitigation via deep neural networks

Journal Article Optics InfoBase Conference Papers · January 1, 2018 A neural-network-based approach is presented to efficiently implement digital backpropagation (DBP). For a 32×100 km fiber-optic link, the resulting “learned“ DBP significantly reduces the complexity compared to conventional DBP implementations. ... Full text Cite

Approaching Miscorrection-free Performance of Product and Generalized Product Codes

Journal Article · November 21, 2017 Product codes (PCs) protect a two-dimensional array of bits using short component codes. Assuming transmission over the binary symmetric channel, the decoding is commonly performed by iteratively applying bounded-distance decoding to the component codes. F ... Link to item Cite

Miscorrection-free Decoding of Staircase Codes

Journal Article European Conference on Optical Communication, ECOC · September 21, 2017 We propose a novel decoding algorithm for staircase codes which reduces the effect of undetected component code miscorrections. The algorithm significantly improves performance, while retaining a low-complexity implementation suitable for high-speed optica ... Full text Cite

Cycle-expansion method for the Lyapunov exponent, susceptibility, and higher moments.

Journal Article Physical review. E · September 2017 Lyapunov exponents characterize the chaotic nature of dynamical systems by quantifying the growth rate of uncertainty associated with the imperfect measurement of initial conditions. Finite-time estimates of the exponent, however, experience fluctuations d ... Full text Open Access Cite

Approaching Capacity at High Rates with Iterative Hard-Decision Decoding

Journal Article IEEE Transactions on Information Theory · September 1, 2017 A variety of low-density parity-check (LDPC) ensembles have now been observed to approach capacity with message-passing decoding. However, all of them use soft (i.e., non-binary) messages and a posteriori probability decoding of their component codes. In t ... Full text Cite

Density evolution for deterministic generalized product codes on the binary erasure channel at high rates

Internet Publication · July 1, 2017 Generalized product codes (GPCs) are extensions of product codes (PCs), where code symbols are protected by two component codes but not necessarily arranged in a rectangular array. We consider a deterministic construction of GPCs (as opposed to randomized ... Full text Cite

Reed-muller codes achieve capacity on erasure channels

Journal Article IEEE Transactions on Information Theory · July 1, 2017 We introduce a new approach to proving that a sequence of deterministic linear codes achieves capacity on an erasure channel under maximum a posteriori decoding. Rather than relying on the precise structure of the codes, our method exploits code symmetry. ... Full text Cite

A single-letter upper bound on the feedback capacity of unifilar finite-state channels

Conference IEEE Transactions on Information Theory · March 1, 2017 An upper bound on the feedback capacity of unifilar finite-state channels (FSCs) is derived. A new technique, called the Q-context mapping, is based on a construction of a directed graph that is used for a sequential quantization of the receiver's output s ... Full text Cite

Single-letter bounds on the feedback capacity of unifilar finite-state channels

Conference 2016 IEEE International Conference on the Science of Electrical Engineering, ICSEE 2016 · January 4, 2017 Upper and lower bounds on the feedback capacity of unifilar finite-state channels (FSCs) are derived. The upper bound is derived using a new technique, called the Q-contexts, which is based on a construction of a directed graph that is used to quantize rec ... Full text Cite

Beyond double transitivity: Capacity-achieving cyclic codes on erasure channels

Conference 2016 IEEE Information Theory Workshop, ITW 2016 · October 21, 2016 Recently, sequences of error-correcting codes with doubly-transitive permutation groups were shown to achieve capacity on erasure channels under symbol-wise maximum a posteriori (MAP) decoding. From this, it follows that Reed-Muller and primitive narrow-se ... Full text Cite

Density evolution for deterministic generalized product codes with higher-order modulation

Conference International Symposium on Turbo Codes and Iterative Information Processing, ISTC · October 17, 2016 Generalized product codes (GPCs) are extensions of product codes (PCs) where coded bits are protected by two component codes but not necessarily arranged in a rectangular array. It has recently been shown that there exists a large class of deterministic GP ... Full text Cite

Increasing the rate of spatially-coupled codes via optimized irregular termination

Conference International Symposium on Turbo Codes and Iterative Information Processing, ISTC · October 17, 2016 In this paper, we consider the rate-loss problem for spatially-coupled LDPC (SC-LDPC) codes on the binary erasure channel. Although SC-LDPC codes have good noise thresholds under belief-propagation (BP) decoding, they also suffer a rate-loss due to termina ... Full text Cite

Deterministic and ensemble-based spatially-coupled product codes

Conference IEEE International Symposium on Information Theory - Proceedings · August 10, 2016 Several authors have proposed spatially-coupled (or convolutional-like) variants of product codes (PCs). In this paper, we focus on a parametrized family of generalized PCs that recovers some of these codes (e.g., staircase and block-wise braided codes) as ... Full text Cite

Reed-muller codes achieve capacity on the quantum erasure channel

Conference IEEE International Symposium on Information Theory - Proceedings · August 10, 2016 The quantum erasure channel is the simplest example of a quantum communication channel and its information capacity is known precisely. The subclass of quantum error-correcting codes called stabilizer codes is known to contain capacity-achieving sequences ... Full text Cite

Comparing the bit-MAP and block-MAP decoding thresholds of reed-muller codes on BMS channels

Conference IEEE International Symposium on Information Theory - Proceedings · August 10, 2016 The question whether RM codes are capacity-achieving is a long-standing open problem in coding theory that was recently answered in the affirmative for transmission over erasure channels [1], [2]. Remarkably, the proof does not rely on specific properties ... Full text Cite

A single-letter upper bound on the feedback capacity of unifilar finite-state channels

Conference IEEE International Symposium on Information Theory - Proceedings · August 10, 2016 A single-letter upper bound on the feedback capacity of a unifilar finite-state channel is derived. The upper bound is tight for all cases where the feedback capacity is known. Its efficiency is also demonstrated by direct application of the bound on the d ... Full text Cite

Near-optimal finite-length scaling for polar codes over large alphabets

Conference IEEE International Symposium on Information Theory - Proceedings · August 10, 2016 For any prime power q, Mori and Tanaka introduced a family of q-ary polar codes based on q by q Reed-Solomon polarization kernels. For transmission over a q-ary erasure channel, they also derived a closed-form recursion for the erasure probability of each ... Full text Cite

The replica-symmetric prediction for compressed sensing with Gaussian matrices is exact

Conference IEEE International Symposium on Information Theory - Proceedings · August 10, 2016 Featured Publication This paper considers the fundamental limit of compressed sensing for i.i.d. signal distributions and i.i.d. Gaussian measurement matrices. Its main contribution is a rigorous characterization of the asymptotic mutual information (MI) and minimum mean-squar ... Full text Cite

Density evolution and error floor analysis for staircase and braided codes

Conference 2016 Optical Fiber Communications Conference and Exhibition, OFC 2016 · August 9, 2016 We analyze deterministically constructed (i.e., non-ensemble-based) codes in the waterfall and error floor region. The analysis directly applies to several FEC classes proposed for high-speed OTNs such as staircase and braided codes. ... Full text Cite

Reed-Muller codes achieve capacity on erasure channels

Conference Proceedings of the Annual ACM Symposium on Theory of Computing · June 19, 2016 We introduce a new approach to proving that a sequence of deterministic linear codes achieves capacity on an erasure channel under maximum a posteriori decoding. Rather than relying on the precise structure of the codes, our method exploits code symmetry. ... Full text Cite

Spatially-coupled codes for write-once memories

Conference 2015 53rd Annual Allerton Conference on Communication, Control, and Computing, Allerton 2015 · April 4, 2016 The focus of this article is on low-complexity capacity-achieving coding schemes for write-once memory (WOM) systems. The construction is based on spatially-coupled compound LDGM/LDPC codes. Both noiseless systems and systems with read errors are considere ... Full text Cite

Belief-propagation reconstruction for compressed sensing: Quantization vs. Gaussian approximation

Conference 2015 53rd Annual Allerton Conference on Communication, Control, and Computing, Allerton 2015 · April 4, 2016 This work considers the compressed sensing (CS) of i.i.d. signals with sparse measurement matrices and belief-propagation (BP) reconstruction. In general, BP reconstruction for CS requires the passing of messages that are distributions over the real number ... Full text Cite

On the Performance of Block Codes over Finite-State Channels in the Rare-Transition Regime

Journal Article IEEE Transactions on Communications · November 1, 2015 Contemporary wireless networks are tasked with supporting different connection profiles, including real-time traffic and delay-sensitive communications. This creates a need to better understand the fundamental limits of forward error correction in non-asym ... Full text Cite

Symmetric product codes

Conference 2015 Information Theory and Applications Workshop, ITA 2015 - Conference Proceedings · October 27, 2015 Product codes were introduced by Elias in 1954 and generalized by Tanner in 1981. Recently, a number of generalized product codes have been proposed for forward error-correction in high-speed optical communication. In practice, these codes are decoded by i ... Full text Cite

On the limits of treating interference as noise for two-user symmetric Gaussian interference channels

Conference IEEE International Symposium on Information Theory - Proceedings · September 28, 2015 The limits of treating interference as noise are studied for the canonical two-user symmetric Gaussian interference channel. A two-step approach is proposed for finding approximately optimal input distributions in the high signal-to-noise ratio (SNR) regim ... Full text Cite

Cyclic polar codes

Conference IEEE International Symposium on Information Theory - Proceedings · September 28, 2015 Arikan introduced polar codes in 2009 and proved that they achieve the symmetric capacity, under low-complexity successive cancellation decoding, of any binary-input discrete memoryless channel. Arikan's construction is based on the Kronecker product of 2- ... Full text Cite

Delay-Sensitive Communication over Fading Channels: Queueing Behavior and Code Parameter Selection

Journal Article IEEE Transactions on Vehicular Technology · September 1, 2015 This paper examines the queueing performance of communication systems that transmit encoded data over unreliable channels. A fading formulation suitable for wireless mobile applications is considered, where errors are caused by a discrete channel with corr ... Full text Cite

On parameter optimization for staircase codes

Conference Conference on Optical Fiber Communication, Technical Digest Series · June 10, 2015 We discuss the optimization of staircase code parameters based on density evolution. An extension of the original code construction is proposed, leading to codes with steeper waterfall performance. ... Full text Cite

On parameter optimization for staircase codes

Conference Optical Fiber Communication Conference, OFC 2015 · March 13, 2015 We discuss the optimization of staircase code parameters based on density evolution. An extension of the original code construction is proposed, leading to codes with steeper waterfall performance. ... Cite

On parameter optimization for staircase codes

Conference Optical Fiber Communication Conference, OFC 2015 · January 1, 2015 We discuss the optimization of staircase code parameters based on density evolution. An extension of the original code construction is proposed, leading to codes with steeper waterfall performance. ... Cite

Threshold saturation for spatially coupled LDPC and LDGM codes on BMS channels

Journal Article IEEE Transactions on Information Theory · December 1, 2014 Featured Publication Spatially-coupled low-density parity-check (LDPC) codes, which were first introduced as LDPC convolutional codes, have been shown to exhibit excellent performance under low-complexity belief-propagation decoding. This phenomenon is now termed threshold sat ... Full text Cite

An introduction to spatially-coupled codes via practical examples

Conference 2014 31th URSI General Assembly and Scientific Symposium, URSI GASS 2014 · October 17, 2014 This paper uses examples to illustrate the ongoing transition in spatially-coupled coding from theory to practice. In the first example, we find that spatially-coupled codes have already been implemented by two different companies for 100 Gb/s optical comm ... Full text Cite

Convergence of weighted min-sum decoding via dynamic programming on trees

Journal Article IEEE Transactions on Information Theory · January 1, 2014 Applying the max-product (and sum-product) algorithms to loopy graphs is now quite popular for best assignment problems. This is largely due to their low computational complexity and impressive performance in practice. Still, there is no general understand ... Full text Cite

A simple proof of maxwell saturation for coupled scalar recursions

Journal Article IEEE Transactions on Information Theory · January 1, 2014 Featured Publication Low-density parity-check (LDPC) convolutional codes (or spatially coupled codes) were recently shown to approach capacity on the binary erasure channel (BEC) and binary-input memoryless symmetric channels. The mechanism behind this spectacular performance ... Full text Cite

Multilevel lattices based on spatially-coupled LDPC codes with applications

Conference IEEE International Symposium on Information Theory - Proceedings · January 1, 2014 We propose a class of lattices constructed using Construction D where the underlying linear codes are nested binary spatially-coupled low-density parity-check codes (SC-LDPC) codes with uniform left and right degrees. By leveraging recent results on the op ... Full text Cite

Spatially-coupled codes for side-information problems

Conference IEEE International Symposium on Information Theory - Proceedings · January 1, 2014 For compound LDGM/LDPC codes with maximum a posteriori (MAP) processing, Wainwright and Martinian showed that the information-theoretic rate regions of the Wyner-Ziv (WZ) and Gelfand-Pinsker (GP) problems are achievable. For the same ensemble, these rates ... Full text Cite

On the relevance of graph covers and zeta functions for the analysis of SPA decoding of cycle codes

Conference IEEE International Symposium on Information Theory - Proceedings · December 19, 2013 For an arbitrary binary cycle code, we show that sum-product algorithm (SPA) decoding after infinitely many iterations equals symbolwise graph-cover decoding. We do this by characterizing the Bethe free energy function of the underlying normal factor graph ... Full text Cite

Spatially-coupled multi-edge type LDPC codes with bounded degrees that achieve capacity on the BEC under BP decoding

Conference IEEE International Symposium on Information Theory - Proceedings · December 19, 2013 Convolutional (or spatially-coupled) low-density parity-check (LDPC) codes have now been shown to approach capacity for a variety of problems. Yet, most of these results require sequences of regular LDPC ensembles with increasing variable and check degrees ... Full text Cite

Spatially-coupled low density lattices based on construction a with applications to compute-and-forward

Conference 2013 IEEE Information Theory Workshop, ITW 2013 · December 1, 2013 We consider a class of lattices built using Construction A, where the underlying code is a non-binary spatially-coupled low density parity check code. We refer to these lattices as spatially-coupled LDA (SCLDA) lattices. SCLDA lattices can be constructed o ... Full text Cite

First-passage time and large-deviation analysis for erasure channels with memory

Journal Article IEEE Transactions on Information Theory · August 28, 2013 This paper considers the performance of digital communication systems transmitting messages over finite-state erasure channels with memory. Information bits are protected from channel erasures using error-correcting codes; successful receptions of codeword ... Full text Cite

Code design for the noisy Slepian-Wolf problem

Journal Article IEEE Transactions on Communications · June 1, 2013 We consider a noisy Slepian-Wolf problem where two correlated sources are separately encoded (using codes of fixed rate) and transmitted over two independent binary memoryless symmetric channels. The capacity of each channel is characterized by a single pa ... Full text Cite

Code-rate selection, queueing behavior, and the correlated erasure channel

Journal Article IEEE Transactions on Information Theory · January 7, 2013 This paper considers the relationship between code-rate selection and queueing performance for communication systems subject to time-varying channel conditions. While error-correcting codes offer protection against channel uncertainties, there exists a nat ... Full text Cite

Iterative hard-decision decoding of braided BCH codes for high-speed optical communication

Conference Proceedings - IEEE Global Communications Conference, GLOBECOM · January 1, 2013 Designing error-correcting codes for optical communication is challenging mainly because of the high data rates (e.g., 100 Gbps) required and the expectation of low latency, low overhead (e.g., 7% redundancy), and large coding gain (e.g., >9dB). Although s ... Full text Cite

A simple proof of threshold saturation for coupled scalar recursions

Conference International Symposium on Turbo Codes and Iterative Information Processing, ISTC · December 14, 2012 Low-density parity-check (LDPC) convolutional codes (or spatially-coupled codes) have been shown to approach capacity on the binary erasure channel (BEC) and binary-input memoryless symmetric channels. The mechanism behind this spectacular performance is t ... Full text Cite

Iterative collision resolution for slotted ALOHA: An optimal uncoordinated transmission policy

Conference International Symposium on Turbo Codes and Iterative Information Processing, ISTC · December 14, 2012 We consider a multi-user wireless network in which each user has one packet of information to transmit to a central receiver. We study an uncoordinated paradigm where the users send their packet a random number of times according to a probability distribut ... Full text Cite

A simple proof of threshold saturation for coupled vector recursions

Conference 2012 IEEE Information Theory Workshop, ITW 2012 · December 1, 2012 Convolutional low-density parity-check (LDPC) codes (or spatially-coupled codes) have now been shown to achieve capacity on binary-input memoryless symmetric channels. The principle behind this surprising result is the threshold-saturation phenomenon, whic ... Full text Cite

On the performance of random block codes over finite-state fading channels

Conference 2012 50th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2012 · December 1, 2012 As the mobile application landscape expands, wireless networks are tasked with supporting different connection profiles, including real-time traffic and delay-sensitive communications. Among many ensuing engineering challenges is the need to better underst ... Full text Cite

Threshold saturation of spatially-coupled codes on intersymbol-interference channels

Conference IEEE International Conference on Communications · December 1, 2012 Recently, it has been observed that terminated low-density-parity-check (LDPC) convolutional codes (or spatially-coupled codes) appear to approach the capacity universally across the class of binary memoryless channels. This is facilitated by the 'threshol ... Full text Cite

A proof of threshold saturation for spatially-coupled LDPC codes on BMS channels

Conference 2012 50th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2012 · December 1, 2012 Low-density parity-check (LDPC) convolutional codes have been shown to exhibit excellent performance under low-complexity belief-propagation decoding [1], [2]. This phenomenon is now termed threshold saturation via spatial coupling. The underlying principl ... Full text Cite

On the queueing behavior of Gilbert-Elliott channels in the rare-transition regime

Conference 2012 46th Annual Conference on Information Sciences and Systems, CISS 2012 · November 12, 2012 This article considers the performance of random block codes over the Gilbert-Elliott channel and characterizes the queueing performance under maximum-likelihood decoding. The probability of decoding failure is upper bounded using an approximation that wor ... Full text Cite

Approaching capacity at high rates with iterative hard-decision decoding

Conference IEEE International Symposium on Information Theory - Proceedings · October 22, 2012 A variety of low-density parity-check (LDPC) ensembles have now been observed to approach capacity with message-passing decoding. However, all of them use soft (i.e., non-binary) messages and a posteriori probability (APP) decoding of their component codes ... Full text Cite

On the maximum a posteriori decoding thresholds of multiuser systems with erasures

Conference IEEE International Symposium on Information Theory - Proceedings · October 22, 2012 A fundamental connection between the belief propagation (BP) and maximum a posteriori (MAP) decoding thresholds was derived by Méasson, Montanari, and Urbanke using the area theorem for extrinsic information transfer (EXIT) curves. This connection allows t ... Full text Cite

Verification decoding of high-rate ldpc codes with applications in compressed sensing

Journal Article IEEE Transactions on Information Theory · July 23, 2012 This paper considers the performance of (j,k)-regular low-density parity-check (LDPC) codes with message-passing (MP) decoding algorithms in the high-rate regime. In particular, we derive the high-rate scaling law for MP decoding of LDPC codes on the binar ... Full text Cite

Direction of arrival estimation using canonical and crystallographic volumetric element configurations

Conference Proceedings of 6th European Conference on Antennas and Propagation, EuCAP 2012 · July 2, 2012 Volumetric distributions of receiving antennas are investigated for their ability to mitigate aliasing and enhance the direction of arrival (DOA) estimation. Surface and volumetric distributions in canonical arrangements (cubic and spherical) of elements a ... Full text Cite

Joint decoding of LDPC codes and finite-state channels via linear-programming

Journal Article IEEE Journal on Selected Topics in Signal Processing · December 1, 2011 This paper considers the joint-decoding problem for finite-state channels (FSCs) and low-density parity-check (LDPC) codes. In the first part, the linear-programming (LP) decoder for binary linear codes is extended to perform joint-decoding of binary-input ... Full text Cite

Universal codes for the Gaussian MAC via spatial coupling

Conference 2011 49th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2011 · December 1, 2011 We consider transmission of two independent and separately encoded sources over a two-user binary-input Gaussian multiple-access channel. The channel gains are assumed to be unknown at the transmitter and the goal is to design an encoder-decoder pair that ... Full text Cite

Large deviations on empirical service for erasure channels with memory

Conference 2011 49th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2011 · December 1, 2011 This article examines the performance of a digital communication link from a large deviations perspective. The underlying physical environment is modeled as an erasure channel with memory. Information is shielded from symbol erasures using error-correcting ... Full text Cite

Universality for the noisy Slepian-Wolf problem via spatial coupling

Conference IEEE International Symposium on Information Theory - Proceedings · October 26, 2011 We consider a noisy Slepian-Wolf problem where two correlated sources are separately encoded and transmitted over two independent binary memoryless symmetric channels. Each channel capacity is assumed to be characterized by a single parameter which is not ... Full text Cite

Queueing behavior of the Gilbert-Elliott channel: BCH codes and Poisson arrivals

Conference IEEE International Symposium on Information Theory - Proceedings · October 26, 2011 This paper considers the queueing performance of a communication system that transmits BCH-coded data over the correlated-error channel first studied by Gilbert and Elliott in the 1960s. For some arrival processes, one can join the queue length and channel ... Full text Cite

Analysis of verification-based decoding on the q-ary symmetric channel for large q

Journal Article IEEE Transactions on Information Theory · October 1, 2011 A new verification-based message-passing decoder for low-density parity-check (LDPC) codes is introduced and analyzed for the q-ary symmetric channel (q-SC). Rather than passing messages consisting of symbol probabilities, this decoder passes lists of poss ... Full text Cite

An iterative joint linear-programming decoding of LDPC codes and finite-state channels

Conference IEEE International Conference on Communications · September 2, 2011 In this paper, we introduce an efficient method for the joint linear-programming (LP) decoding of low-density parity-check (LDPC) codes and finite-state channels (FSCs). In particular, we extend the approach of iterative approximate LP decoding proposed by ... Full text Cite

Spatially-Coupled Codes and Threshold Saturation on Intersymbol-Interference Channels

Internet Publication · July 16, 2011 Recently, it has been observed that terminated low-density-parity-check (LDPC) convolutional codes (or spatially-coupled codes) appear to approach capacity universally across the class of binary memoryless channels. This is facilitated by the "threshold sa ... Link to item Cite

On multiple decoding attempts for Reed - Solomon codes: A rate-distortion approach

Journal Article IEEE Transactions on Information Theory · February 1, 2011 One popular approach to soft-decision decoding of Reed - Solomon (RS) codes is based on using multiple trials of a simple RS decoding algorithm in combination with erasing or flipping a set of symbols or bits in each trial. This paper presents a framework ... Full text Cite

The effect of spatial coupling on compressive sensing

Conference 2010 48th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2010 · December 1, 2010 Recently, it was observed that spatially-coupled LDPC code ensembles approach the Shannon capacity for a class of binary-input memoryless symmetric (BMS) channels. The fundamental reason for this was attributed to a threshold saturation phenomena derived i ... Full text Cite

First-passage time analysis for digital communication over erasure channels with delay-sensitive traffic

Conference 2010 48th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2010 · December 1, 2010 This article explores the relation between queueing behavior and code-rate selection for digital communication over correlated erasure channels. The focus is on non-asymptotic system analysis, with finite block-lengths and non-vanishing probabilities of de ... Full text Cite

IMP: A message-passing algorithm for matrix completion

Conference 6th International Symposium on Turbo Codes and Iterative Information Processing, ISTC 2010 · November 29, 2010 A new message-passing (MP) method is considered for the matrix completion problem associated with recommender systems. We attack the problem using a (generative) factor graph model that is related to a probabilistic low-rank matrix factorization. Based on ... Full text Cite

LDPC code design for transmission of correlated sources across noisy channels without CSIT

Conference 6th International Symposium on Turbo Codes and Iterative Information Processing, ISTC 2010 · November 29, 2010 We consider the problem of transmitting correlated data after independent encoding to a central receiver through orthogonal channels. We assume that the channel state information is not known at the transmitter. The receiver has access to both the source c ... Full text Cite

Convergence of weighted min-sum decoding via dynamic programming on coupled trees

Conference 6th International Symposium on Turbo Codes and Iterative Information Processing, ISTC 2010 · November 29, 2010 Applying the max-product (and belief-propagation) algorithms to loopy graphs is now quite popular for constraint satisfaction problems. This is largely due to their low computational complexity and impressive performance in practice. Still, there is no gen ... Full text Cite

Joint physical layer coding and network coding for bidirectional relaying

Journal Article IEEE Transactions on Information Theory · November 1, 2010 We consider a communication system where two transmitters wish to exchange information through a central relay. The transmitter and relay nodes exchange data over synchronized, average power constrained additive white Gaussian noise channels with a real in ... Full text Cite

A rate-distortion exponent approach to multiple decoding attempts for Reed-Solomon codes

Conference IEEE International Symposium on Information Theory - Proceedings · August 23, 2010 Algorithms based on multiple decoding attempts of Reed-Solomon (RS) codes have recently attracted new attention. Choosing decoding candidates based on rate-distortion theory, as proposed previously by the authors, currently provides the best performance-ve ... Full text Cite

On the joint decoding of LDPC codes and finite-state channels via linear programming

Conference IEEE International Symposium on Information Theory - Proceedings · August 23, 2010 In this paper, the linear programming (LP) decoder for binary linear codes, introduced by Feldman, et al. is extended to joint-decoding of binary-input finite-state channels. In particular, we provide a rigorous definition of LP joint-decoding pseudo-codew ... Full text Cite

On the queueing behavior of random codes over a gilbert-elliot erasure channel

Conference IEEE International Symposium on Information Theory - Proceedings · August 23, 2010 This paper considers the queueing performance of a system that transmits coded data over a time-varying erasure channel. In our model, the queue length and channel state together form a Markov chain that depends on the system parameters. This gives a frame ... Full text Cite

LDPC codes for rank modulation in flash memories

Conference IEEE International Symposium on Information Theory - Proceedings · August 23, 2010 An LDPC code is proposed for flash memories based on rank modulation. In contrast to previous approaches, this enables the use of long ECCs with fixed-length modulation codes. For ECC design, the rank modulation scheme is treated as part of an equivalent c ... Full text Cite

Code rate, queueing behavior and the correlated erasure channel

Conference IEEE Information Theory Workshop 2010, ITW 2010 · July 27, 2010 This paper considers the relationship between coderate selection and queueing performance for communication systems with time-varying parameters. While error-correcting codes offer protection against channel unreliability, there is a tradeoff between the e ... Full text Cite

Message-Passing Inference on a Factor Graph for Collaborative Filtering

Internet Publication · April 7, 2010 This paper introduces a novel message-passing (MP) framework for the collaborative filtering (CF) problem associated with recommender systems. We model the movie-rating prediction problem popularized by the Netflix Prize, using a probabilistic factor graph ... Link to item Cite

A rate-distortion perspective on multiple decoding attempts for Reed-Solomon codes

Conference 2009 47th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2009 · December 1, 2009 Recently, a number of authors have proposed decoding schemes for Reed-Solomon (RS) codes based on multiple trials of a simple RS decoding algorithm. In this paper, we present a rate-distortion (R-D) approach to analyze these multiple-decoding algorithms fo ... Full text Cite

Can iterative decoding for erasure correlated sources be universal?

Conference 2009 47th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2009 · December 1, 2009 In this paper, we consider a few iterative decoding schemes for the joint source-channel coding of correlated sources. Specifically, we consider the joint source-channel coding of two erasure correlated sources with transmission over different erasure chan ... Full text Cite

Modulation codes for flash memory based on load-balancing theory

Conference 2009 47th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2009 · December 1, 2009 In this paper, we consider modulation codes for practical multilevel flash memory storage systems with q cell levels. Instead of maximizing the lifetime of the device [7], [1], [2], [4], we maximize the average amount of information stored per cell-level, ... Full text Cite

Design and implementation of physical-layer network-coding protocols

Conference Conference Record - Asilomar Conference on Signals, Systems and Computers · December 1, 2009 Recently, there has been a growing interest in physical-layer network-coding techniques that facilitate information transfer in wireless relay networks. Physical-layer networkcoding techniques take advantage of the additive nature of wireless signals by al ... Full text Cite

On the Iterative Decoding of High-Rate LDPC Codes With Applications in Compressed Sensing

Internet Publication · March 12, 2009 This paper considers the performance of $(j,k)$-regular low-density parity-check (LDPC) codes with message-passing (MP) decoding algorithms in the high-rate regime. In particular, we derive the high-rate scaling law for MP decoding of LDPC codes on the bin ... Link to item Cite

Upper bounds on the MAP threshold of iterative decoding systems with erasure noise

Conference 2008 5th International Symposium on Turbo Codes and Related Topics, TURBOCODING · December 29, 2008 Following the work of Méasson, Montanari, and Urbanke, this paper considers the maximum a posteriori (MAP) decoding thresholds of three iterative decoding systems. First, irregular repeat-accumulate (IRA) and accumulate-repeat-accumulate (ARA) code ensembl ... Full text Cite

Compressed sensing and linear codes over real numbers

Conference 2008 Information Theory and Applications Workshop - Conference Proceedings, ITA · October 6, 2008 Compressed sensing (CS) is a relatively new area of signal processing and statistics that focuses on signal reconstruction from a small number of linear (e.g., dot product) measurements. In this paper, we analyze CS using tools from coding theory because C ... Full text Cite

Girth-10 LDPC codes based on 3-D cyclic lattices

Journal Article IEEE Transactions on Vehicular Technology · March 1, 2008 In this paper, we propose a new method based on combinatorial designs for constructing high-girth low-density parity-check (LDPC) codes. We use a 3-D lattice to generate balanced incomplete block designs based on planes and lines in the lattice. This gives ... Full text Cite

Joint iterative decoding of LDPC codes for channels with memory and erasure noise

Conference IEEE Journal on Selected Areas in Communications · February 1, 2008 This paper investigates the joint iterative decoding of low-density parity-check (LDPC) codes and channels with memory. Sequences of irregular LDPC codes are presented that achieve, under joint iterative decoding, the symmetric information rate of a class ... Full text Cite

Compressed Sensing and Linear Codes over Real Numbers

Conference 2008 INFORMATION THEORY AND APPLICATIONS WORKSHOP · January 1, 2008 Link to item Cite

List-message passing achieves capacity on the q-ary symmetric channel for large q

Conference GLOBECOM - IEEE Global Telecommunications Conference · December 1, 2007 We discuss and analyze a list-message-passing decoder with verification for low-density parity-check (LDPC) codes on the q-ary symmetric channel (q-SC). Rather than passing messages consisting of symbol probabilities, we pass lists of possible symbols and ... Full text Cite

Capacity upper bounds for the deletion channel

Conference IEEE International Symposium on Information Theory - Proceedings · December 1, 2007 We present two upper bounds on the capacity of the i.i.d. binary deletion channel, where each bit is independently deleted with a fixed probability d. The first can be numerically evaluated for any fixed d. The second provides an asymptotic upper bound as ... Full text Cite

Accumulate-repeat-accumulate codes: Capacity-achieving ensembles of systematic codes for the erasure channel with bounded complexity

Journal Article IEEE Transactions on Information Theory · June 1, 2007 This paper introduces ensembles of systematic accumulaterepeataccumulate (ARA) codes which asymptotically achieve capacity on the binary erasure channel (BEC) with bounded complexity, per information bit, of encoding and decoding. It also introduces symmet ... Full text Cite

Determining and approaching achievable rates of binary intersymbol interference channels using multistage decoding

Conference IEEE Transactions on Information Theory · April 1, 2007 By examining the achievable rates of a multistage decoding system on stationary ergodic channels, we derive lower bounds on the mutual information rate corresponding to independent and uniformly distributed (i.u.d.) inputs, also referred to as the i.u.d. i ... Full text Cite

Link-level modeling and performance of CDMA interference cancellation

Conference GLOBECOM - IEEE Global Telecommunications Conference · December 1, 2006 A general framework is provided to characterize the link level performance of CDMA systems with interference cancellation. This closed-form residual power analysis accounts for the impact of channel estimation errors due to SNR, channel variation, chip asy ... Full text Cite

Recent results on capacity-achieving codes for the erasure channel with bounded complexity

Conference IEEE Convention of Electrical and Electronics Engineers in Israel, Proceedings · December 1, 2006 The paper introduces ensembles of accumulate-repeat-accumulate (ARA) codes which asymptotically achieve capacity on the binary erasure channel (BEC) with bounded complexity (per information bit). It also introduces symmetry properties which play a central ... Full text Cite

Implementing interference cancellation to increase the EV-DO Rev A reverse link capacity

Journal Article IEEE Communications Magazine · February 1, 2006 This article provides the principles and practice of how interference cancellation can be implemented on the EV-DO Rev A reverse link. It is shown that applying interference cancellation to CDMA achieves the multiple access channel sum rate capacity for ei ... Full text Cite

Recent results on capacity-achieving codes for the erasure channel with bounded complexity

Conference 2006 IEEE 24TH CONVENTION OF ELECTRICAL & ELECTRONICS ENGINEERS IN ISRAEL · January 1, 2006 Link to item Cite

Finite-length analysis of a capacity-achieving ensemble for the binary erasure channel

Conference Proceedings of the IEEE ITSOC Information Theory Workshop 2005 on Coding and Complexity, ITW2005 · December 1, 2005 In this paper, we consider the finite-length performance of a capacity-achieving sequence of irregular repeat-accumulate (IRA) code ensembles. We focus on a sequence of bit-regular ensembles with degree 3 which was shown to achieve capacity with bounded co ... Full text Cite

Capacity-achieving ensembles for the binary erasure channel with bounded complexity

Conference IEEE Transactions on Information Theory · July 1, 2005 We present two sequences of ensembles of non-systematic irregular repeat-accumulate (IRA) codes which asymptotically (as their block length tends to infinity) achieve capacity on the binary erasure channel (BEC) with bounded complexity per information bit. ... Full text Cite

Accumulate-repeat-accumulate codes: Systematic codes achieving the binary erasure channel capacity with bounded complexity

Conference 43rd Annual Allerton Conference on Communication, Control and Computing 2005 · January 1, 2005 The paper introduces ensembles of accumulate-repeat-accumulate (ARA) codes which asymptotically achieve capacity on the binary erasure channel (BEC) with bounded complexity per information bit. It also introduces symmetry properties which play a central ro ... Cite

Capacity-achieving ensembles for the binary erasure channel with bounded complexity

Conference IEEE Convention of Electrical and Electronics Engineers in Israel, Proceedings · December 1, 2004 We present two sequences of ensembles of non-systematic irregular repeat-accumulate codes which asymptotically (as their block length tends to infinity) achieve capacity on the binary erasure channel (BEC) with bounded complexity. This is in contrast to al ... Cite

Capacity-achieving ensembles for the binary erasure channel with bounded complexity

Conference IEEE International Symposium on Information Theory - Proceedings · October 20, 2004 We present two sequences of ensembles of non-systematic irregular repeat-accumulate codes which asymptotically (as their block length tends to infinity) achieve capacity on the binary erasure channel (BEC) with bounded complexity. This is in contrast to al ... Cite

Bounds on the decoding complexity of punctured codes on graphs

Internet Publication · September 14, 2004 We present two sequences of ensembles of non-systematic irregular repeat-accumulate codes which asymptotically (as their block length tends to infinity) achieve capacity on the binary erasure channel (BEC) with bounded complexity per information bit. This ... Link to item Cite

On the low-rate shannon limit for binary intersymbol interference channels

Conference IEEE Transactions on Communications · December 1, 2003 For a discrete-time, binary-input Gaussian channel with finite intersymbol interference, we prove that reliable communication can be achieved if and only if Eb/No > log 2/Gopt, for some constant Gopt that depends on the channel. To determine this constant, ... Full text Cite

Capacity-Approaching Bandwidth-Efficient Coded Modulation Schemes Based on Low-Density Parity-Check Codes

Conference IEEE Transactions on Information Theory · September 1, 2003 We design multilevel coding (MLC) and bit-interleaved coded modulation (BICM) schemes based on low-density parity-check (LDPC) codes. The analysis and optimization of the LDPC component codes for the MLC and BICM schemes are complicated because, in general ... Full text Cite

The serial concatenation of rate-1 codes through uniform random interleaves

Conference IEEE Transactions on Information Theory · June 1, 2003 Until the analysis of Repeat Accumulate codes by Divsalar et al., few people would have guessed that simple rate-1 codes could play a crucial role in the construction of "good" binary codes. In this paper, we will construct "good" binary linear block codes ... Full text Cite

Spectral keying/spl trade/: A novel modulation scheme for UWB systems

Conference 2003 IEEE Conference on Ultra Wideband Systems and Technologies, UWBST 2003 - Conference Proceedings · January 1, 2003 Spectral keying (SK) is a novel UWB modulation scheme that combines properties of both frequency shift keying and pulse position modulation. An SK symbol consists of a number of pulses where each pulse is from a different frequency band. It relies on divid ... Full text Cite

Multilevel coding with low-density parity-check component codes

Conference Conference Record / IEEE Global Telecommunications Conference · December 1, 2001 We design multilevel coding (MLC) schemes with low-density parity-check (LDPC) codes as component codes at each level. We develop a method to analyze the performance of an LDPC code at any level as the codeword length goes to infinity even if the equivalen ... Cite

On the achievable information rates of finite state ISI channels

Conference Conference Record / IEEE Global Telecommunications Conference · December 1, 2001 Featured Publication In this paper, we present two simple Monte Carlo methods for estimating the achievable information rates of general finite state channels. Both methods require only the ability to simulate the channel with an a posteriori probability (APP) detector matched ... Cite

Design of low-density parity-check codes for bandwidth efficient modulation

Conference Proceedings - 2001 IEEE Information Theory Workshop, ITW 2001 · January 1, 2001 We design low-density parity-check (LDPC) codes for bandwidth efficient modulation using a multilevel coding (MLC) technique. We develop a method to analyze the asymptotic performance of the LDPC codes using message-passing decoding at each level of the ML ... Full text Cite

Parity-accumulate codes for magnetic recording

Conference Digests of the Intermag Conference · January 1, 2000 A turbo-like architecture for partial-response channels is presented. The architecture is based on the serial concatenation of an outer single parity check (SPC) with uniformly-interleaved rate-1 codes. ... Cite

NONCONTACT BODY MEASUREMENT FOR AUTOMATED APPAREL MANUFACTURING

Conference FACTORY AUTOMATION AND INFORMATION MANAGEMENT · January 1, 1991 Link to item Cite