Reduced complexity sliding window BCJR decoding algorithms for turbo codes

被引：0

作者：

Gwak, J

Shin, SK

Kim, HM

机构：

[1] Elect & Telecommun Res Inst, Satellite Commun Syst Dept, Radio & Broadcasting Technol Lab, Taejon 305350, South Korea

[2] Korea Adv Inst Sci & Technol, Dept Elect Engn, Taejon 305701, South Korea

来源：

CRYPTOGRAPHY AND CODING | 1999年 / 1746卷

关键词：

D O I：

暂无

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

In decoding the turbo codes, the sliding window BCJR algorithm, derived from the BCJR algorithm, permits a continuous decoding of the coded sequence without requiring trellis termination of the constituent codes and uses reduced memory span. However, the number of computations required is greater than that of BCJR algorithm. In this paper, we propose an efficient sliding window type scheme which maintains the advantages of the conventional sliding window algorithm, reduces its computational burdens, and improves its BER performance by allowing the window to be forwarded in multi-step. Simulation results show that the proposed scheme outperforms the conventional sliding window BCJR algorithm with reduced complexity.

引用

页码：179 / 184

页数：6