Abstract
A progressive algebraic soft decoding algorithm is proposed for Reed-Solomon (RS) codes, aiming to reduce the computational complexity. The decoding starts with a small initial factorization output list size (OLS), then updates the OLS progressively leading to an incremental interpolation. Decoding will terminate either when the output contains a codeword that can be identified as the most likely one or the predefined maximal OLS is reached. The algorithm can adjust the decoding parameter according to the quality of the received information, optimizing its complexity to the minimal but necessary level.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
