메뉴 건너뛰기




Volumn 61, Issue 1, 2005, Pages 438-441

A faster ML sphere decoder with competing branches

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; MAXIMUM LIKELIHOOD ESTIMATION; NUMERICAL ANALYSIS; RECURSIVE FUNCTIONS;

EID: 26444615390     PISSN: 15502252     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (6)

References (11)
  • 1
    • 0032022195 scopus 로고    scopus 로고
    • On limits of wireless communications in a fading environment when using multiple antennas
    • March
    • G. J. Foschini and M. J. Gans, "On Limits of Wireless Communications in a Fading Environment When Using Multiple Antennas", Wireless Personal Communications, Volume 6, No. 3, March 1998, p. 311.
    • (1998) Wireless Personal Communications , vol.6 , Issue.3 , pp. 311
    • Foschini, G.J.1    Gans, M.J.2
  • 2
    • 0004082156 scopus 로고    scopus 로고
    • McGraw-Hill, New York City,New York, USA,3nd edition
    • John. G. Proakis, Digital Communications,McGraw-Hill, New York City,New York, USA,3nd edition
    • Digital Communications
    • Proakis, J.G.1
  • 3
    • 84966239268 scopus 로고
    • Improved methods for calculating vectors of short length in a lattice, including a complexity analysis
    • April
    • U. Fincke and M. Pohst, "Improved methods for calculating vectors of short length in a lattice, including a complexity analysis," Mathematics of Computation, vol. 44, pp. 463-471, April 1985.
    • (1985) Mathematics of Computation , vol.44 , pp. 463-471
    • Fincke, U.1    Pohst, M.2
  • 4
    • 33846200465 scopus 로고
    • Lattice basis reduction: Improved practical algorithms and solving subset sum problems
    • C.P. Schnorr and M. Euchnerr,"Lattice basis reduction: improved practical algorithms and solving subset sum problems," Mathematical Programming, vol.66, pp. 181-191, 1994.
    • (1994) Mathematical Programming , vol.66 , pp. 181-191
    • Schnorr, C.P.1    Euchnerr, M.2
  • 6
    • 84907083208 scopus 로고    scopus 로고
    • The expected complexity of sphere decoding, Part I: Theory, Part II: Applications
    • submitted for publication
    • H. Vikalo and B. Hassibi, "The expected complexity of sphere decoding, Part I: Theory, Part II: Applications," IEEE Trans. Signal Processing, submitted for publication.
    • IEEE Trans. Signal Processing
    • Vikalo, H.1    Hassibi, B.2
  • 7
    • 0036282015 scopus 로고    scopus 로고
    • A new reduced-complexity sphere decoder for multiple antenna systems
    • New York City, N.Y., April 28-May 2
    • A. Chan and I. Lee, "A new reduced-complexity sphere decoder for multiple antenna systems," Proc. of Intl. Conf. on Communications, vol. 1, pp. 460-464, New York City, N.Y., April 28-May 2, 2002.
    • (2002) Proc. of Intl. Conf. on Communications , vol.1 , pp. 460-464
    • Chan, A.1    Lee, I.2
  • 8
    • 0242365586 scopus 로고    scopus 로고
    • On maximum-likelihood detection and the search for the closest lattice point
    • Oct.
    • M.O. Damen, H. El Gamal, and G. Caire, "On maximum-likelihood detection and the search for the closest lattice point", IEEE Transactions on Information Theory, vol. 49, pp.2389 - 2402, Oct. 2003.
    • (2003) IEEE Transactions on Information Theory , vol.49 , pp. 2389-2402
    • Damen, M.O.1    El Gamal, H.2    Caire, G.3


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.