Jointly decoded raptor codes: Analysis and design for the biawgn channel

Eurasip Journal on Wireless Communications and Networking

Volumn 2009, Issue , 2009, Pages

  Venkiah, Auguste ^a   Poulliat, Charly ^a   Declercq, David ^a  

^a UNIVERSITÉ DE CERGY PONTOISE   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ANALYSIS AND DESIGN; ASYMPTOTIC CONVERGENCE; CHANNEL VARIATIONS; DEGREE DISTRIBUTIONS; ERASURE CHANNELS; ERROR FLOOR; FINITE LENGTH CODES; FOUNTAIN CODES; GAUSSIAN CHANNELS; JOINT DECODING; LOW RATES; OPTIMIZATION METHOD; OPTIMIZED DISTRIBUTION; RAPTOR CODES; ROBUSTNESS PROPERTIES; SOFT INFORMATION;

CHANNEL CAPACITY; ITERATIVE DECODING; OPTIMIZATION;

ASYMPTOTIC ANALYSIS;

EID: 69249229613     PISSN: 16871472     EISSN: 16871499     Source Type: Journal    
DOI: 10.1155/2009/657970     Document Type: Article

References (18)

1. Byers J. W., Luby M., Mitzenmacher M., Rege A., A digital fountain approach to reliable distribution of bulk data Computer Communication Review 1998 28 4 56 67
2. Luby M., LT codes Proceedings of the 43rd Annual Symposium on Foundations of Computer Science (STOC 02) 2002 271 280
3. Shokrollahi A., Raptor codes IEEE Transactions on Information Theory 2006 52 6 2551 2567
4. Maymounkov P., Online codes 2002 November Tech. Rep. TR2003-883 New York University
5. Etesami O., Shokrollahi A., Raptor codes on binary memoryless symmetric channels IEEE Transactions on Information Theory 2006 52 5 2033 2051
6. Pishro-Nik H., Fekri F., On raptor codes 3 Proceedings of the IEEE International Conference on Communications (ICC 06) June 2006 1137 1141
7. Karp R., Luby M., Shokrollahi A., Finite length analysis of LT codes Proceedings of the IEEE International Symposium on Information Theory (ISIT 04) July 2004 Chicago, Ill, USA 39
8. Maneva E., Shokrollahi A., New model for rigorous analysis of LT-codes Proceedings of the IEEE International Symposium on Information Theory (ISIT 06) July 2006 Seattle, Wash, USA 2677 2679
9. Pakzad P., Shokrollahi A., Design principles for raptor codes Proceedings of the IEEE Information Theory Workshop (ITW 06) March 2006 13 20
10. Hu X.-Y., Eleftheriou E., Arnold D. M., Regular and irregular progressive edge-growth tanner graphs IEEE Transactions on Information Theory 2005 51 1 386 398
11. Tian T., Jones C. R., Villasenor J. D., Wesel R. D., Selective avoidance of cycles in irregular LDPC code construction IEEE Transactions on Communications 2004 52 8 1242 1247
12. Roumy A., Guemghar S., Caire G., Verd S., Design methods for irregular repeat accumulate codes IEEE Transactions on Information Theory 2004 50 1711 1727
13. Venkiah A., Poulliat C., Declercq D., Analysis and design of raptor codes for joint decoding using information content evolution Proceedings of the IEEE International Symposium on Information Theory (ISIT 07) 2007 Nice, France 421 425
14. Chung S.-Y., Richardson T. J., Urbanke R. L., Analysis of sum-product decoding of low-density parity-check codes using a Gaussian approximation IEEE Transactions on Information Theory 2001 47 2 657 670
15. Richardson T. J., Shokrollahi M. A., Urbanke R. L., Design of capacity-approaching irregular low-density parity-check codes IEEE Transactions on Information Theory 2001 47 2 619 637
16. Richardson T. J., Urbanke R. L., The capacity of low-density parity-check codes under message-passing decoding IEEE Transactions on Information Theory 2001 47 2 599 618
17. Ten Brink S., Convergence behavior of iteratively decoded parallel concatenated codes IEEE Transactions on Communications 2001 49 10 1727 1737
18. Venkiah A., Declercq D., Poulliat C., Design of cages with a randomized progressive edge-growth algorithm IEEE Communications Letters 2008 12 4 301 303