The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
A new approach for determining delayed versions of m-sequences is presented. The stages of a feedback shift register which contribute to the generation of a given shift, can be specified by computing explicit expressions. Efficient algorithms can be constructed suitable for long sequences.
A combinational logicfree F.S.R. construction is specified which allows the high speed generation of m-sequences. These constructions are based on characteristic polynomials of the form (1 ? x)q ? xp and they can be designed so as to produce sequences based on primitive trinomial recurrences of the form xn = xn?q ? xn?p at a rate q times as fast as the basic shift pulse rate.
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.