CN101783722B - Transmission method and device for virtual MIMO - Google Patents

Abstract

The invention discloses a sending method for the virtual MIMO. The invention is characterized in that user terminals UE1 and UE2 use the same time-frequency resources and send information according to the same method, wherein the UE1 simultaneously sends DFT pretreatment signal vectors (Xk, Xk+1) at k time and k+1 time to a space-time block grouping encoder for space-time two-dimension encoding treatment in a form of the vector, and outputs two codeword vectors (Xk, Xk+1) at k time and the other two codeword vectors at k+1 time to send the codeword vectors respectively obtained at k time and k+1 time to a first transmitting channel to carry out sub-channel mapping, IFF operation, inserting cyclic prefixes and transmitting treatment; and the codeword vectors respectively obtained at k time and k+1 time are sent to a second channel to carry out sub-channel mapping, IFF operation, inserting cyclic prefixes and transmitting treatment. The invention also discloses a transmitter and a receiver for the virtual MIMO. The invention can fully utilize a multi-antenna system to provide spatial emission diversity gain and improve reliability of link transmission.

Description

A kind of virtual MIMO transmission method and device

Technical field

The present invention relates to the virtual MIMO transmission technology, particularly relate to transmission method and the device of the virtual MIMO of a kind of DFT-S-OFDM based on space-time block coding.

Background technology

In the LTE wide-band mobile communication system, 3GPP determines that up link adopts the Single Carrier Frequency Division Multiple Access transmission plan based on DFT-S-OFDM, compares with the OFDM transmission plan, and the DFT-S-OFDM transmission plan has low peak average ratio and keeps the characteristic of user's quadrature at frequency domain.

At present, introduced uplink dummy MIMO transmission technology in the LTE communication system, realized that the technical scheme of this technology mainly is based on the virtual MIMO transmission plan of single transmit antenna DFT-S-OFDM.

Fig. 1 is two users' virtual MIMO system based on single transmit antenna DFT-S-OFDM, and wherein, each user terminal (UE) only is equipped with single transmitting antenna, and base station (eNodeB) installs N _rIndividual reception antenna (N among the figure _rValue is 2).Two user terminals use the different information of identical running time-frequency resource transmission under the eNodeB scheduling, two are equipped with single transmit antenna user terminal and consist of a 2 * N with the eNodeB receiver that is equipped with Nr reception antenna _rMimo system, this mimo system is different from traditional mimo system working method, is called virtual MIMO system.In the virtual MIMO system, the scheduling user terminal number can be above two simultaneously for eNodeB, but after considering that user terminal surpasses two, eNodeB receiver detection complexity can significantly improve, so only considers the virtual MIMO system that two users consist of in the real system.

Fig. 2 is the transmitter block diagram based on the virtual MIMO of single transmit antenna DFT-S-OFDM.Single transmit antenna DFT-S-OFDM virtual MIMO transmitter and alone family DFT-S-OFDM transmitter architecture are identical, and difference only is: two user terminals use identical running time-frequency resource to transmit different separately information under the eNodeB scheduling; In addition, for realizing the eNodeB receiver channel of two user terminals is estimated, need to be carried out particular design to the pilot signal of each user terminal.

Fig. 3 is the virtual MIMO receiver block diagram based on two reception antenna DFT-S-OFDM.In eNodeB, two reception antennas receive simultaneously two users and transmit, and send into baseband processing unit after radio frequency and intermediate frequency process; In baseband processing unit, receiver at first removes Cyclic Prefix, then transform to frequency domain by FFT, after separating mapping, adopt linear ZF (ZF) or least mean-square error (MMSE) algorithm to carry out frequency domain equalization and process, at last signal after the equilibrium is transformed into time domain and carries out every user by symbol detection through IDFT.

Compare with alone family transmission means, virtual MIMO system can significantly improve the band efficiency of up link.But, studies show that recently: based on the reliability that the DFT-S-OFDM transmission plan of single antenna can not utilize many antennas to provide spatial emission diversity gain to improve link transmission, can not utilize many antennas to provide spatial reuse to gain to improve the transmission capacity of link.

In a word, existing virtual MIMO transmission plan can not take full advantage of multiaerial system provides spatial emission diversity gain, will cause the reliability of link transmission relatively poor.

Summary of the invention

In view of this, main purpose of the present invention is to provide a kind of virtual MIMO transmission method and device.This transmission plan can take full advantage of multiaerial system spatial emission diversity gain is provided, and improves the reliability of link transmission.

In order to achieve the above object, the technical scheme of the present invention's proposition is:

A kind of sending method of virtual MIMO, the method comprises:

Two users' terminal UE 1 is used respectively identical running time-frequency resource with UE2, sends information according to identical method;

The method of described transmission information is:

With the signal phasor { X of discrete Fourier transform (DFT) DFT in two adjacent moment k and k+1 output _k, X _K+1Send into simultaneously space-time block coding, and carry out space-time block coding take signal phasor as unit, at two code word vector { X of the previous moment k in described adjacent two moment output _k, X _K+1, export in addition two code word vector { X at a rear moment k+1 in described adjacent two moment _K+1 ^*, X _k ^*;

Code word vector X with space-time block coding output _kWith-X _K+1 ^*Send into the first emission path and carry out subchannel mapping, contrary fast fourier transform IFFT, insertion Cyclic Prefix, intermediate frequency and radio-frequency transmissions processing; Code word vector X with the output of space-time block coding _K+1And X _k ^*Send into the second emission path and carry out subchannel mapping, contrary fast fourier transform IFFT, insertion Cyclic Prefix, intermediate frequency and radio-frequency transmissions processing.

A kind of transmitter of virtual MIMO, comprise: modulator, DFT preprocessor, space-time block coding device, the first mapper, the second mapper, an IFFT processor, the 2nd IFFT processor, the first Cyclic Prefix inserter, the second Cyclic Prefix inserter, the first intermediate frequency and rf processor, the second intermediate frequency and rf processor, the first transmitting antenna and the second transmitting antenna

Described DFT preprocessor, being used for will be at the signal phasor { X of two adjacent moment k and k+1 generation _k, X _K+1Send into simultaneously described space-time block coding device;

Described space-time block coding device is for the signal phasor { X that receives described DFT preprocessor _k, X _K+1, and carry out space-time block coding take signal phasor as unit, at two code word vector { X of the previous moment k in described adjacent two moment output _k, X _K+1, export in addition two code word vector { X at a rear moment k+1 in described adjacent two moment _K+1 ^*, X _k ^*; Wherein, with code word vector X _kWith-X _K+1 ^*Export to described the first mapper, with code word vector X _K+1And X _k ^*Export to described the second mapper.

A kind of method of reseptance of virtual MIMO, the method comprises:

From the radiofrequency signal of two reception antennas respectively through radio frequency, intermediate frequency process, sampling, Cyclic Prefix remove, fast fourier transform FFT conciliates mapping, obtains first reception signal phasor Y on the antenna _k ⁽¹⁾, Y _K+1 ⁽¹⁾With the reception signal phasor Y on second antenna _k ⁽²⁾, Y _K+1 ⁽²⁾To every reception antenna, k is received signal phasor Y constantly _k ⁽ⁿ⁾Constantly receive signal phasor Y with k+1 _K+1 ⁽ⁿ⁾Conjugation

Arrange the corrected received signal that forms every reception antenna by row $Y^{\left(n\right)}=\left[\begin{array}{c}{Y}_k^{\left(n\right)}\\ Y_{k+1}^{{\left(n\right)}^{*}}\end{array}\right],$ N is the reception antenna numbering; The corrected received signal of two reception antennas is arranged the total corrected received signal of formation by row $Y=\left[\begin{array}{c}{Y}^{\left(1\right)}\\ Y^{\left(2\right)}\end{array}\right];$

According to the frequency response of each sub-channels between every transmit antennas of first user terminal UE 1 and every reception antenna, all transmitting antennas of structure UE1 divide the transmission matrix that is clipped to two reception antennas ${\mathrm{\&Lambda;}}_{\mathrm{1,1}}=\left[\begin{array}{cc}{H}_{\mathrm{1,1}}& {\mathrm{<figure-callout\; id="2"\; label="H"\; filenames="H2009100775112E00031.png"\; state="\{\{state\}\}">H</figure-callout>}}_{\mathrm{2,1}}\\ {\mathrm{<figure-callout\; id="2"\; label="H"\; filenames="H2009100775112E00031.png"\; state="\{\{state\}\}">\; <figure-callout\; id="1"\; label="H"\; filenames="H2009100775112E00022.png"\; state="\{\{state\}\}">H</figure-callout>\; </figure-callout>}}_{\mathrm{2,1}}^{*}& -{\mathrm{<figure-callout\; id="1"\; label="H"\; filenames="H2009100775112E00022.png"\; state="\{\{state\}\}">\; <figure-callout\; id="1"\; label="H"\; filenames="H2009100775112E00022.png"\; state="\{\{state\}\}">H</figure-callout>\; </figure-callout>}}_{\mathrm{1,1}}^{*}\end{array}\right],$ ${\mathrm{\&Lambda;}}_{2,1}=\left[\begin{array}{cc}{\mathrm{<figure-callout\; id="1"\; label="H"\; filenames="H2009100775112E00022.png"\; state="\{\{state\}\}">H</figure-callout>}}_{1,2}& {\mathrm{<figure-callout\; id="2"\; label="H"\; filenames="H2009100775112E00031.png"\; state="\{\{state\}\}">H</figure-callout>}}_{\mathrm{2,2}}\\ {\mathrm{<figure-callout\; id="2"\; label="H"\; filenames="H2009100775112E00031.png"\; state="\{\{state\}\}">\; <figure-callout\; id="2"\; label="H"\; filenames="H2009100775112E00031.png"\; state="\{\{state\}\}">H</figure-callout>\; </figure-callout>}}_{2,2}^{*}& -{\mathrm{<figure-callout\; id="1"\; label="H"\; filenames="H2009100775112E00022.png"\; state="\{\{state\}\}">\; <figure-callout\; id="2"\; label="H"\; filenames="H2009100775112E00031.png"\; state="\{\{state\}\}">H</figure-callout>\; </figure-callout>}}_{1,2}^{*}\end{array}\right],$ According to the frequency response of each sub-channels between every transmit antennas of the second user terminal UE2 and every reception antenna, all transmitting antennas of structure UE2 are to the transmission matrix of each reception antenna ${\mathrm{\&Lambda;}}_{\mathrm{1,2}}=\left[\begin{array}{cc}{\mathrm{<figure-callout\; id="1"\; label="G"\; filenames="H2009100775112E00022.png"\; state="\{\{state\}\}">G</figure-callout>}}_{\mathrm{1,1}}& {\mathrm{<figure-callout\; id="2"\; label="G"\; filenames="H2009100775112E00031.png"\; state="\{\{state\}\}">G</figure-callout>}}_{\mathrm{2,1}}\\ {\mathrm{<figure-callout\; id="2"\; label="G"\; filenames="H2009100775112E00031.png"\; state="\{\{state\}\}">\; <figure-callout\; id="1"\; label="G"\; filenames="H2009100775112E00022.png"\; state="\{\{state\}\}">G</figure-callout>\; </figure-callout>}}_{\mathrm{2,1}}^{*}& -{\mathrm{<figure-callout\; id="1"\; label="G"\; filenames="H2009100775112E00022.png"\; state="\{\{state\}\}">\; <figure-callout\; id="1"\; label="G"\; filenames="H2009100775112E00022.png"\; state="\{\{state\}\}">G</figure-callout>\; </figure-callout>}}_{\mathrm{1,1}}^{*}\end{array}\right],$ ${\mathrm{\&Lambda;}}_{2,2}=\left[\begin{array}{cc}{\mathrm{<figure-callout\; id="1"\; label="G"\; filenames="H2009100775112E00022.png"\; state="\{\{state\}\}">G</figure-callout>}}_{1,2}& {\mathrm{<figure-callout\; id="2"\; label="G"\; filenames="H2009100775112E00031.png"\; state="\{\{state\}\}">G</figure-callout>}}_{\mathrm{2,2}}\\ {\mathrm{<figure-callout\; id="2"\; label="G"\; filenames="H2009100775112E00031.png"\; state="\{\{state\}\}">\; <figure-callout\; id="2"\; label="G"\; filenames="H2009100775112E00031.png"\; state="\{\{state\}\}">G</figure-callout>\; </figure-callout>}}_{2,2}^{*}& -{\mathrm{<figure-callout\; id="1"\; label="G"\; filenames="H2009100775112E00022.png"\; state="\{\{state\}\}">\; <figure-callout\; id="2"\; label="G"\; filenames="H2009100775112E00031.png"\; state="\{\{state\}\}">G</figure-callout>\; </figure-callout>}}_{1,2}^{*}\end{array}\right];$

Wherein, H _{M, n}=diag (H _{M, n}(1), H _{M, n}(2) ..., H _{M, n}(j) ... H _{M, n}(N)) represent the diagonal matrix that the frequency response of m transmitting antenna of UE1 n all N sub-channels of reception antenna to the base station consists of, wherein j diagonal element H _{M, n}(j) represent m transmitting antenna of UE1 to the frequency response of n the reception antenna l=f in base station (j) sub-channels; G _{M, n}=diag (G _{M, n}(1), G _{M, n}(2) ..., G _{M, n}(j) ... G _{M, n}(N)) represent the diagonal matrix that the frequency response of m transmitting antenna of UE2 n all N sub-channels of reception antenna to the base station consists of, wherein j diagonal element G _{M, n}(j) represent m transmitting antenna of UE2 to the frequency response of n the reception antenna l=f in base station (j) sub-channels, m=1 or 2, l=f (j) is the relation of the channel mapping in arbitrary emission path when transmitting, l is the subchannel numbering that is mapped to, j is j component of described arbitrary emission path inner code word vector, j=1 ..., N, N are the counting of DFT conversion of transmitting;

According to described transmission matrix, set up linear ZF matrix $E=\left[\begin{array}{cc}{I}_{2N}& -{\mathrm{\&Lambda;}}_{1,2}{\mathrm{\&Lambda;}}_{\mathrm{2,2}}^{-1}\\ -{\mathrm{\&Lambda;}}_{\mathrm{2,1}}{\mathrm{\&Lambda;}}_{\mathrm{1,1}}^{-1}& I_{2N}\end{array}\right];$

Calculate linear ZF matrix and corrected received signal long-pending, with result of product as the first equivalent received signals $\tilde{Y}=\mathrm{EY},$ Wherein $\tilde{Y}=\left[\begin{array}{c}{\tilde{Y}}_1\\ {\tilde{Y}}_2\end{array}\right];$

Utilize $\mathrm{\&Sigma;}={\mathrm{\&Lambda;}}_{\mathrm{1,1}}-{\mathrm{\&Lambda;}}_{\mathrm{1,2}}{\mathrm{\&Lambda;}}_{\mathrm{2,2}}^{-1}{\mathrm{\&Lambda;}}_{\mathrm{2,1}}$ With $\mathrm{\&Delta;}={\mathrm{\&Lambda;}}_{\mathrm{2,2}}-{\mathrm{\&Lambda;}}_{\mathrm{2,1}}{\mathrm{\&Lambda;}}_{\mathrm{1,1}}^{-1}{\mathrm{\&Lambda;}}_{\mathrm{1,2}},$ According to ${\widetilde{\stackrel{~}{Y}}}_1={\mathrm{\&Sigma;}}^H{\tilde{Y}}_1$ With ${\widetilde{\stackrel{~}{Y}}}_2={\mathrm{\&Delta;}}^H{\tilde{Y}}_2,$ Obtain the second equivalent received signals

With

The structure diagonal matrix ${\mathrm{\&Sigma;}}^H\mathrm{\&Sigma;}=\left(\begin{array}{cc}\mathrm{<figure-callout\; id="0"\; label="A"\; filenames="H2009100775112E00031.png"\; state="\{\{state\}\}">A</figure-callout>}& 0\\ 0& A\end{array}\right)$ With ${\mathrm{\&Delta;}}^H\mathrm{\&Delta;}=\left(\begin{array}{cc}\mathrm{<figure-callout\; id="0"\; label="B"\; filenames="H2009100775112E00031.png"\; state="\{\{state\}\}">B</figure-callout>}& 0\\ 0& B\end{array}\right),$ Obtain diagonal matrix A and B;

According to $\left\{\begin{array}{c}{\tilde{X}}_{k,j}=\frac{1}{\mathrm{\&alpha;}\left(j\right)+{{\mathrm{\&sigma;}}_{\mathrm{1,1},\mathrm{<figure-callout\; id="2"\; label="j"\; filenames="H2009100775112E00031.png"\; state="\{\{state\}\}">j</figure-callout>}}}^2}\&CenterDot;{\widetilde{\stackrel{~}{Y}}}_{\mathrm{1,1},j}\\ {\tilde{X}}_{k+1,j}=\frac{1}{\mathrm{\&alpha;}\left(j\right)+{{\mathrm{\&sigma;}}_{\mathrm{1,2},\mathrm{<figure-callout\; id="2"\; label="j"\; filenames="H2009100775112E00031.png"\; state="\{\{state\}\}">j</figure-callout>}}}^2}\&CenterDot;{\widetilde{\stackrel{~}{Y}}}_{\mathrm{1,2},j}\end{array}\right.,$ J=1 ..., N, the transmitting terminal signal phasor { X of calculating UE1 _k, X _K+1Estimated value

Wherein, α (j) is j the diagonal element of A,

And

Be respectively

And

J component,

And

Be respectively

Top n component and the vector that consists of of a rear N component;

According to $\left\{\begin{array}{c}{\tilde{C}}_{k,j}=\frac{1}{\mathrm{\&beta;}\left(j\right)+{{\mathrm{\&sigma;}}_{2,1,\mathrm{<figure-callout\; id="2"\; label="j"\; filenames="H2009100775112E00031.png"\; state="\{\{state\}\}">j</figure-callout>}}}^2}\&CenterDot;{\widetilde{\stackrel{~}{Y}}}_{\mathrm{2,1},j}\\ {\tilde{C}}_{k+1,j}=\frac{1}{\mathrm{\&beta;}\left(j\right)+{{\mathrm{\&sigma;}}_{\mathrm{2,2},\mathrm{<figure-callout\; id="2"\; label="j"\; filenames="H2009100775112E00031.png"\; state="\{\{state\}\}">j</figure-callout>}}}^2}\&CenterDot;{\widetilde{\stackrel{~}{Y}}}_{\mathrm{2,2},j}\end{array}\right.,$ J=1 ..., N calculates the transmitting terminal signal phasor { C of UE2 _k, C _K+1Estimated value

Wherein, β (j) is j the diagonal element of B,

And

Be respectively

And J component,

And

Be respectively

Top n component and the vector that consists of of a rear N component;

Estimated value to described transmitting terminal signal phasor

With

Carry out inverse Fourier transform IDFT, detect again the estimated value of the emission symbol that obtains UE1 and UE2.

A kind of receiver of virtual MIMO, this receiver comprises: with 2 reception antennas one to one 2 receivers, 2 cyclic prefix remover, 2 fft processors, 2 de-mapping devices, space-time joint equalizer, 2 IDFT processors and 2 demodulators;

Arbitrary receiver is used for the signal that receiving end/sending end sends, and carries out exporting to coupled cyclic prefix remover after radio frequency, intermediate frequency and the sampling processing;

Arbitrary cyclic prefix remover is used for removing Cyclic Prefix from the signal that receives, and exports to coupled fft processor;

Arbitrary fft processor is used for that the signal that receives is carried out FFT and processes, and exports to coupled de-mapping device;

Arbitrary de-mapping device is used for the signal that receives obtaining two and receiving signal phasor Y according to separating mapping with the corresponding mode of transmitting terminal _k ⁽ⁿ⁾And Y _K+1 ⁽ⁿ⁾, n is reception antenna numbering corresponding to this de-mapping device; Described space-time joint equalizer for every reception antenna, receives signal phasor Y constantly with k _k ⁽ⁿ⁾Constantly receive signal phasor Y with k+1 _K+1 ⁽ⁿ⁾Conjugation Arrange the corrected received signal that forms every reception antenna by row $Y^{\left(n\right)}=\left[\begin{array}{c}{Y}_k^{\left(n\right)}\\ Y_{k+1}^{{\left(n\right)}^{*}}\end{array}\right],$ N is the reception antenna numbering; The corrected received signal of two reception antennas is arranged the total corrected received signal of formation by row $Y=\left[\begin{array}{c}{Y}^{\left(1\right)}\\ Y^{\left(2\right)}\end{array}\right];$ According to the frequency response of each sub-channels between every transmit antennas of first user terminal UE 1 and every reception antenna, all transmitting antennas of structure UE1 divide the transmission matrix that is clipped to two reception antennas ${\mathrm{\&Lambda;}}_{\mathrm{1,1}}=\left[\begin{array}{cc}{\mathrm{<figure-callout\; id="1"\; label="H"\; filenames="H2009100775112E00022.png"\; state="\{\{state\}\}">H</figure-callout>}}_{\mathrm{1,1}}& {\mathrm{<figure-callout\; id="2"\; label="H"\; filenames="H2009100775112E00031.png"\; state="\{\{state\}\}">H</figure-callout>}}_{\mathrm{2,1}}\\ {\mathrm{<figure-callout\; id="2"\; label="H"\; filenames="H2009100775112E00031.png"\; state="\{\{state\}\}">\; <figure-callout\; id="1"\; label="H"\; filenames="H2009100775112E00022.png"\; state="\{\{state\}\}">H</figure-callout>\; </figure-callout>}}_{\mathrm{2,1}}^{*}& -{\mathrm{<figure-callout\; id="1"\; label="H"\; filenames="H2009100775112E00022.png"\; state="\{\{state\}\}">\; <figure-callout\; id="1"\; label="H"\; filenames="H2009100775112E00022.png"\; state="\{\{state\}\}">H</figure-callout>\; </figure-callout>}}_{\mathrm{1,1}}^{*}\end{array}\right],$ ${\mathrm{\&Lambda;}}_{2,1}=\left[\begin{array}{cc}{H}_{1,2}& {\mathrm{<figure-callout\; id="2"\; label="H"\; filenames="H2009100775112E00031.png"\; state="\{\{state\}\}">H</figure-callout>}}_{\mathrm{2,2}}\\ {\mathrm{<figure-callout\; id="2"\; label="H"\; filenames="H2009100775112E00031.png"\; state="\{\{state\}\}">\; <figure-callout\; id="2"\; label="H"\; filenames="H2009100775112E00031.png"\; state="\{\{state\}\}">H</figure-callout>\; </figure-callout>}}_{2,2}^{*}& -{\mathrm{<figure-callout\; id="1"\; label="H"\; filenames="H2009100775112E00022.png"\; state="\{\{state\}\}">\; <figure-callout\; id="2"\; label="H"\; filenames="H2009100775112E00031.png"\; state="\{\{state\}\}">H</figure-callout>\; </figure-callout>}}_{1,2}^{*}\end{array}\right],$ According to the frequency response of each sub-channels between every transmit antennas of the second user terminal UE2 and every reception antenna, all transmitting antennas of structure UE2 are to the transmission matrix of each reception antenna ${\mathrm{\&Lambda;}}_{\mathrm{1,2}}=\left[\begin{array}{cc}{\mathrm{<figure-callout\; id="1"\; label="G"\; filenames="H2009100775112E00022.png"\; state="\{\{state\}\}">G</figure-callout>}}_{\mathrm{1,1}}& {\mathrm{<figure-callout\; id="2"\; label="G"\; filenames="H2009100775112E00031.png"\; state="\{\{state\}\}">G</figure-callout>}}_{\mathrm{2,1}}\\ {\mathrm{<figure-callout\; id="2"\; label="G"\; filenames="H2009100775112E00031.png"\; state="\{\{state\}\}">\; <figure-callout\; id="1"\; label="G"\; filenames="H2009100775112E00022.png"\; state="\{\{state\}\}">G</figure-callout>\; </figure-callout>}}_{\mathrm{2,1}}^{*}& -{\mathrm{<figure-callout\; id="1"\; label="G"\; filenames="H2009100775112E00022.png"\; state="\{\{state\}\}">\; <figure-callout\; id="1"\; label="G"\; filenames="H2009100775112E00022.png"\; state="\{\{state\}\}">G</figure-callout>\; </figure-callout>}}_{\mathrm{1,1}}^{*}\end{array}\right],$ ${\mathrm{\&Lambda;}}_{2,2}=\left[\begin{array}{cc}{\mathrm{<figure-callout\; id="1"\; label="G"\; filenames="H2009100775112E00022.png"\; state="\{\{state\}\}">G</figure-callout>}}_{1,2}& {\mathrm{<figure-callout\; id="2"\; label="G"\; filenames="H2009100775112E00031.png"\; state="\{\{state\}\}">G</figure-callout>}}_{\mathrm{2,2}}\\ {\mathrm{<figure-callout\; id="2"\; label="G"\; filenames="H2009100775112E00031.png"\; state="\{\{state\}\}">\; <figure-callout\; id="2"\; label="G"\; filenames="H2009100775112E00031.png"\; state="\{\{state\}\}">G</figure-callout>\; </figure-callout>}}_{2,2}^{*}& -{\mathrm{<figure-callout\; id="1"\; label="G"\; filenames="H2009100775112E00022.png"\; state="\{\{state\}\}">\; <figure-callout\; id="2"\; label="G"\; filenames="H2009100775112E00031.png"\; state="\{\{state\}\}">G</figure-callout>\; </figure-callout>}}_{1,2}^{*}\end{array}\right],$ Wherein, H _{M, n}=diag (H _{M, n}(1), H _{M, n}(2) ..., H _{M, n}(j) ... H _{M, n}(N)) represent the diagonal matrix that the frequency response of m transmitting antenna of UE1 n all N sub-channels of reception antenna to the base station consists of, wherein j diagonal element H _{M, n}(j) represent m transmitting antenna of UE1 to the frequency response of n the reception antenna l=f in base station (j) sub-channels; G _{M, n}=diag (G _{M, n}(1), G _{M, n}(2) ..., G _{M, n}(j) ... G _{M, n}(N)) represent the diagonal matrix that the frequency response of m transmitting antenna of UE2 n all N sub-channels of reception antenna to the base station consists of, wherein j diagonal element G _{M, n}(j) represent m transmitting antenna of UE2 to the frequency response of n the reception antenna l=f in base station (j) sub-channels, m=1 or 2, l=f (j) is the relation of the channel mapping in arbitrary emission path when transmitting, l is the subchannel numbering that is mapped to, j is j component of described arbitrary emission path inner code word vector, j=1 ..., N, N are the counting of DFT conversion of transmitting;

According to described transmission matrix, set up linear ZF matrix $E=\left[\begin{array}{cc}{I}_{2N}& -{\mathrm{\&Lambda;}}_{1,2}{\mathrm{\&Lambda;}}_{\mathrm{2,2}}^{-1}\\ -{\mathrm{\&Lambda;}}_{\mathrm{2,1}}{\mathrm{\&Lambda;}}_{\mathrm{1,1}}^{-1}& I_{2N}\end{array}\right];$ Calculate linear ZF matrix and corrected received signal long-pending, with result of product as the first equivalent received signals $\tilde{Y}=\mathrm{EY},$ Wherein $\tilde{Y}=\left[\begin{array}{c}{\tilde{Y}}_1\\ {\tilde{Y}}_2\end{array}\right];$ Utilize $\mathrm{\&Sigma;}={\mathrm{\&Lambda;}}_{\mathrm{1,1}}-{\mathrm{\&Lambda;}}_{\mathrm{1,2}}{\mathrm{\&Lambda;}}_{\mathrm{2,2}}^{-1}{\mathrm{\&Lambda;}}_{\mathrm{2,1}}$ With $\mathrm{\&Delta;}={\mathrm{\&Lambda;}}_{\mathrm{2,2}}-{\mathrm{\&Lambda;}}_{\mathrm{2,1}}{\mathrm{\&Lambda;}}_{\mathrm{1,1}}^{-1}{\mathrm{\&Lambda;}}_{\mathrm{1,2}},$ According to ${\widetilde{\stackrel{~}{Y}}}_1={\mathrm{\&Sigma;}}^H{\tilde{Y}}_1$ With ${\widetilde{\stackrel{~}{Y}}}_2={\mathrm{\&Delta;}}^H{\tilde{Y}}_2$ Right

With

Process, obtain the second equivalent received signals

With

The structure diagonal matrix ${\mathrm{\&Sigma;}}^H\mathrm{\&Sigma;}=\left(\begin{array}{cc}\mathrm{<figure-callout\; id="0"\; label="A"\; filenames="H2009100775112E00031.png"\; state="\{\{state\}\}">A</figure-callout>}& 0\\ 0& A\end{array}\right)$ With ${\mathrm{\&Delta;}}^H\mathrm{\&Delta;}=\left(\begin{array}{cc}\mathrm{<figure-callout\; id="0"\; label="B"\; filenames="H2009100775112E00031.png"\; state="\{\{state\}\}">B</figure-callout>}& 0\\ 0& B\end{array}\right),$ Obtain diagonal matrix A and B; According to $\left\{\begin{array}{c}{\tilde{X}}_{k,j}=\frac{1}{\mathrm{\&alpha;}\left(j\right)+{{\mathrm{\&sigma;}}_{\mathrm{1,1},\mathrm{<figure-callout\; id="2"\; label="j"\; filenames="H2009100775112E00031.png"\; state="\{\{state\}\}">j</figure-callout>}}}^2}\&CenterDot;{\widetilde{\stackrel{~}{Y}}}_{\mathrm{1,1},j}\\ {\tilde{X}}_{k+1,j}=\frac{1}{\mathrm{\&alpha;}\left(j\right)+{{\mathrm{\&sigma;}}_{\mathrm{1,2},\mathrm{<figure-callout\; id="2"\; label="j"\; filenames="H2009100775112E00031.png"\; state="\{\{state\}\}">j</figure-callout>}}}^2}\&CenterDot;{\widetilde{\stackrel{~}{Y}}}_{\mathrm{1,2},j}\end{array}\right.,$ J=1 ..., N, the transmitting terminal signal phasor { X of calculating UE1 _k, X _K+1Estimated value

And export to coupled IDFT processor, wherein, α (j) is j the diagonal element of A,

And

Be respectively And

J component,

And Be respectively

Top n component and the vector that consists of of a rear N component; According to $\left\{\begin{array}{c}{\tilde{C}}_{k,j}=\frac{1}{\mathrm{\&beta;}\left(j\right)+{{\mathrm{\&sigma;}}_{2,1,\mathrm{<figure-callout\; id="2"\; label="j"\; filenames="H2009100775112E00031.png"\; state="\{\{state\}\}">j</figure-callout>}}}^2}\&CenterDot;{\widetilde{\stackrel{~}{Y}}}_{\mathrm{2,1},j}\\ {\tilde{C}}_{k+1,j}=\frac{1}{\mathrm{\&beta;}\left(j\right)+{{\mathrm{\&sigma;}}_{\mathrm{2,2},\mathrm{<figure-callout\; id="2"\; label="j"\; filenames="H2009100775112E00031.png"\; state="\{\{state\}\}">j</figure-callout>}}}^2}\&CenterDot;{\widetilde{\stackrel{~}{Y}}}_{\mathrm{2,2},j}\end{array}\right.,$ J=1 ..., N calculates the transmitting terminal signal phasor { C of UE2 _k, C _K+1Estimated value

And export to coupled IDFT processor, wherein, β (j) is j the diagonal element of B,

And

Be respectively

And

J component,

And

Be respectively

Top n component and the vector that consists of of a rear N component;

Described IDFT processor is used for the signal that receives is carried out contrary discrete Fourier transform (DFT) IDFT, and transformation results is exported to coupled demodulator;

Described demodulator is used for carrying out to received signal the estimated value that demodulation obtains launching symbol.

As seen from the above technical solution, among the present invention, at transmitting terminal, UE1 and UE2 configure respectively many antennas, and use identical running time-frequency resource to send different separately information according to identical sending method, concrete sending method is: k and the signal phasor { X in the k+1 moment that will obtain through the DFT preliminary treatment _k, X _K+1Send into simultaneously the space-time block coding device and carry out space-time two-dimensional coding, particularly, obtain two code word vector { X at moment k _k, X _K+1, obtain in addition two code word vector { X at moment k+1 _K+1 ^*, X _k ^*, the code word vector X that moment k is obtained _kCode word vector-the X that obtains with moment k+1 _K+1 ^*Send into the first emission path, and process through subchannel mapping, IFFT computing, insertion Cyclic Prefix and emission; The code word vector X that moment k is obtained _K+1The code word vector X that obtains with moment k+1 _k ^*Send into the second emission path, and process through subchannel mapping, IFFT computing, insertion Cyclic Prefix and emission.Each user adopts above-mentioned send mode, aspect by space-time block coding so that signal transmit at two emission paths, thereby obtain spatial emission diversity gain, improve the reliability of transmission; On the other hand, space-time block coding carries out space-time block coding with vector form, avoids the change of coding codeword vector frequency domain characteristic, thereby the DFT-S-OFDM system that guarantees space-time block coding has the low peak average ratio characteristic.

At receiving terminal, receiver constantly receives signal and carries out channel estimating at k and the k+1 of each transmission channel, and according to the form of transmitting terminal space-time block coding, utilize the channel estimating that receives signal and each sub-channels to construct total corrected received signal and the transmission matrix of each reception antenna, the transmission matrix that recycles this total corrected received signal and each reception antenna calculates equivalent received signals, and the estimated value of signal after the calculating preliminary treatment, this estimated value is carried out obtaining launching after IDFT processes the estimated value of symbolic vector, subsequently by detecting by the symbol detection settling signal.

Description of drawings

Fig. 1 is two users' virtual MIMO system schematic diagram based on single transmit antenna DFT-S-OFDM;

Fig. 2 is the transmitter block diagram based on the virtual MIMO of single transmit antenna DFT-S-OFDM;

Fig. 3 is the virtual MIMO receiver block diagram based on two reception antenna DFT-S-OFDM;

Fig. 4 is two users' virtual MIMO system schematic diagram based on BST-DFT-S-OFDM of the embodiment of the invention one;

The transmitting terminal concrete structure figure based on two users' virtual MIMO system of BST-DFT-S-OFDM that Fig. 5 provides for embodiment one;

The concrete structure schematic diagram of the BST-DFT-S-OFDM virtual MIMO system receiver that Fig. 6 provides for the embodiment of the invention one;

Fig. 7 be the QPSK modulation system place an order user DFT-S-OFDM system with based on the bit error Performance Ratio of two users' virtual MIMO system under low speed TU channel circumstance of the DFT-S-OFDM of single transmit antenna than schematic diagram;

Fig. 8 is the bit error performance schematic diagram of two users' virtual MIMO system under low speed TU channel circumstance that the present invention is based on BST-DFT-S-OFDM under the QPSK modulation system.

Embodiment

For making the purpose, technical solutions and advantages of the present invention clearer, the present invention is described in further detail below in conjunction with the accompanying drawings and the specific embodiments.

Basic thought of the present invention: be that every user terminal configures two transmit antennas at transmitting terminal, eNodeB receiver configuration N _r(N _r＞1) root reception antenna, under the scheduling of eNodeB receiver, two user terminals use identical running time-frequency resource to transmit different information.Thereby consist of a 4 * N _rVirtual MIMO system, provide spatial emission diversity gain to take full advantage of multiaerial system, improve the reliability of link transmission.

Need to prove, on the DFT-S-OFDM system-based, can directly adopt space-time block code (STBC) or space frequency block coding (SFBC) to construct 2 antenna transmit diversity DFT-S-OFDM transmission plans.These two kinds of transmission plans can obtain full emission diversity gain, but because grouping or space frequency block coding computing change the frequency domain characteristic of signal after the DFT preliminary treatment when empty so that based on the DFT-S-OFDM system destruction of STBC or SFBC coding the low peak average ratio characteristic of DFT-S-OFDM system.Therefore should not be as LTE system up-link transmission plan based on the DFT-S-OFDM transmission plan of STBC or SFBC coding.

In the embodiment that the present invention provides, transmitting terminal to the DFT preliminary treatment after signal adopt a kind of new space-time two-dimensional encoding scheme.This scheme is different from traditional encoding scheme based on STBC or SFBC, encode but with vector form the pretreated signal phasor of DFT is carried out two dimension in space/time, below above-mentioned block encoding mode is called space-time block coding (BST), system provided by the invention is called the BST-DFT-S-OFDM virtual MIMO system.Be described in detail below by a pair of this BST-DFT-S-OFDM virtual MIMO system of the embodiment of the invention.

Fig. 4 is two users' virtual MIMO system schematic diagram based on BST-DFT-S-OFDM of the embodiment of the invention one.As shown in Figure 4, in this virtual MIMO system, two transmitting antennas of every UE configuration, two reception antennas of eNodeB receiver configuration, under the scheduling of eNodeB receiver, two UE use identical running time-frequency resource to transmit different information, thereby consist of one 4 * 2 virtual MIMO system.

The transmitting terminal concrete structure figure based on two users' virtual MIMO system of BST-DFT-S-OFDM that Fig. 5 provides for embodiment one, the transmitting terminal of this system is made of the transmitter of two UE, the transmitter architecture of each UE is identical, be convenient narration, below take the transmitter of UE1 the transmitter principle of BST-DFT-S-OFDM virtual MIMO system be described as example.

As shown in Figure 5, the transmitter of this UE1 comprises: modulator, DFT preprocessor, space-time block coding device, the first mapper, the second mapper, an IFFT processor, the 2nd IFFT processor, the first Cyclic Prefix inserter, the second Cyclic Prefix inserter, the first intermediate frequency and rf processor, the second intermediate frequency and rf processor, the first transmitting antenna and the second transmitting antenna.The sending method of BST-DFT-S-OFDM virtual MIMO system of the present invention can be implemented in the transmitter of two UE shown in Figure 5.Below main as an example of UE1 example the concrete idiographic flow that utilizes this transmitter to send of introducing.

At first, the bit information of UE1 information source output is sent into channel encoder and is carried out chnnel coding, chnnel coding output is sent into modulator and is carried out symbol-modulated, the complex symbol of modulator output is divided into groups take length N as unit, block length N is identical with subchannel (subcarrier) number that eNodeB distributes to UE1, and k packet of modulation symbols of UE1 is designated as x _k≡ [x _{K, 1}, x _{K, 2}..., x _{K, i}..., x _{K, N}] ^T, wherein, x _{K, i}Represent i modulation symbol in k packet of modulation symbols of UE1, x _kThe output signal vector is designated as X after N point DFT preliminary treatment _k≡ [X _{K, 1}, X _{K, 2}..., X _{K, j}..., X _{K, N}] ^T, X _kWith x _kBe the discrete Fourier transform relation:

$X_{k,j}=\underset{i=1}{\overset{N}{\mathrm{\&Sigma;}}}{x}_{k,i}\&CenterDot;e^{-\mathrm{<figure-callout\; id="2"\; label="j"\; filenames="H2009100775112E00031.png"\; state="\{\{state\}\}">j</figure-callout>}2\mathrm{\&pi;}\frac{(i-1)\&CenterDot;(j-1)}{N}},j=1,...,N---\left(1\right)$

K and k+1 be the pretreated signal phasor { X of DFT constantly _k, X _K+1Enter simultaneously the coding that the space-time block coding device carries out space-time two-dimensional and process.

Be different from the space-time block code that traditional DFT-S-OFDM adopts, carry out take the transmitted signal vector as unit when the present invention adopts space-time block coding.Particularly, with two signal phasor X _kAnd X _K+1Encode as one group, constantly obtain two code word vector X at k _kAnd X _K+1, constantly obtain in addition two code word vector-X at k+1 _K+1 ^*And X _k ^*At k constantly, with code word vector { X _k, X _K+1In the first code word vector X _kSend into the 1st emission path transmission, with the second code word vector X _K+1Send into the 2nd emission path transmission; At k+1 constantly, with code word vector { X _K+1 ^*, X _k ^*In first code word vector-X _K+1 ^*Send into the 1st emission path transmission, with the second code word vector X _k ^*Send into the 2nd emission path transmission, above process is referring to shown in Figure 5.

In frequency domain, to the conjugate operation of signal can equivalence be corresponding time-domain signal at the cycle shift operation of time domain, therefore frequency-region signal is carried out the time domain peak-to-average force ratio characteristic that conjugate operation does not change signal; In addition, in frequency domain, frequency-region signal is got the peak-to-average force ratio characteristic that the negative sign computing also can not change time-domain signal, as seen, according to space-time block coding among the present invention, output codons vector { X _k, X _K+1,-X _K+1 ^*, X _k ^*And coded input signal vector { X _k, X _K+1Has identical peak-to-average force ratio characteristic in time domain.

Process in such a way after code word vector behind the space-time block coding sent into the emission path:

Code word vector behind the space-time block codes is mapped to N continuously subchannel (or discontinuous subchannel) transmission of system assignment by the channel mapping device, the mapper input is expressed as with output relation:

l＝f(j)，j＝1，...，N (2)

Wherein, f () represents mapping function, and (2) show signal { X _k, X _K+1,-X _K+1 ^*, X _k ^*J component be mapped to the l|l=f (j), j=1 ..., the transmission of N} sub-channels.The 1st emission path k and k+1 are shone upon rear signal X constantly _kAnd-X _K+1 ^*, the 2nd emission path k and k+1 shine upon rear signal X constantly _K+1And X _k ^*Send into successively IFFT processor, Cyclic Prefix inserter and intermediate frequency and rf processor, send into respectively at last two antenna transmissions.

Step of transmitting and the UE1 of UE2 are identical, just are convenient subsequently narration, and k and k+1 packet of modulation symbols of UE2 emission are designated as { c _k, c _K+1, wherein, c _k≡ [c _{K, 1}, c _{K, 2}..., c _{K, i}..., c _{K, N}] ^T{ c _k, c _K+1Signal phasor is designated as { C after N point DFT preliminary treatment _k, C _K+1, C wherein _k≡ [C _{K, 1}, C _{K, 2}..., C _{K, j}..., C _{K, N}] ^T, the code word vector representation is { C behind the space-time block coding _k, C _K+1And { C _K+1 ^*, C _k ^*.

In addition, subchannel and UE1 that UE2 emission information is used are identical, namely two user terminal use subchannels be l|l=f (j), j=1 ..., N}.

The above-mentioned concrete formation of BST-DFT-S-OFDM virtual MIMO system transmitter in the embodiment of the invention one and the concrete signalling formula of being.

Next, reception testing process and the receiver that carries out for above-mentioned transmitted signal provided by the invention is described in detail.

The concrete structure schematic diagram of the BST-DFT-S-OFDM virtual MIMO system receiver that Fig. 6 provides for the embodiment of the invention one.As shown in Figure 6, this receiver comprises: 2 receivers, 2 cyclic prefix remover, 2 fft processors, 2 de-mapping devices, space-time joint equalizer, 2 IDFT processors and 2 demodulators.The BST-DFT-S-OFDM virtual MIMO system method of reseptance of the embodiment of the invention one can be implemented in receiver shown in Figure 6.Below just concrete the introduction utilize this receiver to carry out signal to receive the idiographic flow that detects.

As seen from Figure 6, have 2 reception paths during receiver hollow before the joint equalization device, each receives the corresponding reception antenna of path.When carrying out the signal reception ﹠ disposal, each processing mode that receives path is identical, is introduced as an example of one of them reception path example here.

Particularly, receiver receives radiofrequency signal from antenna constantly at k and k+1, and after radio frequency, intermediate frequency process, sample and obtain digital baseband signal, the recycling cyclic prefix remover removes Cyclic Prefix to digital baseband signal, then carry out the FFT conversion process that L is ordered by fft processor, extracted at last the reception signal of N sub-channels by de-mapping device, wherein, separate mapping mode corresponding with the mapping mode of transmitting terminal.If constantly de-mapping device output signal vector representation of n reception path k and k+1 is [Y _k ⁽ⁿ⁾, Y _K+1 ⁽ⁿ⁾] ^T, wherein, $Y_k^{\left(n\right)}\&equiv;{[T_{k,1}^{\left(n\right)},Y_{k,2}^{\left(n\right)},...Y_{k,j}^{\left(n\right)},...,Y_{k,N}^{\left(n\right)}]}^T$ Represent constantly n all N sub-channels reception signal phasors of reception path of k, Y _{K, j} ⁽ⁿ⁾Represent the signal that k moment n reception path l=f (j) sub-channels receives.

As above namely obtain the signal transmission that each receives path, these signal transmissions are sent in the space-time joint equalizer.In the space-time joint equalizer each subchannel transmission signal of two reception paths is merged and equilibrium treatment, space-time joint equalizer output signal vector is designated as

With

UE1 k and the k+1 vector { X that constantly transmits _k, X _K+1Estimated value;

UE2 k and the k+1 vector { C that constantly transmits _k, C _K+1Estimated value.As seen, realize two separation that user terminal transmits by joint space-time equilibrium treatment eNodeB receiver.First user terminal UE1 signal after the separation

Sending into respectively the IDFT processor that N orders obtains

Second user terminal UE2 signal after the separation

Sending into respectively the IDFT processor that N orders obtains

At last, in demodulator, respectively first user UE1 is received signal phasor

Each component carry out Maximum Likelihood Detection and can obtain UE1 emission symbol { x _k, x _K+1Estimated value The second user UE2 is received signal phasor Each component carry out the emission symbol { c that Maximum Likelihood Detection can obtain the second user _k, c _K+1Estimated value

Wherein, ${\hat{x}}_k\&equiv;{[{\hat{x}}_{k,1},{\hat{x}}_{k,2},...,{\hat{x}}_{k,i},...,{\hat{x}}_{k,N}]}^T$ With ${\hat{c}}_k\&equiv;{[{\hat{c}}_{k,1},{\hat{c}}_{k,2},...,{\hat{c}}_{k,i},...,{\hat{c}}_{k,N}]}^T.$

If transmitter uses channel encoder before modulator, then receive signal phasor at receiving terminal according to first user Can obtain to launch the soft decision information of symbol, soft decision information can obtain the estimated value that first user is launched bit sequence after further sending into channel decoder, correspondingly, adopts same procedure, can obtain the estimated value that the second user launches bit sequence.

Below the operation principle of derivation space-time joint equalizer.

Adopted two reception antennas among the embodiment one, this moment, the n value was 2, then signal phasor { Y _k ⁽¹⁾, Y _K+1 ⁽¹⁾, Y _k ⁽²⁾, Y _K+1 ⁽²⁾Can be expressed as:

$\left[\begin{array}{c}{Y}_k^{\left(1\right)}\\ Y_{k+1}^{{\left(1\right)}^{*}}\\ Y_k^{\left(2\right)}\\ Y_{k+1}^{{\left(2\right)}^{*}}\end{array}\right]=\left[\begin{array}{cccc}{\mathrm{<figure-callout\; id="1"\; label="H"\; filenames="H2009100775112E00022.png"\; state="\{\{state\}\}">H</figure-callout>}}_{\mathrm{1,1}}& {\mathrm{<figure-callout\; id="2"\; label="H"\; filenames="H2009100775112E00031.png"\; state="\{\{state\}\}">H</figure-callout>}}_{\mathrm{2,1}}& {\mathrm{<figure-callout\; id="1"\; label="G"\; filenames="H2009100775112E00022.png"\; state="\{\{state\}\}">G</figure-callout>}}_{\mathrm{1,1}}& {\mathrm{<figure-callout\; id="2"\; label="G"\; filenames="H2009100775112E00031.png"\; state="\{\{state\}\}">G</figure-callout>}}_{\mathrm{2,1}}\\ {\mathrm{<figure-callout\; id="2"\; label="H"\; filenames="H2009100775112E00031.png"\; state="\{\{state\}\}">\; <figure-callout\; id="1"\; label="H"\; filenames="H2009100775112E00022.png"\; state="\{\{state\}\}">H</figure-callout>\; </figure-callout>}}_{\mathrm{2,1}}^{*}& {-\mathrm{<figure-callout\; id="1"\; label="H"\; filenames="H2009100775112E00022.png"\; state="\{\{state\}\}">\; <figure-callout\; id="1"\; label="H"\; filenames="H2009100775112E00022.png"\; state="\{\{state\}\}">H</figure-callout>\; </figure-callout>}}_{\mathrm{1,1}}^{*}& {\mathrm{<figure-callout\; id="2"\; label="G"\; filenames="H2009100775112E00031.png"\; state="\{\{state\}\}">\; <figure-callout\; id="1"\; label="G"\; filenames="H2009100775112E00022.png"\; state="\{\{state\}\}">G</figure-callout>\; </figure-callout>}}_{\mathrm{2,1}}^{*}& {-\mathrm{<figure-callout\; id="1"\; label="G"\; filenames="H2009100775112E00022.png"\; state="\{\{state\}\}">\; <figure-callout\; id="1"\; label="G"\; filenames="H2009100775112E00022.png"\; state="\{\{state\}\}">G</figure-callout>\; </figure-callout>}}_{\mathrm{1,1}}^{*}\\ {\mathrm{<figure-callout\; id="1"\; label="H"\; filenames="H2009100775112E00022.png"\; state="\{\{state\}\}">H</figure-callout>}}_{\mathrm{1,2}}& {\mathrm{<figure-callout\; id="2"\; label="H"\; filenames="H2009100775112E00031.png"\; state="\{\{state\}\}">H</figure-callout>}}_{\mathrm{2,2}}& {\mathrm{<figure-callout\; id="1"\; label="G"\; filenames="H2009100775112E00022.png"\; state="\{\{state\}\}">G</figure-callout>}}_{\mathrm{1,2}}& {\mathrm{<figure-callout\; id="2"\; label="G"\; filenames="H2009100775112E00031.png"\; state="\{\{state\}\}">G</figure-callout>}}_{\mathrm{2,2}}\\ {\mathrm{<figure-callout\; id="2"\; label="H"\; filenames="H2009100775112E00031.png"\; state="\{\{state\}\}">\; <figure-callout\; id="2"\; label="H"\; filenames="H2009100775112E00031.png"\; state="\{\{state\}\}">H</figure-callout>\; </figure-callout>}}_{\mathrm{2,2}}^{*}& {-\mathrm{<figure-callout\; id="1"\; label="H"\; filenames="H2009100775112E00022.png"\; state="\{\{state\}\}">\; <figure-callout\; id="2"\; label="H"\; filenames="H2009100775112E00031.png"\; state="\{\{state\}\}">H</figure-callout>\; </figure-callout>}}_{\mathrm{1,2}}^{*}& {\mathrm{<figure-callout\; id="2"\; label="G"\; filenames="H2009100775112E00031.png"\; state="\{\{state\}\}">\; <figure-callout\; id="2"\; label="G"\; filenames="H2009100775112E00031.png"\; state="\{\{state\}\}">G</figure-callout>\; </figure-callout>}}_{\mathrm{2,2}}^{*}& {-\mathrm{<figure-callout\; id="1"\; label="G"\; filenames="H2009100775112E00022.png"\; state="\{\{state\}\}">\; <figure-callout\; id="2"\; label="G"\; filenames="H2009100775112E00031.png"\; state="\{\{state\}\}">G</figure-callout>\; </figure-callout>}}_{\mathrm{1,2}}^{*}\end{array}\right]\left[\begin{array}{c}{X}_k\\ X_{k+1}\\ C_k\\ C_{k+1}\end{array}\right]+\left[\begin{array}{c}{N}_k^{\left(1\right)}\\ N_{k+1}^{{\left(1\right)}^{*}}\\ N_k^{\left(2\right)}\\ N_{k+1}^{{\left(2\right)}^{*}}\end{array}\right]---\left(3\right)$

Wherein, H _{M, n}=diag (H _{M, n}(1), H _{M, n}(2) ..., H _{M, n}(j) ... H _{M, n}(N)) represent the diagonal matrix that the frequency response of m transmitting antenna of UE1 n all N sub-channels of reception antenna to the base station consists of, j diagonal element H _{M, n}(j) represent m transmitting antenna of UE1 to the frequency response of n the reception antenna l=f in base station (j) sub-channels;

G _{M, n}=diag (G _{M, n}(1), G _{M, n}(2) ..., G _{M, n}(j) ... G _{M, n}(N)) represent the diagonal matrix that the frequency response of m transmitting antenna of UE2 n all N sub-channels of reception antenna to the base station consists of, j diagonal element G _{M, n}(j) represent m transmitting antenna of UE2 to the frequency response of n the reception antenna l=f in base station (j) sub-channels; Wherein, the UE1 signal transmission is { X _k, X _K+1, the UE2 signal transmission is { C _k, C _K+1.

By the observation transmission matrix in (3) formula as can be known $\left[\begin{array}{cccc}{\mathrm{<figure-callout\; id="1"\; label="H"\; filenames="H2009100775112E00022.png"\; state="\{\{state\}\}">H</figure-callout>}}_{\mathrm{1,1}}& {\mathrm{<figure-callout\; id="2"\; label="H"\; filenames="H2009100775112E00031.png"\; state="\{\{state\}\}">H</figure-callout>}}_{\mathrm{2,1}}& {\mathrm{<figure-callout\; id="1"\; label="G"\; filenames="H2009100775112E00022.png"\; state="\{\{state\}\}">G</figure-callout>}}_{\mathrm{1,1}}& {\mathrm{<figure-callout\; id="2"\; label="G"\; filenames="H2009100775112E00031.png"\; state="\{\{state\}\}">G</figure-callout>}}_{\mathrm{2,1}}\\ {\mathrm{<figure-callout\; id="2"\; label="H"\; filenames="H2009100775112E00031.png"\; state="\{\{state\}\}">\; <figure-callout\; id="1"\; label="H"\; filenames="H2009100775112E00022.png"\; state="\{\{state\}\}">H</figure-callout>\; </figure-callout>}}_{\mathrm{2,1}}^{*}& {-\mathrm{<figure-callout\; id="1"\; label="H"\; filenames="H2009100775112E00022.png"\; state="\{\{state\}\}">\; <figure-callout\; id="1"\; label="H"\; filenames="H2009100775112E00022.png"\; state="\{\{state\}\}">H</figure-callout>\; </figure-callout>}}_{\mathrm{1,1}}^{*}& {\mathrm{<figure-callout\; id="2"\; label="G"\; filenames="H2009100775112E00031.png"\; state="\{\{state\}\}">\; <figure-callout\; id="1"\; label="G"\; filenames="H2009100775112E00022.png"\; state="\{\{state\}\}">G</figure-callout>\; </figure-callout>}}_{\mathrm{2,1}}^{*}& {-\mathrm{<figure-callout\; id="1"\; label="G"\; filenames="H2009100775112E00022.png"\; state="\{\{state\}\}">\; <figure-callout\; id="1"\; label="G"\; filenames="H2009100775112E00022.png"\; state="\{\{state\}\}">G</figure-callout>\; </figure-callout>}}_{\mathrm{1,1}}^{*}\\ {\mathrm{<figure-callout\; id="1"\; label="H"\; filenames="H2009100775112E00022.png"\; state="\{\{state\}\}">H</figure-callout>}}_{\mathrm{1,2}}& {\mathrm{<figure-callout\; id="2"\; label="H"\; filenames="H2009100775112E00031.png"\; state="\{\{state\}\}">H</figure-callout>}}_{\mathrm{2,2}}& {\mathrm{<figure-callout\; id="1"\; label="G"\; filenames="H2009100775112E00022.png"\; state="\{\{state\}\}">G</figure-callout>}}_{\mathrm{1,2}}& {\mathrm{<figure-callout\; id="2"\; label="G"\; filenames="H2009100775112E00031.png"\; state="\{\{state\}\}">G</figure-callout>}}_{\mathrm{2,2}}\\ {\mathrm{<figure-callout\; id="2"\; label="H"\; filenames="H2009100775112E00031.png"\; state="\{\{state\}\}">\; <figure-callout\; id="2"\; label="H"\; filenames="H2009100775112E00031.png"\; state="\{\{state\}\}">H</figure-callout>\; </figure-callout>}}_{\mathrm{2,2}}^{*}& {-\mathrm{<figure-callout\; id="1"\; label="H"\; filenames="H2009100775112E00022.png"\; state="\{\{state\}\}">\; <figure-callout\; id="2"\; label="H"\; filenames="H2009100775112E00031.png"\; state="\{\{state\}\}">H</figure-callout>\; </figure-callout>}}_{\mathrm{1,2}}^{*}& {\mathrm{<figure-callout\; id="2"\; label="G"\; filenames="H2009100775112E00031.png"\; state="\{\{state\}\}">\; <figure-callout\; id="2"\; label="G"\; filenames="H2009100775112E00031.png"\; state="\{\{state\}\}">G</figure-callout>\; </figure-callout>}}_{\mathrm{2,2}}^{*}& {-\mathrm{<figure-callout\; id="1"\; label="G"\; filenames="H2009100775112E00022.png"\; state="\{\{state\}\}">\; <figure-callout\; id="2"\; label="G"\; filenames="H2009100775112E00031.png"\; state="\{\{state\}\}">G</figure-callout>\; </figure-callout>}}_{\mathrm{1,2}}^{*}\end{array}\right]$ Has class Alamouti characteristic.(3) formula can further be expressed as the matrix in block form form:

$\left[\begin{array}{c}{Y}^{\left(1\right)}\\ Y^{\left(2\right)}\end{array}\right]=\left[\begin{array}{cc}{\mathrm{\&Lambda;}}_{\mathrm{1,1}}& {\mathrm{\&Lambda;}}_{\mathrm{1,2}}\\ {\mathrm{\&Lambda;}}_{\mathrm{2,1}}& {\mathrm{\&Lambda;}}_{\mathrm{2,2}}\end{array}\right]\left[\begin{array}{c}X\\ C\end{array}\right]+\left[\begin{array}{c}{N}^{\left(1\right)}\\ N^{\left(2\right)}\end{array}\right]---\left(4\right)$

Wherein, $Y^{\left(1\right)}={\left[\begin{array}{cc}{Y}_k^{\left(1\right)T}& Y_{k+1}^{\left(1\right)*T}\end{array}\right]}^T,$ $Y^{\left(2\right)}={\left[\begin{array}{cc}{Y}_k^{\left(2\right)T}& Y_{k+1}^{\left(2\right)*T}\end{array}\right]}^T,$ ${\mathrm{\&Lambda;}}_{\mathrm{1,1}}=\left[\begin{array}{cc}{\mathrm{<figure-callout\; id="1"\; label="H"\; filenames="H2009100775112E00022.png"\; state="\{\{state\}\}">H</figure-callout>}}_{\mathrm{1,1}}& {\mathrm{<figure-callout\; id="2"\; label="H"\; filenames="H2009100775112E00031.png"\; state="\{\{state\}\}">H</figure-callout>}}_{\mathrm{2,1}}\\ {\mathrm{<figure-callout\; id="2"\; label="H"\; filenames="H2009100775112E00031.png"\; state="\{\{state\}\}">\; <figure-callout\; id="1"\; label="H"\; filenames="H2009100775112E00022.png"\; state="\{\{state\}\}">H</figure-callout>\; </figure-callout>}}_{\mathrm{2,1}}^{*}& -{\mathrm{<figure-callout\; id="1"\; label="H"\; filenames="H2009100775112E00022.png"\; state="\{\{state\}\}">\; <figure-callout\; id="1"\; label="H"\; filenames="H2009100775112E00022.png"\; state="\{\{state\}\}">H</figure-callout>\; </figure-callout>}}_{\mathrm{1,1}}^{*}\end{array}\right],$ ${\mathrm{\&Lambda;}}_{\mathrm{1,2}}=\left[\begin{array}{cc}{\mathrm{<figure-callout\; id="1"\; label="G"\; filenames="H2009100775112E00022.png"\; state="\{\{state\}\}">G</figure-callout>}}_{\mathrm{1,1}}& {\mathrm{<figure-callout\; id="2"\; label="G"\; filenames="H2009100775112E00031.png"\; state="\{\{state\}\}">G</figure-callout>}}_{\mathrm{2,1}}\\ {\mathrm{<figure-callout\; id="2"\; label="G"\; filenames="H2009100775112E00031.png"\; state="\{\{state\}\}">\; <figure-callout\; id="1"\; label="G"\; filenames="H2009100775112E00022.png"\; state="\{\{state\}\}">G</figure-callout>\; </figure-callout>}}_{\mathrm{2,1}}^{*}& -{\mathrm{<figure-callout\; id="1"\; label="G"\; filenames="H2009100775112E00022.png"\; state="\{\{state\}\}">\; <figure-callout\; id="1"\; label="G"\; filenames="H2009100775112E00022.png"\; state="\{\{state\}\}">G</figure-callout>\; </figure-callout>}}_{\mathrm{1,1}}^{*}\end{array}\right],$ ${\mathrm{\&Lambda;}}_{2,1}=\left[\begin{array}{cc}{\mathrm{<figure-callout\; id="1"\; label="H"\; filenames="H2009100775112E00022.png"\; state="\{\{state\}\}">H</figure-callout>}}_{1,2}& {\mathrm{<figure-callout\; id="2"\; label="H"\; filenames="H2009100775112E00031.png"\; state="\{\{state\}\}">H</figure-callout>}}_{\mathrm{2,2}}\\ {\mathrm{<figure-callout\; id="2"\; label="H"\; filenames="H2009100775112E00031.png"\; state="\{\{state\}\}">\; <figure-callout\; id="2"\; label="H"\; filenames="H2009100775112E00031.png"\; state="\{\{state\}\}">H</figure-callout>\; </figure-callout>}}_{2,2}^{*}& -{\mathrm{<figure-callout\; id="1"\; label="H"\; filenames="H2009100775112E00022.png"\; state="\{\{state\}\}">\; <figure-callout\; id="2"\; label="H"\; filenames="H2009100775112E00031.png"\; state="\{\{state\}\}">H</figure-callout>\; </figure-callout>}}_{1,2}^{*}\end{array}\right],$ ${\mathrm{\&Lambda;}}_{2,2}=\left[\begin{array}{cc}{\mathrm{<figure-callout\; id="1"\; label="G"\; filenames="H2009100775112E00022.png"\; state="\{\{state\}\}">G</figure-callout>}}_{1,2}& {\mathrm{<figure-callout\; id="2"\; label="G"\; filenames="H2009100775112E00031.png"\; state="\{\{state\}\}">G</figure-callout>}}_{\mathrm{2,2}}\\ {\mathrm{<figure-callout\; id="2"\; label="G"\; filenames="H2009100775112E00031.png"\; state="\{\{state\}\}">\; <figure-callout\; id="2"\; label="G"\; filenames="H2009100775112E00031.png"\; state="\{\{state\}\}">G</figure-callout>\; </figure-callout>}}_{2,2}^{*}& -{\mathrm{<figure-callout\; id="1"\; label="G"\; filenames="H2009100775112E00022.png"\; state="\{\{state\}\}">\; <figure-callout\; id="2"\; label="G"\; filenames="H2009100775112E00031.png"\; state="\{\{state\}\}">G</figure-callout>\; </figure-callout>}}_{1,2}^{*}\end{array}\right],$ X＝[X _k ^T X _k+1 ^T] ^T，C＝[C _k ^T C _k+1 ^T] ^T。(4) formula further is expressed as:

Y＝ΛZ+N (5)

Wherein, $Y=\left[\begin{array}{c}{Y}^{\left(1\right)}\\ Y^{\left(2\right)}\end{array}\right],$ $\mathrm{\&Lambda;}=\left[\begin{array}{cc}{\mathrm{\&Lambda;}}_{\mathrm{1,1}}& {\mathrm{\&Lambda;}}_{\mathrm{1,2}}\\ {\mathrm{\&Lambda;}}_{\mathrm{2,1}}& {\mathrm{\&Lambda;}}_{\mathrm{2,2}}\end{array}\right],$ $Z=\left[\begin{array}{c}X\\ C\end{array}\right],$ $N=\left[\begin{array}{c}{N}^{\left(1\right)}\\ N^{\left(2\right)}\end{array}\right].$ Further introduce the linear ZF matrix of two users:

$E=\left[\begin{array}{cc}{I}_{2N}& -{\mathrm{\&Lambda;}}_{1,2}{\mathrm{\&Lambda;}}_{\mathrm{2,2}}^{-1}\\ -{\mathrm{\&Lambda;}}_{\mathrm{2,1}}{\mathrm{\&Lambda;}}_{\mathrm{1,1}}^{-1}& I_{2N}\end{array}\right]---\left(6\right)$

And the following signal phasor of structure:

$\tilde{Y}=\mathrm{EY}$

$=\mathrm{E\&Lambda;Z}+\mathrm{EN}---\left(7\right)$

$=\mathrm{E\&Lambda;Z}+\tilde{N}$

(7) launch to be expressed as:

$\left[\begin{array}{c}{\tilde{Y}}_1\\ {\tilde{Y}}_2\end{array}\right]=\left[\begin{array}{cc}\mathrm{\&Sigma;}& 0\\ 0& \mathrm{\&Delta;}\end{array}\right]\left[\begin{array}{c}X\\ C\end{array}\right]+\begin{array}{}\end{array}\left[\begin{array}{c}{\tilde{N}}_1\\ {\tilde{N}}_2\end{array}\right]---\left(8\right)$

Wherein, $\mathrm{\&Sigma;}={\mathrm{\&Lambda;}}_{\mathrm{1,1}}-{\mathrm{\&Lambda;}}_{\mathrm{1,2}}{\mathrm{\&Lambda;}}_{\mathrm{2,2}}^{-1}{\mathrm{\&Lambda;}}_{\mathrm{2,1}},$ $\mathrm{\&Delta;}={\mathrm{\&Lambda;}}_{\mathrm{2,2}}-{\mathrm{\&Lambda;}}_{\mathrm{2,1}}{\mathrm{\&Lambda;}}_{\mathrm{1,1}}^{-1}{\mathrm{\&Lambda;}}_{\mathrm{1,2}},$ $\tilde{Y}={\left[\begin{array}{cc}{\tilde{Y}}_1^T& {{\tilde{Y}}_2}^T\end{array}\right]}^T.$

(8) formula further is expressed as:

${\tilde{Y}}_1=\mathrm{\&Sigma;X}+{\tilde{N}}_1$

(9)

${\tilde{Y}}_2=\mathrm{\&Delta;C}+{\tilde{N}}_2$

Further utilize matrix ∑ and Δ to have class A1amouti characteristic, (9) formula is processed in such a way:

${\widetilde{\stackrel{~}{Y}}}_1={\mathrm{\&Sigma;}}^H{\tilde{Y}}_1$

(10)

$={\mathrm{\&Sigma;}}^H\mathrm{\&Sigma;X}+{\mathrm{\&Sigma;}}^H{\tilde{N}}_1$

${\widetilde{\stackrel{~}{Y}}}_2={\mathrm{\&Delta;}}^H{\tilde{Y}}_2$

(11)

$={\mathrm{\&Delta;}}^H\mathrm{\&Delta;C}+{\mathrm{\&Delta;}}^H{\tilde{N}}_2$

Utilize matrix ∑ and Δ to be class Alamouti Matrix Properties, as can be known ${\mathrm{\&Sigma;}}^H\mathrm{\&Sigma;}=\left(\begin{array}{cc}A& 0\\ 0& A\end{array}\right)$ And ${\mathrm{\&Delta;}}^H\mathrm{\&Delta;}=\left(\begin{array}{cc}\mathrm{<figure-callout\; id="0"\; label="B"\; filenames="H2009100775112E00031.png"\; state="\{\{state\}\}">B</figure-callout>}& 0\\ 0& B\end{array}\right)$ Be diagonal matrix.Then (10) and (11) can be expressed as:

${\widetilde{\stackrel{~}{Y}}}_{\mathrm{1,1}}=A{X}_k+{\widetilde{\stackrel{~}{N}}}_{\mathrm{1,1}}$

(12)

${\widetilde{\stackrel{~}{Y}}}_{\mathrm{1,2}}=A{X}_{k+1}+{\widetilde{\stackrel{~}{N}}}_{\mathrm{1,2}}$

${\widetilde{\stackrel{~}{Y}}}_{\mathrm{2,1}}=B{C}_k+{\widetilde{\stackrel{~}{N}}}_{\mathrm{2,1}}$

(13)

${\widetilde{\stackrel{~}{Y}}}_{\mathrm{2,2}}=B{C}_{k+1}+{\widetilde{\stackrel{~}{N}}}_{\mathrm{2,2}}$

Wherein, ${\widetilde{\stackrel{~}{Y}}}_1={[{\widetilde{\stackrel{~}{Y}}}_{\mathrm{1,1}}^T,{\widetilde{\stackrel{~}{Y}}}_{\mathrm{1,2}}^T]}^T,$ ${\widetilde{\stackrel{~}{Y}}}_2={[{\widetilde{\stackrel{~}{Y}}}_{\mathrm{2,1}}^T,{\widetilde{\stackrel{~}{Y}}}_{\mathrm{2,2}}^T]}^T,$ ${\widetilde{\stackrel{~}{N}}}_1={[{\widetilde{\stackrel{~}{N}}}_{\mathrm{1,1}}^T,{\widetilde{\stackrel{~}{N}}}_{1,2}^T]}^T,$ ${\widetilde{\stackrel{~}{N}}}_2={[{\widetilde{\stackrel{~}{N}}}_{\mathrm{2,1}}^T,{\widetilde{\stackrel{~}{N}}}_{\mathrm{2,2}}^T]}^T.$ Utilize A and B matrix to be diagonal matrix, (12) formula and (13) formula are designated as the scalar form:

$\left\{\begin{array}{c}{\widetilde{\stackrel{~}{Y}}}_{\mathrm{1,1},j}=\mathrm{\&alpha;}\left(j\right)X_{k,j}+{\widetilde{\stackrel{~}{N}}}_{\mathrm{1,1},j}\\ {\widetilde{\stackrel{~}{Y}}}_{\mathrm{1,2},j}=\mathrm{\&alpha;}\left(j\right)X_{k+1,j}+{\widetilde{\stackrel{~}{N}}}_{\mathrm{1,2},j}\end{array}\right.,j=1,...,N---\left(14\right)$

$\left\{\begin{array}{c}{\widetilde{\stackrel{~}{Y}}}_{2,1,j}=\mathrm{\&beta;}\left(j\right)C_{k,j}+{\widetilde{\stackrel{~}{N}}}_{2,1,j}\\ {\widetilde{\stackrel{~}{Y}}}_{2,2,j}=\mathrm{\&beta;}\left(j\right)C_{k+1,j}+{\widetilde{\stackrel{~}{N}}}_{2,2,j}\end{array}\right.,j=1,...,N---\left(15\right)$

Wherein,

And

Be respectively

And

J component.α (j) is j the diagonal element of A,

And

Be respectively

And

J component;

And

Be respectively

And

J component.β (j) is j the diagonal element of B,

And Be respectively

And J component; (14) formula and (15) formula are carried out respectively obtaining X after the scalar equilibrium _{K, j}, X _{K+1, j}, C _{K, j}And C _{K+1, j}Estimator:

$\left\{\begin{array}{c}{\tilde{X}}_{k,j}=\frac{1}{\mathrm{\&alpha;}\left(j\right)+{{\mathrm{\&sigma;}}_{\mathrm{1,1},\mathrm{<figure-callout\; id="2"\; label="j"\; filenames="H2009100775112E00031.png"\; state="\{\{state\}\}">j</figure-callout>}}}^2}\&CenterDot;{\widetilde{\stackrel{~}{Y}}}_{\mathrm{1,1},j}\\ {\tilde{X}}_{k+1,j}=\frac{1}{\mathrm{\&alpha;}\left(j\right)+{{\mathrm{\&sigma;}}_{\mathrm{1,2},\mathrm{<figure-callout\; id="2"\; label="j"\; filenames="H2009100775112E00031.png"\; state="\{\{state\}\}">j</figure-callout>}}}^2}\&CenterDot;{\widetilde{\stackrel{~}{Y}}}_{\mathrm{1,2},j}\end{array}\right.,j=1,...,N---\left(16\right)$

$\left\{\begin{array}{c}{\tilde{C}}_{k,j}=\frac{1}{\mathrm{\&beta;}\left(j\right)+{{\mathrm{\&sigma;}}_{\mathrm{2,1},\mathrm{<figure-callout\; id="2"\; label="j"\; filenames="H2009100775112E00031.png"\; state="\{\{state\}\}">j</figure-callout>}}}^2}\&CenterDot;{\widetilde{\stackrel{~}{Y}}}_{\mathrm{2,1},j}\\ {\tilde{C}}_{k+1,j}=\frac{1}{\mathrm{\&beta;}\left(j\right)+{{\mathrm{\&sigma;}}_{\mathrm{2,2},\mathrm{<figure-callout\; id="2"\; label="j"\; filenames="H2009100775112E00031.png"\; state="\{\{state\}\}">j</figure-callout>}}}^2}\&CenterDot;{\widetilde{\stackrel{~}{Y}}}_{\mathrm{2,2},j}\end{array}\right.,j=1,...,N---\left(17\right)$

Wherein, σ _{S, t, j} ²For

Noise variance.The estimated value table that (16) and (17) are obtained is shown vector form and obtains

With

Wherein, ${\tilde{X}}_k\&equiv;{[{\tilde{X}}_{k,1},{\tilde{X}}_{k,2},...{\tilde{X}}_{k,j},...,{\tilde{X}}_{k,N}]}^T,$ ${\tilde{X}}_{k+1}\&equiv;{[{\tilde{X}}_{k+1,1},{\tilde{X}}_{k+1,2},...{\tilde{X}}_{k+1,j},...,{\tilde{X}}_{k+1,N}]}^T,$ ${\tilde{C}}_k\&equiv;{[{\tilde{C}}_{k,1},{\tilde{C}}_{k,2},...{\tilde{C}}_{k,j},...,{\tilde{C}}_{k,N}]}^T,$ ${\tilde{C}}_{k+1}\&equiv;{[{\tilde{C}}_{k+1,1},{\tilde{C}}_{k+1,2},...{\tilde{C}}_{k+1,j},...,{\tilde{C}}_{k+1,N}]}^T.$

By above-mentioned derivation as can be known, can utilize signal Y according to formula (7) _k ⁽¹⁾, Y _K+1 ⁽¹⁾With channel information H _1,1, H _1,2, H _2,1, H _2,2, G _1,1, G _1,2, G _2,1And G _2,2Merge processing, obtain for the first time corrected signal

With

Again according to formula (10), (11) to corrected signal

With

Process, obtain for the second time corrected signal

With

Again according to formula (16) and (17) to the corrected signal second time

With

Carry out equilibrium, thereby obtain With

Estimated value.

Obtain by the space-time joint equalization algorithm in the concrete receiver

With

The mode of estimated value can be summarized as:

Determine that k the 1st receives path N sub-channels reception signal Y constantly _k ⁽¹⁾Determine that k+1 the 1st receives path N sub-channels reception signal Y constantly _K+1 ⁽¹⁾And conjugated signal Determine that k the 2nd receives path N sub-channels reception signal Y constantly _k ⁽²⁾Determine that k+1 the 2nd receives path N sub-channels reception signal Y constantly _K+1 ⁽²⁾And conjugated signal

And will receive signal Y _k ⁽¹⁾, Y _k ⁽²⁾And conjugated signal

Arrange the form that forms corrected received signal Y by row, namely $\left[\begin{array}{c}{Y}_k^{\left(1\right)}\\ Y_{k+1}^{{\left(1\right)}^{*}}\\ Y_k^{\left(2\right)}\\ Y_{k+1}^{{\left(2\right)}^{*}}\end{array}\right];$

According to the frequency response of each sub-channels between every transmit antennas of first user terminal UE 1 and every reception antenna, all transmitting antennas of structure UE1 divide the transmission matrix that is clipped to two reception antennas ${\mathrm{\&Lambda;}}_{\mathrm{1,1}}=\left[\begin{array}{cc}{\mathrm{<figure-callout\; id="1"\; label="H"\; filenames="H2009100775112E00022.png"\; state="\{\{state\}\}">H</figure-callout>}}_{\mathrm{1,1}}& {\mathrm{<figure-callout\; id="2"\; label="H"\; filenames="H2009100775112E00031.png"\; state="\{\{state\}\}">H</figure-callout>}}_{\mathrm{2,1}}\\ {\mathrm{<figure-callout\; id="2"\; label="H"\; filenames="H2009100775112E00031.png"\; state="\{\{state\}\}">\; <figure-callout\; id="1"\; label="H"\; filenames="H2009100775112E00022.png"\; state="\{\{state\}\}">H</figure-callout>\; </figure-callout>}}_{\mathrm{2,1}}^{*}& -{\mathrm{<figure-callout\; id="1"\; label="H"\; filenames="H2009100775112E00022.png"\; state="\{\{state\}\}">\; <figure-callout\; id="1"\; label="H"\; filenames="H2009100775112E00022.png"\; state="\{\{state\}\}">H</figure-callout>\; </figure-callout>}}_{\mathrm{1,1}}^{*}\end{array}\right],$ ${\mathrm{\&Lambda;}}_{2,1}=\left[\begin{array}{cc}{\mathrm{<figure-callout\; id="1"\; label="H"\; filenames="H2009100775112E00022.png"\; state="\{\{state\}\}">H</figure-callout>}}_{1,2}& {\mathrm{<figure-callout\; id="2"\; label="H"\; filenames="H2009100775112E00031.png"\; state="\{\{state\}\}">H</figure-callout>}}_{\mathrm{2,2}}\\ {\mathrm{<figure-callout\; id="2"\; label="H"\; filenames="H2009100775112E00031.png"\; state="\{\{state\}\}">\; <figure-callout\; id="2"\; label="H"\; filenames="H2009100775112E00031.png"\; state="\{\{state\}\}">H</figure-callout>\; </figure-callout>}}_{2,2}^{*}& -{\mathrm{<figure-callout\; id="1"\; label="H"\; filenames="H2009100775112E00022.png"\; state="\{\{state\}\}">\; <figure-callout\; id="2"\; label="H"\; filenames="H2009100775112E00031.png"\; state="\{\{state\}\}">H</figure-callout>\; </figure-callout>}}_{1,2}^{*}\end{array}\right],$ According to the frequency response of each sub-channels between every transmit antennas of the second user terminal UE2 and every reception antenna, all transmitting antennas of structure UE2 are to the transmission matrix of each reception antenna ${\mathrm{\&Lambda;}}_{\mathrm{1,2}}=\left[\begin{array}{cc}{\mathrm{<figure-callout\; id="1"\; label="G"\; filenames="H2009100775112E00022.png"\; state="\{\{state\}\}">G</figure-callout>}}_{\mathrm{1,1}}& {\mathrm{<figure-callout\; id="2"\; label="G"\; filenames="H2009100775112E00031.png"\; state="\{\{state\}\}">G</figure-callout>}}_{\mathrm{2,1}}\\ {\mathrm{<figure-callout\; id="2"\; label="G"\; filenames="H2009100775112E00031.png"\; state="\{\{state\}\}">\; <figure-callout\; id="1"\; label="G"\; filenames="H2009100775112E00022.png"\; state="\{\{state\}\}">G</figure-callout>\; </figure-callout>}}_{\mathrm{2,1}}^{*}& -{\mathrm{<figure-callout\; id="1"\; label="G"\; filenames="H2009100775112E00022.png"\; state="\{\{state\}\}">\; <figure-callout\; id="1"\; label="G"\; filenames="H2009100775112E00022.png"\; state="\{\{state\}\}">G</figure-callout>\; </figure-callout>}}_{\mathrm{1,1}}^{*}\end{array}\right],$ ${\mathrm{\&Lambda;}}_{2,2}=\left[\begin{array}{cc}{\mathrm{<figure-callout\; id="1"\; label="G"\; filenames="H2009100775112E00022.png"\; state="\{\{state\}\}">G</figure-callout>}}_{1,2}& {\mathrm{<figure-callout\; id="2"\; label="G"\; filenames="H2009100775112E00031.png"\; state="\{\{state\}\}">G</figure-callout>}}_{\mathrm{2,2}}\\ {\mathrm{<figure-callout\; id="2"\; label="G"\; filenames="H2009100775112E00031.png"\; state="\{\{state\}\}">\; <figure-callout\; id="2"\; label="G"\; filenames="H2009100775112E00031.png"\; state="\{\{state\}\}">G</figure-callout>\; </figure-callout>}}_{2,2}^{*}& -{\mathrm{<figure-callout\; id="1"\; label="G"\; filenames="H2009100775112E00022.png"\; state="\{\{state\}\}">\; <figure-callout\; id="2"\; label="G"\; filenames="H2009100775112E00031.png"\; state="\{\{state\}\}">G</figure-callout>\; </figure-callout>}}_{1,2}^{*}\end{array}\right];$

According to described transmission matrix, set up linear ZF matrix $E=\left[\begin{array}{cc}{I}_{2N}& -{\mathrm{\&Lambda;}}_{1,2}{\mathrm{\&Lambda;}}_{\mathrm{2,2}}^{-1}\\ -{\mathrm{\&Lambda;}}_{\mathrm{2,1}}{\mathrm{\&Lambda;}}_{\mathrm{1,1}}^{-1}& I_{2N}\end{array}\right];$

Calculate linear ZF matrix and corrected received signal long-pending, with result of product as the first equivalent received signals $\tilde{Y}=\mathrm{EY},$ Wherein $\tilde{Y}=\left[\begin{array}{c}{\tilde{Y}}_1\\ {\tilde{Y}}_2\end{array}\right];$

Utilize $\mathrm{\&Sigma;}={\mathrm{\&Lambda;}}_{\mathrm{1,1}}-{\mathrm{\&Lambda;}}_{\mathrm{1,2}}{\mathrm{\&Lambda;}}_{\mathrm{2,2}}^{-1}{\mathrm{\&Lambda;}}_{\mathrm{2,1}}$ With $\mathrm{\&Delta;}={\mathrm{\&Lambda;}}_{\mathrm{2,2}}-{\mathrm{\&Lambda;}}_{\mathrm{2,1}}{\mathrm{\&Lambda;}}_{\mathrm{1,1}}^{-1}{\mathrm{\&Lambda;}}_{\mathrm{1,2}},$ According to ${\widetilde{\stackrel{~}{Y}}}_1={\mathrm{\&Sigma;}}^H{\tilde{Y}}_1$ With ${\widetilde{\stackrel{~}{Y}}}_2={\mathrm{\&Delta;}}^H{\tilde{Y}}_2$ Right

With

Process, obtain the second equivalent received signals With

The structure diagonal matrix ${\mathrm{\&Sigma;}}^H\mathrm{\&Sigma;}=\left(\begin{array}{cc}A& 0\\ 0& A\end{array}\right)$ With ${\mathrm{\&Delta;}}^H\mathrm{\&Delta;}=\left(\begin{array}{cc}\mathrm{<figure-callout\; id="0"\; label="B"\; filenames="H2009100775112E00031.png"\; state="\{\{state\}\}">B</figure-callout>}& 0\\ 0& B\end{array}\right),$ Obtain diagonal matrix A and B;

Utilize formula (16) and (17) to calculate the transmitting terminal signal phasor

With

Estimated value.

Above-mentionedly be the concrete mode that receiving terminal is processed and detected baseband signal in the two reception antenna situations.The above-mentioned record principle of two reception antennas can be generalized to the situation of 4/8 reception antenna, and along with the increase of eNodeB place reception antenna number, receiver obtains diversity gain significantly to be increased, and the link transmission reliability is further improved.In view of the record principle in the situation of 4/8 reception antenna is identical, concrete processing mode is similar, does not repeat them here.

The present invention has carried out emulation to the signal transmission that utilizes above-mentioned method of sending and receiving and consist of, to verify the transmission performance of BST-DFT-S-OFDM of the present invention system.Below contrast existing transmission plan and the transmission plan that the present invention is based on two users' virtual MIMO system of BST-DFT-S-OFDM from link transmission error performance angle.

Fig. 7 be the QPSK modulation system place an order user DFT-S-OFDM system with based on DFT-S-OFDM two users virtual MIMO system bit error Performance Ratio of single transmit antenna than schematic diagram.Concrete simulation parameter be TU channel, terminal movement velocity be 3km/h, without chnnel coding.Curve 701 is the relation curve based on signal to noise ratio (SNR) Yu the error rate (BER) of UE1 in the virtual MIMO system of DFT-S-OFDM, curve 702 is based on the signal to noise ratio of UE2 in the virtual MIMO system of DFT-S-OFDM and the relation curve of the error rate, and curve 703 is based on the signal to noise ratio of the alone family single transmit antenna two reception antenna systems of DFT-S-OFDM and the relation curve of the error rate.By above-mentioned three curves as seen: error performance is 10 ^-3In the situation, alone family DFT-S-OFDM transmission required signal-to-noise ratio is 10.5dB, be 16.5dB and transmit required signal to noise ratio based on the virtual MIMO of DFT-S-OFDM, i.e. virtual MIMO transmission based on DFT-S-OFDM needs volume to pay the cost of 6 decibels of signal to noise ratios, just can be so that the uplink band utilance increases by 1 times.

Fig. 8 is the bit error performance schematic diagram of two users' virtual MIMO system under low speed TU channel circumstance that the present invention is based on BST-DFT-S-OFDM under the QPSK modulation system.

Concrete simulation parameter be TU channel, terminal movement velocity be 3km/h, without chnnel coding.Curve 801 and 802 is respectively based on the signal to noise ratio of UE1 and UE2 in the virtual MIMO system of BST-DFT-S-OFDM and the relation curve of the error rate.803 is signal to noise ratio and the error transmissions performance based on alone family 2 emissions, the 2 reception antenna systems of DFT-S-OFDM.

The curve of comparison diagram 7 and Fig. 8 is as can be known: the bit error performance is 10 ^-3In the situation, transmitting required signal to noise ratio based on the virtual MIMO of BST-DFT-S-OFDM is 14.5dB, be 16.5dB and transmit required signal to noise ratio based on the virtual MIMO of DFT-S-OFDM, as seen the virtual MIMO transmission plan detection threshold that the present invention is based on BST-DFT-S-OFDM is lower than traditional virtual MIMO transmission plan based on DFT-S-OFDM, namely with respect to the single antenna virtual MIMO system, the present invention can obtain higher link transmission reliability.

In sum, above is preferred embodiment of the present invention only, is not for limiting protection scope of the present invention.Within the spirit and principles in the present invention all, any modification of doing, be equal to replacement, improvement etc., all should be included within protection scope of the present invention.

Claims (4)

1. the sending method of a virtual MIMO, the method comprises:

Two users' terminal UE 1 is used respectively identical running time-frequency resource with UE2, sends information according to identical method;

It is characterized in that, the method for described transmission information is:

With the signal phasor { X of discrete Fourier transform (DFT) DFT in two adjacent moment k and k+1 output _k, X _K+1Send into simultaneously the space-time block coding device, and carry out space-time block coding take signal phasor as unit, at two code word vector { X of the previous moment k in described adjacent two moment output _k, X _K+1, export in addition two code word vectors at a rear moment k+1 in described adjacent two moment

Code word vector X with the output of space-time block coding device _kWith

Send into the first emission path and carry out subchannel mapping, contrary fast fourier transform IFFT, insertion Cyclic Prefix, intermediate frequency and radio-frequency transmissions processing; Code word vector X with space-time block coding output _K+1With

Send into the second emission path and carry out subchannel mapping, contrary fast fourier transform IFFT, insertion Cyclic Prefix, intermediate frequency and radio-frequency transmissions processing.

2. the transmitter of a virtual MIMO, comprise: modulator, the DFT preprocessor, the space-time block coding device, the first mapper, the second mapper, the one IFFT processor, the 2nd IFFT processor, the first Cyclic Prefix inserter, the second Cyclic Prefix inserter, the first intermediate frequency and rf processor, the second intermediate frequency and rf processor, the first transmitting antenna and the second transmitting antenna, wherein, described the first mapper, the one IFFT processor, the first Cyclic Prefix inserter, the first intermediate frequency and rf processor and the first transmitting antenna consist of the first emission path, described the second mapper, the 2nd IFFT processor, the second Cyclic Prefix inserter, the second intermediate frequency and rf processor and the second transmitting antenna consist of the second emission path, described space-time block coding device is sent to coding result the first emission path or is sent to described the second emission path by described the second mapper by described the first mapper, it is characterized in that

Described DFT preprocessor, being used for will be at the signal phasor { X of two adjacent moment k and k+1 generation _k, X _K+1Send into simultaneously described space-time block coding device;

Described space-time block coding device is for the signal phasor { X that receives described DFT preprocessor _k, X _K+1, and carry out space-time block coding take signal phasor as unit, at two code word vector { X of the previous moment k in described adjacent two moment output _k, X _K+1, export in addition two code word vectors at a rear moment k+1 in described adjacent two moment

Wherein, with code word vector X _kWith

Export to described the first mapper, with code word vector X _K+1With

Export to described the second mapper.

3. the method for reseptance of a virtual MIMO is characterized in that, the method comprises:

From the radiofrequency signal of two reception antennas respectively through radio frequency, intermediate frequency process, sampling, Cyclic Prefix remove, fast fourier transform FFT conciliates mapping, obtains first reception signal phasor on the antenna

With the reception signal phasor on second antenna

To every reception antenna, k is received signal phasor constantly

Constantly receive signal phasor with k+1

Conjugation

Arrange the corrected received signal that forms every reception antenna by row $Y^{\left(n\right)}=\left[\begin{array}{c}{Y}_k^{\left(n\right)}\\ Y_{k+1}^{\left(n\right)*}\end{array}\right],$ N is the reception antenna numbering; The corrected received signal of two reception antennas is arranged the total corrected received signal of formation by row $Y=\left[\begin{array}{c}{Y}^{\left(1\right)}\\ Y^{\left(2\right)}\end{array}\right];$

According to the frequency response of each sub-channels between every transmit antennas of first user terminal UE 1 and every reception antenna, all transmitting antennas of structure UE1 divide the transmission matrix that is clipped to two reception antennas ${\mathrm{\&Lambda;}}_{\mathrm{1,1}}=\left[\begin{array}{cc}{H}_{\mathrm{1,1}}& H_{\mathrm{2,1}}\\ H_{\mathrm{2,1}}^{*}& -H_{\mathrm{1,1}}^{*}\end{array}\right],$ ${\mathrm{\&Lambda;}}_{2,1}=\left[\begin{array}{cc}{H}_{\mathrm{1,2}}& H_{\mathrm{2,2}}\\ H_{\mathrm{2,2}}^{*}& -H_{\mathrm{1,2}}^{*}\end{array}\right],$ According to the frequency response of each sub-channels between every transmit antennas of the second user terminal UE2 and every reception antenna, all transmitting antennas of structure UE2 are to the transmission matrix of each reception antenna ${\mathrm{\&Lambda;}}_{\mathrm{1,2}}=\left[\begin{array}{cc}{G}_{\mathrm{1,1}}& G_{\mathrm{2,1}}\\ G_{\mathrm{2,1}}^{*}& -G_{\mathrm{1,1}}^{*}\end{array}\right],$ ${\mathrm{\&Lambda;}}_{\mathrm{2,2}}=\left[\begin{array}{cc}{G}_{\mathrm{1,2}}& G_{\mathrm{2,2}}\\ G_{\mathrm{2,2}}^{*}& -G_{1,2}^{*}\end{array}\right];$

Wherein, H _{M, n}=diag (H _{M, n}(1), H _{M, n}(2) ..., H _{M, n}(j) ... H _{M, n}(N)) represent the diagonal matrix that the frequency response of m transmitting antenna of UE1 n all N sub-channels of reception antenna to the base station consists of, wherein j diagonal element H _{M, n}(j) represent m transmitting antenna of UE1 to the frequency response of base station n reception antenna l sub-channels; G _{M, n}=diag (G _{M, n}(1), G _{M, n}(2) ..., G _{M, n}(j) ... G _{M, n}(N)) represent the diagonal matrix that the frequency response of m transmitting antenna of UE2 n all N sub-channels of reception antenna to the base station consists of, wherein j diagonal element G _{M, n}(j) represent m transmitting antenna of UE2 to the frequency response of base station n reception antenna l sub-channels, m=1 or 2, l=f (j) is the relation of the channel mapping in arbitrary emission path when transmitting, l is the subchannel numbering that is mapped to, j is j component of described arbitrary emission path inner code word vector, j=1 ..., N, N are the counting of DFT conversion of transmitting;

According to described transmission matrix, set up linear ZF matrix $E=\left[\begin{array}{cc}{I}_{2N}& -{\mathrm{\&Lambda;}}_{\mathrm{1,2}}{\mathrm{\&Lambda;}}_{\mathrm{2,2}}^{-1}\\ -{\mathrm{\&Lambda;}}_{\mathrm{2,1}}{\mathrm{\&Lambda;}}_{\mathrm{1,1}}^{-1}& I_{2N}\end{array}\right];$

According to

Calculate linear ZF matrix and corrected received signal long-pending, with result of product as the first equivalent received signals

Wherein $\tilde{Y}=\left[\begin{array}{c}{\tilde{Y}}_1\\ {\tilde{Y}}_2\end{array}\right];$

Utilize $\mathrm{\&Sigma;}={\mathrm{\&Lambda;}}_{\mathrm{1,1}}-{\mathrm{\&Lambda;}}_{\mathrm{1,2}}{\mathrm{\&Lambda;}}_{\mathrm{2,2}}^{-1}{\mathrm{\&Lambda;}}_{\mathrm{2,1}}$ With $\mathrm{\&Delta;}={\mathrm{\&Lambda;}}_{\mathrm{2,2}}-{\mathrm{\&Lambda;}}_{\mathrm{2,1}}{\mathrm{\&Lambda;}}_{\mathrm{1,1}}^{-1}{\mathrm{\&Lambda;}}_{\mathrm{1,2}},$ According to ${\widetilde{\stackrel{~}{Y}}}_1={\mathrm{\&Sigma;}}^H{\tilde{Y}}_1$ With ${\widetilde{\stackrel{~}{Y}}}_2={\mathrm{\&Delta;}}^H{\tilde{Y}}_2,$ Obtain the second equivalent received signals

With

The structure diagonal matrix ${\mathrm{\&Sigma;}}^H\mathrm{\&Sigma;}=\left(\begin{array}{cc}A& 0\\ 0& A\end{array}\right)$ With ${\mathrm{\&Delta;}}^H\mathrm{\&Delta;}=\left(\begin{array}{cc}B& 0\\ 0& B\end{array}\right),$ Obtain diagonal matrix A and B;

According to $\left\{\begin{array}{c}{\tilde{X}}_{k,j}=\frac{1}{\mathrm{\&alpha;}\left(j\right)+{{\mathrm{\&sigma;}}_{\mathrm{1,1},j}}^2}\&CenterDot;{\widetilde{\stackrel{~}{Y}}}_{\mathrm{1,1},j}\\ {\tilde{X}}_{k+1,j}=\frac{1}{\mathrm{\&alpha;}\left(j\right)+{{\mathrm{\&sigma;}}_{\mathrm{1,2},j}}^2}\&CenterDot;{\widetilde{\stackrel{~}{Y}}}_{\mathrm{1,2},j}\end{array}\right.,$ J=1 ..., N, the transmitting terminal signal phasor { X of calculating UE1 _k, X _K+1Estimated value Wherein, α (j) is j the diagonal element of A,

And

Be respectively

And

J component,

And

Be respectively

Top n component and the vector that consists of of a rear N component; Described σ _{1,1, j} ²For

Noise variance; Described

For

J component; Described

With described The pass be Described σ _{1,2, j} ²For

Noise variance; Described

For

J component; Described

With described

The pass be

According to $\left\{\begin{array}{c}{\tilde{C}}_{k,j}=\frac{1}{\mathrm{\&beta;}\left(j\right)+{{\mathrm{\&sigma;}}_{\mathrm{2,1},j}}^2}\&CenterDot;{\widetilde{\stackrel{~}{Y}}}_{\mathrm{2,1},j}\\ {\tilde{C}}_{k+1}=\frac{1}{\mathrm{\&beta;}\left(j\right)+{{\mathrm{\&sigma;}}_{\mathrm{2,2},j}}^2}\&CenterDot;{\stackrel{\widetilde{~}}{Y}}_{\mathrm{2,2},j}\end{array}\right.,$ J=1 ..., N calculates the transmitting terminal signal phasor { C of UE2 _k, C _K+1Estimated value

Wherein, β (j) is j the diagonal element of B, And

Be respectively And J component,

And

Be respectively

Top n component and the vector that consists of of a rear N component; Described σ _{2,1, j} ²For

Noise variance; Described

For

J component; Described

With described

The pass be

Described σ _{2,2, j} ²For

Noise variance; Described

For

J component; Described With described

The pass be

Estimated value to described transmitting terminal signal phasor

With Carry out inverse Fourier transform IDFT, detect again the estimated value of the emission symbol that obtains UE1 and UE2.

4. the receiver of a virtual MIMO, it is characterized in that, this receiver comprises: with 2 reception antennas one to one 2 receivers, 2 cyclic prefix remover, 2 fft processors, 2 de-mapping devices, space-time joint equalizer, 2 IDFT processors and 2 demodulators;

Arbitrary receiver is used for the signal that receiving end/sending end sends, and carries out exporting to coupled cyclic prefix remover after radio frequency, intermediate frequency and the sampling processing;

Arbitrary cyclic prefix remover is used for removing Cyclic Prefix from the signal that receives, and exports to coupled fft processor;

Arbitrary fft processor is used for that the signal that receives is carried out FFT and processes, and exports to coupled de-mapping device;

Arbitrary de-mapping device is used for the signal that receives obtaining two and receiving signal phasors according to separating mapping with the corresponding mode of transmitting terminal

With

, n is reception antenna numbering corresponding to this de-mapping device;

Described space-time joint equalizer for every reception antenna, receives signal phasor constantly with k

Constantly receive signal phasor with k+1

Conjugation

Arrange the corrected received signal that forms every reception antenna by row $Y^{\left(n\right)}=\left[\begin{array}{c}{Y}_k^{\left(n\right)}\\ Y_{k+1}^{\left(n\right)*}\end{array}\right],$ N is the reception antenna numbering; The corrected received signal of two reception antennas is arranged the total corrected received signal of formation by row $Y=\left[\begin{array}{c}{Y}^{\left(1\right)}\\ Y^{\left(2\right)}\end{array}\right];$ According to the frequency response of each sub-channels between every transmit antennas of first user terminal UE 1 and every reception antenna, all transmitting antennas of structure UE1 divide the transmission matrix that is clipped to two reception antennas ${\mathrm{\&Lambda;}}_{\mathrm{1,1}}=\left[\begin{array}{cc}{H}_{\mathrm{1,1}}& H_{\mathrm{2,1}}\\ H_{\mathrm{2,1}}^{*}& -H_{\mathrm{1,1}}^{*}\end{array}\right],$ ${\mathrm{\&Lambda;}}_{2,1}=\left[\begin{array}{cc}{H}_{\mathrm{1,2}}& H_{\mathrm{2,2}}\\ H_{\mathrm{2,2}}^{*}& -H_{\mathrm{1,2}}^{*}\end{array}\right],$ According to the frequency response of each sub-channels between every transmit antennas of the second user terminal UE2 and every reception antenna, all transmitting antennas of structure UE2 are to the transmission matrix of each reception antenna ${\mathrm{\&Lambda;}}_{\mathrm{1,2}}=\left[\begin{array}{cc}{G}_{\mathrm{1,1}}& G_{\mathrm{2,1}}\\ G_{\mathrm{2,1}}^{*}& -G_{\mathrm{1,1}}^{*}\end{array}\right],$ ${\mathrm{\&Lambda;}}_{\mathrm{2,2}}=\left[\begin{array}{cc}{G}_{\mathrm{1,2}}& G_{\mathrm{2,2}}\\ G_{\mathrm{2,2}}^{*}& -G_{1,2}^{*}\end{array}\right],$ Wherein, H _{M, n}=diag (H _{M, n}(1), H _{M, n}(2) ..., H _{M, n}(j) ... H _{M, n}(N)) represent the diagonal matrix that the frequency response of m transmitting antenna of UE1 n all N sub-channels of reception antenna to the base station consists of, wherein j diagonal element H _{M, n}(j) represent m transmitting antenna of UE1 to the frequency response of base station n reception antenna l sub-channels; G _{M, n}=diag (G _{M, n}(1), G _{M, n}(2) ..., G _{M, n}(j) ... G _{M, n}(N)) represent the diagonal matrix that the frequency response of m transmitting antenna of UE2 n all N sub-channels of reception antenna to the base station consists of, wherein j diagonal element G _{M, n}(j) represent m transmitting antenna of UE2 to the frequency response of base station n reception antenna l sub-channels, m=1 or 2, l=f (j) is the relation of the channel mapping in arbitrary emission path when transmitting, l is the subchannel numbering that is mapped to, j is j component of described arbitrary emission path inner code word vector, j=1 ..., N, N are the counting of DFT conversion of transmitting;

According to described transmission matrix, set up linear ZF matrix $E=\left[\begin{array}{cc}{I}_{2N}& -{\mathrm{\&Lambda;}}_{\mathrm{1,2}}{\mathrm{\&Lambda;}}_{\mathrm{2,2}}^{-1}\\ -{\mathrm{\&Lambda;}}_{\mathrm{2,1}}{\mathrm{\&Lambda;}}_{\mathrm{1,1}}^{-1}& I_{2N}\end{array}\right];$ According to Calculate linear ZF matrix and corrected received signal long-pending, with result of product as the first equivalent received signals

Wherein $\tilde{Y}=\left[\begin{array}{c}{\tilde{Y}}_1\\ {\tilde{Y}}_2\end{array}\right];$ Utilize $\mathrm{\&Sigma;}={\mathrm{\&Lambda;}}_{\mathrm{1,1}}-{\mathrm{\&Lambda;}}_{\mathrm{1,2}}{\mathrm{\&Lambda;}}_{\mathrm{2,2}}^{-1}{\mathrm{\&Lambda;}}_{\mathrm{2,1}}$ With $\mathrm{\&Delta;}={\mathrm{\&Lambda;}}_{\mathrm{2,2}}-{\mathrm{\&Lambda;}}_{\mathrm{2,1}}{\mathrm{\&Lambda;}}_{\mathrm{1,1}}^{-1}{\mathrm{\&Lambda;}}_{\mathrm{1,2}},$ According to ${\stackrel{\widetilde{~}}{Y}}_1={\mathrm{\&Sigma;}}^H{\tilde{Y}}_1$ With

Right

With Process, obtain the second equivalent received signals

With

The structure diagonal matrix ${\mathrm{\&Sigma;}}^H\mathrm{\&Sigma;}=\left(\begin{array}{cc}A& 0\\ 0& A\end{array}\right)$ With ${\mathrm{\&Delta;}}^H\mathrm{\&Delta;}=\left(\begin{array}{cc}B& 0\\ 0& B\end{array}\right)$ , obtain diagonal matrix A and B; According to $\left\{\begin{array}{c}{\tilde{X}}_{k,j}=\frac{1}{\mathrm{\&alpha;}\left(j\right)+{{\mathrm{\&sigma;}}_{\mathrm{1,1},j}}^2}\&CenterDot;{\widetilde{\stackrel{~}{Y}}}_{\mathrm{1,1},j}\\ {\tilde{X}}_{k+1,j}=\frac{1}{\mathrm{\&alpha;}\left(j\right)+{{\mathrm{\&sigma;}}_{\mathrm{1,2},j}}^2}\&CenterDot;{\widetilde{\stackrel{~}{Y}}}_{\mathrm{1,2},j}\end{array}\right.,$ J=1 ..., N, the transmitting terminal signal phasor { X of calculating UE1 _k, X _K+1Estimated value And export to coupled IDFT processor, wherein, α (j) is j the diagonal element of A,

And Be respectively

And J component,

And

Be respectively Top n component and the vector that consists of of a rear N component; Described σ _{1,1, j} ²For

Noise variance; Described

For

J component; Described With described The pass be

Described σ _{1,2, j} ²For

Noise variance; Described For

J component; Described

With described The pass be ${\widetilde{\stackrel{~}{Y}}}_{\mathrm{1,2}}={\mathrm{AX}}_{k+1}+{\widetilde{\stackrel{~}{N}}}_{\mathrm{1,2}};$ According to $\left\{\begin{array}{c}{\tilde{C}}_{k,j}=\frac{1}{\mathrm{\&beta;}\left(j\right)+{{\mathrm{\&sigma;}}_{\mathrm{2,1},j}}^2}\&CenterDot;{\widetilde{\stackrel{~}{Y}}}_{\mathrm{2,1},j}\\ {\tilde{C}}_{k+1}=\frac{1}{\mathrm{\&beta;}\left(j\right)+{{\mathrm{\&sigma;}}_{\mathrm{2,2},j}}^2}\&CenterDot;{\stackrel{\widetilde{~}}{Y}}_{\mathrm{2,2},j}\end{array}\right.,$ J=1 ..., N calculates the transmitting terminal signal phasor { C of UE2 _k, C _K+1Estimated value

And export to coupled IDFT processor, wherein, β (j) is j the diagonal element of B, And

Be respectively

And

J component,

And

Be respectively

Top n component and the vector that consists of of a rear N component; Described σ _{2,1, j} ²For

Noise variance; Described

For

J component; Described

With described

The pass be

Described σ _{2,2, j} ²For

Noise variance; Described

For

J component; Described

With described The pass be ${\widetilde{\stackrel{~}{Y}}}_{\mathrm{1,2}}={\mathrm{AX}}_{k+1}+{\widetilde{\stackrel{~}{N}}}_{\mathrm{2,2}};$

Described IDFT processor is used for the signal that receives is carried out contrary discrete Fourier transform (DFT) IDFT, and transformation results is exported to coupled demodulator;

Described demodulator is used for carrying out to received signal the estimated value that demodulation obtains launching symbol.

Images