西安电子科技大学学报（自然科学版）2011，Vol.38Issue(2)：42-46,5.DOI:10.3969/j.issn.1001-2400.2011.02.008
BICM系统中一种低复杂度的迭代解映射算法
Low complexity iterative demapping algorithm in BICM systems
摘要
Abstract
The complexity of the iterative Demapping algorithm in Bit-Interleaved Coded Modulation systems is related to the product of the order of modulation and the constellation points number, so that it is not suitable for real-time applications.To reduce its complexity, we give a shortcut calculation based on the Hard Decision Feedback for the BICM system using LDPC codes.A soft information calculation algorithm based on the decision boundary is used in the first iteration, where no feedback information is available to be used.Simulation result shows that the BWE performance of the algorithm proposed in the AWGN channel has only a distance of 0.04 ～ 0.06 dB from the soft information iteration algorithm.On the other hand, the calculation complexity of this algorithm is only related to the order of the modulation, which is more suitable for application.关键词
比特交织编码调制/迭代解映射/判决反馈/信道编码/低密度奇偶校验码分类
信息技术与安全科学引用本文复制引用
马卓,杜栓义,王新梅..BICM系统中一种低复杂度的迭代解映射算法[J].西安电子科技大学学报（自然科学版）,2011,38(2):42-46,5.基金项目
国家973计划资助项目(2010CB328300) （2010CB328300）
国家自然科学基金资助项目(U0635003) （U0635003）
