DocumentCode :
906143
Title :
Linear binary shift register circuits utilizing a minimum number of mod-2 adders
Author :
Roth, Herbert H.
Volume :
11
Issue :
2
fYear :
1965
fDate :
4/1/1965 12:00:00 AM
Firstpage :
215
Lastpage :
220
Abstract :
A family of linear binary shift register circuits is described in terms of generator polynomials 
which require fewer mod- 
adders than those derived from the companion matrices. These circuits are derived from various combinations of the functions 
, and 
in 
and 
, and 
of the reciprocal polynomial 
. Tables are provided for all simplifications thus achievable for primitive polynomial of degrees 
through 
, and for some nonprimitive polynomials.
which require fewer mod- adders than those derived from the companion matrices. These circuits are derived from various combinations of the functions , and in and , and of the reciprocal polynomial . Tables are provided for all simplifications thus achievable for primitive polynomial of degrees through , and for some nonprimitive polynomials.Keywords :
Coding; Shift registers; Adders; Delay; Feedback circuits; Feedback loop; Flip-flops; Gyroscopes; Integrated circuit interconnections; Neck; Polynomials; Shift registers;
fLanguage :
English
Journal_Title :
Information Theory, IEEE Transactions on
Publisher :
ieee
ISSN :
0018-9448
Type :
jour
DOI :
10.1109/TIT.1965.1053747
Filename :
1053747
Link To Document :
