Area efficient parallel decoder architecture for long BCH codes

Yanni Chen, Keshab K. Parhi

Research output: Contribution to journalConference articlepeer-review

22 Scopus citations

Abstract

Long BCH codes achieve additional coding gain of around 0.6dB compared to Reed-Solomon codes with similar code rate used for long-haul optical communication systems. For our considered parallel decoder architecture, a novel group matching scheme is proposed to reduce the overall hardware complexity of both Chien search and syndrome generator units by 46% for BCH(2047, 1926, 23) code as opposed to only 22% if directly applying the iterative matching algorithm. The proposed scheme exploits the substructure sharing within a finite field multiplier (FFM) and among groups of FFMs.

Original languageEnglish (US)
Pages (from-to)V-73-V-76
JournalICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings
Volume5
StatePublished - Sep 27 2004
EventProceedings - IEEE International Conference on Acoustics, Speech, and Signal Processing - Montreal, Que, Canada
Duration: May 17 2004May 21 2004

Fingerprint Dive into the research topics of 'Area efficient parallel decoder architecture for long BCH codes'. Together they form a unique fingerprint.

Cite this