메뉴 건너뛰기




Volumn 54, Issue 9, 2006, Pages 3330-3342

On joint detection and decoding of linear block codes on gaussian vector channels

Author keywords

Expected complexity; Integer least squares; Joint detection and decoding; Lattice problems; Multiantenna systems; NP hard; Sphere decoding (SD); Wireless communications

Indexed keywords

COMMUNICATION CHANNELS (INFORMATION THEORY); DECODING; MAXIMUM LIKELIHOOD; OPTIMIZATION; SECURITY OF DATA; SIGNAL PROCESSING;

EID: 33947112286     PISSN: 1053587X     EISSN: None     Source Type: Journal    
DOI: 10.1109/TSP.2006.877675     Document Type: Article
Times cited : (18)

References (15)
  • 1
    • 0036670969 scopus 로고    scopus 로고
    • Closest point search in lattices
    • Aug
    • E. Agrell, A. Vardy, and K. Zeger, "Closest point search in lattices," IEEE Trans. Inf. Theory, vol. 48, no. 8, pp. 2201-2214, Aug. 2002.
    • (2002) IEEE Trans. Inf. Theory , vol.48 , Issue.8 , pp. 2201-2214
    • Agrell, E.1    Vardy, A.2    Zeger, K.3
  • 2
    • 0032636505 scopus 로고    scopus 로고
    • E. Viterbo and J. Boutros, A universal lattice decoder for fading channels, IEEE Trans. Inf. Theory, 45, no., pp. 1639-1642, Jul. 2000.
    • E. Viterbo and J. Boutros, "A universal lattice decoder for fading channels," IEEE Trans. Inf. Theory, vol. 45, no., pp. 1639-1642, Jul. 2000.
  • 3
    • 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," Math. Comput., vol. 44, pp. 463-471, Apr. 1985.
    • (1985) Math. Comput , vol.44 , pp. 463-471
    • Fincke, U.1    Pohst, M.2
  • 4
    • 0033706196 scopus 로고    scopus 로고
    • Lattice code decoder for space-time codes
    • May
    • M. O. Damen, A. Chkeif, and J.-C. Belfiore, "Lattice code decoder for space-time codes," IEEE Commun. Lett., vol. 4, no. 5, pp. 161-163, May 2000.
    • (2000) IEEE Commun. Lett , vol.4 , Issue.5 , pp. 161-163
    • Damen, M.O.1    Chkeif, A.2    Belfiore, J.-C.3
  • 5
    • 84978856816 scopus 로고    scopus 로고
    • On sphere decoding algorithm. I. Expected complexity
    • Aug
    • B. Hassibi and H. Vikalo, "On sphere decoding algorithm. I. Expected complexity," IEEE Trans. Signal Process., vol. 53, no. 8, pp. 2806-2818, Aug. 2005.
    • (2005) IEEE Trans. Signal Process , vol.53 , Issue.8 , pp. 2806-2818
    • Hassibi, B.1    Vikalo, H.2
  • 6
    • 85008006460 scopus 로고    scopus 로고
    • On sphere decoding algorithm. II. Generalizations, second-order moments, and applications to communications
    • Aug
    • H. Vikalo and B. Hassibi, "On sphere decoding algorithm. II. Generalizations, second-order moments, and applications to communications," IEEE Trans. Signal Process., vol. 53, no. 8, pp. 2819-2834, Aug. 2005.
    • (2005) IEEE Trans. Signal Process , vol.53 , Issue.8 , pp. 2819-2834
    • Vikalo, H.1    Hassibi, B.2
  • 7
    • 0141938895 scopus 로고    scopus 로고
    • On joint ML detection and decoding for linear block codes
    • Yokohama, Japan
    • _, "On joint ML detection and decoding for linear block codes," in Proc. IEEE Int. Symp. Inf. Theory, Yokohama, Japan, 2003, p. 275.
    • (2003) Proc. IEEE Int. Symp. Inf. Theory , pp. 275
    • Vikalo, H.1    Hassibi, B.2
  • 8
    • 0036649525 scopus 로고    scopus 로고
    • High-rate codes that are linear in space and time
    • Jul
    • B. Hassibi and B. M. Hochwald, "High-rate codes that are linear in space and time," IEEE Trans. Inf. Theory, vol. 48, no. 7, pp. 1804-1824, Jul. 2002.
    • (2002) IEEE Trans. Inf. Theory , vol.48 , Issue.7 , pp. 1804-1824
    • Hassibi, B.1    Hochwald, B.M.2
  • 9
    • 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, no. 3, pp. 389-399, Mar. 2003.
    • (2003) IEEE Trans. Commun , vol.51 , Issue.3 , pp. 389-399
    • Hochwald, B.1    ten Brink, S.2
  • 10
  • 12
    • 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
  • 13
    • 0345306775 scopus 로고    scopus 로고
    • Algebraic soft-decision decoding of Reed-Solomon codes
    • Nov
    • R. Koetter and A. Vardy, "Algebraic soft-decision decoding of Reed-Solomon codes," IEEE Trans. Inf. Theory, vol. 49, pp. 2809-2825, Nov. 2003.
    • (2003) IEEE Trans. Inf. Theory , vol.49 , pp. 2809-2825
    • Koetter, R.1    Vardy, A.2
  • 14
    • 0029373149 scopus 로고
    • Soft-decision decoding of linear block codes based on ordered statistics
    • Sep
    • M. Fossorier and S. Lin, "Soft-decision decoding of linear block codes based on ordered statistics," IEEE Trans. Inf. Theory, vol. 41, pp. 1379-1396, Sep. 1995.
    • (1995) IEEE Trans. Inf. Theory , vol.41 , pp. 1379-1396
    • Fossorier, M.1    Lin, S.2
  • 15
    • 33947156892 scopus 로고    scopus 로고
    • Efficient maximum-likelihood decoding via statistical pruning
    • submitted for publication
    • R. Gowaikar and B. Hassibi, "Efficient maximum-likelihood decoding via statistical pruning," IEEE Trans. Signal Process., 2005, submitted for publication.
    • (2005) IEEE Trans. Signal Process
    • Gowaikar, R.1    Hassibi, B.2


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