Abstract
This paper is concerned with the design of specified sequence linear feedback shift registers. Given a linear shift register sequence of maximum length or otherwise, three methods are described to determine the logical structure of the corresponding feedback shift register. Of these, Method 1 is based on the linear recurrence concept and involves solving a set of simultaneous equations over the linear field OF(2.)Method 2 makes use of the concept of generating function associated with a shift register sequence and gives the results by polynomial division. Based upon the deterministic sense of the sequence generation, Method 3 involves the formation of the Boolean-version of the feedback logic function and its subsequent conversion to a linear polynomial as a modulo-2 sum of the stored digits in the register. Some examples are given to clear the course of the analysis.
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.
