CN102832984B - Pre-coding method supporting eight transmitting antennas, and method and device for signal processing - Google Patents

Abstract

The invention provides a pre-coding method supporting eight transmitting antennas, and a method and a device for signal processing. The method comprises using a pre-coding matrix to precode emission signals, so as to transmit at most a space layer signal on each transmitting antenna, mapping a same code word on a space layer with similar quality, the space layer with similar quality being a space layer that difference of the number of corresponding nonzero elements between the space layers is in a set range; and using the eight transmitting antennas to emit pre-coded emission signals. An embodiment of the invention can realize pre-coding for eight transmitting antennas.

Description

Precoding method supporting 8 transmitting antennas, signal processing method and device

Technical Field

The present invention relates to wireless communication technologies, and in particular, to a precoding method, a signal processing method, and a device for supporting 8 transmit antennas.

Background

In a multi-antenna system, a precoding scheme may be employed at the transmitting end to improve system performance. For example, in a Long Term Evolution system further enhanced (LTE-a) system, a precoding scheme of 4 transmit antennas can be supported at maximum. There is no precoding scheme with 8 transmit antennas in the prior art.

Disclosure of Invention

The embodiment of the invention provides a precoding method, a signal processing method and a signal processing device for supporting 8 transmitting antennas, which are used for realizing precoding of the 8 transmitting antennas.

The embodiment of the invention provides a precoding method for supporting 8 transmitting antennas, which comprises the following steps:

precoding the transmitting signals by adopting a precoding matrix, so that at most one spatial layer signal is transmitted on each transmitting antenna, and the same code word is mapped to spatial layers with similar quality, wherein the spatial layers with the similar quality refer to the spatial layers with the difference value of the number of corresponding non-zero elements between the spatial layers within a setting range;

and transmitting the precoded transmission signals by adopting 8 transmission antennas.

An embodiment of the present invention provides a signal processing apparatus, including:

the precoding module is used for precoding the transmitting signals by adopting a precoding matrix, so that at most one spatial layer signal is transmitted on each transmitting antenna, and the same code word is mapped to spatial layers with similar quality, wherein the spatial layers with the similar quality refer to the spatial layers with the difference value of the number of corresponding non-zero elements between the spatial layers within a set range;

and the transmitting module is used for transmitting the transmitting signals which are precoded by the precoding module by adopting 8 transmitting antennas.

The embodiment of the invention provides a signal processing method, which comprises the following steps:

receiving a pre-coded transmission signal transmitted by a transmitting terminal by adopting 8 transmitting antennas;

acquiring an equivalent channel estimation value according to a precoding matrix, and processing a received signal according to the equivalent signal estimation value to obtain an estimation value of the transmitted signal;

the precoding matrix is predetermined with a transmitting end, so that the transmitting end performs precoding by using the precoding matrix to transmit at most one spatial layer signal on each transmitting antenna, and maps the same codeword onto spatial layers with similar quality, where the spatial layers with similar quality refer to spatial layers in a setting range of a difference value of the number of corresponding non-zero elements between the spatial layers.

An embodiment of the present invention provides a base station, including:

the receiving module is used for receiving the pre-coded transmitting signals transmitted by the transmitting terminal by adopting 8 transmitting antennas;

the processing module is used for acquiring an equivalent channel estimation value according to the precoding matrix and processing the signal received by the receiving module according to the equivalent signal estimation value to obtain an estimation value of the transmitting signal;

the precoding matrix is predetermined with a transmitting end, so that the transmitting end performs precoding by using the precoding matrix to transmit at most one spatial layer signal on each transmitting antenna, and maps the same codeword onto spatial layers with similar quality, where the spatial layers with similar quality refer to spatial layers in a setting range of a difference value of the number of corresponding non-zero elements between the spatial layers.

According to the technical scheme, the embodiment of the invention can realize the support of transmitting signals by 8 transmitting antennas by adopting the precoding matrix meeting the conditions.

Drawings

In order to more clearly illustrate the technical solutions in the embodiments of the present invention, the drawings needed to be used in the description of the embodiments are briefly introduced below, and it is obvious that the drawings in the following description are some embodiments of the present invention, and it is obvious for those skilled in the art to obtain other drawings based on these drawings without inventive labor.

FIG. 1 is a schematic flow chart of a method according to a first embodiment of the present invention;

FIG. 2 is a flowchart illustrating an embodiment of calculating a precoding matrix according to the present invention;

FIG. 3 is a flowchart illustrating another embodiment of calculating a precoding matrix according to an embodiment of the present invention;

FIG. 4 is a flowchart illustrating a method for calculating a precoding matrix according to another embodiment of the present invention;

FIG. 5 is a schematic structural diagram of a signal processing apparatus according to a second embodiment of the present invention;

FIG. 6 is a flowchart illustrating a signal processing method according to a third embodiment of the present invention;

fig. 7 is a schematic structural diagram of a base station according to a fourth embodiment of the present invention.

Detailed Description

In order to make the objects, technical solutions and advantages of the embodiments of the present invention clearer, the technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the drawings in the embodiments of the present invention, and it is obvious that the described embodiments are some, but not all, embodiments of the present invention. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present invention.

Fig. 1 is a schematic flow chart of a method according to a first embodiment of the present invention, which includes:

step 11: the transmitting end adopts a precoding matrix to precode the transmitting signals, so that at most one spatial layer signal is transmitted on each transmitting antenna, and the same code word is mapped to spatial layers with similar quality, wherein the spatial layers with similar quality refer to that the difference value of the number of corresponding non-zero elements between the spatial layers is in a setting range;

the transmitting end may be a terminal, such as User Equipment (UE); or Relay.

The spatial layer signal may refer to a codeword after layer mapping. For example, in LTE-a, the UE-generated signal may be modulated first and then layer-mapped to obtain spatial layer signals mapped to different spatial layers. For example, the modulated codeword includes codeword 0 and codeword 1, and after layer mapping, assuming that codeword 0 is mapped to the first spatial layer and the second spatial layer, the first spatial layer signal is codeword 0 mapped to the first spatial layer. Each spatial layer signal usually includes a layer-mapped codeword, and each codeword can be mapped to a different spatial layer, resulting in a different spatial layer signal.

In addition, on the basis of the above assumption, the first spatial layer and the second spatial layer are required to be spatial layers having similar qualities.

Furthermore, the spatial layer may refer to a column vector of each column in the precoding matrix, for example, a first column vector of the precoding matrix is a first spatial layer, a second column vector of the precoding matrix is a second spatial layer, and so on, and a seventh column vector of the precoding matrix is a seventh spatial layer.

Step 12: and the transmitting terminal adopts 8 transmitting antennas to transmit the precoded transmitting signals.

In the embodiment of the present invention, for a scenario with 8 transmit antennas, the precoding matrix including a rank of 1 to a rank of 7 may specifically be as follows:

rank 1 precoding matrix: $\left[X_{\mathrm{8,1}}^1\right]$

rank 2 precoding matrix: $\left[\begin{array}{cc}{X}_{\mathrm{4,1}}^2& \\ & X_{\mathrm{4,2}}^2\end{array}\right]$

rank 3 precoding matrix: $\left[\begin{array}{ccc}{X}_{\mathrm{4,1}}^3& & \\ & X_{\mathrm{2,2}}^3& \\ & & X_{\mathrm{2,3}}^3\end{array}\right]$

rank 4 precoding matrix: $\left[\begin{array}{cccc}{X}_{\mathrm{2,1}}^4& & & \\ & X_{\mathrm{2,2}}^4& & \\ & & X_{\mathrm{2,3}}^4& \\ & & & X_{\mathrm{2,4}}^4\end{array}\right]$

rank 5 precoding matrix: $\left[\begin{array}{ccccc}{X}_{\mathrm{1,1}}^5& & & & \\ & X_{\mathrm{1,2}}^5& & & \\ & & X_{\mathrm{2,3}}^5& & \\ & & & X_{\mathrm{2,3}}^5& \\ & & & & X_{\mathrm{2,5}}^5\end{array}\right]$

rank 6 precoding matrix: $\left[\begin{array}{cccccc}{X}_{\mathrm{1,1}}^6& & & & & \\ & X_{\mathrm{1,2}}^6& & & & \\ & & X_{\mathrm{1,3}}^6& & & \\ & & & X_{\mathrm{1,4}}^6& & \\ & & & & X_{\mathrm{2,5}}^6& \\ & & & & & X_{\mathrm{2,6}}^6\end{array}\right]$

rank 7 precoding matrix: $\left[\begin{array}{ccccccc}{X}_{\mathrm{1,1}}^7& & & & & & \\ & X_{\mathrm{1,2}}^7& & & & & \\ & & X_{\mathrm{1,3}}^7& & & & \\ & & & X_{\mathrm{1,4}}& & & \\ & & & & X_{\mathrm{1,5}}^7& & \\ & & & & & X_{\mathrm{1,6}}^7& \\ & & & & & & X_{\mathrm{2,7}}^7\end{array}\right]$

the precoding matrix may include the following meanings:

(1) the precoding matrix described above can be expressed as: <math> <mrow> <msup> <mi>C</mi> <mi>r</mi> </msup> <mo>=</mo> <mfenced open='[' close=']'> <mtable> <mtr> <mtd> <msubsup> <mi>X</mi> <mrow> <msub> <mi>n</mi> <mn>1</mn> </msub> <mo>,</mo> <mn>1</mn> </mrow> <mi>r</mi> </msubsup> </mtd> <mtd> <msub> <mn>0</mn> <msub> <mi>n</mi> <mn>1</mn> </msub> </msub> </mtd> <mtd> <mi>&Lambda;</mi> </mtd> <mtd> <msub> <mn>0</mn> <msub> <mi>n</mi> <mn>1</mn> </msub> </msub> </mtd> </mtr> <mtr> <mtd> <msub> <mn>0</mn> <msub> <mi>n</mi> <mn>2</mn> </msub> </msub> </mtd> <mtd> <msubsup> <mi>X</mi> <mrow> <msub> <mi>n</mi> <mn>2</mn> </msub> <mo>,</mo> <mn>2</mn> </mrow> <mi>r</mi> </msubsup> </mtd> <mtd> <mi>&Lambda;</mi> </mtd> <mtd> <msub> <mn>0</mn> <msub> <mi>n</mi> <mn>2</mn> </msub> </msub> </mtd> </mtr> <mtr> <mtd> <mi>M</mi> </mtd> <mtd> <mi>M</mi> </mtd> <mtd> <mi>O</mi> </mtd> <mtd> <mi>M</mi> </mtd> </mtr> <mtr> <mtd> <msub> <mn>0</mn> <msub> <mi>n</mi> <mi>r</mi> </msub> </msub> </mtd> <mtd> <mi>&Lambda;</mi> </mtd> <mtd> <mi>&Lambda;</mi> </mtd> <mtd> <msubsup> <mi>X</mi> <mrow> <msub> <mi>n</mi> <mi>r</mi> </msub> <mo>,</mo> <mi>r</mi> </mrow> <mi>r</mi> </msubsup> </mtd> </mtr> </mtable> </mfenced> <mo>,</mo> </mrow> </math> a matrix satisfying this form may be referred to as a block diagonal matrix;

wherein, C^rA precoding matrix of rank r is represented,indicating that in the ith of a precoding matrix of rank r, one is of length n_iThe column vector of (a) is,length n indicating that all elements are 0_iI ═ 1, Λ, r;

the formula shows that C^rIs a block diagonal matrix, andC^rcontains at most one non-zero element per line. On this basis, at most one signal transmitted on a spatial layer is transmitted on each transmit antenna. Therefore, after the precoding matrix is used in a Single Carrier Frequency Division Multiple Access (SC-FDMA) system, since each transmitting antenna transmits at most one spatial layer signal, the Cubic Metric (CM) value of the transmitting baseband signal is not increased.

(2) The precoding matrix described above also has the following characteristics, in particular C^rIs set to satisfy at least one of the following conditions:

when r is 2, the first and second spatial layers respectively contain 4 non-zero elements; i.e. the first and second columns are each a column vector of 4 non-zero elements.

When r is 3, the first spatial layer includes 4 non-zero elements, and the second and third spatial layers include 2 non-zero elements, respectively;

when r is 4, the first, second, third and fourth spatial layers respectively contain 2 non-zero elements;

when r is 5, the first and second spatial layers respectively include 1 non-zero element, and the third, fourth, and fifth spatial layers respectively include 2 non-zero elements;

when r is 6, the first, second, third and fourth spatial layers respectively include 1 non-zero element, and the fifth and sixth spatial layers respectively include 2 non-zero elements;

when r is 7, the first, second, third, fourth, fifth and sixth spatial layers respectively include 1 non-zero element, and the seventh spatial layer includes 2 non-zero elements.

Through the processing, when the code words are mapped to the spatial layers, each code word can be mapped to the spatial layers with similar quality as much as possible, so that the accuracy of Adaptive Modulation Coding (AMC) of each code word is improved.

The spatial layers with similar quality mean that the difference of the number of corresponding non-zero elements is within a preset range, that is, the number of corresponding non-zero elements is substantially the same. In particular, in the embodiment of the present invention, spatial layers with similar quality correspond to the same number of nonzero elements. Taking r as 3 as an example, the first spatial layer corresponds to 4 non-zero elements, and the second spatial layer and the third spatial layer correspond to 2 non-zero elements, respectively, so that the second spatial layer and the third spatial layer are spatial layers with similar quality.

Specifically, when r is 3, as specified by the protocol, codeword 0(CW0) is mapped to the first spatial layer and codeword 1(CW1) is mapped to the second and third spatial layers. Since the second spatial layer and the third spatial layer both correspond to 2 non-zero elements, it is considered that codeword 1 is mapped to spatial layers with similar quality, and the above requirements are satisfied.

For another example, when r is 5, CW0 is mapped to the first and second spatial layers and codeword 1 is mapped to the third to fifth spatial layers as specified by the protocol. Since the first and second spatial layers correspond to 1 non-zero element and the third to fifth spatial layers correspond to 2 non-zero elements, it is considered that CW0 is mapped to spatial layers with similar quality and CW1 is also mapped to spatial layers with similar quality, which satisfies the above requirements.

In this embodiment, by using the precoding matrix satisfying the above conditions, the support for transmitting signals from 8 transmitting antennas can be realized. Wherein each row of the precoding matrix comprises at most one non-zero element. At most one spatial layer signal can be transmitted on each transmitting antenna, and the CM value of the transmitting baseband signal is not increased after the precoding matrix is used in the SC-FDMA system. Each code word is mapped to a spatial layer with similar quality as much as possible through a precoding matrix, so that the accuracy of the AMC of each code word is improved.

The above describes the structure of the precoding matrix supporting 8 transmit antennas, and the value of the precoding matrix can be calculated as follows.

Fig. 2 is a schematic flowchart of an embodiment of calculating a precoding matrix in the embodiment of the present invention, including:

step 21: setting a rank r precoding matrix C^rIs started.

The initial value may be any value that satisfies the structural requirements described above.

Step 22: according to a precoding matrix C with rank r^rCalculating to obtain a precoding matrix C with the rank r +1^r+1Some or all of the precoding matrices. Wherein, is composed of C^rCalculating C^r+1The calculation process of (c) may be as follows:

rank r precoding matrix C^rThis can be described as follows:

<math> <mrow> <msup> <mi>C</mi> <mi>r</mi> </msup> <mo>=</mo> <mfenced open='[' close=']'> <mtable> <mtr> <mtd> <msubsup> <mi>X</mi> <mrow> <msub> <mi>n</mi> <mn>1</mn> </msub> <mo>,</mo> <mn>1</mn> </mrow> <mi>r</mi> </msubsup> </mtd> <mtd> <msub> <mn>0</mn> <msub> <mi>n</mi> <mn>1</mn> </msub> </msub> </mtd> <mtd> <mi>&Lambda;</mi> </mtd> <mtd> <msub> <mn>0</mn> <msub> <mi>n</mi> <mn>1</mn> </msub> </msub> </mtd> </mtr> <mtr> <mtd> <msub> <mn>0</mn> <msub> <mi>n</mi> <mn>2</mn> </msub> </msub> </mtd> <mtd> <msubsup> <mi>X</mi> <mrow> <msub> <mi>n</mi> <mn>2</mn> </msub> <mo>,</mo> <mn>2</mn> </mrow> <mi>r</mi> </msubsup> </mtd> <mtd> <mi>&Lambda;</mi> </mtd> <mtd> <msub> <mn>0</mn> <msub> <mi>n</mi> <mn>2</mn> </msub> </msub> </mtd> </mtr> <mtr> <mtd> <mi>M</mi> </mtd> <mtd> <mi>M</mi> </mtd> <mtd> <mi>O</mi> </mtd> <mtd> <mi>M</mi> </mtd> </mtr> <mtr> <mtd> <msub> <mn>0</mn> <msub> <mi>n</mi> <mi>r</mi> </msub> </msub> </mtd> <mtd> <mi>&Lambda;</mi> </mtd> <mtd> <mi>&Lambda;</mi> </mtd> <mtd> <msubsup> <mi>X</mi> <mrow> <msub> <mi>n</mi> <mi>r</mi> </msub> <mo>,</mo> <mi>r</mi> </mrow> <mi>r</mi> </msubsup> </mtd> </mtr> </mtable> </mfenced> <mo>=</mo> <mi>BlockDiag</mi> <mfenced open='{' close='}'> <mtable> <mtr> <mtd> <msubsup> <mi>X</mi> <mrow> <msub> <mi>n</mi> <mn>1</mn> </msub> <mo>,</mo> <mn>1</mn> </mrow> <mi>r</mi> </msubsup> </mtd> <mtd> <msubsup> <mi>X</mi> <mrow> <msub> <mi>n</mi> <mn>2</mn> </msub> <mo>,</mo> <mn>2</mn> </mrow> <mi>r</mi> </msubsup> </mtd> <mtd> <mtext>&Lambda;</mtext> </mtd> <mtd> <msubsup> <mi>X</mi> <mrow> <msub> <mi>n</mi> <mi>r</mi> </msub> <mo>,</mo> <mi>r</mi> </mrow> <mi>r</mi> </msubsup> </mtd> </mtr> </mtable> </mfenced> </mrow> </math>

selecting a column in the block diagonal matrix, e.g. selecting ith₀Column, i.e. selectionThen, it is divided into 2 column vectors of equal lengthAndthat is to say that the first and second electrodes,

<math> <mrow> <msubsup> <mi>X</mi> <mrow> <msub> <mi>n</mi> <msub> <mi>i</mi> <mn>0</mn> </msub> </msub> <mo>,</mo> <msub> <mi>i</mi> <mn>0</mn> </msub> </mrow> <mi>r</mi> </msubsup> <mo>=</mo> <mfenced open='[' close=']'> <mtable> <mtr> <mtd> <msubsup> <mi>X</mi> <mrow> <msub> <mi>i</mi> <mn>0</mn> </msub> <mo>,</mo> <mi>a</mi> </mrow> <mi>r</mi> </msubsup> </mtd> </mtr> <mtr> <mtd> <mi>&alpha;</mi> <msubsup> <mi>X</mi> <mrow> <msub> <mi>i</mi> <mn>0</mn> </msub> <mo>,</mo> <mi>b</mi> </mrow> <mi>r</mi> </msubsup> </mtd> </mtr> </mtable> </mfenced> </mrow> </math>

wherein α is a complex number for ensuringIs 1.

Further, the precoding matrix C of rank r +1 may be constructed as follows^r+1：

<math> <mrow> <msup> <mi>C</mi> <mrow> <mi>r</mi> <mo>+</mo> <mn>1</mn> </mrow> </msup> <mo>=</mo> <mi>BlockDiag</mi> <mfenced open='{' close='}'> <mtable> <mtr> <mtd> <msubsup> <mi>X</mi> <mrow> <msub> <mi>n</mi> <mn>1</mn> </msub> <mo>,</mo> <mn>1</mn> </mrow> <mrow> <mi>r</mi> <mo>+</mo> <mn>1</mn> </mrow> </msubsup> </mtd> <mtd> <mi>&Lambda;</mi> </mtd> <mtd> <msubsup> <mi>X</mi> <msub> <mi>n</mi> <mrow> <msub> <mi>i</mi> <mn>0</mn> </msub> <mo>-</mo> <mn>1</mn> <mo>,</mo> <msub> <mi>i</mi> <mn>0</mn> </msub> <mo>-</mo> <mn>1</mn> </mrow> </msub> <mrow> <mi>r</mi> <mo>+</mo> <mn>1</mn> </mrow> </msubsup> </mtd> <mtd> <msubsup> <mi>X</mi> <mrow> <msub> <mi>n</mi> <msub> <mi>i</mi> <mn>0</mn> </msub> </msub> <mo>,</mo> <msub> <mi>i</mi> <mn>0</mn> </msub> </mrow> <mrow> <mi>r</mi> <mo>+</mo> <mn>1</mn> </mrow> </msubsup> </mtd> <mtd> <msubsup> <mi>X</mi> <mrow> <msub> <mi>n</mi> <mrow> <msub> <mi>i</mi> <mn>0</mn> </msub> <mo>+</mo> <mn>1</mn> </mrow> </msub> <mo>,</mo> <msub> <mi>i</mi> <mn>0</mn> </msub> <mo>+</mo> <mn>1</mn> </mrow> <mrow> <mi>r</mi> <mo>+</mo> <mn>1</mn> </mrow> </msubsup> </mtd> <mtd> <msubsup> <mi>X</mi> <mrow> <msub> <mi>n</mi> <mrow> <msub> <mi>i</mi> <mn>0</mn> </msub> <mo>+</mo> <mn>2</mn> </mrow> </msub> <mo>,</mo> <msub> <mi>i</mi> <mn>0</mn> </msub> <mo>+</mo> <mn>2</mn> </mrow> <mrow> <mi>r</mi> <mo>+</mo> <mn>1</mn> </mrow> </msubsup> </mtd> <mtd> <mi>&Lambda;</mi> </mtd> <mtd> <msubsup> <mi>X</mi> <mrow> <msub> <mi>n</mi> <mrow> <mi>r</mi> <mo>+</mo> <mn>1</mn> </mrow> </msub> <mo>,</mo> <mi>r</mi> <mo>+</mo> <mn>1</mn> </mrow> <mrow> <mi>r</mi> <mo>+</mo> <mn>1</mn> </mrow> </msubsup> </mtd> </mtr> </mtable> </mfenced> </mrow> </math>

<math> <mrow> <mo>=</mo> <mi>BlockDiag</mi> <mfenced open='{' close='}'> <mtable> <mtr> <mtd> <msubsup> <mi>X</mi> <mrow> <msub> <mi>n</mi> <mn>1</mn> </msub> <mo>,</mo> <mn>1</mn> </mrow> <mi>r</mi> </msubsup> </mtd> <mtd> <mi>&Lambda;</mi> </mtd> <mtd> <msubsup> <mi>X</mi> <msub> <mi>n</mi> <mrow> <msub> <mi>i</mi> <mn>0</mn> </msub> <mo>-</mo> <mn>1</mn> <mo>,</mo> <msub> <mi>i</mi> <mn>0</mn> </msub> <mo>-</mo> <mn>1</mn> </mrow> </msub> <mi>r</mi> </msubsup> </mtd> <mtd> <msubsup> <mi>X</mi> <mrow> <msub> <mi>i</mi> <mn>0</mn> </msub> <mo>,</mo> <mi>a</mi> </mrow> <mi>r</mi> </msubsup> </mtd> <mtd> <msubsup> <mi>X</mi> <mrow> <msub> <mi>i</mi> <mn>0</mn> </msub> <mo>,</mo> <mi>b</mi> </mrow> <mi>r</mi> </msubsup> </mtd> <mtd> <msubsup> <mi>X</mi> <mrow> <msub> <mi>n</mi> <mrow> <msub> <mi>i</mi> <mn>0</mn> </msub> <mo>+</mo> <mn>1</mn> </mrow> </msub> <mo>,</mo> <msub> <mi>i</mi> <mn>0</mn> </msub> <mo>+</mo> <mn>1</mn> </mrow> <mi>r</mi> </msubsup> </mtd> <mtd> <mi>&Lambda;</mi> </mtd> <mtd> <msubsup> <mi>X</mi> <mrow> <msub> <mi>n</mi> <mi>r</mi> </msub> <mo>,</mo> <mi>r</mi> </mrow> <mi>r</mi> </msubsup> </mtd> </mtr> </mtable> </mfenced> </mrow> </math>

$X_{n_k,k}^{r+1}=X_{n_k,k}^r$ When k < i₀Time of flight

$X_{n_k,k}^{r+1}=X_{n_{k-1},k-1}^r$ When k > i₀At +1 time

That is to say that the first and second electrodes,

$X_{n_{i_0},i}^{r+1}=X_{i_0,a}^r$

$X_{n_{i_0+1},i_0+1}^{r+1}=X_{i_0,b}^r$

that is, the precoding matrix C of rank r^rI th of (1)₀The column vector corresponding to the diagonal elements of the block is divided into 2 column vectors and summed with a precoding matrix C of rank r^rExcept for the ith₀The remaining column vectors outside the diagonal elements of the block together form a precoding matrix C of rank r +1^r+1。

The above precoding matrix C with the rank r^rComputing a precoding matrix C with rank r +1^r+1The following can be realized: when calculating the equivalent channel corresponding to the precoding matrix with the rank r +1, the intermediate calculation result of the equivalent channel corresponding to the precoding matrix with the rank r can be utilized, thereby saving the calculation overhead.

For example, taking the multi-antenna system with the following row 8 transmission 2 reception as an example, the physical channels are:

$\left[\begin{array}{cccc}{h}_{11}& L& & h_{18}\\ h_{21}& L& & h_{28}\end{array}\right].$

if a precoding matrix with rank 1 is adopted, the 2x1 equivalent channel at the receiving end is:

<math> <mrow> <mfenced open='[' close=']'> <mtable> <mtr> <mtd> <msub> <mi>h</mi> <mn>11</mn> </msub> </mtd> <mtd> <mi>L</mi> </mtd> <mtd> </mtd> <mtd> <msub> <mi>h</mi> <mn>18</mn> </msub> </mtd> </mtr> <mtr> <mtd> <msub> <mi>h</mi> <mn>21</mn> </msub> </mtd> <mtd> <mi>L</mi> </mtd> <mtd> </mtd> <mtd> <msub> <mi>h</mi> <mn>28</mn> </msub> </mtd> </mtr> </mtable> </mfenced> <msubsup> <mi>X</mi> <mn>8,1</mn> <mn>1</mn> </msubsup> <mo>=</mo> <mfenced open='[' close=']'> <mtable> <mtr> <mtd> <msub> <mi>h</mi> <mrow> <mn>1,1</mn> <mo>-</mo> <mn>4</mn> </mrow> </msub> </mtd> <mtd> <msub> <mi>h</mi> <mrow> <mn>1,5</mn> <mo>-</mo> <mn>8</mn> </mrow> </msub> </mtd> </mtr> <mtr> <mtd> <msub> <mi>h</mi> <mrow> <mn>2,1</mn> <mo>-</mo> <mn>4</mn> </mrow> </msub> </mtd> <mtd> <msub> <mi>h</mi> <mrow> <mn>2,5</mn> <mo>-</mo> <mn>8</mn> </mrow> </msub> </mtd> </mtr> </mtable> </mfenced> <mfenced open='[' close=']'> <mtable> <mtr> <mtd> <msubsup> <mi>X</mi> <mrow> <mn>1</mn> <mo>,</mo> <mi>a</mi> </mrow> <mn>1</mn> </msubsup> </mtd> </mtr> <mtr> <mtd> <msubsup> <mi>&alpha;X</mi> <mrow> <mn>1</mn> <mo>,</mo> <mi>b</mi> </mrow> <mn>1</mn> </msubsup> </mtd> </mtr> </mtable> </mfenced> <mo>=</mo> <mfenced open='[' close=']'> <mtable> <mtr> <mtd> <msub> <mi>h</mi> <mrow> <mn>1,1</mn> <mo>-</mo> <mn>4</mn> </mrow> </msub> <msubsup> <mi>X</mi> <mrow> <mn>1</mn> <mo>,</mo> <mi>a</mi> </mrow> <mn>1</mn> </msubsup> <mo>+</mo> <msub> <mi>&alpha;h</mi> <mrow> <mn>1,5</mn> <mo>-</mo> <mn>8</mn> </mrow> </msub> <msubsup> <mi>X</mi> <mrow> <mn>1</mn> <mo>,</mo> <mi>b</mi> </mrow> <mn>1</mn> </msubsup> </mtd> </mtr> <mtr> <mtd> <msub> <mi>h</mi> <mrow> <mn>2,1</mn> <mo>-</mo> <mn>4</mn> </mrow> </msub> <msubsup> <mi>X</mi> <mrow> <mn>1</mn> <mo>,</mo> <mi>a</mi> </mrow> <mn>1</mn> </msubsup> <mo>+</mo> <msub> <mi>&alpha;h</mi> <mrow> <mn>2,5</mn> <mo>-</mo> <mn>8</mn> </mrow> </msub> <msubsup> <mi>X</mi> <mrow> <mn>1</mn> <mo>,</mo> <mi>b</mi> </mrow> <mn>1</mn> </msubsup> </mtd> </mtr> </mtable> </mfenced> <mtext>;</mtext> </mrow> </math>

wherein: h is_i，m-n＝[h_i，m L h_i，n]，i＝1，2。

If a precoding matrix with rank 2 is adopted, the 2x2 equivalent channel at the receiving end is:

$\left[\begin{array}{cc}{h}_{\mathrm{1,1}-4}& h_{\mathrm{1,5}-8}\\ h_{\mathrm{2,1}-4}& h_{\mathrm{2,5}-8}\end{array}\right]\mathrm{BlockDiag}\left(\begin{array}{cc}{X}_{1,a}^1& X_{1,b}^1\end{array}\right)=\left[\begin{array}{cc}{h}_{\mathrm{1,1}-4}{X}_{1,a}^1& h_{\mathrm{1,5}-8}{X}_{1,b}^1\\ h_{\mathrm{2,1}-4}{X}_{1,a}^1& h_{\mathrm{2,5}-8}{X}_{1,b}^1\end{array}\right]$

at this time, the rank is 2 precoding matrix $\mathrm{BlockDiag}\left(\begin{array}{cc}{X}_{1,a}^1& X_{1,b}^1\end{array}\right)$ Is formed by a precoding matrix of rank 1And the components are divided and combined.

As can be seen from the above, when calculating the equivalent channel corresponding to the precoding matrix with rank 2, the intermediate calculation result of the equivalent channel corresponding to the precoding matrix with rank 1 can be used Andalternatively, the equivalent channel corresponding to the precoding matrix with rank 1 may be obtained by performing a simple operation (addition and subtraction) on the equivalent channel corresponding to the precoding matrix with rank 2, such as: <math> <mrow> <msub> <mi>h</mi> <mrow> <mn>1,1</mn> <mo>-</mo> <mn>4</mn> </mrow> </msub> <msubsup> <mi>X</mi> <mrow> <mn>1</mn> <mo>,</mo> <mi>a</mi> </mrow> <mn>1</mn> </msubsup> <mo>+</mo> <mi>&alpha;</mi> <msub> <mi>h</mi> <mrow> <mn>1,5</mn> <mo>-</mo> <mn>8</mn> </mrow> </msub> <msubsup> <mi>X</mi> <mrow> <mn>1</mn> <mo>,</mo> <mi>b</mi> </mrow> <mn>1</mn> </msubsup> <mo>,</mo> <msub> <mi>h</mi> <mrow> <mn>2,1</mn> <mo>-</mo> <mn>4</mn> </mrow> </msub> <msubsup> <mi>X</mi> <mrow> <mn>1</mn> <mo>,</mo> <mi>a</mi> </mrow> <mn>1</mn> </msubsup> <mo>+</mo> <mi>&alpha;</mi> <msub> <mi>h</mi> <mrow> <mn>2,5</mn> <mo>-</mo> <mn>8</mn> </mrow> </msub> <msubsup> <mi>X</mi> <mrow> <mn>1</mn> <mo>,</mo> <mi>b</mi> </mrow> <mn>1</mn> </msubsup> <mo>.</mo> </mrow> </math> implementation savings in computational overhead are achieved.

This embodiment passes through a precoding matrix C of rank r^rCalculating to obtain a precoding matrix C with the rank r +1^r+1The computational overhead can be saved.

Fig. 3 is a flowchart illustrating another embodiment of calculating a precoding matrix in the embodiment of the present invention, where an application scenario of the embodiment may be: the dual-polarized 8-degree antenna array has no loss of generality, and is assumed that antenna ports 1-4 are one group of antenna array elements with vertical polarization (or horizontal polarization, or + 45-degree polarization or-45-degree polarization), and antenna ports 5-8 are another group of antenna array elements with corresponding horizontal polarization (or vertical polarization, or-45-degree polarization or + 45-degree polarization). The embodiment comprises the following steps:

step 31: a DFT vector of length n is calculated.

The calculation formula is as follows: x (n) ═ 1 e^jθ Λ e^j(n-1)θ]^T

Step 32: and constructing each precoding matrix based on the DFT vector with the length of n.

The calculation formula may be:

rank 1 precoding matrix <math> <mrow> <msup> <mi>C</mi> <mn>1</mn> </msup> <mo>=</mo> <mfenced open='[' close=']'> <mtable> <mtr> <mtd> <msub> <mi>X</mi> <mn>4</mn> </msub> <mrow> <mo>(</mo> <mi>&theta;</mi> <mo>)</mo> </mrow> </mtd> </mtr> <mtr> <mtd> <mi>&alpha;</mi> <msub> <mi>X</mi> <mn>4</mn> </msub> <mrow> <mo>(</mo> <mi>&theta;</mi> <mo>)</mo> </mrow> </mtd> </mtr> </mtable> </mfenced> </mrow> </math>

Where α is a complex number modulo 1, e.g., α ∈ {1 j-1-j }, or, <math> <mrow> <mi>&alpha;</mi> <mo>&Element;</mo> <mfenced open='{' close='}'> <mtable> <mtr> <mtd> <mn>1</mn> </mtd> <mtd> <msup> <mi>e</mi> <mrow> <mi>j</mi> <mfrac> <mi>&pi;</mi> <mn>4</mn> </mfrac> </mrow> </msup> </mtd> <mtd> <msup> <mi>e</mi> <mrow> <mi>j</mi> <mfrac> <mrow> <mn>2</mn> <mi>&pi;</mi> </mrow> <mn>4</mn> </mfrac> </mrow> </msup> </mtd> <mtd> <msup> <mi>e</mi> <mrow> <mi>j</mi> <mfrac> <mrow> <mn>3</mn> <mi>&pi;</mi> </mrow> <mn>4</mn> </mfrac> </mrow> </msup> </mtd> <mtd> <msup> <mi>e</mi> <mrow> <mi>j</mi> <mfrac> <mrow> <mn>4</mn> <mi>&pi;</mi> </mrow> <mn>4</mn> </mfrac> </mrow> </msup> </mtd> <mtd> <msup> <mi>e</mi> <mrow> <mi>j</mi> <mfrac> <mrow> <mn>5</mn> <mi>&pi;</mi> </mrow> <mn>4</mn> </mfrac> </mrow> </msup> </mtd> <mtd> <msup> <mi>e</mi> <mrow> <mi>j</mi> <mfrac> <mrow> <mn>6</mn> <mi>&pi;</mi> </mrow> <mn>4</mn> </mfrac> </mrow> </msup> </mtd> <mtd> <msup> <mi>e</mi> <mrow> <mi>j</mi> <mfrac> <mrow> <mn>7</mn> <mi>&pi;</mi> </mrow> <mn>4</mn> </mfrac> </mrow> </msup> </mtd> </mtr> </mtable> </mfenced> <mo>.</mo> </mrow> </math>

rank 2 precoding matrix C²＝BlockDiag(X₄(θ₁) X₄(θ₂))

Wherein, theta₁And theta₂May be the same or different.

Rank 3 precoding matrix C³＝BlockDiag(X₄(θ₁) X₂(θ₂) X₂(θ₃))

Wherein, theta₁、θ₂And theta₃May be the same or different.

Rank 4 precoding matrix C⁴＝BlockDiag(X₂(θ₁) X₂(θ₂) X₂(θ₃) X₂(θ₄))

Wherein, theta₁、θ₂、θ₃And theta₄May be the same or different.

Rank 5 precoding matrix C⁵＝BlockDiag(X₁(θ₁) X₁(θ₂) X₂(θ₃) X₂(θ₄) X₂(θ₅))

Wherein, theta₁、θ₂、θ₃、θ₄And theta₅May be the same or different.

Rank 6 precoding matrix

C⁶＝BlockDiag(X₁(θ₁) X₁(θ₂) X₁(θ₃) X₁(θ₄) X₂(θ₅) X₂(θ₆))

Wherein, theta₁、θ₂、θ₃、θ₄、θ₅And theta₆May be the same or different.

Rank 7 precoding matrix

C⁷＝BlockDiag(X₁(θ₁) X₁(θ₂) X₁(θ₃) X₁(θ₄) X₁(θ₅) X₁(θ₆) X₂(θ₇))

Wherein, theta₁、θ₂、θ₃、θ₄、θ₅、θ₆And theta₇May be the same or different.

The embodiment can simply determine the precoding matrix through the DFT vector.

Fig. 4 is a flowchart illustrating a process of calculating a precoding matrix according to another embodiment of the present invention, which includes:

step 41: obtaining a known rank r precoding matrix C^r。

For example, the method shown in fig. 2 or fig. 3 is used to obtain a precoding matrix C with rank r^rAn expression pattern of, e.g. C^r＝A。

Step 42: for a known rank r precoding matrix C^rCarrying out any row transformation to obtain a matrix after row transformation, and adding the matrix after row transformation to a precoding matrix C with the rank r^rIn the codebook of (1).

I.e. a precoding matrix C of rank r^rThe method also comprises the following steps: ii, wherein ii is the corresponding row transformation matrix.

In this embodiment, the pre-coding matrix is subjected to row transformation, and the matrix after the row transformation is still in the codebook corresponding to the rank, so that the richness of the pre-coding matrix is realized.

Fig. 5 is a schematic structural diagram of a signal processing apparatus according to a second embodiment of the present invention, where the apparatus is an apparatus for performing the precoding method, and the apparatus may be a terminal, for example, a UE, or a relay station. The apparatus may include a precoding module 51 and a transmitting module 52; the precoding module 51 is configured to precode the transmission signals by using a precoding matrix, so that at most one spatial layer signal is transmitted on each transmission antenna, and the same codeword is mapped to spatial layers with similar quality, where the spatial layers with similar quality refer to spatial layers with a difference value of the number of corresponding non-zero elements between the spatial layers within a set range; the transmitting module 52 is configured to transmit the transmission signal precoded by the precoding module by using 8 transmitting antennas.

The precoding matrix adopted by the precoding module is a precoding matrix C with the rank r^rSaid C is^rIs a block diagonal matrix, and said C^rContains at most one non-zero element per line, and, C^rIs set to satisfy at least one of the following conditions:

when r is 2, the first and second spatial layers respectively contain 4 non-zero elements;

when r is 3, the first spatial layer includes 4 non-zero elements, and the second and third spatial layers include 2 non-zero elements, respectively;

when r is 4, the first, second, third and fourth spatial layers respectively contain 2 non-zero elements;

when r is 5, the first and second spatial layers respectively include 1 non-zero element, and the third, fourth, and fifth spatial layers respectively include 2 non-zero elements;

when r is 6, the first, second, third and fourth spatial layers respectively include 1 non-zero element, and the fifth and sixth spatial layers respectively include 2 non-zero elements;

when r is 7, the first, second, third, fourth, fifth and sixth spatial layers respectively include 1 non-zero element, and the seventh spatial layer includes 2 non-zero elements.

The apparatus provided in this embodiment may further include: a calculation module for calculating a precoding matrix, the calculation module being specifically configured to: by a precoding matrix C of rank r^rCalculating to obtain a precoding matrix C with the rank r +1^r+1(ii) a Or, a precoding matrix is obtained by calculation based on a DFT vector with the length of n; alternatively, a precoding matrix C of rank r^rThe method comprises the following steps: for the obtained precoding matrix C with the rank r^rAnd carrying out random row transformation to obtain a matrix. The pre-coding module is specifically configured to: using the computing moduleThe resulting precoding matrix precodes the transmitted signal.

In this embodiment, by using the precoding matrix satisfying the above conditions, the support for transmitting signals from 8 transmitting antennas can be realized. Wherein each row of the precoding matrix comprises at most one non-zero element. At most one spatial layer signal can be transmitted on each transmitting antenna, and the CM value of the transmitting baseband signal is not increased after the precoding matrix is used in the SC-FDMA system. Each code word is mapped to a spatial layer with similar quality as much as possible through a precoding matrix, so that the accuracy of the AMC of each code word is improved.

Fig. 6 is a schematic flow chart of a signal processing method according to a third embodiment of the present invention, including:

step 61: the receiving end receives a pre-coded transmitting signal transmitted by the transmitting end by adopting 8 transmitting antennas;

the receiving end may be a base station, for example, an eNodeB.

Step 62: the receiving end obtains an equivalent channel estimation value according to the precoding matrix, and processes the received signal according to the equivalent channel estimation value to obtain an estimation value of the transmitting signal;

the precoding matrix is predetermined with a transmitting end, so that the transmitting end performs precoding by using the precoding matrix to transmit at most one spatial layer signal on each transmitting antenna, and maps the same codeword onto spatial layers with similar quality, where the spatial layers with similar quality refer to spatial layers in a setting range of a difference value of the number of corresponding non-zero elements between the spatial layers.

For a precoding matrix C of rank r^rSaid C is^rIs a block diagonal matrix, and said C^rContains at most one non-zero element per line, and, C^rIs set to satisfy at least one of the following conditions:

when r is 2, the first and second spatial layers respectively contain 4 non-zero elements;

when r is 3, the first spatial layer includes 4 non-zero elements, and the second and third spatial layers include 2 non-zero elements, respectively;

when r is 4, the first, second, third and fourth spatial layers respectively contain 2 non-zero elements;

when r is 5, the first and second spatial layers respectively include 1 non-zero element, and the third, fourth, and fifth spatial layers respectively include 2 non-zero elements;

when r is 6, the first, second, third and fourth spatial layers respectively include 1 non-zero element, and the fifth and sixth spatial layers respectively include 2 non-zero elements;

when r is 7, the first, second, third, fourth, fifth and sixth spatial layers respectively include 1 non-zero element, and the seventh spatial layer includes 2 non-zero elements.

The precoding matrix described above may be determined as follows:

by a precoding matrix C of rank r^rCalculating to obtain a precoding matrix C with the rank r +1^r+1(ii) a Or,

calculating to obtain a precoding matrix based on the DFT vector with the length of n; or,

rank r precoding matrix C^rThe method comprises the following steps: for the obtained precoding matrix C with the rank r^rAnd carrying out random row transformation to obtain a matrix.

In this embodiment, by using the precoding matrix satisfying the above conditions, the support for transmitting signals from 8 transmitting antennas can be realized. Wherein each row of the precoding matrix comprises at most one non-zero element. At most one spatial layer signal can be transmitted on each transmitting antenna, and the CM value of the transmitting baseband signal is not increased after the precoding matrix is used in the SC-FDMA system. Each code word is mapped to a spatial layer with similar quality as much as possible through a precoding matrix, so that the accuracy of the AMC of each code word is improved.

Fig. 7 is a schematic structural diagram of a base station according to a fourth embodiment of the present invention, where the base station may be a base station that executes the method shown in fig. 6, and the base station includes: a receiving module 71 and a processing module 72; the receiving module 71 is configured to receive a precoded transmission signal transmitted by a transmitting end through 8 transmitting antennas; the processing module 72 is configured to obtain an equivalent channel estimation value according to the precoding matrix, and process the signal received by the receiving module according to the equivalent signal estimation value to obtain an estimation value of the transmitted signal; the precoding matrix is predetermined with a transmitting end, so that the transmitting end performs precoding by using the precoding matrix to transmit at most one spatial layer signal on each transmitting antenna, and maps the same codeword onto spatial layers with similar quality, where the spatial layers with similar quality refer to spatial layers in a setting range of a difference value of the number of corresponding non-zero elements between the spatial layers.

Precoding matrix C for rank r employed by the processing module^rSaid C is^rIs a block diagonal matrix, and said C^rContains at most one non-zero element per line, and, C^rIs set to satisfy at least one of the following conditions:

when r is 2, the first and second spatial layers respectively contain 4 non-zero elements;

when r is 3, the first spatial layer includes 4 non-zero elements, and the second and third spatial layers include 2 non-zero elements, respectively;

when r is 4, the first, second, third and fourth spatial layers respectively contain 2 non-zero elements;

when r is 5, the first and second spatial layers respectively include 1 non-zero element, and the third, fourth, and fifth spatial layers respectively include 2 non-zero elements;

when r is 6, the first, second, third and fourth spatial layers respectively include 1 non-zero element, and the fifth and sixth spatial layers respectively include 2 non-zero elements;

when r is 7, the first, second, third, fourth, fifth and sixth spatial layers respectively include 1 non-zero element, and the seventh spatial layer includes 2 non-zero elements.

The precoding matrix adopted by the processing module is obtained by adopting the following method:

by a precoding matrix C of rank r^rCalculating to obtain a precoding matrix C with the rank r +1^r+1(ii) a Or,

calculating to obtain a precoding matrix based on the DFT vector with the length of n; or,

rank r precoding matrix C^rThe method comprises the following steps: for the obtained precoding matrix C with the rank r^rAnd carrying out random row transformation to obtain a matrix.

In this embodiment, by using the precoding matrix satisfying the above conditions, the support for transmitting signals from 8 transmitting antennas can be realized. Wherein each row of the precoding matrix comprises at most one non-zero element. At most one spatial layer signal can be transmitted on each transmitting antenna, and the CM value of the transmitting baseband signal is not increased after the precoding matrix is used in the SC-FDMA system. Each code word is mapped to a spatial layer with similar quality as much as possible through a precoding matrix, so that the accuracy of the AMC of each code word is improved.

It will be appreciated that the relevant features of the method and apparatus described above are referred to one another. In addition, "first", "second", and the like in the above embodiments are for distinguishing the embodiments, and do not represent merits of the embodiments.

Those of ordinary skill in the art will understand that: all or part of the steps for realizing the method embodiments can be completed by hardware related to program instructions, the program can be stored in a computer readable storage medium, and the program executes the steps comprising the method embodiments when executed; and the aforementioned storage medium includes: various media that can store program codes, such as ROM, RAM, magnetic or optical disks.

Finally, it should be noted that: the above examples are only intended to illustrate the technical solution of the present invention, but not to limit it; although the present invention has been described in detail with reference to the foregoing embodiments, it will be understood by those of ordinary skill in the art that: the technical solutions described in the foregoing embodiments may still be modified, or some technical features may be equivalently replaced; and such modifications or substitutions do not depart from the spirit and scope of the corresponding technical solutions of the embodiments of the present invention.

Claims (14)

1. A precoding method supporting 8 transmit antennas, comprising:

precoding the transmitting signals by adopting a precoding matrix, so that at most one spatial layer signal is transmitted on each transmitting antenna, and the same code word is mapped to spatial layers with similar quality, wherein the spatial layers with the similar quality refer to the spatial layers with the difference value of the number of corresponding non-zero elements between the spatial layers within a setting range;

transmitting the precoded transmission signals by adopting 8 transmission antennas;

rank r +1 precoding matrix C^r+1Wherein part or all of the precoding matrices are precoding matrices C according to a rank r^rCalculating to obtain;

by a precoding matrix C of rank r^rCalculating to obtain a precoding matrix C with the rank r +1^r+1The calculation formula is as follows:

<math> <mfenced open='' close=''> <mtable> <mtr> <mtd> <msup> <mi>C</mi> <mrow> <mi>r</mi> <mo>+</mo> <mn>1</mn> </mrow> </msup> <mo>=</mo> <mi>BlockDiag</mi> <mfenced open='{ ' close='}'> <mtable> <mtr> <mtd> <msubsup> <mi>X</mi> <mrow> <msub> <mi>n</mi> <mrow> <mi></mi> <mn>1</mn> </mrow> </msub> <mo>,</mo> <mi></mi> <mn>1</mn> <mi></mi> </mrow> <mrow> <mi>r</mi> <mo>+</mo> <mn>1</mn> </mrow> </msubsup> </mtd> <mtd> <mo>&CenterDot;</mo> <mo>&CenterDot;</mo> <mo>&CenterDot;</mo> </mtd> <mtd> <msubsup> <mi>X</mi> <mrow> <mi></mi> <msub> <mi>n</mi> <mrow> <msub> <mi>i</mi> <mn>0</mn> </msub> <mo>-</mo> <mn>1</mn> <mo>,</mo> <mi></mi> <msub> <mi>i</mi> <mn>0</mn> </msub> <mo>-</mo> <mn>1</mn> <mi></mi> </mrow> </msub> <mi></mi> </mrow> <mrow> <mi>r</mi> <mo>+</mo> <mn>1</mn> </mrow> </msubsup> </mtd> <mtd> <mi></mi> <msubsup> <mi>X</mi> <mrow> <msub> <mi>n</mi> <mrow> <mi></mi> <msub> <mi>i</mi> <mn>0</mn> </msub> </mrow> </msub> <mo>,</mo> <msub> <mi>i</mi> <mn>0</mn> </msub> <mi></mi> </mrow> <mrow> <mi>r</mi> <mo>+</mo> <mn>1</mn> </mrow> </msubsup> </mtd> <mtd> <msubsup> <mi>X</mi> <mrow> <msub> <mi>n</mi> <mrow> <msub> <mi>i</mi> <mn>0</mn> </msub> <mo>+</mo> <mn>1</mn> </mrow> </msub> <mo>,</mo> <msub> <mi>i</mi> <mn>0</mn> </msub> <mo>+</mo> <mi></mi> <mn>1</mn> </mrow> <mrow> <mi>r</mi> <mo>+</mo> <mn>1</mn> </mrow> </msubsup> </mtd> <mtd> <msubsup> <mi>X</mi> <mrow> <msub> <mi>n</mi> <mrow> <msub> <mi>i</mi> <mrow> <mn>0</mn> <mi></mi> </mrow> </msub> <mo>+</mo> <mn>2</mn> </mrow> </msub> <mo>,</mo> <msub> <mi>i</mi> <mn>0</mn> </msub> <mo>+</mo> <mn>2</mn> </mrow> <mrow> <mi>r</mi> <mo>+</mo> <mn>1</mn> <mi></mi> </mrow> </msubsup> </mtd> <mtd> <mo>&CenterDot;</mo> <mo>&CenterDot;</mo> <mo>&CenterDot;</mo> </mtd> <mtd> <msubsup> <mi>X</mi> <mrow> <msub> <mi>n</mi> <mrow> <mi>r</mi> <mo>+</mo> <mn>1</mn> </mrow> </msub> <mo>,</mo> <mi>r</mi> <mo>+</mo> <mn>1</mn> </mrow> <mrow> <mi>r</mi> <mo>+</mo> <mn>1</mn> </mrow> </msubsup> </mtd> </mtr> </mtable> </mfenced> </mtd> </mtr> <mtr> <mtd> <mo>=</mo> <mi>BlockDiag</mi> <mfenced open=' {' close='}'> <mtable> <mtr> <mtd> <msubsup> <mi>X</mi> <mrow> <msub> <mi>n</mi> <mrow> <mi></mi> <mn>1</mn> <mi></mi> </mrow> </msub> <mn>1</mn> <mi></mi> </mrow> <mi>r</mi> </msubsup> </mtd> <mtd> <mo>&CenterDot;</mo> <mo>&CenterDot;</mo> <mo>&CenterDot;</mo> </mtd> <mtd> <msubsup> <mi>X</mi> <msub> <mi>n</mi> <mrow> <msub> <mi>i</mi> <mn>0</mn> </msub> <mi></mi> <mo>-</mo> <mn>1</mn> <mi></mi> <mo>,</mo> <msub> <mi>i</mi> <mn>0</mn> </msub> <mo>-</mo> <mn>1</mn> </mrow> </msub> <mi>r</mi> </msubsup> </mtd> <mtd> <mi></mi> <msubsup> <mi>X</mi> <mrow> <msub> <mi>i</mi> <mn>0</mn> </msub> <mo>,</mo> <mi>a</mi> </mrow> <mi>r</mi> </msubsup> </mtd> <mtd> <msubsup> <mi>X</mi> <mrow> <msub> <mi>i</mi> <mn>0</mn> </msub> <mo>,</mo> <mi>b</mi> </mrow> <mi>r</mi> </msubsup> </mtd> <mtd> <msubsup> <mi>X</mi> <mrow> <msub> <mi>n</mi> <mrow> <msub> <mi>i</mi> <mn>0</mn> </msub> <mo>+</mo> <mi></mi> <mn>1</mn> </mrow> </msub> <mo>,</mo> <msub> <mi>i</mi> <mn>0</mn> </msub> <mo>+</mo> <mn>1</mn> <mi></mi> </mrow> <mi>r</mi> </msubsup> </mtd> <mtd> <mo>&CenterDot;</mo> <mo>&CenterDot;</mo> <mo>&CenterDot;</mo> </mtd> <mtd> <mi></mi> <msubsup> <mi>X</mi> <mrow> <msub> <mi>n</mi> <mi>r</mi> </msub> <mo>,</mo> <mi>r</mi> </mrow> <mi>r</mi> </msubsup> </mtd> </mtr> </mtable> </mfenced> </mtd> </mtr> </mtable> </mfenced> </math>

wherein,

<math> <mrow> <msubsup> <mi>X</mi> <mrow> <msub> <mi>n</mi> <msub> <mi>i</mi> <mn>0</mn> </msub> </msub> <mo>,</mo> <msub> <mi>i</mi> <mn>0</mn> </msub> </mrow> <mi>r</mi> </msubsup> <mo>=</mo> <mfenced open='[' close=']'> <mtable> <mtr> <mtd> <msubsup> <mi>X</mi> <mrow> <msub> <mi>i</mi> <mn>0</mn> </msub> <mo>,</mo> <mi>a</mi> </mrow> <mi>r</mi> </msubsup> </mtd> </mtr> <mtr> <mtd> <mi>&alpha;</mi> <msubsup> <mi>X</mi> <mrow> <msub> <mi>i</mi> <mn>0</mn> </msub> <mo>,</mo> <mi>b</mi> </mrow> <mi>r</mi> </msubsup> </mtd> </mtr> </mtable> </mfenced> <mo>;</mo> </mrow> </math>

indicating a length of n in the ith column of the precoding matrix of rank r_iI-1, …, r, α is a complex number, for ensuring thatIs 1.

2. Method according to claim 1, characterized in that for a precoding matrix C of rank r^rSaid C is^rIs a block diagonal matrix, and said C^rContains at most one non-zero element per line, and, C^rIs set to satisfy at least one of the following conditions:

when r is 2, the first and second spatial layers respectively contain 4 non-zero elements;

when r is 3, the first spatial layer includes 4 non-zero elements, and the second and third spatial layers include 2 non-zero elements, respectively;

when r is 4, the first, second, third and fourth spatial layers respectively contain 2 non-zero elements;

when r is 5, the first and second spatial layers respectively include 1 non-zero element, and the third, fourth, and fifth spatial layers respectively include 2 non-zero elements;

when r is 6, the first, second, third and fourth spatial layers respectively include 1 non-zero element, and the fifth and sixth spatial layers respectively include 2 non-zero elements;

when r is 7, the first, second, third, fourth, fifth and sixth spatial layers respectively include 1 non-zero element, and the seventh spatial layer includes 2 non-zero elements.

3. Method according to claim 1 or 2, characterized in that the precoding matrix C with rank r^rIs calculated based on the length n DFT vector.

4. The method of claim 3, wherein the precoding matrix is calculated as:

rank 1 precoding matrix <math> <mrow> <msup> <mi>C</mi> <mn>1</mn> </msup> <mo>=</mo> <mfenced open='[' close=']'> <mtable> <mtr> <mtd> <msub> <mi>X</mi> <mn>4</mn> </msub> <mrow> <mo>(</mo> <mi>&theta;</mi> <mo>)</mo> </mrow> </mtd> </mtr> <mtr> <mtd> <mi>&alpha;</mi> <msub> <mi>X</mi> <mn>4</mn> </msub> <mrow> <mo>(</mo> <mi>&theta;</mi> <mo>)</mo> </mrow> </mtd> </mtr> </mtable> </mfenced> </mrow> </math>

Wherein α is a complex number modulo 1;

rank 2 precoding matrix C²＝BlockDiag(X₄(θ₁) X₄(θ₂))

Wherein, theta₁And theta₂May be the same or different;

rank 3 precoding matrix C³＝BlockDiag(X₄(θ₁) X₂(θ₂) X₂(θ₃))

Wherein, theta₁、θ₂And theta₃May be the same or different;

rank 4 precoding matrix C⁴＝BlockDiag(X₂(θ₁) X₂(θ₂) X₂(θ₃) X₂(θ₄))

Wherein, theta₁、θ₂、θ₃And theta₄May be the same or different;

rank 5 precoding matrix C⁵＝BlockDiag(X₁(θ₁) X₁(θ₂) X₂(θ₃) X₂(θ₄) X₂(θ₅))

Wherein, theta₁、θ₂、θ₃、θ₄And theta₅May be the same or different;

rank 6 precoding matrix

C⁶＝BlockDiag(X₁(θ₁) X₁(θ₂) X₁(θ₃) X₁(θ₄) X₂(θ₅) X₂(θ₆))

Wherein, theta₁、θ₂、θ₃、θ₄、θ₅And theta₆May be the same or different;

rank 7 precoding matrix

C⁷＝BlockDiag(X₁(θ₁) X₁(θ₂) X₁(θ₃) X₁(θ₄) X₁(θ₅) X₁(θ₆) X₂(θ₇))

Wherein, theta₁、θ₂、θ₃、θ₄、θ₅、θ₆And theta₇May be the same or different;

wherein, X_n(θ)＝[1e^jθ … e^j(n-1)θ]^T。

5. Method according to claim 1 or 2, characterized in that the precoding matrix C with rank r^rThe method comprises the following steps: for the obtained precoding matrix C with the rank r^rAnd carrying out random row transformation to obtain a matrix.

6. A signal processing apparatus, characterized by comprising:

the precoding module is used for precoding the transmitting signals by adopting a precoding matrix, so that at most one spatial layer signal is transmitted on each transmitting antenna, and the same code word is mapped to spatial layers with similar quality, wherein the spatial layers with the similar quality refer to the spatial layers with the difference value of the number of corresponding non-zero elements between the spatial layers within a set range;

the transmitting module is used for transmitting the transmitting signals which are precoded by the precoding module by adopting 8 transmitting antennas;

further comprising: a calculation module for calculating a precoding matrix, the calculation module being specifically configured to:

by a precoding matrix C of rank r^rCalculating to obtain a precoding matrix C with the rank r +1^r+1(ii) a By a precoding matrix C of rank r^rCalculating to obtain a precoding matrix C with the rank r +1^r+1The calculation formula is as follows:

<math> <mfenced open='' close=''> <mtable> <mtr> <mtd> <msup> <mi>C</mi> <mrow> <mi>r</mi> <mo>+</mo> <mn>1</mn> </mrow> </msup> <mo>=</mo> <mi>BlockDiag</mi> <mfenced open='{ ' close='}'> <mtable> <mtr> <mtd> <msubsup> <mi>X</mi> <mrow> <msub> <mi>n</mi> <mn>1</mn> </msub> <mo>,</mo> <mi></mi> <mn>1</mn> <mi></mi> </mrow> <mrow> <mi>r</mi> <mo>+</mo> <mn>1</mn> </mrow> </msubsup> </mtd> <mtd> <mo>&CenterDot;</mo> <mo>&CenterDot;</mo> <mo>&CenterDot;</mo> </mtd> <mtd> <msubsup> <mi>X</mi> <mrow> <mi></mi> <msub> <mi>n</mi> <mrow> <msub> <mi>i</mi> <mn>0</mn> </msub> <mo>-</mo> <mn>1</mn> <mo>,</mo> <msub> <mi>i</mi> <mn>0</mn> </msub> <mo>-</mo> <mn>1</mn> <mi></mi> </mrow> </msub> <mi></mi> </mrow> <mrow> <mi>r</mi> <mo>+</mo> <mn>1</mn> </mrow> </msubsup> </mtd> <mtd> <mi></mi> <msubsup> <mi>X</mi> <mrow> <msub> <mi>n</mi> <msub> <mi>i</mi> <mn>0</mn> </msub> </msub> <mo>,</mo> <msub> <mi>i</mi> <mn>0</mn> </msub> <mi></mi> </mrow> <mrow> <mi>r</mi> <mo>+</mo> <mn>1</mn> </mrow> </msubsup> </mtd> <mtd> <msubsup> <mi>X</mi> <mrow> <msub> <mi>n</mi> <mrow> <msub> <mi>i</mi> <mn>0</mn> </msub> <mo>+</mo> <mn>1</mn> </mrow> </msub> <mo>,</mo> <msub> <mi>i</mi> <mn>0</mn> </msub> <mo>+</mo> <mi></mi> <mn>1</mn> </mrow> <mrow> <mi>r</mi> <mo>+</mo> <mn>1</mn> </mrow> </msubsup> </mtd> <mtd> <msubsup> <mi>X</mi> <mrow> <msub> <mi>n</mi> <mrow> <msub> <mi>i</mi> <mn>0</mn> </msub> <mo>+</mo> <mn>2</mn> </mrow> </msub> <mo>,</mo> <msub> <mi>i</mi> <mn>0</mn> </msub> <mo>+</mo> <mn>2</mn> </mrow> <mrow> <mi>r</mi> <mo>+</mo> <mn>1</mn> </mrow> </msubsup> </mtd> <mtd> <mo>&CenterDot;</mo> <mo>&CenterDot;</mo> <mo>&CenterDot;</mo> </mtd> <mtd> <msubsup> <mi>X</mi> <mrow> <msub> <mi>n</mi> <mrow> <mi>r</mi> <mo>+</mo> <mn>1</mn> </mrow> </msub> <mo>,</mo> <mi>r</mi> <mo>+</mo> <mn>1</mn> </mrow> <mrow> <mi>r</mi> <mo>+</mo> <mn>1</mn> </mrow> </msubsup> </mtd> </mtr> </mtable> </mfenced> </mtd> </mtr> <mtr> <mtd> <mo>=</mo> <mi>BlockDiag</mi> <mfenced open='{' close='}'> <mtable> <mtr> <mtd> <msubsup> <mi>X</mi> <mrow> <msub> <mi>n</mi> <mrow> <mi></mi> <mn>1</mn> </mrow> </msub> <mo>,</mo> <mn>1</mn> <mi></mi> </mrow> <mi>r</mi> </msubsup> </mtd> <mtd> <mo>&CenterDot;</mo> <mo>&CenterDot;</mo> <mo>&CenterDot;</mo> </mtd> <mtd> <msubsup> <mi>X</mi> <msub> <mi>n</mi> <mrow> <msub> <mi>i</mi> <mn>0</mn> </msub> <mo>-</mo> <mn>1</mn> <mi></mi> <mo>,</mo> <msub> <mi>i</mi> <mn>0</mn> </msub> <mo>-</mo> <mn>1</mn> </mrow> </msub> <mi>r</mi> </msubsup> </mtd> <mtd> <msubsup> <mi>X</mi> <mrow> <msub> <mi>i</mi> <mn>0</mn> </msub> <mo>,</mo> <mi>a</mi> </mrow> <mi>r</mi> </msubsup> </mtd> <mtd> <msubsup> <mi>X</mi> <mrow> <msub> <mi>i</mi> <mn>0</mn> </msub> <mo>,</mo> <mi>b</mi> </mrow> <mi>r</mi> </msubsup> </mtd> <mtd> <msubsup> <mi>X</mi> <mrow> <msub> <mi>n</mi> <mrow> <msub> <mi>i</mi> <mn>0</mn> </msub> <mo>+</mo> <mn>1</mn> </mrow> </msub> <mo>,</mo> <msub> <mi>i</mi> <mn>0</mn> </msub> <mo>+</mo> <mn>1</mn> <mi></mi> </mrow> <mi>r</mi> </msubsup> </mtd> <mtd> <mo>&CenterDot;</mo> <mo>&CenterDot;</mo> <mo>&CenterDot;</mo> </mtd> <mtd> <msubsup> <mi>X</mi> <mrow> <msub> <mi>n</mi> <mi>r</mi> </msub> <mo>,</mo> <mi>r</mi> </mrow> <mi>r</mi> </msubsup> </mtd> </mtr> </mtable> </mfenced> </mtd> </mtr> </mtable> </mfenced> </math>

wherein,

<math> <mrow> <msubsup> <mi>X</mi> <mrow> <msub> <mi>n</mi> <msub> <mi>i</mi> <mn>0</mn> </msub> </msub> <mo>,</mo> <msub> <mi>i</mi> <mn>0</mn> </msub> </mrow> <mi>r</mi> </msubsup> <mo>=</mo> <mfenced open='[' close=']'> <mtable> <mtr> <mtd> <msubsup> <mi>X</mi> <mrow> <msub> <mi>i</mi> <mn>0</mn> </msub> <mo>,</mo> <mi>a</mi> </mrow> <mi>r</mi> </msubsup> </mtd> </mtr> <mtr> <mtd> <mi>&alpha;</mi> <msubsup> <mi>X</mi> <mrow> <msub> <mi>i</mi> <mn>0</mn> </msub> <mo>,</mo> <mi>b</mi> </mrow> <mi>r</mi> </msubsup> </mtd> </mtr> </mtable> </mfenced> <mo>;</mo> </mrow> </math>

indicating a length of n in the ith column of the precoding matrix of rank r_iI-1, …, r, α is a complex number, for ensuring thatIs 1.

7. The apparatus of claim 6, wherein the precoding matrix employed by the precoding module is a precoding matrix C with a rank r^rSaid C is^rIs a block diagonal matrix, and said C^rContains at most one non-zero element per line, and, C^rIs set to satisfy at least one of the following conditions:

when r is 2, the first and second spatial layers respectively contain 4 non-zero elements;

when r is 3, the first spatial layer includes 4 non-zero elements, and the second and third spatial layers include 2 non-zero elements, respectively;

when r is 4, the first, second, third and fourth spatial layers respectively contain 2 non-zero elements;

when r is 5, the first and second spatial layers respectively include 1 non-zero element, and the third, fourth, and fifth spatial layers respectively include 2 non-zero elements;

when r is 6, the first, second, third and fourth spatial layers respectively include 1 non-zero element, and the fifth and sixth spatial layers respectively include 2 non-zero elements;

when r is 7, the first, second, third, fourth, fifth and sixth spatial layers respectively include 1 non-zero element, and the seventh spatial layer includes 2 non-zero elements.

8. The apparatus according to claim 6 or 7, wherein the computing module is specifically configured to:

calculating to obtain a precoding matrix based on the DFT vector with the length of n; or,

rank r precoding matrix C^rThe method comprises the following steps: for the obtained precoding matrix C with the rank r^rCarrying out any row transformation to obtain a matrix;

the pre-coding module is specifically configured to: and precoding the transmitting signals by adopting the precoding matrix obtained by the calculation module.

9. A signal processing method, comprising:

receiving a pre-coded transmission signal transmitted by a transmitting terminal by adopting 8 transmitting antennas;

acquiring an equivalent channel estimation value according to a precoding matrix, and processing a received signal according to the equivalent channel estimation value to obtain an estimation value of the transmitted signal;

the precoding matrix is predetermined with a transmitting end, so that the transmitting end performs precoding by using the precoding matrix to transmit at most one spatial layer signal on each transmitting antenna, and maps the same codeword onto spatial layers with similar quality, wherein the spatial layers with similar quality refer to spatial layers with the difference of the number of corresponding non-zero elements between the spatial layers within a set range;

by a precoding matrix C of rank r^rCalculating to obtain a precoding matrix C with the rank r +1^r+1；

By a precoding matrix C of rank r^rCalculating to obtain a precoding matrix C with the rank r +1^r+1The calculation formula is as follows:

<math> <mfenced open='' close=''> <mtable> <mtr> <mtd> <msup> <mi>C</mi> <mrow> <mi>r</mi> <mo>+</mo> <mn>1</mn> </mrow> </msup> <mo>=</mo> <mi>BlockDiag</mi> <mfenced open='{ ' close='}'> <mtable> <mtr> <mtd> <msubsup> <mi>X</mi> <mrow> <msub> <mi>n</mi> <mn>1</mn> </msub> <mo>,</mo> <mi></mi> <mn>1</mn> <mi></mi> </mrow> <mrow> <mi>r</mi> <mo>+</mo> <mn>1</mn> </mrow> </msubsup> </mtd> <mtd> <mo>&CenterDot;</mo> <mo>&CenterDot;</mo> <mo>&CenterDot;</mo> </mtd> <mtd> <msubsup> <mi>X</mi> <mrow> <mi></mi> <msub> <mi>n</mi> <mrow> <msub> <mi>i</mi> <mn>0</mn> </msub> <mo>-</mo> <mn>1</mn> <mo>,</mo> <msub> <mi>i</mi> <mn>0</mn> </msub> <mo>-</mo> <mn>1</mn> <mi></mi> </mrow> </msub> <mi></mi> </mrow> <mrow> <mi>r</mi> <mo>+</mo> <mn>1</mn> </mrow> </msubsup> </mtd> <mtd> <mi></mi> <msubsup> <mi>X</mi> <mrow> <msub> <mi>n</mi> <msub> <mi>i</mi> <mn>0</mn> </msub> </msub> <mo>,</mo> <msub> <mi>i</mi> <mn>0</mn> </msub> <mi></mi> </mrow> <mrow> <mi>r</mi> <mo>+</mo> <mn>1</mn> </mrow> </msubsup> </mtd> <mtd> <msubsup> <mi>X</mi> <mrow> <msub> <mi>n</mi> <mrow> <msub> <mi>i</mi> <mn>0</mn> </msub> <mo>+</mo> <mn>1</mn> </mrow> </msub> <mo>,</mo> <msub> <mi>i</mi> <mn>0</mn> </msub> <mo>+</mo> <mi></mi> <mn>1</mn> </mrow> <mrow> <mi>r</mi> <mo>+</mo> <mn>1</mn> </mrow> </msubsup> </mtd> <mtd> <msubsup> <mi>X</mi> <mrow> <msub> <mi>n</mi> <mrow> <msub> <mi>i</mi> <mn>0</mn> </msub> <mo>+</mo> <mn>2</mn> </mrow> </msub> <mo>,</mo> <msub> <mi>i</mi> <mn>0</mn> </msub> <mo>+</mo> <mn>2</mn> </mrow> <mrow> <mi>r</mi> <mo>+</mo> <mn>1</mn> </mrow> </msubsup> </mtd> <mtd> <mo>&CenterDot;</mo> <mo>&CenterDot;</mo> <mo>&CenterDot;</mo> </mtd> <mtd> <msubsup> <mi>X</mi> <mrow> <msub> <mi>n</mi> <mrow> <mi>r</mi> <mo>+</mo> <mn>1</mn> </mrow> </msub> <mo>,</mo> <mi>r</mi> <mo>+</mo> <mn>1</mn> </mrow> <mrow> <mi>r</mi> <mo>+</mo> <mn>1</mn> </mrow> </msubsup> </mtd> </mtr> </mtable> </mfenced> </mtd> </mtr> <mtr> <mtd> <mo>=</mo> <mi>BlockDiag</mi> <mfenced open='{' close='}'> <mtable> <mtr> <mtd> <msubsup> <mi>X</mi> <mrow> <msub> <mi>n</mi> <mrow> <mi></mi> <mn>1</mn> </mrow> </msub> <mo>,</mo> <mn>1</mn> <mi></mi> </mrow> <mi>r</mi> </msubsup> </mtd> <mtd> <mo>&CenterDot;</mo> <mo>&CenterDot;</mo> <mo>&CenterDot;</mo> </mtd> <mtd> <msubsup> <mi>X</mi> <msub> <mi>n</mi> <mrow> <msub> <mi>i</mi> <mn>0</mn> </msub> <mo>-</mo> <mn>1</mn> <mi></mi> <mo>,</mo> <msub> <mi>i</mi> <mn>0</mn> </msub> <mo>-</mo> <mn>1</mn> </mrow> </msub> <mi>r</mi> </msubsup> </mtd> <mtd> <msubsup> <mi>X</mi> <mrow> <msub> <mi>i</mi> <mn>0</mn> </msub> <mo>,</mo> <mi>a</mi> </mrow> <mi>r</mi> </msubsup> </mtd> <mtd> <msubsup> <mi>X</mi> <mrow> <msub> <mi>i</mi> <mn>0</mn> </msub> <mo>,</mo> <mi>b</mi> </mrow> <mi>r</mi> </msubsup> </mtd> <mtd> <msubsup> <mi>X</mi> <mrow> <msub> <mi>n</mi> <mrow> <msub> <mi>i</mi> <mn>0</mn> </msub> <mo>+</mo> <mn>1</mn> </mrow> </msub> <mo>,</mo> <msub> <mi>i</mi> <mn>0</mn> </msub> <mo>+</mo> <mn>1</mn> <mi></mi> </mrow> <mi>r</mi> </msubsup> </mtd> <mtd> <mo>&CenterDot;</mo> <mo>&CenterDot;</mo> <mo>&CenterDot;</mo> </mtd> <mtd> <msubsup> <mi>X</mi> <mrow> <msub> <mi>n</mi> <mi>r</mi> </msub> <mo>,</mo> <mi>r</mi> </mrow> <mi>r</mi> </msubsup> </mtd> </mtr> </mtable> </mfenced> </mtd> </mtr> </mtable> </mfenced> </math>

wherein,

<math> <mrow> <msubsup> <mi>X</mi> <mrow> <msub> <mi>n</mi> <msub> <mi>i</mi> <mn>0</mn> </msub> </msub> <mo>,</mo> <msub> <mi>i</mi> <mn>0</mn> </msub> </mrow> <mi>r</mi> </msubsup> <mo>=</mo> <mfenced open='[' close=']'> <mtable> <mtr> <mtd> <msubsup> <mi>X</mi> <mrow> <msub> <mi>i</mi> <mn>0</mn> </msub> <mo>,</mo> <mi>a</mi> </mrow> <mi>r</mi> </msubsup> </mtd> </mtr> <mtr> <mtd> <mi>&alpha;</mi> <msubsup> <mi>X</mi> <mrow> <msub> <mi>i</mi> <mn>0</mn> </msub> <mo>,</mo> <mi>b</mi> </mrow> <mi>r</mi> </msubsup> </mtd> </mtr> </mtable> </mfenced> <mo>;</mo> </mrow> </math>

indicating a length of n in the ith column of the precoding matrix of rank r_iI-1, …, r, α is a complex number, for ensuring thatIs 1.

10. The method of claim 9, wherein the precoding matrix is a precoding matrix C with a rank r^rSaid C is^rIs a block diagonal matrix, and said C^rAt most on each row ofContains a non-zero element, and, said C^rIs set to satisfy at least one of the following conditions:

when r is 2, the first and second spatial layers respectively contain 4 non-zero elements;

when r is 3, the first spatial layer includes 4 non-zero elements, and the second and third spatial layers include 2 non-zero elements, respectively;

when r is 4, the first, second, third and fourth spatial layers respectively contain 2 non-zero elements;

when r is 5, the first and second spatial layers respectively include 1 non-zero element, and the third, fourth, and fifth spatial layers respectively include 2 non-zero elements;

when r is 6, the first, second, third and fourth spatial layers respectively include 1 non-zero element, and the fifth and sixth spatial layers respectively include 2 non-zero elements;

when r is 7, the first, second, third, fourth, fifth and sixth spatial layers respectively include 1 non-zero element, and the seventh spatial layer includes 2 non-zero elements.

11. The method according to claim 9 or 10,

calculating to obtain the precoding matrix based on the DFT vector with the length of n; or,

rank r precoding matrix C^rThe method comprises the following steps: for the obtained precoding matrix C with the rank r^rAnd carrying out random row transformation to obtain a matrix.

12. A base station, comprising:

the receiving module is used for receiving the pre-coded transmitting signals transmitted by the transmitting terminal by adopting 8 transmitting antennas;

the processing module is used for acquiring an equivalent channel estimation value according to the precoding matrix and processing the signal received by the receiving module according to the equivalent channel estimation value to obtain an estimation value of the transmitting signal;

the precoding matrix is predetermined with a transmitting end, so that the transmitting end performs precoding by using the precoding matrix to transmit at most one spatial layer signal on each transmitting antenna, and maps the same codeword onto spatial layers with similar quality, wherein the spatial layers with similar quality refer to spatial layers with the difference of the number of corresponding non-zero elements between the spatial layers within a set range;

the precoding matrix adopted by the processing module is obtained by adopting the following method:

by a precoding matrix C of rank r^rCalculating to obtain a precoding matrix C with the rank r +1^r+1；

By a precoding matrix C of rank r^rCalculating to obtain a precoding matrix C with the rank r +1^r+1The calculation formula is as follows:

<math> <mfenced open='' close=''> <mtable> <mtr> <mtd> <msup> <mi>C</mi> <mrow> <mi>r</mi> <mo>+</mo> <mn>1</mn> </mrow> </msup> <mo>=</mo> <mi>BlockDiag</mi> <mfenced open='{ ' close='}'> <mtable> <mtr> <mtd> <msubsup> <mi>X</mi> <mrow> <msub> <mi>n</mi> <mn>1</mn> </msub> <mo>,</mo> <mn>1</mn> <mi></mi> </mrow> <mrow> <mi>r</mi> <mo>+</mo> <mn>1</mn> </mrow> </msubsup> </mtd> <mtd> <mo>&CenterDot;</mo> <mo>&CenterDot;</mo> <mo>&CenterDot;</mo> </mtd> <mtd> <msubsup> <mi>X</mi> <mrow> <mi></mi> <msub> <mi>n</mi> <mrow> <msub> <mi>i</mi> <mn>0</mn> </msub> <mo>-</mo> <mn>1</mn> <mo>,</mo> <msub> <mi>i</mi> <mn>0</mn> </msub> <mo>-</mo> <mn>1</mn> <mi></mi> </mrow> </msub> <mi></mi> </mrow> <mrow> <mi>r</mi> <mo>+</mo> <mn>1</mn> </mrow> </msubsup> </mtd> <mtd> <mi></mi> <msubsup> <mi>X</mi> <mrow> <msub> <mi>n</mi> <msub> <mi>i</mi> <mn>0</mn> </msub> </msub> <mo>,</mo> <msub> <mi>i</mi> <mn>0</mn> </msub> <mi></mi> </mrow> <mrow> <mi>r</mi> <mo>+</mo> <mn>1</mn> <mi></mi> </mrow> </msubsup> </mtd> <mtd> <msubsup> <mi>X</mi> <mrow> <msub> <mi>n</mi> <mrow> <msub> <mi>i</mi> <mn>0</mn> </msub> <mo>+</mo> <mn>1</mn> </mrow> </msub> <mo>,</mo> <msub> <mi>i</mi> <mn>0</mn> </msub> <mo>+</mo> <mi></mi> <mn>1</mn> </mrow> <mrow> <mi>r</mi> <mo>+</mo> <mn>1</mn> </mrow> </msubsup> </mtd> <mtd> <msubsup> <mi>X</mi> <mrow> <msub> <mi>n</mi> <mrow> <msub> <mi>i</mi> <mn>0</mn> </msub> <mo>+</mo> <mn>2</mn> </mrow> </msub> <mo>,</mo> <msub> <mi>i</mi> <mn>0</mn> </msub> <mo>+</mo> <mn>2</mn> </mrow> <mrow> <mi>r</mi> <mo>+</mo> <mn>1</mn> </mrow> </msubsup> </mtd> <mtd> <mo>&CenterDot;</mo> <mo>&CenterDot;</mo> <mo>&CenterDot;</mo> </mtd> <mtd> <msubsup> <mi>X</mi> <mrow> <msub> <mi>n</mi> <mrow> <mi>r</mi> <mo>+</mo> <mn>1</mn> </mrow> </msub> <mo>,</mo> <mi>r</mi> <mo>+</mo> <mn>1</mn> </mrow> <mrow> <mi>r</mi> <mo>+</mo> <mn>1</mn> </mrow> </msubsup> </mtd> </mtr> </mtable> </mfenced> </mtd> </mtr> <mtr> <mtd> <mo>=</mo> <mi>BlockDiag</mi> <mfenced open='{' close='}'> <mtable> <mtr> <mtd> <msubsup> <mi>X</mi> <mrow> <msub> <mi>n</mi> <mrow> <mi></mi> <mn>1</mn> </mrow> </msub> <mo>,</mo> <mn>1</mn> <mi></mi> </mrow> <mi>r</mi> </msubsup> </mtd> <mtd> <mo>&CenterDot;</mo> <mo>&CenterDot;</mo> <mo>&CenterDot;</mo> </mtd> <mtd> <msubsup> <mi>X</mi> <msub> <mi>n</mi> <mrow> <msub> <mi>i</mi> <mn>0</mn> </msub> <mo>-</mo> <mn>1</mn> <mi></mi> <mo>,</mo> <msub> <mi>i</mi> <mn>0</mn> </msub> <mo>-</mo> <mn>1</mn> </mrow> </msub> <mi>r</mi> </msubsup> </mtd> <mtd> <mi></mi> <msubsup> <mi>X</mi> <mrow> <msub> <mi>i</mi> <mn>0</mn> </msub> <mo>,</mo> <mi>a</mi> </mrow> <mi>r</mi> </msubsup> </mtd> <mtd> <msubsup> <mi>X</mi> <mrow> <msub> <mi>i</mi> <mn>0</mn> </msub> <mo>,</mo> <mi>b</mi> </mrow> <mi>r</mi> </msubsup> </mtd> <mtd> <mi></mi> <msubsup> <mi>X</mi> <mrow> <msub> <mi>n</mi> <mrow> <msub> <mi>i</mi> <mn>0</mn> </msub> <mo>+</mo> <mn>1</mn> </mrow> </msub> <mo>,</mo> <msub> <mi>i</mi> <mn>0</mn> </msub> <mo>+</mo> <mn>1</mn> <mi></mi> </mrow> <mi>r</mi> </msubsup> </mtd> <mtd> <mo>&CenterDot;</mo> <mo>&CenterDot;</mo> <mi></mi> <mo>&CenterDot;</mo> </mtd> <mtd> <msubsup> <mi>X</mi> <mrow> <msub> <mi>n</mi> <mi>r</mi> </msub> <mo>,</mo> <mi>r</mi> </mrow> <mi>r</mi> </msubsup> </mtd> </mtr> </mtable> </mfenced> </mtd> </mtr> </mtable> </mfenced> </math>

wherein,

<math> <mrow> <msubsup> <mi>X</mi> <mrow> <msub> <mi>n</mi> <msub> <mi>i</mi> <mn>0</mn> </msub> </msub> <mo>,</mo> <msub> <mi>i</mi> <mn>0</mn> </msub> </mrow> <mi>r</mi> </msubsup> <mo>=</mo> <mfenced open='[' close=']'> <mtable> <mtr> <mtd> <msubsup> <mi>X</mi> <mrow> <msub> <mi>i</mi> <mn>0</mn> </msub> <mo>,</mo> <mi>a</mi> </mrow> <mi>r</mi> </msubsup> </mtd> </mtr> <mtr> <mtd> <mi>&alpha;</mi> <msubsup> <mi>X</mi> <mrow> <msub> <mi>i</mi> <mn>0</mn> </msub> <mo>,</mo> <mi>b</mi> </mrow> <mi>r</mi> </msubsup> </mtd> </mtr> </mtable> </mfenced> <mo>;</mo> </mrow> </math>

indicating a length of n in the ith column of the precoding matrix of rank r_iI-1, …, r, α is a complex number, for ensuring thatIs 1.

13. The base station of claim 12, wherein the processing module employs a precoding matrix C with a rank r^rSaid C is^rIs a block diagonal matrix, and said C^rContains at most one non-zero element per line, and, C^rIs set to satisfy at least one of the following conditions:

when r is 2, the first and second spatial layers respectively contain 4 non-zero elements;

when r is 3, the first spatial layer includes 4 non-zero elements, and the second and third spatial layers include 2 non-zero elements, respectively;

when r is 4, the first, second, third and fourth spatial layers respectively contain 2 non-zero elements;

when r is 5, the first and second spatial layers respectively include 1 non-zero element, and the third, fourth, and fifth spatial layers respectively include 2 non-zero elements;

when r is 6, the first, second, third and fourth spatial layers respectively include 1 non-zero element, and the fifth and sixth spatial layers respectively include 2 non-zero elements;

when r is 7, the first, second, third, fourth, fifth and sixth spatial layers respectively include 1 non-zero element, and the seventh spatial layer includes 2 non-zero elements.

14. The base station according to claim 12 or 13, wherein the precoding matrix employed by the processing module is obtained as follows:

calculating to obtain a precoding matrix based on the DFT vector with the length of n; or,

rank r precoding matrix C^rThe method comprises the following steps: for the obtained precoding matrix C with the rank r^rAnd carrying out random row transformation to obtain a matrix.