An Even/Odd Error Detection Based Low-Complexity Chase Decoding for Low-Latency RS Decoder Design
- 26 January 2021
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Communications Letters
- Vol. 25 (5) , 1505-1509
Abstract
This letter presents a modified low-complexity chase (LCC) algorithm, where a fewer number of vectors can be tested with minor error correction performance degradation. The proposed LCC decoding pre-determines whether the number of errors in the received codeword is even or odd, and it processes only necessary test vectors. As a result, the number of test vectors can be reduced by half compared to the conventional LCC decoding. The Reed-Solomon (255,239) decoder with the proposed LCC algorithm has been implemented using 65nm CMOS process. The hardware implementation results show that the proposed decoder shows 48.5% reduced latency with 0.06dB of coding gain decrease at 10-6 codeword error rate compared to the state-of-the-art LCC decoder.Keywords
Funding Information
- National Research Foundation of Korea grant funded by the Korea government (NRF-2020R1A2C3014820)
- MSIT (Ministry of Science and ICT), Korea
- ITRC (IITP-2020-2018-0-01433)
- IITP
This publication has 9 references indexed in Scilit:
- A Test Vector Generation Method Based on Symbol Error Probabilities for Low-Complexity Chase Soft-Decision Reed–Solomon DecodingIEEE Transactions on Circuits and Systems I: Regular Papers, 2018
- Reduced-Complexity Multiplicity Assignment Algorithm and Architecture for Low-Complexity Chase Decoder of Reed-Solomon CodesIEEE Communications Letters, 2015
- New Scalable Decoder Architectures for Reed–Solomon CodesIEEE Transactions on Communications, 2015
- High-Speed RS(255, 239) Decoder Based on LCC DecodingCircuits, Systems, and Signal Processing, 2011
- Low-Complexity Soft-Decoding Algorithms for Reed–Solomon Codes—Part I: An Algebraic Soft-In Hard-Out Chase DecoderIEEE Transactions on Information Theory, 2010
- Algebraic Soft-Decision Decoding of Reed–Solomon Codes Using Bit-Level Soft InformationIEEE Transactions on Information Theory, 2008
- Applications of algebraic soft-decision decoding of Reed-Solomon codesIEEE Transactions on Communications, 2006
- Exponential Error Bounds for Algebraic Soft-Decision Decoding of Reed–Solomon CodesIEEE Transactions on Information Theory, 2005
- Algebraic soft-decision decoding of reed-solomon codesIEEE Transactions on Information Theory, 2003