Patent US3702202A successfully refreshed from Google Patents.
Patent US3685016A successfully refreshed from Google Patents.
US3685016A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Array method and apparatus for encoding, detecting, and/or correcting data
Assignee: Honeywell Inc
•
Filing: 1969-10-29
•
Granted: 1972-08-15
•
Expires: 1989-10-29
Abstract
Abstract Method and apparatus is provided for organizing source data into k data segments of n bits each. The source data may be considered to constitute an array where each data segment is a row and the bit positions of a data segment define the columns of the array. The encoding method and apparatus provide for generating a first series of check bits along the columns of the array as a first succession of exclusive-or functions. A second series of check bits are generated along diagonals of the array; where a diagonal is defined as a series of adjacent positions in successive rows of the array with the direction of adjacency being the same for all diagonals.
Inventors
- 👤 Joseph J Eachus
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-28 21:55
CPC Classifications
H; H04; H04L; H04L1/00; H04L1/004; H04L1/0056; H04L1/0057; H03; H03M; H03M13/00; H03M13/29
Claims Analysis
Total Claims: 12
Claim 1
Independent Claim
184 words
A method of detecting errors in source data where the source further includes at least two check data segments, each of which contains n bits, one of said check data segments being related to said source data as a series of successions of exclusive-or functions along diagonals of an array derive from said data source, where a diagonal is defined as a series of adjacent positions in successive rows of the array, with the direction of adjacency being constant for all diagonals, said method comprising the following steps: generating a set of new check data segments corresponding respectively to said check data segments; performing the exclusive-or of said one check data segment with the one of said new check data segment which is developed along the diagonals of the array to produce a first error segment; performing the exclusive-or of said other check data segment with the other of said new check data segments to produce a second error segment; comparing said error segments with successive shifts of said first error segment until agreement occurs and counting the number of shifts required for agreement.
Claim 2
Independent Claim
184 words
A method of detecting errors in source data where the source further includes at least two check data segments, each of which contains n bits, one of said check data segments being related to said source data as a series of successions of exclusive-or functions along diagonals of an array derive from said data source, where a diagonal is defined as a series of adjacent positions in successive rows of the array, with the direction of adjacency being constant for all diagonals, said method comprising the following steps: generating a set of new check data segments corresponding respectively to said check data segments; performing the exclusive-or of said one check data segment with the one of said new check data segment which is developed along the diagonals of the array to produce a first error segment; performing the exclusive-or of said other check data segment with the other of said new check data segments to produce a second error segment; comparing said error segments with successive shifts of said first error segment until agreement occurs and counting the number of shifts required for agreement.
Claim 3
Dependent Claim
67 words
The method defined in claim 1 wherein said source includes three old check data segments DLm, Cm, and DRm, and where three new check data segments corresponding respectively to said old check data segments are generated being referred to herein as NDLm, NCm, and NDRm, the method including the steps of performing the exclusive-ors: EDLm DLm + NDLm; ECm Cm + NCm; and EDRm DRm + NDRm.
Claim 4
Dependent Claim
130 words
In a system wherein source data containing k data segments of n bits each is stored along with check segments DLm, Cm, and DRm, a device for detecting and correcting errors, said device comprising: first means for generating new check segments NDLm, NCm, and MDRm; second means for generating error segments EDLm, ECm, and EDRm as respective exclusive-or functions of DLm and NDLm, Cm and NCm, and DRm and NDRm, respectively; third means for comparing EDLm, ECm, and EDRm; fourth means for left cycling EDLm and for right cycling EDRm; and fifth means for counting the number of comparisons performed by said third means; said third means being operated to repeat the comparison of the error segments after each cycle until three-way agreement occurs or k comparisons have been performed.
Claim 5
Dependent Claim
130 words
In a system wherein source data containing k data segments of n bits each is stored along with check segments DLm, Cm, and DRm, a device for detecting and correcting errors, said device comprising: first means for generating new check segments NDLm, NCm, and MDRm; second means for generating error segments EDLm, ECm, and EDRm as respective exclusive-or functions of DLm and NDLm, Cm and NCm, and DRm and NDRm, respectively; third means for comparing EDLm, ECm, and EDRm; fourth means for left cycling EDLm and for right cycling EDRm; and fifth means for counting the number of comparisons performed by said third means; said third means being operated to repeat the comparison of the error segments after each cycle until three-way agreement occurs or k comparisons have been performed.
Claim 6
Dependent Claim
12 words
The device defined in claim 3 wherein n is a prime number.
Claim 7
Dependent Claim
24 words
The device defined in claim 3 wherein said second means includes three registers R1, R2, and R3 for generating EDLm, ECm, and EDRm, respectively.
Claim 8
Independent Claim
159 words
A method of detecting errors in source data where the source includes three check data segments, a left-diagonal check segment, a right-diagonal check segment, and a column check segment formed by performing a series of exclusive-or functions along left and right diagonals and along columns, rEspectively, of an array derived from said data source, the method including: generating new left-diagonal, right-diagonal and column check segments after transmission of said source data; performing exclusive-or operations between said left-diagonal and said new left-diagonal check segments to form a left-error segment; performing exclusive-or operations between said right-diagonal and said new right-diagonal check segments to form a right-error segment; and performing exclusive-or operations between said column and said new-column check segments to form a column-error segment; comparing said error segments with successive shifts left and right of said left and right error segments until three-way agreement is reached, and counting the number of comparisons prior to three-way agreement to provide a row index.
Claim 9
Independent Claim
159 words
A method of detecting errors in source data where the source includes three check data segments, a left-diagonal check segment, a right-diagonal check segment, and a column check segment formed by performing a series of exclusive-or functions along left and right diagonals and along columns, rEspectively, of an array derived from said data source, the method including: generating new left-diagonal, right-diagonal and column check segments after transmission of said source data; performing exclusive-or operations between said left-diagonal and said new left-diagonal check segments to form a left-error segment; performing exclusive-or operations between said right-diagonal and said new right-diagonal check segments to form a right-error segment; and performing exclusive-or operations between said column and said new-column check segments to form a column-error segment; comparing said error segments with successive shifts left and right of said left and right error segments until three-way agreement is reached, and counting the number of comparisons prior to three-way agreement to provide a row index.
Claim 10
Dependent Claim
34 words
A method as set forth in claim 6 wherein said array contains k data segments and the method further comprises generating an uncorrectable error signal if said number of comparisons reaches k without agreement.
Claim 11
Independent Claim
87 words
A method for generating error checking data for serially transmitted source data comprising: a. forming the serial data into groups of n bits, b. entering a group into a register, c. shifting the contents of said register by one bit, d. entering a new group into said register through an exclusive-or operation, e. shifting the contents of said register by one bit, f. repeating steps (d) and (e) until k shifts have been accomplished, g. wherein (k) (n) equals the number of bits in the source data.
Claim 12
Independent Claim
87 words
A method for generating error checking data for serially transmitted source data comprising: a. forming the serial data into groups of n bits, b. entering a group into a register, c. shifting the contents of said register by one bit, d. entering a new group into said register through an exclusive-or operation, e. shifting the contents of said register by one bit, f. repeating steps (d) and (e) until k shifts have been accomplished, g. wherein (k) (n) equals the number of bits in the source data.
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) | 1975-08-15 | 1976-02-14 | 1976-08-15 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1979-08-15 | 1980-02-14 | 1980-08-15 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 1983-08-15 | 1984-02-14 | 1984-08-15 | $7700.00 | Window Closed / Lapsed |