메뉴 건너뛰기




Volumn 56, Issue 2, 2002, Pages 1041-1045

Iterative tree search detection for MIMO wireless systems

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; ANTENNAS; COMMUNICATION CHANNELS (INFORMATION THEORY); COMPUTATIONAL COMPLEXITY; COMPUTER SIMULATION; OPTIMIZATION; QUADRATURE AMPLITUDE MODULATION; RAYLEIGH FADING;

EID: 0036445623     PISSN: 07400551     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (54)

References (7)
  • 1
    • 0003330049 scopus 로고    scopus 로고
    • Achieving near-capacity on a multiple-antenna channel
    • July
    • B.M. Hochwald and S. ten Brink, "Achieving near-capacity on a multiple-antenna channel," submitted to IEEE Trans. Commun., July 2001, available at http://mars.bell-labs.com
    • (2001) IEEE Trans. Commun.
    • Hochwald, B.M.1    Ten Brink, S.2
  • 2
    • 0035188364 scopus 로고    scopus 로고
    • Array processing for simplified turbo decoding of inter-leaved space-time codes
    • A.M. Tonello, "Array processing for simplified turbo decoding of inter-leaved space-time codes," in Proc. VTC2001-Fall, Atlantic City, NJ, 2001, vol. 3, pp. 1304-1308.
    • Proc. VTC2001-Fall, Atlantic City, NJ, 2001 , vol.3 , pp. 1304-1308
    • Tonello, A.M.1
  • 3
    • 0035330528 scopus 로고    scopus 로고
    • Turbo-coded modulation for systems with transmit and receive antenna diversity over block fading channels: System model, decoding approaches, and practical considerations
    • A. Stefanov and T.M. Duman, "Turbo-coded modulation for systems with transmit and receive antenna diversity over block fading channels: system model, decoding approaches, and practical considerations," IEEE J. Select. Areas Commun., vol. 19, no. 5, pp. 958-968, 2001.
    • (2001) IEEE J. Select. Areas Commun. , vol.19 , Issue.5 , pp. 958-968
    • Stefanov, A.1    Duman, T.M.2
  • 4
    • 0032023656 scopus 로고    scopus 로고
    • Soft-input soft-output modules for the construction and distributed iterative decoding of code networks
    • S. Benedetto, G. Montorsi, D. Divsalar, and F. Pollara, "Soft-input soft-output modules for the construction and distributed iterative decoding of code networks," Eur. Trans. Telecommun., vol. 9, no. 2, pp. 155-172, 1998.
    • (1998) Eur. Trans. Telecommun. , vol.9 , Issue.2 , pp. 155-172
    • Benedetto, S.1    Montorsi, G.2    Divsalar, D.3    Pollara, F.4
  • 5
    • 0021372019 scopus 로고
    • Sequential coding algorithms: A survey and cost analysis
    • J.B. Anderson and S. Mohan, "Sequential coding algorithms: a survey and cost analysis," IEEE Trans. Commun., vol. COM-32, no. 2, pp. 169-176, 1984.
    • (1984) IEEE Trans. Commun. , vol.COM-32 , Issue.2 , pp. 169-176
    • Anderson, J.B.1    Mohan, S.2
  • 7
    • 0029234412 scopus 로고    scopus 로고
    • Comparison of optimal and sub-optimal MAP decoding algorithms operating in the log domain
    • P. Robertson, E. Villebrun, and P. Hoeher, "Comparison of optimal and sub-optimal MAP decoding algorithms operating in the log domain," in Proc. ICC'95, Seattle, WA, 1995, pp. 1009-1013.
    • Proc. ICC'95, Seattle, WA, 1995 , pp. 1009-1013
    • Robertson, P.1    Villebrun, E.2    Hoeher, P.3


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