Pivoting algorithms for maximum likelihood decoding of LDPC codes over erasure channels

GLOBECOM - IEEE Global Telecommunications Conference

Volumn , Issue , 2009, Pages

  Liva, Gianluigi ^a   Matuz, Balazs ^a   Paolini, Enrico ^b   Chiani, Marco ^b  

^a GERMAN AEROSPACE CENTER DLR   (Germany)

^b UNIVERSITY OF BOLOGNA   (Italy)

Author keywords

Erasure channel; Gaussian elimination; Low density parity check codes; Maximum likelihood decoding

Indexed keywords

AVERAGE NUMBERS; COMPUTING PLATFORM; DATA RATES; DECODING COMPLEXITY; ERASURE CHANNELS; ERASURE DECODING; GAUSSIAN ELIMINATION; HIGH DATA RATE; LDPC CODES; LOW-DENSITY PARITY-CHECK CODES; MAXIMUM LIKELIHOOD DECODING; MAXIMUM-LIKELIHOOD DECODING ALGORITHMS; NUMERICAL RESULTS; OPTIMUM PERFORMANCE; OVER-ERASURE; SOFTWARE IMPLEMENTATION;

CHANNEL CAPACITY; CODING ERRORS; DECODING; MAXIMUM LIKELIHOOD ESTIMATION; NUMERICAL ANALYSIS; SATELLITE COMMUNICATION SYSTEMS; SIGNAL ENCODING;

ALGORITHMS;

EID: 77951588616     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/GLOCOM.2009.5426289     Document Type: Conference Paper

References (20)

1. J. Byers, M. Luby, M. Mitzenmacher, and A. Rege, "A digital fountain approach to reliable distribution of bulk data," SIGCOMM Comput. Commun. Rev., vol. 28, no. 4, pp. 56-67, Oct. 1998.
2. M. Luby, M. Mitzenmacher, M. Shokrollahi, and D. Spielman, "Efficient erasure correcting codes," IEEE Trans. Inf. Theory, vol. 47, no. 2, pp. 569-584, Feb. 2001.
3. M. Luby, "LT codes," in Proc. of the 43rd IEEE Symp. on Foundations of Computer Science, Vancouver, Canada, Nov. 2002, pp. 271-282.
4. M. Shokrollahi, "Raptor codes," IEEE Trans. Inf. Theory, vol. 52, no. 6, pp. 2551-2567, June 2006.
5. "Transmission System for Handheld Terminals (DVB-H)," Digital Video Broadcasting (DVB)," Blue Book, 2004.
6. "Framing structure, channel coding and modulation for Satellite Services to Handheld devices (SH) below 3GHz," Digital Video Broadcasting (DVB)," Blue Book, 2007.
7. 3GPP TS 26.346 V8.0.0, "Technical specification group services and system aspects; multimedia broadcast/multicast service; protocols and codecs," Sept. 2008.
8. G. P. Calzolari, M. Chiani, F. Chiaraluce, R. Garello, and E. Paolini, "Channel coding for future space missions: New requirements and trends," Proc. IEEE, vol. 95, no. 11, pp. 2157-2170, Nov. 2007.
9. A. Dimakis, V. Prabhakaran, and K. Ramchandran, "Decentralized erasure codes for distributed networked storage," IEEE Trans. Inf. Theory, vol. 52, no. 6, pp. 2809- 2816, June 2006.
10. G. Liva, T. De Cola, D. Giggenbach, N. Perlot, E. Paolini, M. Chiani, G. P. Calzolari "Packet Loss Recovery via Maximum-Likelihood LDPC Decoding," presented at the CCSDS Fall Meeting, October 2008, Berlin.
11. R. G. Gallager, Low-Density Parity-Check Codes. Cambridge, MA: M.I.T. Press, 1963.
12. P. Oswald and M. A. Shokrollahi, "Capacity-achieving sequences for the erasure channel," IEEE Trans. Inf. Theory, vol. 48, no. 12, pp. 364-373, Dec. 2002.
13. H. Pfister and I. Sason, "Accumulate-repeat-accumulate codes: Capacityachieving ensembles of systematic codes for the erasure channel with bounded complexity," IEEE Trans. Inf. Theory, vol. 53, no. 6, pp. 2088-2115, June 2007.
14. E. Paolini, G. Liva, B. Matuz, and M. Chiani, "Generalized IRA erasure correcting codes for hybrid Iterative/Maximum Likelihood decoding," IEEE Commun. Lett., vol. 12, no. 6, pp. 450-452, June 2008.
15. C. Di, D. Proietti, I. E. Telatar, T. J. Richardson, and R. Urbanke, "Finitelength analysis of low-density parity-check codes on the binary erasure channel," IEEE Trans. Inf. Theory, vol. 48, no. 6, pp. 1570-1579, June 2002.
16. D. Burshtein and G. Miller, "An efficient maximum likelihood decoding of LDPC codes over the binary erasure channel," IEEE Trans. Inf. Theory, vol. 50, no. 11, pp. 2837-2844, Nov. 2004.
17. R. M. Tanner, "A recursive approach to low complexity codes," IEEE Trans. Inf. Theory, vol. 27, no. 5, pp. 533-547, Sept. 1981.
18. B. A. LaMacchia and A. M. Odlyzko, "Solving Large Sparse Linear Systems over Finite Fields," Lecture Notes in Computer Science, vol. 537, pp. 109-133, 1991.
19. H. Jin, A. Khandekar, and R. McEliece, "Irregular repeat-accumulate codes," in Proc. of the 2nd Int. Symp. on Turbo codes & Related Topics, Brest, France, Sept. 2000, pp. 1-8.
20. X. Hu, E. Eleftheriou, and D. Arnold, "Regular and irregular progressive edge-growth Tanner graphs," IEEE Trans. Inf. Theory, vol. 51, no. 1, pp. 386-398, Jan. 2005.