메뉴 건너뛰기




Volumn , Issue , 2007, Pages

Golden code with low complexity sphere decoder

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTATIONAL METHODS; MOBILE TELECOMMUNICATION SYSTEMS; SIGNAL TO NOISE RATIO;

EID: 44349109530     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/PIMRC.2007.4394327     Document Type: Conference Paper
Times cited : (9)

References (10)
  • 1
    • 0032023863 scopus 로고    scopus 로고
    • Space-Time Codes for High Data Rate Wireless Communications: Performance Criterion and Code Construction
    • V. Tarokh, N. Seshadri and A. R. Calderbank, "Space-Time Codes for High Data Rate Wireless Communications: Performance Criterion and Code Construction," IEEE Transactions on Information Theory, vol. 44, no. 2, pp. 744-765, 1998.
    • (1998) IEEE Transactions on Information Theory , vol.44 , Issue.2 , pp. 744-765
    • Tarokh, V.1    Seshadri, N.2    Calderbank, A.R.3
  • 2
    • 0036649525 scopus 로고    scopus 로고
    • High-rate codes that are linear in space and time
    • July
    • B. Hassibi and B. M. Hochwald, "High-rate codes that are linear in space and time," IEEE Trans. Inform. Theory, vol. 48, pp. 1804-1824, July 2002.
    • (2002) IEEE Trans. Inform. Theory , vol.48 , pp. 1804-1824
    • Hassibi, B.1    Hochwald, B.M.2
  • 3
    • 17644371649 scopus 로고    scopus 로고
    • The Golden Code: A 2×2 full-rate space-time code with non-vanishing determinants
    • Apr
    • J.-C. Belfiore, G. Rekaya, and E. Viterbo, "The Golden Code: A 2×2 full-rate space-time code with non-vanishing determinants," IEEE Transactions on Information Theory, vol. 51, no. 4, pp. 1432-1436, Apr. 2005.
    • (2005) IEEE Transactions on Information Theory , vol.51 , Issue.4 , pp. 1432-1436
    • Belfiore, J.-C.1    Rekaya, G.2    Viterbo, E.3
  • 4
    • 0033706196 scopus 로고    scopus 로고
    • Lattice codes decoder for space-time codes
    • May
    • M. O. Damen, A. Chkeif, and J.-C. Belfiore, "Lattice codes decoder for space-time codes," IEEE Commun. Lett., vol. 4, pp. 161-163, May 2000.
    • (2000) IEEE Commun. Lett , vol.4 , pp. 161-163
    • Damen, M.O.1    Chkeif, A.2    Belfiore, J.-C.3
  • 5
    • 17444400753 scopus 로고    scopus 로고
    • On the complexity of sphere decoding in digital communications
    • Apr
    • J. Jalden and B. Ottersten, "On the complexity of sphere decoding in digital communications," IEEE Trans. Signal Process, vol. 53, no. 4, pp. 1474-1484, Apr. 2005.
    • (2005) IEEE Trans. Signal Process , vol.53 , Issue.4 , pp. 1474-1484
    • Jalden, J.1    Ottersten, B.2
  • 6
    • 0038059297 scopus 로고    scopus 로고
    • Achieving near-capacity on a multiple antenna channel
    • Mar
    • B. Hochwald and S. ten Brink, "Achieving near-capacity on a multiple antenna channel," IEEE Trans. Commun., vol. 51, pp. 389-399, Mar. 2003.
    • (2003) IEEE Trans. Commun , vol.51 , pp. 389-399
    • Hochwald, B.1    ten Brink, S.2
  • 8
    • 0242365586 scopus 로고    scopus 로고
    • On maximum-likelihood detection and the search for the closest lattice point
    • Oct
    • M. O. Damen, H. E. Gamai and G. Caire, "On maximum-likelihood detection and the search for the closest lattice point," IEEE Trans. Inform. Theory, vol. 49, pp. 2389-2402, Oct. 2003.
    • (2003) IEEE Trans. Inform. Theory , vol.49 , pp. 2389-2402
    • Damen, M.O.1    Gamai, H.E.2    Caire, G.3
  • 9
    • 0032680133 scopus 로고    scopus 로고
    • Decision feedback multi-user detection: A systematic approach
    • January
    • M. K. Varanasi, "Decision feedback multi-user detection: A systematic approach," IEEE Transactions on Information Theory, vol. 45, pp. 219-240, January 1999.
    • (1999) IEEE Transactions on Information Theory , vol.45 , pp. 219-240
    • Varanasi, M.K.1
  • 10
    • 44349104972 scopus 로고    scopus 로고
    • Gene H. Golub and Charles F. van Loan, Matrix computations, Johns Hopkins University Press, 1996.
    • Gene H. Golub and Charles F. van Loan, Matrix computations, Johns Hopkins University Press, 1996.


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