Your browser does not support JavaScript!
http://iet.metastore.ingenta.com
1887

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

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

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

Buy article PDF
£12.50
(plus tax if applicable)
Add to cart
Buy Knowledge Pack
10 articles for £75.00
(plus taxes if applicable)
Add to cart

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.

© The Institution of Electrical Engineers
Published
Errata or comment

A practical method is described to determine the modulo-2 feedback shift-register connections for producing advanced (or delayed) versions of a pseudorandom binary sequence.

Inspec keywords: switching and automata theory

Subjects: Computer theory

References

    1. 1)
      • B. Elspas . The theory of autonomous linear sequential networks. IEEE Trans. , 45 - 60
    2. 2)
      • A.B. Gardiner . Logic p.r.b.s. delay calculator and delayed-version generator with automatic delay-changing facility. Electronics Letters , 123 - 124
    3. 3)
      • A.C. Davies . Further notes on delayed versions of linear binary sequences. Electronics Letters
    4. 4)
      • W.D.T. Davies . Generation and properties of maximum length sequences. Control , 432 - 433
    5. 5)
      • A.C. Davies . Delayed versions of maximal-length linear binary sequences. Electronics Letters , 61 - 62
    6. 6)
      • A.C. Aitken . , Determinants and matrices.
    7. 7)
      • Huffmann, D.A.: `The synthesis of linear sequential coding networks', third London symposium on information theory 1955, 1956, Butterworth.
http://iet.metastore.ingenta.com/content/journals/10.1049/el_19680239
Loading

Related content

content/journals/10.1049/el_19680239
pub_keyword,iet_inspecKeyword,pub_concept
6
6
Loading
Correspondence
This article has following corresponding article(s):
Matrix method to determine shift-register connections for delayed pseudorandom binary sequences
Print this page
This is a required field
Please enter a valid email address