Abstract
Interleaving is commonly used to guard against burst errors since it provides a form of time diversity in the coded sequence. A novel algorithm for identifying the helical interleaving of the first type is presented based on the linear property of channel coding and the structure characteristic of the helical interleaver. We make use of the basis of parity-check vectors to locate codewords within the interleaved block to estimate the parameters at the output of a binary symmetric channel. Experimental results are run to validate the algorithm.