A hybrid coding scheme for the Gilbert-Elliott channel

IEEE Transactions on Communications

Volumn 54, Issue 10, 2006, Pages 1787-1796

  Chen, Jinghu ^a,b   Tanner, R Michael ^a  

^a UNIVERSITY OF ILLINOIS AT CHICAGO   (United States)

^b QUALCOMM INC   (United States)

Author keywords

Belief propagation (BP) decoding; Channels with memory; Gilbert Elliott (GE) channels; Hamming codes; Low density parity check (LDPC) codes

Indexed keywords

BIT ERROR RATE; COMMUNICATION CHANNELS (INFORMATION THEORY); COMPUTER SIMULATION; DECODING; ERROR CORRECTION;

BELIEF PROPAGATION (BP) DECODING; GILBERT-ELLIOTT CHANNEL; GRAPH-BASED ERROR-CORRECTING CODES; HAMMING CODES; LOW DENSITY PARITY-CHECK (LDPC) CODES;

CODES (SYMBOLS);

EID: 33750388627     PISSN: 00906778     EISSN: None     Source Type: Journal    
DOI: 10.1109/TCOMM.2006.881365     Document Type: Article

References (20)

1. R. G. Gallager, Low Density Parity Check Codes. Cambridge, MA: MIT Press, 1963.
2. R. M. Tanner, "A recursive approach to low-complexity codes," IEEE Trans. Inf. Theory, vol. IT-27, no. 7, pp. 533-548, Sep. 1981.
3. F. R. Kschischang, B. J. Frey, and H.-A. Loeliger, "Factor graphs and the sum-product algorithm," IEEE Trans. Inf. Theory, vol. 47, no. 2, pp. 498-519, Feb. 2001.
4. M. Lentmaier and K. Zigangirov, "On generalized low-density parity-check codes based on Hamming component codes," IEEE Commun. Lett., vol. 3, no. 8, pp. 248-250, Aug. 1999.
5. D. J. C. MacKay, "Good error-correcting codes based on very sparse matrices," IEEE Trans. Inf. Theory, vol. 45, no. 2, pp. 399-431, Mar. 1999.
6. T. J. Richardson and R. L. Urbanke, "The capacity of low-density parity-check codes under message-passing decoding," IEEE Trans. Inf. Theory, vol. 47, no. 2, pp. 599-618, Feb. 2001.
7. M. Mushkin and I. Bar-David, "Capacity and coding for the Gilbert-Elliot channels," IEEE Trans. Inf. Theory, vol. 35, no. 6, pp. 1277-1290, Nov. 1989.
8. H.-S. Wang and N. Moayeri, "Finite-state Markov channel - A useful model for radio communication channels," IEEE Trans. Veh. Technol., vol. 44, no. 1, pp. 163-171, Feb. 1995.
9. H.-S. Wang and P.-C. Chang, "On verifying the first-order Markovian assumption for a Rayleigh fading channel model," IEEE Trans. Veh. Technol., vol. 45, no. 2, pp. 353-357, May 1996.
10. J. Garcia-Frias and J. D. Villasenor, "Turbo decoding of Gilbert-Elliott channels," IEEE Trans. Commun., vol. 50, no. 3, pp. 357-363, Mar. 2002.
11. J. Garcia-Frias, "Decoding of low-density parity-check codes over finite-state binary Markov channels," in Proc. IEEE Int. Symp. Inf. Theory, Washington, DC, Jun. 2001, p. 72.
12. A. W. Eckford, F. R. Kschischang, and S. Pasupathy, "Analysis of low-density parity-check codes for the Gilbert-Elliott channel," IEEE Trans. Inf. Theory, vol. 51, no. 11, pp. 3872-3889, Nov. 2005.
13. L. R. Bahl, J. Cocke, F. Jelinek, and J. Raviv, "Optimal decoding of linear codes for minimizing symbol error rate," IEEE Trans. Inf. Theory, vol. IT-20, no. 2, pp. 248-287, Mar. 1974.
14. N. Wiberg, "Codes and decoding on general graphs," Ph.D. dissertation, Linköping Univ., Linköping, Sweden, 1996.
15. A. W. Eckford, F. R. Kschischang, and S. Pasupathy, "Designing good LDPC codes for Markov-modulated channels," in Proc. IEEE Int. Symp. Inf. Theory, Chicago, IL, Jun. 2004, p. 373.
16. J. Hagenauer, E. Offer, and L. Papke, "Iterative decoding of binary block and convolutional codes," IEEE Trans. Inf. Theory, vol. 42, no. 2, pp. 429-445, Mar. 1996.
17. R. M. Pyndiah, "Near-optimum decoding of product codes: Block turbo codes," IEEE Trans. Commun., vol. 46, no. 8, pp. 1003-1010, Aug. 1998.
18. R. M. Tanner, "A [155,64,20] sparse graph (LDPC) code," presented at the IEEE Int. Symp. Inf. Theory, Sorrento, Italy, Jun. 2000.
19. D. Sridhara, T. Fuja, and R. M. Tanner, "Low density parity check codes from permutation matrices," in Proc. Conf. Inf. Sci. Syst., Baltimore, MD, Mar. 2001, p. 142.
20. J. Wolf, "Efficient maximum likelihood decoding of linear block codes using a trellis," IEEE Trans. Inf. Theory, vol. IT-24, no. 1, pp. 76-80, Jan. 1978.