← Back to Patent Explorer
US5446747A Expired / Lapsed US ⏱️ 0.0 years remaining

Error-correction coding method with at least two systematic convolutional codings in parallel, corresponding iterative decoding method, decoding module and decoder

Assignee: Orange SA
•
Filing: 1992-04-16
•
Granted: 1995-08-29
•
Expires: 2012-04-16
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract An error-correction method for the coding of source digital data elements to be transmitted or broadcast, notably in the presence of high transmission noise, the method comprising at least two independent steps of systematic convolutional coding, each of the coding steps taking account of all of the source data elements, the method comprising at least one step for the temporal interleaving of the source data elements, modifying the order in which the source data elements are taken into account for each of the coding steps, and a corresponding iterative decoding method using, for the decoding, at each iteration, an intermediate data element obtained by the combination of the received data element with a data element estimated during the previous iteration.

Inventors

  • 👤 Claude Berrou

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-11-06 20:08
CPC Classifications
H; H04; H04L; H04L1/00; H04L1/004; H04L1/0056; H04L1/0064; H04L1/0066; H03; H03M; H03M13/00; H03M13/03; H03M13/23; H03M13/27; H03M13/29; H03M13/2957; H03M13/2978; H03M13/2987; H03M13/37; H03M13/39; H03M13/63; H03M13/635; H03M13/6362; H03M13/65; H03M13/6577; H03M13/658; H04L1/0045; H04L1/0047; H04L1/005; H04L1/0067; H04L1/0068; H04L1/0071

Claims Analysis

Total Claims: 24
Claim 1
Independent Claim 80 words
A method for error-correction coding of source digital data elements, comprising the steps of: implementing at least two independent and parallel steps of systematic convolutional coding, each of said coding steps taking account of all of said source data elements and providing parallel outputs of distinct series of coded data elements; and temporally interleaving said source data elements to modify the order in which said source data elements are taken into account for at least one of said coding steps.
Claim 2
Independent Claim 80 words
A method for error-correction coding of source digital data elements, comprising the steps of: implementing at least two independent and parallel steps of systematic convolutional coding, each of said coding steps taking account of all of said source data elements and providing parallel outputs of distinct series of coded data elements; and temporally interleaving said source data elements to modify the order in which said source data elements are taken into account for at least one of said coding steps.
Claim 3
Dependent Claim 34 words
A method according to claim 1, comprising a step of systematically eliminating, at predetermined instants of transmission, at least one coded data element of at least one of said series of coded data elements.
Claim 4
Dependent Claim 40 words
A method according to claim 2, wherein said elimination step consists of periodically switching among said parallel outputs by which, at each transmission instant, a single coded data element is selected from among the distinct series of coded data elements.
Claim 5
Dependent Claim 55 words
A method according to claim 1, wherein each of said temporal interleaving steps is followed by a delaying step, said delaying step assigning, to each of said source data elements coming from said temporal interleaving step, a delay equal to a time of latency for coding the data elements coded by said first coding step.
Claim 6
Dependent Claim 33 words
A method according to claim 1, wherein said temporal interleaving step implements at least one interleaving matrix in which said source data elements are recorded in successive rows and read in successive rows.
Claim 7
Dependent Claim 30 words
A method according to claim 5 wherein, at writing, two successive source data are written in between two rows selected according to an increment which is strictly greater than 1.
Claim 8
Dependent Claim 23 words
A method according to claim 6, wherein said increment between two rows is a function of the position of the column during writing.
Claim 9
Dependent Claim 29 words
A method according to claim 5 wherein, at reading, two successive source data are read in two columns selected according to an increment which is strictly greater than 1.
Claim 10
Dependent Claim 23 words
A method according to claim 8, wherein said increment between two columns is a function of the position of the row during reading.
Claim 11
Dependent Claim 114 words
A method for decoding received digital data elements representing source data elements coded according to the coding method of claim 1, wherein said decoding method comprises an iterative decoding procedure comprising the steps of: in a first iteration, combining each of said received digital data elements with a predetermined value to form an intermediate data element, decoding the intermediate data element representing each received data element to produce a decoded data element, estimating said source data element, by means of said decoded data element, to produce an estimated data element, and for all subsequent iterations, combining each of said received data elements with one of said estimated data elements estimated during a preceding iteration.
Claim 12
Dependent Claim 28 words
A method according to claim 10, wherein said estimating step assigns to said estimated data element an additive noise decorrelated from noise assigned to said received data element.
Claim 13
Dependent Claim 49 words
A method according to claim 10, wherein said predetermined value has a zero weight, having no effect on said decoding, and said combinations are, for iterations other than the first one, summations of said received data element and of the estimated data element estimated in the immediately preceding iteration.
Claim 14
Dependent Claim 65 words
A method according to claim 10, applied to decoding of data coded according to a method carrying out a joint transmission of source data elements and coded redundancy data elements, wherein said decoding step takes account of all the received data elements, source data elements and coded data elements, and wherein said estimation step is applied solely to the estimation of said source data elements.
Claim 15
Dependent Claim 25 words
A method according to claim 10, wherein said decoding step or steps implement maximum likelihood decoding algorithms of the Viterbi algorithm type with weighted decisions.
Claim 16
Dependent Claim 37 words
A method according to claim 10, including a demultiplexing step directing the received coded data elements towards said appropriate decoding steps and transmitting zero values at the decoding steps for which no data element has been transmitted.
Claim 17
Dependent Claim 230 words
A method according to claim 10, of the type carrying out the decoding of a first and a second series of received data elements representing source data coded according to a coding method implementing two redundant coding steps in parallel, the first coding step carrying out a first redundant coding on all the source data taken in natural order and the second coding step carrying out a second redundant coding on all the source data taken in an order modified by a temporal interleaving step to produce two distinct series of coded data elements, wherein said decoding method comprises the consecutive steps of: first decoding according to said first redundant coding the first series of received data elements taken together with at least one of said intermediate data elements to produce a series of first decoded data elements; temporally interleaving, identical to said interleaving step of the coding method, said first decoded data elements to form a series of decoded de-interleaved data elements; second decoding according to said second redundant coding said decoded de-interleaved data elements and the second series of received data elements to produce a series of second decoded data elements; estimating the source data from at least one of said series of first and second decoded data elements to produce a series of estimated data elements; and de-interleaving, symmetrical to said interleaving step, said estimated data elements.
Claim 18
Dependent Claim 53 words
A method according to claim 16, wherein said estimating step consists in determining the variable (d 2 ·(X 1 )-(X 2 ))/(d 2 -1) where: d 2 is the free distance of said second redundant coding; X 1 and X 2 are the data elements decoded by said first and second decoding steps.
Claim 19
Independent Claim 21 words
A method according to claims 16, wherein said estimation step is followed, before said de-interleaving step, by a logarithmic compression step.
Claim 20
Dependent Claim 28 words
A method according to claim 16, wherein said first decoding step is followed by a step of subtracting, from said first decoded data element, said estimated data element.
Claim 21
Dependent Claim 35 words
A method according to claim 16, wherein said first decoding step is followed by a step for the multiplication of said first decoded data element by a coefficient β that is strictly greater than 1.
Claim 22
Dependent Claim 22 words
A method according to claim 20, wherein said coefficient β varies as a function of a signal-to-noise ratio of a transmission channel.
Claim 23
Dependent Claim 224 words
A decoding module for carrying out an iteration of a decoding procedure comprising at least two inputs, corresponding to at least one received data element and to at least one estimated data element, and at least two outputs corresponding to at least one decoded data element and to at least one estimated data element, wherein said module is capable of being cascaded with at least one other identical module, each module comprising: means for summation of the inputs corresponding to said received data element and to said estimated data element; first decoding means for decoding of data elements coded according to a first redundant coding, taking account of the data elements coming from said summation means; first interleaving means for interleaving the data elements coming from said first decoding means; second decoding means for decoding data coded according to a second redundant coding; means for estimating said received data element or elements; first de-interleaving means for de-interleaving the data elements coming from said estimation means; second de-interleaving means for de-interleaving the data elements coming from said second decoding means, delivering the data elements decoded in their original order; and delay means designed to compensate for latencies of the decoding means, interlacing means and de-interlacing means so that all the data elements coming from said module correspond to one and the same instant of reception.
Claim 24
Dependent Claim 224 words
A decoding module for carrying out an iteration of a decoding procedure comprising at least two inputs, corresponding to at least one received data element and to at least one estimated data element, and at least two outputs corresponding to at least one decoded data element and to at least one estimated data element, wherein said module is capable of being cascaded with at least one other identical module, each module comprising: means for summation of the inputs corresponding to said received data element and to said estimated data element; first decoding means for decoding of data elements coded according to a first redundant coding, taking account of the data elements coming from said summation means; first interleaving means for interleaving the data elements coming from said first decoding means; second decoding means for decoding data coded according to a second redundant coding; means for estimating said received data element or elements; first de-interleaving means for de-interleaving the data elements coming from said estimation means; second de-interleaving means for de-interleaving the data elements coming from said second decoding means, delivering the data elements decoded in their original order; and delay means designed to compensate for latencies of the decoding means, interlacing means and de-interlacing means so that all the data elements coming from said module correspond to one and the same instant of reception.

References Cited (Backward Citations)

US3652998A Cited
US4677626A Cited
US4677625A Cited
EP0235477A1 Cited
FR2616986A1 Cited
US4881241A Cited
US5077741A Cited
US5157671A Cited
US5263051A Cited
US5289501A Cited
US5287374A Cited

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 1998-08-28 1999-02-27 1999-08-29 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 2002-08-28 2003-02-27 2003-08-29 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 2006-08-28 2007-02-27 2007-08-29 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag