Blind interleaver parameters estimation using Kolmogorov–Smirnov test

Abstract

The use of error-correcting codes (ECCs) is essential for designing reliable digital communication systems. Usually, most systems correct errors under cooperative environments. If receivers do not know interleaver parameters, they must first find out them to decode. In this paper, a blind interleaver parameters estimation method is proposed using the Kolmogorov–Smirnov (K–S) test. We exploit the fact that rank distributions of square matrices of linear codes differ from those of random sequences owing to the linear dependence of linear codes. We use the K–S test to make decision whether two groups are extracted from the same distribution. The K–S test value is used as a measure to find the most different rank distribution for the blind interleaver parameters estimation. In addition to control false alarm rates, multinomial distribution is used to calculate the probability that the most different rank distribution will occur. By exploiting those, we can estimate the interleaver period with relatively low complexity. Experimental results show that the proposed algorithm outperforms previous methods regardless of the bit error rate.