Unfolding Graphs for Constructing of Short and Moderate-Length LT Codes

Gong Mao-kang

doi:10.3724/SP.J.1146.2008.00218

Volume 31 Issue 4

Dec. 2010

Turn off MathJax

Article Contents

Article Navigation > Journal of Electronics & Information Technology > 2009 > 31(4): 885-888

Gong Mao-kang. Unfolding Graphs for Constructing of Short and Moderate-Length LT Codes[J]. Journal of Electronics & Information Technology, 2009, 31(4): 885-888. doi: 10.3724/SP.J.1146.2008.00218

Citation:

Gong Mao-kang. Unfolding Graphs for Constructing of Short and Moderate-Length LT Codes[J]. Journal of Electronics & Information Technology, 2009, 31(4): 885-888. doi: 10.3724/SP.J.1146.2008.00218

Gong Mao-kang. Unfolding Graphs for Constructing of Short and Moderate-Length LT Codes[J]. Journal of Electronics & Information Technology, 2009, 31(4): 885-888. doi: 10.3724/SP.J.1146.2008.00218

Citation:

Gong Mao-kang. Unfolding Graphs for Constructing of Short and Moderate-Length LT Codes[J]. Journal of Electronics & Information Technology, 2009, 31(4): 885-888. doi: 10.3724/SP.J.1146.2008.00218

PDF( 203 KB)

Unfolding Graphs for Constructing of Short and Moderate-Length LT Codes

doi: 10.3724/SP.J.1146.2008.00218

Gong Mao-kang

Received Date: 2008-02-27
Rev Recd Date: 2008-11-27
Publish Date: 2009-04-19

Abstract

Abstract

This paper proposes one construction method for short and moderate-length Luby Transform (LT) codes by unfolding Tanner graphs from every output node as root. For each output node, when the stopping criterion is satisfied, one uncovered input node or one input node on the deepest layer is randomly selected and connected to the root. Two parameters, the unfolding depth threshold and the maximal unfolding depth, are adjusted to control the girth of short cycles and make the range of random selection as large as possible. Simulation shows the performance improvements of the proposed algorithms are obvious compared with the random graph method for short and moderate length LT code.

FullText(HTML)

References(1)

References

Mackay D J C. Fountain codes[J].IEE Proc. Commun.2005,152(6):1062-1068[2]Mackay D J C. Good error correcting codes based on verysparse matrix[J].IEEE Trans. on Info. Theory.1999, 45(2):399-431[3]Wagner J P, Chakareski J, and Frossard P. Streaming ofscalable video from multiple servers using rateless codes[C].XVII International Conference on Electrical Machines,Chania, Crete Island, Greece, September 2-5, 2006:1501-1504.Luby M, Watson M, Gasiba T, Stockhammer T, and Xu Wen.Raptor codes for reliable download delivery in wirelessbroadcast systems[C]. IEEE Consumer Communications andNetworking Conference Las Vegas, Nevada, USA, January8-10, 2006: 192-197.[4]Luby M. LT codes[C]. Proc. 43rd Ann. IEEE Symp. onFoundations of Computer Science, Vancouver, BC, Canada,November 16-16, 2002: 271-282.[5]Shokrollahi A. Raptor codes[J].IEEE Trans. on Info. Theory.2006, 52(6):2551-2567[6]Luby M, Gasiba T, Stockhammer T, and Watson M. Reliablemultimedia download delivery in cellular broadcastnetwork[J].IEEE Trans. on Broadcasting.2007, 53(1):235-246[7]Pakzad P and Shokrollahi A. Design principles for raptorcodes[C]. 2006IEEE Info. Theory Workshop, Uruguay, March13-17, 2006: 165-169.[8]Zhu Hongjie, Zhang Chao, and Lu Jianhua. Designing offountain codes with short code-length[C]. The ThirdInternational Workshop on Signal Design and ItsApplications in Communications, Chengdu, China,September 23-27, 2007: 65-68.[9]Puducheri S, Kliewer J, and Fuja T E. The design andperformance of distributed LT codes[J].IEEE Trans. on Info.Theory.2007, 53(10):3740-3754[10]Etesami O and Shokrollahi A. Raptor codes on binarymemoryless symmetric channels[J].IEEE Trans. on Info.Theory.2006, 52(5):2033-2051[11]Hyytia E, Tirronen T, and Virtamo J. Optimal degreedistribution for LT codes with small message length[C]. IEEEINFOCOM 2007, Anchorage, Alaska, USA, May 6-12, 2007:2576-2580.[12]Hu X Y, Eleftheriou E, and Arnold D M. Regular andirregular progressive edge-growth tanner graphs[J].IEEETrans. on Info. Theory.2005, 51(1):386-398

Relative Articles

Supplements(0)

Cited By

Proportional views