CAJ | 학술논문

针对Turbo乘积码(Turbo Product Codes, TPCs)中的译码问题，该文提出一种全新的低复杂度TPC自适应Chase迭代译码算法。与已有的报道不同，在译码过程中，新算法首先统计TPC码块内每一行(列)产生的代数译码后的备选序列与接收序列的相同最小欧氏距离的个数，然后根据统计结果，按照算法步骤调整译码所需的不可靠位数值。通过Monte Carlo仿真可验证，当TPC行列编码采用相同的扩展汉明码，且编码效率为0.879时，该算法与Pyndiah采用固定不可靠位数值迭代译码算法相比，在误码率BER为410-处仅损失约0.08 dB的性能，但是译码平均复杂度降低可达到约40.4%。
침대Turbo승적마(Turbo Product Codes, TPCs)중적역마문제，해문제출일충전신적저복잡도TPC자괄응Chase질대역마산법。여이유적보도불동，재역마과정중，신산법수선통계TPC마괴내매일행(렬)산생적대수역마후적비선서렬여접수서렬적상동최소구씨거리적개수，연후근거통계결과，안조산법보취조정역마소수적불가고위수치。통과Monte Carlo방진가험증，당TPC행렬편마채용상동적확전한명마，차편마효솔위0.879시，해산법여Pyndiah채용고정불가고위수치질대역마산법상비，재오마솔BER위410-처부손실약0.08 dB적성능，단시역마평균복잡도강저가체도약40.4%。
This paper proposes a novel and low-complexity adaptive Chase iterative decoding algorithm for Turbo Product Codes (TPCs). Different from the previous reported results, during decoding, the new adaptive algorithm is based on the statistics of the number of the candidate sequences with the same minimum squared Euclidean distance in each row or column of TPC block firstly, and then the Least Reliable Bits (LRBs) can change according to the statistical results via the proposed steps. It can be verified by Monte Carlo simulations, when using the same extended Hamming code as TPC subcodes with coding efficiency of 0.879 and the Bit Error Rate (BER) is 410- , the coding loss of the proposed adaptive algorithm is just about 0.08 dB compared with Pyndiah’s iterative decoding algorithm using the fixed LRBs parameter in Chase decoder, but the average complexity of the proposed algorithm could be reduced about 40.4%.