US5517508A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Method and apparatus for detection and error correction of packetized digital data
Assignee: Sony Corp
•
Filing: 1994-01-26
•
Granted: 1996-05-14
•
Expires: 2014-01-26
Abstract
Abstract Digital data is stored in a buffer, and a data buffer CRC word is generated for error detection. Error correction is provided by a set of XPQ circular queues ("XPQs") used to compute an error correction syndrome. As each word is loaded into the data buffer, it is also XORed into each of the XPQs. An XPQ CRC is generated for error detection in the XPQs. The complete data packet may be transmitted or stored for later retrieval. Upon receipt or retrieval, the packet is decoded and checked for errors. The incoming data is read into a second buffer and a new CRC is generated. If the incoming CRC matches the new CRC, no errors exist and no further checking or correction is needed. If the CRCs do not match, the incoming data is used to generate new XPQ' queues and a new XPQ CRC. If the incoming XPQ CRC matches the new XPQ CRC, then the error may be correctable. XPQ imprinter circular queues ("IQ") are formed by XORing each word of the incoming XPQs with the words of the new corresponding XPQs. Intermediate correction masks are then created by sequentially writing the contents of each IQ to intermediate correction mask buffers. A single XPQ correction mask is then formed by ANDing each corresponding word of each intermediate correction mask buffer together. The correction mask is evaluated and if the errors are determined to be correctable, correction is achieved by XORing each corresponding word in the XPQ correction mask with the incoming data.
Inventors
- 👤 Edward W. Scott
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-01 22:11
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/091; H04L1/0001; H04L1/0009; H04L1/0041; H04L1/0043; H04L1/0045; H04L1/0052; G06F11/1004
Claims Analysis
Total Claims: 46
Claim 1
Independent Claim
120 words
A method for encoding digital data, comprising the steps of: providing a source of digital data, said digital data being organized into a plurality of words; providing a first data buffer, a first XPQ circular queue and a first XPQ CRC word buffer; sequentially loading a predefined number (N) of said words into said first data buffer; sequentially conducting a logical XOR operation on each sequential data word and storing the resulting value of said XOR operation in said first XPQ circular queue; generating an XPQ CRC word from said value stored in said first XPQ circular queue and storing said XPQ CRC word in said first XPQ CRC word buffer; whereby said data is encoded in a data packet.
Claim 2
Independent Claim
120 words
A method for encoding digital data, comprising the steps of: providing a source of digital data, said digital data being organized into a plurality of words; providing a first data buffer, a first XPQ circular queue and a first XPQ CRC word buffer; sequentially loading a predefined number (N) of said words into said first data buffer; sequentially conducting a logical XOR operation on each sequential data word and storing the resulting value of said XOR operation in said first XPQ circular queue; generating an XPQ CRC word from said value stored in said first XPQ circular queue and storing said XPQ CRC word in said first XPQ CRC word buffer; whereby said data is encoded in a data packet.
Claim 3
Dependent Claim
57 words
The method as defined by claim 1 further including a method for decoding said data packet, comprising the steps of: sequentially reading said N data words into a second data buffer; sequentially conducting a logical XOR operation on each sequential data word and storing the resulting value of said XOR operation in a second XPQ circular queue.
Claim 4
Dependent Claim
47 words
The method as defined by claim 2 further including the step of conducting an XOR operation on each word in said first XPQ circular queue with its corresponding word in said second XPQ circular queue and storing the result of said XOR operation in an imprinting queue.
Claim 5
Dependent Claim
21 words
The method as defined by claim 3 further including the step of creating a correction mask buffer using said imprinting queue.
Claim 6
Dependent Claim
36 words
The method as defined by claim 4 further including the step of XORing each word comprising said correction mask buffer with the corresponding word contents in said second data buffer to obtain corrected data buffer contents.
Claim 7
Independent Claim
95 words
A system for encoding digital data, comprising: a digital data source providing digital data, said digital data being organized into a plurality of words; a first data buffer sequentially receiving a predefined number (N) of said words; a first XPQ circular queue storing the logical result of an XOR operation conducted on each sequential data word of said N words; a first XPQ CRC word buffer storing the result of a cyclic redundancy check conducted on the value stored in said first XPQ circular queue; whereby said digital data is encoded in a data packet.
Claim 8
Independent Claim
95 words
A system for encoding digital data, comprising: a digital data source providing digital data, said digital data being organized into a plurality of words; a first data buffer sequentially receiving a predefined number (N) of said words; a first XPQ circular queue storing the logical result of an XOR operation conducted on each sequential data word of said N words; a first XPQ CRC word buffer storing the result of a cyclic redundancy check conducted on the value stored in said first XPQ circular queue; whereby said digital data is encoded in a data packet.
Claim 9
Dependent Claim
53 words
The system as defined by claim 6 further including: a second data buffer sequentially receiving said digital data of N words; a second XPQ circular queue sequentially receiving each of said N words and storing a resulting value of a logical XOR operation conducted on each sequential data word of said N words.
Claim 10
Dependent Claim
39 words
The system as defined by claim 7 further including an imprinting queue for storing the result of an XOR operation between each word in said first XPQ circular queue and its corresponding word in said second XPQ circular queue.
Claim 11
Dependent Claim
18 words
The system as defined by claim 8 further including a correction mask buffer generated from said imprinting queue.
Claim 12
Dependent Claim
32 words
The system as defined by claim 9 wherein a corrected data buffer is formed by XORing each word comprising said correction mask buffer with the corresponding word in said second data buffer.
Claim 13
Independent Claim
173 words
A method for encoding digital data, comprising the steps of: providing a source of digital data in the form of successive words of binary information; providing a first data buffer having a first load pointer for storing N words; providing at least two XPQ circular queues (XPQ1 and XPQ2) for generating an error correction syndrome, wherein each of said XPQ circular queues has a length which is a prime number, and wherein each of said XPQ circular queues has a length which is unique with respect to other of said XPQ circular queues; providing a first CRC buffer; providing a first XPQ CRC word buffer; sequentially loading each data word of said N data words into said first data buffer, and generating a CRC word stored in said first CRC buffer; executing a logical XOR operation on each of said sequentially loaded N data words in each of said XPQ circular queues, and generating an XPQ CRC word from the words comprising said XPQ circular queues; whereby said N data words are encoded.
Claim 14
Independent Claim
173 words
A method for encoding digital data, comprising the steps of: providing a source of digital data in the form of successive words of binary information; providing a first data buffer having a first load pointer for storing N words; providing at least two XPQ circular queues (XPQ1 and XPQ2) for generating an error correction syndrome, wherein each of said XPQ circular queues has a length which is a prime number, and wherein each of said XPQ circular queues has a length which is unique with respect to other of said XPQ circular queues; providing a first CRC buffer; providing a first XPQ CRC word buffer; sequentially loading each data word of said N data words into said first data buffer, and generating a CRC word stored in said first CRC buffer; executing a logical XOR operation on each of said sequentially loaded N data words in each of said XPQ circular queues, and generating an XPQ CRC word from the words comprising said XPQ circular queues; whereby said N data words are encoded.
Claim 15
Dependent Claim
35 words
The method as defined by claim 11 wherein said XPQ circular queues are initially cleared before said execution of said XOR operations and XPQ load pointers are set to a first XPQ data word position.
Claim 16
Dependent Claim
28 words
The method as defined by claim 12 wherein said first load pointer and each of said XPQ pointers are incremented with the sequential loading of each data word.
Claim 17
Dependent Claim
171 words
The method as defined by claim 11 further including a method for decoding said encoded N data words, comprising the steps of: providing a second data buffer; providing at least two circular queues XPQ1' and XPQ2' for generating an error correction syndrome, wherein said circular queue XPQ1' has a length equal to the length of circular queue XPQ1, and said circular queue XPQ2' has a length equal to the length of circular queue XPQ2 providing a second CRC buffer; providing a second XPQ CRC word buffer; transmitting said N data words stored in said first data buffer to said second data buffer, sequentially loading said N data words into said second data buffer, and generating a second CRC word stored in said second CRC buffer; executing a logical XOR operation on each of said N data words transmitted from said first data buffer to said second data buffer in each of said circular queues XPQ1' and XPQ2', and generating an XPQ CRC word from the words comprising said XPQ' circular queues.
Claim 18
Dependent Claim
68 words
The method as defined by claim 14 further including the step of detecting errors in said N data words stored in said second data buffer by comparing the contents of said first CRC buffer with the contents of said second CRC buffer, such that in the event said contents are not equal, one or more errors exist in said N data words stored in said second data buffer.
Claim 19
Dependent Claim
69 words
The method as defined by claim 15 further including the step of detecting if said errors in said N data words stored in said second data buffer may be correctable by comparing the contents of said first XPQ CRC buffer with the contents of said second XPQ CRC buffer, such that if said contents are equal said errors in data stored in said second data buffer may be correctable.
Claim 20
Dependent Claim
122 words
The method as defined by claim 16 further including the method of creating an XPQ correction mask, comprising the steps of: providing a correction mask buffer having a capacity of N words; executing a logical XOR operation between each word comprising said XPQ1 and XPQ1' circular queues to obtain a first result; executing a logical XOR operation between each word comprising said XPQ2 and XPQ2' circular queues to obtain a second result; logically ANDing each corresponding first result and second result to produce a final result for each word; repetitively sequentially writing the final result for each word to said XPQ correction mask buffer until every available word is written into the XPQ correction mask buffer, thereby creating said XPQ correction mask.
Claim 21
Dependent Claim
27 words
The method as defined by claim 17 further including the step of evaluating the contents of said XPQ correction mask to determine if said errors are correctable.
Claim 22
Dependent Claim
56 words
The method as defined by claim 18 wherein said evaluating step includes determining if the contents of said XPQ correction mask include more than a single logical one value in any bit column, such that in the event that any of said bit columns contain more than a single logical one, said errors are not correctable.
Claim 23
Dependent Claim
45 words
The method as defined by claim 19 wherein in the event said errors are correctable, said errors are corrected by executing a logical XOR operation between each corresponding word of said XPQ correction mask and said second data buffer to generate a corrected data buffer.
Claim 24
Dependent Claim
63 words
The method as defined by claim 16 further including the method of creating XPQ imprinter circular queues, comprising the steps of: executing a logical XOR operation between each word comprising said XPQ1 and XPQ1' circular queues to obtain an XPQ1 imprinting queue; executing a logical XOR operation between each word comprising said XPQ2 and XPQ2' circular queues to obtain an XPQ2 imprinting queue.
Claim 25
Dependent Claim
162 words
The method as defined by claim 21 further including the method of generating an intermediate correction mask comprising the steps of: providing first and second intermediate correction mask buffers having a capacity of N data words; repetitively sequentially writing the contents of said XPQ1 imprinting queue into said first intermediate correction mask buffer, beginning with the first word stored in said XPQ1 imprinting queue and ending with the last word stored in said XPQ1 imprinting queue, until every available location in said first intermediate correction buffer is written into; repetitively sequentially writing the contents of said XPQ2 imprinting queue into said second intermediate correction mask buffer, beginning with the first word stored in said XPQ2 imprinting queue and ending with the last word stored in said XPQ2 imprinting queue, until every available location in said second intermediate correction buffer is written into; logically ANDing each corresponding word of said first and second intermediate correction buffers to obtain a single XPQ correction mask.
Claim 26
Dependent Claim
27 words
The method as defined by claim 22 further including the step of evaluating the contents of said XPQ correction mask to determine if said errors are correctable.
Claim 27
Dependent Claim
56 words
The method as defined by claim 23 wherein said evaluating step includes determining if the contents of said XPQ correction mask include more than a single logical one value in any bit column, such that in the event that any of said bit columns contain more than a single logical one, said errors are not correctable.
Claim 28
Dependent Claim
46 words
The method as defined by claim 24 wherein in the event said errors are correctable, said errors are corrected by executing a logical XOR operation between each corresponding word of said XPQ correction mask buffer and said second data buffer to generate a corrected data buffer.
Claim 29
Independent Claim
194 words
A system for encoding digital data, comprising: a source of digital data in the form of successive words of binary information; a first data buffer having a first load pointer for storing N words; at least two XPQ circular queues (XPQ1 and XPQ2) for generating an error correction syndrome, wherein each of said XPQ circular queues has a length which is a prime number, and wherein each of said XPQ circular queues has a length which is unique with respect to other of said XPQ circular queues, and wherein the product of the lengths of said circular queues equals N; a first CRC buffer; a first XPQ CRC word buffer; wherein each data word of said N data words is sequentially loaded into said first data buffer, and a CRC word is generated and stored in said first CRC buffer; wherein each of said XPQ circular queues stores the results of logical XOR operations on each of said sequentially loaded N data words, and wherein further there is stored in said XPQ CRC word buffer an XPQ CRC word from the words comprising said XPQ circular queues; whereby said N data words are encoded.
Claim 30
Independent Claim
194 words
A system for encoding digital data, comprising: a source of digital data in the form of successive words of binary information; a first data buffer having a first load pointer for storing N words; at least two XPQ circular queues (XPQ1 and XPQ2) for generating an error correction syndrome, wherein each of said XPQ circular queues has a length which is a prime number, and wherein each of said XPQ circular queues has a length which is unique with respect to other of said XPQ circular queues, and wherein the product of the lengths of said circular queues equals N; a first CRC buffer; a first XPQ CRC word buffer; wherein each data word of said N data words is sequentially loaded into said first data buffer, and a CRC word is generated and stored in said first CRC buffer; wherein each of said XPQ circular queues stores the results of logical XOR operations on each of said sequentially loaded N data words, and wherein further there is stored in said XPQ CRC word buffer an XPQ CRC word from the words comprising said XPQ circular queues; whereby said N data words are encoded.
Claim 31
Dependent Claim
35 words
The system as defined by claim 26 wherein said XPQ circular queues are initially cleared before said execution of said XOR operations and XPQ load pointers are set to a first XPQ data word position.
Claim 32
Dependent Claim
28 words
The system as defined by claim 27 wherein said first load pointer and each of said XPQ pointers are incremented with the sequential loading of each data word.
Claim 33
Dependent Claim
151 words
The system as defined by claim 26 further including: a second data buffer; at least two circular queues XPQ1' and XPQ2' for generating an error correction syndrome, wherein said circular queue XPQ1' has a length equal to the length of circular queue XPQ1, and said circular queue XPQ2' has a length equal to the length of circular queue XPQ2; a second CRC buffer; a second XPQ CRC word buffer; wherein said N data words are transmitted to said second data buffer, and sequentially loaded into said second data buffer; wherein a second CRC word is stored in said second CRC buffer; wherein a logical XOR operation is executed on each of said N data words transmitted from said first data buffer to said second data buffer in each of said circular queues XPQ1' and XPQ2', and wherein an XPQ CRC word is generated from the words comprising said XPQ' circular queues.
Claim 34
Dependent Claim
68 words
The system as defined by claim 29 further including detection means for detecting errors in said N data words stored in said second data buffer by comparing the contents of said first CRC buffer with the contents of said second CRC buffer, such that in the event said contents are not equal, one or more errors exist in said N data words stored in said second data buffer.
Claim 35
Dependent Claim
69 words
The system as defined by claim 30 wherein said detection means further determines if said errors in said N data words stored in said second data buffer may be correctable by comparing the contents of said first XPQ CRC buffer with the contents of said second XPQ CRC buffer, such that if said contents are equal said errors in data stored in said second data buffer may be correctable.
Claim 36
Dependent Claim
83 words
The system as defined by claim 31 further including: a single XPQ correction mask obtained by repetitively sequentially writing a final result to an XPQ correction mask buffer, the final result being a product of a logical AND operation using a first result and a second result as operands, the first result being formed by logically XORing each word comprising said XPQ1 and XPQ1' circular queues, the second result being formed by logically XORing each word comprising said XPQ2 and XPQ2' circular queues.
Claim 37
Dependent Claim
28 words
The system as defined by claim 32 wherein said detection means further evaluates the contents of said XPQ correction mask buffer to determine if said errors are correctable.
Claim 38
Dependent Claim
56 words
The system as defined by claim 33 wherein said detection means determines if the contents of said XPQ correction mask buffer include more than a single logical one value in any bit column, such that in the event that any of said bit columns contain more than a single logical one, said errors are not correctable.
Claim 39
Dependent Claim
45 words
The system as defined by claim 34 wherein in the event said errors are correctable, said errors are corrected by executing a logical XOR operation between each corresponding word of said XPQ correction mask and said second data buffer to generate a corrected data buffer.
Claim 40
Dependent Claim
55 words
The system as defined by claim 31 further including: an XPQ1 imprinting queue storing the logical result of executing an XOR operation between each word comprising said XPQ1 and XPQ1' circular queues; an XPQ2 imprinting queue storing the logical result of executing an XOR operation between each word comprising said XPQ2 and XPQ2' circular queues.
Claim 41
Dependent Claim
165 words
The system as defined by claim 36 further including: a first intermediate correction mask buffer having a capacity of N data words formed by repetitively sequentially writing the contents of said XPQ1 imprinting queue into said first intermediate correction mask buffer, beginning with the first word stored in said XPQ1 imprinting queue and ending with the last word stored in said XPQ1 imprinting queue, until every available location in said first intermediate correction buffer is written into; a second intermediate correction mask buffer having a capacity of N data words formed by repetitively sequentially writing the contents of said XPQ2 imprinting queue into said second intermediate correction mask buffer, beginning with the first word stored in said XPQ2 imprinting queue and ending with the last word stored in said XPQ2 imprinting queue, until every available location in said second intermediate correction buffer is written into; a single XPQ correction mask obtained by logically ANDing each corresponding word of said first and second intermediate correction buffers.
Claim 42
Dependent Claim
27 words
The system as defined by claim 37 wherein said detection means further evaluates the contents of said XPQ correction mask to determine if said errors are correctable.
Claim 43
Dependent Claim
55 words
The system as defined by claim 38 wherein said detection means determines if the contents of said XPQ correction mask include more than a single logical one value in any bit column, such that in the event that any of said bit columns contain more than a single logical one, said errors are not correctable.
Claim 44
Dependent Claim
45 words
The system as defined by claim 39 wherein in the event said errors are correctable, said errors are corrected by executing a logical XOR operation between each corresponding word of said XPQ correction mask and said second data buffer to generate a corrected data buffer.
Claim 45
Independent Claim
738 words
A method for the detection and correction of errors in digital data, comprising the steps of: providing a source of digital data in the form of successive words of binary information; providing a first data buffer for storing N words; providing at least two XPQ circular queues (XPQ1 and XPQ2) for generating an error correction syndrome, wherein each of said XPQ circular queues has a length which is a prime number, and wherein each of said XPQ circular queues has a length which is unique with respect to other of said XPQ circular queues; providing a first CRC buffer; providing a first XPQ CRC word buffer; sequentially loading each data word of said N data words into said first data buffer, and generating a CRC word stored in said first CRC buffer; executing a logical XOR operation on each of said sequentially loaded N data words in each of said XPQ circular queues, and generating an XPQ CRC word from the words comprising said XPQ circular queues; providing a second data buffer; providing at least two circular queues XPQ1' and XPQ2' for generating an error correction syndrome, wherein said circular queue XPQ1' has a length equal to the length of circular queue XPQ1, and said circular queue XPQ2' has a length equal to the length of circular queue XPQ2 providing a second CRC buffer; providing a second XPQ CRC word buffer; transmitting said N data words stored in said first data buffer to said second data buffer, sequentially loading said N data words into said second data buffer, and generating a second CRC word stored in said second CRC buffer; executing a logical XOR operation on each of said N data words transmitted from said first data buffer to said second data buffer in each of said circular queues XPQ1' and XPQ2', and generating an XPQ CRC word from the words comprising said XPQ' circular queues; detecting errors in said N data words stored in said second data buffer by comparing said the contents of said first CRC buffer with the contents of said second CRC buffer, such that in the event said contents are not equal, one or more errors exist in said N data words stored in said second data buffer; detecting if said errors in said N data words stored in said second data buffer may be correctable by comparing the contents of said first XPQ CRC buffer with the contents of said second XPQ CRC buffer, such that if said contents are equal said errors in data stored in said second data buffer may be correctable; creating XPQ imprinter circular queues, comprising the steps of: executing a logical XOR operation between each word comprising said XPQ1 and XPQ1' circular queues to obtain an XPQ1 imprinting queue; executing a logical XOR operation between each word comprising said XPQ2 and XPQ2' circular queues to obtain an XPQ2 imprinting queue; generating an intermediate correction mask comprising the steps of: providing first and second intermediate correction mask buffers having a capacity of N data words; repetitively sequentially writing the contents of said XPQ1 imprinting queue into said first intermediate correction mask buffer, beginning with the first word stored in said XPQ1 imprinting queue and ending with the last word stored in said XPQ1 imprinting queue, until every available location in said first intermediate correction mask buffer is written into; repetitively sequentially writing the contents of said XPQ2 imprinting queue into said second intermediate correction mask buffer, beginning with the first word stored in said XPQ2 imprinting queue and ending with the last word stored in said XPQ2 imprinting queue, until every available location word in said second intermediate correction mask buffer is written into; logically ANDing each corresponding word of said first and second intermediate correction buffers to obtain a single XPQ correction mask; evaluating the contents of said XPQ correction mask to determine if said errors are correctable, including determining if the contents of said XPQ correction mask include more than a single logical one value in any bit column, such that in the event that any of said bit columns contain more than a single logical one, said errors are not correctable; wherein in the event said error is correctable, said errors are corrected by executing a logical XOR operation between each corresponding word of said XPQ correction mask and said second data buffer to generate a corrected data buffer whereby errors are detected and corrected.
Claim 46
Independent Claim
738 words
A method for the detection and correction of errors in digital data, comprising the steps of: providing a source of digital data in the form of successive words of binary information; providing a first data buffer for storing N words; providing at least two XPQ circular queues (XPQ1 and XPQ2) for generating an error correction syndrome, wherein each of said XPQ circular queues has a length which is a prime number, and wherein each of said XPQ circular queues has a length which is unique with respect to other of said XPQ circular queues; providing a first CRC buffer; providing a first XPQ CRC word buffer; sequentially loading each data word of said N data words into said first data buffer, and generating a CRC word stored in said first CRC buffer; executing a logical XOR operation on each of said sequentially loaded N data words in each of said XPQ circular queues, and generating an XPQ CRC word from the words comprising said XPQ circular queues; providing a second data buffer; providing at least two circular queues XPQ1' and XPQ2' for generating an error correction syndrome, wherein said circular queue XPQ1' has a length equal to the length of circular queue XPQ1, and said circular queue XPQ2' has a length equal to the length of circular queue XPQ2 providing a second CRC buffer; providing a second XPQ CRC word buffer; transmitting said N data words stored in said first data buffer to said second data buffer, sequentially loading said N data words into said second data buffer, and generating a second CRC word stored in said second CRC buffer; executing a logical XOR operation on each of said N data words transmitted from said first data buffer to said second data buffer in each of said circular queues XPQ1' and XPQ2', and generating an XPQ CRC word from the words comprising said XPQ' circular queues; detecting errors in said N data words stored in said second data buffer by comparing said the contents of said first CRC buffer with the contents of said second CRC buffer, such that in the event said contents are not equal, one or more errors exist in said N data words stored in said second data buffer; detecting if said errors in said N data words stored in said second data buffer may be correctable by comparing the contents of said first XPQ CRC buffer with the contents of said second XPQ CRC buffer, such that if said contents are equal said errors in data stored in said second data buffer may be correctable; creating XPQ imprinter circular queues, comprising the steps of: executing a logical XOR operation between each word comprising said XPQ1 and XPQ1' circular queues to obtain an XPQ1 imprinting queue; executing a logical XOR operation between each word comprising said XPQ2 and XPQ2' circular queues to obtain an XPQ2 imprinting queue; generating an intermediate correction mask comprising the steps of: providing first and second intermediate correction mask buffers having a capacity of N data words; repetitively sequentially writing the contents of said XPQ1 imprinting queue into said first intermediate correction mask buffer, beginning with the first word stored in said XPQ1 imprinting queue and ending with the last word stored in said XPQ1 imprinting queue, until every available location in said first intermediate correction mask buffer is written into; repetitively sequentially writing the contents of said XPQ2 imprinting queue into said second intermediate correction mask buffer, beginning with the first word stored in said XPQ2 imprinting queue and ending with the last word stored in said XPQ2 imprinting queue, until every available location word in said second intermediate correction mask buffer is written into; logically ANDing each corresponding word of said first and second intermediate correction buffers to obtain a single XPQ correction mask; evaluating the contents of said XPQ correction mask to determine if said errors are correctable, including determining if the contents of said XPQ correction mask include more than a single logical one value in any bit column, such that in the event that any of said bit columns contain more than a single logical one, said errors are not correctable; wherein in the event said error is correctable, said errors are corrected by executing a logical XOR operation between each corresponding word of said XPQ correction mask and said second data buffer to generate a corrected data buffer whereby errors are detected and corrected.
References Cited (Backward Citations)
US3008004A
Cited
US3387261A
Cited
US3439332A
Cited
US4044328A
Cited
US4201976A
Cited
US4205324A
Cited
US4185269A
Cited
US4630272A
Cited
EP1183746A1
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1999-05-14 | 1999-11-13 | 2000-05-14 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2003-05-14 | 2003-11-13 | 2004-05-14 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2007-05-14 | 2007-11-13 | 2008-05-14 | $7700.00 | Window Closed / Lapsed |