• Publications
  • Influence
Characterizing flash memory: Anomalies, observations, and applications
TLDR
We have empirically characterized flash memory technology from five manufacturers by directly measuring the performance, power, and reliability of flash memory. Expand
  • 446
  • 38
  • PDF
Capacity-approaching bandwidth-efficient coded modulation schemes based on low-density parity-check codes
TLDR
We design multilevel coding (MLC) and bit-interleaved coded modulation (BICM) schemes based on low-density parity-check (LDPC) codes. Expand
  • 279
  • 35
  • PDF
Performance analysis and code optimization of low density parity-check codes on Rayleigh fading channels
TLDR
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
  • 344
  • 28
  • PDF
Windowed Decoding of Protograph-Based LDPC Convolutional Codes Over Erasure Channels
TLDR
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
  • 169
  • 21
  • PDF
Matched spectral-null codes for partial-response channels
TLDR
A new family of codes that improve the reliability of digital communication over noisy, partial-response channels is described. Expand
  • 189
  • 15
  • PDF
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
TLDR
In this paper, we propose an efficient message-passing algorithm to solve the LP decoding problem based on ADMM. Expand
  • 50
  • 15
  • PDF
On the achievable information rates of finite state ISI channels
TLDR
In this paper, we present two simple Monte Carlo methods for estimating the achievable information rates of general finite state channels. Expand
  • 265
  • 14
  • PDF
Finite-State Modulation Codes for Data Storage
TLDR
The authors provide a self-contained exposition of modulation code design methods based upon the state splitting algorithm for constructing finite state encoders. Expand
  • 236
  • 14
  • PDF
Adaptive Methods for Linear Programming Decoding
  • M. Taghavi, P. Siegel
  • Computer Science, Mathematics
  • IEEE Transactions on Information Theory
  • 23 March 2007
TLDR
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
  • 115
  • 13
  • PDF
VLSI architectures for metric normalization in the Viterbi algorithm
TLDR
In the realization of Viterbi decoders with finite precision arithmetic, the values of the survivor metrics computed by the add-compare-select (ACS) recursion must remain within a finite numerical range to avoid catastrophic overflow (or underflow) situations. Expand
  • 132
  • 13