Estimation of Interleaving Period for Reed-Muller Coded Signals

Abstract

In digital communication systems, an interleaver rearranges the bits in a channel encoded data to overcome burst errors. Since the interleaved data is encrypted for any receiver ignorant of the parameters of the interleaver, non-cooperative contexts must estimate the interleaver parameters from an unknown interleaved data. In this paper, we propose a method of estimating an interleaving period, based on the linear characteristics of Reed-Muller code. First, we calculate the ratio of ‘1’ bits in the matrix which is generated by a Gaussian elimination process. Then, we check the minimum value of the ratio and count the number of rows that have a smaller ratio than a certain threshold. To validate the proposed method, we show the correct detection probabilities for an interleaving period in a noisy channel through computer simulations.