{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T02:57:41Z","timestamp":1760151461455,"version":"build-2065373602"},"reference-count":14,"publisher":"MDPI AG","issue":"3","license":[{"start":{"date-parts":[[2022,3,18]],"date-time":"2022-03-18T00:00:00Z","timestamp":1647561600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Entropy"],"abstract":"<jats:p>A novel time-varying channel adaptive low-complexity chase (LCC) algorithm with low redundancy is proposed, where only the necessary number of test vectors (TVs) are generated and key equations are calculated according to the channel evaluation to reduce the decoding complexity. The algorithm evaluates the error symbol numbers by counting the number of unreliable bits of the received code sequence and dynamically adjusts the decoding parameters, which can reduce a large number of redundant calculations in the decoding process. We provide a simplified multiplicity assignment (MA) scheme and its architecture. Moreover, a multi-functional block that can implement polynomial selection, Chien search and the Forney algorithm (PCF) is provided. On this basis, a high-efficiency LCC decoder with adaptive error-correcting capability is proposed. Compared with the state-of-the-art LCC (TV = 16) decoding, the number of TVs of our decoder was reduced by 50.4% without loss of the frame error rate (FER) performance. The hardware implementation results show that the proposed decoder achieved 81.6% reduced average latency and 150% increased throughput compared to the state-of-the-art LCC decoder.<\/jats:p>","DOI":"10.3390\/e24030424","type":"journal-article","created":{"date-parts":[[2022,3,20]],"date-time":"2022-03-20T21:26:22Z","timestamp":1647811582000},"page":"424","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Low-Complexity Chase Decoding of Reed\u2013Solomon Codes Using Channel Evaluation"],"prefix":"10.3390","volume":"24","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3175-887X","authenticated-orcid":false,"given":"Hao","family":"Wang","sequence":"first","affiliation":[{"name":"School of Microelectronics, Tianjin University, Tianjin 300072, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2601-3198","authenticated-orcid":false,"given":"Wei","family":"Zhang","sequence":"additional","affiliation":[{"name":"School of Microelectronics, Tianjin University, Tianjin 300072, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4403-9877","authenticated-orcid":false,"given":"Yanyan","family":"Chang","sequence":"additional","affiliation":[{"name":"School of Microelectronics, Tianjin University, Tianjin 300072, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1857-3299","authenticated-orcid":false,"given":"Jiajing","family":"Gao","sequence":"additional","affiliation":[{"name":"School of Microelectronics, Tianjin University, Tianjin 300072, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8488-5480","authenticated-orcid":false,"given":"Yanyan","family":"Liu","sequence":"additional","affiliation":[{"name":"College of Electronic Information and Optical Engineering, Nankai University, Tianjin 300071, China"}]}],"member":"1968","published-online":{"date-parts":[[2022,3,18]]},"reference":[{"doi-asserted-by":"crossref","unstructured":"Bellorado, J. (2006). Low-Complexity Soft Decoding Algorithms for Reed\u2013Solomon Codes. [Ph.D. Thesis, Harvard University].","key":"ref_1","DOI":"10.1109\/ISIT.2006.261907"},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"2809","DOI":"10.1109\/TIT.2003.819332","article-title":"Algebraic soft-decision decoding of Reed\u2013Solomon codes","volume":"49","author":"Koetter","year":"2003","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"3907","DOI":"10.1109\/TIT.2008.928238","article-title":"Algebraic soft-decision decoding of Reed\u2013Solomon codes using bit-level soft information","volume":"54","author":"Jiang","year":"2008","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"1643","DOI":"10.1007\/s00034-011-9327-4","article-title":"High-speed RS(255,239) decoder based on LCC decoding","volume":"30","author":"Valls","year":"2011","journal-title":"Circuits Syst. Signal Process."},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"641","DOI":"10.1109\/92.953498","article-title":"High-speed architectures for Reed\u2013Solomon decoders","volume":"9","author":"Sarwate","year":"2001","journal-title":"IEEE Trans. Very Large Scale Integr. (VLSI) Syst."},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"974","DOI":"10.1109\/TVLSI.2012.2197030","article-title":"Reduced-complexity LCC Reed\u2013Solomon decoder based on unified syndrome computation","volume":"21","author":"Zhang","year":"2013","journal-title":"IEEE Trans. Very Large Scale Integr. (VLSI) Syst."},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"1865","DOI":"10.1109\/LCOMM.2015.2477495","article-title":"Reduced-complexity multiplicity assignment algorithm and architecture for low-complexity chase decoder of Reed\u2013Solomon codes","volume":"19","author":"Peng","year":"2015","journal-title":"IEEE Commun. Lett."},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"3539","DOI":"10.1109\/TVLSI.2017.2746139","article-title":"An algorithm for improving the throughput of serial low-complexity chase soft-decision Reed\u2013Solomon decoder","volume":"25","author":"Luo","year":"2017","journal-title":"IEEE Trans. Very Large Scale Integr. (VLSI) Syst."},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"2198","DOI":"10.1109\/TCSI.2018.2882876","article-title":"A test vector generation method based on symbol error probabilities for low complexity chase soft-decision Reed\u2013Solomon decoding","volume":"66","author":"Valls","year":"2019","journal-title":"IEEE Trans. Circuits Syst. I Reg. Papers"},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"6012","DOI":"10.1109\/TCOMM.2020.3011991","article-title":"Low-Complexity Chase Decoding of Reed\u2013Solomon Codes Using Module","volume":"68","author":"Xing","year":"2020","journal-title":"IEEE Trans. Commun."},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"1505","DOI":"10.1109\/LCOMM.2021.3054753","article-title":"An Even\/Odd Error Detection Based Low-Complexity Chase Decoding for Low-Latency RS Decoder Design","volume":"25","author":"Jeong","year":"2021","journal-title":"IEEE Commun. Lett."},{"doi-asserted-by":"crossref","unstructured":"Zhu, J., and Zhang, X. (2010, January 14\u201315). Efficient Reed\u2013Solomon decoder with adaptive error-correcting capability. Proceedings of the 19th Annual Wireless and Optical Communications Conference (WOCC 2010), Shanghai, China.","key":"ref_12","DOI":"10.1109\/WOCC.2010.5510637"},{"doi-asserted-by":"crossref","unstructured":"An, X., Liang, Y., and Zhang, W. (2020). High-Efficient Reed\u2013Solomon Decoder Based on Deep Learning. IEEE Int. Symp. Circuits Syst. (ISCAS), 1\u20135.","key":"ref_13","DOI":"10.1109\/ISCAS45731.2020.9181187"},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"10","DOI":"10.1049\/iet-com.2014.0460","article-title":"Efficient architecture for algebraic soft-decision decoding of Reed\u2013Solomon codes","volume":"9","author":"Li","year":"2015","journal-title":"IET Commun."}],"container-title":["Entropy"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1099-4300\/24\/3\/424\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T22:39:17Z","timestamp":1760135957000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1099-4300\/24\/3\/424"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,3,18]]},"references-count":14,"journal-issue":{"issue":"3","published-online":{"date-parts":[[2022,3]]}},"alternative-id":["e24030424"],"URL":"https:\/\/doi.org\/10.3390\/e24030424","relation":{},"ISSN":["1099-4300"],"issn-type":[{"type":"electronic","value":"1099-4300"}],"subject":[],"published":{"date-parts":[[2022,3,18]]}}}