1954
DOI: 10.1109/irepgelc.1954.6499441
|View full text |Cite
|
Sign up to set email alerts
|

Application of Boolean algebra to switching circuit design and to error detection

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1

Citation Types

3
266
0
13

Year Published

1985
1985
2020
2020

Publication Types

Select...
4
3
3

Relationship

0
10

Authors

Journals

citations
Cited by 455 publications
(284 citation statements)
references
References 0 publications
3
266
0
13
Order By: Relevance
“…However, even with binary or AMI coding, baudrate sampling is not ruled out completely, since computer simulations showed that in band-limited systems operating o n lines with gauge 26 bridged taps, the pulse distortion is negligible, and thus, baud rate timing recovery may-be appropriate. 2 The final conclusion on baud rate timing recovery requires a statistical study of the telephone lines deployed in the field, to determine the percentage on which the system can be expected to work properly.…”
Section: W (T -;)= W ( T +; )mentioning
confidence: 99%
“…However, even with binary or AMI coding, baudrate sampling is not ruled out completely, since computer simulations showed that in band-limited systems operating o n lines with gauge 26 bridged taps, the pulse distortion is negligible, and thus, baud rate timing recovery may-be appropriate. 2 The final conclusion on baud rate timing recovery requires a statistical study of the telephone lines deployed in the field, to determine the percentage on which the system can be expected to work properly.…”
Section: W (T -;)= W ( T +; )mentioning
confidence: 99%
“…The rth generalized Hamming weight (GHW) or rth minimum support weight of a linear code C is defined by The RM codes were defined in [32,28] for the binary case and this was generalized to arbitrary q in [7,18,43]. Generalized Hamming weights were introduced in the study [15,24] on the weight distribution of codes over extensions of F q .…”
Section: Introductionmentioning
confidence: 99%
“…The Reed-Muller expansion [1,2], which expands logical functions into combinations of and and xor logic, enables us to design 'specific' arithmetic functions with a small number of gates, but it is not suitable for arbitrary arithmetic computation. Pass-transistor logic (PTL) circuits use a small number of transistors for basic logic functions but additional level-restoring circuits are required for every unit [3].…”
Section: Introductionmentioning
confidence: 99%