摘要
针对采用排序的串行干扰消除检测的组分层空时系统,提出了基于重构信道QR分解的接收天线选择算法,该算法用子信道Frobenius范数排序代替Moore-Penrose伪逆行范数排序得到置换矩阵,降低了计算复杂度。并给出了基于重构信道的快速算法,该算法比常规信道快速算法具有显著的性能提升。仿真分析表明,该算法在中断容量上与最大容量算法接近,重构信道QR分解算法与基于伪逆排序方法性能相近,重构快速算法性能稍有下降,但复杂度更低。
Based on QR decomposition (QRD) of the equivalent channel, a suboptimal receiving antenna selection is provided for group layered space-time (GLST) systems with ordered successive interference cancellation detectors. A permutation matrix can be obtained by sorting according to the Frobenius norms of subchan- nels instead of the norms of row vectors in the Moore-Penrose pseudo-inverse matrix, so that the computational complexity is reduced. And then, a fast algorithm based on the equivalent channel is provided. Simulation re- sults show that the proposed algorithms can achieve near-optimal outage capacity, and the performance of the ORD-based algorithm is close to that of the pseudo-inverse based algorithm. There is a slight performance gap between the provided algorithms, but the fast one with lower complexity.
出处
《系统工程与电子技术》
EI
CSCD
北大核心
2009年第10期2336-2338,2425,共4页
Systems Engineering and Electronics
关键词
天线选择
组分层空时
排序的串行干扰消除
QR分解
antenna selection
group layered space-time
ordered successive interference cancellation
QR decomposition