Patent US4453249A successfully refreshed from Google Patents.
US4453249A
Expired / Lapsed
US
⏱️ 0.0 years remaining
System for binary data transmission
Assignee: Alcatel Lucent NV
•
Filing: 1982-02-09
•
Granted: 1984-06-05
•
Expires: 2002-02-09
Abstract
Abstract A binary data transmission system uses a code consisting of n-bit code words of a quasi-cyclic code with k information bits and n-k check bits. An encoder and a decoder with an error-detection and -correction facility are provided which use a quasi-cyclic code that has a high error-correcting capacity and requires little storage space.
Inventors
- 👤 Dieter Roth
- 👤 Herbert Schorb
- 👤 Herbert Kloss
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-04 12:08
CPC Classifications
H; H04; H04L; H04L1/00; H04L1/004; H04L1/0056; H04L1/0057; H04L1/0041; H04L1/0045
Claims Analysis
Total Claims: 22
Claim 1
Independent Claim
292 words
A system for binary data transmission comprising: an encoder including a first k/2-stage shift register means to convert an input binary signal to be transmitted into n-bit code words of a quasi-cyclic code with k information bits, where n and k are different integers greater than one; and a decoder having an error-detection and error-correction arrangement including a second k/2-stage shift register means having an input receiving said n-bit code words of said quasi-cyclic code to calculate from each of said code words a syndrome whose value is used as an address of a location in a read-only memory means having a predetermined number of locations, said read-only memory means delivering from said address location a selected one of first information specifying the position of an erroneous bit in said information bits and second information terminating a correction, a code converter means coupled to said read-only memory means to convert said first information into a k-bit error pattern, modulo-2 adder means coupled to said code converter means and said input to add said error pattern to said information bits to produce corrected information bits, first means coupled to said second shift register, said read-only memory means and said modulo-2 adder means to enable locating and correcting a selected number of errors in said information bits by operating on each new corrected information bits as produced above by said read-only memory means, said code converter and said modulo-2 adder means, and second means coupled to said modulo-2 adder means and said read-only memory means to provide a corrected output signal from which said input binary signal can be derived in response to a selected one of said second information and said corrected information bits after said selected number of errors hav been corrected.
Claim 2
Independent Claim
292 words
A system for binary data transmission comprising: an encoder including a first k/2-stage shift register means to convert an input binary signal to be transmitted into n-bit code words of a quasi-cyclic code with k information bits, where n and k are different integers greater than one; and a decoder having an error-detection and error-correction arrangement including a second k/2-stage shift register means having an input receiving said n-bit code words of said quasi-cyclic code to calculate from each of said code words a syndrome whose value is used as an address of a location in a read-only memory means having a predetermined number of locations, said read-only memory means delivering from said address location a selected one of first information specifying the position of an erroneous bit in said information bits and second information terminating a correction, a code converter means coupled to said read-only memory means to convert said first information into a k-bit error pattern, modulo-2 adder means coupled to said code converter means and said input to add said error pattern to said information bits to produce corrected information bits, first means coupled to said second shift register, said read-only memory means and said modulo-2 adder means to enable locating and correcting a selected number of errors in said information bits by operating on each new corrected information bits as produced above by said read-only memory means, said code converter and said modulo-2 adder means, and second means coupled to said modulo-2 adder means and said read-only memory means to provide a corrected output signal from which said input binary signal can be derived in response to a selected one of said second information and said corrected information bits after said selected number of errors hav been corrected.
Claim 3
Dependent Claim
83 words
A system according to claim 1, wherein said read-only memory means includes a read-only memory having a small number of locations, and an additional shift register coupled between said second shift register and said read-only memory to process said calculated syndrome and produce therefrom said address of said location in said read-only memory which contains said selected one of said first and second information, said first information being converted into said error pattern by said code converter means and said additional shift register.
Claim 4
Dependent Claim
36 words
A system according to claim 2, wherein said quasi-cyclic code is formed by said code words having n equal to 3i bits and k equal to 2i bits, where i is an integer greater than three.
Claim 5
Dependent Claim
52 words
A system according to claim 2, wherein said quasi-cyclic code is formed by said code words having n equal to 36 bits which include k=24 information bits and n-k equal to 12 check bits, and said quasi-cyclic code further includes a redundancy matrix composed of two cyclic submatrixes of the same size.
Claim 6
Dependent Claim
27 words
A system according to claim 2, wherein said decoder is operated at a higher clock rate during a second clock phase than during a first clock phase.
Claim 7
Dependent Claim
14 words
A system according to claim 2, wherein said selected number of errors equal three.
Claim 8
Dependent Claim
36 words
A system according to claim 1, wherein said quasi-cyclic code is formed by said code words having n equal to 3i bits and k equal to 2i bits, where i is an integer greater than three.
Claim 9
Dependent Claim
52 words
A system according to claim 1, wherein said quasi-cyclic code is formed by said code words having n equal to 36 bits which include k=24 information bits and n-k equal to 12 check bits, sand said quasi-cyclic code further includes a redundancy matrix composed of two cyclic submatrixes of the same size.
Claim 10
Dependent Claim
27 words
A system according to claim 1, wherein said decoder is operated at a higher clock rate during a second clock phase than during a first clock phase.
Claim 11
Dependent Claim
14 words
A system according to claim 1, wherein said selected number of errors equal three.
Claim 12
Dependent Claim
270 words
In a system for binary data transmission, a decoder having an error-detection and error-correction arrangement comprising: a k/2-stage shift register means having an input to receive n-bit code words of a quasi-cyclic code with k information bits employed to transmit a binary signal, where n and k are different integers greater than one, said shift register means calculating from each of said code words a syndrome whose value is used as an address of a location in a read-only memory means having a predetermined number of locations, said read-only memory means delivering from said addressed location a selected one of first information specifying the position of an erroneous bit of said information bits and second information terminating a correction; code converter means coupled to said read-only memory means to convert said first information into a k-bit error pattern; modulo-2 adder means coupled to said code converter means and said input to add said error pattern to said information bits to produce corrected information bits; first means coupled to said shift register, said read-only memory means and said modulo-2 adder means to enable locating and correcting a selected number of errors in said information bits by operating on each new corrected information bits as produced above by said read-only memory means, said code converter and said modulo-2 adder means; and second means coupled to said modulo-2 adder means and said read-only memory means to provide a corrected output signal from which said binary signal can be derived in response to a selected one of said second information and said corrected information bits after said selected number of errors have been corrected.
Claim 13
Dependent Claim
270 words
In a system for binary data transmission, a decoder having an error-detection and error-correction arrangement comprising: a k/2-stage shift register means having an input to receive n-bit code words of a quasi-cyclic code with k information bits employed to transmit a binary signal, where n and k are different integers greater than one, said shift register means calculating from each of said code words a syndrome whose value is used as an address of a location in a read-only memory means having a predetermined number of locations, said read-only memory means delivering from said addressed location a selected one of first information specifying the position of an erroneous bit of said information bits and second information terminating a correction; code converter means coupled to said read-only memory means to convert said first information into a k-bit error pattern; modulo-2 adder means coupled to said code converter means and said input to add said error pattern to said information bits to produce corrected information bits; first means coupled to said shift register, said read-only memory means and said modulo-2 adder means to enable locating and correcting a selected number of errors in said information bits by operating on each new corrected information bits as produced above by said read-only memory means, said code converter and said modulo-2 adder means; and second means coupled to said modulo-2 adder means and said read-only memory means to provide a corrected output signal from which said binary signal can be derived in response to a selected one of said second information and said corrected information bits after said selected number of errors have been corrected.
Claim 14
Dependent Claim
82 words
A decoder according to claim 11, wherein said read-only memory means includes a read-only memory having a small number of locations, and an additional shift register coupled between said shift register and said read-only memory to process said calculated syndrome and produce therefrom said address of said location in said read-only memory which contains said selected one of said first and second information, said first information being converted into said error pattern by said code converter means and said additional shift register.
Claim 15
Dependent Claim
36 words
A decoder according to claim 12, wherein said quasi-cyclic code is formed by said code words having n equal to 3i bits and k equal to 2i bits, where i is an integer greater than three.
Claim 16
Dependent Claim
52 words
A decoder according to claim 12, wherein said quasi-cyclic code is formed by said code words having n equal to 36 bits which include k=24 information bits and n-k equal to 12 check bits, and said quasi-cyclic code further includes a redundancy matrix composed of two cyclic submatrixes of the same size.
Claim 17
Dependent Claim
27 words
A decoder according to claim 12, wherein said decoder is operated at a higher clock rate during a second clock phase than during a first clock phase.
Claim 18
Dependent Claim
14 words
A decoder according to claim 12, wherein said selected number of errors equal three.
Claim 19
Dependent Claim
36 words
A decoder according to claim 11, wherein said quasi-cyclic code is formed by said code words having n equal to 3i bits and k equal to 2i bits, where i is an integer greater than three.
Claim 20
Dependent Claim
52 words
A decoder according to claim 11, wherein said quasi-cyclic code is formed by said code words having n equal to 36 bits which include k=24 information bits and n-k equal to 12 check bits, and said quasi-cyclic code further includes a redundancy matrix composed of two cyclic submatrixes of the same size.
Claim 21
Dependent Claim
27 words
A decoder according to claim 11, wherein said decoder is operated at a higher clock rate during a second clock phase than during a first clock phase.
Claim 22
Dependent Claim
14 words
A decoder according to claim 11, wherein said selected number of errors equal three.
References Cited (Backward Citations)
No citation records indexed.
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1987-06-05 | 1987-12-05 | 1988-06-05 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1991-06-05 | 1991-12-05 | 1992-06-05 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 1995-06-05 | 1995-12-05 | 1996-06-05 | $7700.00 | Window Closed / Lapsed |