计算机与现代化 ›› 2011, Vol. 193 ›› Issue (9): 8-11.doi: 10.3969/j.issn.1006-2475.2011.09.003

• 算法设计与分析 • 上一篇    下一篇

一种低复杂度次优自动球形译码算法

李庆会   

  1. 第二炮兵青州士官学校,山东 青州 262500
  • 收稿日期:2011-04-18 修回日期:1900-01-01 出版日期:2011-09-22 发布日期:2011-09-22

  1. A Low Complexity Sub-optimal Automatic Sphere Decoding Algorithm

LI Qing-hui   

  1. The Second Artillery Petty Officer School, Qingzhou 262500, China
  • Received:2011-04-18 Revised:1900-01-01 Online:2011-09-22 Published:2011-09-22

摘要: 提出一种低复杂度次优自动球形译码算法。针对常规自动球形译码边界节点列表长度过大的问题,本文通过设置算法中的边界节点列表长度为固定值,使译码过程的复杂度大大减少;并通过仿真确定对应不同信噪比范围内的似费诺偏移量,补偿到对应节点的距离度量,保证系统的性能。对算法进行仿真验证,结果表明,该算法与常规自动球形译码算法相比,在性能基本不变的前提下,译码复杂度得到有效的减少,并更适宜硬件实现。

关键词: 次优, 自动球形译码, 边界节点列表, 似费诺偏移量

Abstract:

A low complexity sub-optimal Automatic Sphere Decoding (ASD) algorithm is proposed. Aiming at the large size of the border node list in conventional ASD, the proposed method decreases the complexity of decoding efficiently through fixing the size of the border node list; and compensates the corresponding Fanolike metric bias which gets from simulation to assure the performance. It verifies the new algorithm through the simulation. And the simulation’s results demonstrate that compared with the conventional ASD, the complexity of decoding reduces greatly at the cost of less penalty on the performance, and it adapts for hardware implementation well.

Key words: sub-optimal, automatic sphere decoding, border node list, Fano-like metric bias

中图分类号: