论文信息 - Small area parallel Chien search architectures for long BCH codes

Small area parallel Chien search architectures for long BCH codes

To implement parallel BCH (Bose-Chaudhuri-Hochquenghem) decoders in an area-efficient manner, this paper presents a novel group matching scheme to reduce the Chien search hardware complexity by 60% for BCH(2047, 1926, 23) code as opposed to only 26% 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.

Keshab K. Parhi | Yanni Chen

[1] Christof Paar,et al. Optimized arithmetic for Reed-Solomon encoders , 1997, Proceedings of IEEE International Symposium on Information Theory.

[2] S. Wicker. Error Control Systems for Digital Communication and Storage , 1994 .

[3] Miodrag Potkonjak,et al. Multiple constant multiplications: efficient and versatile framework and algorithms for exploring common subexpression elimination , 1996, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[4] Kiyoo Itoh,et al. Sub 1V Swing Internal Bus Architecture for Future Low-Power ULSI's (Special Section on the 1992 VLSI Circuits Symposium) , 1993 .

[5] Hsie-Chia Chang,et al. A low-power Reed-Solomon decoder for STM-16 optical communications , 2002, Proceedings. IEEE Asia-Pacific Conference on ASIC,.

[6] Leilei Song,et al. 10- and 40-Gb/s forward error correction devices for optical communications , 2002 .

[7] Satoshi Tanaka,et al. Half-Swing Clocking Scheme for 75% Power Saving in Clocking Circuitry , 1994, Proceedings of 1994 IEEE Symposium on VLSI Circuits.