http://iet.metastore.ingenta.com
1887

Transition-matrix construction for pseudorandom binary-sequence generators

Transition-matrix construction for pseudorandom binary-sequence generators

For access to this article, please select a purchase option:

Buy article PDF
$19.95
(plus tax if applicable)
Buy Knowledge Pack
10 articles for $120.00
(plus taxes if applicable)

IET members benefit from discounts to all IET publications and free access to E&T Magazine. If you are an IET member, log in to your account and the discounts will automatically be applied.

Learn more about IET membership 

Recommend Title Publication to library

You must fill out fields marked with: *

Librarian details
Name:*
Email:*
Your details
Name:*
Email:*
Department:*
Why are you recommending this title?
Select reason:
 
 
 
 
 
Electronics Letters — Recommend this title to your library

Thank you

Your recommendation has been sent to your librarian.

A method is described for rapidly finding the elements of a matrix operator which shifts the state of a class of linear sequence generators through a specified time interval. The method is applied to the problem of generating pseudorandom binary sequences with specified time shifts.

References

    1. 1)
      • B. Ireland , J.E. Marshall . Matrix method to determine shift-register connections for delayed pseudorandom binary sequences. Electronics Letters , 309 - 310
    2. 2)
      • N. Zierler . Linear recurring sequences. J. Soc. Indust. Appl. Math. , 31 - 48
    3. 3)
      • Huffman, D.A.: `The synthesis of linear sequential coding networks', Proceeding of the Third Symposium on Information Theory, September 1955, p. 77–95.
    4. 4)
      • B. Elspas . The theory of autonomous linear sequential networks. IEEE Trans. , 45 - 60
http://iet.metastore.ingenta.com/content/journals/10.1049/el_19680328
Loading

Related content

content/journals/10.1049/el_19680328
pub_keyword,iet_inspecKeyword,pub_concept
6
6
Loading
This is a required field
Please enter a valid email address