欢迎您！东篱公司
退出
-
申报数据库
-
立项数据库
-
成果数据库
-
项目获奖数据库
中文摘要：
IRA码的译码通常采用BP译码算法,然而BP译码算法复杂度高,硬件电路实现困难。最小和译码算法虽然降低了运算复杂度和硬件实现难度,但是其牺牲了部分译码性能。五线段近似算法对BP算了做了近似简化,然而其复杂度依然偏高。提出了一种基于五线段近似和最小和的改进译码算法,在降低系统译码复杂度的同时,保持较高的译码性能。仿真结果表明,改进的译码算法在降低了复杂度的情况下,仍能得到较高的译码性能。
英文摘要：
IRA codes decoding usually adopt BP algorithm. Compared with BP algorithm, Min-Sum decoding al- gorithm sacrifices parts of the decoding performance when reduces computing complexity. Five-line approximation algorithm simplifies BP algorithm, but its complexity is still on the high side. Considering the different convergence speed of IRA code＇ s nodes when decoding, presents an algorithm combined with Five-line approximation algorithm and Min-Sum algorithm, based on the new iterative strategy. The simulation results show that, compared with Five- line approximation algorithm, the improved decoding algorithm can decrease complexity and keep good perform- ance.
同期刊论文项目
同项目期刊论文
期刊信息
位置：