Decoding M-binary turbo codes by the dual method

A joint effort by several researchers has led to the derivation of a maximum a posteriori decoding algorithm for classical binary turbo codes by the dual method. This algorithm leads to reduced complexity with regard to the classical MAP algorithm for high-rate binary turbo codes. We extend the result to duo-binary turbo codes and, more generally, to any M-binary turbo codes.