Abstract:
A decoder for a series of received digital signal samples which are encoded as points in a 2-dimensional constellation of points corresponding to authorized code values, which constellation is sub-divided into a plurality of subsets. The branch length μ between a received point and the closest authorized point in a subset is calculated as a function of the magnitude and sign of the error distance between the received point and the closest authorized point of the constellation, and of the displacement between successive authorized points in the subsets. It is thus possible to determine branch length without calculation of squared values and without employing any approximations.

Description:
BACKGROUND OF THE INVENTION 
     The invention relates to a transmission system using block-coded or trellis-coded modulations based on a 2-dimensional QAM constellation divided into N sub-sets, and comprising a transmitter and a receiver which is provided with a decoder for decoding said modulations, which decoder comprises a module capable of calculating a distance between each received sample and the point which is closest thereto in each sub-set of the two-dimensional constellation. 
     Such a decoder renders it possible to decode a sequence of samples received through a channel with noise and resulting from convolutional coding or block coding of a sequence of items of information to be transmitted. The behaviour of a convolutional encoder is described by a trellis in which each transition between two states corresponds to the transmission of one point of the constellation, which is divided into sub-sets such that the distance between two points of a sub-set is greater than the distance which separates two points of the original constellation. 
     The Viterbi algorithm is known to be an optimum decoding method for convolutional codes. The principle of a Viterbi decoder is described in the article &#34;The Viterbi Algorithm&#34; by G. David Forney, published 3 Mar. 1973 in &#34;Proceedings of the IEEE&#34;. Briefly, it may be noted that decoding by means of a Viterbi decoder involves the following three steps: 
     For each sample of the ing sequence of two-dimensional samples of the recessed signal, that authorized point is to be found which is closest to said sample in each of a series of N sub-sets of the two-dimensional constellation. The branch lengths associated with sample are accordingly calculated on the basis of these N distances. Subsequently, the authorized sequence is to be found which is closest to the sequence of received samples received, i.e. that authorized sequence of which the path length (which is equal to the sum of the branch lengths which make up this path) is smallest. 
     Finally, the sequence of bits corresponding to the authorized sequence having this shortest path is to be found by means of the trellis. 
     In principle, the calculation of the branch lengths involves the use of the squared euclidian distance. This calculation of squared values is complicated and requires a high number of bits for its representation. A sufficiently fast memory is not available for certain applications, in particular in the field of hertzian beams where the data rates are very high. It is therefore necessary to simplify the calculation of the branch lengths so as to render possible installations without memory for the Viterbi algorithm. It is known, for example, to use the Manhattan Distance which replaces the sum of squares with a sum of absolute values, as disclosed in the proceedings of the third ECRR (European Conference on Radio Relay systems), edited by Terje Roste and Jonny Normann Skalvik, held in Paris from 17 to 20 Dec. 1991. However, this Manhattan distance has the following disadvantage: when the points received are situated at the boundary of the constellation, the distances thus obtained are subject to errors. 
     SUMMARY OF THE INVENTION 
     The present invention has for its object to provide a simple means for calculating the branch lengths with the minimum number of bits necessary, without approximation, thus rendering possible memoryless installations of the Viterbi decoder. 
     To achieve this object, a transmission system according to the invention, and as described in the introductory paragraph, is characterized in that the distance μ used for branch length is a relative distance given by the following function ℑ. 
     
         μ=ℑ[|Δ.sub.i |, sgn(Δ.sub.i), sgn(E.sub.i), |E.sub.i |] 
    
     in which 
     the index i indicates that this is the abscissa (i=x) or the ordinate (i=y) of the quantity indicated, 
     |Δ i  | represents the displacement between any two successive points of the constellation, 
     E i  is the abscissa or ordinate error distance, using the same index as for Δ i , between the point received and the authorized point which is closest thereto in the two-dimensional constellation, 
     sgn() indicates the sign function. 
     In a particularly advantageous realisation, the relative distance μ used is calculated from an expression of the type: ##EQU1## 
     In a first embodiment, the relative distance μ is obtained through the calculation of expressions of the type: 
     
         n·(n±|E.sub.i |) 
    
     in which n is a natural integer whose value, related to the subdivision of the constellation used, remains small. 
     All squaring has thus been eliminated here, without the introduction of an approximation, and has been replaced with a multiplication by a natural integer of small value, which is very simple to achieve. 
     In a second embodiment, in which the original constellation is subdivided into at most eight sub-sets, the relative distance μ is obtained through calculation of expressions of the type: 
     
         (1±|E.sub.i |) 
    
     when |Δ i  | is equal to 1, and through calculation of expressions of the type 
     
         (2±|E.sub.i |) 
    
     followed by a shifting of the result towards the bits of greatest weight when |Δ i  | is equal to 2. 
     Thus it is not necessary to use any multiplier or even any adder for this calculation step. 
     The invention also relates to a receiver for a transmission system as described above and to a decoder designed for use in such a receiver. 
    
    
     BRIEF DESCRIPTION OF THE DRAWING 
     Other particulars, details and advantages of the invention will become clear from the following description with reference to the annexed drawings, all given by way of non-limitative example, wherein: 
     FIG. 1 shows the different possible subdivisions of a two-dimensional QAM16 constellation, 
     FIG. 2 shows the positive quadrant of the four constellations QAM 16, 32, 64 and 128, 
     FIG. 3 is an example of a trellis of eight states which will be used in the ensuing description, 
     FIG. 4 is a block diagram of the operation of an example of a decoder which is to be used in a receiver with a transmission system according to the invention, 
     FIG. 5 is a block diagram of the operation of an example of the calculation module of such a decoder, 
     FIG. 6 is a diagram showing different zones of a cross constellation and a square constellation used for calculating displacement vectors, and 
     FIG. 7 represents a transmission system according to the invention. 
    
    
     DESCRIPTION OF THE PREFERRED EMBODIMENTS 
     In the following description, a four-dimensional constellation will be considered. This constellation A0×A0 is an assembly of pairs of points each belonging to a two-dimensional constellation A0 (we note that a product assembly A×B is defined by the cartesian product of the assembly A by the assembly B, i.e. that it is the assembly of the pairs (x,y) in which x.di-elect cons.A and y.di-elect cons.B) such that the transmission of a point of the constellation A0×A0 corresponds to the transmission of two consecutive points of the constellation A0. Thus the subdivision of the constellation A0×A0 is based on that of the constellation A0. 
     FIG. 1 shows the various possible subdivisions A, B, C, D and E of a two-dimensional QAM16 constellation. The original constellation A0 is formed by points interspaced by distances d 0 . In a first step, it is divided into two sub-sets B0 and B1 whose points are interspaced by distances d 1  =√2d 0 . In a second step, subsequently, each sub-set B0 and B1 is in its turn divided into two sub-sets C0 and C2 on the one hand and C1 and C3 on the other hand, such that two points of a sub-set C are interspaced by a distance d 2  =2d 0 . The sub-sets C are again divided each into two sub-sets, thus forming a subdivision D formed by eight sub-sets of two points interspaced by a distance d 3  =2·√2d 0 . Finally, each sub-set D is in its turn divided into two sub-sets forming a subdivision E, which comprises 16 sub-sets each containing a single point. 
     The ensuing description will deal with the subdivision C. 
     FIG. 2 shows the positive quadrant of each of four two-dimensional constellations QAM 16, 32, 64, 128, indicating to which of the four sub-sets C0, C1, C2 and C3 each of the points belongs. When we consider the window formed by the four points of the QAM16 constellation, the points with coordinates (1,1), (3,1), (3,3) and (1,3) belong to the sub-sets C0, C1, C2 and C3, respectively. When we enlarge this window by a distance 2d 0  parallel to the abscissa or the ordinate, the same diagram will be found for the other constellations. The other quadrants of the system may be readily deduced from the positive quadrant by rotation through a multiple of π/2. 
     The subdivision of the constellation A0×A0 into eight sub-sets numbered L0 to L7 then follows from the subdivision of the constellation A0 in the following way: 
     
         L0=C0×C0∪C2×C2, 
    
     
         L4=C0×C2∪C2×C0, 
    
     
         L2=C1×C1∪C3×C3, 
    
     
         L6=C1×C3∪C3×C1, 
    
     
         L1=C0×C3∪C2×C1, 
    
     
         L5=C0×C1∪C2×C3, 
    
     
         L3=C1×C0∪C3×C2, 
    
     
         L7=C1×C2∪C3×C0, 
    
     In which the symbols x and ∪ indicate the cartesian product and recombination of the two sets, respectively. 
     FIG. 3 shows the trellis used in the following description. This is an eight-state trellis numbered S0 to S7 which enables four transitions from each state, represented by arrows in the Figure. The passage from one state to another corresponds to the transmission of a four-dimensional point belonging to one of these eight sub-sets L0 to L7. It is thus possible to achieve the states of S0, S1, S2 or S3 from the states S0, S1, S4 and S5 by transmitting a respective point of the sub-sets L0, L4, L2 or L6; L6, L2, L4 or L0; L2, L4, L0 or L6; and L4, L0, L6 or L2, respectively. Similarly, it is possible to achieve the states S4, S5, S6 or S7 from the states S2, S3, S6 and S7 by transmitting a point of the sub-set L1, L5, L3 or L7; L7, L3, L5 or L1; L3, L7, L1 or L5; and L5, L1, L7 or L3, respectively. 
     FIG. 4 is a block diagram of an example of a decoder according to the invention capable of decoding a convolutional code described by such a trellis in optimum manner. This decoder comprises a first block 10 composed of two blocks 10A and 10B. 
     The block 10A is capable of calculating the four distances associated with each of the two two-dimensional points which were received. The two sets of four distances which result therefrom are mutually combined by the block 10B so as to obtain the eight branch paths Λ 0  to Λ 7  associated with the corresponding four-dimensional point. 
     Let Λ nj  be the distance between the n th  point received and the point which is closest thereto in the sub-set Cj (n taking the values 1 and 2 so as to indicate that it relates to the first or second two-dimensional point received, while j takes the values 0, 1, 2 and 3, indicating that it relates to the distance relative to sub-set C0, C1, C2 or C3, respectively). The eight four-dimensional branch paths Λ 0  to Λ 7  are then obtained from the following equations: 
     
         Λ.sub.0 =min(Λ.sub.1,0 +Λ.sub.2,0 ; Λ.sub.1,2 +Λ.sub.2,2) 
    
     
         Λ.sub.1 =min(Λ.sub.1,0 +Λ.sub.2,3 ; Λ.sub.1,2 +Λ.sub.2,1) 
    
     
         Λ.sub.2 =min(Λ.sub.1,1 +Λ.sub.2,1 ; Λ.sub.1,3 +Λ.sub.2,3) 
    
     
         Λ.sub.3 =min(Λ.sub.1,1 +Λ.sub.2,0 ; Λ.sub.1,3 +Λ.sub.2,2) 
    
     
         Λ.sub.4 =min(Λ.sub.1,2 +Λ.sub.2,2 ; Λ.sub.1,2 +Λ.sub.2,0) 
    
     
         Λ.sub.5 =min(Λ.sub.1,2 +Λ.sub.2,1 ; Λ.sub.1,2 +Λ.sub.2,3) 
    
     
         Λ.sub.6 =min(Λ.sub.1,3 +Λ.sub.2,3 ; Λ.sub.1,3 +Λ.sub.2,1) 
    
     
         Λ.sub.7 =min(Λ.sub.1,3 +Λ.sub.2,2 ; Λ.sub.1,3 +Λ.sub.2,0). 
    
     The block 11 then calculates for each of the eight possible states (defined by the trellis of FIG. 3) the four path lengths corresponding to authorized transitions between two states. Only the shortest of these path lengths is retained, which involves a selection for each of the eight possible states at moment t+1 of the state at moment t of which the state at moment t+1 is the most probable result. For example, the four possibilities for resulting in state &#34;0&#34; at moment t+1 are the following: 
     being in state &#34;0&#34; at moment t and having transmitted a point of sub-set L0, 
     being in state &#34;1&#34; at moment t and having transmitted a point of sub-set L6, 
     being in state &#34;4&#34; at moment t and having transmitted a point of sub-set L2, 
     being in state &#34;5&#34; at moment t and having transmitted a point of sub-set L4. 
     The path length retained accordingly is the following: 
     
         Γ.sub.0 (t+1)=min [Γ.sub.0 (t)+Λ.sub.0 ; Γ.sub.1 (t)+Λ.sub.6 ; Γ.sub.4 (t)+Λ.sub.2 ; Γ.sub.5 (t)+Λ.sub.4 ] 
    
     Then the block 12 allows us to select the shortest path length from among the eight which were calculated, and the block 13 finally finds the initial sequence of bits which corresponds to this shortest path, with the aid of the trellis, thus supplying at the output the most probable bit sequence originating from the transmitter. 
     FIG. 5 shows in detail a calculation unit 10A according to the invention. This is a module which comprises a limiter 20 which receives at the input the coordinates X and Y of the two-dimensional points to be processed as well as a variable Q coded in two bits which indicate the format of the constellation used (16, 32, 64 or 128). This limiting module renders it possible to collect on the boundary of the constellation the received points which are outside it, and supplies at the output any possibly modified coordinates X&#39; and Y&#39; corresponding to a point R of the constellation. These coordinates are supplied to inputs of blocks 21, 23, 25 and 26. The block 21 calculates the coordinates of point P 0  of the constellation which is closest to the received point R. The result is transmitted to blocks 24 and 25: 
     the block 24 determines to which sub-set Ci this point P 0  belongs and derives therefrom the values of variables I k   X  and I k   Y  defined in the description below, 
     and the block 25 calculates the error E which separates the received point R from the closest point P 0 . 
     The blocks 23, 26 and 28 calculate intermediate variables (g k , δ X  and δ Y , W k , respectively, which will be defined below) necessary for the calculation of three displacement vectors Δ k  (in which k=1, 2 or 3) which render it possible, starting from the point P 0 , to determine the three other neighbours P k  of the received point R in each of the three other sub-sets of the constellation. The block 26 receives at its input not only the coordinates X&#39; and Y&#39;, but also the variable Q and the error E of which it determines the sign. 
     The data coming from blocks 20, 21, 23, 24, 25 and 26 as well as the variable Q are stored in a first register 27 from which on the one hand the output data of the blocks 21, 23, 24, 26 and the variable Q are provided to the input of block 28, and on the other hand the dam coming from the blocks 20, 24, 25, 26 and 28 are stored in a second register 29. The dam coming from the blocks 20, 24, 26 and 28, available in register 29, are subsequently provided to the input of block 30 which calculates the three displacement vectors Δ k . The output of block 30 is connected to the input of block 31 which also receives the error E from block 25, available in register 29, and calculates the distances between the received point and the tour closest points in the original constellation. The results are stored in a third register 32. 
     The calculation principle of the displacement vectors Δ k  is explained below. When the sub-set Ci to which the constellation point P 0  belongs has been determined, which point is closest to the received point R the displacement is sought which renders it possible to determine the point P k  closest to the received point R in the sub-set Cj (with j=0, 1, 2 or 3 and j≠i). 
     It is necessary for this purpose to know which coordinate (abscissa and/or ordinate) is to be incremented as a function of the source (Ci) and destination (Cj) sub-sets. To pass from the source sub-set C0 to the destination sub-sets C1, C2 and C3 for example, it is necessary to increment the abscissa, the abscissa and the ordinate, and the ordinate of the closest point P 0 , respectively Two bits I k   X  and I k   Y  are thus defined, each indicating whether the abscissa and the ordinate of the point P 0  must be incremented or not for passing from the point P 0  to each of the three points P k . These two bits are determined in the following manner by the block 24: 
     
         I.sup.k.sub.X =b.sup.1.sub.s ⊕b.sup.1.sub.d βb.sup.0.sub.s ⊕b.sup.0.sub.d 
    
     
         I.sup.k.sub.Y =b.sup.1.sub.s ⊕b.sup.1.sub.d 
    
     in which (b 1   s , b 0   s ) and (b 1   d , b 0   d ) are the respective binary values of the indices (0, 1, 2, or 3) of the source sub-set and of the k th  destination sub-set, and in which the symbol ⊕ indicates the &#34;EXCLUSIVE OR&#34; operation. 
     The calculation of the displacement vector Δ k  then requires a distinction between several cases depending on the shape of the constellation and the zone of the constellation in which the R received point is situated. In fact, the general principle of calculating the displacement vector Δ k  consists in that a displacement is carried out in the direction of the error E. Two exceptions, however, should be taken into account. First, for the extreme points of the constellation, the direction of displacement must be reversed so as not to pass outside the constellation. Second, the constellations 32 and 128 are not square, and certain virtual points could be obtained as the closest points according to the general principle of estimating the displacement. In this case, the initial estimation must be modified. 
     The various cases which are to be taken into account are shown in FIG. 6 for the positive quadrant of the plane. In case CC of a cross constellation, three zones are to be distinguished. The third zone Z3 is that which extends the cross constellation so as to make it into a square. The second zone Z2 comprises all other points situated at the boundary of this square. The remainder of the points of the constellation form the first zone Z1. In the case SC of a square constellation, accordingly, the constellation is formed by the two first zones Z1 and Z2 only. 
     Two new quantities are defined in this Figure as well: these are 1max which is the upper limit of the abscissae and the ordinates of the points of the constellation (the boundary of the constellation is thus determined by the straight lines defined by X=1max+1 and Y=1max+1), and kmax which is the upper limit of the abscissae and the ordinates of the points of the square portion of the constellation. For square constellations, the quantities 1max and kmax are accordingly the same. 
     When the received point R belongs to the first zone Z1, the displacement Δ k  has a direction equal to that of the error E: 
     
         Δ.sup.k.sub.X =I.sup.k.sub.X ·sgn(E.sub.X) 
    
     
         Δ.sup.k.sub.Y =I.sup.k.sub.Y ·sgn(E.sub.Y) 
    
     When the received point R belongs to the second zone Z2, the direction of the displacement Δ k  is reversed compared with the preceding case: 
     
         Δ.sup.k.sub.X =-I.sup.k.sub.X ·sgn(E.sub.X) 
    
     
         Δ.sup.k.sub.Y =-I.sup.k.sub.Y ·sgn(E.sub.Y) 
    
     These two cases may thus be taken together into the following equation: 
     
         Δ.sup.k.sub.X =h.sub.X ·I.sup.k.sub.X ·sgn(E.sub.X) 
    
     
         Δ.sup.k.sub.Y =h.sub.Y ·I.sup.k.sub.Y ·sgn(E.sub.Y) 
    
     in which h X  and h Y  are variables defined by the following equations (I): ##EQU2## The point of the constellation obtained by such a displacement (I) is written P k  in the following description. 
     However, when the point received R belongs to the third zone Z3, the displacement obtained according to the equations (I) is only a first estimation which is to be modified in accordance with the following equations (II) so as to obtain the points P k  : 
     
         Δ.sup.k.sub.X =I.sup.k.sub.X ·h.sub.X ·sgn(E.sub.X)-2·sgn(X)·g.sub.k ·ƒ(P.sub.k) 
    
     
         Δ.sup.k.sub.Y =I.sup.k.sub.Y ·h.sub.Y ·sgn(E.sub.Y)-2·sgn(Y)·g.sub.k ·ƒ(P.sub.k) 
    
     in which the function f and the variables g k  are defined as follows: ##EQU3## These variables g k  indicate the position of the received point R in relation to the axes of symmetry of the two-dimensional sub-sets C0, C1, C2, C3, thus allowing a determination as to which is the closest point to R among the two possible points (point obtained by horizontal displacement or by vertical displacement relative to the first estimate P k ). The factor sgn(X) or sgn (Y) used in the preceding equation renders possible a general application to the four quadrants of the plane. 
     The general expression of the displacement Δ k  in binary format is the following: 
     
         Δ.sup.k.sub.X =I.sup.k.sub.X ·(1-2δ.sub.X)-2W.sup.k.sub.X ·(1-2S.sub.X) 
    
     
         Δ.sup.k.sub.Y =I.sup.k.sub.Y ·(1-2δ.sub.Y)-2W.sup.k.sub.Y ·(1-2S.sub.Y) 
    
     with 
     
         1-2S.sub.X =sgn(X)et 1-2S.sub.Y =sgn(Y) 
    
     
         1-2δ.sub.X =h.sub.X ·sgn(E.sub.X)et 1-2δ.sub.Y =h.sub.Y ·sgn(E.sub.Y) 
    
     
         W.sup.k.sub.X =f(P.sub.k)·g.sub.k  and W.sup.k.sub.Y =f(P.sub.k)·g.sub.k 
    
     This renders it possible to encode the displacement Δ k  with three bits Δ2, Δ1 and Δ0 obtained as indicated below: 
     
         Δ2=W·S+I·W·δ 
    
     
         Δ1=I·W+I·(W⊕δ) 
    
     
         Δ0=I 
    
     δ is calculated by the block 26 from the coordinates of the received point R, from the value of 1max for the constellation used, and from the error E. W is calculated by the block 28 which evaluates beforehand the value of f(P k ) for cross constellations in the following manner: 
     let (b3, b2, b1, b0) be the binary value of a component of point P 0 , then the value of f(P k ) for a QAM 32 constellation is given by the following calculation: 
     
         ƒ.sub.32 (P.sub.k)=I·(β.sub.2 +β.sub.2)+I·[δ·(β.sub.2 +β.sub.1 +β.sub.0)+δ·(β.sub.2 +β.sub.2 ·β.sub.1 ·β.sub.0)] 
    
     and for a QAM 128 constellation, it is given by the following calculation: 
     
         ƒ.sub.128 (P.sub.k)=I·β.sub.2 +I·[δ·(β.sub.2 +β.sub.2 ·β.sub.1 ·β.sub.0)+δ·β.sub.2 ·(β.sub.1 +β.sub.0)] 
    
     with 
     
         β.sub.2 =b3⊕b2 
    
     
         β.sub.1 =b3⊕b1 
    
     
         β.sub.0 =b3⊕b0 
    
     
         δ=b.sub.3 ⊕δ 
    
     The following step carried out by block 31 consists in a calculation of the four distances by means of these displacement vectors Δ k . As explained in the preceding paragraphs, the closest points are: 
     
         P.sub.k =P.sub.0 +2(Δ.sup.k.sub.X, Δ.sup.k.sub.Y) 
    
     in which Δ k   X  and Δ k   Y  may take the values 0, ±1, ±2 in the case of a subdivision C. 
     The euclidian distance μ k  between the received point R and the point P k  of the sub-set Cj is thus written: 
     
         μ.sub.k =|R-P.sub.k |.sup.2 
    
     
         μ.sub.k =|R-P.sub.0 -2(Δ.sup.k.sub.X Δ.sup.k.sub.Y)|.sup.2 
    
     
         μ.sub.k =|(E.sub.X,E.sub.Y)-2(Δ.sup.k.sub.X, Δ.sup.k.sub.Y)|.sup.2 
    
     
         μ.sub.k =E.sub.X.sup.2 =E.sub.Y.sup.2 +4μ.sub.k 
    
     with 
     
         μ.sub.k =(Δ.sup.k.sub.X).sup.2 +(Δ.sup.k.sub.Y).sup.2 -(Δ.sup.k.sub.X ·E.sub.X +Δ.sup.k.sub.Y ·E.sub.Y). 
    
     It is this relative distance μ k  which is used by the calculation module according to the invention. It may alternatively be written in the following way: 
     
         μ.sub.k =|·[Δ.sup.k.sub.X |-sgn(Δ.sup.k.sub.X)·sgn(E.sub.X)·.vertline.E.sub.X |]+|Δ.sup.k.sub.Y |·[|Δ.sup.k.sub.Y |-sgn(Δ.sup.k.sub.Y)·sgn(E.sub.Y)·.vertline.E.sub.Y |]. 
    
     which renders it possible to distinguish two cases: 
     
         if |Δ.sup.k |=1 then it suffices to calculate the term 1±|E|, 
    
     
         if |Δ.sup.k |=2, then it suffices to calculate the term 2±|E| 
    
     followed by a shifting operation of the bits towards the strong weights. No multiplier or even adder is accordingly necessary for carrying out these operations. 
     In a practical embodiment of a decoder according to the invention, the error E X , E Y  has been coded with three bits, thus having for its extreme value ±7/8, and a square constellation (QAM 16, 64 . . . ) is used. The displacements Δ k , accordingly, can only take the values 0 and ±1, since the value ±2 can only be obtained for the virtual points of a cross constellation. The relative distance μ k  then complies with the following inequality: 
     
         0≦μ.sub.k ≦1+1+7/8+7/8&lt;31/8 
    
     and is accordingly coded with five bits, while with the same parameters the square euclidian distance is coded with nine bits (μ≦265/16&lt;512/16). 
     The complexity of such a decoder, which strongly depends on the number of bits necessary for representing the path lengths, and thus the branch lengths, is reduced thereby without adversely affecting the calculation accuracy, so that the performance level of the decoder can be retained. 
     FIG. 7 is a diagram showing the principle of a transmission system according to the invention. Such a system consists of two identical transmitter/receivers 100 and 200, of which only the transmitters/receiver circuit 100 is shown in detail in the Figure. This transmitter/receiver circuit 100 comprises a transmitter 110 and a receiver 120. The receiver 120 comprises a reception antenna 121 connected to a first input of a mixer circuit 122 of which a second input is connected to the output of a local oscillator 123. The output of the mixer circuit is connected to a demodulation circuit 124 which again is connected to a decoder 125 such as described with reference to FIG. 4. The information received, available at the output of this decoder 125, is supplied to a user unit 126. 
     This user unit 126 is also connected to the transmitter 110 to which it provides the information to be transmitted, the transmitter 110 in its turn being connected to a transmission antenna 111. 
     It is obvious that modifications are possible for the embodiments described above, especially the substitution of equivalent technical means, without departing from the scope of the invention. In particular, the chosen subdivision, the dimension of the original constellation, and the trellises used could be different. When the subdivision chosen is not the subdivision C, the calculation of the displacements Δ k   X  and Δ k   Y  will have to be modified accordingly, and these displacements may have integer values for the higher subdivisions in excess of 2, in absolute value, but they will remain low such that there are no consequences for the complexity of the decoder.