Generation of very long pseudorandom sequences

A method is suggested for extending the length of a pseudo-random sequence by achieving all n! permutations of the n shift-register bits through a succession of transpositions with the most significant bit. The hardware required is n single-pole n-throw switches plus the associated control. The control for the switches requires a memory of log2(n!) bits, sufficient for counting up to n!. The length of the achievable nonperiodic sequence can be further increased by running through the n! permutations in all possible different orders. This last operation greatly increases the sequence length, with a corresponding logarithmic increase in the memory required.