Abstract
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 log <inf xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">2</inf> (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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
