메뉴 건너뛰기




Volumn 60, Issue 5, 2004, Pages 3679-3683

Efficient near maximum-likelihood decoding of multistratum space-time codes

Author keywords

Space Time Codes; Sphere Decoding; V BLAST

Indexed keywords

ALGORITHMS; MATHEMATICAL MODELS; MATRIX ALGEBRA; MAXIMUM LIKELIHOOD ESTIMATION; SIGNAL DETECTION; SIGNAL TO NOISE RATIO;

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

References (18)
  • 1
    • 0032217929 scopus 로고    scopus 로고
    • V-BLAST: An architecture for realizing very high data rates over the rich-scattering wireless channel
    • Pisa, Italy, September
    • P. W. Wolniansky, G. J. Foschini, G. D. Golden, and R. A. Valenzuela, "V-BLAST: An Architecture for Realizing Very High Data Rates Over the Rich-Scattering Wireless Channel," in Proc. ISSE, Pisa, Italy, September 1998.
    • (1998) Proc. ISSE
    • Wolniansky, P.W.1    Foschini, G.J.2    Golden, G.D.3    Valenzuela, R.A.4
  • 3
    • 0035187913 scopus 로고    scopus 로고
    • Exploiting the data-rate potential of MIMO channels: Multi-stratum space-time coding
    • Rhodes, Greece, May 6-9
    • U. Wachsmann, J. Thielecke, and H. Schotten, "Exploiting the Data-Rate Potential of MIMO Channels: Multi-Stratum Space-Time Coding," in Proc. IEEE VTC Spring 2001, Rhodes, Greece, May 6-9 2001.
    • (2001) Proc. IEEE VTC Spring 2001
    • Wachsmann, U.1    Thielecke, J.2    Schotten, H.3
  • 5
    • 4143057007 scopus 로고    scopus 로고
    • MMSE extension of V-BLAST based on sorted QR decomposition
    • Orlando, Florida, USA, October
    • D. Wübben, R. Böhnke, V. Kühn, and K. D. Kammeyer, "MMSE Extension of V-BLAST based on Sorted QR Decomposition," in Proc. VTC-Fall, Orlando, Florida, USA, October 2003.
    • (2003) Proc. VTC-Fall
    • Wübben, D.1    Böhnke, R.2    Kühn, V.3    Kammeyer, K.D.4
  • 6
    • 0032183752 scopus 로고    scopus 로고
    • A simple transmit diversity technique for wireless communications
    • October
    • S. M. Alamouti, "A Simple Transmit Diversity Technique for Wireless Communications," IEEE Journal on Selected Areas in Commmunications, vol. 16, no. 8, pp. 1451-1458, October 1998.
    • (1998) IEEE Journal on Selected Areas in Commmunications , vol.16 , Issue.8 , pp. 1451-1458
    • Alamouti, S.M.1
  • 7
    • 3142719033 scopus 로고    scopus 로고
    • A systematic design of high-rate complex orthogonal space-time block codes
    • June
    • W. Su, X.-G. Xia, and K. J. R. Liu, "A Systematic Design of High-Rate Complex Orthogonal Space-Time Block Codes," IEEE Communications Letters, vol. 8, no. 6. pp. 380- 382, June 2004.
    • (2004) IEEE Communications Letters , vol.8 , Issue.6 , pp. 380-382
    • Su, W.1    Xia, X.-G.2    Liu, K.J.R.3
  • 8
    • 0037721667 scopus 로고    scopus 로고
    • Improved quasiorthogonal code through constellation rotation
    • March
    • N. Sharma and C. Papadias, "Improved Quasiorthogonal Code through Constellation Rotation," IEEE Transactions on Communications, vol. 51, no. 3, pp. 332-335, March 2003.
    • (2003) IEEE Transactions on Communications , vol.51 , Issue.3 , pp. 332-335
    • Sharma, N.1    Papadias, C.2
  • 9
    • 0036649525 scopus 로고    scopus 로고
    • High-rate codes that are linear in space and time
    • July
    • B. Hassibi and B. Hochwald, "High-Rate Codes that are Linear in Space and Time," IEEE Transactions on Information Theory, vol. 48, no. 7, pp. 1804-1824, July 2002.
    • (2002) IEEE Transactions on Information Theory , vol.48 , Issue.7 , pp. 1804-1824
    • Hassibi, B.1    Hochwald, B.2
  • 10
    • 84966239268 scopus 로고
    • Improved methods for calculating vectors of short length in a lattice, including a complexity analysis
    • U. Fincke and M. Pohst, "Improved Methods for Calculating Vectors of Short Length in a Lattice, Including a Complexity Analysis," Math. Comp, vol. 44, pp. 463-471, 1985.
    • (1985) Math. Comp , vol.44 , pp. 463-471
    • Fincke, U.1    Pohst, M.2
  • 11
    • 0032636505 scopus 로고    scopus 로고
    • A universal lattice code decoder for fading channels
    • July
    • E. Viterbo and J. Boutros, "A Universal Lattice Code Decoder for Fading Channels," IEEE Transactions on Information Theory, vol. 45, no. 5, pp. 1639-1642, July 1999.
    • (1999) IEEE Transactions on Information Theory , vol.45 , Issue.5 , pp. 1639-1642
    • Viterbo, E.1    Boutros, J.2
  • 13
    • 33846200465 scopus 로고
    • Lattice basis reduction: Improved practical alorithms and solving subset sum problems
    • C. P. Schnorr and M. Euchner, "Lattice Basis Reduction: Improved Practical Alorithms 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    Euchner, M.2
  • 14
    • 0242365586 scopus 로고    scopus 로고
    • On maximum-likelihood detection and the search for the closest lattice point
    • October
    • M. Damen, H. E. Gamal, and G. Caire, "On Maximum-Likelihood Detection and the Search for the Closest Lattice Point," IEEE Transactions on Information Theory, vol. 49, no. 10, pp. 2389-2402, October 2003.
    • (2003) IEEE Transactions on Information Theory , vol.49 , Issue.10 , pp. 2389-2402
    • Damen, M.1    Gamal, H.E.2    Caire, G.3
  • 17
    • 0037422060 scopus 로고    scopus 로고
    • Real- vs. Complex-valued equalization in V-BLAST systems
    • March
    • R. Fischer and C. Windpassinger, "Real- vs. Complex-Valued Equalization in V-BLAST Systems," IEE Electronics Letters, vol. 39, no. 5, pp. 470-471, March 2003.
    • (2003) IEE Electronics Letters , vol.39 , Issue.5 , pp. 470-471
    • Fischer, R.1    Windpassinger, C.2


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