164 citations · 1.2k across the 72 of their papers we have counts for
5 papers · 2 filters
Universal Codes for the Gaussian MAC via Spatial Coupling
Arvind Yedla, Phong S. Nguyen, Henry D. Pfister +1
We consider transmission of two independent and separately encoded sources over a two-user binary-input Gaussian multiple-access channel. The channel gains are assumed to be unknow…
Convergence of Weighted Min-Sum Decoding Via Dynamic Programming on Trees
Yung-Yih Jian, Henry D. Pfister
Applying the max-product (and belief-propagation) algorithms to loopy graphs is now quite popular for best assignment problems. This is largely due to their low computational compl…
Spatially-Coupled Codes and Threshold Saturation on Intersymbol-Interference Channels
Phong S. Nguyen, Arvind Yedla, Henry D. Pfister +1
Recently, it has been observed that terminated low-density-parity-check (LDPC) convolutional codes (or spatially-coupled codes) appear to approach capacity universally across the c…
Universality for the Noisy Slepian-Wolf Problem Via Spatial Coupling
Arvind Yedla, Henry D. Pfister, Krishna Narayanan
We consider a noisy Slepian-Wolf problem where two correlated sources are separately encoded and transmitted over two independent binary memoryless symmetric channels. Each channel…
Joint Decoding of LDPC Codes and Finite-State Channels via Linear-Programming
Byung-Hak Kim, Henry D. Pfister
This paper considers the joint-decoding (JD) problem for finite-state channels (FSCs) and low-density parity-check (LDPC) codes. In the first part, the linear-programming (LP) deco…