Encoding method and device, decoding method and device, and systems using them

Abstract

In order to encode an original sequence of binary data (u), a first padding operation (508) is performed, supplementing the original sequence (u) so that the supplemented sequence (u) is divisible by a first divisor polynomial; a first recursive convolutional encoding operation (508) is performed, using the first divisor polynomial, encoding the supplemented original sequence (u); an interleaving operation (506) is performed, permuting the binary data in the original sequence (u) by means of a specific permutation, so as to obtain an interleaved sequence (u*); a second padding operation (510) is performed, supplementing the interleaved sequence (u*) so that the supplemented interleaved sequence (u*) is divisible by a second divisor polynomial (g2); and a second recursive convolutional encoding operation (510) is performed, using the second divisor polynomial, encoding the supplemented interleaved sequence (u*).

Description

[0001] The present invention relates to an encoding method and device, a decoding method and device, and systems using them.

[0002] In general terms, the present invention implements a specific use of binary elements (bits) referred to as padding bits in convolutional parallel turbocodes with interleavers preserving divisibility.

[0003] Conventionally, a turbo-encoder consists of three essential parts: two elementary systematic recursive convolutional encoders and one interleaver.

[0004] The associated decoder consists of the two elementary decoders with so-called soft inputs and outputs corresponding to the convolutional encoders, an interleaver and its reverse interleaver (also referred to as a “deinterleaver”).

[0005] A description of turbocodes will be found in the article “Near Shannon limit error-correcting coding and decoding: turbo codes” corresponding to the presentation given by C. Berrou, A. Glavieux and P. Thitimajshima during the ICC conference in Geneva in May 1993.

[0006] Since the encoders are systematic recursive encoders, the problem which is often found is the one of the return to zero of the encoders.

[0007] In the prior art various ways of dealing with this problem are found, notably:

[0008] 1. Absence of return to zero: the encoders are initialised to the null state and they are left to move towards any state without intervening.

[0009] 2. Return to zero of the first encoder: the encoders are initialized to the null state and padding bits are added in order to impose a null final state solely on the first encoder.

[0010] 3. “Frame Oriented Convolutional Turbo Codes” (FOCTC): the first encoder is initialised and the final state of the first encoder is taken as the initial state of the second encoder. When a class of interleavers having certain properties is used, the final state of the second encoder is null. In this regard reference can usefully be made to the article by C. Berrou and M. Jézéquel entitled “Frame oriented convolutional turbo-codes”, in Electronics Letters, Vol. 32, No. 15, Jul. 18, 1996, pages 1362 to 1364, Stevenage, Herts, Great Britain.

[0011] 4. Independent return to zero of the two encoders: the encoders are initialised to the null state and padding bits are added independently to each of the sequences entering the encoders. A general description of independent return to zero of encoders is given in the report by D. Divsalar and F. Pollara entitled “TDA progress report 42-123 On the design of turbo codes”, published in November 1995 by JPL (Jet Propulsion Laboratory).

[0012] 5. Intrinsic return to zero of the two encoders: the encoders are initialised to the null state and padding bits are added to the sequence entering the first encoder. When use is made of an interleaver guaranteeing return to zero as disclosed in the patent document FR-A-2 773 287 and the sequence comprising the padding bits is interleaved, the second encoder automatically has a final null state.

[0013] For each of the solutions of the prior art mentioned above, there exists an adapted trellis termination applying to the corresponding decoders. These decoders take into account the termination or not of the trellis, as well as the fact that, where applicable, each of the two encoders uses the same padding bits.

[0014] Solutions 1 and 2 generally offer less good performance than solutions 3 to 5.

[0015] However, solutions 3 to 5 also have drawbacks.

[0016] Solution 3 limits the choice of interleavers, which may reduce the performance or unnecessarily complicate the design of the interleaver.

[0017] When the size of the interleaver is small, solution 4 has less good performance than solution 5.

[0018] As for solution 5, it requires the determination of the padding bits before the second encoder can commence encoding.

[0019] Thus the prior art does not resolve the problem consisting:

[0020] during encoding, of resetting the encoders to zero, and

[0021] during decoding, terminating the trellises used in the decoders,

[0022] whilst keeping good performance even if the size of the interleaver is small, and

[0023] whilst enabling the second encoder to commence encoding before the first encoder has determined the padding bits.

[0024] Moreover, in certain cases, it may be wished to use different types of interleavers according to the size of the blocks which it is wished to encode, whilst keeping a compatible turbo-encoder or turbodecoder architecture with independent trellis terminations and having good performance overall, notably for small block sizes.

[0025] The purpose of the present invention is to remedy the aforementioned drawbacks.

[0026] For this purpose, the present invention proposes a method for encoding at least one sequence of original binary data, according to which:

[0027] at least one first padding operation is performed, consisting of supplementing the original sequence with a first sequence of padding binary data chosen so that the original sequence, supplemented by the first padding sequence, is divisible by a first divisor polynomial;

[0028] at least one first recursive convolutional encoding operation is performed, consisting of encoding the original sequence, supplemented by the first padding sequence, by means of an encoding technique using the first divisor polynomial;

[0029] at least one interleaving operation is performed, consisting of permuting the binary data of the original sequence by means of a specific permutation, so as to obtain an interleaved sequence;

[0030] this encoding method being remarkable in that:

[0031] the specific permutation is, in a representation where the binary data of the original sequence are written and read, row by row, in an array with N0 columns and M rows, where N0 is the smallest integer such that the first divisor polynomial divides the polynomial xN0+1 and M is a positive integer, the resultant:

[0032] of an intercolumn permutation which transforms the cyclic code of length N0 whose generator polynomial is the first divisor polynomial into a cyclic code whose generator polynomial is a second divisor polynomial, the intercolumn permutation permuting with each other the N0 columns of the array representing the original sequence, and

[0033] any number of intracolumn elementary permutations, each of these elementary permutations being any permutation of the symbols in a column of the aforementioned array; and in that:

[0034] at least one second padding operation is performed, consisting of supplementing the interleaved sequence with a second sequence of padding binary data, chosen so that the interleaved sequence, supplemented by the second padding sequence, is divisible by the second divisor polynomial; and

[0035] at least one second recursive convolutional encoding operation is performed, consisting of encoding the interleaved sequence, supplemented by the second padding sequence, by means of an encoding technique using the second divisor polynomial.

[0036] Thus, for a given block size:

[0037] the two encoders are initialised to a null state;

[0038] for the input sequence use is made solely of an interleaver preserving the divisibility by the divisor polynomials of the two encoders; and

[0039] padding bits are added independently to each of the sequences in order to reset to zero each of the encoders.

[0040] Thus good performance on decoding is obtained. This makes it possible notably to use, during decoding, the relationships existing between the padding bits.

[0041] According to a particular characteristic, the binary data of the second padding sequence are determined solely from knowledge of the binary data of the first padding sequence.

[0042] This characteristic enables to simplify the encoding.

[0043] In a first embodiment, it is possible to determine the binary data of the second padding sequence from a previously established conversion table giving the second padding sequence as a function of the first padding sequence.

[0044] This enables to simplify the encoding.

[0045] In a second embodiment, it is possible to determine the binary data of the second padding sequence instantly as a function of the binary data of the first padding sequence.

[0046] This confers great flexibility of use on the invention.

[0047] According to a particular characteristic, in order to construct the second padding sequence from the first padding sequence having a number of data equal to the degree of the first divisor polynomial:

[0048] the first padding sequence is supplemented with zeros, so as to obtain a sequence with a length equal to N0;

[0049] the binary data in the first padding sequence are permuted by means of the intercolumn permutation, so as to obtain a first interleaved padding sequence;

[0050] the residue of the polynomial division of the first interleaved padding sequence by the second divisor polynomial is determined; and

[0051] the aforementioned residue is chosen as the second padding sequence.

[0052] This method makes it possible to instantly calculate the second padding sequence as a function of the first padding sequence. This also makes it possible to construct a conversion table in advance as a function of the first padding sequence. This can also be used in a decoding method in order to establish systems of equations connecting the padding bits.

[0053] According to a particular characteristic, the first divisor polynomial and the second divisor polynomial are identical.

[0054] This enables to simplify the encoding.

[0055] According to a particular characteristic, when the intercolumn permutation is the identity permutation, the second padding sequence is determined as being equal to the first padding sequence.

[0056] This enables to simplify the encoding.

[0057] In a particular embodiment, at least one of the padding sequences is punctured.

[0058] This makes it possible to increase the code efficiency, with a very low loss of performance.

[0059] Advantageously, at least one of the padding sequences is punctured so that the coded sequence includes part of the first and second padding sequences which remains representative of all the first and second padding sequences.

[0060] This characteristic makes it possible to keep good performances.

[0061] According to a particular characteristic, the first padding sequence is fully punctured.

[0062] According to one particular characteristic, the second padding sequence is fully punctured.

[0063] The above two characteristics have the advantage of having great simplicity.

[0064] For the same purpose as before, the present invention also proposes a device for encoding at least one sequence of original binary data, having:

[0065] at least one first padding module, for supplementing the original sequence with a first sequence of padding binary data chosen so that the original sequence, supplemented by the first padding sequence, is divisible by a first divisor polynomial;

[0066] at least one first recursive convolutional encoding module, for encoding the original sequence, supplemented by the first padding sequence, by means of an encoding technique using the first divisor polynomial;

[0067] at least one first interleaving module, for permuting the binary data in the original sequence by means of a specific permutation, so as to obtain an interleaved sequence;

[0068] this encoding device being remarkable in that:

[0069] the specific permutation is, in a representation where the binary data in the original sequence are written and read, row by row, in an array with N0 columns and M rows, where N0 is the smallest integer such that the first divisor polynomial divides the polynomial SN0+1 and M is a positive integer, the resultant:

[0070] of an intercolumn permutation which transforms the cyclic code of length N0 whose generator polynomial is the first divisor polynomial into a cyclic code whose generator polynomial is a second divisor polynomial, the intercolumn permutation permuting with each other the N0 columns of the array representing the original sequence, and

[0071] any number of intracolumn elementary permutations, each of these elementary permutations being any permutation of the symbols in a column of the aforementioned array; and in that the device also has:

[0072] at least one second padding module, for supplementing the interleaved sequence with a second sequence of padding binary data, chosen so that the interleaved sequence, supplemented by the second padding sequence, is divisible by the second divisor polynomial; and

[0073] at least one second recursive convolutional encoding module, for encoding the interleaved sequence, supplemented by the second padding sequence, by means of an encoding technique using the second divisor polynomial.

[0074] The particular characteristics and the advantages of the encoding device being the same as those of the encoding method according to the invention, they are not repeated here.

[0075] Still for the same purpose, the present invention also proposes a method of decoding at least one original symbol sequence, remarkable in that the original symbol sequence represents a binary sequence encoded by means of an encoding method such as the one above.

[0076] Thus a turbodecoder similar to a turbodecoder adapted to deal with encoders with independent return to zero, but using the general relationships between the two padding sequences, in order to obtain, at each iteration, a priori information on each of these two sequences, is considered.

[0077] According to a particular characteristic, the decoding method uses decoding operations with soft inputs and soft outputs.

[0078] The above decoding method has the general advantages peculiar to the turbodecoding methods with a code offering good performance.

[0079] According to a particular characteristic, there is effected iteratively:

[0080] at least one first elementary operation of decoding a recursive convolutional code, consisting of decoding a first sub-sequence of the original symbol sequence by means of a decoding technique using the first divisor polynomial and taking at least into account a first sequence of binary data which is a function of the first and second padding sequences.

[0081] According to a particular characteristic, the first sequence of binary data is determined using a previously established equation system giving the first sequence of binary data as a function of the first and second padding sequences.

[0082] By virtue of the above characteristics, the padding bits participate fully in the iterative decoding process. They are also well protected, or even better protected, than the other bits. Thus the performance of the turbodecoding is improved.

[0083] In a variant, the first sequence of binary data is determined using a system of equations established instantly and giving the first sequence of binary data as a function of the first and second padding sequences.

[0084] This variant confers simplicity and speed on the decoding.

[0085] According to a particular characteristic, there is also effected iteratively:

[0086] at least one second elementary operation of decoding a recursive convolutional code, consisting of decoding a second sub-sequence of the original symbol sequence by means of a decoding technique using the second divisor polynomial and taking at least into account a second sequence of binary data which is a function of the first and second padding sequences.

[0087] According to a particular characteristic, the second sequence of binary data is determined using a system of previously established equations giving the second sequence of binary data as a function of the first and second padding sequences.

[0088] As a variant, the second binary data sequence is determined using a system of equations established instantly and giving the second sequence of binary data as a function of the first and second padding sequences.

[0089] According to a particular characteristic, there is also effected iteratively:

[0090] at least one operation of interleaving a sequence representing the original sequence;

[0091] and:

[0092] during the first elementary decoding operation, at least one first extrinsic information sequence is determined, and

[0093] in parallel to the interleaving operation, a first calculation operation is effected, consisting of calculating a first a priori information sequence as a function of the first extrinsic information sequence, the first a priori information sequence being taken into account during the second elementary decoding operation.

[0094] The above characteristics have the same advantages as those mentioned in relation to the first elementary decoding operation and the determination of the first sequence of binary data.

[0095] According to a particular characteristic, the first a priori information sequence is determined using a system of previously established equations giving the first a priori information sequence as a function of the first extrinsic information sequence.

[0096] As a variant, the first a priori information sequence is determined using a system of equations established instantly and giving the first a priori information sequence as a function of the first extrinsic information system.

[0097] According to a particular characteristic, there is also effected iteratively:

[0098] at least one operation of deinterleaving a sequence representing the interleaved original sequence;

[0099] and:

[0100] during the second elementary decoding operation, at least one second extrinsic information sequence is determined, and

[0101] in parallel to the deinterleaving operation, a second calculation operation is performed, consisting of calculating a second a priori information sequence as a function of the second extrinsic information sequence, the second a priori information sequence being taken into account during the first elementary decoding operation.

[0102] According to a particular characteristic, the second a priori information sequence is determined using a system of previously established equations giving the second a priori information sequence as a function of the second extrinsic information sequence.

[0103] As a variant, the second a priori information sequence is determined using a system of equations established instantly and giving the second a priori information sequence as a function of the second extrinsic information sequence.

[0104] According to a particular characteristic, the first padding sequence having been fully punctured at the time of encoding, the second binary data sequence taken into account during the second elementary decoding operation is identical to the second padding sequence.

[0105] According to a particular characteristic, the second padding sequence having been fully punctured at the time of encoding, the first binary data sequence taken into account during the first elementary decoding operation is identical to the first padding sequence.

[0106] For the same purpose as before, the present invention also proposes a device for decoding at least one original symbol sequence, remarkable in that the original symbol sequence represents a binary sequence encoded by means of an encoding device such as the one above.

[0107] The particular characteristics and the advantages of the decoding device being the same as those of the decoding method according to the invention, they are not repeated here.

[0108] The present invention also relates to a digital signal processing apparatus, having means adapted to implement an encoding method and/or a decoding method such as the ones above.

[0109] The present invention also relates to a digital signal processing apparatus, having an encoding device and/or a decoding device such as the ones above.

[0110] The present invention also relates to a telecommunications network, having means adapted to implement an encoding method and/or a decoding method such as the ones above.

[0111] The present invention also relates to a telecommunications network, having an encoding device and/or a decoding device such as the ones above.

[0112] The present invention also relates to a mobile station in a telecommunications network, having means adapted to implement an encoding method and/or a decoding method such as the ones above.

[0113] The present invention also relates to a mobile station in a telecommunications network, having an encoding device and/or a decoding device such as the ones above.

[0114] The present invention also relates to a device for processing signals representing speech, having an encoding device and/or a decoding device such as the ones above.

[0115] The present invention also relates to a data transmission device having a transmitter adapted to implement a packet transmission protocol, having an encoding device and/or a decoding device and/or a device for processing signals representing speech such as the ones above.

[0116] According to a particular characteristic of the data transmission device, the packet transmission protocol is of the ATM (“Asynchronous Transfer Mode”) type.

[0117] As a variant, the packet transmission protocol is of the IP (transmission protocol used on the Internet, “Internet Protocol”) type.

[0118] The invention also relates to:

[0119] an information storage means which can be read by a computer or a microprocessor storing instructions of a computer program, for implementing the encoding method and/or the decoding method of the invention such as the ones above, and

[0120] an information storage means which is removable, partially or totally, which can be read by a computer or microprocessor storing instructions of a computer program, allowing the implementation of the encoding method and/or the decoding method of the invention such as the ones above.

[0121] The invention also relates to a computer program containing instruction sequences for implementing an encoding and/or decoding method such as the ones above.

[0122] The particular characteristics and the advantages of the different digital signal processing apparatus, the different telecommunications networks, the different mobile stations, the device for processing signals representing speech, the data transmission device, the information storage means and the computer program being the same as those of the encoding and decoding methods and devices according to the invention, they are not repeated here.

[0123] Other aspects and advantages of the invention will emerge from a reading of the following detailed description of particular embodiments, given by way of non-limitative examples. The description refers to the drawings which accompany it, in which:

[0124] FIG. 1 depicts schematically an electronic device including an encoding device according to the present invention, in a particular embodiment;

[0125] FIG. 2 depicts schematically, in the form of a block diagram, an encoding device corresponding to a parallel convolutional turbocode, according to the present invention, in a particular embodiment;

[0126] FIG. 3 depicts schematically an electronic device including a decoding device according to the present invention, in a particular embodiment;

[0127] FIG. 4 depicts schematically, in the form of a block diagram, a decoding device corresponding to a parallel convolutional turbocode, according to the present invention, in a particular embodiment;

[0128] FIG. 5 is a flow diagram depicting schematically the functioning of an encoding device such as the one included in the electronic device of FIG. 1, in a particular embodiment;

[0129] FIG. 6 is a flow diagram depicting schematically decoding operations implemented by a decoding device such as the one included in the electronic device of FIG. 3, in accordance with the present invention, in a particular embodiment;

[0130] FIG. 7 is a flow diagram depicting schematically a turbodecoding operation included in the flow diagram of FIG. 6, in a particular embodiment of the present invention; and

[0131] FIG. 8 depicts schematically an encoding device corresponding to a convolutional turbocode including several inputs, according to a variant embodiment of the present invention.

[0132] In general terms, a turbo-encoder of the type appearing in the invention, having an efficiency of ⅓, can be considered to be a pair of convolutional recursive encoders using divisor polynomials. The first encoder produces a check sequence using a sequence of symbols to be coded u and the second encoder produces a check sequence from an interleaved sequence u* obtained by interleaving the sequence u.

[0133] Let g1(x) be the divisor polynomial of the first encoder.

[0134] Let m be the degree of the polynomial g1(x) and N0 the smallest integer such that g1(x) is a divisor of the polynomial xN0+1. This number N0 is referred to as the “period” of g1(x).

[0135] Let g2(x) be the divisor polynomial of the second encoder.

[0136] g1(x) and g2(x) have the following property: if 1$g_1\left(x\right)=\prod _i\left(x-x_i\right)$

[0137] is the complete factorisation of g1(x) in an extension field of the two-element field, then the complete factorisation of g2(x) is 2$a_1\left(x\right)=u\left(x\right)+\sum _{i=0}^{m-1}{p}_1{x}^{i+n}$

[0138] where φ is an automorphism (denoted exponentially) of said extension field. Hereinafter, such a polynomial g2(x) will be said to be compatible with g1(x). In particular, a polynomial is always compatible with itself. It will be noted that two compatible polynomials have the same degree and the same period.

[0139] Consider for example the factorisation g1(x)=(x−α)(x−α2)(x−α4) of g1(x) =x3+x+1 where α is a seventh primitive root of the unit and belongs to the field containing eight elements. Consider the six automorphisms φi: α→αi of this eight-element field. It is verified that φ1, φ2 and φ4 produce g2(x)=g1(x) whilst φ3, φ6 and φ5 produce g2(x)=x3+x2+1, which is factorised as g2(x)=(x−α3)(x− α6) (x−α5).

[0140] Hereinafter, it is assumed that g1(x)=g2(x). By convention, g1(x) and g2(x) will be denoted g(x).

[0141] Let n be a multiple of N0: n=M.N0, M being an integer.

[0142] The first encoder produces padding bits guaranteeing its return to zero and a check sequence from a sequence of binary information symbols to be coded u of length n.

[0143] The sequence of symbols u has a polynomial representation u(x), of degree n−1, with binary coefficients.

[0144] Thus the first encoder encodes a sequence a1(x)=u(x)+ 3$g_2\left(x\right)\mathrm{is}\prod _i\left(x-x_i^{\phi }\right)$

[0145] as a sequence v1(x)=a1(x).h1(x)/g(x) where:

[0146] h1(x) and g(x) are two polynomials prime with each other, and

[0147] the m binary symbols p1i (padding bits) are chosen so that a1(x) is a multiple of g(x).

[0148] In addition, the sequence u(x) is interleaved in a sequence u*(x) by means of a permutation preserving the divisibility by g(x).

[0149] These permutations are, in a representation where the binary data of the sequence u are written and read, row by row, in an array with N0 columns and M rows, N0 being the smallest integer such that the divisor polynomial g(x) divides xN0+1, the resultant:

[0150] of an intercolumn permutation, automorphism of the cyclic code of length N0 and generator polynomial g(x), which acts by permutation on the N0 columns in the array representing ai,

[0151] and any number of intracolumn elementary permutations, each of these permutations being any permutation of the symbols in a column in said array.

[0152] The second encoder encodes a sequence a2(x)=u*(x)+ 4$a_2\left(x\right)=u^{*}\left(x\right)+\sum _{i=0}^{m-1}{p}_{2,}{x}^{i+n}$

[0153] as a sequence v2(x)=a2(x).h2(x)/g(x) where:

[0154] h2(x) and g(x) are two polynomials prime with each other, and

[0155] the m binary symbols p2i (padding bits) are chosen so that a2(x) is a multiple of g(x).

[0156] Overall, the turbo-encoder produces the sequences u, p1 (= 5$\left(=\sum _{i=0}^{m-1}{p}_1,x^{\prime }\right),{\underset{\_}{p}}_2\left(=\sum _{i=0}^{m-1}{p}_2,x^{\prime }\right),$

[0157] v1 and v2 which will be transmitted over a channel.

[0158] It is then noted that the padding bits are connected together by a linear equation which depends only on the interleaver and, more precisely, only on the resultant permutation which permutes the N0 columns in the array describing this interleaver.

[0159] By way of illustration, a divisor polynomial g(x) equal to 1+x2+x3 is considered below. Its period, N0, is equal to 7.

[0160] A sequence to be encoded of 147 bits (n=147) and polynomials h1(x) and h2(x) both equal to 1+x+x3, are considered.

[0161] As a variant, it is possibly to partly puncture the padding sequences, since there exist linear relationships between the two padding sequences.

[0162] Under these conditions, an interleaver preserving divisibility by g(x) must have a size which is a multiple of 7; if the data are written row by row in a 7-column array, it is possible to permute these data within each column in any manner and to permute the columns with each other according to certain conditions preserving divisibility by g(x), before reading the permuted data row by row.

[0163] Numbering the columns in an increasing order from 0 to 6, the permutation which causes the column of rank bo to pass to rank b1, the column of rank b1 to rank b2, . . . and the column of rank bk to rank b0, is denoted (b0, b1, . . . , bk).

[0164] The composite of two permutations (c0, c1, . . . , ck) and (d0, d1, . . . , dk′) is denoted (c0, c1, . . . , ck)(d0, d1, . . . , dk′).

[0165] Table T which follows gives a list of the 168 intercolumn permutations which preserve divisibility by g(x).

	TABLE T
	Identity	(1 2 4) (3 6 5)	(1 4 2) (3 5 6)
	(0 1 2 3 4 5 6)	(0 2 6) (1 4 3)	(0 4 6) (3 2 5)
	(0 2 4 6 1 3 5)	(0 4 5) (1 6 2)	(0 1 5) (3 6 4)
	(0 3 6 2 5 1 4)	(0 6 4) (2 3 5)	(0 5 4) (1 2 6)
	(0 4 1 5 2 6 3)	(0 1 3) (2 5 4)	(0 2 3) (1 6 5)
	(0 5 3 1 6 4 2)	(0 3 2) (1 5 6)	(0 6 2) (1 3 4)
	(0 6 5 4 3 2 1)	(0 5 1) (3 4 6)	(0 3 1) (2 4 5)
	(1 5) (2 3)	(1 3 6) (2 4 5)	(1 4 3) (2 5 6)
	(0 5 6) (1 3 4)	(0 3 5 1 4 2 6)	(0 4 6) (2 1 5)
	(0 3 1 2 4 6 5)	(0 4 1 6 3 2 5)	(0 5) (2 3 6 4)
	(0 2 1 4) (3 6)	(0 6 4) (3 1 5)	(0 1 3 2 6 5 4)
	(0 4 5 3) (2 6)	(0 5 4 3) (1 2)	(0 3) (1 6)
	(0 1 6 4 3 5 2)	(0 2) (5 6)	(0 6 3 4 5 1 2)
	(0 6 1) (2 5 4)	(0 1) (2 3 4 6)	(0 2 4 1) (3 5)
	(2 3) (4 6)	(1 3 4) (2 6 5)	(1 6 2) (3 5 4)
	(0 1 3 6) (4 5)	(0 3 1 6) (2 4)	(0 6) (2 5)
	(0 3 5) (1 2 6)	(0 6 3 2 1 4 5)	(0 1 5) (2 3 4)
	(0 2 5 1 6 3 4)	(0 4) (5 3)	(0 5 6 1 3 2 4)
	(0 6 2 4 1 5 3)	(0 1 2 5 6 4 3)	(0 3) (1 4 6 5)
	(0 5 2) (1 4 3)	(0 2) (1 5 4 6)	(0 4 1 2) (3 6)
	(0 4 2 1) (5 6)	(0 5 1) (3 6 2)	(0 2 6 4 5 3 1)
	(1 5) (4 6)	(1 2 6) (3 4 5)	(1 6 3) (2 5 4)
	(0 5 4 1 2 3 6)	(0 2 4 3 5 1 6)	(0 6) (1 5 3 2)
	(0 2 6 5) (1 3)	(0 6 2 5) (1 4)	(0 5) (3 4)
	(0 3 4) (1 6 2)	(0 4) (1 5 2 3)	(0 1 2 4) (5 6)
	(0 6 3) (2 4 5)	(0 5 6 4 2 1 3)	(0 2 3) (1 4 6)
	(0 1 4 2) (3 5)	(0 3 2) (4 6 5)	(0 4 5 1 3 6 2)
	(0 4 3 2 5 6 1)	(0 1) (3 6)	(0 3 5 2 6 4 1)
	(2 4) (3 6)	(1 4) (5 6)	(1 2) (3 5)
	(0 1 4 5 3 2 6)	(0 4 6) (1 2 3)	(0 2 5 6) (3 4)
	(0 4 3 5) (1 6)	(0 2 1 3 6 4 5)	(0 1 5) (6 2 4)
	(0 6 4) (1 2 5)	(0 3 5 4) (2 6)	(0 5 2 3 6 1 4)
	(0 2 3) (1 5 4)	(0 1 6 3) (2 5)	(0 4 2 6 5 1 3)
	(0 5 6 2) (1 3)	(0 6 1 5 3 4 2)	(0 3 2) (1 6 4)
	(0 3 4 6 5 2 1)	(0 5 1) (3 2 4)	(0 6 3 1) (4 5)
	(1 5) (2 4 3 6)	(1 4 5 6) (2 3)	(1 3) (2 5)
	(0 5 2 6) (1 4)	(0 4 6) (1 3 5)	(0 3 4 2 1 5 6)
	(0 4 2 3 1 6 5)	(0 3 6 4 1 2 5)	(0 5) (2 4 6 3)
	(0 6 4) (1 3 2)	(0 2 6 3 1 5 4)	(0 1 4) (3 6 5)
	(0 3) (4 5)	(0 5 3) (1 6 2)	(0 4 3) (1 2 6)
	(0 1 2) (3 5 6)	(0 6 5 2) (3 4)	(0 2) (1 6 4 5)
	(0 2 5 3 4 6 1)	(0 1) (2 4)	(0 6 2 3 5 4 1)
	(2 6) (3 4)	(1 6 5 4) (2 3)	(1 3 5 2) (4 6)
	(0 1 6) (2 4 5)	(0 6) (1 3)	(0 3 6) (2 5 4)
	(0 6 1 4 2 3 5)	(0 3 4 5) (1 2)	(0 1 5) (2 6 3)
	(0 4) (1 3 2 5)	(0 2 4) (3 5 6)	(0 5 3 4) (1 6)
	(0 3) (1 5 6 4)	(0 1 4 6 2 5 3)	(0 6 5 1 2 4 3)
	(0 5 4 6 3 1 2)	(0 4 3 6 1 5 2)	(0 2) (1 4)
	(0 2 1) (3 5 6)	(0 5 1) (2 6 4)	(0 4 5 6 2 3 1)
	(1 5) (2 6 3 4)	(1 6) (4 5)	(1 2 5 3) (4 6)
	(0 5 3 2 4 1 6)	(0 6) (1 2 3 5)	(0 2 1 5 4 3 6)
	(0 6 5) (1 4 3)	(0 2 5) (1 3 4)	(0 5) (2 6)
	(0 4) (1 2)	(0 3 1 5 6 2 4)	(0 1 6 5 2 3 4)
	(0 2 3) (4 5 6)	(0 5 2 1 4 6 3)	(0 6 1 3) (2 4)
	(0 1 3 5 4 6 2)	(0 4 2) (3 6 5)	(0 3 2) (1 4 5)
	(0 3 6 1) (2 5)	(0 1) (2 6 4 3)	(0 4 1) (3 5 6)

[0166] A simple-to-use interleaver is for example an “x to x32” interleaver defined as follows: if u designates the input sequence and u* the permuted sequence, this interleaver permutes each bit in position i in u to a position (32.i modulo 147) in u*.

[0167] This interleaver can be obtained by means of the composite: (i) of the intercolumn permutation Π=(1 4 2)(3 5 6), which appears in the table of intercolumn permutations given above and (ii) intracolumn permutations. Thus this interleaver preserves divisibility by g, whilst remaining simple to use.

[0168] In general terms, it is possible to use interleavers of the form “x to xe”, where e is a power of 2 modulo n.

[0169] These interleavers are defined as follows:

[0170] if u designates the input sequence and u* the permuted sequence, the interleaver permutes each bit which is situated initially at position i in u, to a position (e.i modulo n) in u*.

[0171] To each sequence to be encoded u and u*, 3 padding bits are added so that the concatenation of each sequence to be encoded with its associated sequence of 3 padding bits guarantees a return to zero of each of the encoders encoding each sequence thus obtained.

[0172] The padding sequence added to the sequence u by the first encoder is denoted p1=(p10, p11, p12),

[0173] the padding sequence added to the sequence u* by the second encoder is denoted p2=(p20, p21, p22),

[0174] the parity sequence issuing from the first encoder is denoted v1, and

[0175] the parity sequence issuing from the second encoder is denoted v2.

[0176] The sequence (u, v1, v2, p1, p2) is transmitted.

[0177] A description will be given now of the relationship existing between the padding bits.

[0178] a1(x) is equal to u(x)+p1(x).xn and is divisible by g(x).

[0179] A permutation which transforms the sequence a1(x) into a sequence a1′(x) equal to u*(x)+p″1(x).xn is considered.

[0180] Consider the intercolumn permutation Π=(1 4 2)(3 5 6) used to define the global permutation which permutes the sequence u into a sequence u* and which, here, acts on sequences of 7 bits.

[0181] The sequence p″1 is obtained by the permutation Π of a sequence p1 extended to 7 bits equal to [p10 p11 p12 0 0 0 0].

[0182] Thus p″1(x)=p10+p11.x4+p12.x=p10+p12.x+p11.x4.

[0183] By construction, the permutation Π is a permutation preserving divisibility by g(x). Thus a1′(x) is divisible by g(x).

[0184] The residue of p″1 modulo g(x) is equal to p″(X)=(p10+p11)+(p11+p12).x+p11.x2.

[0185] Consequently, the sequence a″(x) equalling u*(x)+p″(x).xn is also divisible by g(x).

[0186] In addition, a2(x) is equal to u*(x)+p2(x).xn and is divisible by g(x).

[0187] As g is of the 3rd degree and p″ and p2 are of the 2nd degree, p″ and p2 are equal.

[0188] There are deduced therefrom the following relationships between p1 and p2 which depend only on the permutations of columns of the interleaver guaranteeing return to zero of the encoder, that is to say here Π= (1 4 2)(3 5 6):

p 20 =p 10 +p 11

p 21 =p 11 +p 12

[0189]  p22=p11

[0190]

[0191] This system of equations is reversible: it is also easy to find p1 as a function of p2.

[0192] This way of proceeding is applicable whatever the permutation acting on the columns preserving divisibility by g. The obtaining of the equations linking the padding bits can be generalised:

[0193] first of all by supplementing the first padding sequence p1 with zeros in order to obtain a sequence with a length equal to the period of the feedback polynomial g(x),

[0194] then determining the sequence p1″ obtained by interleaving the padding sequence p1 with the resultant permutation acting on the columns which was defined in order to transform u into u*,

[0195] and finally calculating the residue of p1″ modulo g.

[0196] In the particular case where the intercolumn permutation is identity, the sequences p1 and p2 are identical.

[0197] As a variant, the padding sequences are punctured by transmitting the sequence (u, v1, v2, pp) where pp includes padding bits of p1 and p2 and, advantageously, a combination linearly independent of the bits of p1 and p2, or, in more general terms, a part of the first and second padding sequences p1 and p2 which remains representative of these two sequences, that is to say which makes it possible to find the two sequences in their entirety.

[0198] Preferably either the first sequence of padding bits p1 is punctured in its entirety, or the second sequence of padding bits p2 in its entirety.

[0199] A turbodecoder is now described in general terms.

[0200] Turbodecoding is an iterative operation well known to persons skilled in the art. For more details, reference can useful be made to:

[0201] the article by J. Hagenauer, E. Offer and L. Papke entitled “Iterative decoding of binary block and convolutional codes”, in IEEE Transactions on Information Theory, March 1996;

[0202] the article by J. Hagenauer, P. Robertson and L. Papke entitled “Iterative (turbo) decoding of systematic convolutional codes with the MAP and SOVA algorithms”, in Informationstechnische Gesellschaft (ITG) Fachbericht, pages 21 to 29, October 1994, and

[0203] the article by C. Berrou, S. Evano and G. Battail, entitled “Turbo- block-codes”, published with the proceedings of the seminar “Turbocoding” organised by the Technology Institute of Lund (Sweden) (Department of Applied Electronics) in August 1996.

[0204] Nevertheless, in the state of the art, there are no particular relationships which link the padding bits. Here, to optimise the decoding quality, the turbodecoder will use the system of equations which link p1 and p2 both with regard to the corresponding elementary decoders where a priori information on p1 and p2 will be available and with regard to their output, where extrinsic information on p1 and p2 will be supplied.

[0205] A description will now be given of a particular embodiment of the present invention, with the help of FIGS. 1 to 8.

[0206] FIG. 1 illustrates schematically the constitution of a network station or computer coding station, in the form of a block diagram.

[0207] This station has a keyboard 111, a screen 109, an external information source 110, a radio transmitter 106, conjointly connected to an input/output port 103 of a processing card 101.

[0208] The processing card 101 has, connected together by an address and data bus 102:

[0209] a central processing unit 100;

[0210] a random access memory RAM 104;

[0211] a read only memory ROM 105; and

[0212] the input/output port 103.

[0213] Each of the elements illustrated in FIG. 1 is well known to persons skilled in the art of microcomputers and transmission systems and, more generally, information processing systems. These common elements are therefore not described here. It should be noted, however, that:

[0214] the information source 110 is, for example, an interface peripheral, a sensor, a demodulator, an external memory or another information processing system (not shown), and is advantageously adapted to supply sequences of signals representing speech, service messages or multimedia data, in the form of sequences of binary data, and that

[0215] the radio transmitter 106 is adapted to implement a packet transmission protocol on a wireless channel, and to transmit these packets over such a channel.

[0216] It will also be observed that the word “register” used in the description designates, in each of the memories 104 and 105, both a memory area of low capacity (a few binary data) and a memory area of large capacity (making it possible to store an entire program).

[0217] The random access memory 104 stores data, variables and intermediate processing results, in memory registers bearing, in the description, the same names as the data whose values they store. The random access memory 104 contains notably:

[0218] a register “source_data”, in which there are stored, in the order of their arrival on the bus 102, the binary data coming from the information source 110, in the form of a sequence u,

[0219] a register “No_data”, which stores an integer number corresponding to the number of binary data in the register “source_data”,

[0220] a register “permuted_data”, in which there are stored, in the order of their arrival on the bus 102, the permuted binary data, described below with the help of FIG. 5, in the form of a sequence u*, and

[0221] a register “data_to_send”, in which there are stored the sequences to be transmitted.

[0222] The read only memory 105 is adapted to store, in registers which, for convenience, have the same names as the data which they store:

[0223] the operating program of the central processing unit 100, in a register “program”,

[0224] the sequence g, in a register “g”,

[0225] the degree m of g(x), in a register “m”,

[0226] the sequence h1, in a register “h1”,

[0227] the sequence h2, in a register “h2”,

[0228] the value of N0, in a register “N0”,

[0229] the value of n, in a register “n”, and

[0230] the array defining the interleaver, in a register “interleaver”.

[0231] The data in ROM 105 can be provided by a removable storage medium, such as, for example, a floppy disk, a CD-ROM or a DVD.

[0232] The central processing unit 100 is adapted to implement the flow diagram illustrated in FIG. 5.

[0233] It can be seen, in FIG. 2, that an encoding device corresponding to a parallel convolutional turbocode according to the present invention has notably:

[0234] an input for symbols to be encoded 201, where the information source 110 supplies a sequence of binary symbols to be transmitted, or “to be encoded”, u,

[0235] a first encoder 202 which supplies, from the sequence u, two sequences p1 and vof symbols representing the sequence u,

[0236] an interleaver 203 which supplies, from the sequence u, an interleaved sequence u*, whose symbols are the symbols of the sequence u, but in a different order, and

[0237] a second encoder 204 which supplies, from the interleaved sequence u* two sequences p2 and v2 of symbols representing the sequence u*.

[0238] In a variant, the sequence p2 can be determined solely from the knowledge of the sequence p1, either by means of a calculation using the intercolumn permutation Π, as described above, or, preferably, using a conversion table giving p2 as a function of p1, this conversion table having previously been established.

[0239] The five sequences u, v1, v2, p1 and p2 are transmitted in order next to be decoded.

[0240] In the remainder of the description, the concern is preferably with interleavers of the “x to x32” type of size 147, although the present invention is not limited to this type of interleaver, but concerns, much more generally, all interleavers preserving divisibility by g(x).

[0241] FIG. 3 illustrates schematically the constitution of a network station or computer decoding station, in the form of a block diagram.

[0242] This station has a keyboard 311, a screen 309, an external information destination 310, and a radio receiver 306, conjointly connected to an input/output port 303 of a processing card 301.

[0243] The processing card 301 has, connected together by an address and data bus 302:

[0244] a central processing unit 300;

[0245] a random access memory RAM 304;

[0246] a read only memory ROM 305; and

[0247] the input/output port 303.

[0248] Each of the elements illustrated in FIG. 3 is well known to persons skilled in the art of microcomputers and transmission systems and, more generally, information processing systems. These common elements are therefore not described here. It should, however, be noted that:

[0249] the information destination 310 is, for example, an interface peripheral, a display, a modulator, an external memory or another information processing system (not shown), and is advantageously adapted to receive sequences of signals representing speech, service messages or multimedia data, in the form of sequences of binary data, and that

[0250] the radio receiver 306 is adapted to use a packet transmission protocol on a wireless channel, and to receive these packets over such a channel.

[0251] It should also be noted that the word “register” used in the description designates, in each of the memories 304 and 305, both a memory area of low capacity (a few binary data) and a memory area of large capacity (making it possible to store an entire program).

[0252] The random access memory 304 stores data, variables and intermediate processing results, in memory registers bearing, in the description, the same names as the data whose values they store. The random access memory 304 contains notably:

[0253] a register “received_data”, in which there is stored, in the order of arrival of the binary data over the bus 302 coming from the transmission channel, a soft estimation of these binary data, equivalent to a measurement of reliability, in the form of a sequence,

[0254] a register “extrinsic_inf”, in which there is stored, at a given moment, the extrinsic and a priori information corresponding to the sequences U, p1 and p2,

[0255] a register “estimated_data”, in which there is stored, at a given moment, an estimated sequence û supplied as an output by the decoding device of the invention, as described below with the help of FIG. 4,

[0256] a register “No_iteration”, which stores an integer number corresponding to a counter of iterations effected by the decoding device concerning a received sequence u, as described below with the help of FIG. 4, and

[0257] a register “No_data”, which stores an integer number corresponding to the number of binary data in the register “received_data”.

[0258] The read only memory 305 is adapted to store, in registers which, for convenience, have the same names as the data which they store:

[0259] the operating program of the central processing unit 300, in a register “Program”,

[0260] the sequence g, in a register “g”,

[0261] the degree m of g(x), in a register “m”,

[0262] the sequence h1, in a register “h1”,

[0263] the sequence h2, in a register “h2”,

[0264] the value of N0, in a register “N0”,

[0265] the value of n, in a register “n”, and

[0266] the array defining the interleaver and its reverse interleaver, in a register “Interleaver”.

[0267] The data in ROM 305 can be provided by a removable storage medium, such as, for example, a floppy disk, a CD-ROM or a DVD.

[0268] The central processing unit 300 is adapted to implement the flow diagram illustrated in FIG. 6.

[0269] In FIG. 4, it can be seen that a decoding device has notably:

[0270] five inputs 401, 402, 403, 410 and 411 of sequences representing u, v1, v2, p1 and p2, which, for convenience, are also denoted u, v1, v2, p1 and p2, the received sequence, consisting of these five sequences, being denoted r;

[0271] a first soft input output decoder 404 corresponding to the encoder 202 (FIG. 2):

[0272] The first decoder 404 receives as an input:

[0273] the sequences u and v1,

[0274] a sequence p′1 defined below, and

[0275] two a priori information sequences w4 and wp1 described below.

[0276] The first decoder 404 supplies as an output:

[0277] two extrinsic information sequences w1 and wp1′, and an estimated sequence û at an output 416.

[0278] The decoding device illustrated in FIG. 4 also has:

[0279] an interleaver 405 (denoted “Interleaver Π” in FIG. 4), based on the same permutation as the one defined by the interleaver 203 used in the encoding device; the interleaver 405 receives as an input the sequences u and w1 and interleaves them respectively in two sequences u* and w2;

[0280] an operation unit 412, which determines a priori information wp2 from the extrinsic information wp1′;

[0281] a second soft input output decoder 406, corresponding to the encoder 204.

[0282] This second decoder 406 receives as an input:

[0283] the sequences w2, wp2, p′2, u* and v2.

[0284] The second decoder 406 supplies as an output:

[0285] two extrinsic information sequences w3 and wp2′, and

[0286] an estimated sequence û*.

[0287] The decoding device illustrated in FIG. 4 also has:

[0288] a deinterleaver 408 (denoted “Interleaver Π−1” in FIG. 4), the reverse of the interleaver 405, receiving as an input the sequence û* and supplying as an output an estimated sequence û, at an output 409 (this estimation being improved compared with the one supplied, a half-iteration previously, at the output 416);

[0289] a deinterleaver 407 (also denoted “Interleaver Π−1” in FIG. 4), the reverse of the interleaver 405, receiving as an input the extrinsic information sequence w3 and supplying as an output the a priori information sequence w4;

[0290] an operation unit 414, which determines a sequence p′1 from the sequences p1 and p2;

[0291] an operation unit 415, which determines a sequence p′2 from the sequences p1 and p2;

[0292] an operation unit 413, which determines a priori information wp1 from the extrinsic information wp2′; and

[0293] the output 409, to which the decoding device supplies the estimated sequence u, as the output of the deinterleaver 408.

[0294] Account is taken of an estimated sequence û only following a predetermined number of iterations (see the article “Near Shannon limit error- correcting coding and decoding: turbocodes” referred to above).

[0295] In the preferred embodiment described here, in initialising the decoders 404 and 406 account is taken of the fact that the encoders 202 and 204 each have null initial and final states.

[0296] In FIG. 5, which depicts the functioning of an encoding device such as the one included in the electronic device illustrated in FIG. 1, it can be seen that, after an initialisation operation 500, during which the registers of the random access memory 104 are initialised (No_data=“0”), during an operation 501, the central unit 100 waits until it receives, and then receives a binary data item to be transmitted, positions it in the random access memory 104, in the register “source_data”, and increments the counter “No_data” by one unit.

[0297] Next, during a test 502, the central unit 100 determines whether or not the integer number stored in the register “No_data” is equal to n (the value stored in the read only memory 105).

[0298] When the result of the test 502 is negative, the operation 501 is reiterated.

[0299] When the result of the test 502 is positive, during an operation 508, the first encoder 202 (see FIG. 2) simultaneously determines the padding sequence p1, the division by g(x) of the polynomial a(x) associated with the sequence of binary data obtained by concatenating the sequences u and p1 (p1 being determined so that the remainder of this division is zero) and the product of the result of this division and h1(x). The sequences u, p1 and the result of this operation, v1, are stored in memory in the register “data_to_send”.

[0300] In parallel to the operation 508, during an operation 506, the binary data in the sequence u are successively read in the register “received_data”, in the order described by the array “interleaver” stored in the read only memory 105. The data which result successively from this reading are stored in memory in the register “permuted_data” in the random access memory 104.

[0301] Next, during an operation 510, the second coder 204 simultaneously determines the padding sequence p2, the division by g(x) of the polynomial b(x) associated with the sequence of binary data obtained by concatenating the sequences u* and p2 (p2 being determined so that the remainder of this division is zero) and the product of the result of this division by h2(x). The sequence p2 and the result of this operation, v2, are stored in memory in the register “data_to_send”.

[0302] During an operation 509, the sequences u, p1, p2, v1 and v2 are sent using, for this purpose, the transmitter 106. Next the registers in the memory 104 are once again initialised (step 500 is returned to); in particular the counter No_data is reset to “0”. Then the operation 501 is reiterated.

[0303] In a variant, during the operation 509, the sequences u, v1, v2, p1 and p2 are not sent in their entirety but only a sub-set thereof. This variant is known to persons skilled in the art as puncturing. Normally, the padded bits are not punctured. Here, by virtue of the interleaver preserving divisibility by g(x), it is possible to establish relationships between the padding bits; thus it is possible to puncture a certain number of padding bits and to send only a sub-set of these bits. Advantageously, only a set of padding bits which are linearly independent, but which remains representative of the sequences p1 and p2, will be sent. In other words, solely knowledge of the padding bits sent is necessary and sufficient for reconstituting all the sequences p1 and p2.

[0304] In FIG. 6, which depicts the functioning of a decoding device such as the one included in the electronic device illustrated in FIG. 3, it can be seen that, after an initialisation operation 600, during which the registers of the random access memory 304 are initialised (No_data=“0”), during an operation 601, the central unit 300 waits until it receives, and then receives, a data item in soft form corresponding to a measurement of reliability of a data item sent by the transmitter 106 and received by the receiver 306, positions it in the random access memory 104, in the register “received_data” and increments the counter “No_data” by one unit.

[0305] Next, during a test 602, the central unit 300 determines whether or not the integer number stored in the register “No_data” is equal to 3n+2m (n and m being values stored in the read only memory 305), 3n+2m being the total number of binary data sent by the transmitter 106.

[0306] When the result of the test 602 is negative, the operation 601 is reiterated.

[0307] When the result of the test 602 is positive, during a turbodecoding operation 603, detailed below, the decoding device gives an estimation û of the transmitted sequence u.

[0308] Then, during an operation 604, the central unit 300 supplies this estimation û to the information destination 310.

[0309] Next the registers in the memory 304 are once again initialised. In particular, the counter No_data is reset to “0” and operation 601 is reiterated.

[0310] In FIG. 7, which details the turbodecoding operation 603, it can be seen that, during an initialisation operation 700, the registers in the random access memory 304 are initialised: the counter No_data and the a priori information w2, w4, wp1 and wp2 are reset to zero (it is assumed here that the entropy of the source is zero). In addition, the interleaver 405 interleaves the input sequence u and supplies a sequence u* which is stored in the register received_data.

[0311] Then, during an operation 701, the operation units 414 and 415 respectively calculate the sequences p′1 and p′2 from the sequences p2 and p1 and store them in the register received_data.

[0312] Next, during an operation 702, the register No_iteration is incremented by one unit.

[0313] Then, during an operation 703, the first decoder 404 (corresponding to the first elementary encoder 202) implements an algorithm of the “Soft Input Soft Output” (SISO) type, well known to persons skilled in the art, such as the BJCR mentioned above, or the SOVA (“Soft Output Viterbi Algorithm”), as follows: taking into account null initial and final states of the encoder, the first decoder 404 considers, as soft inputs, an estimation of the received sequences u and v1, of the sequence p′1 and of wp1 and w4 (respectively a priori information on p1 and u) and supplies, on the one hand, wp1′ and w1 (respectively extrinsic information on p1 and u) and, on the other hand, an estimation û of the sequence u.

[0314] For fuller details on the decoding algorithms used in the turbocodes, reference can be made to:

[0315] the article by L. R. Bahl, J. Cocke, F. Jelinek and J. Raviv entitled “Optimal decoding of linear codes for minimizing symbol error rate”, in IEEE Transactions on Information Theory, March 1974, which describes a so-called “BJCR” algorithm generally used in relation to turbocodes; or

[0316] the article by J. Hagenauer and P. Hoeher entitled “A Viterbi algorithm with soft decision outputs and its applications”, published with the proceedings of the IEEE GLOBECOM conference, pages 1680-1686, in November 1989.

[0317] During an operation 705, the interleaver 405 interleaves the sequence w1 in order to produce w2, a priori information on u*.

[0318] In parallel, during an operation 704, the operation unit 412 calculates the sequence wp2 from the sequence wp1′.

[0319] Next, during an operation 706, the second decoder 406 (corresponding to the second elementary encoder 204) uses an algorithm of the soft input soft output type, as follows: taking into account null initial and final states of the encoder, the second decoder 406 considers as soft inputs an estimation of the received sequences u* and v2, of the sequence p′2 and of wp2 and w2 (respectively a priori information on p2 and u) and supplies, on the one hand, wp2′ and w3 (respectively extrinsic information on p2 and u*) and, on the other hand, an estimation û of the sequence u*.

[0320] During an operation 708, the deinterleaver 407 (the reverse interleaver of 405) deinterleaves the information sequence w3 in order to produce w4, a priori information on u.

[0321] In parallel, during an operation 707, the operation unit 413 calculates the sequence wp1 from the sequence wp2′.

[0322] The extrinsic and a priori information produced during steps 703, 704, 706 and 707 is stored in the register “extrinsic_inf” in the RAM 304.

[0323] Next, during a test 709, the central unit 300 determines whether or not the integer number stored in the register “No_iteration” is equal to a maximum predetermined number of iterations to be effected, stored in the register “max_No_iteration” of the ROM 305.

[0324] When the result of test 709 is negative, operation 702 is reiterated.

[0325] When the result of test 709 is positive, during an operation 710, the deinterleaver 408 (identical to the deinterleaver 407) deinterleaves the sequence û*, in order to supply a deinterleaved sequence to the central unit 300, which then transforms the soft decision into a hard decision, in the form of a sequence û, estimate of u.

[0326] The calculation operations 701, 704 and 707, which are, within the decoding device, specific to the invention, are now detailed.

[0327] For this purpose, the example given in the detailed description of the encoding device will be taken up again and the corresponding decoding device considered.

[0328] It has been seen that, in the aforementioned example, the padding bits are linked by one of the following two equivalent equation systems:

(1) p20=p10+p11

p 21 =p 11 +p 12

p22=p11

[0329]  (2) p10=p20+p22

p 12 =p 22 +p 21

p11=p22

[0330] These relationships can be predetermined according to the method described above with regard to the paragraph describing the relationships between the padding bits.

[0331] On the decoding device side, there are only estimations of p1 and p2, and the decoders 404 and 406 will take advantage of both p2 and p1.

[0332] Thus the decoder 404 will not directly take the information which it has on p1 or p2 but will use p′1.

[0333] Likewise, the decoder 406 will not directly take the information which it has on p1 or p2 but will use p′2.

[0334] The operation units 413 and 414 use the system (2), which can be calculated instantly or, preferably, stored in memory in the form of a conversion table, in order to determine respectively wp1 from wp2′ and p′1 from p1 and p2. Nevertheless, it should be noted that wp1, wp2′, p2 and p′1 are soft information and correspond generally to likelihood ratio logarithms. Thus care will be taken to effect the additions of soft information in accordance with methods which are not trivial but well known to persons skilled in the art of decoders. Reference can be made, for example, to the section “Likelihood algebra of a binary random variable” in the article entitled “Source controlled channel decoding” by J. Hagenauer, in IEEE Transactions on Communications, Vol. 43, No. 9, September 1995.

[0335] Likewise, the operation units 412 and 415 use the system (1), which can be calculated instantly or, preferably, stored in memory in the form of a conversion table, in order to determine respectively wp2 from wp1′ and p′2 from p1 and p2.

[0336] As a variant, when padding bits have been punctured during the encoding operation, the soft inputs of these bits will be initialised to a zero value. If the sequence p1 has been completely punctured, the input p′2 of the second decoder 406 will be identical to p2. Conversely, if the sequence p2 has been completely punctured, the input p′1 of the first decoder 404 will be identical to p1.

[0337] In another variant, which is more general, the invention is not limited to the turbo-encoders composed of two encoders or to the turbo-encoders with one input: it can apply to turbo-encoders composed of several elementary encoders or to turbo-encoders with several inputs, such as those described in the report by D. Divsalar and F. Pollara mentioned in the introduction.

[0338] It will be ensured in this case that the interleavers used preserve divisibility by the generator polynomial or polynomials used and that the elementary encoders are initialised to the zero state and return to zero by virtue of the padding bits, the latter not being interleaved. It will then possible to establish the relationships which link these padding bits and use them in the decoding device in a similar manner to that which was disclosed above.

[0339] Thus, FIG. 8 describes an encoding device having a turbo-encoder with several inputs u1, u2, . . . , uk-1, uk according to the invention.

[0340] The interleavers l1, l2, . . . , lk-1, lk, designated by the reference numbers 801 to 804, preserve divisibility by the feedback polynomial g(x) used in the encoders 805 and 806.

[0341] The padding sequences p1 and p2 are not interleaved.

[0342] The corresponding decoding device can easily be derived from the description of the encoding device, on the basis of the description of the decoding device given previously in cases where a single input and a single interleaver are considered.

Claims

1. Method for encoding at least one sequence of original binary data (u), according to which: at least one first padding operation (508) is performed, consisting of supplementing the original sequence (u) with a first sequence of padding binary data (p1) chosen so that the original sequence (u), supplemented by said first padding sequence (p1), is divisible by a first divisor polynomial (g1); at least one first recursive convolutional encoding operation (508) is performed, consisting of encoding the original sequence (u), supplemented by the first padding sequence (p1), by means of an encoding technique using said first divisor polynomial (g1); at least one interleaving operation (506) is performed, consisting of permuting the binary data of the original sequence (u) by means of a specific permutation, so as to obtain an interleaved sequence (u*); said coding method being characterized in that: said specific permutation is, in a representation where the binary data of the original sequence (u) are written and read, row by row, in an array with N0 columns and M rows, where N0 is the smallest integer such that the first divisor polynomial (g1) divides the polynomial xN0+1 and M is a positive integer, the resultant: of an intercolumn permutation which transforms the cyclic code of length N0 whose generator polynomial is said first divisor polynomial (g1) into a cyclic code whose generator polynomial is a second divisor polynomial (g2), said intercolumn permutation permuting with each other the N0 columns of the array representing the original sequence (u), and any number of intracolumn elementary permutations, each of said elementary permutations being any permutation of the symbols in a column of said array; and in that: at least one second padding operation (510) is performed, consisting of supplementing the interleaved sequence (u*) with a second sequence of padding binary data (p2), chosen so that the interleaved sequence (u*), supplemented by the second padding sequence (p2), is divisible by said second divisor polynomial (g2); and at least one second recursive convolutional coding operation (510) is performed, consisting of coding the interleaved sequence (u*), supplemented by said second padding sequence (p2), by means of an encoding technique using the second divisor polynomial (g2).

2. Encoding method according to claim 1, characterized in that the binary data in the second padding sequence (p2) are determined solely from the knowledge of the binary data in the first padding sequence (p1).

3. Encoding method according to claim 2, characterized in that the binary data in the second padding sequence (p2) are determined from a previously established conversion table giving the second padding sequence (p2) as a function of the first padding sequence (p1).

4. Encoding method according to claim 2, characterized in that the binary data in the second padding sequence (p2) are determined instantly as a function of the binary data in the first padding sequence (p1).

5. Encoding method according to any one of claims 1 to 4, characterized in that, in order to construct said second padding sequence (p2) from said first padding sequence (p1) having a number of data equal to the degree of the first divisor polynomial (g1): the first padding sequence (p1) is supplemented with zeros, so as to obtain a sequence with a length equal to N0; the binary data in the first padding sequence (p1) are permuted by means of said intercolumn permutation, so as to obtain a first interleaved padding sequence (p″1); the residue of the polynomial division of the first interleaved padding sequence (p″1) by the second divisor polynomial (g2) is determined; and said residue is chosen as the second padding sequence (p2).

6. Encoding method according to any one of claims 1 to 6, characterized in that the first divisor polynomial (g1) and the second divisor polynomial (g2) are identical.

7. Encoding method according to claim 6, characterized in that, when said intercolumn permutation is the identity permutation, the second padding sequence (p2) is determined as being equal to the first padding sequence (p1).

8. Encoding method according to any one of claims 1 to 7, characterized in that at least one of the padding sequences (p1, p2) is punctured.

9. Encoding method according to claim 8, characterized in that at least one of the padding sequences (p1, p2) is punctured so that the encoded sequence includes a part of the first and second padding sequences (p1, p2) which remains representative of all the first and second padding sequences (p1, p2).

10. Encoding method according to claim 8 or 9, characterized in that the first padding sequence (p1) is punctured in its entirety.

11. Encoding method according to claim 8 or 9, characterized in that the second padding sequence (p2) is punctured in its entirety.

12. Device for encoding at least one sequence of original binary data (u), having: at least first padding means (202), for supplementing the original sequence (u) with a first sequence of padding binary data (p1) chosen so that the original sequence (u), supplemented by said first padding sequence (p1), is divisible by a first divisor polynomial (g1); at least first recursive convolutional encoding means (202), for encoding the original sequence (u), supplemented by the first padding sequence (p1), by means of an encoding technique using said first divisor polynomial (g1); at least first interleaving means (203), for permuting the binary data in the original sequence (u) by means of a specific permutation, so as to obtain an interleaved sequence (u*); said encoding device being characterized in that: said specific permutation is, in a representation where the binary data in the original sequence (u) are written and read, row by row, in an array with N0 columns and M rows, where N0 is the smallest integer such that the first divisor polynomial (g1) divides the polynomial xN0+1 and M is a positive integer, the resultant: of an intercolumn permutation which transforms the cyclic code of length N0 whose generator polynomial is said first divisor polynomial (g1) into a cyclic code whose generator polynomial is a second divisor polynomial (g2), said intercolumn permutation permuting with each other the N0 columns of the array representing the original sequence (u), and any number of intracolumn elementary permutations, each of said elementary permutations being any permutation of the symbols in a column of said array; and in that the device also has: at least second padding means (204), for supplementing the interleaved sequence (u*) with a second sequence of padding binary data (p2), chosen so that the interleaved sequence (u*), supplemented by the second padding sequence (p2), is divisible by said second divisor polynomial (g2); and at least second recursive convolutional encoding means (204), for encoding the interleaved sequence (u*), supplemented by said second padding sequence (p2), by means of an encoding technique using the second divisor polynomial (g2).

13. Encoding device according to claim 12, characterized in that said second padding means (204) determine the binary data in the second padding sequence (p2) solely from knowledge of the binary data in the first padding sequence (p1).

14. Encoding device according to claim 13, characterized in that said second padding means (204) determine the binary data in the second padding sequence (p2) from a previously established conversion table giving the second padding sequence (p2) as a function of the first padding sequence (p1).

15. Encoding device according to claim 13, characterized in that said second padding means (204) determine the binary data in the second padding sequence (p2) instantly as a function of the binary data in the first padding sequence (p1).

16. Encoding device according to any one of claims 12 to 15, characterized in that it also has, for constructing said first and second padding sequences (p1, p2): means for choosing a number of binary data in the first padding sequence (p1) equal to the degree of the first divisor polynomial (g1); means for supplementing the first padding sequence (p1) with zeros, so as to obtain a sequence with a length equal to N0; means for permuting the binary data in the first padding sequence (p1) using said intercolumn permutation, so as to obtain a first interleaved padding sequence (p″1); means for determining the residue of the polynomial division of the first interleaved padding sequence (p″1) by the second divisor polynomial (g2); and means for choosing said residue as the second padding sequence (p2).

17. Encoding device according to any one of claims 12 to 16, characterized in that the first divisor polynomial (g1) and the second divisor polynomial (g2) are identical.

18. Encoding device according to claim 17, characterized in that, when said intercolumn permutation is the identity permutation, the second padding sequence (p2) is determined as being equal to the first padding sequence (p1).

19. Encoding device according to any one of claims 12 to 18, characterized in that it also has puncturing means for puncturing at least one of the padding sequences (p1, p2).

20. Encoding device according to claim 19, characterized in that said puncturing means puncture at least one of the padding sequences (p1, p2) so that the encoded sequence includes a part of the first and second padding sequences (p1, p2) which remains representative of all the first and second padding sequences (p1, p2).

21. Encoding device according to claim 19 or 20, characterized in that said puncturing means puncture the first padding sequence (p1) in its entirety.

22. Encoding device according to claim 19 or 20, characterized in that said puncturing means puncture the second padding sequence (p2) in its entirety.

23. Method for decoding at least one original symbol sequence, characterized in that the original symbol sequence represents a binary sequence (u) encoded by means of an encoding method according to any one of claims 1 to 11.

24. Decoding method according to claim 23, characterized in that it implements soft input soft output decoding operations (703, 706).

25. Decoding method according to claim 23 or 24, characterized in that there is effected iteratively: at least one first elementary operation of decoding a recursive convolutional code (703), consisting of decoding a first sub-sequence of said original symbol sequence by means of a decoding technique using the first divisor polynomial (g1(x)) and taking at least into account a first binary data sequence (p′1) which is a function of the first and second padding sequences (p1, p2).

26. Decoding method according to claim 25, characterized in that said first binary data sequence (p′1) is determined from a previously established system of equations giving the first binary data sequence (p′1) as a function of the first and second padding sequences (p1, p2).

27. Decoding method according to claim 25, characterized in that said first sequence of binary data (p′1) is determined from a system of equations established instantly and giving the first binary data sequence (p′1) as a function of the first and second padding sequences (p1, p2).

28. Decoding method according to any one of claims 23 to 27, characterized in that there is also effected iteratively: at least one second elementary operation of decoding a recursive convolutional code (706), consisting of decoding a second sub-sequence of said original symbol sequence by means of a decoding technique using the second divisor polynomial (g2(x)) and taking at least into account a second binary data sequence (p′2) which is a function of the first and second padding sequences (p1, p2).

29. Decoding method according to claim 28, characterized in that said second binary data sequence (p′2) is determined from a previously established system of equations giving the second binary data sequence (p′2) as a function of the first and second padding sequences (p1, p2).

30. Decoding method according to claim 28, characterized in that said second binary data sequence (p′2) is determined from a system of equations established instantly and giving the second binary data sequence (p′2) as a function of the first and second padding sequences (p1, p2).

31. Decoding method according to any one of claims 23 to 30, characterized in that there is also effected iteratively: at least one operation (705) of interleaving a sequence representing the original sequence; and in that: during the first elementary decoding operation (703), at least one first extrinsic information sequence (wp1′) is determined, and in parallel to the interleaving operation (705), a first calculation operation (704) is effected, consisting of calculating a first a priori information sequence (wp2) as a function of said first extrinsic information sequence (wp1′), said first a priori information sequence (wp2) being taken into account during the second elementary decoding operation (706).

32. Decoding method according to claim 31, characterized in that the first a priori information sequence (wp2) is determined from a previously established system of equations giving the first a priori information system (wp2) as a function of the first extrinsic information sequence (wp1′).

33. Decoding method according to claim 31, characterized in that the first a priori information sequence (wp2) is determined from a system of equations established instantly giving the first a priori information sequence (wp2) as a function of the first extrinsic information sequence (wp1′).

34. Decoding method according to any one of claims 23 to 33, characterized in that there is also effected iteratively: at least one operation (708) of deinterleaving a sequence representing the original interleaved sequence; and in that: during the second elementary decoding operation (706), at least one second extrinsic information sequence (wp2′) is determined, and in parallel to the deinterleaving operation (708), a second calculation operation (707) is effected, consisting of calculating a second a priori information sequence (wp1) as a function of said second extrinsic information sequence (wp2′), said second a priori information sequence (wp1) being taken into account during the first elementary decoding operation (703).

35. Decoding method according to claim 34, characterized in that the second a priori information sequence (wp1) is determined from a previously established system of equations giving the second a priori information sequence (wp1) as a function of the second extrinsic information sequence (wp2′).

36. Decoding method according to claim 34, characterized in that the second a priori information sequence (wp1) is determined from a system of equations established instantly giving the second a priori information sequence (wp1) as a function of the second extrinsic information sequence (wp2′).

37. Decoding method according to any one of claims 28 to 36, the first padding sequence (p1) having been fully punctured at the time of encoding, characterized in that the second binary data sequence (p′2) taken into account during the second elementary decoding operation (706) is identical to the second padding sequence (p2).

38. Decoding method according to any one of claims 25 to 37, the second padding sequence (p2) having been fully punctured at the time of encoding, characterized in that the first sequence of binary data (p′1) taken into account during the first elementary decoding operation (706) is identical to the first padding sequence (p1).

39. Device for decoding at least one original symbol sequence, characterized in that the original symbol sequence represents a binary sequence (u) encoded by means of an encoding device according to any one of claims 12 to 22.

40. Decoding device according to claim 39, characterized in that it uses soft input soft output decoding means (404, 406).

41. Decoding device according to claim 39 or 40, characterized in that it has: at least first elementary means of decoding a recursive convolutional code (404), operating iteratively, for decoding a first sub-sequence of said original symbol sequence by means of a decoding technique using the first divisor polynomial (g1(x)) and taking at least into account a first binary data sequence (p′1) which is a function of the first and second padding sequences (p1, p2).

42. Decoding device according to claim 41, characterized in that it also has means for determining said first binary data sequence (p′1) from a previously established system of equations giving the first binary data sequence (p′1) as a function of the first and second padding sequences (p1, p2).

43. Decoding device according to claim 41, characterized in that it also has means for determining said first binary data sequence (p′1) from a system of equations established instantly and giving the first binary data sequence (p′1) as a function of the first and second padding sequences (p1, p2).

44. Decoding device according to any one of claims 39 to 43, characterized in that it also has: at least second elementary means of decoding a recursive convolutional code (406), operating iteratively, in order to decode a second sub-sequence of said original symbol sequence by means of a decoding technique using the second divisor polynomial (g2(x)) and taking at least into account a second binary data sequence (p′2) which is a function of the first and second padding sequences (p1, p2).

45. Decoding device according to claim 44, characterized in that it also has means for determining said second binary data sequence (p′2) using a previously established system of equations giving the second binary data sequence (p′2) as a function of the first and second padding sequences (p1, p2).

46. Decoding device according to claim 44, characterized in that it also has means for determining said second binary data sequence (p′2) using a system of equations established instantly and giving the second binary data sequence (p′2) as a function of the first and second padding sequences (p1, p2).

47. Decoding device according to any one of claims 39 to 46, characterized in that it also has: at least one means (405) of interleaving a sequence representing the original sequence, operating iteratively; in that: said first elementary decoding means (404) output at least one first extrinsic information sequence (wp1′), and in that said device also has: first calculation means (412), for calculating, in parallel with said interleaving means (405), a first a priori information sequence (wp2) as a function of said first extrinsic information sequence (wp1′), said first a priori information sequence (wp2) being taken into account by said second elementary decoding means (406).

48. Decoding device according to claim 47, characterized in that it also has means for determining the first a priori information sequence (wp2) using a previously established system of equations giving the first a priori information sequence (wp2) as a function of the first extrinsic information sequence (wp1′).

49. Decoding device according to claim 47, characterized in that it also has means for determining the first a priori information sequence (wp2) using a system of equations established instantly and giving the first a priori information sequence (wp2) as a function of the first extrinsic information sequence (wp1′).

50. Decoding device according to any one of claims 39 to 49, characterized in that it also has: at least one means (407, 408) of deinterleaving a sequence representing the original interleaved sequence, operating iteratively; in that: said second elementary decoding means (406) output at least one second extrinsic information sequence (wp2′), and in that said device also has: second calculation means (413), for calculating, in parallel with said deinterleaving means (407), a second a priori information sequence (wp1) as a function of said second extrinsic information sequence (wp2′), said second a priori information sequence (wp1) being taken into account by said first elementary decoding means (404).

51. Decoding device according to claim 50, characterized in that it also has means for determining the second a priori information sequence (wp1) from a previously established system of equations giving the second a priori information sequence (wp1) as a function of the second extrinsic information sequence (wp2′).

52. Decoding device according to claim 50, characterized in that it also has means for determining the second a priori information sequence (wp1) using a system of equations established instantly and giving the second a priori information sequence (wp1) as a function of the second extrinsic information sequence (wp2′).

53. Decoding device according to any one of claims 44 to 52, the first sequence (p1) having been fully punctured at the time of encoding, characterized in that the second binary data sequence (p′2) taken into account by the second elementary decoding means (706) is identical to the second padding sequence (p2).

54. Decoding method according to any one of claims 41 to 53, the second padding sequence (p2) having been fully punctured during encoding, characterized in that the first binary data sequence (p′1) taken into account by the first elementary decoding means (706) is identical to the first padding sequence (p1).

55. Digital signal processing apparatus, characterized in that it has means adapted to implement an encoding method according to any one of claims 1 to 11 and/or a decoding method according to any one of claims 23 to 38.

56. Digital signal processing apparatus, characterized in that it has an encoding device according to any one of claims 12 to 22 and/or a decoding device according to any one of claims 39 to 54.

57. Telecommunication network, characterized in that it has means adapted to implement an encoding method according to any one of claims 1 to 11 and/or a decoding method according to any one of claims 23 to 38.

58. Telecommunication network, characterized in that it has an encoding device according to any one of claims 12 to 22 and/or a decoding device according to any one of claims 39 to 54.

59. Mobile station in a telecommunications network, characterized in that it has means adapted to implement an encoding method according to any one of claims 1 to 11 and/or a decoding method according to any one of claims 23 to 38.

60. Mobile station in a telecommunication network, characterized in that it has an encoding device according to any one of claims 12 to 22 and/or a decoding device according to any one of claims 39 to 54.

61. Device for processing signals representing speech, characterized in that it has an encoding device according to any one of claims 12 to 22 and/or a decoding device according to any one of claims 39 to 54.

62. Data transmission device having a transmitter adapted to use a packet transmission protocol, characterized in that it has an encoding device according to any one of claims 12 to 22 and/or a decoding device according to any one of claims 39 to 54 and/or a device for processing signals representing speech according to claim 61.

63. Data transmission device according to claim 62, characterized in that said protocol is of the ATM type.

64. Data transmission device according to claim 62, characterized in that said protocol is of the IP type.

65. An information storage means which can be read by a compute, or a microprocessor storing instructions of a computer program, characterised in that it implements an encoding method according to any of claims 1 to 11 and/or a decoding method according to any of claims 23 to 38.

66. An information storage means which is removable, partially or totally, which can be read by a computer or microprocessor storing instructions of a computer program, characterised in that it implements an encoding method according to any of claims 1 to 11 and/or a decoding method according to any of claims 23 to 38.