Patent US4072535A successfully refreshed from Google Patents.
Patent US2161089A successfully refreshed from Google Patents.
Patent US5195098A successfully refreshed from Google Patents.
US5195098A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Binary data error correction using hint signal
Assignee: Echelon Corp
•
Filing: 1991-05-10
•
Granted: 1993-03-16
•
Expires: 2011-05-10
Abstract
Abstract An error detection and correction method and apparatus is described which permits the correction of double errors using a (15,11) Hamming code and a parity bit. The Hamming code and parity bit allows the detection of double errors. A modulated waveform carrying the binary data is examined for anomalies such as noise pulses. A hint signal is generated based on the anomalies which points to a suspect bit. The state of this bit is changed to correct for double errors.
Inventors
- 👤 Howard W. Johnson
- 👤 Philip H. Sutterlin
- 👤 Amy O. Hurlbut
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-05 21:51
CPC Classifications
H; H04; H04L; H04L1/00; H04L1/004; H04L1/0056; H04L1/0057; G; G06; G06F; G06F11/00; G06F11/07; G06F11/08; G06F11/10; H03; H03M; H03M13/00; H03M13/03; H03M13/05; H03M13/09; H03M13/098; H03M13/13; H03M13/15; H03M13/151; H03M13/19; H03M13/25; H03M13/251; H04B; H04B3/00; H04B3/54; H04B3/542; H04L1/22; H04B2203/00; H04B2203/54; H04B2203/5404; H04B2203/5408; H04B2203/5416; H04B2203/5425; H04B2203/5429; H04B2203/5445; H04B2203/5462; H04B2203/5483; H04B2203/5491; H04B2203/5495
Claims Analysis
Total Claims: 20
Claim 1
Independent Claim
86 words
In an apparatus for handling a signal representing binary data, an improved method for correcting errors in said binary data comprising the steps of: examining said signal for noise pulses which exceed certain limits; determining which datum was present in said binary data at the point in said signal where said noise pulse occurred; verifying the correctness of a predetermined group of data which includes said datum; and, changing the state of said datum if said data was found to be incorrect by said verifying step.
Claim 2
Dependent Claim
86 words
In an apparatus for handling a signal representing binary data, an improved method for correcting errors in said binary data comprising the steps of: examining said signal for noise pulses which exceed certain limits; determining which datum was present in said binary data at the point in said signal where said noise pulse occurred; verifying the correctness of a predetermined group of data which includes said datum; and, changing the state of said datum if said data was found to be incorrect by said verifying step.
Claim 3
Dependent Claim
13 words
The method defined by claim 1 wherein said verification comprises a parity check.
Claim 4
Dependent Claim
14 words
The method defined by claim 1 wherein said verification comprises a Hamming code check.
Claim 5
Dependent Claim
90 words
In an apparatus for handling a signal representing binary data, an improved method for correcting errors in said binary data comprising the steps of: examining said signal for a noise pulse which exceed certain limits; determining which datum was present in said binary data at the point in said signal where said noise pulse occurred; and, subjecting a predetermined group of data which includes said datum to a test to determine the data's correctness and if said predetermined group of data fails said test, inverting the state of said datum.
Claim 6
Dependent Claim
90 words
In an apparatus for handling a signal representing binary data, an improved method for correcting errors in said binary data comprising the steps of: examining said signal for a noise pulse which exceed certain limits; determining which datum was present in said binary data at the point in said signal where said noise pulse occurred; and, subjecting a predetermined group of data which includes said datum to a test to determine the data's correctness and if said predetermined group of data fails said test, inverting the state of said datum.
Claim 7
Dependent Claim
13 words
the method defined by claim 4 wherein said test comprises a parity check.
Claim 8
Independent Claim
16 words
The method defined by claims 4 or 5 wherein said test comprises a Hamming code check.
Claim 9
Dependent Claim
103 words
In an apparatus for handling a signal representing a stream of bits, a plurality of ones of said bits representing a word and where each of said words includes one or more bits used to detect and correct errors in said word, and improved method comprising the steps of: detecting noise pulses in said signal which exceed a threshold level; examining each word to determine if it contains an error; and, changing the state of a bit in the ones of said words which contain errors, said bit corresponding to the position along said signal where one of said noise pulses was detected
Claim 10
Dependent Claim
103 words
In an apparatus for handling a signal representing a stream of bits, a plurality of ones of said bits representing a word and where each of said words includes one or more bits used to detect and correct errors in said word, and improved method comprising the steps of: detecting noise pulses in said signal which exceed a threshold level; examining each word to determine if it contains an error; and, changing the state of a bit in the ones of said words which contain errors, said bit corresponding to the position along said signal where one of said noise pulses was detected
Claim 11
Dependent Claim
141 words
In an apparatus for detecting binary data in a modulated signal, where predetermined groups of bits include Hamming code and a parity bit, an improved method for detecting and correcting errors comprising the steps of: determining is a single error is present in each of said groups of bits; correcting said single error using said Hamming code if a single error is detected; determining if double errors are present in ones of said groups of bits; examining said modulated signal for noise pulses which exceed certain limits; determining which of said bits in said groups of bits was detected at the point in said modulated signal where said noise pulses occurred; and, correcting said double errors by using Hamming code and by changing the states of said bits detected at the points in said modulated signal where said noise pulses occurred.
Claim 12
Dependent Claim
141 words
In an apparatus for detecting binary data in a modulated signal, where predetermined groups of bits include Hamming code and a parity bit, an improved method for detecting and correcting errors comprising the steps of: determining is a single error is present in each of said groups of bits; correcting said single error using said Hamming code if a single error is detected; determining if double errors are present in ones of said groups of bits; examining said modulated signal for noise pulses which exceed certain limits; determining which of said bits in said groups of bits was detected at the point in said modulated signal where said noise pulses occurred; and, correcting said double errors by using Hamming code and by changing the states of said bits detected at the points in said modulated signal where said noise pulses occurred.
Claim 13
Dependent Claim
83 words
In an apparatus for handling a signal representing binary data, an improved method for correcting errors in said binary data comprising the steps of: (a) detecting anomalies in said signal; (b) identifying the data in said signal associated with the occurrence of said anomalies; (c) subjecting said data identified in step (b) above to verification using a test independent of said detecting step (a) above; and, (d) correcting said data if said data cannot be verified by the verification of step (c) above.
Claim 14
Dependent Claim
83 words
In an apparatus for handling a signal representing binary data, an improved method for correcting errors in said binary data comprising the steps of: (a) detecting anomalies in said signal; (b) identifying the data in said signal associated with the occurrence of said anomalies; (c) subjecting said data identified in step (b) above to verification using a test independent of said detecting step (a) above; and, (d) correcting said data if said data cannot be verified by the verification of step (c) above.
Claim 15
Dependent Claim
83 words
In an apparatus for handling a received signal representing a series of binary signals, an improvement for correcting transmission errors in said binary signals comprising: detection means for detecting anomalies in said received signal; and, correction means for changing the state of the ones of said binary signals detected in said received signal where said anomalies occurred, said correction means being coupled to said detection means, said correction means employing a correcting code which is independent of said detection means for detecting anomalies.
Claim 16
Dependent Claim
83 words
In an apparatus for handling a received signal representing a series of binary signals, an improvement for correcting transmission errors in said binary signals comprising: detection means for detecting anomalies in said received signal; and, correction means for changing the state of the ones of said binary signals detected in said received signal where said anomalies occurred, said correction means being coupled to said detection means, said correction means employing a correcting code which is independent of said detection means for detecting anomalies.
Claim 17
Dependent Claim
115 words
In an apparatus for handling a modulated signal representing a stream of bits, a plurality of ones of said bits representing a data word, and where one or more bits are included with each of said words to correct errors in said data word, and improvement comprising: detection means for detecting noise pulses in said modulated signal which exceed certain limits; verification means for verifying the correctness of said words detected from said modulated signal; and, correction means for changing the state of bits in said words that were located in said modulated signal at locations where said noise pulses were detected, said correcting means being coupled to said verification means and said detection means.
Claim 18
Dependent Claim
115 words
In an apparatus for handling a modulated signal representing a stream of bits, a plurality of ones of said bits representing a data word, and where one or more bits are included with each of said words to correct errors in said data word, and improvement comprising: detection means for detecting noise pulses in said modulated signal which exceed certain limits; verification means for verifying the correctness of said words detected from said modulated signal; and, correction means for changing the state of bits in said words that were located in said modulated signal at locations where said noise pulses were detected, said correcting means being coupled to said verification means and said detection means.
Claim 19
Dependent Claim
74 words
In an apparatus for handling a signal representing binary data, an improved method for correcting transmission errors comprising the steps of: detecting anomalies in said signal; verifying the correctness of said data with a mechanism which is independent of said detecting of said anomalies; and, changing the state of the ones of said binary signals detected in said signal occurring where said anomalies are detected, if the correctness of said data cannot be verified.
Claim 20
Dependent Claim
74 words
In an apparatus for handling a signal representing binary data, an improved method for correcting transmission errors comprising the steps of: detecting anomalies in said signal; verifying the correctness of said data with a mechanism which is independent of said detecting of said anomalies; and, changing the state of the ones of said binary signals detected in said signal occurring where said anomalies are detected, if the correctness of said data cannot be verified.
References Cited (Backward Citations)
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1996-03-15 | 1996-09-14 | 1997-03-16 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2000-03-15 | 2000-09-14 | 2001-03-16 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2004-03-15 | 2004-09-14 | 2005-03-16 | $7700.00 | Window Closed / Lapsed |