PRUNING METHODS FOR THE GENERATION OF S-RANDOM INTERLEAVERS, AND INTERLEAVER PERFORMING THE METHODS

摘要

The method allows to obtain, starting from an initial S-random interleaver permutation stored in memory devices and having a size N, i.e. formed of N elements, a final S-random permutation having a smaller size KN, i.e. formed of K elements, by successive pruning operations or steps which, starting from the initial permutation, yield the final permutation, through an iterative process which is performed by means of electronic processing devices, and in which in successive steps selected elements are eliminated from the initial permutation in accordance with predetermined criteria.;The final permutation is generated using a reference vector having a dimension or size equal to that of the initial permutation and comprising thus N elements. Said reference vector is generated by said processing devices in such a way that for each pruning step, if the element eliminated from the initial permutation has been eliminated on the basis of a predetermined criterion, one element of the reference vector is generated in such a way that the value thereof and the position thereof in the reference vector are indicative of the value of the element eliminated from the initial permutation.