Fast algorithm for Blind Deinterleaving of a Block Interleaver using binary and non-binary Block codes in a telecommunication system

Interleavers were made a part of the digital communication to tackle the presence of burst errors due to a noisy channel or incorrect viterbi decoding by performing a rearrangement of the bits by using an interleaving array of size $N_{r} \times N_{c}$ where $N_{r}$ is the number of rows, also called interleaver depth and $N_{c}$ is the number of columns of the array. A typical audio and video broadcasting system consisting of a Linear Block code (LBC) and a block interleaver is presented and a method to deinterleave the received sequence without any knowledge of the blocks used on the transmitter side i.e. in a blind setting is discussed. There is hardly any existing literature that solves this problem completely. The proposed algorithm calculates $N_{r}$ and codeword length by using rank deficiency while $N_{c}$ is calculated by using cyclic convolution to complete the analysis that is conducted on different LBCs with varying frame structure formats.