摘要
如今的球形译码算法研究,多是针对MIMO系统的传输矩阵满秩的情况。然而现实常常出现传输矩阵是奇异阵的情况即传输矩阵为病态矩阵,原先的球形译码算法将不再适用。本文提出了一种快速的球形译码算法,设法将病态矩阵变为满秩矩阵,并利用迫零检测估计来对最初的半径取值加以限制,大大加快了搜索速度,而性损失却很小。
The study on sphere decoding algorithms（SDA） for the MIMO systems are always based on the case of full rank transfer matrix.However,in reality it often appears that the transfer matrix is singular,and the original SDA will be no longer applicable when the matrix is ill-conditioned.This letter proposes a fast algorithm which changes the illconditioned matrix into a full rank one and constrains the initial searching radius with ZF detection,so the searching speed is accelerated with small performance loss.
出处
《信息通信技术》
2011年第2期74-77,共4页
Information and communications Technologies
