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.
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: