1978
DOI: 10.1109/t-su.1978.30982
|View full text |Cite
|
Sign up to set email alerts
|

Surface wave recirculation loops for signal processing

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
40
0
1

Year Published

1982
1982
2015
2015

Publication Types

Select...
3
2
1

Relationship

0
6

Authors

Journals

citations
Cited by 7 publications
(41 citation statements)
references
References 17 publications
0
40
0
1
Order By: Relevance
“…These binary operations are defined by 0 ⊕ 0 = 0, 0 ⊕ 1 = 1, 1 ⊕ 0 = 1, 1 ⊕ 1 = 0 0 · 0 = 0, 0 · 1 = 0, 1 · 0 = 0, 1 · 1 = 1 (2)(3)(4)(5)(6)(7)(8)(9)(10)(11) where ⊕ denotes modulo-2 addition. From these equations, it is easy to verify that the field is closed under both modulo-2 addition and modulo-2 multiplication and that both operations are associative and commutative.…”
Section: Shift-register Sequencesmentioning
confidence: 99%
See 4 more Smart Citations
“…These binary operations are defined by 0 ⊕ 0 = 0, 0 ⊕ 1 = 1, 1 ⊕ 0 = 1, 1 ⊕ 1 = 0 0 · 0 = 0, 0 · 1 = 0, 1 · 0 = 0, 1 · 1 = 1 (2)(3)(4)(5)(6)(7)(8)(9)(10)(11) where ⊕ denotes modulo-2 addition. From these equations, it is easy to verify that the field is closed under both modulo-2 addition and modulo-2 multiplication and that both operations are associative and commutative.…”
Section: Shift-register Sequencesmentioning
confidence: 99%
“…Since −1 is defined as that element which when added to 1 yields 0, we have −1 = 1, and subtraction is the same as addition. From (2)(3)(4)(5)(6)(7)(8)(9)(10)(11), it follows that the additive identity element is 0, the multiplicative identity is 1, and the multiplicative inverse of 1 is 1 −1 = 1. The substitutions of all possible symbol combinations verify the distributive laws:…”
Section: Shift-register Sequencesmentioning
confidence: 99%
See 3 more Smart Citations