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

Data transmission system employing a combination of block encoding and convolution encoding for error protection

Assignee: US Philips Corp
•
Filing: 1986-06-05
•
Granted: 1988-05-24
•
Expires: 2006-06-05
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract A data transmission system for providing error protection of transmitted data words. The less significant bits of a data word are, by means of matrix multiplication, encoded into a first redundant proto-code word and the more significant bits are, by means of further matrix multiplication and delay by different word recurrence intervals encoded in a set of further redundant proto-code words. A composite of the proto-code word is formed by means of a modulo-2-addition of code words, so that for the less significant data bits a block code is realized, while for the more significant data bits a convolutional encoding is realized. In the decoding, the more significant bits of the composite code word are decoded by means of Viterbi decoding, the Viterbi metric being determined from the deviation between the reconstructed contribution of the less significant bits to such code word and the actually received contribution of such bits to such code word.

Inventors

  • 👤 Philippe M. O. A. Piret

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-10-26 12:08
CPC Classifications
H; H03; H03M; H03M13/00; H03M13/35; H03M13/03; H03M13/23

Claims Analysis

Total Claims: 8
Claim 1
Independent Claim 242 words
A transmission system for successive data words each comprising a sequence of bits of successive levels of significance, such transmission system comprising a transmitting station and a receiving station interconnected by a transmission medium, said transmitting station comprising an encoder system for redundantly encoding each of such successive data words with redundancy bits; characterized in that said encoder system comprises: a first encoder which by matrix multiplication encodes a set of less significant bits of each such successive data word into a first proto-code word; a second encoder which by further matrix multiplication encodes the remaining more significant bits of each data word into a set of "n" further proto-code words, such second encoder comprising a plurality of delay elements for imparting respective different delays to said further protor-code words, such delays being in multiples of the recurrence times of the successive data words; and modulo-two adding means connected to said first and second encoders for bitwise adding said first proto-code word and said "n" further proto-code words, such "n" further proto-code words corresponding to "n" different data words, so as to derive a final code word having an extended bit length with respect to the bit length of a data word and which comprises a block code of the less significant bits of a data word and a convolutional code of the more significant bits of such data word, said modulo-two adding means having an output connected to said transmission medium.
Claim 2
Dependent Claim 242 words
A transmission system for successive data words each comprising a sequence of bits of successive levels of significance, such transmission system comprising a transmitting station and a receiving station interconnected by a transmission medium, said transmitting station comprising an encoder system for redundantly encoding each of such successive data words with redundancy bits; characterized in that said encoder system comprises: a first encoder which by matrix multiplication encodes a set of less significant bits of each such successive data word into a first proto-code word; a second encoder which by further matrix multiplication encodes the remaining more significant bits of each data word into a set of "n" further proto-code words, such second encoder comprising a plurality of delay elements for imparting respective different delays to said further protor-code words, such delays being in multiples of the recurrence times of the successive data words; and modulo-two adding means connected to said first and second encoders for bitwise adding said first proto-code word and said "n" further proto-code words, such "n" further proto-code words corresponding to "n" different data words, so as to derive a final code word having an extended bit length with respect to the bit length of a data word and which comprises a block code of the less significant bits of a data word and a convolutional code of the more significant bits of such data word, said modulo-two adding means having an output connected to said transmission medium.
Claim 3
Dependent Claim 188 words
A receiving station for receiving code words from a transmitting station in a system as claimed in claim 1, comprising: Viterbi decoding means for decoding all relevant possible states of more significant bits of the "n" transmitted data words contributing to a received code word; means connected to such decoding means for determining respective deviations between a reconstruction of the contribution of less significant bits to a received code word and the actual contribution of such bits to such received code word; means connected to shch deviation determining means for determining, from said deviations, preferred predecessor states to the actual state of the more significant bits of such received code word; means connected to said predecessor determining means for chaining sequences of such preferred predecessor states up to a length of N such states; means connected to said chaining means for selecting from such sequences an optimum predecessor state of a data word located N data words prior to the data word corresponding to a received code word; and means connected to said selecting means for reconstructing the less significant data bits of such optimum predecessor data word.
Claim 4
Dependent Claim 27 words
A system as claimed in claim 1, wherein n=3, and wherein said delays are respectively zero, one, and two times said recurrence times of successive data words.
Claim 5
Dependent Claim 28 words
A system as claimed in claim 3, wherein the zero delayed further proto-code word is identical to the further proto-code word which is delayed by two recurrence times.
Claim 6
Dependent Claim 33 words
A system as claimed in claim 3, characterized in that the first further proto-code word encoded from any data word is identical to the third further proto-code word encoded from such data word.
Claim 7
Dependent Claim 28 words
A transmitting station for use in a system as claimed in claim 1, characterized in that said more significant bits consist of two data bits per data word.
Claim 8
Dependent Claim 34 words
A transmitting station for use in a system as claimed in claim 1, characterized in that it comprises means for substituting dummy bits in lieu of said less significant bits of a data word.

References Cited (Backward Citations)

US3891959A Cited
US4038636A Cited
US3988677A Cited
US4178550A Cited
US4355392A Cited
US4240156A Cited
US4276646A Cited
US4369512A Cited
US4536878A Cited

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 1991-05-24 1991-11-23 1992-05-24 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 1995-05-24 1995-11-23 1996-05-24 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 1999-05-24 1999-11-23 2000-05-24 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag