LINK ADAPTATION METHOD USING A POLAR MODULATION CONSTELLATION

Abstract

The present invention relates to a method for adapting a link using a polar-modulation (PQAM) constellation. It applies in particular to the communications in the sub-THz band, in which the oscillator of the receiver has phase fluctuations. In a PQAM-modulation constellation, the modulation symbols are distributed on concentric circles equidistant in the complex plane, each circle including the same number of symbols, the angular distribution of the symbols on a circle being uniform and identical regardless of the circle. The adaptation of the link is carried out by taking into account the thermal noise as well as the phase noise.

Claims

1. Method for adapting a link between an emitter and a receiver, the emitter grouping together binary data to be transmitted in the form of blocks having a length m=log.sub.2M, and transforming said blocks into complex symbols via digital modulation to transmit them over a transmission channel, said symbols belonging to a polar-modulation constellation C(M,) of order M consisting of =2.sup.n equidistant concentric circles where m>n+1 and n>1, each of the concentric circles carrying the same plurality M/ of symbols, the angular distribution of said symbols being uniform and identical on each of the concentric circles, two successive symbols on a circle corresponding to two words of m bits having a Hamming distance equal to 1 and two symbols, in the same angular direction, belonging to two successive concentric circles, corresponding to two words of m bits having a Hamming distance equal to 1, said method for adapting a link being characterized in that: the emitter transmits (410) a sequence of control symbols to the receiver via the transmission channel; the receiver derives (420), from the control symbols received, an estimation of the variance in the additive noise as well as an estimation of the variance in the phase noise affecting the transmission channel and sends back (430) to the emitter, via an indicator of state of the channel, the estimated variances; the emitter reads (440) in a table stored in a memory, on the basis of the values of said variances and a target bit error rate, an order M as well as a number of concentric circles compatible with a target bit error rate; the emitter transmits (450), over the link, said binary data via a modulation constellation of order M and having a number of concentric circles, , thus read in the table.

2. Method for adapting a link according to claim 1, characterized in that for a target bit error rate BER, a pair of variances in additive noise .sub.n.sup.2 and a phase noise .sub.p.sup.2, the table contains a pair of optimal parameters M,, satisfying $\frac{2}{m}\left[Q\left(\sqrt{\frac{6.Math..Math.E_s.Math.\text{/}.Math.{}_n^2}{4.Math.{}^2-1}}\right)+Q\left(\frac{}{M.Math.\sqrt{{}_p^2+1.Math.\text{/}.Math.\left(2.Math..Math.E_s.Math.\text{/}.Math.{}_n^2\right)}}\right)\right]\mathrm{BER},$ where Q(.) is the complementary distribution function of the reduced centered normal distribution and E.sub.s is the energy per symbol.

3. Method for adapting a link according to claim 1, characterized in that the table also includes as an input parameters of various types of channel coding.

Description

BRIEF DESCRIPTION OF THE DRAWINGS

[0008] Other features and advantages of the invention will appear upon reading a preferred embodiment of the invention, described in reference to the appended drawings in which:

[0009] FIG. 1 shows an example of a modulation constellation used by a modulation method according to an embodiment of the present invention;

[0010] FIGS. 2A and 2B show curves of bit error rate as a function of the signal-to-noise ratio for a PQAM modulation method and a conventional QAM modulation method;

[0011] FIG. 3 shows a diagram of selection of a modulation constellation by a method for adapting a link according to an embodiment of the invention;

[0012] FIG. 4 shows the flowchart for a method for adapting a link according to an embodiment of the invention.

DETAILED DISCLOSURE OF SPECIFIC EMBODIMENTS

[0013] Below, communication over a transmission channel affected by phase noise between an emitter and a receiver will be considered. For example, the communication can be that between a base station and a mobile terminal in the sub-THz band. Recent measurement campaigns have shown that the direct path or LOS (Line Of Sight) dominated in such communications.

[0014] The signal received in the baseband at the time k can be expressed in the form:

r(k)=s(k)e.sup.j(k)+n(k) (1)

[0015] where s(k) is the symbol emitted at the time k, (k) is the phase noise representing the sum of the phase noise of the emitter and that of the receiver, n(k) is a sample of additive white Gaussian noise (AWGN) having a variance .sub.n.sup.2.

[0016] The phase noise can be considered as the sum of a Gaussian random variable (having a variance .sub.p.sup.2) and a Wiener (also called Wiener-Lvy) stochastic process, that is to say with stationary independent increments following a Gaussian distribution (having a variance .sub.w.sup.2). It can be shown that the spectral density of the phase noise is the sum of a constant (white noise) and of a Lorentzian contribution (Wiener-Lvy process). The Lorentzian contribution is dominant at the low frequencies but becomes negligible with respect to the white-noise component above a cutoff frequency proportional to the ratio

[00001]$\frac{{}_w^2}{{}_p^2}.$

When this cutoff frequency, f.sub.c, is less than

[00002]$\frac{B.c}{\sqrt{N}}$

where B is the width of the band used for the transmission, N is the length of a frame transmitted and

[00003]$c=\sqrt{\frac{\ln .Math.2}{2.Math.{}^2}},$

the Lorentzian contribution can be ignored. Since this condition is generally verified in sub-THz communications, hereinafter it is supposed, unless otherwise mentioned, that the Lorentzian contribution can be ignored in the phase noise.

[0017] The digital modulation method used by the present invention transforms words of m bits into complex symbols belonging to a modulation constellation, C, of order M where M=2.sup.m, the complex symbols modulating a carrier wave via quadrature modulation.

[0018] Said complex symbols are distributed over =2.sup.n equidistant concentric circles where m>n+1 and n>1, each of the concentric circles carrying the same plurality M/ of symbols. The angular distribution of the complex symbols is uniform and identical on each of the concentric circles. More precisely, the constellation C is defined by the set of complex symbols:

[00004]$\begin{array}{cc}C=\left\{\left(\frac{.Math.}{2}.Math.\left(2.Math.q-1\right).Math.\exp \left(j.Math.\frac{.Math.}{2}.Math.\left(2.Math.p-1\right)\right)\right)|1q;1p\frac{M}{}\right\}& \left(2\right)\end{array}$

where

[00005]$.Math.=\sqrt{E_s}.Math.\sqrt{\frac{1.Math.2}{4.Math.{}^2-1}}$

is the radial distance between consecutive concentric circles, E.sub.s is the average power of the symbols of the constellation, and where

[00006]$.Math.=2.Math..Math.\frac{}{M}$

is the angular offset between two consecutive symbols on the same concentric circle. Thus the modulation constellation is parameterized by the order of modulation, M, and the number of concentric circles, . Hereinafter it will therefore be noted as C(M,).

[0019] The successive symbols of a circle corresponding to two words of m bits having a Hamming distance equal to 1. Likewise, two symbols disposed on the same radius, that is to say aligned in the same angular direction, and belonging to two successive concentric circles, correspond to two words of m bits having a Hamming distance equal to 1. In other words, two adjacent modulation symbols, whether they are located on the same circle or on the same radius of the constellation, represent words only differing by a single bit.

[0020] For this purpose, each word of m bits to be modulated is coded into a word of a first Gray code having a size n and into a word of a second Gray code having a size (mn). In other words, the word to be modulated bw can be represented by:

bw=(b.sub.1.sup., . . . ,b.sub.n.sup.,b.sub.1.sup.0, . . . ,b.sub.(mn).sup.0) (3)

[0021] It consists of a first portion, b.sub.1.sup., . . . ,b.sub.n.sup., giving the index of the concentric circle on which the modulation symbol is located and of a second portion, b.sub.1.sup., . . . ,b.sub.(mn).sup. giving the index of the argument of this complex symbol.

[0022] Finally, the digital modulation used by the present invention can be considered as a bijective function F of {0,1}.sup.m in C(M,) such that:

[00007]$\begin{array}{cc}F\left(b.Math.w\right)=\frac{}{2}.Math.\left(2.Math.q-1\right).\exp \left(j.Math.\frac{.Math.}{2}.Math.\left(2.Math.p-1\right)\right)& \left(4\right)\end{array}$

where q is the integer corresponding to the word of the first Gray code b.sub.1.sup., . . . ,b.sub.n.sup. and is the integer corresponding to the word of the second Gray code b.sub.1.sup., . . . ,b.sub.(mn).sup.. This modulation method will conventionally be called PQAM (Polar-QAM).

[0023] FIG. 1 shows a PQAM digital modulation constellation that can be used in the context of the present invention.

[0024] More precisely, the constellation shown is the constellation C(16,4), that is to say of order M=16 (m=4) and having a number of concentric circles =4 (n=2). The radial distance between concentric circles is indicated by and the angular offset between successive symbols of the same circles is noted as (here =/2). In the present case, the two most significant bits (MSB) form a first Gray code indexing the concentric circles. The two most significant bits (LSB) form a second Gray code indexing the symbols on the same circle.

[0025] Upon reception, the decisions on the symbols are taken on the basis of the polar coordinates (.sub.r,.sub.r) of the received signal r. Hereinafter, the notation (.sub.s,.sub.s) will be used to designate the polar coordinates of a symbol s.

[0026] In the absence of coding, the bits can be estimated by taking a hard decision on the basis of the received signal. More precisely, the symbol transmitted is advantageously estimated by the receiver via:

[00008]$\begin{array}{cc}\hat{s}=\underset{s.Math.C}{\arg .Math..Math.\min }\left[{\left({}_s-{}_r\right)}^2+\frac{1}{{}^2}.Math.{\left({}_s-{}_r\right)}^2\right]& \left(5\right)\end{array}$

[0027] The bits transmitted then being estimated by ({circumflex over (b)}.sub.1, . . . ,{circumflex over (b)}.sub.m)=F.sup.1(). The term in brackets is a distance defined in polar coordinates, d.sub.(s,r), defined by:

[00009]$\begin{array}{cc}{d}_{}^2\left(s,r\right)={\left({}_s-{}_r\right)}^2+\frac{1}{{}^2}.Math.{\left({}_s-{}_r\right)}^2& \left(6\right)\end{array}$

[0028] where

[00010]$=\frac{{}_p^2}{{}_n^2}+\frac{1}{E_s},\frac{{}_p^2}{{}_n^2}$

is the ratio between the power of the phase noise and that of the additive (thermal) noise on the channel, and E.sub.s is the average energy of the symbols of the constellation.

[0029] In the presence of coding with probabilistic input, for example LDPC coding, the bits transmitted can be estimated by soft decision by calculating the logarithmic likelihood ratios:

[00011]$\begin{array}{cc}\mathrm{LLR}\left(b_i\right)=\log \left(\frac{p\left(b_i=1r\right)}{p\left(b_i=0r\right)}\right)& \left(7\right)\end{array}$

where p(b.sub.i=|r) represents the probability that the bit b.sub.i equals given that the received signal is the complex value r. The logarithmic likelihood ratios can be calculated by:

[00012]$\begin{array}{cc}\mathrm{LLR}\left(b_i\right)=\log \left(\frac{\underset{s_1{C}_1^i}{.Math.}.Math.p\left(r{s}_1\right)}{\underset{s_0{C}_0^i}{.Math.}.Math.p\left(r{s}_0\right)}\right)& \left(8\right)\end{array}$

where C.sub.0.sup.i (resp. C.sub.1.sup.i) is a subset of symbols of C(M,) satisfying b.sub.i=0 (resp. b.sub.i=1). The previous expression can be simplified via the max-log sum approximation (also called max-log), according to which the sums are approached by the dominant probability terms:

[00013]$\begin{array}{cc}\mathrm{LLR}\left(b_i\right)\underset{s_1{C}_1^i}{\max }.Math.\log \left(p\left(r{s}_1\right)\right)-\underset{s_0{C}_0^i}{\max }.Math.\log \left(p\left(r{s}_0\right)\right).Math..Math.\mathrm{or}.Math.\text{:}& \left(9\right)\\ \mathrm{LLR}\left(b_i\right)\underset{s_0{C}_0^i}{\min }.Math.\left(d_{}^2\left(r,s_0\right)\right)-\underset{s_1{C}_1^i}{\min }.Math.\left(d_{}^2\left(r,s_1\right)\right)& \left(10\right)\end{array}$

[0030] FIGS. 2A-2B show curves of bit error rate as a function of the ratio E.sub.b/N.sub.0 for PQAM modulation and a conventional QAM method.

[0031] The signal-to-noise ratio is equal to E.sub.s/(N.sub.0/2) where E.sub.s=mE.sub.b is the energy per symbol, E.sub.b is the energy per bit and N.sub.0 the bilateral spectral density of noise.

[0032] The curves are given for a phase-noise power .sub.p.sup.2 =0.1.

[0033] In the case of FIG. 2A, the modulation used had an order M=64 (words have a size m=6 bits) and in that of FIG. 2B it had an order M=256 (mots have a size m=8 bits), the number of concentric circles was =8 in the case of FIG. 2A and =32 in that of FIG. 2B.

[0034] The words subject to the digital modulation come from LDPC coding with a rate of with length of blocks of 1944 bits and soft decoding of the min-sum type and 50 decoding iterations.

[0035] It is noted that the level of BER obtained via the PQAM (or Polar-QAM in the drawings) modulation method is substantially less than that of a conventional QAM modulation of the same order, the difference occurring for an SNR of 13 dB when M=64 and of 20 dB when M=256.

[0036] The PQAM modulation disclosed above is used in a mechanism for adapting a link according to an embodiment of the invention. It is recalled that the adaptation of a link involves modifying, in an adaptive manner, the modulation and coding scheme (MCS scheme) of the bits of information according to the quality of the channel (in particular its signal-to-noise ratio), to obtain a target BER for a given bitrate, or inversely to obtain a target bitrate on the basis of a given BER.

[0037] In the present case, and in an original manner, the phase noise is also taken into account in the adaptation of the link.

[0038] The bit error rate,

[00014]$p_{\mathrm{be}}=\frac{p_{\mathrm{se}}}{m}$

can be calculated analytically via:

[00015]$\begin{array}{cc}{p}_{\mathrm{se}}=1-\mathrm{Pr}\left(\hat{s}=ss\right)=1-\left[\mathrm{Pr}\left(-\frac{}{2}<<\frac{}{2}\right).Math.\mathrm{Pr}\left(-\frac{}{2}<<\frac{}{2}\right)\right]& \left(12\right)\end{array}$

the decision region ML =s being defined by the ranges , around the symbol s.

[00016]$\begin{array}{cc}{p}_{\mathrm{se}}2\left[Q\left(\frac{}{2.Math.{}_n}\right)+Q\left(\frac{}{2.Math.\sqrt{{}_p^2+{}_n^2.Math.\text{/}.Math.E_s}}\right)\right]& \left(13\right)\end{array}$

where

[00017]$Q\left(x\right)=\frac{1}{\sqrt{2.Math.}}.Math.\underset{x}{\overset{}{}}.Math.\exp \left(-\frac{u^2}{2}\right).Math.\mathrm{du}$

is the complementary distribution function of the reduced centered normal distribution, N(0,1). Taking into account the expressions of and according to M and , and the fact that E.sub.b=E.sub.s/m:

[00018]$\begin{array}{cc}{p}_{\mathrm{be}}\frac{2}{m}\left[Q\left(\sqrt{\frac{3.Math.\mathrm{SNR}}{4.Math.{}^2-1}}\right)+Q\left(\frac{}{M.Math.\sqrt{{}_p^2+1.Math.\text{/}.Math.\mathrm{SNR}}}\right)\right]& \left(14\right)\end{array}$

where

[00019]$\mathrm{SNR}=\frac{2.Math.{\mathrm{mE}}_b}{N_0}.$

[0039] FIG. 3 shows a diagram of selection of a PQAM modulation constellation by a method for adapting a link according to an embodiment of the invention.

[0040] More precisely, this diagram gives, for a target bit error rate (here BER<10.sup.4), the modulation constellations compatible with a given level of phase noise and a given level of thermal noise. The abscissae show the signal-to-noise ratio, E.sub.b/N.sub.0, and the ordinates show the inverse of the power of the phase noise,

[00020]$\frac{1}{{}_p^2}.$

[0041] This diagram is obtained by calculating the BER from the expression (14), according to the signal-to-noise ratio E.sub.b/N.sub.0 and the phase-noise power, .sub.p.sup.2, for various values of M and . The values of M and compatibles with the target BER are indicated in the diagram.

[0042] FIG. 4 shows the flowchart for a method for adapting a link according to an embodiment of the invention.

[0043] In step 410, the emitter transmits a plurality N of control symbols, for example in a header of a transmission frame. These control symbols are by definition known to the receiver and are not necessarily part of a constellation C(M,) in the sense defined above. For example, symbols having the same amplitude {square root over (E.sub.s)} are chosen.

[0044] In step 420, the receiver estimates, on the basis of the received signal, the variances in thermal noise (or additive noise) and in phase noise affecting the transmission channel. More precisely:

[00021]$\begin{array}{cc}{}_n^2=\frac{1}{N}.Math.\underset{k=1}{\overset{N}{.Math.}}.Math..Math.{\left({}_k-\sqrt{E_s}\right)}^2.Math..Math.\mathrm{and}& \left(15.Math.\text{-}.Math.1\right)\\ {}_p^2=\frac{1}{N}.Math.\underset{k=1}{\overset{N}{.Math.}}.Math..Math.{\left({}_k-\arg \left(s_k\right)\right)}^2-\frac{{}_n^2}{E_s}& \left(15.Math.\text{-}.Math.2\right)\end{array}$

where s.sub.k, k=1, . . . ,N are the control symbols, and r(k)=.sub.ke.sup.j.sup.k, k=1, . . . ,N the signals received in the baseband, corresponding to these control symbols.

[0045] In step 430, the receiver returns to the emitter a piece of channel state information or CSI (Channel State Information) comprising an estimation of the phase-noise variance and an estimation of the variance in the thermal noise (or of the SNR,

[00022]$\frac{E_s}{{}_n^2}=\frac{{\mathrm{mE}}_b}{{}_n^2}).$

[0046] In step 440, the emitter consults a table, the inputs of which (discretized) are the target bit error rate (BER) and the variances in thermal noise and phase noise. This table gives the optimal values of the parameters M, compatible with the triplet of inputs provided (namely the variance in additive noise, the variance in the phase noise and the target bit error rate).

[0047] If necessary, this table also includes as an input the parameters of various types of channel coding with various rates. In all cases, the table in question has been precalculated and stored in a memory of the emitter. It contains the values M, of the constellations C(M,) compatible with the triple of inputs provided. More particularly, it contains the optimal values M, satisfying the constraint:

[00023]$\begin{array}{cc}\frac{2}{m}\left[Q\left(\sqrt{\frac{6.Math..Math.E_s.Math.\text{/}.Math.{}_n^2}{4.Math.{}^2-1}}\right)+Q\left(\frac{}{M.Math.\sqrt{{}_p^2+1.Math.\text{/}.Math.\left(2.Math..Math.E_s.Math.\text{/}.Math.{}_n^2\right)}}\right)\right]\mathrm{BER}& \left(16\right)\end{array}$

with the same notation conventions as in the expression (14).

[0048] In step 450, the emitter modulates the binary data (if necessary after having coded them via channel coding) by grouping by blocks of log.sub.2 (M) bits to generate the corresponding modulation symbols of the constellation C(M,). These modulation symbols then modulate a carrier via quadrature modulation, in a manner known per se.