메뉴 건너뛰기




Volumn 5, Issue , 2004, Pages 2720-2725

A highly-parallel VLSI architecture for a list sphere detector

Author keywords

Closest point search; Lattice decoding; MIMO; Multiuser detection (MUD); Parallel computing

Indexed keywords

APPLICATION SPECIFIC INTEGRATED CIRCUITS; COMPUTATIONAL COMPLEXITY; DECODING; GAUSSIAN NOISE (ELECTRONIC); MATRIX ALGEBRA; PARALLEL PROCESSING SYSTEMS; PROBLEM SOLVING; VECTORS;

EID: 4143121248     PISSN: 05361486     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/icc.2004.1313025     Document Type: Conference Paper
Times cited : (20)

References (8)
  • 4
    • 84966239268 scopus 로고
    • Improved methods for calculating vectors of short length in a lattice, including a complexity analysis
    • Apr.
    • U. Fincke, M Pohst, "Improved methods for calculating vectors of short length in a lattice, including a complexity analysis", Mathematics of Computation, vol 44, pp. 463-471, Apr. 1985.
    • (1985) Mathematics of Computation , vol.44 , pp. 463-471
    • Fincke, U.1    Pohst, M.2
  • 5
    • 0038059297 scopus 로고    scopus 로고
    • Achieving near-capacity on a multiple-antenna channel
    • Mar
    • B. Hochwald, S ten Brink, "Achieving Near-Capacity on a Multiple-Antenna Channel", IEEE Trans. Information Theory, vol 51, No. 8 pp389-399, Mar 2003.
    • (2003) IEEE Trans. Information Theory , vol.51 , Issue.8 , pp. 389-399
    • Hochwald, B.1    Ten Brink, S.2


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