Distributed Decoding for Wyner Cellular Systems

This paper investigates a one-dimensional model of a cellular Gaussian multiple-access channel based on the model in- troduced by Wyner. A closed form expression is given for the sum- rate constraint with a finite number of cells. It is demonstrated that optimal joint decoding can be accomplished using a variation of the forward-backward algorithm that operates on the posterior codeword probabilities.

[1]  John Cocke,et al.  Optimal decoding of linear codes for minimizing symbol error rate (Corresp.) , 1974, IEEE Trans. Inf. Theory.

[2]  Robert M. Gray,et al.  On the asymptotic eigenvalue distribution of Toeplitz matrices , 1972, IEEE Trans. Inf. Theory.

[3]  Charles R. Johnson,et al.  Matrix analysis , 1985, Statistical Inference for Engineers and Data Scientists.

[4]  Shlomo Shamai,et al.  Information-theoretic considerations for symmetric, cellular, multiple-access fading channels - Part II , 1997, IEEE Trans. Inf. Theory.

[5]  R. Chang,et al.  On receiver structures for channels having memory , 1966, IEEE Trans. Inf. Theory.

[6]  Shlomo Shamai,et al.  Information-theoretic considerations for symmetric, cellular, multiple-access fading channels - Part I , 1997, IEEE Trans. Inf. Theory.

[7]  Aaron D. Wyner,et al.  Shannon-theoretic approach to a Gaussian cellular multiple-access channel , 1994, IEEE Trans. Inf. Theory.

[8]  Alex J. Grant,et al.  Information capacity of wyner's cellular network with LMMSE receivers , 2004, 2004 IEEE International Conference on Communications (IEEE Cat. No.04CH37577).