Author pages are created from data sourced from our academic publisher partnerships and public sources.
Share This Author
Capacity-approaching bandwidth-efficient coded modulation schemes based on low-density parity-check codes
The optimized irregular LDPC codes at each level of MLC with multistage decoding (MSD) are able to perform well at signal-to-noise ratios (SNR) very close to the capacity of the additive white Gaussian noise (AWGN) channel.
Characterizing flash memory: Anomalies, observations, and applications
- Laura M. Grupp, Adrian M. Caulfield, J. Wolf
- Computer Science42nd Annual IEEE/ACM International Symposium on…
- 12 December 2009
This work empirically characterized flash memory technology from five manufacturers by directly measuring the performance, power, and reliability, and demonstrates that performance varies significantly between vendors, devices, and from publicly available datasheets.
Performance analysis and code optimization of low density parity-check codes on Rayleigh fading channels
Simulated performance of the optimized irregular LDPC codes and turbo codes on a land mobile channel and the results indicate that at a block size of 3072, irregularLDPC codes can outperform turbo codes over a wide range of mobile speeds.
Windowed Decoding of Protograph-Based LDPC Convolutional Codes Over Erasure Channels
- Aravind R. Iyengar, M. Papaleo, P. Siegel, J. Wolf, A. Vanelli-Coralli, G. Corazza
- Computer ScienceIEEE Transactions on Information Theory
- 21 October 2010
The structure of LDPC convolutional code ensembles is suitable to obtain performance close to the theoretical limits over the memoryless erasure channel, both for the BP decoder and windowed decoding but the same structure imposes limitations on the performance over erasure channels with memory.
Matched spectral-null codes for partial-response channels
A new family of codes that improve the reliability of digital communication over noisy, partial- response channels is described, and it is shown that matched-spectral-null sequences provide a distance gain on the order of 3 dB and higher for a broad class of partial-response channels.
Efficient iterative LP decoding of LDPC codes with alternating direction method of multipliers
An efficient message-passing algorithm based on the alternating direction method of multipliers (ADMM) that can substantially improve the decoding speed of the ADMM-based LP decoder is proposed.
Codes for Digital Recorders
This paper surveys the theory and practice of constrained coding, tracing the evolution of the subject from its origins in Shannon's classic 1948 paper to present-day applications in high-density digital recorders.
On the achievable information rates of finite state ISI channels
- H. Pfister, J. Soriaga, P. Siegel
- Computer ScienceGLOBECOM'01. IEEE Global Telecommunications…
- 25 November 2001
Two simple Monte Carlo methods for estimating the achievable information rates of general finite state channels requiring only the ability to simulate the channel with an a posteriori probability (APP) detector matched to the channel are presented.
Adaptive Methods for Linear Programming Decoding
By starting from a simple LP problem and adaptively adding the necessary constraints, the complexity of LP decoding can be significantly reduced, and it is observed that with adaptive LP decoding, the sizes of the LP problems that need to be solved become practically independent of the density of the parity-check matrix.
Adaptive Cut Generation Algorithm for Improved Linear Programming Decoding of Binary Linear Codes
A new and effective algorithm to generate parity inequalities derived from certain additional redundant parity check (RPC) constraints that can eliminate pseudocodewords produced by the LP decoder, often significantly improving the decoder error-rate performance.