摘要
最大似然(ML)检测的差分空时频码的传统译码方法的译码复杂度随着星座图点数以及发送信息符号数的增加而迅速增加.对星座图进行划分,提出了一种差分空时频码字的快速译码方法.该方法可以获得与传统ML译码方法相近的性能,即都获得了最大空间-多径分集增益,而译码复杂度却大大降低.仿真分析结果证明了该快速译码算法的高效性.
The decoding complexity of conventional differential space-time-frequency codes based on maximumlikelihood (ML) differential detection increases quickly with the number of constellation components and transmitted information symbols. By grouping the constellation, a fast decoding algorithm is proposed. The proposed algorithm provides performance close to that of the ML differential detection, that is, both can achieve maximum space-multipath diversity, but the proposed algorithm offers a lower decoding complexity. Analytical evaluation and corroborating simulations reveal its performance merits.
出处
《西安电子科技大学学报》
EI
CAS
CSCD
北大核心
2009年第5期940-944,共5页
Journal of Xidian University
基金
"十一五"预研项目资助(11001060404)
国家部委基金资助(51401040703CB0102)
关键词
多输入多输出
空时分组码
差分空时频编码
差分译码
频率选择性衰落信道
空间-多径分集
multiple input multiple output
space-time block code
differential space-time-frequencycoding
differential decoding
frequency-selective channel
space-multipath diversity