Abstract
Abstract:
In this paper, we present a fast re-synchronization algorithm for permutation coded sequences. The new algorithm combines the dynamic algorithm and a Viterbi-like decoding algorithm for trellis codes.
The new algorithm has a polynomial time complexity O(N), where N denotes the length of the sequence. A possible application to M-ary FSK for the CENELEC A band power-line communications (PLC) is considered.