Abstract
AbstractAn adaptive decoding scheme is introduced that achieves efficient soft—decision decoding for row—and—column parity array codes. The special structure of array codes is exploited to make effective use of hard—decision methods to realize soft—decision decoding. This leads to considerable reduction in decoding complexity as the amount of soft—decision computation varies with channel conditions. It is shown that the new decoding algorithm guarantees bounded distance performance. Simulation results indicate that the actual improvement of decoding performance over uncoded systems and previous decoding methods is significant.
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.
