中短长度LT码的展开图构造方法

龚茂康

doi:10.3724/SP.J.1146.2008.00218

中短长度LT码的展开图构造方法

doi: 10.3724/SP.J.1146.2008.00218

龚茂康

计量
- 文章访问数: 2906
- HTML全文浏览量: 64
- PDF下载量: 828
- 被引次数: 0
出版历程
- 收稿日期: 2008-02-27
- 修回日期: 2008-11-27
- 刊出日期: 2009-04-19

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

Gong Mao-kang

摘要

摘要: 该文提出了中短长度LT码的展开图构造方法。该方法以输出节点为根展开Tanner图，当满足停止准则后，随机选择未被覆盖或最深展开层的输入节点与根相连。展开图法通过展开深度门槛和最大可展深度两个参数的设置，在控制短环的基础上, 在尽可能大的范围内随机地选择输入节点。仿真结果表明，该方法与随机图等方法相比，能够有效地改善中短长度LT码的性能。
- 信道编码;LT 码;Tanner图
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.

HTML全文

参考文献(1)

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

施引文献

资源附件(0)

访问统计