메뉴 건너뛰기




Volumn 5, Issue , 2004, Pages

Area efficient parallel decoder architecture for long BCH codes

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BIT ERROR RATE; COMPUTATIONAL COMPLEXITY; FAST FOURIER TRANSFORMS; OPTICAL COMMUNICATION; PROBLEM SOLVING; SEARCH ENGINES;

EID: 4544229949     PISSN: 15206149     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (28)

References (6)
  • 1
    • 0011792612 scopus 로고    scopus 로고
    • Telecommunication standardization section, International Telecommunication Union, G.975
    • "Forward error correction for submarine systems," Telecommunication standardization section, International Telecommunication Union, G.975, 1996.
    • (1996) Forward Error Correction for Submarine Systems
  • 2
    • 0036859295 scopus 로고    scopus 로고
    • 10- And 40-Gb/s forward error correction devices for optical communications
    • Nov.
    • L. Song, M.-L. Yu, and M. S. Shaffer, "10- and 40-Gb/s forward error correction devices for optical communications," IEEE J. Solid-State Circuits, vol. 37, pp. 1565-1573, Nov. 2002.
    • (2002) IEEE J. Solid-state Circuits , vol.37 , pp. 1565-1573
    • Song, L.1    Yu, M.-L.2    Shaffer, M.S.3
  • 4
    • 0035247672 scopus 로고    scopus 로고
    • A Reed-Solomon product-code (RS-PC) decoder chip for DVD applications
    • Feb.
    • H. C. Chang, C. B. Shung, and C. Y. Lee, "A Reed-Solomon Product-Code (RS-PC) decoder chip for DVD applications," IEEE J. Solid State Circuits, vol. 36, pp. 229-238, Feb. 2001.
    • (2001) IEEE J. Solid State Circuits , vol.36 , pp. 229-238
    • Chang, H.C.1    Shung, C.B.2    Lee, C.Y.3
  • 5
    • 0030717379 scopus 로고    scopus 로고
    • Optimized arithmetic for Reed-Solomon encoders
    • C. Paar, "Optimized arithmetic for Reed-Solomon encoders," IEEE Proc. of ISIT'97, pp. 250, 1997.
    • (1997) IEEE Proc. of ISIT'97 , pp. 250
    • Paar, C.1
  • 6
    • 0030086034 scopus 로고    scopus 로고
    • Multiple constant multiplications: Efficient and versatile framework and algorithms for exploring common subexpression elimination
    • Feb.
    • M. Potkonjak, M. B. Srivastava, and A. P. Chandrakasan, "Multiple constant multiplications: efficient and versatile framework and algorithms for exploring common subexpression elimination," IEEE Trans. on Computer-Aided Design, vol. 15, no. 2, pp. 151-165, Feb. 1996.
    • (1996) IEEE Trans. on Computer-aided Design , vol.15 , Issue.2 , pp. 151-165
    • Potkonjak, M.1    Srivastava, M.B.2    Chandrakasan, A.P.3


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