期刊文献+
任意字段
题名或关键词
题名
关键词
文摘
作者
第一作者
机构
刊名
分类号
参考文献
作者简介
基金资助
栏目信息

Decoding OvTDM with sphere-decoding algorithm

Decoding OvTDM with sphere-decoding algorithm
原文传递
导出
摘要 Overlapped time division multiplexing （OvTDM） is a new type of transmission scheme with high spectrum efficiency and low threshold signal-to-noise ratio （SNR）. In this article, the structure of OvTDM is introduced and the sphere-decoding algorithm of complex domain is proposed for OvTDM. Simulations demonstrate that the proposed algorithm can achieve maximum likelihood （ML） decoding with lower complexity as compared to traditional maximum likelihood sequence demodulation （MLSD） or viterbi algorithm （VA）. Overlapped time division multiplexing （OvTDM） is a new type of transmission scheme with high spectrum efficiency and low threshold signal-to-noise ratio （SNR）. In this article, the structure of OvTDM is introduced and the sphere-decoding algorithm of complex domain is proposed for OvTDM. Simulations demonstrate that the proposed algorithm can achieve maximum likelihood （ML） decoding with lower complexity as compared to traditional maximum likelihood sequence demodulation （MLSD） or viterbi algorithm （VA）.
作者 JIN Xin LI Dao-ben
机构地区 Key Laboratory of Information Processing and Intelligent Technology
出处 《The Journal of China Universities of Posts and Telecommunications》 EI CSCD 2008年第4期35-39,共5页 中国邮电高校学报（英文版）
基金 the National Natural Science Foundation of China (90604035)
关键词 OvTDM MLSD sphere-decoding OvTDM, MLSD, sphere-decoding
分类号 TN91 [电子电信—通信与信息系统]
  • 相关文献

参考文献10

  • 1Wong K K, Paulraj A, Murch R D. Efficient high-performance decoding for overloaded MIMO antenna systems. /EEE Transactions on Wireless Communications, 2007, 6(5): 1833-1843
  • 2Wang R Q, Giannakis G B. Approaching MIMO channel capacity with soft detection based on hard sphere decoding. IEEE Transactions on Wireless Communications, 2006, 54(4): 587-590
  • 3Cui T, Tellambura C. Approximate ML detection for MIMO systems using multistage sphere decoding. IEEE Signal Processing Letters, 2005, 12(3): 222-225
  • 4Forney G D. Maximum likelihood sequence estimation of digital sequences in the presence of intersymbol interference. IEEE Transactions on Information Theory, 1972, 18(1): 363-378
  • 5Li D B. Error bounds for homogeneous random time-varying intersymbol interference channels. 1988 Beijing International Workshop on Information Theory. Jul 4-7, 1988, Beijing, China
  • 6Viterbi A J, Omura J K. Principles of digital communication and coding. New York, NY. USA: McGraw-Hill Book Company, 1979:272-286
  • 7Verdu S. Maximum-likelihood sequence detection for intersymbol interference channels: a new upper bound on error probability. IEEE Transactions on Information Theory, 1987, 33(1): 62-68
  • 8Fincke U, Phost M. Improved methods for calculating vectors of short length in a lattice, including a complexity analysis. Mathematics of Computation, 1985, 44(1): 463-471
  • 9Hassibi B, Vikalo H. On the sphere-decoding algorithm h Expected complexity. IEEE Transactions on Signal Processing, 2005, 53(8): 2806-2818
  • 10Vikalo H, Hassibi B. On the sphere-decoding algorithm 2: Generalizations, second-order statistics, and applications to communications. IEEE Transactions on Signal Processing, 2005, 53(8): 2819-2834
The Journal of China Universities of Posts and Telecommunications
2008年 第4期

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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