摘要
提出了一种基于译码前传协作中继网络的类准正交线性分散码,该码的码字矩阵实部和虚部可以分解成满足准正交设计的实码字矩阵;对接收端的译码考虑了2种方式,一种是对总的接收信号进行快速最大似然译码,另一种是对经过中继和未经过中继的接收信号分别进行快速最大似然译码;分析了2种方式的计算复杂度,对2种方式的信道容量、中断概率和误比特率等特性进行了仿真对比,结果表明,在相同条件下,方式2比方式1信道容量更高,中断概率和误比特率更低,但计算复杂度更高。
Analogous quasi-orthogonal designs linear dispersion codes under amplify-and-forward cooperative relay net-works were proposed,the real part and the imaginary part of the code matrices could be separated into code matrices which satisfy quasi-orthogonal designs.Two kinds of decoding algorithms were used in the receiver,one was the total received signals decoded using fast ML algorithm,another was the un-relay received signal and the relay received signal decoding respectively.The computation complexities of the two conditions were analyzed.The channel capacity,the outage probability and the bit error rate of the two conditions were compared through simulation.Simulation results show that the channel capacity of the scheme 2 is bigger than that of the scheme 1,the outage probability and the bit error rate are lower,but the computation complexity is higher than that of the scheme 1.
出处
《通信学报》
EI
CSCD
北大核心
2011年第3期40-49,59,共11页
Journal on Communications
基金
国家自然科学基金资助项目(60902011&60802006)
江苏省自然科学基金资助项目(BK2009476&BK2008289)
浙江省自然科学基金资助项目(Y1090935)
东南大学移动通信国家重点实验室自主研究课题资助项目(2009B01
2010A08)~~
关键词
译码前传
类准正交设计
线性分散码
最大似然译码
decode-and-forward
analogous quasi-orthogonal design
linear dispersion code
ML decode
