LT码的一种非阶梯化高斯消元译码算法  

Non-row Echeloned Gaussian Elimination Decoding of LT Codes

作　　者：贺亮 雷菁[1] 黄英[1] HE Liang;LEI Jing;HUANG Ying(School of Electronic Science,National University of Defense Technology,Changsha 410073,China)

机构地区：[1]国防科技大学电子科学学院,湖南长沙410073

出　　处：《无线电通信技术》2019年第3期276-279,共4页Radio Communications Technology

基　　金：国家自然科学基金项目(61702536)

摘　　要：LT码是一种应用于删除信道上的编码方法,使用BP译码算法,译码复杂度低但译码开销较大,而高斯消元译码算法可以实现最低译码开销。提出了一种非阶梯化低复杂度的高斯消元方法,当BP译码遇到停止集时,对当前的生成矩阵进行高斯消元,使得简化后的矩阵能够有再次进行BP译码的可能。给出了算法的具体步骤,通过仿真,表明了该算法在保持低开销的同时,相比原始的高斯消元算法,大大减小了复杂度。。LT codes are a kind of coding scheme over erasure channels.Using BP decoding algorithm can reduce the computational complexity,but results in a large overhead,while by Gaussian elimination,a minimum overhead can be obtained.A non-row echeloned Gaussian elimination algorithm is proposed.When BP decoding meets stop sets,the Gaussian elimination is applied on the current matrix,then BP decoding can be performed again on the reduced matrix.The details of the algorithm are presented.Simulation shows that the proposed algorithm decreases the complexity comparing to the original one,and maintains the low overhead at the same time.

关 键 词：LT码 删除信道 高斯消元 低复杂度 

分 类 号：TN911.22[电子电信—通信与信息系统]