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 × 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.