Search Results - "Pfister, H.D."

Capacity-approaching bandwidth-efficient coded modulation schemes based on low-density parity-check codes by Hou, J., Siegel, P.H., Milstein, L.B., Pfister, H.D.

“…We design multilevel coding (MLC) and bit-interleaved coded modulation (BICM) schemes based on low-density parity-check (LDPC) codes. The analysis and…”
Get full text

Determining and Approaching Achievable Rates of Binary Intersymbol Interference Channels Using Multistage Decoding by Soriaga, J.B., Pfister, H.D., Siegel, P.H.

“…By examining the achievable rates of a multistage decoding system on stationary ergodic channels, we derive lower bounds on the mutual information rate…”
Get full text

Joint iterative decoding of LDPC codes for channels with memory and erasure noise by Pfister, H.D., Siegel, P.H.

“…This paper investigates the joint iterative decoding of low-density parity-check (LDPC) codes and channels with memory. Sequences of irregular LDPC codes are…”
Get full text

Girth-10 LDPC Codes Based on 3-D Cyclic Lattices by Fan Zhang, Xuehong Mao, Wuyang Zhou, Pfister, H.D.

“…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…”
Get full text

The serial concatenation of rate-1 codes through uniform random interleavers by Pfister, H.D., Siegel, P.H.

“…Until the analysis of repeat accumulate codes by Divsalar et al. (1998), few people would have guessed that simple rate-1 codes could play a crucial role in…”
Get full text

On the low-rate Shannon limit for binary intersymbol interference channels by Soriaga, J.B., Pfister, H.D., Siegel, P.H.

“…For a discrete-time, binary-input, Gaussian channel with finite intersymbol interference, we prove that reliable communication can be achieved if, and only if,…”
Get full text

Accumulate-Repeat-Accumulate Codes: Capacity-Achieving Ensembles of Systematic Codes for the Erasure Channel With Bounded Complexity by Pfister, H.D., Sason, I.

“…This paper introduces ensembles of systematic accumulate-repeat-accumulate (ARA) codes which asymptotically achieve capacity on the binary erasure channel…”
Get full text

Capacity-achieving ensembles for the binary erasure channel with bounded complexity by Pfister, H.D., Sason, I., Urbanke, R.

“…We present two sequences of ensembles of nonsystematic irregular repeat-accumulate (IRA) codes which asymptotically (as their block length tends to infinity)…”
Get full text

Revisiting multi-step nonlinearity compensation with machine learning by Ha¨ger, C, Pfister, H.D, Bu¨tler, R.M, Liga, G, Alvarado, A

“…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…”
Get full text

Capacity Upper Bounds for the Deletion Channel by Diggavi, S., Mitzenmacher, M., Pfister, H.D.

“…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…”
Get full text

Compressed sensing and linear codes over real numbers by Fan Zhang, Pfister, H.D.

“…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.,…”
Get full text

Implementing interference cancellation to increase the EV-DO Rev A reverse link capacity by Hou, J., Smee, J.E., Pfister, H.D., Tomasin, S.

“…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…”
Get full text

On the achievable information rates of finite state ISI channels by Pfister, H.D., Soriaga, J.B., Siegel, P.H.

“…In this paper, we present two simple Monte Carlo methods for estimating the achievable information rates of general finite state channels. Both methods require…”
Get full text

Finite-length analysis of a capacity-achieving ensemble for the binary erasure channel by Pfister, H.D.

“…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…”
Get full text

Modulation codes for flash memory based on load-balancing theory by Fan Zhang, Pfister, H.D.

“…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…”
Get full text

Can iterative decoding for erasure correlated sources be universal? by Yedla, A., Pfister, H.D., Narayanan, K.R.

“…In this paper, we consider a few iterative decoding schemes for the joint source-channel coding of correlated sources. Specifically, we consider the joint…”
Get full text

A rate-distortion perspective on multiple decoding attempts for Reed-Solomon codes by Nguyen, P.S., Pfister, H.D., Narayanan, K.R.

“…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…”
Get full text

Upper bounds on the MAP threshold of iterative decoding systems with erasure noise by Chia Wen Wang, Pfister, H.D.

“…Following the work of Measson, Montanari, and Urbanke, this paper considers the maximum a posteriori (MAP) decoding thresholds of three iterative decoding…”
Get full text

WLC08-5: Link-Level Modeling and Performance of CDMA Interference Cancellation by Jilei Hou, Smee, J.E., Soriaga, J.B., Jinghu Chen, Pfister, H.D.

“…A general framework is provided to characterize the link level performance of CDMA systems with interference cancellation. This closed-form residual power…”
Get full text

Parity-accumulate codes for magnetic recording by Oberg, M., Pfister, H.D., Siegel, P.H.

Get full text