Abstract
AbstractThis paper describes suboptimal decoding methods for multilevel block‐encoded modulation schemes. These decoding methods can achieve large coding gains with relatively low decoding complexity, and operate, in part, by decoding a supercode of the code to be decoded. By decomposing the multilevel codes in various ways, a wide range of performance/complexity tradeoff points can be obtained. Introducing syndrome checking can further reduce the average decoding complexity with no degradation in performance. Both analysis and extensive simulation results confirm that a given coding gain can be achieved with significantly smaller decoding complexity than Viterbi decoding.
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.
