Optimal M-BCJR Turbo Decoding: The Z-MAP Algorithm  

作　　者：Aissa Ouardi Ali Djebbari Boubakar Seddik Bouazza 

机构地区：[1]不详

出　　处：《Wireless Engineering and Technology》2011年第4期230-234,共5页无线工程与技术（英文）

摘　　要：In this paper, we propose a novel idea for improvement performances of the leader M-BCJR algorithm functioning in low complexity. The basic idea consists to localize error instant possibility, and then increase the complexity around this moment. We also propose an easy and important idea for early localisation of erroneous moments. We call this new algorithm Z-MAP. The simulations show that the improvement of performances is significant. The performances of Z-MAP turbo decoding are so close to full MAP-BCJR performances. Furthermore, the complexity is the same that of the M-BCJR. So, Z-MAP is an optimal version of M-BCJR algorithm.In this paper, we propose a novel idea for improvement performances of the leader M-BCJR algorithm functioning in low complexity. The basic idea consists to localize error instant possibility, and then increase the complexity around this moment. We also propose an easy and important idea for early localisation of erroneous moments. We call this new algorithm Z-MAP. The simulations show that the improvement of performances is significant. The performances of Z-MAP turbo decoding are so close to full MAP-BCJR performances. Furthermore, the complexity is the same that of the M-BCJR. So, Z-MAP is an optimal version of M-BCJR algorithm.

关 键 词：MAP-BCJR ALGORITHM M-BCJR TURBO Decoding Complexity Reduction Error LOCALISATION Criterion 

分 类 号：TN91[电子电信—通信与信息系统]