skip to main content
10.1145/1815396.1815580acmotherconferencesArticle/Chapter ViewAbstractPublication PagesiwcmcConference Proceedingsconference-collections
research-article

Variable-breadth K-best detector for MIMO systems

Published:28 June 2010Publication History

ABSTRACT

Tree search detection algorithms can provide Maximum-Likelihood detection over Gaussian MIMO channels with lower complexity than the exhaustive search. Furthermore, the performance of MIMO detectors is highly influenced by the channel matrix condition number. In this paper, the impact of the 2-norm condition number in data detection is exploited in order to decrease the complexity of already proposed algorithms. A suboptimal tree search method called K-Best is combined with a channel matrix condition number estimator and a threshold selection method. This approach leads to a variable-breadth K-Best detector with predictable average performance and suitable for hardware implementation. The results show that the proposed scheme has lower complexity, i.e. it is less power consuming, than a fixed K-Best detector of similar performance.

References

  1. H. Artes, D. Seethaler, and F. Hlawatsch. Efficient detection algorithms for MIMO channels: A geometrical approach to approximate ML detection. IEEE Trans. on Signal Processing, 51(11):2808--2820, November 2003. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. L. G. Barbero and J. S. Thompson. Fixing the complexity of the sphere decoder for MIMO detection. IEEE Trans. on Wireless Communications, 7(6):2131--2142, June 2008. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. A. K. Cline, C. B. Moler, G. W. Stewart, and J. H. Wilkinson. An estimate for the condition number of a matrix. SIAM Journal on Numerical Analysis, 16(2):368--375, April 1979.Google ScholarGoogle ScholarCross RefCross Ref
  4. A. Edelman. Eigenvalues and Condition Numbers of Random Matrices. Ph.d. thesis, Massachusetts Institute of Technology, Cambridge (MA), 1989.Google ScholarGoogle Scholar
  5. G. Golub and C. V. Loan. Matrix Computations. The Johns Hopkins University Press, Baltimore, 1996. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. Z. Guo and P. Nilsson. Algorithm and implementation of the K-Best Sphere Decoding for MIMO Detection. IEEE Journal on Selected Areas in Communications, 24(3):491--503, March 2006. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. B. Hassibi and H. Vikalo. On Sphere Decoding algorithm. Part I, the expected complexity. IEEE Trans. on Signal Processing, 54(5):2806--2818, August 2005. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. J. Janhunen, O. Silvén, and M. Juntti. Programmable processor implementations of K-best list sphere detector for MIMO receiver. Signal Processing, 90(1):313--323, January 2010. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. E. G. Larsson. MIMO detection methods: How they work. IEEE Signal Processing Magazine, 26(3):91--95, May 2009.Google ScholarGoogle ScholarCross RefCross Ref
  10. J. Maurer, G. Matz, and D. Seethaler. Low-complexity and full-diversity MIMO detection based on condition number thresholding. In ICASSP'07, Honolulu, Hawaii, USA, April 2007.Google ScholarGoogle ScholarCross RefCross Ref
  11. A. J. Paulraj, D. A. Gore, R. U. Nabar, and H. Bölcskei. An overview of MIMO communications - a key to gigabit wireless. Proceedings of the IEEE, 92(2):198--218, 2004.Google ScholarGoogle ScholarCross RefCross Ref
  12. S. Roger, A. Gonzalez, V. Almenar, and A. M. Vidal. Combined K-Best Sphere Decoder based on the channel matrix condition number. In ISCCSP'08, St. Julians, Malta, March 2008.Google ScholarGoogle ScholarCross RefCross Ref
  13. C. Studer, A. Burg, and H. Bölcksei. Soft-output sphere decoding: Algorithms and VLSI implementation. IEEE Journal on Selected Areas in Communications, 26(2):290--300, February 2008. Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. M. Wenk, M. Zellweger, A. Burg, N. Felber, and W. Fichtner. K-best MIMO detection VLSI architectures achieving up to 424 Mbps. In ISCAS'06, Island of Kos, Greece, May 2006.Google ScholarGoogle ScholarCross RefCross Ref

Index Terms

  1. Variable-breadth K-best detector for MIMO systems

      Recommendations

      Comments

      Login options

      Check if you have access through your login credentials or your institution to get full access on this article.

      Sign in
      • Published in

        cover image ACM Other conferences
        IWCMC '10: Proceedings of the 6th International Wireless Communications and Mobile Computing Conference
        June 2010
        1371 pages
        ISBN:9781450300629
        DOI:10.1145/1815396

        Copyright © 2010 ACM

        Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

        Publisher

        Association for Computing Machinery

        New York, NY, United States

        Publication History

        • Published: 28 June 2010

        Permissions

        Request permissions about this article.

        Request Permissions

        Check for updates

        Qualifiers

        • research-article
      • Article Metrics

        • Downloads (Last 12 months)1
        • Downloads (Last 6 weeks)0

        Other Metrics

      PDF Format

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader