A RECEIVE DECORRELATOR FOR A WIRELESS COMMUNICATIONS SYSTEM

Abstract

This invention relates to decorrelation of signals in order to improve coding gains of wireless communications. To this end a branch signal processor includes a summer to determine a sum of a first branch signal and a second branch signal to produce a sum signal. A conjugate swapper to determine a conjugate swap of the first branch signal and a conjugate swap of the second branch signal to produce two swapped signals, wherein the conjugate swapper takes an imaginary part of the first branch signal to become a real part and a real part of the first branch signal to become an imaginary part of a new complex signal which new complex signal becomes a first swapped signal, and wherein the conjugate swapper takes an imaginary part of the second branch signal to become a real part and a real part of the second branch signal to become an imaginary part of a second complex signal which second complex signal becomes a second swapped signal. A differencer determines a difference of the first swapped branch signal and the second swapped branch signal to produce a difference signal and a diversity combiner configured to combine the sum signal, the first branch signal, the second branch signal and the difference signal.

Claims

1.-26. (canceled)

27. A branch signal processor including: a summer to determine a sum of a first branch signal and a second branch signal to produce a sum signal; a conjugate swapper to determine a conjugate swap of the first branch signal and a conjugate swap of the second branch signal to produce two swapped signals, wherein the conjugate swapper takes an imaginary part of the first branch signal to become a real part and a real part of the first branch signal to become an imaginary part of a new complex signal which new complex signal becomes a first swapped signal, and wherein the conjugate swapper takes an imaginary part of the second branch signal to become a real part and a real part of the second branch signal to become an imaginary part of a second complex signal which second complex signal becomes a second swapped signal; a differencer to determine a difference of the first swapped branch signal and the second swapped branch signal to produce a difference signal; and a diversity combiner configured to combine the sum signal, the first branch signal, the second branch signal and the difference signal.

28. The branch signal processor of claim 27 wherein the first branch signal and the second branch signal are respective antenna samples, intermediate frequency signal samples, or base-band samples.

29. The branch signal processor of claim 27 wherein the first branch signal and the second branch signal are respective continuous signals.

30. The branch signal processor of claim 27 wherein the diversity combiner is configured to perform at least one of: a) selection combining (SC); and b) equal-gain combining; and c) switch-and-stay combining (SSC);

31. The branch signal processor of claim 27 wherein the summer comprises at least one of: a) an operational amplifier; and b) an antenna transformer.

32. The branch signal processor of claim 27 wherein the difference comprises at least one of: a) an operational amplifier; and b) an antenna transformer.

33. The branch signal processor of claim 27 further comprising a gain control element configured to apply a gain to at least one of: a) the first branch signal; and b) the second branch signal, wherein the gain of the gain control element is selected to equalize power of the first branch signal and the second branch signal.

34. The branch signal processor of claim 30 wherein the diversity combiner is configured to perform selection combining (SC) combining by: determining which one of the sum signal, the received signals and the difference signal has a higher signal to noise ratio (SNR); and selecting the one of the sum signal, the received signals and the difference signal that has the higher SNR for data detection.

35. The branch signal processor of claim 30 wherein the diversity combiner is configured to perform SC combining on the basis of a signal-plus-noise criterion for the sum, the received and the difference signals.

36. The branch signal processor of claim 30 wherein the diversity combiner is configured to perform SC combining on the basis of a signal-to-interference-plus-noise criterion for the sum, received and the difference signals.

37. The branch signal processor of claim 30 wherein the diversity combiner is configured to perform equal gain combining (EGC) combining by averaging by summing the sum signal, the received signals and the difference signal to improve the signal to noise ratio (SNR)

38. The branch signal processor of claim 30 wherein the diversity combiner is configured to perform EGC combining on the basis of a signal-plus-noise criterion for the sum, the received and the difference signals.

39. The branch signal processor of claim 30 wherein the diversity combiner is configured to perform EGC combining on the basis of a signal-to-interference-plus-noise criterion for the sum, received and the difference signals.

40. The branch signal processor of claim 30 wherein the diversity combiner is configured to perform switch-and-stay combining (SSC) combining by: determining a current SNR for a currently selected one of the sum signal, received signal and the difference signal; determining if the current SNR for the currently selected one of the sum signal, received signal and the difference signal is above a threshold; maintaining the selection of the currently selected one of the sum signal, received and the difference signal upon determining that the current SNR for the currently selected one of the sum signal, received and the difference signal is above the threshold; and switching the selection to the other one of the sum signal, received and the difference signal upon determining that the current SNR for the currently selected one of the sum signal, received and the difference signal is below the threshold.

41. A receiver comprising: the branch signal processor of claim 27; a first antenna, the first branch signal based upon a signal received by the first antenna; and a second antenna, the second branch signal based upon a signal received by the second antenna.

42. A method comprising: obtaining a first branch signal and a second branch signal; determining a sum of the first branch signal and the second branch signal to produce a sum signal; determine a conjugate swap of the first branch signal and a conjugate swap of the second branch signal to produce two swapped signals, wherein an imaginary part of the first branch signal becomes a real part and a real part of the first branch signal becomes an imaginary part of a new complex signal which new complex signal becomes a first swapped signal, and wherein an imaginary part of the second branch signal becomes a real part and a real part of the second branch signal becomes an imaginary part of a second complex signal which second complex signal becomes a second swapped signal; determining a difference of the first swapped signal and the second swapped signal to produce a difference signal; and performing a diversity combining operation upon the sum signal, the first branch signal, the second branch signal and the difference signal.

43. The method of claim 42 wherein obtaining a first branch signal and a second branch signal comprises determining the first branch signal from a signal received through a first antenna and determining the second branch signal from a signal received through a second antenna.

44. The method of claim 43 wherein performing a diversity combining operation comprises performing selection combining.

45. The method of claim 42 wherein performing a diversity combining operation comprises performing switch-and-stay combining (SSC).

46. The method of claim 42 further comprising performing gain control on at least one of the first branch signal and the second branch signal to equalize power of the first branch signal and the second branch signal.

47. The method of claim 42 further comprising: performing a respective sum operation on each of a plurality of pairs of branch signals to produce a respective sum signal, one of the pairs of branch signals consisting of the first branch signal and the second branch signal; performing a respective difference operation on each of the plurality of swapped branch signals to produce a respective difference signal; and performing a combining operation based on the sum signals, the received and the difference signals.

Description

BRIEF DESCRIPTION OF THE DRAWINGS

[0046] FIG. 1 is a flow diagram illustrating a simple process in which the present invention may be implemented.

[0047] FIG. 2 is a block diagram illustrating an example system in which the present invention may be implemented for all BiTs.

[0048] FIG. 3 is a block diagram illustrating an example system in which the present invention may be implemented as an N branch BiT for three branches.

[0049] FIG. 4 is a block diagram illustrating an example system in which the BiT operation of the present invention may be implemented.

[0050] FIG. 5 BER for SC, EGC and MRC with BPSK, N=3 when single decorrelator is employed

[0051] FIG. 6 Receive decorrelator BER for SC with BPSK, N=3

[0052] FIG. 7 Receive decorrelator BER for EGC with BPSK, N=3

DESCRIPTION OF EMBODIMENTS

[0053] Referring to FIG. 1 of the accompanying drawings, an example receive decorrelator for a wireless communications system is shown.

[0054] The system described is referred to as a blind decorrelator because the eigenvalues and the associated eigenvectors or a correlation matrix do not need to be computed in order to effect decorrelation.

[0055] In FIG. 2, N1 branch signals for example .sub.1, .sub.2 and .sub.3 are simply decorrelated through BiT into the multiple uncorrelated output signals {circumflex over ()}.sub.1i, {circumflex over ()}.sub.2i and {circumflex over ()}.sub.3i from the ith BiT. It consists of

[00001]$\frac{N\left(N-1\right)}{2}+1$

replicas of the received signals and BiT operations plus 1 replica of signals sent directly to the output.

[0056] In FIG. 3, N1 branch signals for example .sub.1, .sub.2 and .sub.3 are simply decorrelated through enhanced 3-BiT into the multiple decorrelated output signals .sub.1i, .sub.2i and .sub.3i from the ith BiT resulting in NN outputs.

[0057] FIG. 5 illustrates the BER for selection combining (SC), equal-gain combining (EGC) and maximal ratio combining (MRC) schemes. It is seen that equal BER rate is obtained when the decorrelator system (Decorr) is compared with the conventional correlated system (Conv) without any correlation gains. There are no gains because only one BiT operation is performed. This means that performance analysis for correlated systems can be expressed in terms of the uniform principal decorrelator. The decorrelator presents uncorrelated signals which may then be analyzed in the several ways which are available in literature.

[0058] FIG. 6 shows the BER for SC with the decorrelator. We also note that decorrelation gains are achieved by the decorrelator due to the additional diversity branches at the receiver when all the BiT operations are performed. There is about 1 dB gain over the correlated case.

[0059] FIG. 7 shows the BER for EGC when the decorrelator is used. Decorrelation gains are achieved by the decorrelator due to the additional diversity branches. Moreover, it is noted that the BER for EGC is equal to that of MRC. This may be attributed to the fact that the virtual antennas from the BiT outputs provide maximum likelihood estimation for all the instantaneous signals in the surrounding of the antennas. These components are normally captured through MRC detection but not EGC because the EGC detector assumes the knowledge of a pre-determined channel phase only.

[0060] In fact, MRC was also examined in [6], which shows identical performance for the decorrelator receiver and the conventional receiver with MRC.

[0061] The method of processor and method of the BiT to transform input signals is described as follows.

[0062] The method may involve N input signals where N is an integer equal to or greater than two. [0063] (a) The method involves producing

[00002]$\frac{N\left(N-1\right)}{2}+1$

replicas of the set of input signals and [0064] (b) In each replica, selecting a respective signal pair differing to that selected in other replicas and [0065] (c) carrying out processing by multiplying the signal pairs by the binary index transform to give N(N1) decorrelated outputs and [0066] (d) obtaining a total of N.sup.2 output signals among which N signals are also the input signals.

[0067] The decorrelation operation is illustrated for three signals in FIG. 2 where by coincidence of

[00003]$\frac{N\left(N-1\right)}{2},$

three BiT transform operations are carried out for three different pairs of signals. In the example of FIG. 2, the six decorrelated outputs are arranged together with the three input signals to form N.sup.2 output signals.

[0068] As an example, the operation of the ith BiT on the input signal bi-vector .sub.i to obtain two output signals .sub.o is expressed as follows

[00004]$\begin{array}{cc}{\hat{S}}_o=Q^H.Math.{\hat{S}}_i& \left(1\right)\\ \mathrm{where}& \\ \mathrm{BiT}=Q^H=\frac{1}{\sqrt{2}}.Math.\left(\begin{array}{cc}1& 1\\ -j& j\end{array}\right)& \end{array}$

[0069] The BiT involves a method of: [0070] 1) obtaining a first branch signal and a second branch signal; [0071] 2) determining a sum of the first branch signal and the second branch signal to produce a sum signal; [0072] 3) determining a conjugate swap of the first branch signal and a conjugate swap of the second branch signal to produce two swapped signals; and [0073] 4) determining a difference of the first swapped branch signal and the second swapped branch signal to produce a difference signal; and [0074] 5) using a gain control element configured to apply a gain to at least one of: [0075] a) the first branch signal; and [0076] b) the second branch signal.
wherein the gain of the gain control element is selected to equalize power of the first branch signal and the second branch signal.

[0077] The operation of the BiT is illustrated in FIG. 4. In FIG. 4, the input 1 is added to the input 2 to give one of the BiT outputs. The adder () is composed of a conventional circuit of an antenna transformer (.fwdarw.) and an operational amplifier (triangle). The differencer inputs are taken from the outputs of a conjugate swapper (j swapper). The swapper takes the imaginary part of the first signal to become the real part and the real part to be the imaginary part of a new first swapped signal. In addition, the swapper takes the imaginary part of the second signal to become the negative real part and the real part to be the imaginary part of a new second swapped signal. The differencer () then subtracts the first new swapped signal from the new second swapped signal. The differencer is composed of a conventional circuit of a transformer (.fwdarw.) and an amplifier (triangle).

[0078] The outputs of the summer and the differencer are then combined by a diversity combiner, particularly wherein the outputs of the summer and the differencer are averaged by the gain controller of

[00005]$\frac{1}{\sqrt{2}}$

after which they become the decorrelated outputs of the BiT. The swap operation is further illustrated in equation (A3).

[0079] The diversity combiner may be configured to perform selection combining (SC) by determining which one of the sum signal, the received signals and the difference signal has a higher signal to noise ratio (SNR); and then selecting the one of the sum signal, the received signals and the difference signal that has the higher SNR for data detection.

[0080] The diversity combiner is configured to perform SC combining on the basis of a signal-plus-noise criterion for the sum, the received and the difference signals.

[0081] Alternatively or in addition, the diversity combiner is configured to perform equal gain combining (EGC) combining by summing the sum signal, the received signals and the difference signal to improve the signal to noise ratio (SNR)

[0082] In this example, the diversity combiner is configured to perform EGC combining on the basis of a signal-plus-noise criterion for the sum, the received and the difference signals.

[0083] Alternatively or in addition, the diversity combiner is configured to perform EGC combining on the basis of a signal-to-interference-plus-noise criterion for the sum, received and the difference signals.

[0084] The diversity combiner may be configured to perform switch-and-stay combining (SSC) combining by determining a current SNR for a currently selected one of the sum signal, received signal and the difference signal.

[0085] Determining if the current SNR for the currently selected one of the sum signal, received signal and the difference signal is above a threshold.

[0086] Maintaining the selection of the currently selected one of the sum signal, received and the difference signal upon determining that the current SNR for the currently selected one of the sum signal, received and the difference signal is above the threshold and switching the selection to the other one of the sum signal, received and the difference signal upon determining that the current SNR for the currently selected one of the sum signal, received and the difference signal is below the threshold.

[0087] The diversity combiner is further configured to select the threshold as a function of the current SNR.

[0088] The diversity combiner may also be configured to perform SSC combining on the basis of a signal-plus-noise criterion for the sum, received and the difference signals.

[0089] Alternatively or in addition, the diversity combiner is configured to perform SSC combining on the basis of a signal-to-interference-plus-noise criterion for the sum, received and the difference signals.

[0090] In another aspect, the current invention provides a computer apparatus being programmed for reception of N input signals characterised in that the apparatus is also programmed to transform input signals into output signals.

Classical Decorrelation and Receive Diversity

[0091] In the conventional scheme, correlated signal received from the ith antenna branch is written as

.sub.i=.sub.ix.sub.+n.sub.ii=1, . . . ,N(1)

where x, X is the transmitted signal with E[|x.sub.|.sup.2]=1 and E[.Math.] denotes the expectation operator. .sub.i is the correlated complex channel gain for the ith branch and n.sub.i is the complex Gaussian noise with the distribution (0, N.sub.0).

[0092] Let {circumflex over (z)}=x, then the correlation matrix of the vector z is Hermitian and is given as

R=E[{circumflex over (z)}{circumflex over (z)}.sup.H](2)

where {.Math.}.sup.H denotes the conjugate transpose.

[0093] Thus the channel correlation is modeled by a positive definite correlation matrix R which ensures that all the eigenvalues {.sub.i}.sub.1.sup.N of R are real and R has a complete set of orthonormal eigenvectors {q.sub.i}.sub.1.sup.N. Therefore, the correlation matrix R is unitarily diagonalizable. Since Q is unitary and row-orthogonal, the diagonalization of R is achieved as follows

R=E[QQ.sup.H](2)

where =diag(.sub.1.sub.2 . . . .sub.N).

[0094] The condition that RQ=QD and Q.sup.1=Q.sup.H means that the network is reciprocal and the condition that Q.sup.HQ=QQ.sup.H=I where I is the identity matrix, means that the network is lossless or energy preserving [11]. Intuitively, Q bears information on how correlated branch signal pairs are linearly transformed into independent ones at the receiver while measures the redistributed branch signal strengths.

[0095] To perform decorrelation, the decorrelator applies a unitary transformation on the received signals g such that the new set of signals is given as =Q.sup.H. This operation results in a sum of uncorrelated signals which is given as

=Q.sup.Hhx.sub.+Q.sup.Hn(3)

[0096] Clearly, the correlation matrix {circumflex over (R)} of the transformed signals is the set of eigenvalues and the noise remains independent of the signals. The significance of (3) is that a correlated channel .sub.i can then be expressed in terms of the independent channel .sub.i given that the unit direction vectors q of {circumflex over (R)} are known. As a consequence, the correlated channels are expressed as

.sub.i={square root over (.sub.i)}q.sub.i.sub.i=A.sub.i.sub.i(4)

where for Rayleigh fading, .sub.i is the complex channel gain with a Rayleigh distributed random amplitude of the form (0,1) and a uniformly distributed random phase.

[0097] Since the operation of Q.sup.H through classical methods tend to maximize the first eigenvalue, the output branches of the conventional decorrelator will contain unique branch signal powers when compared to its input. However, the overall signal power is retained i.e. the eigenvalues of {circumflex over (R)} and R are the same. Therefore, depending on the method used to combine the signals after the decorrelator, the performance of the combiners will be different.

[0098] Typically for three branches, MRC, EGC, and SC system combining functions for the signal power can be summarized as

F.sub.MRC()=F(*)

F.sub.EGC()=(|.sub.1|+|.sub.2|+.sub.3|).sup.2

F.sub.SC()=max[(|.sub.1|.sup.2,|.sub.2|.sup.2,|.sub.3|.sup.2](5)

where (*) denotes the complex transpose conjugate operation.

[0099] From (5), it can be seen that only F.sub.MRC will remain the same after decorrelation. In fact, it is easy to see that due to the redistribution of signal powers, the SC combiner will achieve decorrelation gains because the maximum output may always be more than that of single channel.

[0100] Practically, the matrix R can be computed at the receiver. However, these signal measurements can be very complex and thus time consuming. Nonetheless, the knowledge of eigenvectors alone can be used to carry out blind channel decomposition into uncorrelated ones without estimating the covariance as long as the eigenvector corresponds to the principal value of a given network. For example, for uniform circular arrays (UCA), the eigenvalues are given by the discrete Fourier transform (DFT) of the first row of R where the unitary transformation is given as

[00006]$\begin{array}{cc}Q=\frac{1}{\sqrt{N}}\left[\begin{array}{cccc}1& 1& \mathrm{.Math.}& 1\\ 1& {}^1& \mathrm{.Math.}& {}^{N-1}\\ \mathrm{.Math.}& \mathrm{.Math.}& & \mathrm{.Math.}\\ 1& {}^{N-1}& \mathrm{.Math.}& {}^{\left(N-1\right).Math.\left(N-1\right)}\end{array}\right]& \left(6\right)\end{array}$

where =e.sup.j2/N.

[0101] By inspection, the unitary transformation Q, is essentially an orthogonal beam-forming matrix. Therefore, the problem reduces to determining a basic decorrelator for arbitrary correlation. The decorrelator should be blind to the type of correlation and applicable in multi branch signals.

[0102] Firstly, for the decorrelator to achieve uniform decorrelation so that (5) is not changed, then the use of the new decorrelator leads to a scenario where diag(.sub.1.sub.2 . . . .sub.N). Secondly, the eigenvalues must not be repeated since that will make EGC perform just like MRC. These conditions seem to make no sense because no decorrelation gains are achieved, but in terms of performance analysis, a correlated system can then be described by a decorrelated system if these conditions are met.

[0103] Besides, decorrelation gain is a very important aim in decorrelation processes. We will show that through principal component analysis (PCA), an eigenvector can be designed that achieves both uniform decorrelation and decorrelation gain when connected in a proposed network. This is the main discovery in the proposed approach. Accordingly, Q which meets the above criteria is presented. This is referred to as binary index transform (BiT) decorrelator.

Mathematical Validation

[0104] In the following description, it is shown that the operation carried by each BiT transform results in decorrelated output signals. Let x.sub.i and x.sub.j be zero-mean random variables (RVs). Taking the expectation of the product of the two RVs results is the covariance and the signals will be decorrelated if the covariance is zero for ij i.e.,

[00007]$\begin{array}{cc}E\left(x_i.Math.x_j\right)=\{\begin{array}{cc}0& ij\\ {}_i^2& i=j\end{array}& \left(\mathrm{A1}\right)\end{array}$

where E(.Math.) is the expectation operator and .sub.i.sup.2 is the variance.

Transformed Signal Analysis

[0105] Let .sub.m and denote the mixing coefficient and correlation coefficients, respectively between any two mixed signals and .sup.2 to denote the variance of each channel. Then, the analytical deductions of the output signals .sub.o1 and .sub.o2 and the covariance within each output signal can be expressed in the following analysis.

[0106] The output of each BiT operation is written as follows: .sub.o=Q.sup.H.sub.i, where (.Math.).sup.H denotes the Hermitian transpose of the BiT eigenvector Q where it is given that

[00008]$Q=\frac{1}{\sqrt{2}}.Math.\left(\begin{array}{cc}1& j\\ 1& -j\end{array}\right)=\left(\begin{array}{cc}\cos .Math..Math.& .Math..Math.\cos .Math..Math.\\ \sin .Math..Math.& -.Math..Math.\sin .Math..Math.\end{array}\right)$

for =45.

[00009]$\begin{array}{cc}{\hat{s}}_{o.Math..Math.1}=\cos .Math..Math.\left(X_1+{\mathrm{jY}}_1\right).Math.s+\cos .Math..Math.\left(X_2+{\mathrm{jY}}_2\right).Math.s+\cos .Math..Math..Math.n_1+\cos .Math..Math..Math.n_2=\left\{\cos .Math..Math.\left(X_1+{\mathrm{jY}}_1\right).Math.s+\left[\cos .Math..Math.\left(X_2+{\mathrm{jY}}_2\right).Math.s\right]\right\}.Math.s+\cos .Math..Math..Math.n_1+\cos .Math..Math..Math.n_2=\left\{\underset{\underset{X_3}{}}{\left[\cos .Math..Math.\left(X_1+X_2\right)\right]}+j.Math.\underset{\underset{Y_3}{}}{\left[\cos .Math..Math.\left(Y_1+Y_2\right)\right]}\right\}.Math.s+\underset{\underset{n_3}{}}{\cos .Math..Math..Math.n_1+\cos .Math..Math..Math.n_2}& \left(\mathrm{A2}\right)\\ {\hat{s}}_{02}=-.Math..Math.\sin .Math..Math.\left(X_1+{\mathrm{jY}}_1\right).Math.s+.Math..Math.\sin .Math..Math.\left(X_2+{\mathrm{jY}}_2\right).Math.s-.Math..Math.\sin .Math..Math..Math.n_1+.Math..Math.\sin .Math..Math..Math.n_2=\left\{-\sin .Math..Math.\left(X_1+{\mathrm{jY}}_1\right)+.Math.\left[\sin .Math..Math.\left(X_2+{\mathrm{jY}}_2\right)\right]\right\}.Math.s-\sin .Math..Math..Math.n_1+.Math..Math.\sin .Math..Math..Math.n_2=\left\{\underset{\underset{X_4}{}}{\left[\sin .Math..Math.\left(Y_1-Y_2\right)\right]}+j.Math.\underset{\underset{Y_4}{}}{\left[\sin .Math..Math.\left(X_2-X_1\right)\right]}\right\}.Math.s+\underset{\underset{n_4}{}}{\sin .Math..Math..Math.n_2-.Math..Math.\sin .Math..Math..Math.n_1}& \left(\mathrm{A3}\right)\end{array}$

[0107] Since X.sub.1, X.sub.2, Y.sub.1 and Y.sub.2 are zero mean Gaussian random variables, it is clear that X.sub.3, X.sub.4, Y.sub.3 and Y.sub.4 are also zero mean Gaussian random variables. Now we calculate variances of X.sub.3, X.sub.4, Y.sub.3 and Y.sub.4

E[X.sub.3.sup.2]=E[(cos (X.sub.1+X.sub.2)).sup.2]=cos.sup.2()E[X.sub.1.sup.2+X.sub.2.sup.2+2X.sub.1X.sub.2]

E[X.sub.1.sup.2]=E[Y.sub.2.sup.2]=.sup.2,E[X.sub.1X.sub.2]=.sub.m.sup.2

E[X.sub.3.sup.2]=(1+.sub.m).sup.2=.sub.3.sup.2(A4)

E[X.sub.4.sup.2]=E[(sin (Y.sub.1Y.sub.2)).sup.2]=sin.sup.2()E[Y.sub.1.sup.2+Y.sub.2.sup.22Y.sub.1Y.sub.2]

E[X.sub.1.sup.2]=E[Y.sub.2.sup.2]=.sup.2,E[Y.sub.1Y.sub.2]=.sub.m.sup.2

E[X.sub.4.sup.2]=(1.sub.m).sup.2=.sub.4.sup.2(A5)

E[Y.sub.3.sup.2]=E[(cos (Y.sub.1+Y.sub.2)).sup.2]=cos.sup.2()E[Y.sub.1.sup.2+Y.sub.2.sup.2+2Y.sub.1Y.sub.2]

E[Y.sub.1.sup.2]=E[Y.sub.2.sup.2]=.sup.2,E[Y.sub.1Y.sub.2]=.sub.m.sup.2

E[Y.sub.3.sup.2]=(1+.sub.m).sup.2=.sub.3.sup.2(A6)

E[Y.sub.4.sup.2]=E[(sin (X.sub.1X.sub.2)).sup.2]=sin.sup.2()E[X.sub.1.sup.2+X.sub.2.sup.22X.sub.1X.sub.2]

E[Y.sub.1.sup.2]=E[X.sub.2.sup.2]=.sup.2,E[X.sub.1X.sub.2]=.sub.m.sup.2

E[Y.sub.4.sup.2]=(1.sub.m).sup.2=.sub.4.sup.2(A7)

[0108] We note that E[X.sub.iY.sub.k]=0, i=1,2 and k=1,2 and the covariances of X.sub.3 and X.sub.4 can be calculated by

[00010]$\begin{array}{cc}{C}_{X_3.Math.X_4}=E\left[X_3.Math.X_4\right]=\cos .Math..Math.\left(X_1+X_2\right).Math.\sin .Math..Math.\left(Y_1-Y_2\right)=E.Math.\left\{\cos .Math..Math..Math..Math.\sin .Math..Math.\left[\left(X_1.Math.Y_2-X_2.Math.Y_2+X_1.Math.Y_1-X_2.Math.Y_1\right)\right]\right\}=0& \left(\mathrm{A8}\right)\end{array}$

[0109] Similarly, the covariances of Y.sub.3 and Y.sub.4 can be calculated by

[00011]$\begin{array}{cc}{C}_{Y_3.Math.Y_4}=E\left[Y_3.Math.Y_4\right]=\cos .Math..Math.\left(Y_1+Y_2\right).Math.\sin .Math..Math.\left(X_2-X_1\right)=E.Math.\left\{\cos .Math..Math..Math..Math.\sin .Math..Math.\left[\left(Y_1.Math.X_2-Y_1.Math.X_1+Y_2.Math.X_2-Y_2.Math.X_1\right)\right]\right\}=0& \left(\mathrm{A9}\right)\end{array}$

[0110] Readily, in view of (A1), the transformation results in decorrelation. [0111] Let the new random variables be expressed as .sub.ke.sup.jk=X.sub.k+jY.sub.k,k=o1, o2, o3 and .sub.k={square root over (X.sub.k.sup.2+Y.sub.k.sup.2)} which are the envelopes of two independent Rayleigh-fading signals. We therefore have E[.sub.o1.sup.2]=2(1+.sub.m).sup.2 and E[.sub.o2.sup.2]=2(1.sub.m).sup.2 while E[.sub.o3.sup.2]=1. We also have [|n.sub.k|.sup.2]=N.sub.0, k=o1, o2, o3. The average SNR for .sub.o1 and .sub.o2 are .sub.o1=(1+.sub.m) and .sub.o2=(1.sub.m) respectively, where is the average SNR for .sub.1, .sub.2 and .sub.3.

[0112] Clearly, .sub.o1 and .sub.o2 are two independent Rayleigh-fading signals. Furthermore, as explained in the text, the values D.sub.o1=(1+.sub.m), D.sub.o2=(1.sub.m) and D.sub.o3=1 are the principal component scaling values or eigenvalues where we have .sub.m= since .sub.m=1.

[0113] The discovery of the invention is that varies for each set of a pair of signals and instead of exploiting the set or operations which maximize D.sub.oi, the decorrelated signals from each set can be used to achieve coding gains. The basis of the invention is novel and informs the teachings of the current invention in that it is the virtual signals in the spacing between the real antennas that are computed by the BiT so that a full NN channel and NN output signal matrix can be formed by the decorrelated signals when these decorrelated signals are added to the signals received by the real antennas.

[0114] In summary, obtaining converged eigenvectors to achieve this task involves computation of the covariance matrix and the computation of corresponding eigenvectors as in the KLT algorithms. The use of blind eigenvectors like the BiT avoids this complexity overhead. Furthermore, not all blind eigenvectors e.g. N branch DFT can achieve this task like the BiT. Furthermore, the BiT can be enhanced to be an N branch N-BiT in order to perform less operations. This can be done by designing an N-branch unitary row-orthogonal matrix with orthonormal basis. However, even when the BiT is enhanced, the same gains are achieved.

Method of Simulations

[0115] The simulations illustrated in the figures are for the bit error probability/rate (BER). System BER is carried out for the three receive diversity combining systems. Each three-branch diversity system BER is presented against the output SNR. Signals modulated via binary phase shift (BPSK) technique are used in the simulations.

[0116] In the succeeding discussion, the output SNR of the BiT decorrelator is used to show that the BER remains the same as the conventional case. In order to compute correlation R, a linear array of antennas is assumed with uniform angle of arrival (AOA). It is known that correlation coefficients can be obtained from the formula

[00012]$\begin{array}{cc}=J_0\left(2.Math..Math..Math.\frac{d}{}\right)& \left(\mathrm{A10}\right)\end{array}$

where J.sub.0 (.Math.) is the zero-order Bessel function of the first kind, d is the spacing between antennas and is the wavelength of the carrier.

[0117] For example, given an antenna spacing of d=0.2, then normalized correlation matrices with correlation coefficients for three equally-spaced receive branches is written as

[00013]$\begin{array}{cc}R=\left(\begin{array}{ccc}1& 0.6425& -0.055\\ 0.6425& 1& 0.6425\\ -0.055& 0.6425& 1\end{array}\right)& \left(\mathrm{A11}\right)\end{array}$

[0118] Thus it will be appreciated that the present invention provides an improved decorrelator and a method for receiving and decorrelating signals in a wireless communications system. Furthermore, all diversity combiners normally used in wireless communications can be applied on the output signals provided by the present invention.