New Gallager bounds in block-fading channels

IEEE Transactions on Information Theory

Volumn 53, Issue 2, 2007, Pages 684-694

  Wu, Xiaofu ^a,b   Xiang, Haige ^a   Ling, Cong ^c  

^a PEKING UNIVERSITY   (China)

^b SOUTHEAST UNIVERSITY   (China)

^c KING'S COLLEGE LONDON   (United Kingdom)

Author keywords

Block fading channels; Gallager bounds; Turbo codes; Upper bounds; Weight enumeration

Indexed keywords

BINARY CODES; BLOCK CODES; FADING CHANNELS; TURBO CODES;

BLOCK-FADING CHANNELS; GALLAGER BOUND;

COMMUNICATION CHANNELS (INFORMATION THEORY);

EID: 33847645304     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2006.888999     Document Type: Article

References (21)

1. R. G. Gallager, Low-Density Parity-Check Codes. Cambridge, MA: MIT Press, 1963.
2. R. G. Gallager, "A simple derivation of the coding theorem and some applications," IEEE Trans. Inf. Theory, vol. 11, pp. 3-18, Jan. 1965.
3. R. G. Gallager, Information Theory and Reliable Communications. New York: Wiley, 1968.
4. S. Shamai and I. Sason, "Variations on the Gallager bounds, connections, and applications," IEEE Trans. Inf. Theory, vol. 48, pp. 3029-3051, Dec. 2002.
5. G. Poltyrev, "Bounds on the decoding error probability of binary linear codes via their spectra," IEEE Trans. Inf. Theory, vol. 40, pp. 1284-1292, Jul. 1994.
6. T. M. Duman and M. Salehi, "New performance bounds for turbo codes," IEEE Trans. Commun., vol. 46, pp. 717-723, Jun. 1998.
7. I. Sason and S. Shamai, "On improved bounds on the decoding error probability of block codes over interleaved fading channels, with applications to turbo-like codes," IEEE Trans. Inf. Theory, vol. 47, pp. 2275-2299, Sep. 2001.
8. E. Malkamäki and H. Leib, "Evaluating the performance of convolutional codes over block-fading channels," IEEE Trans. Inf. Theory, vol. 45, pp. 1643-1646, Jul. 1999.
9. H. Bouzekri and S. Miller, "Distance spectra and performance bounds of space-time trellis codes over quasistatic fading channels," IEEE Trans. Inf. Theory, vol. 50, pp. 1820-1831, Aug. 2004.
10. C. Ling, K. H. Li, and A. C. Kot, "Performance of space-time codes: Gallager bounds and weight enumeration," IEEE Trans. Inf. Theory, submitted for publication.
11. M. K. Simon and M.-S. Alouini, Digital Communication Over Fading Channels. New York: Wiley, 2000.
12. S. Zummo and W. Stark, "Performance analysis of binary coded systems over Rician block-fading channels," in Proc. MILCOM 2003, Vancouver, BC, Canada, 2003, pp. 314-319.
13. I. Sason, S. Shamai, and D. Divsalar, "Tight exponential upper bounds on the ML decoding error probability of block codes over fully interleaved fading channels," IEEE Trans. Commun., vol. 51, pp. 1296-1305, Aug. 2003.
14. D. W. Stroock A Concise Introduction to the Theory of Integration. Boston, MA: Birkhäuser, 1994.
15. M. Schwartz, W. R. Bennett, and S. Stein, Communication Systems and Techniques. New York: McGraw-Hill, 1966.
16. S. Gong, Concise Complex Analysis. Singapore: World Scientific, 2001.
17. E. Malkamäki and H. Leib, "Coded diversity on block-fading channels," IEEE Trans. Inf. Theory, vol. 45, pp. 771-781, Mar. 1999.
18. R. Knopp and P. Humblet, "On coding for block-fading channels," IEEE Trans. Inf. Theory, vol. 46, pp. 189-204, Mar. 2000.
19. A. Guillén i Fàbregas and G. Caire, "Coded modulation in the block-fading channel: Coding theorems and code construction," IEEE Trans. Inf. Theory, vol. 52, pp. 91-113, Jan. 2006.
20. J. Boutros, E. C. Strinati, and A. Guillén i Fàbregas, "Turbo code design for block-fading channels," in Proc. 42th Annu. Allerton Conf. Commun., Contr. Comput., Allerton, IL, 2004, pp. 121-141.
21. C. Berrou, A. Glavieux, and P. Thitimajshima, "Near Shannon limit error-correcting coding and decoding: Turbo-codes," in Proc. ICC'93, Geneva, Switzerland, May 1993, pp. 1064-1070.