检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]燕山大学信息与工程学院,河北秦皇岛066004
出 处:《重庆邮电大学学报(自然科学版)》2011年第5期562-564,569,共4页Journal of Chongqing University of Posts and Telecommunications(Natural Science Edition)
摘 要:针对传统全速率准正交空时分组码(quasi-orthogonal space-time block code,QO-STBC)译码复杂度高的问题,提出一种改进的准正交空时分组码译码方案。该方案通过在接收端乘以信道矩阵的共轭转置及Givens旋转矩阵,消除检测矩阵部分干扰项,使检测矩阵三角化。和传统的准正交空时分组码最大似然译码算法相比,该译码算法将最大似然判决式最简化,译码复杂度被降到最低。理论分析和仿真结果表明,改进的译码方法在保证误码率性能的同时,降低了译码复杂度,提高了译码速度。As to the high decoding complexity of the conventional full rate quasi-orthogonal space-time block code ( QO-ST- BC), an improved scheme was proposed in this paper. In the receiver, we apply Hermitian transposition of channel matrix and Givens rotation to eliminate part of interference terms, and achieve a triangle detection matrix. Compared to conven- tional QO-STBC, the maximum likelihood (ML) metric is maximally simplified, thereby decoding complexity is mini- mized. Theoretical analysis and simulation results show that the improved scheme ensures the BER of the conventional ML decoding, and reduces the decoding complexity greatly.
分 类 号:TN911.22[电子电信—通信与信息系统]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.7