Article Contents

Article Navigation> JOURNAL OF BEIJING INSTITUTE OF TECHNOLOGY> 2014> 23(3): 407-412

CAO Cong-zhe, FEI Ze-song, KUANG Jing-ming. Efficient Luby transform encoding algorithm based on short cycle elimination[J]. JOURNAL OF BEIJING INSTITUTE OF TECHNOLOGY, 2014, 23(3): 407-412.

Citation:

CAO Cong-zhe, FEI Ze-song, KUANG Jing-ming. Efficient Luby transform encoding algorithm based on short cycle elimination[J].JOURNAL OF BEIJING INSTITUTE OF TECHNOLOGY, 2014, 23(3): 407-412.

CAO Cong-zhe, FEI Ze-song, KUANG Jing-ming. Efficient Luby transform encoding algorithm based on short cycle elimination[J]. JOURNAL OF BEIJING INSTITUTE OF TECHNOLOGY, 2014, 23(3): 407-412.

Citation:

CAO Cong-zhe, FEI Ze-song, KUANG Jing-ming. Efficient Luby transform encoding algorithm based on short cycle elimination[J].JOURNAL OF BEIJING INSTITUTE OF TECHNOLOGY, 2014, 23(3): 407-412.

PDF( 351 KB)

Efficient Luby transform encoding algorithm based on short cycle elimination

School of Information and Electronics, Beijing Institute of Technology, Beijing 100081, China

Received Date:2013-01-26

Abstract

Abstract

An effective Luby transform (LT) encoding algorithm based on short cycle elimination is proposed to improve decoding probabilities of short length LT codes. By searching the generator matrix, some special encoded symbols are generated by the encoder to effectively break the short cycles that have negative effect on the performance of LT codes. Analysis and numerical results show that by employing the proposed algorithm, the encoding complexity decreases and the decoding probabilities improve both in binary erasure channels (BECs) and additive white gauss noise (AWGN) channels.
- Luby transform (LT) codes,
- short cycle,
- encoding algorithm

FullText(HTML)

References (12)

References

[1]	Byers J W, Luby M, Mitzenmacher M. A digital fountain approach to asynchronous reliable multicast [J]. IEEE Journal on Selected Areas in Communications, 2002, 20(8): 1528-1540.
[2]	Luby M. LT codes [C]//IEEE Symposium on Foundations of Computer Science, Vancouver, Canada, 2002:271-280.
[3]	Shokrollahi A. Raptor codes [J]. IEEE Transactions on Information Theory, 2006, 52(6): 271-280.
[4]	Etesami O, Shokrollahi A. Raptor codes on binary memoryless symmetric channels [J]. IEEE Trans Inform Theory, 2006, 52(5): 2033-2051.
[5]	Castura J, Mao Y. Raptor coding over fading channels [J].IEEE Communications Letters, 2006, 10(1): 46-48.
[6]	Liu X, Lim T. Fountain codes over fading relay channels [J]. IEEE Transactions on Wireless Communications, 2009, 8(6): 3278-3287.
[7]	Jiang T, Li X. Using fountain codes to control the peak-to average power ratio of OFDM signals [J]. IEEE Transactions on Vehicular Technology, 2010, 59(8): 3779-3785.
[8]	Cheng Z, Castura J, Mao Y. On the design of raptor codes for binary-input gaussian channels [J]. IEEE Transactions on Communications, 2009, 57(11):3269-3277.
[9]	Hussain I, Xiao M, Rasmussen L K. Error floor analysis of LT codes over the additive white Gaussian noise channel [C]//Proc IEEE Global Telecommunications Conference (GLOBECOM), Houston, USA, 2011: 1-5.
[10]	Puducheri S, Kliewer J, Fuja T E. The design and performance of distributed LT codes [J]. IEEE Transactions on Information Theory, 2007, 53(10): 3740-3754.
[11]	Kou Y, Lin S, Fossorier M. Low density parity check codes construction based on finite geometries: a rediscovery and more [J]. IEEE Transactions on Information Theory, 2001, 47(6): 2711-2736.
[12]	Kou Y, Lin S, Fossorier M. Construction of low density parity check codes: A geometric approach [C]//Proc 2nd Int. Symp on Turbo Codes and Related Topics, Brest, France, 2000:137-140.