Answers are grounded in this paper and cite their sources.
This 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.
No takes yet. Share an insight, caveat, or question.
Lee et al. (1994) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: