By Topic

Matrix method to determine shift-register connections for delayed pseudorandom binary sequences

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $33
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
B. Ireland ; Bath University of Technology, School of Mathematics, Bath, UK ; J. E. Marshall

In a previous letter, a matrix ¿0 was introduced, and an algorithm was derived for its inversion. The inverse matrix is shown in this letter to be simply related to the characteristic polynomial of the shift-register circuit. Those shift-register configurations which are most amenable to the matrix method for generating delayed sequences are discussed.

Published in:

Electronics Letters  (Volume:4 ,  Issue: 21 )