A method for obtaining the optimum sectionalization of the RMLD algorithm for non-linear rectangular codes

摘要

A recursive maximum likelihood decoding (RMLD)algorithm is more efficient than the Viterbi algorithm. The decoding complexity of the RMLD algorithm depends on the Recursive sectionalization. The recursive sectionalization which Minimizes the decoding complexity is called the optimum sec- Tionalization. In this paper, for a class of non-linear codes, Called rectangular codes, it is shown that a near optimum sec- Tionalization can be obtained with a dynamic programming ap- Proach.