메뉴 건너뛰기




Volumn 37, Issue 11, 2002, Pages 1555-1564

A unified turbo/viterbi channel decoder for 3GPP mobile wireless in 0.18-μm CMOS

Author keywords

Channel decoding; Decoding; Error correction; Mobile communications; Turbo; Viterbi

Indexed keywords

ALGORITHMS; COMMUNICATION CHANNELS (INFORMATION THEORY); CONVOLUTIONAL CODES; DECODING; ERROR CORRECTION; INTEGRATED CIRCUIT LAYOUT; ITERATIVE METHODS; MOBILE TELECOMMUNICATION SYSTEMS; WIRELESS TELECOMMUNICATION SYSTEMS;

EID: 0036857198     PISSN: 00189200     EISSN: None     Source Type: Journal    
DOI: 10.1109/JSSC.2002.803929     Document Type: Article
Times cited : (53)

References (15)
  • 3
    • 0036117605 scopus 로고    scopus 로고
    • A 4.32GOPS 1 W general purpose DSP with an enhanced instruction set for wireless communication
    • Feb.
    • A. Olofsson and F. Lange, "A 4.32GOPS 1 W general purpose DSP with an enhanced instruction set for wireless communication," in IEEE Int. Solid State Circuits Conf. Dig. Tech. Papers, vol. 45, Feb. 2002, pp. 54-55.
    • (2002) IEEE Int. Solid State Circuits Conf. Dig. Tech. Papers , vol.45 , pp. 54-55
    • Olofsson, A.1    Lange, F.2
  • 8
    • 0029234412 scopus 로고    scopus 로고
    • A comparison of optimal and suboptimal MAP decoding algorithms operating in the log domain
    • R. Robertson, E. Villebrun, and P. Hoeher, "A comparison of optimal and suboptimal MAP decoding algorithms operating in the log domain," in Proc. IEEE Int. Conf. Communications, 1995, pp. 1009-1013.
    • Proc. IEEE Int. Conf. Communications, 1995 , pp. 1009-1013
    • Robertson, R.1    Villebrun, E.2    Hoeher, P.3
  • 9
    • 84935113569 scopus 로고
    • Error bounds for convolutional codes and asymptotically optimum decoding algorithm
    • Apr.
    • A. J. Viterbi, "Error bounds for convolutional codes and asymptotically optimum decoding algorithm," IEEE Trans. Inform. Theory, vol. IT-13, pp. 260-269, Apr. 1967.
    • (1967) IEEE Trans. Inform. Theory , vol.IT-13 , pp. 260-269
    • Viterbi, A.J.1
  • 10
    • 0015346024 scopus 로고
    • Maximum likelihood sequence estimation of digital sequences in the presence of intersymbol interference
    • May
    • G. D. Forney Jr., "Maximum likelihood sequence estimation of digital sequences in the presence of intersymbol interference," IEEE Trans. Inform. Theory, vol. IT-18, pp. 363-378, May 1972.
    • (1972) IEEE Trans. Inform. Theory , vol.IT-18 , pp. 363-378
    • Forney G.D., Jr.1
  • 11
    • 0016037512 scopus 로고
    • Optimal decoding of linear codes for minimizing symbol error rate
    • Mar.
    • L. R. Bahl, J. Cocke, F. Jelinek, and J. Raviv, "Optimal decoding of linear codes for minimizing symbol error rate," IEEE Trans. Inform. Theory, vol. IT-20, pp. 284-287, Mar. 1974.
    • (1974) IEEE Trans. Inform. Theory , vol.IT-20 , pp. 284-287
    • Bahl, L.R.1    Cocke, J.2    Jelinek, F.3    Raviv, J.4
  • 12
    • 0029234412 scopus 로고    scopus 로고
    • A comparison of optimal and sub-optimal MAP decoding algorithms operating in the log domain
    • R. Robertson, E. Villebrun, and P. Hoeher, "A comparison of optimal and sub-optimal MAP decoding algorithms operating in the log domain," in Proc. IEEE Int. Conf. Communications, 1995, pp. 1009-1013.
    • Proc. IEEE Int. Conf. Communications, 1995 , pp. 1009-1013
    • Robertson, R.1    Villebrun, E.2    Hoeher, P.3
  • 14
    • 0030257652 scopus 로고    scopus 로고
    • Near optimum error correcting coding and decoding: Turbo codes
    • Oct.
    • C. Berrour and A. Glavieux, "Near optimum error correcting coding and decoding: Turbo codes," IEEE Trans. Commun., vol. 44, pp. 1261-1271, Oct. 1996.
    • (1996) IEEE Trans. Commun. , vol.44 , pp. 1261-1271
    • Berrour, C.1    Glavieux, A.2
  • 15
    • 0031651832 scopus 로고    scopus 로고
    • Implementation and performance of a turbo/MAP decoder
    • S. Pietrobon, "Implementation and performance of a turbo/MAP decoder," Int. J. Satellite Commun., vol. 16, pp. 23-46, 1998.
    • (1998) Int. J. Satellite Commun. , vol.16 , pp. 23-46
    • Pietrobon, S.1


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