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

Delayed versions of linear sequences

Delayed versions of linear sequences

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 program has been written which calculates the linear combination required to produce delayed versions of a maximal-length linear binary sequence. It can also be used if the modulus is greater than 2, and the sequence need not be of maximal length, provided that it is linear.

Inspec keywords: logic design

Subjects: Logic design methods

References

    1. 1)
      • A.C. Davies . Delayed versions of maximal-length linear binary sequences. Electron. Lett. , 61 - 62
    2. 2)
      • A.C. Davies . Further notes on delayed versions of linear binary sequences. Electron. Lett. , 190 - 191
http://iet.metastore.ingenta.com/content/journals/10.1049/el_19690161
Loading

Related content

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