| |
 |
CDMA receiver with parallel interference suppression and optimized synchronization |
| RE40716 |
CDMA receiver with parallel interference suppression and optimized synchronization
|
|
| Patent Drawings: | |
| Inventor: |
Ouvry, et al. |
| Date Issued: |
June 2, 2009 |
| Application: |
11/593,123 |
| Filed: |
November 2, 2006 |
| Inventors: |
Ouvry; Laurent (Le Versoud, FR)
Varreau; Didier (St. Georges de Commiers, FR)
Lattard; Didier (Rencurel, FR)
Leveque; Sebastien (Gex, FR)
|
| Assignee: |
Commissariat a l'Energie Atomique (Paris, FR) |
| Primary Examiner: |
Wang; Ted |
| Assistant Examiner: |
|
| Attorney Or Agent: |
Connolly Bove Lodge & Hutz LLP |
| U.S. Class: |
375/147; 375/148; 375/150; 375/152; 375/346; 375/354; 375/E1.031 |
| Field Of Search: |
375/147; 375/148; 375/150; 375/152; 375/346; 375/354 |
| International Class: |
H04B 1/00 |
| U.S Patent Documents: |
|
| Foreign Patent Documents: |
2770060 |
| Other References: |
Buehrer, R.M., et al., "Analysis of DS-CDMA Parallel Interference Cancellation with Phase and Timing Errors," IEEE Jour. on Sel. Areas ofCommunications, vol. 14, No. 8, pp. 1522-1535, Oct. 1996. cited by other. |
|
| Abstract: |
A receiver for transmission and parallel interference has multiple access interference suppression stages having K channels, each comprising a correlation device corresponding to a particular pseudorandom sequence and interference generation and suppression device. Each stage delivers to the following stage signals at least partly freed from multiple access interferences. A decision stage receives the signals from the channels of the preceding suppression stage. Each decision stage has a correlation device corresponding to one of the pseudorandom sequences and decision device to deliver data. Devices for producing synchronization signals can control the interference suppression and the decision device. The devices producing the synchronization signals have components placed in the channels of the final stage. Further, the synchronization signals produced by these devices control the decision device of the channels of the final stage and the interference estimation device of the at least one interference suppression stages following appropriate time shifts. |
| Claim: |
What is claimed is:
1. A receiver for code distribution multiple access transmission and parallel multiple access interference suppression, the receiver comprising: at least one multiple accessinterference suppression stage ESI.sub.i constituted by K channels, each comprising a correlation means corresponding to a particular pseudorandom sequence, an interference estimation means and an interference suppression means, each stage delivering toa following stage K signals at least partly freed from multiple access interferences, a final, decision stage (ED) constituted by K channels receiving the K signals from the K channels of a preceding suppression stage and each comprising a correlationmeans corresponding to one of the pseudorandom sequences and decision means delivering a data item, means for producing synchronization signals able to control the at least one multiple access interference suppression stage and control the decision meansof the final stage (ED), said receiver being characterized in that the means for producing the synchronization signals are constituted by K means solely placed in the K channels of the final stage (ED), the K synchronization signals produced by said Kmeans controlling the K decision means of the K channels of the final stage (ED) and the interference estimation means of the K channels of the at least one interference suppression stages ESI.sub.i following appropriate time shifts.
2. Receiver according to claim 1, wherein the K synchronization signals also control the K correlation means of the K channels of the at least one multiple access interference suppression stage.
3. Receiver according to claim 1, wherein the K correlation means of the K channels of the final stage (ED) are constituted by K matched filters with K pseudorandom sequences and the K correlation means of the K channels of each interferencesuppression stage ESI.sub.i are constituted by K sliding correlators.
.Iadd.4. A spread spectrum receiver, comprising: an interference suppression stage comprising three or more correlator circuits on three or more signal paths, the correlator circuits capable of providing an estimated signal based at least inpart on a signal received at an input of said interference suppression stage; and a decision stage capable of providing three or more data items contained in the received signal based at least in part on the estimated signal provided by the correlatorcircuits; said decision stage comprising three or more decision circuits and three or more synchronization circuits having outputs coupled to the three or more correlator circuits of said interference suppression stage and being further coupled to thethree or more decision circuits of said decision stage..Iaddend.
.Iadd.5. A spread spectrum receiver as claimed in claim 4, further comprising three or more time shift circuits coupled between the outputs of the three or more synchronization circuits and the three or more correlator circuits of saidinterference suppression stage..Iaddend.
.Iadd.6. A spread spectrum receiver as claimed in claim 4, further comprising three or more time shift circuits coupled between the outputs of the three or more synchronization circuits and the three or more correlator circuits of saidinterference suppression stage, the time shift of the time shift circuits comprising a symbol period or approximately the symbol period..Iaddend.
.Iadd.7. A spread spectrum receiver as claimed in claim 4, further comprising three or more time shifts circuits coupled between the outputs of the three or more synchronization circuits and the three or more correlator circuits of saidinterference suppression stage, the time shift of the time shift circuits comprising a processing time or approximately the processing time..Iaddend.
.Iadd.8. A spread spectrum receiver as claimed in claim 4, further comprising a second interference suppression stage coupled between said first interference suppression stage and said decision stage, said second interference suppression stagecomprising three or more subtractor circuits capable of subtracting an interference estimation from the received signal prior to processing by said decision stage..Iaddend.
.Iadd.9. A spread spectrum receiver as claimed in claim 4, wherein the correlator circuits of said interference suppression stage comprise sliding correlators..Iaddend.
.Iadd.10. A spread spectrum receiver as claimed in claim 4, further comprising three or more correlator circuits in said decision stage coupled to inputs of the three or more decision circuits of said decision stage..Iaddend.
.Iadd.11. A spread spectrum receiver as claimed in claim 4, further comprising three or more correlator circuits in said decision stage coupled to inputs of the three or more decision circuits of said decision stage, the three or morecorrelator circuits of the decision stage comprising matched filters..Iaddend.
.Iadd.12. A spread spectrum receiver as claimed in claim 4, wherein the correlator circuits of said interference suppression stage comprise sliding correlators, and further comprising three or more correlator circuits in said decision stagecoupled to inputs of the three or more decision circuits of said decision stage..Iaddend.
.Iadd.13. A spread spectrum receiver as claimed in claim 4, wherein the correlator circuits of said interference suppression stage comprise sliding correlators, and further comprising three or more correlator circuits in said decision stagecoupled to inputs of the three or more decision circuits of said decision stage, the three or more correlator circuits of said decision stage comprising matched filters..Iaddend.
.Iadd.14. A spread spectrum receiver, comprising: means for suppressing interference in a received signal, said interference suppressing means comprising three or more correlation means on three or more signal paths, the correlation means beingcapable of providing an estimated signal based at least in part on the received signal; and means for providing three or more data items contained in the received signal based at least in part on the estimated signals provided by the correlation means; said data item providing means comprising three or more decision means and three or more synchronization means having outputs coupled to the three or more correlation means of said interference suppression means and being further coupled to the three ormore decision means of said data item providing means..Iaddend.
.Iadd.15. A spread spectrum receiver as claimed in claim 14, further comprising three or more time shifting means coupled between the outputs of the three or more synchronization means and the three or more correlation means of saidinterference suppression means..Iaddend.
.Iadd.16. A spread spectrum receiver as claimed in claim 14, further comprising three or more time shifting means coupled between the outputs of the three or more synchronization means and the three or more correlation means of saidinterference suppression means, a time shift of the time shifting means comprising a symbol period or approximately the symbol period..Iaddend.
.Iadd.17. A spread spectrum receiver as claimed in claim 14, further comprising three or more time shifting coupled between the outputs of the three or more synchronization means and the three or more correlation means of said interferencesuppression stage, a time shift of the time shifting means comprising a processing time or approximately the processing time..Iaddend.
.Iadd.18. A spread spectrum receiver as claimed in claim 14, further comprising means for further suppressing interference in the received signal, said further interference suppressing means being coupled between said first interferencesuppression means and said data item proving means, said further interference suppression means comprising three or more subtracting means capable of subtracting an interference estimation from the received signal prior to processing by said data itemproviding means..Iaddend.
.Iadd.19. A spread spectrum receiver as claimed in claim 14, wherein the correlation means of said interference suppression stage comprise sliding type correlating means..Iaddend.
.Iadd.20. A spread spectrum receiver as claimed in claim 14, further comprising three or more correlating means in said decision stage coupled to inputs of the three or more decision means of said data item providing means..Iaddend.
.Iadd.21. A spread spectrum receiver as claimed in claim 14, further comprising three or more correlating means in said data item providing means coupled to inputs of the three or more decision means of said data item providing means, the threeor more correlating means of the data item providing means comprising matched filtering means..Iaddend.
.Iadd.22. A spread spectrum receiver as claimed in claim 14, wherein the correlating means of said interference suppression stage comprise sliding type correlation means, and further comprising three or more correlating means in said data itemproviding means coupled to inputs of the three or more decision means of said data item providing means..Iaddend.
.Iadd.23. A spread spectrum receiver as claimed in claim 14, wherein the correlating means of said interference suppression means comprise sliding type correlating means, and further comprising three or more correlation means in said data itemproviding means coupled to inputs of the three or more decision means of said data item providing means, the three or more correlating means of said data item providing means comprising matched type filtering means..Iaddend.
.Iadd.24. A method, comprising: estimating a signal based at least in part on a received signal by correlating the received signal with a pseudorandom sequence on three or more signal paths to provide three or more estimated signals; anddeciding three or more data items contained in the received signal based at least in part on the estimated signals; said deciding comprising synchronizing said deciding with said estimating or said correlating, or combinations thereof..Iaddend.
.Iadd.25. A method as claimed in claim 24, further comprising time shifting said synchronizing with respect to said correlating..Iaddend.
.Iadd.26. A method as claimed in claim 24, further comprising time shifting said synchronizing with respect to said correlating, a time shift of said time shifting comprising a symbol period or approximately the symbol period..Iaddend.
.Iadd.27. A method as claimed in claim 24, further comprising time shifting said synchronizing with respect to said correlating, a time shift of said time shifting comprising a processing time or approximately the processing time..Iaddend.
.Iadd.28. A method as claimed in claim 24, further subtracting an interference estimation from the received signal prior to said deciding..Iaddend.
.Iadd.29. A method as claimed in claim 24, wherein said correlating of said estimating comprising a sliding type correlating..Iaddend.
.Iadd.30. A method as claimed in claim 24, said deciding further comprising correlating the estimated signals prior to said deciding..Iaddend.
.Iadd.31. A method as claimed in claim 24, said deciding further comprising correlating the estimated signals prior to said deciding, said correlating the estimated signals comprising matched filter type correlating..Iaddend.
.Iadd.32. A method as claimed in claim 24, wherein said correlating of said estimating comprising a sliding type correlating, and said deciding further comprising correlating the estimated signals prior to said deciding..Iaddend.
.Iadd.33. A method as claimed in claim 24, wherein said correlating of said estimating comprising a sliding type correlating, and said deciding further comprising correlating the estimated signals prior to said deciding, said correlating theestimated signals comprising matched filter type correlating..Iaddend. |
| Description: |
TECHNICAL FIELD
The present invention relates to a CDMA (code division multiple access) receiver with parallel interference suppression and optimized synchronization.
More generally, the invention relates to direct sequence spread spectrum (DSSS) digital transmission.
The invention has applications in radiocommunications systems with mobiles, in wireless local area networks (WLAN), in wireless local loops (WLL), in cable television and online multimedia services, in integrated home systems and electronic fundstransfer, etc.
PRIOR ART
Direct sequence spread spectrum consists of modulating each symbol of a digital signal by a binary pseudorandom sequence. Such a sequence consists of N pulses or chips, whose duration Tc is equal to Ts/N. The modulated signal has a spectrumspread over a range N times wider than that of the original signal. On reception, demodulation consists of correlating the signal with the sequence used on transmission making it possible to once again find the information linked with the startingsymbol.
This procedure has numerous advantages: discretion, because the spectral power density of the signal is reduced by a factor N; immunity against deliberate or parasitic, narrow band transmissions, because the correlation operation carried out atthe receiver leads to the spectral spread of such transmissions; difficult interception, because demodulation requires the knowledge of the sequence used on transmission; resistance to multiple paths which, under certain conditions, give rise toselective frequency fading and consequently partly affect the transmitted signal; possible multiple access by the allocation of different sequences to different users.
The direct sequence spread spectrum modulation method has been extensively described in the specialist literature and reference can e.g. be made to the following: "CDMA Principles of Spread Spectrum Communication", by Andrew J. VITERBI,Addison-Wesley Wireless Communication Series; "Spread Spectrum Communications", by Marvin K. SIMON et al., vol. I, 1983, Computer Science Press; "Spread Spectrum Systems", by R. C. DIXON, John WILEY and Sons.
The attached FIG. 1 illustrates the principle of a spread spectrum signal receiver. The receiver shown receives a signal r(t) and comprises a first circuit 10, referred to hereinafter as the correlation means, and which can be a matched filteror a sliding correlator, a circuit 12 for recovering a symbol clock signal, which makes it possible to synchronize the receiver means, optionally a proceeding circuit 14 able to perform various supplementary processing operations, such as a delayedmultiplication, a channel estimation, etc. and finally a circuit 16 able to take a decision on the value of the transmitted symbol.
The first circuit of said receiver (correlation means 10), no matter whether it is a sliding correlator or a matched filter, plays an important part which can be defined with the aid of FIGS. 2 and 3.
A sliding correlator (FIG. 2) diagrammatically comprises a pseudo-random sequence generator 20 and a multiplier 22 receiving the input signal r(t) and the sequence delivered by the generator 20, an adder 24, a circuit 26 connected to the outputof the adder 24 and relooped thereon and effecting a time lag. The sliding correlator output is connected to an undersampler 28. The circuits 20, 26, 28 are controlled by a symbol clock signal Hs.
The matched filter (FIG. 3) is generally a digital filter 30, whose coefficients are matched to the sequence used. This filter receives the input signal r(t) and delivers a filtered signal applied to an undersampler 28, which is controlled bythe symbol clock signal Hs.
Viewed from the output of the undersampler 28, said two architectures are equivalent. However, viewed from the input of the undersampler 28, they are different, because they do not deliver the same signal, as is revealed by FIGS. 4, 5 and 6.
FIG. 4 shows the output Sf of the matched digital filter of FIG. 3, as a function of the rank n of the samples. FIG. 5 shows the output Sc of the sliding correlator when the local replica of the transmitted sequence is aligned with thetransmitted sequence. FIG. 6 shows the output Sc of said sliding correlator when the local replica of the sequence is not aligned with the transmitted sequence. The correlation peak carrying the information on the symbol is marked P in FIGS. 4 and 5.
These drawings show that the sliding correlator needs an information linked with the timing of the symbols, so-called symbol clock signal and designated Hs to enable the local replica of the sequence to be aligned with the sequence modulating thesymbols received, otherwise the demodulation of the symbols is impossible (case of FIG. 6). The matched filter does not require this information. Thus, what firstly differentiates a sliding correlator structure and a matched filter structure is thatthe former needs an external synchronization information.
A matched filter makes it possible to recover the symbol clock, e.g. by a recursive detection of the correlation peak on a window of N points (FIG. 4). It is also possible to recover the symbol clock with the aid of a sliding correlator, butthis is more complex. There is a need for a stepwise modification of the phase of the local replica of the sequence until the output of the sliding correlator corresponds to an energy maximum and consequently to a correlation peak (case of FIG. 5).
Although both these structures make it possible to find the symbol clock again, they do not do so at the same speed. The symbol clock recovery operation lasts a maximum of N symbol periods, i.e. NTs with a sliding correlator, whereas it onlyrequires a single symbol period Ts with a matched filter.
Thus, the advantage of the matched filter is obvious with respect to the symbol clock signal acquisition speed. Its disadvantage is its operational complexity, because its installation in the form of a finite pulse response digital filter(operating at the speed of the chips multiplied by the number of samples) requires N multiplications and N additions for each sample. Thus, its structural complexity is linked with its operating complexity.
The sliding correlator only performs one multiplication and one addition for each new sample. Thus, although it is relatively poorly adapted to the clock recovery, it is very advantageous from the operating complexity standpoint.
The CDMA method can be of two types. If the different transmitters of users do not have a common time reference the system is said to be asynchronous, because the starts of the symbols of each user arrive at the receiver at different times. Itis also possible to proceed in such a way that the starts of the symbols received from the different users (modulo period Ts of a symbol). The system is then said to be synchronous. Asynchronous systems have the major advantage of not requiring anexternal synchronization signal, unlike in synchronous systems, but this is to the detriment of more serious constraints with respect to the spread sequence properties.
Thus, in an asynchronous CDMA system, the sequences have random relative phases at the reception level. Thus, a good separation of the signals assumes that the intercorrelations between sequences are small, no matter what the relative phasesbetween the sequences.
If g.sub.i(t) and g.sub.k(t) are used for designating two pseudorandom sequences allocated to users i and k, it is possible to define a coefficient .mu..sub.i,k translating the correlation between these two sequences. This coefficient is equalto the mean, on the duration Ts of a symbol, of the product of the sequences, i.e.: .mu..times..intg..times..function..times..times.d ##EQU00001## This coefficient represents an autocorrelation if i=k and an inter-correction if i.noteq.k.
The signal at the output of the correlator corresponding to the user of rank k (i.e. following the undersampler 28 of FIG. 2) can be written, as a function of its coefficient:.times..noteq..times..mu..times..times..times..intg..times..function..fun- ction.d ##EQU00002## where A.sub.k is the amplitude of the signal of the user of rank k, g.sub.k(t) the pseudorandom sequence of said same user, d.sub.i the transmitted data andn(t) an additive, Gaussian, white noise. In this expression, i ranges from 0 to K-1, K being the total number of users, but without assuming the value k of the user in question.
The first term, i.e. A.sub.kd.sub.k makes it possible to again find the data item d.sub.k, the second term corresponding to a correlation with the signals corresponding to other users. This term is called multiple access interference or MAI.
The existence of this multiple access interference leads to a non-negligible consequence with respect to the capacity of the transmission system, i.e. the number of acceptable simultaneous users and on the performance characteristics of thesystem.
Much research has been carried out with the aim of reducing this interference phenomenon and reference can be made to the following: research on pseudorandom spread sequences, research on the management of the power levels of differenttransmitters, the use of adaptive antennas, research on hihger performance receiver structures.
The latter research has more particularly involved "sub-optimum" receiver structures which, unlike an optimum structure, effect a good compromise between performance characteristics and operating complexity. Among these, interest is attached toparallel interference suppression structures and details of these are given below.
A parallel interference suppression receiver generally uses: a first stage based on a conventional detector with a bank of correlation means; means for generating an interference signal, means for suppressing in said signal interference producedby other system users, a final stage of estimating the final data.
Such a procedure is described in the article by R. M. BUEHRER et al. entitled "Analysis of DS-CDMA Parallel Interference Cancellation with Phase and Timing Erros", published in IEEE Journal of Selected Areas in Communications, vol. 14, No. 8,Oct. 1996, pp 1522-1535. The corresponding receiver is illustrated in the attached FIG. 7 in the case of three users. The reception sign r(t) is processed in a first interference suppression stage ESI.sub.1 constituted by three user correlation means101, 102, 103. These correlation means deliver three decision signals Z.sub.1.sup.1, Z.sub.2.sup.1, Z.sub.3.sup.1, which are processed in three interference estimation circuits 111, 112, 113. The latter deliver signals S.sub.1.sup.1, S.sub.2.sup.1,S.sub.3.sup.1, which are obtained by the spreading of signals Z by the pseudo-random sequences of three users. For each user, the signals S of the other users are summated, i.e. respectively .SIGMA..sub.2.3 for user 1, .SIGMA..sub.1.3 for user 2 and.SIGMA..sub.1.2 for user 3. These sums are subtracted from the reception signal r(t) in three subtractors 121, 122, 123 in order to obtain three new signals r.sub.1.sup.1, r.sub.2.sup.1, r.sub.3.sup.1.
In turn, the signals r.sub.1.sup.1, r.sub.2.sup.1, r.sub.3.sup.1 can be processed in a second interference suppression stage and so on up to the ith interference suppression stage ESI.sub.i. Thus, freed from at least part of the multiple accessnoise, the signals r.sub.1.sup.1, r.sub.2.sup.1, r.sub.3.sup.1 permit a better estimate of the interference to be subtracted from the signal received r(t). In the stage of rank i, i.e. ESI.sub.i, are only shown the subtractors with the signalsr.sub.1.sup.i, r.sub.2.sup.i and r.sub.3.sup.i.
The receiver comprises a final stage or decision stage ED, with three channels containing correlation means 141, 142, 143 and three decision circuits 151, 152, 153 delivering the data d.sub.1, d.sub.2, d.sub.3.
In each stage there are synchronization means for the control of the different circuits. Thus, the first stage ESI.sub.1 contains synchronizing circuits 131, 132, 133 controlling the correlation means 101, 102, 103 and estimation means 111, 112,113. In the final stage ED there are synchronizing means 161, 162, 163 controlling the correlation means 141, 142, 143 and decision means 151, 152, 153.
In general terms, for constructing a multiple access interference correction signal, there is a need for three informations: 1) a symbol clock (Hs), 2) the amplitudes and 3) the signs of signals carried on the channels I and Q after correlation,i.e. A(I) and A(Q).
All these informations are calculated or recorded for each stage, for the control of said stage and independently of what takes place in the other stages.
Although this arrangement makes it possible to obtain a correct operation of the receiver it is still relatively complex. The invention obviates this disadvantage by proposing a simpler structure, which also makes it possible to turn to the bestaccount the performance characteristics of the correlation means.
DESCRIPTION OF THE INVENTION
Use is made of a system with direct sequence spread spectrum and several optionally asynchronous transmitters. At the parallel interference suppression receiver, the correlation peak or peaks corresponding to the different propagation paths ofthe signal of user k are placed precisely at the same locations in the symbol window, no matter what the considered suppression stage for a given symbol. Thus, the signal received contains the replicas of the signal transmitted by the user k associatedwith the propagation paths, at a fixed location for a given symbol in the symbol window. The time positions are estimated in the synchronization means and can doubtless be considered as different between individual stages, because during the suppressionstages interference is progressively removed from the signal. However, the information received does not move relative to the window of the considered symbol. Thus, a single synchronization signal per path is sufficient and not one per path and perstage.
Thus, the applicant has decided to use the synchronization signal or signals calculated in the final receiver stage, said signals being less error-tainted, for controlling all the interference suppression stages for each user.
Thus, the invention renders unnecessary complex calculations for investigating clock signals at all the first stages and consequently considerably reduces the operational complexity of the receiver. This complexity can be further reduced by theuse of sliding correlators in the first stages and matched filters in the final stage. As explained hereinbefore, the matched filter makes it possible to acquire the synchronization in a single symbol period, whilst the use of sliding correaltors makesit possible to reduce the operational complexity without deteriorating said acquisition time.
More specifically, the present invention relates to a receiver for multiplex access transmission with distribution by codes and parallel multiple access interference suppression comprising: at least one multiple access interference suppressionstage constituted by K channels, each comprising a correlation means corresponding to a particular pseudorandom sequence and interference generation and suppression means, each stage delivering to the following stage K signals at least partly freed frommultiple access interferences, a final, decision stage constituted by K channels receiving the K signals from the K channels of the preceding suppression stage and each comprising a correlation means corresponding to one of the pseudorandom sequences anddecision means delivering a data item, means for producing the synchronization signals able to control the interference suppression means, means for producing synchronization signals able to control the decision means of the final stage, said receiverbeing characterized in that the means for producing the synchronization signals are constituted by K means placed solely in the K channels of the final stage, the K synchronization signals produced by these K means controlling the K decision means of theK channels of the final stage and the interference estimation means of the K channels of the interference suppression stages, following appropriate time shifts.
Thus, preferably, the K synchronization signals also control the K correlation means.
Preferably, the K correlation means of the K channels of the final stage are constituted by K matched filters with K pseudorandom sequences and the K correlation means of the K channels of each interference suppression stage are constituted by Ksliding correlators.
BRIEF DESCRIPTION OF THE DRAWINGS
FIG. 1, already described, shows a known spread spectrum receiver.
FIG. 2, already described, shows a sliding correlator.
FIG. 3, already described, shows a matched filter.
FIG. 4, already described, shows the output signal of a matched filter.
FIG. 5, already described, shows the output signal of a sliding correlator when the local replica of the sequence is aligned with the transmitted sequences.
FIG. 6, already described, shows said same output signal when the local replica is not aligned with the transmitted sequence.
FIG. 7, already described, shows a CDMA receiver with multiple access interference suppression according to the prior art.
FIG. 8 shows a receiver according to the invention.
DESCRIPTION OF EMBODIMENTS
FIG. 8 illustrates an embodiment of a receiver according to the invention. FIG. 8 corresponds to FIG. 7 and the same means carry the same references. It is obvious that the invention is not limited to three channels and in fact extends to Kchannels, K being random. Moreover, the number i of multiple access interference suppression stages is also of a random nature.
In FIG. 8, the synchronization means are constituted by the three means 171, 172, 173 in the decision stage ED, said means being used not only in the channels of the final stage, but also in the interference suppression stages like stageESI.sub.1, where the signals delivered by the means 171, 172, 173 are applied to the correlation means 101, 102, 103 and to the estimation circuits 111, 112, 113, following an appropriate time shift supplied by the circuits 181, 182, 183 comprising,modulo the symbol period, the processing time.
The correlations means 141, 142, 143 of the final stage are advantageously matched filters making it possible to acquire the synchronization in a single symbol period, whereas the correlation means 101, 102, 103 of the interference suppressionstages are sliding correlators, which reduces the complexity without any deterioration to the acquisition time.
* * * * * |
|
|
|
