A inversion-less peterson algorithm based shared KES architecture for concatenated BCH decoder
Authors:
- 1 November 2015
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 281-282
Abstract
This paper presents a shared Key Equation Solver (KES) architecture based on inversion-less Peterson algorithm for Concatenated Bose-Chaudhuri-Hocquenghem (CBCH) decoder. In the conventional CBCH decoding approaches, the KES module has been implemented based on advanced Simplified inversion-less Berlekamp-Massey (SiBM) to reduce circuit area. However, the long latency of the advanced SiBM has been a main bottleneck for implementing high-speed KES. In the proposed approach, inversion-less Peterson algorithm with resource sharing approach has been applied to the KES of CBCH to reduce the area and latency. The experimental results show that, in case of CBCH (8720, 8192, 24) codes, the total area of KES modules is reduced by 30% compared to the KES module of the conventional CBCH design with 3X faster decoding speed.Keywords
This publication has 7 references indexed in Scilit:
- A 2.74-pJ/bit, 17.7-Gb/s Iterative Concatenated-BCH Decoder in 65-nm CMOS for NAND Flash MemoryIEEE Journal of Solid-State Circuits, 2013
- Concatenated BCH codes for NAND flash memories2012
- A High-Speed Pipelined Degree-Computationless Modified Euclidean Algorithm Architecture for Reed-Solomon DecodersIEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, 2008
- Fast factorization architecture in soft-decision Reed-Solomon decodingIEEE Transactions on Very Large Scale Integration (VLSI) Systems, 2005
- High-speed architectures for Reed-Solomon decodersIEEE Transactions on Very Large Scale Integration (VLSI) Systems, 2001
- Step-by-step decoding of the Bose-Chaudhuri- Hocquenghem codesIEEE Transactions on Information Theory, 1965
- Encoding and error-correction procedures for the Bose-Chaudhuri codesIEEE Transactions on Information Theory, 1960