• Publications
  • Influence
Characterizing flash memory: Anomalies, observations, and applications
This paper empirically characterizes flash memory technology by measuring the performance, power, and reliability of flash devices from five manufacturers. Expand
Capacity-approaching bandwidth-efficient coded modulation schemes based on low-density parity-check codes
We design multilevel coding (MLC) and bit-interleaved coded modulation (BICM) schemes based on low-density parity-check (LDPC) codes. Expand
Performance analysis and code optimization of low density parity-check codes on Rayleigh fading channels
A numerical method has been presented to determine the noise thresholds of low density parity-check codes that employ the message passing decoding algorithm on the additive white Gaussian noise (AWGN) channel. Expand
Windowed Decoding of Protograph-Based LDPC Convolutional Codes Over Erasure Channels
We show that 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. Expand
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. Expand
Efficient iterative LP decoding of LDPC codes with alternating direction method of multipliers
  • Xiaojie Zhang, P. Siegel
  • Mathematics, Computer Science
  • IEEE International Symposium on Information…
  • 7 July 2013
In this paper, we propose an efficient message-passing algorithm to solve the LP decoding problem based on ADMM. Expand
Finite-State Modulation Codes for Data Storage
The authors provide a self-contained exposition of modulation code design methods based upon the state splitting algorithm for constructing finite state encoders. Expand
On the achievable information rates of finite state ISI channels
In this paper, we present two simple Monte Carlo methods for estimating the achievable information rates of general finite state channels. Expand
Adaptive Methods for Linear Programming Decoding
  • M. Taghavi, P. Siegel
  • Computer Science, Mathematics
  • IEEE Transactions on Information Theory
  • 23 March 2007
We show that by starting from a simple LP problem and adaptively adding the necessary constraints, the complexity of LP decoding can be significantly reduced. Expand
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. Expand