메뉴 건너뛰기




Volumn , Issue 503, 2004, Pages 93-97

Performance tradeoffs in the VLSI implementation of the sphere decoding algorithm

Author keywords

[No Author keywords available]

Indexed keywords

APPLICATION SPECIFIC INTEGRATED CIRCUITS; MAXIMUM LIKELIHOOD ESTIMATION; SIGNAL PROCESSING; TELECOMMUNICATION SYSTEMS; VLSI CIRCUITS;

EID: 27644598543     PISSN: 05379989     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1049/cp:20040642     Document Type: Conference Paper
Times cited : (15)

References (11)
  • 1
    • 0002586419 scopus 로고
    • On the computation of lattice vectors of minimal length, successive minima and reduced bases with applications
    • Feb.
    • M. Pohst, "On the computation of lattice vectors of minimal length, successive minima and reduced bases with applications," SIGSAM Bulletin, vol. 15, no. 1, pp. 37-44, Feb. 1981.
    • (1981) SIGSAM Bulletin , vol.15 , Issue.1 , pp. 37-44
    • Pohst, M.1
  • 2
    • 17544403843 scopus 로고    scopus 로고
    • On the expected complexity of sphere decoding
    • B. Hassibi and H. Vikalo, "On the expected complexity of sphere decoding," in Proc. IEEE ICASSP, vol. 2, 2002, pp. 1497-1500.
    • (2002) Proc. IEEE ICASSP , vol.2 , pp. 1497-1500
    • Hassibi, B.1    Vikalo, H.2
  • 3
    • 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 Trans. Inform. Theory, vol. 49, no. 10, pp. 2389-2402, Oct. 2003.
    • (2003) IEEE Trans. Inform. Theory , vol.49 , Issue.10 , pp. 2389-2402
    • Damen, M.O.1    El Gamal, H.2    Caire, G.3
  • 4
    • 84966239268 scopus 로고
    • Improved methods for calculating vectors of short length in a lattice, including a complexity analysis
    • Apr.
    • 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, no. 170, pp. 463-471, Apr. 1985.
    • (1985) Mathematics of Computation , vol.44 , Issue.170 , pp. 463-471
    • Fincke, U.1    Pohst, M.2
  • 5
    • 33846200465 scopus 로고
    • Lattice basis reduction: Improved practical algorithms and solving subset sum problems
    • C. P. Schnorr and M. Euchner, "Lattice basis reduction: Improved practical algorithms and solving subset sum problems," Math. Programming, vol. 66, pp. 181-191, 1994.
    • (1994) Math. Programming , vol.66 , pp. 181-191
    • Schnorr, C.P.1    Euchner, M.2
  • 6
    • 0032636505 scopus 로고    scopus 로고
    • A universal lattice decoder for fading channels
    • July
    • E. Viterbo and J. Boutros, "A universal lattice decoder for fading channels," 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
  • 7
    • 0038059297 scopus 로고    scopus 로고
    • Achieving near-capacity on a multiple-antenna channel
    • Mar.
    • [7) B. M. Hochwald and S. ten Brink, "Achieving near-capacity on a multiple-antenna channel" IEEE Trans. Inform. Theory, vol. 51, no. 3, pp. 389-399, Mar. 2003.
    • (2003) IEEE Trans. Inform. Theory , vol.51 , Issue.3 , pp. 389-399
    • Hochwald, B.M.1    Ten Brink, S.2
  • 9
    • 77956020293 scopus 로고    scopus 로고
    • A 50 Mbps 4 × 4 maximum likelihood decoder for multiple-input multiple-output systems with QPSK modulation
    • A. Burg, N. Felber, and W. Fichtner, "A 50 Mbps 4 × 4 maximum likelihood decoder for multiple-input multiple-output systems with QPSK modulation," in Proc. IEEE Int. Conf. Electron., Circuits, Syst. (ICECS), vol. 1, 2003, pp. 332-335.
    • (2003) Proc. IEEE Int. Conf. Electron., Circuits, Syst. (ICECS) , vol.1 , pp. 332-335
    • Burg, A.1    Felber, N.2    Fichtner, W.3


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