Low-Complexity Parallel Chien Search Structure Using Two-Dimensional Optimization
Authors:
- 5 July 2011
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Circuits and Systems II: Express Briefs
- Vol. 58 (8) , 522-526
Abstract
To achieve a high-throughput decoder, massive-parallel computations are normally applied to the Chien search, but the parallel realization increases the hardware complexity significantly. To reduce the hardware complexity of the parallel Chien search, this brief proposes a 2-D optimization method. In contrast to the previous 1-D optimizations, the proposed method maximizes the sharing of common subexpressions in both the row and column directions. All the partial products needed in the parallel structure are represented in a single matrix, and the finite-field adders are completely eliminated in effect. Simulation results show that the proposed 2-D optimization leads to a significant reduction of the hardware complexity. For the (8191, 7684, 39) BCH code, the count of xor gates in the parallel Chien search is reduced by 92% and 22%, compared to the straightforward and strength-reduced structures, respectively.Keywords
This publication has 7 references indexed in Scilit:
- Strength-Reduced Parallel Chien Search Architecture for Strong BCH CodesIEEE Transactions on Circuits and Systems II: Express Briefs, 2008
- Low-Power High-Throughput BCH Error Correction VLSI Design for Multi-Level Cell NAND Flash Memories2006
- Small area parallel Chien search architectures for long BCH codesIEEE Transactions on Very Large Scale Integration (VLSI) Systems, 2004
- High-speed VLSI architecture for parallel Reed-Solomon decoderIEEE Transactions on Very Large Scale Integration (VLSI) Systems, 2003
- On-chip error correcting techniques for new-generation flash memoriesProceedings of the IEEE, 2003
- 10- and 40-Gb/s forward error correction devices for optical communicationsIEEE Journal of Solid-State Circuits, 2002
- Multiple constant multiplications: efficient and versatile framework and algorithms for exploring common subexpression eliminationIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1996