Abstract
We aim to bridge the gap between classical coding theory and soft decoding. Reed-Solomon (RS) codes are chosen as an example, and a few standard possibilities for a soft RS decoder are explored. Soon, it is noticed that the resulting (standard) algorithms are too complex and/or not very performant. However, by employing a special critically sampled filter bank representation for the RS codes, an algorithm is developed that shows a good tradeoff between computational complexity and soft decoding performance. Furthermore, it is demonstrated that this algorithm shows remarkable similarities with turbo codes, thereby preserving the perfectness of the original RS code.
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.
