SHERP

Strength-Reduced Parallel Chien Search Architecture for Strong BCH Codes

Cited 0 time in webofscience Cited 29 time in scopus
Authors
Cho, Junho; Sung, Wonyong
Issue Date
2008-05
Publisher
Institute of Electrical and Electronics Engineers (IEEE)
Citation
IEEE Trans. Circuits and Systems.II: Express Briefs, vol. 55, no. 5, pp. 427-431, May. 2008
Keywords
Bose–Chaudhuri–Hochquenghem (BCH) codesChien searchlow complexityparallel processing
Abstract
The Chien search process is the most complex block in the decoding of Bose-Chaudhuri-Hochquenghem (BCH) codes. Since the BCH codes conduct the bit-by-bit error correction, they often need a parallel implementation for high throughput applications. The parallel implementation obviously needs much increased hardware. In this paper, we propose a strength reduced architecture for the parallel Chien search process. The proposed method transforms the expensive modulo-f(x) multiplications into shift operations, by which not only the hardware for multiplications but also that for additions are much reduced. One example shows that the hardware complexity is reduced by 90% in the implementation of binary BCH (8191, 7684, 39) code with the parallel factor of 64. Consequently, it is possible to achieve a speedup of 64 with only 13 times of the hardware complexity when compared with the serial processing.
ISSN
1549-7747
Language
English
URI
http://hdl.handle.net/10371/6160
DOI
https://doi.org/10.1109/TCSII.2007.914898
Files in This Item:
There are no files associated with this item.
Appears in Collections:
College of Engineering/Engineering Practice School (공과대학/대학원)Dept. of Electrical and Computer Engineering (전기·정보공학부)Journal Papers (저널논문_전기·정보공학부)
  • mendeley

Items in S-Space are protected by copyright, with all rights reserved, unless otherwise indicated.

Browse