Performance and complexity analysis of infinity-norm sphere-decoding

BibTeX Reference

Warning: This BibTeX entry is automatically generated from the database. As there is no one-to-one match between the database fields and the BibTeX format, there may be errors in the entry. Regard the BibTeX feature as experimental for now. Use with care and correct errors and omissions manually.
Please, do provide feedback about this feature to Michael Lerjen.

@article{LinfSD_sub,
    author = {Seethaler, Dominik and Bölcskei, Helmut},
    title = {Performance and complexity analysis of infinity-norm sphere-decoding },
    journal = {IEEE Transactions on Information Theory},
    volume = 56,
    number = 3,
    pages = {1085--1105},
    month = mar,
    year = 2010,
    keywords = {Algorithmic complexity, data detection, hardware complexity, infinity norm, maximum-likelihood, multiple-input multiple-output (MIMO) wireless},
    url = {http://www.nari.ee.ethz.ch/pubs/p/LinfSD_sub}
}

LaTeX Reference

\bibitem{LinfSD_sub} D. Seethaler and H. Bölcskei, ``Performance and complexity analysis of infinity-norm sphere-decoding ,'' \emph{IEEE Transactions on Information Theory}, Vol. 56, No. 3, pp. 1085-1105, Mar. 2010.

HTML Reference

D. Seethaler and H. Bölcskei, "Performance and complexity analysis of infinity-norm sphere-decoding ," IEEE Transactions on Information Theory, Vol. 56, No. 3, pp. 1085-1105, Mar. 2010.