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

Complexity study of sphere decoding in multi-antenna systems 被引量：1

Complexity study of sphere decoding in multi-antenna systems
原文传递
导出
摘要 In this article a bridge between the expected complexity and performance of sphere decoding （SD） is built. The expected complexity of SD for infinite lattices is then investigated, which naturally is the upper-bound of those for all the finite lattices if given by the same channel matrix and signal noise ratio （SNR）. Such expected complexity is an important characterization of SD in multi-antenna systems, because no matter what modulation scheme is used in practice （generally it has finite constellation size） this upper-bound holds. Above bridge also leads to a new method of determining the radius for SD. The numerical results show both the real value and upper-bound of average searched number of candidates in SD for 16-QAM modulated system using the proposed sphere radius determining method. Most important of all new understandings of expected complexity of SD are given based on above mentioned theoretic analysis and numerical results. In this article a bridge between the expected complexity and performance of sphere decoding （SD） is built. The expected complexity of SD for infinite lattices is then investigated, which naturally is the upper-bound of those for all the finite lattices if given by the same channel matrix and signal noise ratio （SNR）. Such expected complexity is an important characterization of SD in multi-antenna systems, because no matter what modulation scheme is used in practice （generally it has finite constellation size） this upper-bound holds. Above bridge also leads to a new method of determining the radius for SD. The numerical results show both the real value and upper-bound of average searched number of candidates in SD for 16-QAM modulated system using the proposed sphere radius determining method. Most important of all new understandings of expected complexity of SD are given based on above mentioned theoretic analysis and numerical results.
作者 QIAN Rong-rong QI Yuan PENG Zao WANG Wen-bo
机构地区 Wireless Signal Processing and Network Lab (Key Lab of Universal Wireless Communication School of Electronic Engineering
出处 《The Journal of China Universities of Posts and Telecommunications》 EI CSCD 2010年第3期1-5,共5页 中国邮电高校学报（英文版）
基金 supported by the National Natural Science Foundation of China (60572120, 60602058) the Hi-Tech Research and Development Program of China (2006AA01Z257) the National Basic Research Program of China (2007CB310602)
关键词 MIMO sphere decoding expected complexity MIMO, sphere decoding, expected complexity
分类号 TN959.3 [电子电信—信号与信息处理] U469.11 [机械工程—车辆工程]
  • 相关文献

参考文献12

  • 1Hassibi B,Vikalo H.On the expected complexity of integer least-squares problems.Proceedings of the 27th International Conference on Acoustics,Speech,and Signal Proceesing (ICASSP'02):Vol 2,May 13-17,2002,Orlando,FL,USA.Piscataway,NJ,USA:IEEE,2002:1497-1500.
  • 2Hassibi B,Vikalo H.On the sphere-decoding algorithm Ⅰ:expected complexity.IEEE Transactions on Signal Processing,2005,53(8):2806-2818.
  • 3Barbero L G,Thompson J S.Performance analysis of a fixed-complexity sphere decoder in high-dimensional MIMO systems.Proceedings of the 31th International Conference on Acoustics,Speech,and Signal Processing (ICASSP'06):Vol 4,Mar 14-19,2006,Toulouse,France,Piscataway,NJ,USA:IEEE,2006:557-560.
  • 4Jalden J,Ottersten B.An exponential lower bound on the expected complexity of sphere decoding.Proceedings of the 29th International Conference on Acoustic,Speech,and Signal Proceesing (ICASSP'04):Vol 4,Mar 17-21,2004,Montreal,Canada.Piscataway,NJ,USA:IEEE,2004:393-396.
  • 5Jalden J,Ottersten B.On the complexity of sphere decoding in digital communications.IEEE Transactions on Signal Processing,2005,53(4):1474-1484.
  • 6Vikalo H,Hassibi B.On the sphere-decoding algorithm Ⅱ:generalizations,secend-order statistics,and applications to communications.IEEE Transactions on Signal Processing,2005,53(8):2819-2834.
  • 7Seethaler D,Jaldon J,Studer C,et al.Tail behavior of sphece-decoding complexity in random lattices.Proceedings of IEEE International Symposium on Information Theory (ISIT'09),Jun 28-Jul 3,2009,Seoul,Korea.Piscataway,NJ,USA:IEEE,2009:729-733.
  • 8Zhu X,Murch R D.Performance analysis of maximum likelihood detection in a MIMO antenna system.IEEE Transactions on Communications,2002,50(2):187-192.
  • 9Lee K C,Chun J H.ML symbol detection based on the shortest path algorithm for MIMO systems.IEEE Transactions on Signal Processing,2007,55(11):5477-5484.
  • 10Gowaikar R,Hassibi B.Efficient statistical pruning for maximum likelihood decoding.Proceedings of the 28th International Conference on Acoustics,Speech,and Signal Proceesing (ICASSP'03):Vol 5,Apt 6-10,2003,Hong Kong,China.Piscataway,NJ,USA:IEEE,2003:49-52.

同被引文献12

  • 1WUBBEN D, BOHNKE R, RINAS J, et al. Efficient al- gorithm for decoding layered space-time codes [ J ]. Elec- tron Lett, 2001, 37(22) : 1348-1350.
  • 2ERCEG V, SCHUMACHER L, KYRITSI P, et al. TGn Channel Models: IEEE Std. 802. 11-03/ 940r4 [ EB/ OL]. ( 2003-11-03 ) [ 2010-08-22 ]. hnp://www. ieee802, org/11 / DocFiles/03/11-03-0940-04-000n-tgn- channel-models, doc : IEEE, 2003.
  • 3PAUL T K, OGUNFUNMI T. Wireless LAN Comes of Age : Understanding the IEEE 802.1 In Amendment [ J ]. IEEE Circuits and Systems Magazine, 2008, 8 ( 1 ) : 28- 54.
  • 4DAVID TSE, PRAMOD V. Fundamentals of Wireless Communication[ M ]. 北京:人民邮电出版社,2009:30-34.
  • 5FOSCHINI G J, GANS M J. On limits of wire-less com- munications in a fading environment when using multiple antennas [ J ]. Wireless Personal Communications, 1998,6 (3) :311-335.
  • 6WENK M, ZELLWEGER M, BURG A, et al. K-Best MIMO detection VLSI architectures achieving up to 424 Mbps [ J ]. IEEE ISCAS, 2006, 1151-1154.
  • 7ZHAO Guo, NILSSON P. Algorithm and impl-ementation of the K-Best sphere decoding for MIMO detection [ J ]. IEEE J Sel Areas Commun, 2006, 24(3) : 491-503.
  • 8MONDAL S, ELTAWIL A M, SALAMA K N. Architec- tural Optimizations for Low-Power K-Best MIMO Decoders [J]. IEEE TRANS-ACTIONS ON VEHICULAR TECH- NO-LOGY, 2009, 58(7) : 3145-3153.
  • 9MONDAL S, ELTAWIL A, SHEN C A, et al. Design and Implementation of a Sort-Free K-Best Sphere Decode [ J]. IEEE TRANSACTIONS ON VERY LARGE SCALE INTEGRATION (VLSI) SYSTEMS, 2009,99 : 1-5.
  • 10SHABANY M, GULAK P G. A 0.13μm CMOS 655Mb/s 4 ×4 64-QAM K-Best MIMO Detector[ C]//IEEE. IEEE International Solid-State Circuits Conference. USA : IEEE. 2009 : 256-257.

引证文献1

The Journal of China Universities of Posts and Telecommunications
2010年 第3期

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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