| RA码译码简化算法的研究 |
| |
| 引用本文： | 高宏峰,许宗泽. RA码译码简化算法的研究[J]. 四川大学学报(工程科学版), 2004, 36(4): 107-110 |
| |
| 作者姓名： | 高宏峰 许宗泽 |
| |
| 作者单位： | 南京航空航天大学,信息科学与技术学院,江苏,南京210016 |
| |
| 摘 要： | RA码BP译码算法，可以实现线性时间译码，然而具有较高的复杂度。为了便于硬件实现，首先提出将最小和算法应用于RA码，然后对最小和算法进行了改进，提出了归一化算法和偏移算法，使循环译码算法在复杂度和性能之间取得了较好的折衷。仿真结果表明：归一化算法和偏移算法复杂度低，性能接近BP算法。
|
| 关 键 词： | 重复累积码 BP算法 最小和算法 归一化算法 偏移算法 |
| 文章编号： | 1009-3087(2004)04-0107-04 |
Reduced Complexity Decoding Algorithms for Repeat Accumulate Codes |
| |
| GAO Hong-feng,XU Zong-ze. Reduced Complexity Decoding Algorithms for Repeat Accumulate Codes[J]. Journal of Sichuan University (Engineering Science Edition), 2004, 36(4): 107-110 |
| |
| Authors: | GAO Hong-feng XU Zong-ze |
| |
| Abstract: | Repeat-accumulate (RA) codes have a natural linear-time encoding algorithm. Under BP decoding algorithm, RA codes can be decoded reliably in linear time at rates arbitrarily closed to channel capacity.However,BP algorithm has high complexities.Minimum sum decoding algorithm is a sub-optimum algorithm and is easy for hardware implementation,but the decoding performance is degraded. Normalized algorithm and offset algorithm are proposed as a good tradeoff between decoding performance and complexities. Simulation results show that with little complexity increased, normalized algorithm and offset algorithm have better performance than that of minimum sum algorithm. |
| |
| Keywords: | repeat-accumulate codes BP algorithm minimum sum algorithm normalization algorithm offset algorithm |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
