Abstract
Periodic sequences are usually generated by shift registers with feedback using mod 2 arithmetic. In this paper we analyze periodic sequence generators using ordinary arithmetic. It is shown that the simplest periodic sequence generators using ordinary arithmetic are linear. An exact expression is given for the smallest number of stages required to generate periodic sequences of a given period. A table of maximum period attainable using a given number of stages is also included. A canonical form for optimal periodic sequence generators is described. It is shown that an implementation using analog storage and arithmetic elements (like CCD shift registers and operational amplifier) it is possible to obtain multilevel periodic sequences with the optimal sequence generators.
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.
