检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]大庆石油学院电子科学学院,黑龙江大庆163318 [2]哈尔滨工程大学信息与通信工程学院,黑龙江哈尔滨150001
出 处:《系统工程与电子技术》2009年第10期2336-2338,2425,共4页Systems Engineering and Electronics
摘 要:针对采用排序的串行干扰消除检测的组分层空时系统,提出了基于重构信道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.
关 键 词:天线选择 组分层空时 排序的串行干扰消除 QR分解
分 类 号:TN911[电子电信—通信与信息系统]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.7