Approaching the ergodic capacity with lattice coding

Proceedings - IEEE Global Communications Conference, GLOBECOM

Volumn , Issue , 2014, Pages 1492-1496

  Hindy, Ahmed ^a   Nosratinia, Aria ^a  

^a The University of Texas at Dallas   (United States)

Author keywords

Channel capacity; ergodic channel; minimum mean square error (MMSE) estimation; nested lattice codes

Indexed keywords

CHANNEL CAPACITY; DECODING; GAUSSIAN NOISE (ELECTRONIC); MEAN SQUARE ERROR; SIGNAL TO NOISE RATIO; WHITE NOISE;

ADDITIVE WHITE GAUSSIAN NOISE CHANNEL; CHANNEL'S CAPACITY; ERGODIC CAPACITY; ERGODIC CHANNELS; ERGODICS; LATTICE CODES; LATTICE CODING; MINIMUM MEAN-SQUARE-ERROR ESTIMATIONS; NESTED LATTICE CODES; PERFORMANCE;

FADING CHANNELS;

EID: 84949922779     PISSN: 23340983     EISSN: 25766813     Source Type: Conference Proceeding    
DOI: 10.1109/GLOCOM.2014.7037019     Document Type: Conference Paper

References (14)

1. J. Körner and K. Marton, "How to encode the modulo-two sum of binary sources (corresp. )," IEEE Trans. Inf. Theory, vol. 25, no. 2, pp. 219-221, Mar. 1979
2. U. Erez and R. Zamir, "Achieving 1/2log(1+SNR) on the AWGN channel with lattice encoding and decoding," IEEE Trans. Inf. Theory, vol. 50, no. 10, pp. 2293-2314, Oct. 2004
3. U. Erez, S. Litsyn, and R. Zamir, "Lattices which are good for (almost) everything," IEEE Trans. Inf. Theory, vol. 51, no. 10, pp. 3401-3416, Oct. 2005
4. H. El-Gamal, G. Caire, and M. O. Damen, "Lattice coding and decoding achieve the optimal diversity-multiplexing tradeoff of MIMO channels," IEEE Trans. Inf. Theory, vol. 50, no. 6, pp. 968-985, Jun. 2004
5. A. Ozgur and S. Diggavi, "Approximately achieving gaussian relay network capacity with lattice-based qmf codes," IEEE Trans. Inf. Theory, vol. 59, no. 12, pp. 8275-8294, Dec. 2013
6. A. Avestimehr, S. Diggavi, and D. Tse, "Wireless network information flow: A deterministic approach," IEEE Trans. Inf. Theory, vol. 57, no. 4, pp. 1872-1905, Apr. 2011
7. Y. Song and N. Devroye, "Lattice codes for the Gaussian relay channel: Decode-and-forward and compress-and-forward," IEEE Trans. Inf. Theory, vol. 59, no. 8, pp. 4927-4948, Aug. 2013
8. B. Nazer and M. Gastpar, "Compute-and-forward: Harnessing interference through structured codes," IEEE Trans. Inf. Theory, vol. 57, no. 10, pp. 6463-6486, Oct. 2011
9. O. Ordentlich, U. Erez, and B. Nazer, "The approximate sum capacity of the symmetric Gaussian K-user interference channel," IEEE Trans. Inf. Theory, to appear
10. A. Sakzad, E. Viterbo, Y. Hong, and J. Boutros, "On the ergodic rate for compute-and-forward," in International Symposium on Network Coding (NetCod), Jun. 2012
11. H. A. Loeliger, "Averaging bounds for lattices and linear codes," IEEE Trans. Inf. Theory, vol. 43, no. 6, pp. 1767-1773, Nov. 1997
12. J. Jalden and B. Ottersten, "On the complexity of sphere decoding in digital communications," IEEE Trans. Signal Process., vol. 53, no. 4, pp. 1474-1484, Apr. 2005
13. R. Zamir and M. Feder, "On lattice quantization noise," IEEE Trans. Inf. Theory, vol. 42, no. 4, pp. 1152-1159, Jul. 1996
14. A. El Gamal and Y. Kim, Network Information Theory. Cambridge University Press, 2011.