METHOD FOR CODING ON TIME SPACE TWO DIMENSIONAL CHANNEL

Abstract

The present disclosure relates to a method for coding on a time-space two-dimensional channels, in which the data bits to be transmitted are coded from the time-domain and the space-domain, respectively, to form time-space two-dimensional coding. the proposed coding operation in the space-domain and the time-domain can adopt different coding structures, coding rates and modulation constellations; subsequently, the system expresses each coding method with code words, merges the code words to form a space-time two-dimensional codebook, stores the codebook at both ends of the sending terminal and the receiving terminal; next, the sending terminal selects the coding structure according to the code words of the time-domain, and encodes each data stream according to time-domain coding rates, and eventually forms data blocks of an equal length in the time-domain through the rate matching. Then, the system selects different code word serial numbers, rate matching tables and space time slicing modes according to the requirements of different scenarios for transmission rates, latency and code error rate, as well as channel states and size of data blocks to be transmitted; eventually, when a Time Space Concatenated Coding Mode is adopted, the sending terminal firstly performs time-domain coding according to the time-domain slicing mode and the time-domain code words.

Claims

1. A method for coding based on a time-space two-dimensional channel, wherein the method comprises following steps: Step 1: sending, by a sending terminal, a pilot signal, estimating, by a receiving terminal, a channel, and selecting, according to requirements for a transmission time rate, a latency and a code error rate in different scenarios, appropriate code word serial numbers, modulation modes, rate matching tables and space time slicing modes for a time-domain coding and a space-domain coding, and then feeding back to the sending terminal together with a rank L of the channel; Step 2: slicing, when adopting a Time Space Concatenated Coding Mode in the time-space two-dimensional coding, data in the space-domain by the sending terminal according to a feedback time-domain coding rate, and forming M.sup.t data streams in parallel, wherein each data stream has K.sub.i.sup.t bits, where 0≤i≥M.sup.t−1; Step 3: selecting, according to a code word of the time-domain, a coding structure by the sending terminal, and coding each data stream according to the time-domain coding rate, and eventually forming, by a rate matching, data blocks of an equal length in the time-domain; Step 4: slicing, according to a feedback space-domain coding rate, data in the time-domain by the sending terminal, and forming M.sup.s data streams in parallel, wherein each data stream has K.sub.i.sup.s bits, where 0≤i≥M.sup.s−1; Step 5: selecting, according to a code word of the space-domain, the coding structure by the sending terminal, and coding each data stream according to the space-domain coding rate, and eventually forming, by the rate matching, data blocks containing L bits in the space-domain; Step 6: modulating, according to a feedback modulation mode, B bits adjacent to space-domain coding rate, the data in the space-domain by the sending terminal and forming M.sup.t data streams in parallel, wherein each data stream has K.sub.i.sup.t bits, where 0≤i≥M.sup.t−1; Step 7: slicing, when adopting a Space Time Concatenated Coding Mode in the time-space two-dimensional coding, the data in the time-domain by the sending terminal according to a feedback space-domain coding rate, and forming M.sup.s data streams in parallel, wherein each data stream has K.sub.i.sup.s bits, where 0≤i≥M.sup.s−1; Step 8: selecting, according to the code word of the space-domain, the coding structure by the sending terminal, coding each data stream according to the space-domain coding rate, and eventually forming, by the rate matching, the data blocks containing L bits in the space-domain; Step 9: slicing, according to the feedback space-domain coding rate, the data in the space-domain by the sending terminal and forming M.sup.t data streams in parallel, wherein each data stream has K.sub.i.sup.t bits, where 0≤i≥M.sup.t−1; Step 10: selecting, according to the code word of the time-domain, the coding structure by the sending terminal, and coding each data stream according to the time-domain coding rate, and eventually forming, by the rate matching, the data blocks of the equal length in the time-domain; and Step 11: modulating, according to the feedback modulation mode, the B bits adjacent to each other in the time-domain to form the L symbol streams.

2. The method for coding based on the time-space two-dimensional channel according to claim 1, wherein Step 1 is specifically as follows: the receiving terminal determines to adopt a QPSK modulation according to a criterion, a space-domain code word adopts W.sub.0.sup.s at a 1/4 coding rate, and a time-domain code word adopts W.sub.0, W.sub.1.sup.t and W.sub.2.sup.t at 1/4, 1/3 and 1/2 coding rate, at this time, the receiving terminal needs to feed back the modulation mode QPSK, and serial numbers of W.sub.0.sup.s, W.sub.0, W.sub.1.sup.t and W.sub.2.sup.t to the sending terminal.

3. The method for coding based on the time-space two-dimensional channel according to claim 2, wherein Step 2 is specifically as follows: the sending terminal firstly interleaves transmission bits in time and space, which is expressed as:
x=[x.sub.0,x.sub.1,K ,x.sub.255]=b.Math.D  [Formula 5], where D is a 256×256 interleaving matrix, when D is a unit array, it indicates that the bits are not interleaved, the interleaved bits are serial-to-parallel converted to form 8 bits streams, respectively containing 40, 40, 40, 32, 32, 24, 24, and 24 bits, which is expressed as:
x.sub.0=[x.sub.0,x.sub.1,K,x.sub.39]
x.sub.1=[x.sub.40,x.sub.41,K,x.sub.79]
x.sub.2=[x.sub.80,x.sub.81,K,x.sub.119]
x.sub.3=[x.sub.120,x.sub.121,K,x.sub.151]
x.sub.4=[x.sub.152,x.sub.153,K,x.sub.183]
x.sub.5=[x.sub.184,x.sub.185,K,x.sub.207]
x.sub.6=[x.sub.208,x.sub.209,K,x.sub.231]
x.sub.7=[x.sub.232,x.sub.233,K,x.sub.255]  [Formula 6] at this time, M.sup.t=8; K.sub.0.sup.t=40, K.sub.1.sup.t=40, K.sub.2.sup.t=40; K.sub.3.sup.t=32, K.sub.4.sup.t=32; K.sub.5.sup.t=24, K.sub.6.sup.t=24, K.sub.7.sup.t=24.

4. The method for coding based on the time-space two-dimensional channel according to claim 3, wherein Step 3 is specifically as follows: the sending terminal adopts the W.sub.2.sup.t coding for x.sub.0, x.sub.1 and x.sub.2 to generate 96 bits, which is expressed as:
y.sub.i=[y.sub.i.sup.0,y.sub.i.sup.1,K,y.sub.i.sup.95]=x.sub.i.Math.W.sub.2.sup.t, 0≤i≤2   [Formula 7], the sending terminal adopts the W.sub.1.sup.t coding for x.sub.3 and x.sub.4 to generate 96 bits, which is expressed as:
y.sub.i=[y.sub.i.sup.0,y.sub.i.sup.1,K,y.sub.i.sup.95]=x.sub.i.Math.W.sub.1.sup.t, 3≤i≤4   [Formula 8], the sending terminal adopts W.sub.0.sup.t coding for x.sub.5, x.sub.6 and x.sub.7 to generate 96 bits, which is expressed as:
y.sub.i=[y.sub.i.sup.0,y.sub.i.sup.1,K,y.sub.i.sup.95]=x.sub.i.Math.W.sub.0.sup.t, 5≤i≤7   [Formula 9], when coded bits are greater than or less than 96 bits, the prior art is adopted to puncturing or adding, and then the sending terminal merges y.sub.i into a matrix to obtain: $\begin{array}{cc}Y=\left[\begin{array}{c}{y}_0\\ y_1\\ M\\ y_7\end{array}\right]=\left[\begin{array}{cccc}{y}_0^0& y_0^1& L& y_0^{95}\\ y_1^0& y_1^1& L& y_1^{95}\\ M& M& O& M\\ y_7^0& y_7^1& K& y_7^{95}\end{array}\right].& \left[\mathrm{Formula}10\right]\end{array}$

5. The method for coding based on the time-space two-dimensional channel according to claim 3, wherein Step 5 is specifically as follows: the sending terminal encodes each column in the space-domain to obtain: $\begin{array}{cc}{s}_k=\left[s_0^k,s_1^k,K,s_{31}^k\right]=\left[y_0^k,y_1^k,K,y_7^k\right].Math.W_0^s,& \left[\mathrm{Formula}11\right]\end{array}$ $0\le k\le 95.$

6. The method for coding based on the time-space two-dimensional channel according to claim 5, wherein Step 6 is specifically as follows: the sending terminal merges two adjacent sets of vectors for the QPSK modulation to obtain a k-th symbol transmitted on an i-th space channel as:
z.sub.i.sup.k=s.sub.i.sup.k+j.Math.s.sup.k+1,
k=0,2,4,K,94 i=0,1,2K,31   [Formula 12], where j represents an imaginary unit without considering a Gery mapping, after the QPSK modulation, B=2, the time-domain has 48 symbols, which satisfies requirements for the latency, when a higher-order modulation such as 16QAM is adopted, adjacent sets of vectors need to be merged.

7. The method for coding based on the time-space two-dimensional channel according to claim 6, wherein Step 7 is specifically as follows: the sending terminal firstly interleaves the transmission bits in time and space, which is expressed as:
x=b.Math.D   [Formula 21], where D is a 256×256 interleaving matrix, when D is a unit array, it indicates that the bits are not interleaved, the interleaved bits are serial-to-parallel converted to divide into 8 bits streams on average, each bit stream has 32 bits, which is expressed in a matrix as: $\begin{array}{cc}X=\left[\begin{array}{cccc}{x}_0^0& x_0^1& L& x_0^{31}\\ x_l^0& x_1^l& L& x_1^{31}\\ M& M& O& M\\ x_7^0& x_7^1& K& x_7^{31}\end{array}\right],& \left[\mathrm{Formula}22\right]\end{array}$ at this time, M.sup.s=32, and all K.sub.1.sup.s (0≤i≤7) are equal to 8.

8. The method for coding based on the time-space two-dimensional channel according to claim 7, wherein Step 8 is specifically as follows: the sending terminal encodes each column of X in the space-domain to obtain: $\begin{array}{cc}{y}_k=\left[y_0^k,y_1^k,K,y_{31}^k\right]=\left[x_0^k,x_1^k,K,x_7^k\right].Math.W_0^s,& \left[\mathrm{Formula}23\right]\end{array}$ $0\le k\le 31,$ which is expressed as a 32×32 matrix to obtain: $\begin{array}{cc}Y=\left[\begin{array}{c}{y}_0\\ y_1\\ M\\ y_{31}\end{array}\right]=\left[\begin{array}{cccc}{y}_0^0& y_0^1& L& y_0^{31}\\ y_1^0& y_1^1& L& y_1^{31}\\ M& M& O& M\\ y_{31}^0& y_{31}^1& K& y_{31}^{31}\end{array}\right].& \left[\mathrm{Formula}24\right]\end{array}$

9. The method for coding based on the time-space two-dimensional channel according to claim 8, wherein Step 10 is specifically as follows: the sending terminal adopts the W.sub.2.sup.t coding for y.sub.0, y.sub.1, . . . , y.sub.7 to generate 96 bits, which is expressed as:
s.sub.i=[s.sub.i.sup.0,s.sub.i.sup.1,K,s.sub.i.sup.95]=y.sub.i.Math.W.sub.2.sup.t, 0≤i≤7   [Formula 25], the sending terminal adopts the W.sub.1.sup.t coding for y.sub.8, y.sub.9, . . . , y.sub.23 to generate 96 bits, which is expressed as:
s.sub.i=[s.sub.i.sup.0,s.sub.i.sup.1,K,s.sub.i.sup.95]=y.sub.i.Math.W.sub.1.sup.t, 8≤i≤23   [Formula 26], the sending terminal adopts W.sub.0.sup.t coding for y.sub.24, y.sub.25, . . . , y.sub.31 to generate 96 bits, which is expressed as:
s.sub.i=[s.sub.i.sup.0,s.sub.i.sup.1,K,s.sub.i.sup.95]=y.sub.i.Math.W.sub.0.sup.t, 24≤i≤31   [Formula 27], when the coded bits are greater than or less than 96 bits, the prior art is adopted to puncturing or adding.

10. The method for coding based on the time-space two-dimensional channel according to claim 9, wherein Step 11 is specifically as follows: the sending terminal performs the QPSK modulation on s.sub.i to obtain the k-th symbol transmitted on the i-th space channel as:
z.sub.i.sup.k=s.sub.i.sup.k+j.Math.s.sup.k+1,
k=0,2,4,K,94 i=0,1,2K,31   [Formula 28], after the QPSK modulation (B=2), the time-domain has 48 symbols, which satisfies the requirements for the latency.

Description

BRIEF DESCRIPTION OF THE DRAWINGS

[0029] FIG. 1 illustrates a schematic diagram of a time-domain slicing.

[0030] FIG. 2 illustrates a schematic diagram of a space-domain slicing.

[0031] FIG. 3 illustrates a schematic diagram of an irregular slicing.

[0032] FIG. 4(a) illustrates a schematic diagram of a 5G sending structure.

[0033] FIG. 4(b) illustrates a schematic diagram of coding based on a time-space two-dimensional channel.

[0034] FIG. 5 illustrates a schematic diagram of a Time Space Concatenated Coding Mode.

[0035] FIG. 6 illustrates a coding rate matching diagram of the Time Space Concatenated Coding Mode.

[0036] FIG. 7 illustrates a coding rate matching diagram of a Space Time Concatenated Coding Mode.

[0037] FIG. 8 illustrates a schematic diagram of the Space Time Concatenated Coding Mode.

[0038] FIG. 9 illustrates a comparison diagram of code error rates.

DETAILED DESCRIPTION OF THE EMBODIMENTS

[0039] In order to deepen the understanding of the present disclosure, this embodiment is described in details below in combination with the accompanying drawings.

Embodiment 1

[0040] With reference to FIG. 1, provided is a method for coding based on a time-space two-dimensional channel, the specific implementations of the present disclosure are described below in combination with the accompanying drawings, so that those skilled in the art can better understand the present disclosure. It should be particularly noted that in the following descriptions that since the contents of the present disclosure may be diluted by the detailed descriptions of some known techniques and functions, these descriptions will be ignored herein.

[0041] In consideration of a MIMO system with a total of N.sub.t sending antennas and N.sub.r receiving antennas, as well as S data bits to be send. Firstly, the sending terminal sends a pilot signal, and the receiving terminal performs a channel estimation. Assuming that the channel is a flat fading channel, when the channel is a Frequency Selective Fading channel, an orthogonal frequency division multiplexing (OFDM) technology can be used to convert the channel into the flat fading channel in the frequency domain. Since this portion is consistent with the traditional MIMO and OFDM systems, the existing methods can be used, which will not be repeated herein. The receiving terminal feeds back the statistical channel information, such as the channel correlation matrix, or the instantaneous channel information, such as the channel parameters, to the sending terminal, according to the system setting.

[0042] Taking the instantaneous channel feedback as an example, assuming that a matrix H of N.sub.r×N.sub.t is obtained by the channel estimation, and a singular value decomposition is performed to obtain:

H=UΣV.sup.T   [Formula 1],

where U is a left singular matrix of N.sub.r×N.sub.r, V is a right singular matrix of N.sub.t×N.sub.t, and U.sup.TU=I, V.sup.TV=I. Σ is a matrix of N.sub.r×N.sub.t, all elements expect those on the main diagonal are 0, and each element on the main diagonal is a singular value. Assuming that the channel has a total of L singular values, and the feedback overhead is not considered. The sending terminal can use the matrix N.sub.t×L composed of L column vectors on the left side of matrix V as a channel pre-coding array {tilde over (V)}, and the receiving terminal can use the matrix N.sub.r×L composed of L column vectors on the left side of matrix U as a receiving matrix Ũ, namely:

[00006]$\begin{array}{cc}{\tilde{U}}^{T}H\tilde{V}=\left[\begin{array}{ccc}{\lambda }_0& .Math.& 0\\ .Math.& \ddots & .Math.\\ 0& .Math.& {\lambda }_{L-1}\end{array}\right],& \left[\mathrm{Formula}2\right]\end{array}$

[0043] where λ.sub.i represents an i-th singular value of the channel. At this time, MIMO channel is decoupled into L independent spatial channels, an i-th channel is represented by h.sub.i and its parameter is λ.sub.i. In the present disclosure, the time-domain refers to a set of time samplings on each space channel, and the space domain refers to a set of space channels on each time sampling.

1. Definitions and Principles of Each Term in the Present Disclosure

1.1 Code Word and Coding Rate

[0044] The code words in the present disclosure refer to generation matrices of the channel coding, and the coding rate refers to the ratio of information bits length to the bits length after coding. Assuming that S information bits are required to be coded, which are represented by the row vector x of 1×S. The coded-block length is n, which are represented by the row vector y of 1×n. The generation matrix is represented by the matrix W of S×n, then the coding process can be expressed as:

y=x.Math.W   [Formula 3],

at this time, the coding rates are:

[00007]$\begin{array}{cc}R=\frac{S}{n}.& \left[\mathrm{Formula}4\right]\end{array}$

[0045] It should be noted that the source signal discussed in Formula 3 is bit, which belongs to GF(2) in Galois Field. The results of the present disclosure are also consistent with the information sources of other Galois Fields. In addition, in Information Theory, the coding rate usually refers to logC/n, where C represents the number of code words that can be formed after S source bits are encoded, and the base number of the logarithmic operator log can be 2 or other numbers. Since there is a definite logarithmic relationship between C and S, the definition of coding rate in Information Theory can also be adopted in the present disclosure.

1.2 Code Book

[0046] In the present disclosure, the sending terminal and the receiving terminal keep the same time-domain code book and space-domain code book. Assuming that the size of the time-domain code book is Q.sub.t, including Q.sub.t code words, represented by a set of {W.sub.0.sup.t, W.sub.1.sup.t, . . . , W.sub.Q.sub.t.sub.−1.sup.t}; the size of the space-domain code book is Q.sub.s, including Q.sub.s code words, represented by a set of {W.sub.0.sup.s, W.sub.1.sup.s, . . . , W.sub.Q.sub.t.sub.−1.sup.s}. Q.sub.t and Q.sub.s can be equal or unequal, and both have a minimum value 1. Channel codes that can be generated by matrix, including low-density parity check code (LDPC), Polar code, Turbo code and BCH and the like, can be adopted in the present disclosure. In addition, due to the simple repetition of the signals, Walsh-Hadamard transformation matrix, discrete Fourier transform (DFT) matrix and the like also belong to a kind of coding in a sense, so they are also included in the scope of the code words of the present disclosure. It should be noted that the code words in the time-domain code book can be different channel codes or different generation matrices of the same channel code, such as BG1 and BG2 of LDPC codes in 5G NR. In addition, each time-domain code word corresponds to a coding rate, the coding rate of each time-domain can be the same or different. Similarly, the code words in the space-domain code book can be different channel codes or different generation matrices of the same channel code. Each space-domain code word corresponds to a coding rate, and the coding rate of each space-domain code word can be the same or different. The time-domain code book can be the same as or different from the space-domain code book, and the range of coding rates of the contained code words is 1≤R≤L, which is specifically set by the system. The modulation mode is consistent with the traditional system, which can be BPSK, QPSK, 16QAM, and the like.

[0047] Through the analysis of L independent channels, according to the size of data blocks, transmission delay and bit error rate requirements required by the system, the receiving terminal selects an appropriate time-domain code word W.sub.i.sup.t, space-domain code word W.sub.k.sup.s and signal modulation mode from the time-domain code book and space-domain code book, and feedbacks their serial numbers i and k in the time-domain code book and space-domain code book to the sending terminal.

1.3 Space-Time Slicing Mode

[0048] The space-time slicing mode refers to the number of bit lines occupied by the same coding structure, which can be divided into a regular slicing and an irregular slicing. In the regular slicing, the time-domain slicing refers to a number of rows occupied by the coded code word bits in the space-domain, ranging from 1 to L. For example, FIG. 1 illustrates an coded two-dimensional data space, where three code words occupy 3, 3, and 2 lines, respectively, represented by dark gray, light gray, and white in the figure.

[0049] In the regular slicing, the space-domain slicing refers to the number of columns occupied by coded code word bits in the time-domain, the minimum is 1 column and the maximum is not more than all columns. For example, FIG. 2 illustrates a coded two-dimensional data space, where three code words occupy 4, 4, and 4 lines respectively, represented by dark gray, light gray, and white in the figure.

[0050] In the irregular slicing, the code word bits corresponding to the time-domain slicing and the space-domain slicing occupy two-dimensional space in a certain way, as illustrated in FIG. 3. At this time, the three code words are respectively represented by dark gray, light gray and white in the figure. In a specific application, the slicing mode can be defined by the system in advance, and the sending terminal and the receiving terminal can maintain the consistency of decoding through the serial number of the transmission mode.

[0051] In addition, when the receiving terminal can feed back all channel information, including singular values, to the sending terminal, the sending terminal can notify the receiving terminal of the serial numbers i and k of the time-domain code words and the space-domain code words, as well as the modulation mode, space-time slicing mode and coding rate matching graph after completing the two-dimensional channel coding through the control channel.

1.4 Application in 5G

[0052] FIG. 1 illustrates a transmission structure of the existing 5G system and applications of time-space two-dimensional channel coding in 5G. FIG. 4(a) illustrates a schematic diagram of a 5G transmission structure and FIG. 4(b) illustrates a schematic diagram of time-space two-dimensional channel coding. In 5G, the transmission blocks (TB) arriving at the upper layer are encoded, interleaved, perturbed and modulated, followed by layer mapping and pre-coding, as illustrated in FIG. 1(a). The number of layers is determined by the rank of the channel and is generally less than or equal to the rank of the channel matrix and the number of physical ports of the antenna. Pre-coding matches the data after layers mapping to the antenna ports, inhibits the interference between data streams during space multiplexing, and reduces the complexity of receiving terminal implementation. In general, the optimal pre-coded matrix is the matrix composed of columns corresponding to the maximum singular values in the right singular matrix V of Formula 1. Since this part can use the existing method, it will not be repeated herein. In 5G system, the sending terminal maps the pre-coded data stream to the two-dimensional physical resources (RE) composed of sub-carriers and time slots at each antenna port, and generates OFDM symbols to send out. FIG. 1(b) illustrates a schematic diagram of coding based on a time-space two-dimensional channel coding proposed by the present disclosure. The space domain herein refers to a set composed of all layers, and the time-domain corresponds to the time occupied by the coding sequence in FIG. 1(a). It should be noted that layer mapping of 5G simply distributes the data after the time-domain coding to different layers for transmission, while the solutions of the present disclosure are to form transmitted data on different layers through the space-domain coding after the time-domain coding.

2. Operation Principles of the Present Disclosure

[0053] For example, assuming that the system requires a bit error rate of 10.sup.−5, a normalized delay of 48 symbols (normalized by symbol period), and a data block length of 256 bits that represented by the vector b=[b.sub.0,b.sub.1, . . . ,b.sub.255]. The size of the time-domain code book and the space-domain code book are both 4, namely, Q.sub.t=Q.sub.s=4, and both adopts a generation matrix of LDPC code. The set {W.sub.0.sup.t, W.sub.1.sup.t, W.sub.2.sup.t, W.sub.3.sup.t} represents the time-domain code book, the corresponding coding rates are respectively

[00008]$\left\{\frac{1}{4},\frac{1}{3},\frac{1}{2},\frac{3}{4}\right\},$

and the set {W.sub.0.sup.s, W.sub.1.sup.s, W.sub.2.sup.s, W.sub.3.sup.s} represents the space-domain code book, the corresponding coding rates are respectively

[00009]$\left\{\frac{1}{4},\frac{1}{3},\frac{1}{2},\frac{3}{4}\right\}.$

Assuming that there are 32 antennas at the receiving terminal and 32 antennas at the sending terminal, through the channel estimation and the singular value decomposition calculation, the receiving terminal obtains that the rank of the channel matrix is 32 and there are 32 non-zero singular values. The present disclosure supports two ways for time-space two-dimensional channel coding, namely, “Time Space Concatenated Coding Mode” of first time and then space and “Space Time Concatenated Coding Mode” of first space and then time, which are described as follows.

2.1 Time Space Concatenated Coding Mode

2.11 Time-Domain Slicing Has 1 Row

[0054] Firstly, the Time Space Concatenated Coding Mode is discussed. When the regular slicing is adopted, and both time-domain slicing and space-domain slicing occupy only one row. The specific process is as illustrated in FIG. 5.

[0055] In Step 1, a pilot signal is sent by a sending terminal, a channel is estimated by a receiving terminal, appropriate code word serial numbers, modulation modes, rate matching tables and space time slicing modes for a time-domain coding and a space-domain coding are selected according to requirements for a transmission time rate, a latency and a code error rate in different scenarios, and then the sending terminal is fed back together with a rank L of the channel.

[0056] The receiving terminal determines to adopt a QPSK modulation according to a certain criterion, the space-domain code word adopts W.sub.0.sup.s at a 1/4 coding rate, and the time-domain code word adopts W.sub.0.sup.t, W.sub.1.sup.t and W.sub.2.sup.t at 1/4, 1/3 and 1/2 coding rate. At this time, the receiving terminal needs to feedback a QPSK modulation mode and to send the serial number of W.sub.0.sup.s, W.sub.0.sup.t, W.sub.1.sup.t, and W.sub.2.sup.t to the sending terminal. Assuming that a bit map is adopted, the size of the code book is 4 bits, and the rank of the channel is 5 bits, a rate matching diagram is obtained as illustrated in FIG. 6.

[0057] FIG. 2 illustrates that there are 8 bit streams, the first three of which are coded by W.sub.2.sup.t at a coding rate of 1/2, the middle two of which are coded by W.sub.1.sup.t at a coding rate of 1/3, and the last three of which are coded by W.sub.0.sup.t at a coding rate of 1/4.

[0058] In Step 2, when adopting a Time Space Concatenated Coding Mode in the time-space two-dimensional coding, data in the space-domain are sliced by the sending terminal according to a feedback time-domain coding rate, and M.sup.t data streams are formed in parallel, each data stream has K.sub.i.sup.t bits, where 0≤i≥M.sup.t−1.

[0059] The sending terminal firstly interleaves the transmission bits in time and space, which is expressed as:

x=[x.sub.0,x.sub.1,K,x.sub.255]=b.Math.D   [Formula 5],

where D is a 256×256 interleaving matrix, when D is a unit array, it indicates that the bits are not interleaved, the interleaved bits are serial-to-parallel converted to form 8 bits streams, respectively containing 40, 40, 40, 32, 32, 24, 24, and 24 bits, which is expressed as:

x.sub.0=[x.sub.0,x.sub.1,K,x.sub.39]

x.sub.1=[x.sub.40,x.sub.41,K,x.sub.79]

x.sub.2=[x.sub.80,x.sub.81,K,x.sub.119]

x.sub.3=[x.sub.120,x.sub.121,K,x.sub.151]

x.sub.4=[x.sub.152,x.sub.153,K,x.sub.183]

x.sub.5=[x.sub.184,x.sub.185,K,x.sub.207]

x.sub.6=[x.sub.208,x.sub.209,K,x.sub.231]

x.sub.7=[x.sub.232,x.sub.233,K,x.sub.255]  [Formula 6]

at this time, M.sup.t=8; K.sub.0.sup.t=40, K.sub.1.sup.t=40, K.sub.2.sup.t=40; K.sub.3.sup.t=32, K.sub.4.sup.t=32; K.sub.5.sup.t=24, K.sub.6.sup.t=24, K.sub.7.sup.t=24.

[0060] In Step 3, the sending terminal selects the coding structure according to the code words of the time-domain, and encodes each data stream according to the coding rate of the time-domain, and finally forms data blocks of equal length in the time-domain by rate matching.

[0061] The sending terminal adopts W.sub.2.sup.t coding for x.sub.0, x.sub.1 and x.sub.2 to generate 96 bits, which is expressed as:

y.sub.i=[y.sub.i.sup.0,y.sub.i.sup.1,K,y.sub.i.sup.95]=x.sub.i.Math.W.sub.2.sup.t, 0≤i≤2   [Formula 7],

the sending terminal adopts W.sub.1.sup.t coding for x.sub.3 and x.sub.4 to generate 96 bits, which is expressed as:

y.sub.i=[y.sub.i.sup.0,y.sub.i.sup.1,K,y.sub.i.sup.95]=x.sub.i.Math.W.sub.1.sup.t, 3≤i≤4   [Formula 8],

the sending terminal adopts W.sub.0.sup.t coding for x.sub.5, x.sub.6 and x.sub.7 to generate 96 bits, which is expressed as:

y.sub.i=[y.sub.i.sup.0,y.sub.i.sup.1,K,y.sub.i.sup.95]=x.sub.i.Math.W.sub.0.sup.t, 5≤i≤7   [Formula 9],

it should be noted that when coded bits are greater than or less than 96 bits, the prior art is adopted to puncturing or adding, and then the sending terminal merges y.sub.i into a matrix to obtain:

[00010]$\begin{array}{cc}Y=\left[\begin{array}{c}{y}_0\\ y_1\\ M\\ y_7\end{array}\right]=\left[\begin{array}{cccc}{y}_0^0& y_0^1& L& y_0^{95}\\ y_1^0& y_1^1& L& y_1^{95}\\ M& M& O& M\\ y_7^0& y_7^1& K& y_7^{95}\end{array}\right].& \left[\mathrm{Formula}10\right]\end{array}$

[0062] In Step 4, data in the time-domain are sliced by the sending terminal according to a feedback space-domain coding rate, and M.sup.s data streams are formed in parallel, each data stream has K.sub.i.sup.s bits, where 0≤i≥M.sup.s−1.

[0063] Assuming that the sending terminal sets that M.sup.s=96 and all K.sub.i.sup.s (0≤i≤95) is equal to 8 according to the feedback.

[0064] In Step 5, the coding structure is selected by the sending terminal according to the code word of the space-domain, and each data stream is coded according to the space-domain coding rate, and eventually data blocks containing L bits in the space-domain is formed by the rate matching.

[0065] The sending terminal encodes each column in the space-domain to obtain:

[00011]$\begin{array}{cc}{s}_k=\left[s_0^k,s_1^k,K,s_{31}^k\right]=\left[y_0^k,y_1^k,K,y_7^k\right].Math.W_0^s,& \left[\mathrm{Formula}11\right]\end{array}$$0\le k\le 95.$

[0066] In Step 6, B bits adjacent to each other in the time-domain are modulated according to a feedback modulation mode to form L symbol streams.

[0067] The sending terminal merges two adjacent sets of vectors for the QPSK modulation to obtain a k-th symbol transmitted on an i-th spatial channel as:

z.sub.i.sup.k=s.sub.i.sup.k+j.Math.s.sup.k+1,

k=0,2,4,K,94 i=0,1,2K,31   [Formula 12],

where j represents an imaginary unit without considering a Gery mapping, after the QPSK modulation, B=2, the time-domain has 48 symbols, which satisfies requirements for the latency, when a higher-order modulation such as 16QAM is adopted, adjacent sets of vectors need to be merged.

2.1.2 Time-Domain Slicing has a Plurality of Rows

[0068] The sending terminal firstly interleaves the transmission bits in time and space, which is expressed as:

x=[x.sub.0,x.sub.1,K,x.sub.255]=b.Math.D   [Formula 13],

where D is a 256×256 interleaving matrix, when D is a unit array, it indicates that the bits are not interleaved. The interleaved bits are serial-to-parallel converted to form three bit streams, which contain 120, 64 and 72 bits, respectively, which is expressed as:

x.sub.0=[x.sub.0,x.sub.1,K,x.sub.119]

x.sub.1=[x.sub.120,x.sub.121,K,x.sub.183]

x.sub.2=[x.sub.181,x.sub.185,K,x.sub.255]  [Formula 14],

at this time, M.sup.s=3; K.sub.0.sup.t=120; K.sub.1.sup.t=64; K.sub.2.sup.t=72,
then the sending terminal adopts W.sub.2.sup.t coding for x.sub.0 to generate 288 bits, which is expressed as:

y.sub.0=[y.sub.0.sup.0,y.sub.0.sup.1,K,y.sub.0.sup.287]=x.sub.0.Math.W.sub.2.sup.t   [Formula 15],

the sending terminal adopts W.sub.1.sup.t coding for x.sub.1 to generate 192 bits, which is expressed as:

y.sub.1=[y.sub.1.sup.0,y.sub.1.sup.1,K,y.sub.1.sup.191]=x.sub.1.Math.W.sub.1.sup.t   [Formula 16],

the sending terminal adopts W.sub.0.sup.t coding for x.sub.2 to generate 288 bits, which is expressed as:

y.sub.2=[y.sub.2.sup.0,y.sub.2.sup.1,K,y.sub.2.sup.287]=x.sub.2.Math.W.sub.0.sup.t   [Formula 17],

similarly, the prior art is adopted to puncturing and adding, then, the sending terminal divides y.sub.0 into 3 rows in order, divides y.sub.1 into 2 rows in order, and divides y.sub.2 into 3 rows in order,
to form the matrix as:

[00012]$\begin{array}{cc}Y=\left[y_0,y_1,K,y_{95}\right]=\left[\begin{array}{cccc}{y}_0^0& y_0^1& L& y_0^{95}\\ y_0^{96}& y_0^{97}& L& y_9^{l91}\\ M& M& O& M\\ y_2^{192}& y_2^{193}& K& y_2^{287}\end{array}\right],& \left[\mathrm{Formula}18\right]\end{array}$

when a space-domain slicing occupies 12 columns, the sending terminal needs to encode each 12 columns of Y matrix by adopting W.sub.0.sup.t to generate a total of 8 space-domain code words, which is expressed as:

s.sub.i=[s.sub.0.sup.l,s.sub.1.sup.l,K,s.sub.383.sup.l]=[y.sub.12*l.sup.T,y.sub.12*l+1.sup.T,K,y.sub.12*l+11.sup.T].Math.W.sub.0.sup.s, 0≤l≤7   [Formula 19],

at this time, M.sup.s=8, and all K.sub.i.sup.s (0≤i≤7) are equal to 12, eventually, s.sub.l is divided into 12 columns with 32 elements in each column in order to form:

s.sub.k=[s.sub.0.sup.k,s.sub.1.sup.k,K,s.sub.31.sup.k], 0≤k≤95   Formula 20 .

2.2 Space Time Concatenated Coding Mode

[0069] In Space Time Concatenated Coding Mode, the receiving terminal determines to adopt a QPSK modulation according to a criterion, the space-domain code word adopts W.sub.0.sup.s at a 1/4 coding rate, and the time-domain code word adopts W.sub.0.sup.t, W.sub.1.sup.t and W.sub.2.sup.t at 1/4, 1/3 and 1/2 coding rate. At this time, the receiving terminal needs to feedback a QPSK modulation mode and to send the serial number of W.sub.0.sup.s, W.sub.0.sup.t, W.sub.1.sup.t, and W.sub.2.sup.t to the sending terminal. Assuming that a bit indication is adopted, the size of the code book is 4 bits, and the rank of the channel is 5 bits, a coding rate matching diagram of Space Time Concatenated Coding Mode is obtained as illustrated in FIG. 7.

[0070] FIG. 7 illustrates that there are 8 bit streams, and there are 32 bit streams after the space-domain coding, the first eight of which are coded by W.sub.2.sup.t at a coding rate of 1/2, the middle sixteen of which are coded by W.sub.1.sup.t at a coding rate of 1/3, and the last eight of which are coded by W.sub.0.sup.t at a coding rate of 1/4.

[0071] In Step 7, when adopting a Space Time Concatenated Coding Mode in the time-space two-dimensional coding, the data in the time-domain are sliced by the sending terminal according to a feedback space-domain coding rate, and M.sup.s data streams are formed in parallel, each data stream has K.sub.i.sup.s bits, where 0≤i≥M.sup.s−1.

[0072] The sending terminal firstly interleaves the transmission bits in time and space, which is expressed as:

x=b.Math.D [Formula 21],

where D is a 256×256 interleaving matrix, when D is a unit array, it indicates that the bits are not interleaved, the interleaved bits are serial-to-parallel converted to divide into 8 bits streams on overage, each bit stream has 32 bits, which is expressed in a matrix as:

[00013]$\begin{array}{cc}X=\left[\begin{array}{cccc}{x}_0^0& x_0^1& L& x_0^{31}\\ x_l^0& x_1^l& L& x_1^{31}\\ M& M& O& M\\ x_7^0& x_7^1& K& x_7^{31}\end{array}\right],& \left[\mathrm{Formula}22\right]\end{array}$

at this time, M.sup.s=32, and each K.sub.i.sup.s (0≤i≤7) is equal to 8.

[0073] In Step 8, the coding structure is selected by the sending terminal according to the code words of the space-domain, and each data stream is coded according to the space-domain coding rate, and eventually data blocks containing L bits in the space-domain are formed by rate matching.

[0074] The sending terminal encodes each column of X in the space-domain to obtain:

[00014]$\begin{array}{cc}{y}_k=\left[y_0^k,y_1^k,K,y_{31}^k\right]=\left[x_0^k,x_1^k,K,x_7^k\right].Math.W_0^s,& \left[\mathrm{Formula}23\right]\end{array}$$0\le k\le 31,$

which is expressed as a 32×32 matrix to obtain:

[00015]$\begin{array}{cc}Y=\left[\begin{array}{c}{y}_0\\ y_1\\ M\\ y_{31}\end{array}\right]=\left[\begin{array}{cccc}{y}_0^0& y_0^1& L& y_0^{31}\\ y_1^0& y_1^1& L& y_1^{31}\\ M& M& O& M\\ y_{31}^0& y_{31}^1& K& y_{31}^{31}\end{array}\right].& \left[\mathrm{Formula}24\right]\end{array}$

[0075] In Step 9, the data in the space-domain are sliced according to feedback space-domain coding rates, and M.sup.t data streams are formed in parallel, each data stream has K.sub.i.sup.t bits, where 0≤i≥M.sup.t−1.

[0076] Assuming that the sending terminal sets M.sup.t=32 according to the feedback, all K.sub.i.sup.t (0≤i≤31) are equal to 32.

[0077] In Step 10, the coding structure is selected by the sending terminal according to the code word of the time-domain, each data stream is coded according to the time-domain a coding rate, and eventually the data blocks of the equal length in the time-domain are formed by the rate matching.

[0078] The sending terminal adopts the W.sub.2.sup.t coding for y.sub.0, y.sub.1, . . . , y.sub.7 to generate 96 bits, which is expressed as:

s.sub.i=[s.sub.i.sup.0,s.sub.i.sup.1,K,s.sub.i.sup.95]=y.sub.i.Math.W.sub.2.sup.t, 0≤i≤7   [Formula 25],

the sending terminal adopts the W.sub.1.sup.t coding for y.sub.8, y.sub.9, . . . , y.sub.23 to generate 96 bits, which is expressed as:

s.sub.i=[s.sub.i.sup.0,s.sub.i.sup.1,K,s.sub.i.sup.95]=y.sub.i.Math.W.sub.1.sup.t, 8≤i≤23   [Formula 25],

the sending terminal adopts W.sub.0.sup.t coding for y.sub.24, y.sub.25, . . . , y.sub.31 to generate 96 bits, which is expressed as:

s.sub.i=[s.sub.i.sup.0,s.sub.i.sup.1,K,s.sub.i.sup.95]=y.sub.i.Math.W.sub.0.sup.t, 24≤i≤31   [Formula 27],

it should be noted that when coded bits are greater than or less than 96 bits, the prior art is adopted puncturing or adding.

[0079] In Step 11, the B bits adjacent to each other in the time-domain are modulated according to feedback modulation mode to form the L symbol streams.

[0080] The sending terminal performs the QPSK modulation on s.sub.i to obtain the k-th symbol transmitted on the i-th space channel as:

z.sub.i.sup.k=s.sub.i.sup.k+j.Math.s.sup.k+1,

k=0,2,4,K,94 i=0,1,2K,31   [Formula 28],

after the QPSK modulation (B=2), the time-domain has 48 symbols, which satisfies the requirements for the latency. FIG. 8 illustrates a schematic diagram of the Space Time Concatenated Coding Mode, and the specific process is as illustrated in FIG. 8.

3. Operation Process of the Present Disclosure

[0081] According to the above descriptions, a transmission method based on time-space two-dimensional coding can be obtained. The implementation steps are as follows.

[0082] In Step 1, a pilot signal is sent by a sending terminal, a channel is estimated by a receiving terminal, appropriate code word serial numbers, modulation modes, rate matching tables and space-time slicing modes for a time-domain coding and a space-domain coding are selected according to requirements for a transmission time rate, a latency and a code error rate in different scenarios, and then the sending terminal is fed back together with a rank L of the channel.

[0083] In Step 2, when adopting a Time Space Concatenated Coding Mode in the time-space two-dimensional coding, data in the space-domain are sliced by the sending terminal according to a feedback time-domain coding rate, and M.sup.t data streams are formed in parallel, each data stream has K.sub.i.sup.t bits, where 0≤i≥M.sup.t−1.

[0084] In Step 3, a coding structure is selected by the sending terminal according to a code word of the time-domain, and each data stream is coded according to the time-domain coding rate, and eventually data blocks of an equal length in the time-domain are formed by a rate matching.

[0085] In Step 4, data in the time-domain are sliced by the sending terminal according to a feedback space-domain coding rate, and M.sup.s data streams are formed in parallel, each data stream has K.sub.i.sup.s bits, where 0≤i≥M.sup.s−1.

[0086] In Step 5, the coding structure is selected by the sending terminal according to a code word of the space-domain, and each data stream is coded according to the space-domain coding rate, and eventually data blocks containing L bits in the space-domain is formed by the rate matching.

[0087] In Step 6, B bits adjacent to each other in the time-domain are modulated according to a feedback modulation mode to form L symbol streams.

[0088] In Step 7, when adopting a Space Time Concatenated Coding Mode in the time-space two-dimensional coding, the data in the time-domain are sliced by the sending terminal according to a feedback space-domain coding rate, and M.sup.s data streams are formed in parallel, each data stream has K.sub.i.sup.s bits, where 0≤i≥M.sup.s−1.

[0089] In Step 8, the coding structure is selected by the sending terminal according to the code word of the space-domain, and each data stream is coded according to the space-domain coding rate, and eventually data blocks containing L bits in the space-domain are formed by rate matching.

[0090] In Step 9, the data in the space-domain are sliced according to feedback space-domain coding rate, and M.sup.t data streams are formed in parallel, each data stream has K.sub.i.sup.t bits, where 0≤i≥M.sup.t−1.

[0091] In Step 10, the coding structure is selected by the sending terminal according to the code word of the time-domain, and each data stream is coded according to the time-domain coding rate, and eventually the data blocks of the equal length in the time-domain are formed by the rate matching.

[0092] In step 11, the B bits adjacent to each other in the time-domain are modulated according to feedback modulation mode to form the L symbol streams.

[0093] The code word refers to the generation matrix of the channel coding; the coding rate refers to the length of the information bit divided by the coded-block length, B represents the number of bits contained in the constellation map with different modulation modes. In addition, the Time-space Two-dimensional Coding (Time-Space Channel Coding) proposed by the present disclosure may also be referred to as a Joint Channel Coding, a Multi-layer Joint Coding, a Layer Coding, or a Two-dimensional Channel Coding (Two Dimensions Channel Coding).

4. Code Error Rate Performance of the Present Disclosure

[0094] FIG. 9 illustrates a preliminary comparison of simulation results, that is, a comparison diagram of the code error rate. The 320 information bits are divided into 8 rows and 40 columns. Both the space domain and the time domain are coded by adopting a Polar code at a 1/2 coding rate, and the decoding algorithm adopts a cyclic redundancy check (CRC)-assisted serial cancellation list (CASCL) method with a CRC length of 24 and 16QAM modulation. In order to simplify the calculation, both the space-domain and the time-domain channels are replaced by white Gaussian noise channels. The influence of the space-domain decoding results on the time-domain decoding is equivalent to the noise of the same power. It can be seen from FIG. 9 that the existing system can only encode in the time-domain and cannot establish the connection between space-domains. Therefore, when the code length is relatively short, the bit error rate performance is relatively poor and cannot enter the “waterfall” area, as shown in the curve “one-dimensional coding” in FIG. 9. The Two-Dimensional Channel Coding proposed in the present disclosure is simultaneously coded in both the time-domain and the space-domain, and the relatively greater performance gain is obtained by increasing the channel in the space dimension. The curve “two-dimensional coding 1” in the figure means that every 1 row is taken as a time-domain slicing, and every 13 is taken as a space-domain slicing, while the curve “two-dimensional coding 2” means that every 1 row is taken as a time-domain slicing, and every 29 is taken as a space-domain slicing, and the rest part is not coded. It should be noted that because the coding structure and receiving algorithm are not optimized, the performance of two-dimensional coding is not as good as that of one dimension coding when the signal-to-noise ratio is relatively low.

[0095] It should be noted that the above embodiments are not used to limit the protection scope of the present disclosure, and all the equivalent transformations or substitutions made on the basis of the above technical solutions fall within the protection scope of the claims of the present disclosure.