Exploiting symbolic dynamics in chaos coded communications with maximum a posteriori algorithm

摘要

A known maximum a posteriori (MAP) algorithm is adapted to decode chaotic signals sent over a noisy channel and get a low complexity MAP decoder that could be easily implemented. It is shown that this algorithm is useful for all chaotic encoding frameworks where symbolic dynamics could be applied and that the final bit error rate is better than that obtained with other usually employed maximum likelihood (ML) algorithms of similar complexity.