메뉴 건너뛰기




Volumn 4, Issue , 2004, Pages

An exponential lower bound on the expected complexity of sphere decoding

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMMUNICATION CHANNELS (INFORMATION THEORY); COMPUTATIONAL COMPLEXITY; MATRIX ALGEBRA; POLYNOMIALS; PROBLEM SOLVING; SIGNAL TO NOISE RATIO; VECTORS;

EID: 4544278544     PISSN: 15206149     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (57)

References (11)
  • 1
    • 0032636505 scopus 로고    scopus 로고
    • A universal lattice code decoder for fading channel
    • July
    • E. Viterbo and J. Boutros, "A universal lattice code decoder for fading channel," IEEE Trans. Inform. Theory, vol. 45, no. 5, pp. 1639-1642, July 1999.
    • (1999) IEEE Trans. Inform. Theory , vol.45 , Issue.5 , pp. 1639-1642
    • Viterbo, E.1    Boutros, J.2
  • 2
    • 0036649525 scopus 로고    scopus 로고
    • High-rate codes that are linear in space and time
    • June
    • B. Hassibi and B. M. Hochwald, "High-rate codes that are linear in space and time," IEEE Trans. Inform. Theory, vol. 48, no. 7, pp. 1804-1824, June 2002.
    • (2002) IEEE Trans. Inform. Theory , vol.48 , Issue.7 , pp. 1804-1824
    • Hassibi, B.1    Hochwald, B.M.2
  • 3
    • 0033706196 scopus 로고    scopus 로고
    • Lattice code decoder for space-time codes
    • May
    • O. Damen, A. Chkeif, and J.-C. Belfiore, "Lattice code decoder for space-time codes," IEEE Comm. Let., vol. 4, no. 5, pp. 161-163, May 2000.
    • (2000) IEEE Comm. Let. , vol.4 , Issue.5 , pp. 161-163
    • Damen, O.1    Chkeif, A.2    Belfiore, J.-C.3
  • 4
    • 17544403843 scopus 로고    scopus 로고
    • On the expected complexity of integer least-squares problems
    • May
    • B. Hassibi and H. Vikalo, "On the expected complexity of integer least-squares problems," in Proc. IEEE ICASSP'02, May 2002, vol. 2, pp. 1497-1500.
    • (2002) Proc. IEEE ICASSP'02 , vol.2 , pp. 1497-1500
    • Hassibi, B.1    Vikalo, H.2
  • 7
    • 0024775598 scopus 로고
    • Computational complexity of multiuser detection
    • S. Verdú, "Computational complexity of multiuser detection," Algorithmica, vol. 4, pp. 303-312, 1989.
    • (1989) Algorithmica , vol.4 , pp. 303-312
    • Verdú, S.1
  • 8
    • 0038059297 scopus 로고    scopus 로고
    • Achieving near-capacity on a multiple-antenna channels
    • Mar.
    • B. M. Hochwald and S. Brink, "Achieving near-capacity on a multiple-antenna channels," IEEE Trans. Comm., vol. 51, no. 3, pp. 389-399, Mar. 2003.
    • (2003) IEEE Trans. Comm. , vol.51 , Issue.3 , pp. 389-399
    • Hochwald, B.M.1    Brink, S.2
  • 9
    • 0004250318 scopus 로고
    • Macmillan Publishing Company, second edition
    • S. Ross, A First Course in Probability, Macmillan Publishing Company, second edition, 1984.
    • (1984) A First Course in Probability
    • Ross, S.1
  • 10
    • 4544355762 scopus 로고    scopus 로고
    • On the expected complexity of sphere decoding in digital communications
    • Submitted to
    • J. Jaldén and B. Ottersten, "On the expected complexity of sphere decoding in digital communications," Submitted to IEEE Trans. Sig. Proc., 2003.
    • (2003) IEEE Trans. Sig. Proc.
    • Jaldén, J.1    Ottersten, B.2
  • 11
    • 0036282015 scopus 로고    scopus 로고
    • A new reduced complexity sphere decoder for multiple antenna systems
    • Apr.
    • A. M. Chan and I. Lee, "A new reduced complexity sphere decoder for multiple antenna systems," in Proc. ICC'02, Apr. 2002.
    • (2002) Proc. ICC'02
    • Chan, A.M.1    Lee, I.2


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