Blind identification of an unknown interleaved convolutional code

We give here an efficient algorithm for recovering the block interleaver and the convolutional code when several noisy interleaver codewords are given. This method applies to any interleaver, structured or not and computes in a first step low weight parity-check equations of the interleaved convolutional code. Then a graph representing how these parity-check equations intersect is used to recover at the same time the block interleaver and the convolutional code.