An analysis of the structure and complexity of nonlinear binary sequence generators
β Scribed by Key, E.
- Book ID
- 114634539
- Publisher
- IEEE
- Year
- 1976
- Tongue
- English
- Weight
- 748 KB
- Volume
- 22
- Category
- Article
- ISSN
- 0018-9448
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
A simple method of computing the number of 1's in the binary sequences obtained from combination generators has been developed. The procedure, which is based exclusively on the particular form of the combining function, can be applied to standard generators proposed and published in the open literat
that it can be applied to any level of logic and one can get the minimal generator of all possible non-linear feedforward sequences. cY,(Y ,...,cY 2'm' be distinct roots of f in GF(2'), where o! is a root of f in GF(2'). Key has stated that the output sequences {a(n)}, n = 0, 1,2,. . . , of a line