Patent US4001779A successfully refreshed from Google Patents.
US4001779A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Digital error correcting decoder
Assignee: International Telephone and Telegraph Corp
•
Filing: 1975-08-12
•
Granted: 1977-01-04
•
Expires: 1995-08-12
Abstract
Abstract Received N pseudo random code words and one all logic "0" coded word are stored in a register one code word at a time. An N stage shift register and logic circuitry coupled to each stage of the shift register generate reference N pseudo random code words and one all logic "0" coded word with the bits of all the generated coded words being compared in an EXCLUSIVE OR gate with corresponding bits of a received coded word. The result of the comparison is coupled in common to a largest amplitude value detector which produces a strobe pulse when the amplitude value or the result of the comparison is greater than a preceding largest amplitude value detected and stored. An N stage holding shift register has each stage coupled to the output of the logic circuitry. The strobe pulse clocks the holding register to transfer the generated code word that resulted in the production of the strobe pulse to the holding register. The contents of the holding register are up-dated each time a strobe pulse is generated during a decoding cycle. At the end of the decoding cycle, the contents of the shift register are serially read out as an error free corrected code word for that one of the received code words which produced the largest amplitude value during the decoding cycle.
Inventors
- 👤 Maurice Leon Schiff
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-28 14:32
CPC Classifications
H; H03; H03M; H03M13/00; H03M13/03; H03M13/05
Claims Analysis
Total Claims: 19
Claim 1
Independent Claim
205 words
A digital error correcting decoder comprising: an input conductor for received digital data including a random sequence of (N + 1) code words having N pseudo random code words and one all logic "0" code word, each of said (N + 1) code words having N bits, where N is an integer greater than one; first means to generate in a predetermined sequence each of said (N + 1) code words; second means coupled to said input conductor and said first means to compare each bit of each of said received (N + 1) code words with each bit of all of said generated (N + 1) code words in said predetermined sequence; third means coupled to said second means to detect the largest amplitude value resulting from said comparison of each bit of one of said receiver (N + 1) code words with each bit of all of said generated (N + 1) code words; and fourth means coupled to said first means and said third means to select that one of said generated (N + 1) code words causing the detection of the largest amplitude value as an error corrected code word for said one of said received (N + 1) code words.
Claim 2
Dependent Claim
205 words
A digital error correcting decoder comprising: an input conductor for received digital data including a random sequence of (N + 1) code words having N pseudo random code words and one all logic "0" code word, each of said (N + 1) code words having N bits, where N is an integer greater than one; first means to generate in a predetermined sequence each of said (N + 1) code words; second means coupled to said input conductor and said first means to compare each bit of each of said received (N + 1) code words with each bit of all of said generated (N + 1) code words in said predetermined sequence; third means coupled to said second means to detect the largest amplitude value resulting from said comparison of each bit of one of said receiver (N + 1) code words with each bit of all of said generated (N + 1) code words; and fourth means coupled to said first means and said third means to select that one of said generated (N + 1) code words causing the detection of the largest amplitude value as an error corrected code word for said one of said received (N + 1) code words.
Claim 3
Dependent Claim
148 words
A decoder according to claim 1, wherein said first means includes a first N-stage shift register having an output of the last stage of said first shift register coupled to an input of the first stage of said first shift register to generate said N pseudo random code words in said predetermined sequence, and N logic circuits each having an output, a control input and a second input, said second input of each of said logic circuits being coupled to an output of a different one of the stages of said first shift register, said logic circuits passing to their outputs each of said N pseudo random code words in said predetermined sequence when each of said control inputs are at one logic level and to pass to their outputs said all logic "0" code word when each of said control inputs are at the other logic level.
Claim 4
Dependent Claim
55 words
A decoder according to claim 2, wherein each of said N logic circuits includes an AND gate, said AND gates having their control inputs at logic level "1" to pass each of said N pseudo random code words in said predetermined sequence and at logic level "0" to pass said all logic "0" code word.
Claim 5
Dependent Claim
64 words
A decoder according to claim 3, wherein said second means includes a second N-stage shift register coupled to said input connector, an N-stage register, each stage of said register being coupled to a different stage of said second shift register, and N digital comparators each coupled to a different one of the stages of said register and a different one of said AND gates.
Claim 6
Dependent Claim
16 words
A decoder according to claim 4, wherein each of said comparators includes an EXCLUSIVE OR gate.
Claim 7
Dependent Claim
64 words
A decoder according to claim 2, wherein said second means includes a second N-stage shift register coupled to said input conductor, an N-stage register, each stage of said register being coupled to a different stage of said second shift register, and N digital comparators each coupled to a different one of the stages of said register and a different one of said logic circuits.
Claim 8
Dependent Claim
16 words
A decoder according to claim 6, wherein each of said comparators include an EXCLUSIVE OR gate.
Claim 9
Dependent Claim
75 words
A decoder according to claim 1, wherein said second means includes a first N-stage shift register coupled to said input conductor, an N-stage register, each stage of said register being coupled to a different stage of said first shift register, and N digital comparators each coupled to a different one of the stages of said register and said first means responsive to a different bit of each of said generated (N + 1) code words.
Claim 10
Dependent Claim
16 words
A decoder according to claim 8, wherein each of said comparators include an EXCLUSIVE OR gate.
Claim 11
Dependent Claim
50 words
A decoder according to claim 4, wherein said third means includes a largest amplitude value detector coupled in common to the outputs of each of said comparators to produce a strobe pulse whenever an amplitude value is detected that is larger than a preceding detected and stored larger amplitude value.
Claim 12
Dependent Claim
83 words
A decoder according to claim 10, wherein said fourth means includes a third N-stage shift register having each of its stages coupled to the output of a different one of said AND gates and to said detector responsive to said strobe pulse to store that one of said generated (N + 1) code words associated with the production of said strobe pulse, said third shift register being read-out serially at the end of a decoding cycle to provide said error corrected code word.
Claim 13
Dependent Claim
96 words
A decoder according to claim 4, wherein said fourth means includes a third N-stage shift register having each of its stages coupled to the output of a different one of said AND gates and to said third means responsive to an output signal of said third means indicating whenever said largest amplitude value is detected to store that one of said generated (N + 1) code words associated with the production of said output signal, said third shift register being read-out serially at the end of a decoding cycle to provide said error corrected code word.
Claim 14
Dependent Claim
50 words
A decoder according to claim 6, wherein said third means includes a largest amplitude value detector coupled in common to the outputs of each of said comparators to produce a strobe pulse whenever an amplitude value is detected that is larger than a preceding detected and stored larger amplitude value.
Claim 15
Dependent Claim
83 words
A decoder according to claim 13, wherein said fourth means includes a third N-stage shift register having each of its stages coupled to the output of a different one of said logic circuits and to said detector responsive to said strobe pulse to store that one of said generated (N + 1) code words associated with the production of said strobe pulse, said third shift register being read-out serially at the end of a decoding cycle to provide said error corrected code word.
Claim 16
Dependent Claim
96 words
A decoder according to claim 2, wherein said fourth means includes a second N-stage shift register having each of its stages coupled to the output of a different one of said logic circuits and to said third means responsive to an output signal of said third means indicating whenever said largest amplitude value is detected to store that one of said generated (N + 1) code words associated with the production of said output signal, said third shift register being read-out serially at the end of a decoding cycle to provide said error corrected code word.
Claim 17
Dependent Claim
48 words
A decoder according to claim 8, wherein said third means includes a largest amplitude value detector coupled in common to the outputs of said comparators to produce a strobe pulse whenever an amplitude value is detected that is larger than a preceding detected and stored larger amplitude value.
Claim 18
Dependent Claim
97 words
A decoder according to claim 16, wherein said fourth means includes a second N-stage shift register having each of its stages coupled to said first means, each of its stages being responsive to a different bit of each of said generated (N + 1) code words and coupled to said detector responsive to said strobe pulse to store that one of said generated (N + 1) code words associated with the production of said strobe pulse, said second shift register being read-out serially at the end of a decoding cycle to provide said error corrected code word.
Claim 19
Dependent Claim
89 words
A decoder according to claim 1, wherein said fourth means includes a first N-stage shift register having each of its stages coupled to said first means and to said third means responsive to an output signal of said third means indicating whenever said largest amplitude value is detected to store that one of said generated (N + 1) code words associated with the production of said output signal, said third shift register being read-out serially at the end of a decoding cycle to provide said error corrected code word.
References Cited (Backward Citations)
US3245033A
Cited
US3237160A
Cited
US3531798A
Cited
US3560925A
Cited
US3541314A
Cited
US3559166A
Cited
US3694757A
Cited
US3796868A
Cited
US3866170A
Cited
US3818442A
Cited
US3836908A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1980-01-04 | 1980-07-05 | 1981-01-04 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1984-01-04 | 1984-07-05 | 1985-01-04 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 1988-01-04 | 1988-07-05 | 1989-01-04 | $7700.00 | Window Closed / Lapsed |