期刊文献+

一种低译码复杂度的高速率-全分集2×2STC算法 被引量:1

A high-rate full-diversity 2×2 STC algorithm with low decoder complexity
在线阅读 下载PDF
导出
摘要 为了降低接收端译码器的译码复杂度,提出了一种能降低译码复杂度的STC算法。对码字矩阵进行设计,利用最大似然译码算法分析接收信噪比特性。通过MATLAB仿真所得结果表明,文中提出的算法与Viterbi译码算法引比,虽具有相当的译码性能,但译码复杂度大大降低。 In order to reduce the decoder complexity,a kind of algorithm of STC that can reduce the decoding complexity is put forward.By designing the matrix of code words,the ML decoding algorithm is used to analysis signal-to-noise characteristic.The results of the MATLAB simulation shows that the algorithm proposed has a comparable decode performance with Viterbi decoding algorithm,but has a much lower decoding complexity.
出处 《西安邮电学院学报》 2012年第5期29-32,共4页 Journal of Xi'an Institute of Posts and Telecommunications
基金 陕西省科技厅工业攻关基金资助计划(2012K06-27)
关键词 ML检测 多输入多输出 空时码 ML decoding, multiple-input multiple-output(MIMO), space-time code(STC)
  • 相关文献

参考文献13

  • 1黄涛,袁超伟,杨睿哲,等.MIM0相关技术与应用[M].北京:机械工业出版社,2007:5-20.
  • 2Alamouti, S. M. A Simple Transmit Diversity Tech- nique for Wireless Communications[J]. IEEE Journal Select. Areas Commun., 1998, 16(8) :1451-1458.
  • 3Institute of Electrical and Electronic Engineers. IEEE 802. 16e-2005, IEEE Standard for Local and Metro- politan Area Network[S]. New York, USA: LAN/ MAN Standards Committee, 2006.
  • 4Jean-Claude Be, G. Emanuele V. The Colde Code.. A Full-Rate Space-Time Code With Nonvanishing Deter- minants[J]. IEEE Transactions on Information Theo- ry., 2005,51(4): 1432-1436.
  • 5S. Sezginer and H. SarL A full-rote full-diversity space- time code for mobile WiMAX systerm[C]//2007 IEEE International Corfference on Signal Processing and Com- munications. Dubai , UAE, 2007:24-27.
  • 6J. Paredes, A. B. Gershman, and M. G. Alkhanark A space-time code with non-vanishing determinants and fast maximum likelihood decoding [C]// 2007 IEEE International Conference on Signal Processing and Communications. Hawaii, USA, 2007: 877-880.
  • 7M. Samuel and M. P. Fitz. Reducing the detection complexity by using multi-strata space-time codes [C]//IEEE International Symposium on Information. Nice, France, 2007. 1946-1950.
  • 80. Tirkkonen and R. Kashaev. Combined information and performance optimization of linear MIMO modula- tions[C]//IEEE International Symposium on Informa- tion. Lausanne, Switzerland. 2002 : 76-78.
  • 9张建忠,李宏伟,邓冬虎.一种低复杂度的空时分组码检测算法[J].电视技术,2011,35(2):67-70. 被引量:4
  • 10D. Tse and P. Viswanath. Fundamentals of Wireless Communications[M]. New York. Cambridge Univer- sity Press, 2005 : 132-147.

二级参考文献41

  • 1虞忠辉.GSM蜂窝移动通信系统安全保密技术[J].通信技术,2003,36(12):139-140. 被引量:10
  • 2乔天柱,张海滨,罗汉文,宋文涛.基于循环前缀的OFDM符号同步算法改进及其实现[J].电视技术,2004,28(9):4-7. 被引量:3
  • 3罗涛,刘丹谱,乐光新.Rician衰落下空时分组编码信道的容量[J].北京邮电大学学报,2004,27(5):94-98. 被引量:5
  • 4Alamouti S M. A Simple Transmit Diversity Technique for Wireless Communications[J]. IEEE Journal on Selected Areas in Communications, 1998, 16(08):1451-1458.
  • 5Mark Y. Physical Channels and Mapping of Transport Channels onto Physical Channels (FDD) [J]. Technical Specification, 2000, 26 (07) : 1221-1223.
  • 6Tarokh V, Jafarkhani H, Calderbank A R. Space-time Block Coding for Wireless Communications: Performance Results[J]. IEEE Journal on Selected Areas in Communications, 1999,17(03): 451-460.
  • 7KO Y,TEPEDELENLIOGLU C. Orthogonal space-time block coded rate-adaptive modulation with outdated feedback [J]. IEEE Trans.Wireless Communications ,2006,5(2) :290-295.
  • 8ALAMOUTI S M. A simple transmit diversity technique for wireless communications [J]. IEEE Journal on Selected Areas in Communications, 1998,16(8) : 1451-1458.
  • 9TAROKH V,JAFARKHANI H,CALDERBANK A R. Space-time block codes from orthogonal designs[J]. IEEE Trans. Information Theory, 1999,45(5) : 1456-1467.
  • 10JAFARKHANI H.A quasi-orthogonal space-time block code[J]. IEEE Trans. Communica|ions, 2001,49 ( 1 ) : 1-4.

共引文献7

同被引文献10

  • 1黄涛,袁超伟,杨容哲.MIMO相关技术与应用[M].北京:机械工业出版社,2007:5-20.
  • 2Y Liu, MP Fitz, and OY Takeshita. A rank criterion for QAM space -time codes[J]. IEEE Trans. Inform. The- ory, 2002,48(12) :3062 -3079.
  • 3V. Tarokh, H. Jafarkhani, and A. R. Calderbank. Space- time codes for high data rate wireless communi- cations: Performance criterion and code construction [J]. IEEE Trans. Inform. Theory, 1998,44(2):744 -765.
  • 4Eabak Hassibi and Hafts Vikalo. On the Sphere - Deco- ding Algorithm Expected Complexity [" J ]. IEEE Trans. Signal Processing, 2005,53(8) :2806 - 2818.
  • 5B. Hassibi and B. M. Hochward. High- rate codes that are linear in space and time [ J ]. IEEE Trans. Inform. Theory, 2002,48(7) : 1804 - 1824.
  • 6J. R. W. Heath and A. J. Paulraj. Linear dispersion codes for MIMO systems based on frame theory [ J ]. IEEE Trans. Signal Process. , 2002,50 (10) : 2429 - 2441.
  • 7Alamouti, S.M. A simple transmit diversity technique for wireless communication[J].IEEE Journal Select. Areas Commun. , 1998,16(8) :1451 - 1458.
  • 8H. Jafarkhani. A quasi -orthogonal space -time block codes[J]. IEEE Trans. Commun. , 2001,49(1) :1 -4.
  • 9C. Yucn, Y. L. Guan, and T. T. Tjhung. Quasi- or- thogonal STBC with minimum decoding complexity [ J ]. IEEE Trans. Wireless Commun. , 2005,4 (5) : 2089 - 2094.
  • 10邵朝,李维霞,杨艳,姚琼.几种准正交空时分组码的编码方案分析[J].西安邮电学院学报,2012,17(1):5-12. 被引量:5

引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部