SYSTEM FOR DEMODULATING OR FOR BLIND SEARCHING THE CHARACTERISTICS OF DIGITAL TELECOMMUNICATION SIGNALS

Abstract

The present invention relates to a system for demodulating or blind searching the characteristics of digital telecommunication signals, characterized in that it comprises at least one hardware architecture or hardware and firmware comprising memories and one or more processing units for implementing a network of specific computation blocks connected together, including a first specialized block of the network estimating at least one filter for acquiring the blind signal, and a second block subsequently producing at least one module for estimating the amplification of the observed signals in order to subsequently assess the other characteristics of the signals observed by the other computation blocks of the network, at least a third specialized computation block producing a decision-making module for computing an error signal and back-propagating the computed errors to each of the preceding residual blocks (propagate, update).

Claims

1. System for demodulating or blind searching the characteristics of digital telecommunication signals, based on the observation by sampling of a signal comprising parameters comprising, in particular, the equalization coefficients, the value of the phase (), the amplitude of the signal, their frequency and their symbol time, characterized in that it comprises at least one hardware architecture or hardware and firmware comprising memories and one or more processing units for implementing a network of specific computation blocks connected to each other, of which a first specialized block of the network performs the estimation of at least one filter for blind signal acquisition, and then a second block implements at least one module making it possible to estimate the amplification of the observed signals in order to subsequently evaluate the other characteristics of the signals observed by the other computation blocks of the network, at least a third specialized computation block implements a decision module to calculate an error signal and back-propagate the computed errors to each of the previous residual (propagate, update) blocks.

2. System for demodulating or blind searching the characteristics of digital telecommunication signals, according to claim 1, characterized in that it comprises a specialized additional block connected to the outputs of the second block and to the inputs of the decision block, this additional block implementing at least one frequency estimation module for determining the frequencies of the blind-transmitted signals and/or at least one phase module for determining the phase values of said signals.

3. System for demodulating or blind searching the characteristics of digital telecommunication signals, according to claim 2, characterized in that the phase module can be arranged in an additional computation block connected to the outputs of the frequency computation block of the additional block.

4. System for demodulating or blind searching the characteristics of digital telecommunication signals according to one of claims 1 to 3, characterized in that, upon initialization of the system, parameters .sub.i are provided by default by a system memory, allowing in the first instants, known as convergence phase, the convergence of the .sub.i on the relevant values; then, when the system reaches a defined vicinity of the parameters .sub.i, the system enters a so-called production or monitoring phase, in which the distances between the calculated values and those stored and defining a vicinity are less than some pre-stored thresholds, the outputs of the demodulator system are then reliable and usable to apply them to a user device or to other hardware or software or firmware elements making it possible to finalize the demodulation.

5. System for demodulating or blind searching the characteristics of multi-channel digital telecommunication signals according to claim 3 or 4, characterized in that each of the processing blocks N0 of at least one of the two channels receives each of the two input signals (x.sup.h.sub.0, x.sup.v.sub.0) representing respectively a sampling of each channel, to generate the output signals x.sup.v.sub.1 and x.sup.h.sub.1, the signals x.sub.3.sup.h and x.sub.3.sup.v being representative of a correction applied to each signal x.sub.0 by the respective output signals x.sub.2.sup.v, x.sub.2.sup.h, of each of the filters G of each channel, each emulated by a processing block N2, the signals x.sub.3.sup.h and x.sub.3.sup.v are sent to the serial cascades of the processing blocks N3, N4 and N5 of each channel, each emulating the signal indicating the amplification of the channel (ampli), for block N3, respectively the frequency (fq) of the channel for block N4 and respectively the phase () of the channel for block N5.

6. System for demodulating or blind searching the characteristics of multichannel digital telecommunication signals, according to claim 5, characterized in that each respective output y.sup.h, y.sup.v of each processing block N5 emulating the phase of each channel H and V is sent to each decision block N6 of each channel and to each of the respective inputs of the back-propagation circuit of at least two errors (e.sup.h and e.sup.v) through the mirror blocks which allow the on-the-fly calculation of the increments of the different parameters of the blocks of the chain, the system comprising several processing modules of a plurality of observations of each input signal (x.sub.i), each associated with an Update mirror or residual block for each phase, frequency and amplification parameter and a corresponding Propagate mirror or residual block for each phase, frequency and amplification parameter.

7. System for demodulating or blind searching the characteristics of multichannel digital telecommunication signals, according to claim 5 or 6, characterized in that the output Z.sup.h, Z.sup.v of each decision block, is also sent to a pair of multipliers (M.sub.1.sup.h, M.sub.2.sup.h, M.sub.1.sup.v, M.sub.2.sup.v), respectively receiving, one from the phase block and the other from the frequency block fq; the output of the last multiplier M.sub.2.sup.i of each channel is sent to each of the filters G of each channel, each emulated by a processing block (N.sub.2.sup.h, N.sub.2.sup.v) of each channel.

8. Real-time method of separation and blind demodulation of digital telecommunication signals, based on the observation of a sampled version of this signal and comprising parameters, in particular the equalization coefficients, the value of the phase (), the amplitude of the signal, their frequency and their symbol time, this method comprising the following steps: acquisition, by a sampling, of a first plurality of the signal in order to each constitute an input of a network of L processing blocks (G.sub.i, F.sub.i, H.sub.i) also referred to here as specialized neurons, each neuron being simulated by the outputs of the preceding block, the first plurality of the signal being input into the first block simulating a first neuron of the network in order to generate a plurality of outputs of the first block; each neuron F.sub.i being simulated by the outputs of an upstream chain G.sub.i and stimulating a downstream chain H.sub.i; each set of samples passes through the same processing chain; the outputs of the last blocks of the network ideally correspond to the demodulated symbols; addition of a nonlinearity to each of the outputs of the last block of the network making it possible to calculate an error signal and propagation of this error in the reverse direction of the processing chain (back-propagation); estimation, upon receipt of the error by each neuron (i), of a corrective term .sub.i and updating, in each block, of the value of the parameter .sub.i according to .sub.i+=.sub.i.

9. Method according to claim 8, characterized in that each neuron (F.sub.i) of the network specifically performs: a processing of a Next function, implemented and executed in a processing logic sub-block (F.sub.i.sup.(N)), to generate outputs from a plurality of signal observations and transmit them to the processing block of the next neuron of the network; this function is generally written as (X.sub.i+1,0, . . . , X.sub.i+1,m.sub.i+1.sub.1)=next(X.sub.i,0, . . . X.sub.i,m.sub.i.sub.1) with m.sub.i being the number of inputs and m.sub.i+1 the number of outputs of F.sub.i.sup.(N) which corresponds to the number of inputs of F.sub.i+1.sup.(N); a processing of a Propagate function, implemented and executed in a Propagate logic sub-block (F.sub.i.sup.(P)) in order to calculate the errors (e.sub.i+1,0, . . . , e.sub.i+1,m.sub.i+1.sub.12) provided by the block F.sub.i+1.sup.(P) or by (e.sub.L1,0, . . . , e.sub.L1,N1)=(e.sub.0, . . . , e.sub.N1) with e.sub.j=z.sub.Jy.sub.J at the chain end, i.e. at the input F.sub.L1.sup.(P); for the i.sup.th neuron, this function is generally written in the form (e.sub.i,0, . . . , e.sub.i,m.sub.i.sub.1)=propagate(e.sub.i+1,0, . . . e.sub.i+1,m.sub.i+1.sub.1) a processing of an Update function, implemented and executed in an Update logic sub-block (F.sub.i.sup.(U)), in order to calculate corrective parameters .sub.i to be applied to the current value of the internally stored parameter .sub.i from the errors (e.sub.i+1,0, . . . , e.sub.i+1,m.sub.i+1.sub.1) returned by the sub-block F.sub.i+1.sup.(P); this function is generally written in the form .sub.i=update(e.sub.i+1,0, . . . , e.sub.i+1,m.sub.i+1.sub.1).

10. Method according to claim 9, characterized in that each neuron (F.sub.i) comprises at least one implementation and one execution of a sequence of elementary processings of the following form: the sub-block F.sub.i.sup.(N) performs(X.sub.i+1,0, . . . X.sub.i+1,m.sub.i+1.sub.1)=next(X.sub.i,0, . . . , X.sub.i,m.sub.i.sub.1), X.sub.ijK.sup.q.sup.ij where q.sub.ij is an integer and K is the real number space or the complex number space the sub-block F.sub.i.sup.(p) performs (e.sub.i,0, . . . , e.sub.i,m.sub.i.sub.1)=propagate(e.sub.i+1,0, . . . , e.sub.i+1,m.sub.i+1.sub.1) the sub-block F.sub.i.sup.(U) performs .sub.i=update(e.sub.i+1,0, . . . , e.sub.i+1,m.sub.i+1.sub.1)

11. Method according to one of claims 8 to 10, characterized in that the addition of the non-linearity to the output of the last block (H.sub.i.sup.(N)) of the network is implemented by the function:
z.sub.j=NL(y.sub.i) wherein z.sub.j is the outgoing signal from a decision-making device in the last block y.sub.j is an equalized or demodulated sample the decision block being defined by the comparison of the result obtained by the output y of the phase block with a finite constellation of possible results stored by the decision block, and deciding to take, from the possible results, the one for which the distance with the representative point of the output y is the smallest.

12. Method according to claims 8 to 11, characterized in that the back-propagation of the computed errors is obtained by the following processing, implemented and executed by an algorithm for back-propagation of the error: initialization of the back-propagation in the form
for 0k<N, e.sub.L,k=z.sub.ky.sub.k Propagation of the error by the sub-neuron F.sub.i.sup.(P) in the function (e.sub.i,0, . . . , e.sub.i,m.sub.i.sub.1)=propagate(e.sub.i+1,0, . . . , e.sub.i+1,m.sub.i+1.sub.1) according to the calculations $0j<m_i,e_{i,j}={.Math.}_k.Math.e_{i+1,k}.Math.\frac{F_{i,k}}{x_{i,j}}$

13. Method according to claim 12, characterized in that the updating of the internal parameters .sub.i of each neuron F.sub.i is obtained in the sub-neuron F.sub.i.sup.(U) by the processing, implemented and executed in the function .sub.i=update(e.sub.i+1,0, . . . e.sub.i+1,m.sub.i+1.sub.1), according to: Calculation of .sub.i: $\mathrm{For}.Math..Math.0j<M_{i+1},D_{i,j}=e_{i+1,j}.Math.\frac{F_{i,j}^{\left(N\right)}}{{}_i}$
.sub.i=.sub.jD.sub.i,j Updating of .sub.i:
.sub.i=2 R(.sub.i) if .sub.i is in a Rvector space
.sub.i=2 .sub.i if .sub.i is in a Cvector space Where.sub.i is a real parameter called learning speed. .sub.i is the corrective parameter of the parameter .sub.i D.sub.ij is an intermediate quantity of auxiliary calculations that can be temporarily stored.

14. Method according to any one of claims 9 to 13, characterized in that as the samples input into the system are processed by the different sub-blocks, the arbitrarily initialized values of the different .sub.i converge on values making the demodulation effective.

15. Method according to any one of claims 8 to 14, characterized in that the specialized neuron network constitutes a sequence of MIMO (multi inputs, multi outputs) blocks.

16. Method according to one of claims 8 to 15, characterized in that it further comprises the storage, by at least one buffer memory, of the plurality of inputs and in at least one other buffer of the plurality of outputs of each specialized neuron of the network.

17. Computer program product implemented on a memory medium, executed within a computing processing unit and comprising instructions for implementing a method according to any one of claims 8 to 16.

18. Product for implementing a method according to claim 17, characterized in that it comprises hardware or a combination of hardware and firmware, and comprising coded instructions for implementing the method.

19. Use in a system for the blind demodulation of a telecommunication signal, the system comprising at least one network of specialized neurons each respectively defining a filtering by a first specialized neuron, an amplification gain by a second specialized neuron, the frequency of the signal by a third specialized neuron and the phase value of the signal by a fourth specialized neuron; characterized in that the method according to any one of claims 8 to 16 is executed in order to determine the characteristics of the blind-transmitted signal.

Description

DESCRIPTION OF THE ILLUSTRATIVE FIGURES

[0061] Other special features and advantages of the present invention will become clear from reading the following description, made in reference to the appended drawings, wherein:

[0062] FIG. 1 schematically shows the integration of a specialized neuron F.sub.i in a set of upstream neurons (G.sub.i) and a set of downstream neurons (H.sub.i) of a real-time method for the separation and blind demodulation of digital telecommunication signals, to be implemented in at least one embodiment of the invention;

[0063] FIG. 2 schematically shows the processes carried out by the specialized neuron named of the network, according to one embodiment of the invention;

[0064] FIG. 3 schematically shows a processing chain of a single-channel blind demodulator, according to one embodiment of the invention;

[0065] FIGS. 4 and 5 schematically show a processing chain of a multi-channel blind demodulator (comprising at least two channels), respectively allowing the generation and transmission to the next block of a plurality of outputs of the preceding block and the back-propagation of the computed errors represented in FIG. 5.

[0066] The same references may designate identical or similar elements in the different figures.

DESCRIPTION OF THE PREFERRED EMBODIMENTS OF THE INVENTION

[0067] It will be noted hereinafter that each specialized neuron of the network corresponds to a processing logic block and comprises at least one functional sub-block or sub-module (or computation operator). Each of the blocks of the neurons comprises at least one computing machine and a software or code that can be executed by the machine in order to define one or more parameter(s) obtained by calculating one or more analytic function(s) (whether real or complex, and of one or more specific dimension(s).

This invention relates to a real-time method for the blind demodulation of digital telecommunication signals, based on the observation by sampling of a signal; this signal corresponds to the reception of a linear-modulation signal that has undergone deformations during transmission thereof, the processing process comprising the following steps: [0068] acquisition by sampling of m.sub.0 signals, (x.sub.0,0, . . . , x.sub.0,m.sub.0.sub.1) in order for each to constitute an input of a network of specialized neurons; each neuron F.sub.i being simulated by the outputs of an upstream chain G.sub.i and stimulating a downstream chain H.sub.i; each set of samples passes through the same processing chain; [0069] for each new input sample, each sub-neuron F.sub.i.sup.(N) is stimulated by the outputs of the upstream chain G.sub.i.sup.(N) consisting of the cascading of the specialized neurons F.sub.0.sup.(N) to F.sub.i1.sup.(N) and stimulating the downstream chain H.sub.i.sup.(N) consisting of the specialized neurons F.sub.i+1.sup.(N) to F.sub.L1.sup.(N); the processing carried out by the sub-module F.sub.i.sup.(N) depends on a parameter stored internally .sub.i; the outputs of the last neuron F.sub.L1.sup.(N) constitute the outputs of interest of the system or the demodulated signals and are noted as y.sub.0 . . . y.sub.N; [0070] a nonlinear function (NL) is applied independently to each demodulated signal y.sub.j to produce the variables (z.sub.j) and calculate the chain-end errors e.sub.j=z.sub.Jy.sub.J; back-propagation of the error and updating of the parameter .sub.i; [0071] an error signal passes through the network in the opposite direction: from neuron F.sub.L1 to neuron F.sub.0; the input error of neuron F.sub.L1 is the vector (e.sub.L1,0, . . . , e.sub.L1,N1)=(e.sub.0, . . . , e.sub.N1); as it passes through neuron j, the error is modified by sub-neuron F.sub.j.sup.(P) before being transmitted to neuron F.sub.j1; in parallel with the back-propagation of the error from neuron j to neuron j1, the error coming from neuron j+1 is input to the sub-neuron F.sub.j.sup.(U) which produces a corrective term .sub.i which allows the internal parameter .sub.i to be updated according to .sub.i+=.sub.i.

[0072] This computed error can correct the current value of 0.sub.1 for each block. The outputs of the last blocks of the network ideally correspond to the demodulated symbols.

[0073] These telecommunication signals can include deformations comprising, in particular: a channel filter (and a co-channel filter in the dual-channel case), an amplification, a phase value, a carrier leak, noise and other stochastic disturbances such as phase noise. Thus, according to the invention, the demodulation network will correct these different effects through specialized processing neurons. Specialized processing neurons are intended to mean one or more functions of which the parameters can be updated by back-propagation.

[0074] In some embodiments, the parameters .sub.i of the different processing blocks are initially predefined, for example arbitrarily without deviating from the expected values. For each sample entering the system and for each neuron i, our system produces a corrective term .sub.i which is added to the current value of the parameter .sub.i:.sub.i+=.sub.i. This update equation produces a sequence of values of .sub.i which converge on the value .sub.i which makes it possible to best demodulate the input signal.

[0075] In some embodiments, each neuron F.sub.i of the network specifically carries out: [0076] a processing of a next function, implemented and executed in the processing logic sub-block F.sub.i.sup.(N) to generate outputs from a plurality of signal observations and transmit them to the processing block of the next neuron of the network; for the neuron F.sub.i, this function is generally written with its inputs/outputs as (X.sub.i+1,0, . . . , X.sub.i+1,m.sub.i+1.sub.1)=next(X.sub.i,0, . . . , X.sub.i,m.sub.i.sub.1) where m.sub.i is the number of inputs and m.sub.i+1 is the number of outputs of F.sub.i.sup.(N) which corresponds to the number of inputs of F.sub.i+1.sup.(N). Each processing is parameterized by a set of parameters .sub.i hence the notation f.sub.i.sup.(N)=F.sub.i.sup.(N) (|.sub.i) when it is sought to recall the importance of the parameterization. Each Next function is shown in FIGS. 3 to 5 by a block N.sub.i; [0077] a processing of a Propagate function, implemented in the logic sub-block F.sub.i.sup.(P)) to calculate the errors (e.sub.i,0, . . . , e.sub.i,m.sub.i.sub.1) from the errors (e.sub.i+1,0, . . . , e.sub.i+1,m.sub.i+1.sub.1) provided by the block F.sub.i+1.sup.(P) or by (e.sub.L1,0, . . . , e.sub.L1,N1)=(e.sub.0, . . . , e.sub.N1) with e.sub.j=z.sub.Jy.sub.J either at the end of the chain or at the input F.sub.L1.sup.(P). This function is written, for the i.sup.th neuron: (e.sub.i,0, . . . , e.sub.i,m.sub.i.sub.1)=propagate(e.sub.i+1,0, . . . , e.sub.i+1,m.sub.i+1.sup.1). Each Propagate function is shown in FIGS. 3 to 5 by a block P.sub.i called residual block; [0078] a processing of an Update function, implemented and executed in the logic sub-block F.sub.i.sup.(U) to calculate the corrective term .sub.i to be applied to the current value of the internally stored parameter .sub.i from the errors (e.sub.i+1,0, . . . , e.sub.i+1,m.sub.i+1.sub.1) returned by the sub-block F.sub.i+1.sup.(P). This function is generally written as follows: .sub.i=update(e.sub.i+1,0, . . . , e.sub.i+1,m.sub.i+1.sub.1). Each Update function is shown in FIGS. 3 to 5 by a U.sub.i block called the residual block.

[0079] Implemented and executed is intended to mean either the execution of a program corresponding to the mathematical functions or formulas (explained in the text) by computing hardware (such as a microprocessor and a memory), or by hardware or a combination of hardware and firmware.

[0080] Thus, as shown, for example, in FIG. 2, each neuron F.sub.i encapsulates at least two logic sub-neurons which each implement at least one of the two functions update and next below and the propagate function which is not necessarily implemented by the first block (G.sub.i):

F.sub.i.sup.(N)implements(X.sub.i+1,0, . . . ,X.sub.i+1,m.sub.i+1.sub.1)=next(X.sub.i,0, . . . X.sub.i,m.sub.i.sub.1)

F.sub.i.sup.(P) implements(e.sub.i,0, . . . ,e.sub.i,m.sub.i.sub.1)=propagate(e.sub.i+1,0, . . . ,e.sub.i+1,m.sub.i+1.sub.1)

F.sub.i.sup.(U) implements .sub.i=update(e.sub.i+1,0, . . . ,e.sub.i+1,m.sub.i+1.sub.1)

[0081] FIG. 1, for example, schematically shows the integration of a specialized neuron F.sub.i in an upstream chain or set of neurons (G.sub.i) and in a downstream chain or set of neurons (H.sub.i) of a real-time method for the blind demodulation of digital telecommunication signals. The neuron F.sub.i is connected at the input to the last of the neurons of the set G.sub.i, and at the output of the first of the set H.sub.i.

[0082] In some embodiments, one of the processing blocks F.sub.i.sup.(N) comprises at least one program implementing and executing a sequence of elementary processes of the following form: [0083] F.sub.i.sup.(N) performs(X.sub.i+1,0, . . . , X.sub.i+1,m.sub.i+1.sub.1)=next(X.sub.i,0, . . . , X.sub.i,m.sub.i.sub.1),X.sub.ijK.sup.qij where q.sub.ij is an integer and K is the real number space or the complex number space. [0084] F.sub.i.sup.(P) performs(e.sub.i,0, . . . , e.sub.i,m.sub.i.sub.1)=propagate(e.sub.i+1,0, . . . , e.sub.i+1,m.sub.i+1.sub.1) [0085] F.sub.i.sup.(U)performs .sub.i=update(e.sub.i+1,0, . . . , e.sub.i+1,m.sub.i+1.sub.1)

[0086] The processing performed by the block (F.sub.i.sup.(N)) depends on a parameter .sub.i which can be a real or a complex number, a vector which is itself either real or complex, etc.

[0087] In some embodiments, the Next function implemented in the sub-neuron or sub-block F.sub.i.sup.(N) is analytically known and depends on a parameter

[0088] It can be noted (X.sub.i+1,0, . . . , X.sub.i+1,m.sub.i+1.sub.1)=F.sub.i.sup.(N) (X.sub.i,0, . . . X.sub.i,m.sub.i.sub.1|.sub.i).

[0089] The elementary projections of the output vector on the component X.sub.i+1,j can be noted as F.sub.i,j.sup.(N).

[0090] In some embodiments, as shown, for example, in FIG. 1, a network of specialized neurons (which can be arranged in a demodulator) for blind demodulation of a telecommunication signal in linear modulation, comprises in each of the neurons a processing block (G.sub.i.sup.(N), F.sub.i.sup.(N), H.sub.i.sup.(N)). The first processing block (G.sub.i.sup.(N)) receives two signals each corresponding to a first plurality of observations of the signal in order to generate a plurality of outputs which are transmitted to the following logic block (F.sub.i.sup.(N)). The logic block (F.sub.i.sup.(N)) integrates the plurality of outputs to generate in turn another plurality of outputs which are transmitted to the last logic block (H.sub.i.sup.(N)) of the network. This last block (H.sub.i.sup.(N)) in turn integrates the plurality of outputs of the previous logic block (F.sub.i.sup.(N)) to also generate a plurality of outputs. A nonlinear filter is applied to the output of the last block (H.sub.i.sup.(N)), in order to calculate an error signal (e) to be able to back-propagate this computed error to each of the inputs of the network associated with the respective input of the network.

[0091] In some embodiments, the set of L blocks can execute a processing chain of the following form, implemented and executed by at least one program:

For every 0i<L

[00003]$\left(y,\mathrm{.Math.}.Math.,y_{N-1}\right)=H_i^{\left(N\right)}\left(F_{i,0}^{\left(N\right)}\left(x_{i,0}.Math..Math.\mathrm{.Math.}.Math..Math.x_{i,M_i-1}|{}_0\right),\mathrm{.Math.}.Math.,F_{i,N_i-1}^{\left(N\right)}\left(x_{i,0}.Math..Math.\mathrm{.Math.}.Math..Math.x_{i,M_i-1}|{}_{n_i-1}\right)|{}_{i+1:L-1}\right)$$.Math.\mathrm{with}.Math.\left(x_{i,0},\mathrm{.Math.}.Math.,x_{i,m_i-1}\right)=G_i^{}\left(x_{0,0},\mathrm{.Math.}.Math.,x_{0,m_0-1}|{}_{0:i-1}\right)=\left(G_{i.Math..Math.0}^{}\left(x_{0,0},\mathrm{.Math.}.Math.,x_{0,m_0-1}|{}_{0:i-1}\right),\mathrm{.Math.}.Math.,G_{i,m_i-1}^{}\left(x_{0,0},\mathrm{.Math.}.Math.,x_{0,m_0-1}.Math.{}_{0:i-1}\right)\right)$

[0092] A number of L blocks are chained in succession to perform an overall processing.

[0093] The chaining of blocks 0 to i1 is noted as G.sub.i.sup.(N))( . . . |.sup.0:11) and the succession of blocks i+1 to L1 is noted as H.sub.i.sup.((N))( . . . |.sup.i+1:L1). The outputs of the last block are noted as y.sub.0, . . . , y.sub.N1.

[0094] Note that in F.sub.i,0.sup.(N)(x.sub.i,0 . . . x.sub.i,m.sub.i.sub.1|.sub.i), . . . , F.sub.i,n.sub.i.sub.1.sup.(N)(x.sub.i,0 . . . x.sub.i,m.sub.i.sub.1|.sub.i) the n.sub.i projection functions are giving Y.sub.i,k=F.sub.i,k.sup.(N)(x.sub.i,0 . . . x.sub.i,m.sub.i.sub.1|.sub.i) for 0k<n.sub.i.

[0095] In some embodiments, the variables on which each block output depends can be explained according to the following notation: y.sub.j=y.sub.j.sup.(x.sub.0,0 . . . x.sub.0,m.sub.0.sub.1). Each block output can be a real or complex value or even a vector value.

[0096] In some embodiments, the addition of the nonlinearity at the output of the last block (H.sub.i.sup.(N)) of the network is executed by a function implemented in a program which is written as:

z.sub.j=NL(y.sub.j) wherein [0097] z.sub.j is the outgoing signal from a decision-making device in the last block [0098] y.sub.j is a demodulated sample

[0099] In some embodiments, the back-propagation of the computed errors is obtained by the following processes, implemented and executed by an algorithm for back-propagation of the error: [0100] initialization of the back-propagation in the form

for 0k<N, e.sub.L,k=z.sub.ky.sub.k [0101] Propagation of the error by the sub-neuron F.sub.i.sup.(P) in the function (e.sub.i,0, . . . , e.sub.i,m.sub.i.sub.1)=propagate(e.sub.i+1,0, . . . , e.sub.i+1,m.sub.i+1.sub.1) according to the calculations

[00004]$0j<m_i,e_{i,j}={.Math.}_k.Math.e_{i+1,k}.Math.\frac{F_{i,k}}{x_{i,j}}$

[0102] In some embodiments, the update of the internal parameters .sub.i of each neuron F.sub.i is obtained in the sub-neuron F.sub.i.sup.(U) by the processes, implemented and executed in the function .sub.i=update(e.sub.i+1,0, . . . , e.sub.i+1,m.sub.i+1.sub.1) according to: [0103] Calculation of .sub.i:

[00005]$\mathrm{For}.Math..Math.0j<M_{i+1},D_{i,j}=e_{i+1,j}.Math.\frac{F_{i,j}^{\left(N\right)}}{{}_i}$${}_i={.Math.}_j.Math.D_{i,j}$ [0104] Updating of .sub.i: [0105] .sub.i=2 R(.sub.i) if .sub.i is in a R vector space [0106] .sub.i=2 .sub.i if .sub.i is in a C vector space

Where

[0107] .sub.i is a real parameter called learning speed. [0108] .sub.i is the corrective parameter for parameter .sub.i [0109] D.sub.ij is an intermediate quantity of auxiliary calculations that can be temporarily stored in a memory or registers of the hardware executing the implementation [0110] the .sub.i are stored temporarily.

[0111] In some embodiments, as the samples input into the system are processed by the different sub-blocks, the values of the different .sub.i, which may be arbitrarily initialized, converge on values making the demodulation effective.

[0112] In some embodiments, the network of specialized neurons constitutes a sequence of MIMO (multi inputs, multi outputs) blocks, each block (i) performing a parameterized elementary processing by a set .sub.i. If all the .sub.i of the chain are correctly set, the chain proceeds to the effective demodulation of the signal.

[0113] In some embodiments, the .sub.i are not known, and the chain enables the in-line learning of the relevant values for each .sub.i. When the system is initialized, .sub.i are provided by default by a memory or buffer. In the first moments, the system enables the convergence of the parameters .sub.i on relevant values; this phase is called the convergence phase; the demodulated signal produced at the output is thus not reliable. When the system reaches the vicinity of the parameters .sub.i, the process enters the production or monitoring phase. That is to say that the distances between the calculated values and those stored and defining a vicinity are lower than certain pre-stored thresholds. The outputs of the demodulator are then reliable and can be used together with the demodulation of the signal, the system continues with the variation of the parameters of the system. The system does not explicitly shift from one mode to the other; the second phase (or production phase) takes place as a continuation of the first.

[0114] In some embodiments, the method further comprises the storage, by at least one memory buffer, of the plurality of inputs and, in at least one other buffer, of the plurality of outputs of each specialized neuron of the network. The sample values extracted from the plurality of inputs of the signal can be transmitted into a first buffer, which may be associated with the corresponding processing block either temporarily or permanently depending on the desired application, so as to store the internal states of the input signal during an initiation phase. The values of the plurality of inputs can be stored in a second buffer which may be associated with a corresponding processing block either temporarily or permanently depending on the desired application, so as to store the internal states of the output signal.

[0115] In some embodiments, the memory buffers are of FIFO (First-In-First-Out) type, defining a method for organizing and manipulating a data buffer in which the first data input are processed first. Hereinafter, a FIFO memory buffer will be considered to be a vector. Thus, in some embodiments, the terms of the vector may go from the oldest (first index of the vector) to the most recent (last index of the vector) element of the FIFO buffer.

[0116] In some embodiments, in the case of the blind demodulation of a digital telecommunication signal with linear modulation, two types of signals are identified: [0117] single-channel signals: this is a conventional signal in which a stream of information is transmitted on a medium; [0118] multi-channel signals or XPIC (cross-polarization interference canceler): these are several signals which are multiplexed over the two polarizations of the electromagnetic wave.

[0119] A representation of the single-channel signal in baseband may be of the following form:

[00006]$x_{b\left(t\right)}=\underset{k=-}{\overset{+}{.Math.}}.Math.s_k.Math.h\left(t-k.Math.T\right)$

Where (s.sub.k) is a sequence of complex numbers included in a finite sub-set referred to as constellation, h is a shaping filter, and T is the symbol for time.

[0120] During its transmission, this signal undergoes different alterations and it may be received in the following form:

x(t)=e.sup.2Jf.sup.0.sup.t(Ae.sub.Jx.sub.b(tt)+g*x.sub.b(t))+(t)

Where

[0121] f.sub.0 is the carrier frequency [0122] A is the amplitude of the main path [0123] is the main phase [0124] t is the delay of the main path [0125] g is a filter which represents several phenomena: propagation channel caused by multiple paths, disruptive filter introduced by the imperfections of the electronic equipment [0126] is a complex noise

[0127] In the case of the single-channel signal, the demodulation consists of finding the sequence (s.sub.k) from the observation of a sampled version of x(t).

[0128] A multi-channel signal representation, using two polarizations to transmit two signals, in baseband, can be of the following form:

x.sub.b.sup.H(t)=.sub.k=.sup.+s.sub.k.sup.Hh(tkT) and

x.sub.b.sup.v(t)=.sub.k=.sup.+s.sub.k.sup.Vh(tkT)

[0129] These signals are transmitted together on the polarizations H and V of the electromagnetic wave. The two signals are received in the following form:

x.sup.H(t)=e.sup.2Jf.sup.0.sup.t(A.sup.He.sup.J.sup.Hx.sub.b.sup.H(tt.sup.H)+g.sub.HH*x.sub.b.sup.H(t)++g.sub.VH*x.sub.b.sup.V(t))+.sup.H(t)

x.sup.V(t)=e.sup.2Jf.sup.0.sup.t(A.sup.Ve.sup.J.sup.Hx.sub.b.sup.V(tt.sup.V)+g.sub.VV*x.sub.b.sup.V(t)++g.sub.HV*x.sub.b.sup.H(t))+.sup.V(t)

Where

[0130] f.sub.0 is the carrier frequency [0131] A.sup.H, A.sup.V is the amplitude of the main path on the channel H and on the channel V [0132] .sup.H, .sup.V is the main phase on the channel H and on the channel V [0133] t.sup.H, t.sup.V is the delay of the main path on the channel H and on the channel V [0134] g.sub.HH is a filter which represents the channel of the signal H on the reception channel H [0135] g.sub.VH is a filter which represents the channel of the signal V on the reception channel H [0136] g.sub.VV is a filter which represents the channel of the signal V on the reception channel V [0137] g.sub.HV is a filter which represents the channel of the signal H on the reception channel V [0138] .sup.H, .sup.V is complex noise on each reception channel.

[0139] In the case of the multi-channel signal, demodulation consists of finding the sequences (s.sub.k.sup.H) and (s.sub.k.sup.V) from the observation of a sampled version of the pair signal (x.sup.H(t), x.sup.V(t)).

[0140] The equalization of the signal consists of reversing the transmission channels as best as possible. It is therefore sought to designate an equalization function. Such a function requires numerous parameters (frequency, amplitude, equalization filters, etc.). In a non-blind transmission mode, known sequences of the transmitter and the receiver are transmitted regularly and make it possible to regulate the equalizer. In a blind context, no sequence is known and the function is difficult to find.

[0141] In some embodiments, the present invention makes it possible to find the equalization function in the context of blind demodulation.

[0142] In some embodiments, the present invention can be applied equally in a blind context as well as in a non-blind one, but appears particularly beneficial in the former context. Indeed, this invention makes it possible to regulate a parameterizable processing chain without any prior knowledge. The invention is particularly relevant when several parameters are involved.

[0143] In some embodiments, a single-channel signal is defined as a linearly modulated digital signal transmitted by frequency transposition over a finite bandwidth. A dual-channel signal is defined as a pair of single-channel signals multiplexed over two orthogonal polarizations.

[0144] The method applied in a certain scheme makes it possible in particular to demodulate a single-channel signal of linear modulation by compensating: the amplification of the signal, its phase, its carrier leak, the effects of the propagation channel. The method applied according to another scheme to demodulate a dual-channel signal and to separate the two components thereof by compensating: the amplification of the signals, their phases, the carrier leaks, the effects of the propagation channel and the effects of the propagation co-channel (leak from one polarization to the other and vice-versa during the propagation of the signal).

[0145] Without losing the general nature and in order to simplify the explanations hereinbelow, it is possible for example to consider a single-channel signal to be a particular case of dual-channel signal.

[0146] In some embodiments, for example as shown in FIGS. 3 to 5, the calculation principles of the method of the present invention in order to determine the filter(s), the amplification, the frequencies of the signal and the phase values of the signal can be executed in a blind demodulator of a single-channel signal and/or of a multi-channel signal.

[0147] Thus, FIG. 3 shows an example of an embodiment of a network of specialized neurons for the blind demodulation of single-channel signal. FIG. 3 shows the succession of the processing blocks (N0 to N6) then the back-propagation of the error (e) through the blocks (P5 to P0), each of which may represent a characteristic of the signal. The errors enable the on-the-fly calculation in the blocks of the chain (U5 to U0) of the increments of the different parameters to be applied to the processing blocks. Each of the blocks U5 to U0 constituting updates modules, implementing the Update function. The block P0, implementing the Propagate function, comprises an output which can be associated with a possible upstream chain, for example, for synchronization. The filter F can make it possible to compensate the deformation of the signal due to propagation. The demodulator comprises several processing modules (Nx where x=0 to 4), each for a parameter NO (filter), N2 (amplification), N3 (frequency) and N4 (phase), each associated with an Update block (Ux where x=0 to 3) and a Propagate block (Px where x=0 to 3). A filter block generating a plurality of observations of the input signal (x), which can be stored in a memory buffer, is applied to the first processing block NO. This block (NO) produces filtering of the input signal (x) by storing the last values of said input signal in an internal FIFO buffer. Its output constitutes the input of the block (N1) correcting the amplification of the signal such that the power at its output constitutes the input of the block (N2) correcting the signal carrier drift. The output of (N2) constitutes the input of (N3) which corrects the signal phase. The processing module or block or logic sub-neuron (N3) is the last specialized neuron in the chain. Its complex output (y) applies the nonlinearity (N4) which is the decision function or slicer associated with the modulation of the signal. The output of the block (N4) is z. For example, the error (e) is calculated by performing the conjugation of the difference between a plurality of decision outputs (z) and the plurality of outputs (y). The error associated with the processed sample is e.sub.4=zy. It is injected (or back-propagated) in parallel in the propagate block (P3) and in the update block (U3). The block (P3) makes it possible to calculate the e.sub.3 error and the block (U3) makes it possible to calculate the increment to be applied to the current value of the phase in the module (N3). The error e.sub.3 then passes through the blocks (P2) producing the error e.sub.2 and the block (U2) which makes it possible to calculate the frequency increment f to be applied to the current value of the frequency in (N2). The error e.sub.2 then passes through the blocks (P1) producing the error e.sub.1 and the block (U1) which makes it possible to calculate the amplitude increment A to be applied to the current value of the amplitude in the block (N1). Finally the error e.sub.1 then passes through the blocks (P0) producing the error e.sub.0 and the block (U0) which makes it possible to calculate the vectorial increment F to be applied to the current value of the filter in (N0). The value (e.sub.0) is not used here but could be back-propagated to an upstream network performing specialized tasks such as, for example, the synchronization of the signal.

[0148] The succession of the processing blocks, the back-propagation of the error calculated through the propagate blocks and the increment of the different parameters of the blocks of the chain via the update blocks may be performed in a cascade and in a loop until the different parameters of the signal have been estimated as precisely as possible.

[0149] In certain embodiments, the method applied according to another scheme makes it possible in particular to demodulate a dual-channel signal and to separate the two components thereof by compensating: the amplification of the signals, their phases, the carrier leaks, the effects of the propagation channel and the effects of the propagation co-channel (leak from one polarization to the other and vice-versa during the propagation of the signal).

[0150] FIGS. 4 and 5 show an example of an embodiment of a network of specialized neurons for the blind demodulation of multi-channel signal, applied in a blind demodulator. FIG. 4 shows the succession of the processing blocks from the reception of the two input samples x.sub.0.sup.H and x.sub.0.sup.V, FIG. 5 shows the succession of the propagation and update blocks from the errors e.sup.H and e.sup.V calculated at the end of the processing chain. Thus, two blocks NO each receive an input signal to generate the output signals x.sub.v and x.sub.h.

[0151] In FIG. 4, each of the NO processing blocks of one of the two channels each receives two input signals x.sup.h.sub.0, x.sup.v.sub.0 representing respectively a sampling of each channel, to generate the output signals x.sup.v.sub.1 and x.sup.h.sub.1. The signals (x.sub.3 h and x.sub.3.sup.v) are representative of a correction applied to each signal x.sub.0 by the respective output signals x.sub.2.sup.v, x.sub.2.sup.h, of each of the filters G of each channel, each emulated by a processing block N2. The signals x.sub.3 h and x.sub.3.sup.v are sent to the serial cascades of the processing blocks N3, N4 and N5 of each channel, each emulating the signal indicating the amplification of the channel (ampli), for block N3, respectively the frequency (fq) of the channel for block N4 and respectively the phase () of the channel for block N5.

[0152] Each respective output y.sup.h, y.sup.v of each processing block N5 emulating the phase of each channel H and V is sent to each decision block N6 of each channel and to each of the respective inputs of the scheme in FIG. 5. An error signal (e) is calculated for each channel of the system by conjugating the difference between a plurality of decision outputs (z) of each channel and the plurality of outputs (y) of the same channel. The output Z.sup.h, Z.sup.v of each decision block is also sent to a pair of multipliers (M.sub.1.sup.h, M.sub.2.sup.h, M.sub.1.sup.v, M.sub.2.sup.v), respectively receiving one from the phase block and the other from the frequency block fq. The output of the last multiplier M.sub.2.sup.i of each channel is sent to each of the filter blocks G (N.sub.2.sup.h, N.sub.2.sup.v) of each channel.

[0153] Thus, in FIG. 4, x.sub.0.sup.H and x.sub.0.sup.V are two samples at the input of the system. The pair (x.sub.0.sup.H, x.sub.0.sup.V) is the input of a first filter block (N0) and the returned pair (x.sub.0.sup.V, x.sub.0.sup.H) is the input of another filter block (N0). At the output of each of these blocks (NO), there is a single-channel processing chain duplicated apart from the filter. The two equalized outputs are y.sup.H and y.sup.V which constitute the two demodulated signals. The errors e.sup.H and e.sup.V are formed identically to the single-channel case.

[0154] In FIG. 5, errors e.sup.H and e.sup.V start the downshift chain. The error is firstly propagated into two sub-chains identical to the back-propagation chain of the single-channel case. For better legibility, the blocks (x) represent all of the blocks (Px with x=0 to 3) and (Ux with x=0 to 3) which have the same inputs. The output of the block (x) is the output of the block (Px). At the end of the back-propagation chain, each filtering block produces two errors which can interface with an optional upstream chain such as, for example, a synchronization chain.

[0155] These different steps of this method are therefore performed continuously in an automatic manner, in order to be able to optimize and self-regulate the calculations or operations carried out by the neurons (via at least one suitable algorithm) of the processing chain. This method for blind separation and demodulation of a signal of the present invention has the advantage of rapidly estimating in real time the different characteristics of the signals transmitted and of setting up a suitable correction for each signal transmitted by back-propagating it in the generic signal-processing chain. Moreover, the method of the present invention has the advantage of simply and effectively dealing with the problems associated with communication interception and preferably for the blind demodulation of telecommunication signals.

[0156] This invention also relates to a computer program product implemented on a memory medium, capable of being executed within a computing processing unit by computing hardware (such as a microprocessor and a memory); either by hardware or a combination of hardware and firmware, and comprising instructions for executing a method according to any one of the previous embodiments.

[0157] In some embodiments, this invention proposes a network architecture of specialized neurons to deal with the problems of communication interception and more particularly of blind demodulation of telecommunication signals.

[0158] Indeed, an input signal passes through a system having the above architecture to emulate a chain of specialized neurons; each neuron performs a particular function parameterized by a set of values. The values of the adjustments of each specialized neuron are unknown beforehand. A nonlinearity is applied to the result at the chain end, making it possible to calculate an error. It is then possible to back-propagate this error in the processing chain as is done in neural network learning in order to evolve the value of each parameter of each block towards a more relevant value. Thus, in some embodiments, upon initialization of the system, parameters .sub.i are provided by default by a memory of the device. In the first moments, the system enables the convergence of the parameters .sub.i on relevant values; this phase is called the convergence phase; the demodulated signal produced at the output is then not reliable. When the system reaches a defined vicinity of the parameters .sub.i, the system enters the production or monitoring phase. That is to say that the distances between the calculated values and those stored and defining a vicinity are lower than certain pre-stored thresholds. The outputs of the demodulator are then reliable and can be used to be applied to other hardware or software or firmware elements allowing finalization of the demodulation.

[0159] With this system, once in production or monitoring mode, the calculations are less numerous and can be executed in parallel by the different elements materializing the blocks, thus enabling real-time use.

[0160] The present invention further relates to a use in a system for the blind demodulation of a telecommunication signal. The system for the demodulating or blind searching the characteristics of the signal comprises at least one hardware architecture or hardware and firmware implementing a network of specific neurons.

[0161] In certain embodiments, a first specialized neuron of the network performs the estimation of at least one filter enabling the blind acquisition of the signal and then a second one implements at least one module enabling the estimation of the amplification of the signals in order to subsequently evaluate the other characteristics of the signals by the other neurons of the network. In some embodiments, the amplification module can be arranged in a neuron other than the first neuron. A second specialized neuron implements at least one frequency estimation module for determining the frequencies of the blind-transmitted signals and/or at least one phase module for determining the phase values of said signals. In some embodiments, the phase module can be arranged in a neuron other than the second neuron. A third specialized neuron implements a decision module for calculating an error signal and back-propagating the errors calculated at each of the remaining blocks of the previous neurons. The method according to any one of the previous embodiments is applied to determine the characteristics of the blind-transmitted signal (for example, the amplitude, the frequency, and the phase value of the signals).

[0162] In some embodiments, the method for blind demodulation can be applied in the case of the demodulation of a single-channel signal (as shown for example in FIG. 3) and/or of a multi-channel signal (as shown for example in FIGS. 4 and 5).

[0163] In some embodiments, for a signal of multi-channel type, aside from the demodulation of each channel, the method enables the blind separation of the different channels.

[0164] The present application describes various technical features and advantages with reference to the figures and/or various embodiments. A person skilled in the art will understand that the technical features of a given embodiment may in fact be combined with features of another embodiment unless the opposite is explicitly mentioned or it is not obvious that these features are incompatible or that the combination does not provide a solution to at least one of the technical problems mentioned in the present application. In addition, the technical features described in a given embodiment may be isolated from the other features of this mode unless the opposite is explicitly stated.

[0165] It should be obvious for a person skilled in the art that the present invention allows embodiments in many other specific forms without departing from the scope of the invention as claimed. Therefore, the present embodiments should be considered to be provided for purposes of illustration, but may be modified within the range defined by the scope of the attached claims, and the invention should not be limited to the details provided above.