P. Siegel

Publications
Influence

Characterizing flash memory: Anomalies, observations, and applications

Laura M. Grupp, A. Caulfield, +4 authors J. Wolf
Computer Science
42nd Annual IEEE/ACM International Symposium on…
12 December 2009

We have empirically characterized flash memory technology from five manufacturers by directly measuring the performance, power, and reliability of flash memory. Expand

Capacity-approaching bandwidth-efficient coded modulation schemes based on low-density parity-check codes

J. Hou, P. Siegel, L. Milstein, H. Pfister
Mathematics, Computer Science
IEEE Trans. Inf. Theory
4 September 2003

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

J. Hou, P. Siegel, L. Milstein
Computer Science
IEEE J. Sel. Areas Commun.
1 May 2001

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

A. Iyengar, M. Papaleo, P. Siegel, J. Wolf, A. Vanelli-Coralli, G. Corazza
Computer Science, Mathematics
IEEE Transactions on Information Theory
21 October 2010

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

R. Karabed, P. Siegel
Mathematics, Computer Science
IEEE Trans. Inf. Theory
25 June 1989

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

On the achievable information rates of finite state ISI channels

H. Pfister, Joseph B. Soriaga, P. Siegel
Computer Science
GLOBECOM'01. IEEE Global Telecommunications…
25 November 2001

In this paper, we present two simple Monte Carlo methods for estimating the achievable information rates of general finite state channels. Expand

Finite-State Modulation Codes for Data Storage

B. Marcus, P. Siegel, J. Wolf
Computer Science
IEEE J. Sel. Areas Commun.
1992

The authors provide a self-contained exposition of modulation code design methods based upon the state splitting algorithm for constructing finite state encoders. 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

VLSI architectures for metric normalization in the Viterbi algorithm

C. Shung, P. Siegel, G. Ungerboeck, H. K. Thapar
Computer Science
IEEE International Conference on Communications…
16 April 1990

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

Recommended Authors