메뉴 건너뛰기




Volumn 11, Issue 6, 2003, Pages 976-996

High-throughput LDPC decoders

Author keywords

Low density parity check (LDPC) codes; Ramanujan graphs; Soft input soft output (SISO) decoder; Turbo decoding algorithm; VLSI decoder architectures

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; DECODING; DESIGN FOR TESTABILITY; TURBO CODES;

EID: 0742286682     PISSN: 10638210     EISSN: None     Source Type: Journal    
DOI: 10.1109/TVLSI.2003.817545     Document Type: Article
Times cited : (492)

References (24)
  • 3
    • 0035246127 scopus 로고    scopus 로고
    • Design of capacity approaching irregular low-density parity-check codes
    • Feb.
    • T. Richardson, M. Shokrollahi, and R. Urbanke, "Design of capacity approaching irregular low-density parity-check codes," IEEE Trans. Inform. Theory, vol. 47, no. 2, pp. 619-637, Feb. 2001.
    • (2001) IEEE Trans. Inform. Theory , vol.47 , Issue.2 , pp. 619-637
    • Richardson, T.1    Shokrollahi, M.2    Urbanke, R.3
  • 4
    • 0035248618 scopus 로고    scopus 로고
    • On the design of low-density parity-check codes within 0.0045 dB of the Shannon limits
    • Feb.
    • S.-Y. Chung et al., "On the design of low-density parity-check codes within 0.0045 dB of the Shannon limits," IEEE Commun. Lett., vol. 5, no. 2, pp. 58-60, Feb. 2001.
    • (2001) IEEE Commun. Lett. , vol.5 , Issue.2 , pp. 58-60
    • Chung, S.-Y.1
  • 6
    • 17944400187 scopus 로고    scopus 로고
    • Efficient implementations of the sum-product algorithm for decoding LDPC codes
    • San Antonio, TX
    • X. Y. Hu et al., "Efficient implementations of the sum-product algorithm for decoding LDPC codes," in Proc. IEEE GLOBECOM, vol. 2, San Antonio, TX, 2001, pp. 1036-1036E.
    • (2001) Proc. IEEE GLOBECOM , vol.2 , pp. 1036-1036E
    • Hu, X.Y.1
  • 8
    • 0035294983 scopus 로고    scopus 로고
    • VLSI architectures for iterative decoders in magnetic recording channels
    • Mar.
    • E. Yeo et al., "VLSI architectures for iterative decoders in magnetic recording channels," IEEE Trans. Magn., vol. 37, no. 2, pp. 748-755, Mar. 2001.
    • (2001) IEEE Trans. Magn. , vol.37 , Issue.2 , pp. 748-755
    • Yeo, E.1
  • 9
    • 0035685606 scopus 로고    scopus 로고
    • High throughput low-density parity-check decoder architectures
    • E. Yeo et al., "High throughput low-density parity-check decoder architectures," in Proc. IEEE GLOBECOM, San Antonio, TX, Nov. 2001, pp. 3019-3024.
    • Proc. IEEE GLOBECOM, San Antonio, TX, Nov. 2001 , pp. 3019-3024
    • Yeo, E.1
  • 17
    • 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
  • 18
    • 0035138658 scopus 로고    scopus 로고
    • Reduced-complexity decoding for low-density parity-check codes
    • Jan.
    • E. Eleftheriou, T. Mittelholzer, and A. Dholakia, "Reduced-complexity decoding for low-density parity-check codes," Electron. Lett., vol. 37, pp. 102-104, Jan. 2001.
    • (2001) Electron. Lett. , vol.37 , pp. 102-104
    • Eleftheriou, E.1    Mittelholzer, T.2    Dholakia, A.3
  • 19
    • 84890383723 scopus 로고    scopus 로고
    • Iterative decoding of generalized low-density parity-check codes
    • M. Lentmaier and K. S. Zigangirov, "Iterative decoding of generalized low-density parity-check codes," in Proc. ISIT 1998, Aug. 1998, p. 149.
    • Proc. ISIT 1998, Aug. 1998 , pp. 149
    • Lentmaier, M.1    Zigangirov, K.S.2
  • 23
    • 0029234412 scopus 로고    scopus 로고
    • A comparison of optimal and sub-optimal MAP decoding algorithms operatiting in the log domain
    • P. Robertson, E. Villebrun, and P. Hoeher, "A comparison of optimal and sub-optimal MAP decoding algorithms operatiting in the log domain," in Proc. IEEE Int. Conf. Communications, 1995, pp. 1009-1013.
    • Proc. IEEE Int. Conf. Communications, 1995 , pp. 1009-1013
    • Robertson, P.1    Villebrun, E.2    Hoeher, P.3


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