Improved sphere decoding algorithm based on ±1 quadratic programming
|更新时间:2024-10-14
|
Improved sphere decoding algorithm based on ±1 quadratic programming
Issue 11, Pages: 15-20(2007)
作者机构:
1. 解放军理工大学通信工程学院
2. 解放军理工大学通信工程学院,江苏,南京,210007
3. 东南大学移动通信国家重点实验室
4. ,江苏,南京,210096
作者简介:
基金信息:
DOI:
CLC:TN911.2
Published:2007
稿件说明:
移动端阅览
LI Zi1, CAI Yue-ming1. Improved sphere decoding algorithm based on ±1 quadratic programming[J]. 2007, (11): 15-20.
DOI:
LI Zi1, CAI Yue-ming1. Improved sphere decoding algorithm based on ±1 quadratic programming[J]. 2007, (11): 15-20.DOI:
Improved sphere decoding algorithm based on ±1 quadratic programming
摘要
从MIMO检测的±1二次规划模型出发
推导了最大似然MIMO检测最优解的必要条件。在此基础上提出了一种基于必要条件的球形解码改进算法
该算法在球形解码剪枝策略的基础上利用必要条件对树型搜索的节点进行进一步剪枝
从而明显降低了运算复杂度
而不降低球形解码检测算法的误比特率性能。
Abstract
With the ±1 quadratic programming of the MIMO detection
the necessary conditions for MIMO detection op-timal solution were derived.An improved sphere decoding algorithm based on these necessary conditions was proposed.The algorithm prunes redundant nodes by necessary conditions based on the origin sphere decoding.With this pruning strategy
the complexity of algorithm is reduced significantly