메뉴 건너뛰기




Volumn 2003-January, Issue , 2003, Pages 29-34

A novel design methodology for high-performance programmable decoder cores for AA-LDPC codes

Author keywords

Algorithm design and analysis; Decoding; Degradation; Design methodology; Design optimization; Libraries; Memory architecture; Parity check codes; Routing; Scalability

Indexed keywords

ALGORITHMS; COMPLEX NETWORKS; DECODING; DEGRADATION; DESIGN; ERROR CORRECTION; FORWARD ERROR CORRECTION; INTEGRATED CIRCUIT INTERCONNECTS; LIBRARIES; MEMORY ARCHITECTURE; NETWORK ARCHITECTURE; SATELLITE COMMUNICATION SYSTEMS; SCALABILITY; SIGNAL PROCESSING;

EID: 84943246554     PISSN: 15206130     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/SIPS.2003.1235639     Document Type: Conference Paper
Times cited : (15)

References (14)
  • 7
    • 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. on Magnetics, vol. 37, no. 2, pp. 748-755, Mar. 2001.
    • (2001) IEEE Trans. on Magnetics , vol.37 , Issue.2 , pp. 748-755
    • Yeo, E.1
  • 10
    • 0038073148 scopus 로고    scopus 로고
    • High-throughput memory efficient decoder architectures for LDPC codes
    • submitted to
    • M. M. Mansour and N. R. Shanbhag, "High-throughput memory efficient decoder architectures for LDPC codes," submitted to IEEE Transactions on VLSI Systems, 2002.
    • (2002) IEEE Transactions on VLSI Systems
    • Mansour, M.M.1    Shanbhag, N.R.2
  • 11
    • 0012799976 scopus 로고    scopus 로고
    • Construction of LDPC codes from Ramanujan graphs
    • Princeton University, Mar.
    • M. M. Mansour and N. R. Shanbhag, "Construction of LDPC codes from Ramanujan graphs," in Conf. on Info. Sciences and Systems. Princeton University, Mar. 2002.
    • (2002) Conf. on Info. Sciences and Systems
    • Mansour, M.M.1    Shanbhag, N.R.2
  • 12
    • 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. on I.T., pp. 284-287, Mar. 1974.
    • (1974) IEEE Trans. on I.T. , pp. 284-287
    • Bahl, L.R.1    Cocke, J.2    Jelinek, F.3    Raviv, J.4
  • 13
    • 17944400187 scopus 로고    scopus 로고
    • Efficient implementations of the sum-product algorithm for decoding LDPC codes
    • X. Y. Hu et al., "Efficient implementations of the sum-product algorithm for decoding LDPC codes," in GLOBECOM 2001, 2001, vol. 2, pp. 1036-1036E.
    • (2001) GLOBECOM 2001 , vol.2 , pp. 1036-1036E
    • Hu, X.Y.1


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