A new pseudo-random interleaving for antijamming applications
M.M. Darmon, Philippe Sadot · 2003
The authors define a pseudorandom interleaver whose minimal distance is nearly the same as that of a periodic interleaver of the same size. The distance between two symbols of the same code word is not constant, and symbols are selected pseudorandomly inside the interleaving register. This makes it proof against attacks by intelligent jammers. The interleaver uses a matrix read and written at the same address, which is given by a 'driving sequence' that is calculated by means of a cryptographic-quality pseudorandom generator and a set of rules that provides the good minimal distance property. Simulations of this interleaver associated with a block code have been done.>