Patent US3961311A successfully refreshed from Google Patents.
← Back to Patent Explorer
US3961311A Expired / Lapsed US ⏱️ 0.0 years remaining

Circuit arrangement for correcting slip errors in receiver of cyclic binary codes

Assignee: Italtel SpA
•
Filing: 1974-12-27
•
Granted: 1976-06-01
•
Expires: 1994-12-27
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract A code receiver of a data-transmission system, using regular or abbreviated cyclic codes wherein each n-bit code word consists of k information bits and (n-k) redundancy bits together constituting the coefficients of a complex polynomial which is a multiple of a predetermined generator polynomial, comprises a shift register for the incoming code words with (n+2s) stages. The n central stages of that shift register temporarily store, during each transmission cycle, the n bits of the code word while the last s bits of the immediately preceding word and the first s bits of the immediately following word are stored in respective supplemental stages. A divider, connected to the central section of the shift register, calculates the remainder of a division of the composite polynomial by the generator polynomial and feeds the result to three discriminating networks which ascertain, respectively, whether the remainder (a) is zero, (b) contains bits characteristic of a backward slip by up to s code bits, or (c) contains bits characteristic of a forward slip by up to s code bits. In case (a), the stored code word is read out to a load such as a message decoder. In case (b), the shift register is stepped to perform a compensating forward shift; in case (c) it is stepped in the reverse sense. If the shift results in a zero remainder, the modified code word is read out; otherwise, the shift register is restored and an error signal is generated, this error signal coming also into existence if none of the three discriminating networks has an output.

Inventors

  • 👤 Gustavo Pavoni
  • 👤 Enzo Repossi
  • 👤 Mario Loiudice

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-11-01 07:12
CPC Classifications
H; H04; H04L; H04L1/00; H04L1/004; H04L1/0056; H04L1/0057; H03; H03M; H03M13/00; H03M13/03; H03M13/05; H03M13/13; H03M13/17; H04L1/0045; H04L7/00; H04L7/0054; H04L7/04; H04L7/048

Claims Analysis

Total Claims: 8
Claim 1
Independent Claim 400 words
In a receiver for cyclic binary codes forming n-bit code words with k information bits and (n-k) redundancy bits, the bits of each code word normally constituting the coefficients of a composite polynomial which is a multiple of a predetermined generator polynomial, in combination: a shift register having an input connected to a communication channel carrying an unbroken succession of n-bit code words arriving during consecutive transmission cycles, said shift register including a group of n intermediate stages for the temporary storage of the bits of an incoming code word to be decoded, at least one initial stage upstream of said intermediate stages for the temporary storage of the first bit of an immediately succeeding code word, and at least one terminal stage downstream of said intermediate stages for the temporary storage of the last bit of an immediately preceding code word; a divider with a dividend input connected only to said intermediate stages, a divisor input connected to a source of said generator polynomial, and output means carrying bits of a remainder resulting from the division of said generator polynomial into the composite polynomial defined by said n bits; timing means for enabling the readout to said dividend input, during a predetermined period at the end of every n-bit transmission cycle, of the bits stored in said n intermediate stages; discriminating means connected to said output means for generating a first signal in response to said remainder being zero, a second signal in response to said remainder having values indicative of a backward slip of the stored code word by a number of bit positions not exceeding the number of said initial stages, and a third signal in response to said remainder having values indicative of a forward slip of the stored code word by a number of bit positions not exceeding the number of said terminal stages; gate means connected to said intermediate stages and to said discriminator means for reading out the stored code word to a load in response to said first signal; and stepping means for said shift register connected to said output means for shifting the stored bits forward in response to said second signal and backward in response to said third signal, within said predetermined period, to an extent compensating for the slip indicated by said remainder, thereby enabling the readout of a corrected version of said stored code word to the load.
Claim 2
Dependent Claim 400 words
In a receiver for cyclic binary codes forming n-bit code words with k information bits and (n-k) redundancy bits, the bits of each code word normally constituting the coefficients of a composite polynomial which is a multiple of a predetermined generator polynomial, in combination: a shift register having an input connected to a communication channel carrying an unbroken succession of n-bit code words arriving during consecutive transmission cycles, said shift register including a group of n intermediate stages for the temporary storage of the bits of an incoming code word to be decoded, at least one initial stage upstream of said intermediate stages for the temporary storage of the first bit of an immediately succeeding code word, and at least one terminal stage downstream of said intermediate stages for the temporary storage of the last bit of an immediately preceding code word; a divider with a dividend input connected only to said intermediate stages, a divisor input connected to a source of said generator polynomial, and output means carrying bits of a remainder resulting from the division of said generator polynomial into the composite polynomial defined by said n bits; timing means for enabling the readout to said dividend input, during a predetermined period at the end of every n-bit transmission cycle, of the bits stored in said n intermediate stages; discriminating means connected to said output means for generating a first signal in response to said remainder being zero, a second signal in response to said remainder having values indicative of a backward slip of the stored code word by a number of bit positions not exceeding the number of said initial stages, and a third signal in response to said remainder having values indicative of a forward slip of the stored code word by a number of bit positions not exceeding the number of said terminal stages; gate means connected to said intermediate stages and to said discriminator means for reading out the stored code word to a load in response to said first signal; and stepping means for said shift register connected to said output means for shifting the stored bits forward in response to said second signal and backward in response to said third signal, within said predetermined period, to an extent compensating for the slip indicated by said remainder, thereby enabling the readout of a corrected version of said stored code word to the load.
Claim 3
Dependent Claim 42 words
The combination defined in claim 1, further comprising control means connected between said output means and said stepping means for reversing the shift of the stored bits during said predetermined period in the absence of said first signal following the original shift.
Claim 4
Dependent Claim 28 words
The combination defined in claim 2 wherein said control means includes logical circuitry for emitting an error signal upon simultaneous absence of said first, second and third signals.
Claim 5
Dependent Claim 36 words
The combination defined in claim 2 wherein said control means includes a timing-pulse generator for establishing a verification interval in response to either of said first and second signals for the detection of said first signal.
Claim 6
Dependent Claim 38 words
The combination defined in claim 4, further comprising synchronizing means connected to said channel for establishing a succession of operating cycles for said shift register and said divider, said verification interval being a fraction of said operating cycle.
Claim 7
Dependent Claim 36 words
The combination defined in claim 4 wherein said control means includes a bistable storage circuit for said second and third signals and a gating circuit jointly controlled by said bistable storage circuit and said timing-pulse generator.
Claim 8
Dependent Claim 21 words
The combination defined in claim 1 wherein said output means comprises three decoders respectively generating said first, second and third signals.

References Cited (Backward Citations)

US3394224A Cited
US3466601A Cited
US3550082A Cited
US3571794A Cited
US3562710A Cited
US3648237A Cited
US3596245A Cited
US3733585A Cited

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 1979-06-01 1979-12-01 1980-06-01 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 1983-06-01 1983-12-01 1984-06-01 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 1987-06-01 1987-12-01 1988-06-01 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag