CN102664659B - Multicarrier MISO (multiple input single output) system based on chip-level space-time coding - Google Patents

Abstract

The invention discloses a multicarrier MISO (multiple input single output) communication method based on chip-level space-time coding, relates to the multicarrier MISO communication method and aims at solving the problem of poor resistance to multi-user interference of the prior multicarrier MISO system adopting the space-time coding, wherein a signal emission process comprises the following steps: the data of a user K is converted into a polarized non-return-to-zero code through source encoding; the frequency is spread by different sub-codes and then loaded to the corresponding frequency, and then the signal is transmitted to a channel by an antenna; a signal reception process comprises the following steps: the received data passes through a band pass filter to obtain the signals on different carriers; and then modulation is carried out by the corresponding frequency and de-spreading is carried out by the corresponding sub-code; the obtained signals are integrated within one bit time; and then the data of the same antenna is added; and the data obtained after adding is subjected to equal-gain combining, and then a decision is output. The system is adaptable to a wireless communication process.

Description

Multicarrier MISO communication means based on chip-level Space Time Coding

Technical field

The present invention relates to a kind of multicarrier MISO communication means.

Background technology

Within 1998, Siavash M.Alamouti has proposed the single output of a simple many inputs (Multiple Input Single Output, MISO) system is to realize transmission diversity, originally can only rely on receiving terminal to use the many output of single input (the Single Input Multiple Output of many antennas, SIMO) system reaches diversity, further can deduce into transmitting terminal, receiving terminal is all used multiple-input and multiple-output (the Multiple Input Multiple Output) system of two antennas.

Space Time Coding is the coded system that current MISO system is commonly used to implementation space diversity, its coded system has many kinds, more common space-time block code (the Space-Time Block Code that mainly contains, STBC), space-time grid coding (Space-Time Trellis Code, STTC) differential coding (Space-Time Differential Code, STDC) etc. and when empty.But it is not the shortcoming of Space Time Coding maximum is the problem of not considering that multipath disturbs, feasible under multipath disturbs.Although some paper is considered the orthogonality between multi-user multi-antenna, what they discussed is the orthogonality of bit-level, and the orthogonality of chip-level is not discussed, and it can only be used for the situation that channel response is slow fading.Do Space Time Coding with several symbol bits, channel response just must remain unchanged within the time of these symbol bits, otherwise error rate can greatly rise, this has obviously run counter to next generation wireless communication two-forty, high spectrum utilization, anti-multipath, the harsh demands such as anti-Doppler effect.And when decoding, must harvest for whole bits of space-time code and can solve signal, cannot reach timely decoding.

Summary of the invention

The present invention is the poor problem of resisting multi-user jamming performance of the multicarrier MISO system in order to solve current employing Space Time Coding, thereby a kind of multicarrier MISO communication means based on chip-level Space Time Coding is provided.

Multicarrier MISO communication means based on chip-level Space Time Coding, for each user K, its signal emission process is:

Step 1, data to be sent are carried out to information source coding, obtain polarization nonreturn to zero code;

Step 2, the polarization nonreturn to zero code that adopts M group three-dimensional complementary code respectively step 1 to be obtained carry out spread spectrum, every group of corresponding data that obtain after the spread spectrum of M road of three-dimensional complementary code; The M group three-dimensional complementary code corresponding data that obtain after the spread spectrum of M × M road altogether;

Step 3, adopt respectively M way carrier wave to modulate the data after corresponding the every group of three-dimensional complementary code obtaining in the step 2 M road spread spectrum obtaining, obtain M road modulation signal, M way carrier wave respectively corresponding frequency is f ₁, f ₂..., f _m; Data after the spread spectrum of M × M road obtain M × M road modulation signal altogether;

Step 4, the M road modulation signal of every group of three-dimensional complementary code correspondence obtaining in rapid three is carried out to equal gain combining, obtain a road modulation signal; M × M road modulation signal obtains M road modulation signal altogether; Described M road modulation signal is sent to channel by M transmit antennas respectively;

For each user K, its signal receiving course is:

Step 5, the M road modulation signal of launching by a reception antenna receiving step four, and adopt band pass filter to carry out filtering the M road modulation signal r (t) receiving, obtain M road filtering signal; The frequency of described M road filtering signal is respectively f ₁, f ₂..., f _m;

Step 6, adopt respectively the subcarrier of respective frequencies to carry out demodulation step 5 Zhong Mei road filtering signal, obtain a group demodulation signal; M road filtering signal obtains M group demodulation signal altogether;

Step 7, adopt the M road three-dimensional complementary code corresponding with transmitting terminal to carry out despreading the every group demodulation signal obtaining in step 6, obtain one group of despread signal that comprises M road; M group demodulation signal obtains M group despread signal altogether;

The despread signal on M road in step 8, step 7 is obtained every group is respectively a bit time T _bunder carry out integration, obtain one group of integration data that comprises M road integral result; After the despreading of M group, data obtain M group integration data altogether;

Step 9, the M road integral result in the every group of integration data obtaining in step 8 is added to data after obtaining a road and being added, data after M group integration data obtains altogether M road and is added;

After step 10, the M road that step 9 is obtained are added, data are carried out equal gain combining, data after acquisition one tunnel merges;

Step 11, by step 10, obtain Yi road merge after data adjudicate rear output;

M is positive integer.

The production method of the three-dimensional complementary code described in step 2 and step 8 is:

It is M that step I, two M × M orthogonal dimension matrix A of employing and B construct M length ²sequence C ₁, C ₂... C _m:

${\mathrm{<figure-callout\; id="1"\; label="C"\; filenames="HDA0000151907330000011.png,HDA0000151907330000021.png"\; state="\{\{state\}\}">C</figure-callout>}}_1=(b_{11}{A}_1,b_{12}{A}_2,...,b_{1M}{A}_M)=(c_{11},c_{12},...,c_{{1M}^2})$

${\mathrm{<figure-callout\; id="2"\; label="C"\; filenames="HDA0000151907330000011.png"\; state="\{\{state\}\}">C</figure-callout>}}_2=(b_{21}{A}_1,b_{22}{a}_2,...,b_{2M}{A}_M)=(c_{21},c_{22},...,c_{{2M}^2})$

$C_M=(b_{M1}{\mathrm{<figure-callout\; id="1"\; label="A"\; filenames="HDA0000151907330000011.png,HDA0000151907330000021.png"\; state="\{\{state\}\}">A</figure-callout>}}_1,b_{M2}{\mathrm{<figure-callout\; id="2"\; label="A"\; filenames="HDA0000151907330000011.png"\; state="\{\{state\}\}">A</figure-callout>}}_2,...,b_{\mathrm{MM}}{A}_M)=({\mathrm{<figure-callout\; id="1"\; label="c\; M"\; filenames="HDA0000151907330000011.png,HDA0000151907330000021.png"\; state="\{\{state\}\}">c</figure-callout>}}_M,{\mathrm{<figure-callout\; id="2"\; label="c\; M"\; filenames="HDA0000151907330000011.png"\; state="\{\{state\}\}">c</figure-callout>}}_M,...,c_{{\mathrm{MM}}^2})$

Wherein: the expression formula of orthogonal matrix A is:

$A=\left[a_{\mathrm{ij}}\right]=\left[\begin{array}{c}{A}_1\\ A_2\\ .\\ .\\ .\\ A_M\end{array}\right];\left|a_{\mathrm{ij}}\right|=1$

The expression formula of orthogonal matrix B is:

B=[b _ij];|b _ij|=1

Wherein: i, j=1,2 ..., M;

Step II, M the length that step I is obtained are M ²sequence C ₁, C ₂... C _mwith M × M orthogonal dimension matrix

construct N _t× M ²individual length is M ²sequence; Described N _t× M ²individual sequence composition N _t× M organizes complete complementary code:

$E_1^{\left(n_t\right)}=\{E_{11}^{\left(n_t\right)},E_{12}^{\left(n_t\right)},...,E_{1M}^{\left(n_t\right)}\}$

$E_2^{\left(n_t\right)}=\{E_{21}^{\left(n_t\right)},E_{22}^{\left(n_t\right)},...,E_{2M}^{\left(n_t\right)}\}$

$E_M^{\left(n_t\right)}=\{E_{M1}^{\left(n_t\right)},E_{M2}^{\left(n_t\right)},...,E_{\mathrm{MM}}^{\left(n_t\right)}\}$

Wherein: n _t=1,2 ..., N _t; N _t=M is number of transmit antennas;

Orthogonal matrix

expression formula be:

$D=\underset{n_t=1}{\overset{N_T}{\mathrm{\&Sigma;}}}{D}^{\left(n_t\right)}=\underset{n_t=1}{\overset{N_T}{\mathrm{\&Sigma;}}}\left[d_{\mathrm{ij}}^{\left(n_t\right)}\right]=\left[d_{\mathrm{ij}}\right];$

Step II I, the mode that adopts mutual insertion to arrange the subcode in above-mentioned each complete complementary code form a sequence:

$\begin{array}{c}{F}_i^{\left(n_t\right)}=(e_{i11}^{\left(n_t\right)},e_{i21}^{\left(n_t\right)},...,e_{\mathrm{iM}1}^{\left(n_t\right)},e_{i12}^{\left(n_t\right)},e_{i22}^{\left(n_t\right)},...,\\ e_{\mathrm{iM}2}^{\left(n_t\right)},...,e_{{i1M}^{r-1}}^{\left(n_t\right)},...,e_{{\mathrm{iMM}}^{r-1}}^{\left(n_t\right)}\\ =(f_{i1}^{\left(n_t\right)},f_{i2}^{\left(n_t\right)},...,f_{{\mathrm{iM}}^r}^{\left(n_t\right)})\end{array}$

Wherein i=1,2 ..., M; M ^r-1for the subcode length in complete complementary code; The initial value of r is 3;

And by the sequence obtaining

replace the sequence C in Step II ₁, C ₂... C _m, return to execution step II.Can repeatedly perform step II and Step II I, the complete complementary code that every execution once constructs

extended length M doubly, finally obtains three-dimensional complementary code

$X_k^{\left(n_t\right)}=E_k^{\left(n_t\right)}=\{E_{k1}^{\left(n_t\right)},E_{k2}^{\left(n_t\right)},...,E_{\mathrm{kM}}^{\left(n_t\right)}\}$

Wherein: k=1,2 ..., M;

The N constructing in Step II _t× M ²individual length is M ²sequence be:

$\begin{array}{c}{E}_{\mathrm{ij}}^{\left(n_t\right)}=(c_{i1}{d}_{j1}^{\left(n_t\right)},...,c_{\mathrm{iM}}{d}_{\mathrm{jM}}^{\left(n_t\right)},c_{i(M+1)}{d}_{j1}^{\left(n_t\right)},...,\\ c_{i\left(2M\right)}{d}_{\mathrm{jM}}^{\left(n_t\right)},...,c_{i(M^2-M+1)}{d}_{j1}^{\left(n_t\right)},...,c_{{\mathrm{iM}}^2}{d}_{\mathrm{jM}}^{\left(n_t\right)}.\\ =(e_{\mathrm{ij}1}^{\left(n_t\right)},e_{\mathrm{ij}2}^{\left(n_t\right)},...,e_{{\mathrm{ijM}}^2}^{\left(n_t\right)})\end{array}$

Described in step I, orthogonal matrix A and B all adopt Hadarmard matrix.

The production method of the D of orthogonal matrix described in Step II is: take Seed Matrix as basis, utilize Kronecker product to expand dimension;

Described Seed Matrix is:

$\begin{array}{cc}{\mathrm{<figure-callout\; id="2"\; label="D"\; filenames="HDA0000151907330000011.png"\; state="\{\{state\}\}">D</figure-callout>}}_{2\&times;2}^{\left(1\right)}=\left[\begin{array}{cc}+& +\\ +& -\end{array}\right]& {\mathrm{<figure-callout\; id="2"\; label="D"\; filenames="HDA0000151907330000011.png"\; state="\{\{state\}\}">D</figure-callout>}}_{2\&times;2}^{\left(2\right)}=\left[\begin{array}{cc}+& -\\ +& +\end{array}\right]\end{array}$

The resisting multi-user jamming performance of MISO system of the present invention is strong, can effectively overcome multipath and disturb caused frequency selective fading.

Accompanying drawing explanation

Fig. 1 is the signal processing schematic diagram of signal transmitting terminal of the present invention; Fig. 2 is the signal processing schematic diagram of signal receiving end of the present invention.

Embodiment

Embodiment one, in conjunction with Fig. 1 and Fig. 2, this embodiment is described, the multicarrier MISO communication means based on chip-level Space Time Coding, for each user K, its signal emission process is:

Step 1, data to be sent are carried out to information source coding, obtain polarization nonreturn to zero code;

Step 2, the polarization nonreturn to zero code that adopts M group three-dimensional complementary code respectively step 1 to be obtained carry out spread spectrum, every group of corresponding data that obtain after the spread spectrum of M road of three-dimensional complementary code; The M group three-dimensional complementary code corresponding data that obtain after the spread spectrum of M × M road altogether;

Step 3, adopt respectively M way carrier wave to modulate the data after corresponding the every group of three-dimensional complementary code obtaining in the step 2 M road spread spectrum obtaining, obtain M road modulation signal, M way carrier wave respectively corresponding frequency is f ₁, f ₂..., f _m; Data after the spread spectrum of M × M road obtain M × M road modulation signal altogether;

Step 4, the M road modulation signal of every group of three-dimensional complementary code correspondence obtaining in rapid three is carried out to equal gain combining, obtain a road modulation signal; M × M road modulation signal obtains M road modulation signal altogether; Described M road modulation signal is sent to channel by M transmit antennas respectively;

For each user K, its signal receiving course is:

Step 5, the M road modulation signal of launching by a reception antenna receiving step four, and adopt band pass filter to carry out filtering the M road modulation signal r (t) receiving, obtain M road filtering signal; The frequency of described M road filtering signal is respectively f ₁, f ₂..., f _m;

Step 6, adopt respectively the subcarrier of respective frequencies to carry out demodulation step 5 Zhong Mei road filtering signal, obtain a group demodulation signal; M road filtering signal obtains M group demodulation signal altogether;

Step 7, adopt the M road three-dimensional complementary code corresponding with transmitting terminal to carry out despreading the every group demodulation signal obtaining in step 6, obtain one group of despread signal that comprises M road; M group demodulation signal obtains M group despread signal altogether;

The despread signal on M road in step 8, step 7 is obtained every group is respectively a bit time T _bunder carry out integration, obtain one group of integration data that comprises M road integral result; After the despreading of M group, data obtain M group integration data altogether; N is positive number;

Step 9, the M road integral result in the every group of integration data obtaining in step 8 is added to data after obtaining a road and being added, data after M group integration data obtains altogether M road and is added;

After step 10, the M road that step 9 is obtained are added, data are carried out equal gain combining, data after acquisition one tunnel merges;

Step 11, by step 10, obtain Yi road merge after data adjudicate rear output;

M is positive integer.

The production method of the three-dimensional complementary code described in step 2 and step 8 is:

It is M that step I, two M × M orthogonal dimension matrix A of employing and B construct M length ²sequence C ₁, C ₂... C _m:

${\mathrm{<figure-callout\; id="1"\; label="C"\; filenames="HDA0000151907330000011.png,HDA0000151907330000021.png"\; state="\{\{state\}\}">C</figure-callout>}}_1=(b_{11}{\mathrm{<figure-callout\; id="1"\; label="A"\; filenames="HDA0000151907330000011.png,HDA0000151907330000021.png"\; state="\{\{state\}\}">A</figure-callout>}}_1,b_{12}{\mathrm{<figure-callout\; id="2"\; label="A"\; filenames="HDA0000151907330000011.png"\; state="\{\{state\}\}">A</figure-callout>}}_2,...,b_{1M}{A}_M)=(c_{11},c_{12},...,c_{{1M}^2})$

${\mathrm{<figure-callout\; id="2"\; label="C"\; filenames="HDA0000151907330000011.png"\; state="\{\{state\}\}">C</figure-callout>}}_2=(b_{21}{\mathrm{<figure-callout\; id="1"\; label="A"\; filenames="HDA0000151907330000011.png,HDA0000151907330000021.png"\; state="\{\{state\}\}">A</figure-callout>}}_1,b_{22}{\mathrm{<figure-callout\; id="2"\; label="A"\; filenames="HDA0000151907330000011.png"\; state="\{\{state\}\}">A</figure-callout>}}_2,...,b_{2M}{A}_M)=(c_{21},c_{22},...,c_{{2M}^2})---\left(4\right)$

$C_M=(b_{M1}{\mathrm{<figure-callout\; id="1"\; label="A"\; filenames="HDA0000151907330000011.png,HDA0000151907330000021.png"\; state="\{\{state\}\}">A</figure-callout>}}_1,b_{M2}{\mathrm{<figure-callout\; id="2"\; label="A"\; filenames="HDA0000151907330000011.png"\; state="\{\{state\}\}">A</figure-callout>}}_2,...,b_{\mathrm{MN}}{A}_M)=(c_{\mathrm{<figure-callout\; id="1"\; label="M"\; filenames="HDA0000151907330000011.png,HDA0000151907330000021.png"\; state="\{\{state\}\}">M</figure-callout>}1},{\mathrm{<figure-callout\; id="2"\; label="c\; M"\; filenames="HDA0000151907330000011.png"\; state="\{\{state\}\}">c</figure-callout>}}_M,...,c_{{\mathrm{MM}}^2})$

Wherein: the expression formula of orthogonal matrix A is:

$A=\left[a_{\mathrm{ij}}\right]=\left[\begin{array}{c}{A}_1\\ {\mathrm{<figure-callout\; id="2"\; label="A"\; filenames="HDA0000151907330000011.png"\; state="\{\{state\}\}">A</figure-callout>}}_2\\ .\\ .\\ .\\ A_M\end{array}\right];\left|a_{\mathrm{ij}}\right|=1$

The expression formula of orthogonal matrix B is:

B=[b _ij];|b _ij|=1 （3）

Wherein: i, j=1,2 ..., M;

Step II, M the length that step I is obtained are M ²sequence C ₁, C ₂... C _mwith M × M orthogonal dimension matrix construct N _t× M ²individual length is M ²sequence; Described N _t× M ²individual sequence composition N _t× M organizes complete complementary code:

$\begin{array}{c}{E}_1^{\left(n_t\right)}=\{E_{11}^{\left(n_t\right)},E_{12}^{\left(n_t\right)},...,E_{1M}^{\left(n_t\right)}\}\\ E_2^{\left(n_t\right)}=\{E_{21}^{\left(n_t\right)},E_{22}^{\left(n_t\right)},...,E_{2M}^{\left(n_t\right)}\}\\ .\\ .\\ .\\ E_M^{\left(n_t\right)}=\{E_{M1}^{\left(n_t\right)},E_{M2}^{\left(n_t\right)},...,E_{\mathrm{MM}}^{\left(n_t\right)}\}\end{array}---\left(8\right)$

Wherein: n _t=1,2 ..., N _t; N _t=M is number of transmit antennas;

Orthogonal matrix

expression formula be:

$D=\underset{n_t=1}{\overset{N_T}{\mathrm{\&Sigma;}}}{D}^{\left(n_t\right)}=\underset{n_t=1}{\overset{N_T}{\mathrm{\&Sigma;}}}\left[d_{\mathrm{ij}}^{\left(n_t\right)}\right]=\left[d_{\mathrm{ij}}\right];---\left(6\right)$

in matrix, each element is that plural number and mould are 1:

$D^{\left(n_t\right)}=\left[d_{\mathrm{ij}}^{\left(n_t\right)}\right];\left|d_{\mathrm{ij}}^{\left(n_t\right)}\right|=1---\left(5\right)$

Step II I, the mode that adopts mutual insertion to arrange the subcode in above-mentioned each complete complementary code form a sequence:

$\begin{array}{c}{F}_i^{\left(n_t\right)}=(e_{i11}^{\left(n_t\right)},e_{i21}^{\left(n_t\right)},...,e_{\mathrm{iM}1}^{\left(n_t\right)},e_{i12}^{\left(n_t\right)},e_{i22}^{\left(n_t\right)},...,\\ e_{\mathrm{iM}2}^{\left(n_t\right)},...,e_{{i1M}^{r-1}}^{\left(n_t\right)},...,e_{{\mathrm{iMM}}^{r-1}}^{\left(n_t\right)}\\ =(f_{i1}^{\left(n_t\right)},f_{i2}^{\left(n_t\right)},...,f_{{\mathrm{iM}}^r}^{\left(n_t\right)})\end{array}---\left(9\right)$

Wherein i=1,2 ..., M; M ^r-1for the subcode length in complete complementary code; The initial value of r is 3;

And by the sequence obtaining

replace the sequence C in Step II ₁, C ₂... C _m, return to execution step II.Can repeatedly perform step II and Step II I, every execution once, the complete complementary code constructing

extended length M doubly, finally obtains three-dimensional complementary code

$X_k^{\left(n_t\right)}=E_k^{\left(n_t\right)}=\{E_{k1}^{\left(n_t\right)},E_{k2}^{\left(n_t\right)},...,E_{\mathrm{kM}}^{\left(n_t\right)}\}---\left(10\right)$

Wherein: k=1,2 ..., M;

The N constructing in Step II _t× M ²individual length is M ²sequence be:

$\begin{array}{c}{E}_{\mathrm{ij}}^{\left(n_t\right)}=(c_{i1}{d}_{j1}^{\left(n_t\right)},...,c_{\mathrm{iM}}{d}_{\mathrm{jM}}^{\left(n_t\right)},c_{i(M+1)}{d}_{j1}^{\left(n_t\right)},...,\\ c_{i\left(2M\right)}{d}_{\mathrm{jM}}^{\left(n_t\right)},...,c_{i(M^2-M+1)}{d}_{j1}^{\left(n_t\right)},...,c_{{\mathrm{iM}}^2}{d}_{\mathrm{jM}}^{\left(n_t\right)}.\\ =(e_{\mathrm{ij}1}^{\left(n_t\right)},e_{\mathrm{ij}2}^{\left(n_t\right)},...,e_{{\mathrm{ijM}}^2}^{\left(n_t\right)})\end{array}---\left(7\right)$

Described in step I, orthogonal matrix A and B all adopt Hadarmard matrix.

The producing method of Hadarmard matrix is that then the orthogonal matrix of first looking for 2 × 2 utilizes Kronecker product to expand his dimension.

Kronecker product is defined as follows:

If two matrix A _{m × n}and B _{q × l}be Kronecker product, we are expressed as

then obtain the matrix of a mq × nl.And

be defined as follows:

Following 2 × 2 matrix H _{2 × 2}:

${\mathrm{<figure-callout\; id="2"\; label="H"\; filenames="HDA0000151907330000011.png"\; state="\{\{state\}\}">H</figure-callout>}}_{2\&times;2}=\left[\begin{array}{cc}+& +\\ +& -\end{array}\right]---\left(13\right)$

Utilize Kronecker product dimension can be expanded into 4 × 4, that is:

$H_{4\&times;4}={\mathrm{<figure-callout\; id="2"\; label="H"\; filenames="HDA0000151907330000011.png"\; state="\{\{state\}\}">H</figure-callout>}}_{2\&times;2}\&CircleTimes;{\mathrm{<figure-callout\; id="2"\; label="H"\; filenames="HDA0000151907330000011.png"\; state="\{\{state\}\}">H</figure-callout>}}_{2\&times;2}$

$H_{4\&times;4}={\mathrm{<figure-callout\; id="2"\; label="H"\; filenames="HDA0000151907330000011.png"\; state="\{\{state\}\}">H</figure-callout>}}_{2\&times;2}\&CircleTimes;{\mathrm{<figure-callout\; id="2"\; label="H"\; filenames="HDA0000151907330000011.png"\; state="\{\{state\}\}">H</figure-callout>}}_{2\&times;2}=\left[\begin{array}{cc}+{\mathrm{<figure-callout\; id="2"\; label="H"\; filenames="HDA0000151907330000011.png"\; state="\{\{state\}\}">H</figure-callout>}}_{2\&times;2}& +{\mathrm{<figure-callout\; id="2"\; label="H"\; filenames="HDA0000151907330000011.png"\; state="\{\{state\}\}">H</figure-callout>}}_{2\&times;2}\\ +{\mathrm{<figure-callout\; id="2"\; label="H"\; filenames="HDA0000151907330000011.png"\; state="\{\{state\}\}">H</figure-callout>}}_{2\&times;2}& -{\mathrm{<figure-callout\; id="2"\; label="H"\; filenames="HDA0000151907330000011.png"\; state="\{\{state\}\}">H</figure-callout>}}_{2\&times;2}\end{array}\right]=\left[\begin{array}{cccc}+& +& +& +\\ +& -& +& -\\ +& +& -& -\\ +& -& -& +\end{array}\right]---\left(14\right)$

The Hadamard matrix of other dimensions is all to continue to expand with the method.

Described in step II, the production method of orthogonal matrix D is: take Seed Matrix as basis, utilize Kronecker product to expand dimension;

Described Seed Matrix is:

$\begin{array}{cc}{\mathrm{<figure-callout\; id="2"\; label="D"\; filenames="HDA0000151907330000011.png"\; state="\{\{state\}\}">D</figure-callout>}}_{2\&times;2}^{\left(1\right)}=\left[\begin{array}{cc}+& +\\ +& -\end{array}\right]& {\mathrm{<figure-callout\; id="2"\; label="D"\; filenames="HDA0000151907330000011.png"\; state="\{\{state\}\}">D</figure-callout>}}_{2\&times;2}^{\left(2\right)}=\left[\begin{array}{cc}+& -\\ +& +\end{array}\right]\end{array}---\left(15\right)$

Utilizing Kronecker product that its dimension is expanded.

The producing method of these matrix group can represent with following tree:

K represents the level of tree-shaped mechanism, and every one deck has 2 ^kindividual matrix, the dimension of its each orthogonal matrix is 2 ^k× 2 ^k.

No matter dimension is that how many matrixes all can be produced through Kronecker product by Seed Matrix at the beginning.Product number of Kronecker of the matrix process of two identical dimensional is identical, and the sequence of just wherein multiplying each other is incomplete same.Because Kronecker product is the character that there is no exchangeability, the code of its generation can not repeat, and guarantees that only the characteristic of interblock and the code character seed of selected orthogonal matrix have absolute relation for the code character difference that produces.

Below, with the producing method of the three-dimensional complementary code in design parameter explanation the present invention, take number of users as 2 as example, antenna number is 2, subcode number 2, and code length 8, first produces A and B according to Hadarmard matrix:

$A=\left[\begin{array}{cc}+& +\\ +& -\end{array}\right],B=\left[\begin{array}{cc}+& +\\ +& -\end{array}\right]$

Utilize method in A and B and (4) to produce 2 sequences that length is 4

C ₁=(+ + + -)

C ₂=(+ + - +)

Utilize (11)～(14) to obtain D matrix:

$\begin{array}{cc}{\mathrm{<figure-callout\; id="2"\; label="D"\; filenames="HDA0000151907330000011.png"\; state="\{\{state\}\}">D</figure-callout>}}_{2\&times;2}^{\left(1\right)}=\left[\begin{array}{cc}+& +\\ +& -\end{array}\right]& {\mathrm{<figure-callout\; id="2"\; label="D"\; filenames="HDA0000151907330000011.png"\; state="\{\{state\}\}">D</figure-callout>}}_{2\&times;2}^{\left(2\right)}=\left[\begin{array}{cc}-& +\\ +& +\end{array}\right]\end{array}$

Utilize (6), (7) obtain three-dimensional complementary code E:

$E_1^{\left(1\right)}=\left\{\begin{array}{ccccccc}+& +& +& -,+& -& +& +\end{array}\right\}$

$E_2^{\left(1\right)}=\left\{\begin{array}{ccccccc}+& +& -& +,+& -& -& -\end{array}\right\}$

$E_1^{\left(2\right)}=\left\{\begin{array}{ccccccc}+& +& +& -,+& -& +& +\end{array}\right\}$

$E_2^{\left(2\right)}=\left\{\begin{array}{ccccccc}+& +& +& -,+& -& +& +\end{array}\right\}$

Utilize (8) mutual-complementing code that is expanded:

$E_1^{\left(1\right)}=\left\{\begin{array}{ccccccccccccccc}+& +& +& -& +& +& -& +,+& -& +& +& +& -& -& -\end{array}\right\}$

$E_2^{\left(1\right)}=\left\{\begin{array}{ccccccccccccccc}+& +& +& -& +& +& -& +,+& -& +& +& +& -& -& -\end{array}\right\}$

$E_1^{\left(2\right)}=\left\{\begin{array}{ccccccccccccccc}+& +& +& -& +& +& -& +,+& -& +& +& +& -& -& -\end{array}\right\}$

$E_2^{\left(2\right)}=\left\{\begin{array}{ccccccccccccccc}+& +& +& -& +& +& -& +,+& -& +& +& +& -& -& -\end{array}\right\}$

Below for adopting the code generation method in the present invention, the three-dimensional complementary code producing for MISO system.In " { } ", be same user's spread spectrum code character, "; " spaced apart same user is for the mutual-complementing code matrix of different antennae, the spread spectrum subcode on ", " spaced apart same antenna in different sub carrier.

Number of users 2, subcode number 2, code length 8, antenna number 2

$\{E_1^{\left(1\right)};E_1^{\left(2\right)}\}=\{(+++-+++-+,+-+++---);(++-++++-,-+++-+--)\}$

$\{E_2^{\left(1\right)};E_2^{\left(2\right)}\}=\{(+++-+++-+,+-+++---);(++-++++-,-+++-+--)\}$

Number of users 2, subcode number 2, code length 16, antenna number 2

$\begin{array}{c}\{E_1^{\left(1\right)};E_1^{\left(2\right)}\}=\left\{\right(+++-++-++++---+-,+-+++---+-++-+++);(---+++-+---+--+-,\\ +-++-++++-+++---\left)\right\}\end{array}$

$\begin{array}{c}\{E_2^{\left(1\right)};E_2^{\left(2\right)}\}=\{(+++-++-+---+++-+,+-+++----+--+---);(---+++-++++-++-+,\\ +-++-+++-+---+++\left)\right\}\end{array}$

Number of users 2, subcode number 2, code length 32, antenna number 2

$\begin{array}{c}\{E_1^{\left(1\right)};E_1^{\left(2\right)}\}=\left\{\right(+++-++-++++---+-+++-++-+---+++-+,+-+++---+-++-++++-+++----+--\\ +---);(+++-++-+---+++-++++-++-++++---+-,-+---++++-++-+++-+---\\ +++-+--+---\left)\right\}\end{array}$

$\begin{array}{c}\{E_2^{\left(1\right)};E_2^{\left(2\right)}\}=\left\{\right(+++-++-++++---+----+--+-+++---+-,+-+++---+-++-+++-+---++++-++\\ -+++);(+++-++-+---+++-+---+--+----+++-+,-+---++++-++-++++-+++\\ ---+-++-+++\left)\right\}\end{array}$

Number of users 2, subcode number 2, code length 64, antenna number 2

$\begin{array}{c}\{E_1^{\left(1\right)};E_1^{\left(2\right)}\}=\left\{\right(+++-++-++++---+-+++-++-+---+++-++++-++-++++---+----+--+-+++--\\ -+-,+-+++---+-++-++++-+++----+--+---+-+++---+-++-+++-+---++++-++\\ -+++);(---+--+----+++-++++-++-+---+++-+---+--+----+++-+---+--+-++\\ +---+-,+-+++---+-++-+++-+---++++-++-++++-+++---+-++-++++-+++----+\\ --+---\left)\right\}\end{array}$

$\begin{array}{c}\{E_2^{\left(1\right)};E_2^{\left(2\right)}\}=\left\{\right(+++-++-++++---+-+++-++-+---+++-+---+--+----+++-++++-++-+---++\\ +-+,+-+++---+-++-++++-+++----+--+----+---+++-+--+---+-+++----+--\\ +---);---+--+----+++-++++-++-+---+++-++++-++-++++---+-+++-++-+-\\ --+++-+,+-+++---+-++-+++-+---++++-++-+++-+---+++-+--+----+---+++\\ +-++-+++\left)\right\}\end{array}$

Number of users 2, subcode number 2, code length 128, antenna number 2

Number of users 2, subcode number 2, code length 256, antenna number 2

Number of users 4, subcode number 4, code length 32, antenna number 2

Number of users 4, subcode number 4, code length 64, antenna number 2

The mutual-complementing code that the present invention adopts is one group of perfect three-dimensional complementary code.This perfection three-dimensional complementary code has following characteristics:

1, the maximum number of user that can support is identical with subcode number with maximum antenna number, is all M=2 ^k(k=1,2 ...); Code length is M ^r(r=2,3 ...).

2, there is desirable autocorrelation performance: same subscriber, the corresponding subcodes of subcarrier different on identical antenna are 1 o'clock in displacement, auto-correlation function sum reaches peak value, and when non-zero displacement, auto-correlation function sum is zero.

3, there is desirable their cross correlation: the subcode of different user is under any displacement condition, and cross-correlation function sum is zero.The perfect mutual-complementing code with this desirable autocorrelation performance and their cross correlation can be resisted multi-user interference effectively.

The multicarrier MISO system of applying this three-dimensional complementary code has the performance of anti-frequency selective fading, adopts the mutual-complementing code of the present invention's generation as the spreading code of multi-user multi-antenna, can overcome multipath and disturb caused frequency selective fading.

Claims (5)

1. the multicarrier MISO communication means based on chip-level Space Time Coding, is characterized in that: for each user K, its signal emission process is:

Step 1, data to be sent are carried out to information source coding, obtain polarization nonreturn to zero code;

Step 2, the polarization nonreturn to zero code that adopts M group three-dimensional complementary code respectively step 1 to be obtained carry out spread spectrum, every group of corresponding data that obtain after the spread spectrum of M road of three-dimensional complementary code; The M group three-dimensional complementary code corresponding data that obtain after the spread spectrum of M × M road altogether;

Step 3, adopt respectively M way carrier wave to modulate the data after corresponding the every group of three-dimensional complementary code obtaining in the step 2 M road spread spectrum obtaining, obtain M road modulation signal, M way carrier wave respectively corresponding frequency is f ₁, f ₂..., f _m; Data after the spread spectrum of M × M road obtain M × M road modulation signal altogether;

Step 4, the M road modulation signal of every group of three-dimensional complementary code correspondence obtaining in rapid three is carried out to equal gain combining, obtain a road modulation signal; M × M road modulation signal obtains M road modulation signal altogether; Described M road modulation signal is sent to channel by M transmit antennas respectively;

For each user K, its signal receiving course is:

Step 5, the M road modulation signal of launching by a reception antenna receiving step four, and adopt band pass filter to carry out filtering the M road modulation signal r (t) receiving, obtain M road filtering signal; The frequency of described M road filtering signal is respectively f ₁, f ₂..., f _m;

Step 6, adopt respectively the subcarrier of respective frequencies to carry out demodulation step 5 Zhong Mei road filtering signal, obtain a group demodulation signal; M road filtering signal obtains M group demodulation signal altogether;

Step 7, adopt the M road three-dimensional complementary code corresponding with transmitting terminal to carry out despreading the every group demodulation signal obtaining in step 6, obtain one group of despread signal that comprises M road; M group demodulation signal obtains M group despread signal altogether;

The despread signal on M road in step 8, step 7 is obtained every group is respectively a bit time T _bunder carry out integration, obtain one group of integration data that comprises M road integral result; After the despreading of M group, data obtain M group integration data altogether;

Step 9, the M road integral result in the every group of integration data obtaining in step 8 is added to data after obtaining a road and being added, data after M group integration data obtains altogether M road and is added;

After step 10, the M road that step 9 is obtained are added, data are carried out equal gain combining, data after acquisition one tunnel merges;

Step 11, by step 10, obtain Yi road merge after data adjudicate rear output;

M is positive integer.

2. the multicarrier MISO communication means based on chip-level Space Time Coding according to claim 1, is characterized in that the production method of the three-dimensional complementary code described in step 2 and step 8 is:

It is M that step I, two M × M orthogonal dimension matrix A of employing and B construct M length ²sequence C ₁, C ₂... C _m:

$C_1=(b_{11}{A}_1,b_{12}{A}_2,...,b_{1M}{A}_M)=(c_{11},c_{12},...,c_{{1M}^2})$

$C_2=(b_{21}{A}_1,b_{22}{A}_2,...,b_{2M}{A}_M)=(c_{21},c_{22},...,c_{{2M}^2})$

.

.

.

$C_M=(b_{M1}{A}_1,b_{M2}{A}_2,...,b_{\mathrm{MM}}{A}_M)=(c_{M1},c_{M2},...,c_{{\mathrm{MM}}^2})$

Wherein: the expression formula of orthogonal matrix A is:

$A=\left[a_{\mathrm{ij}}\right]=\left[\begin{array}{c}{A}_1\\ A_2\\ .\\ .\\ .\\ A_M\end{array}\right];\left|a_{\mathrm{ij}}\right|=1$

The expression formula of orthogonal matrix B is:

B=[b _ij];|b _ij|=1

Wherein: i, j=1,2 ..., M;

Step II, M the length that step I is obtained are M ²sequence C ₁, C ₂... C _mwith M × M orthogonal dimension matrix construct N _t× M ²individual length is M ²sequence; Described N _t× M ²individual sequence composition N _t× M organizes complete complementary code:

$E_1^{\left(n_t\right)}=\{E_{11}^{\left(n_t\right)},E_{12}^{\left(n_t\right)},...,E_{1M}^{\left(n_t\right)}\}$

$E_2^{\left(n_t\right)}=\{E_{21}^{\left(n_t\right)},E_{22}^{\left(n_t\right)},...,E_{2M}^{\left(n_t\right)}\}$

.

.

.

$E_M^{\left(n_t\right)}=\{E_{M1}^{\left(n_t\right)},E_{M2}^{\left(n_t\right)},...,E_{\mathrm{MM}}^{\left(n_t\right)}\}$

Wherein: n _t=1,2 ..., N _t; N _t=M is number of transmit antennas;

Orthogonal matrix expression formula be:

$D=\underset{n_t=1}{\overset{N_T}{\mathrm{\&Sigma;}}}{D}^{\left(n_t\right)}=\underset{n_t=1}{\overset{N_T}{\mathrm{\&Sigma;}}}\left[d_{\mathrm{ij}}^{\left(n_t\right)}\right]=\left[d_{\mathrm{ij}}\right];$

Step II I, the mode that adopts mutual insertion to arrange the subcode in above-mentioned each complete complementary code form a sequence:

$\begin{array}{c}{F}_i^{\left(n_t\right)}=(e_{i11}^{\left(n_t\right)},e_{i21}^{\left(n_t\right)},...,e_{\mathrm{iM}1}^{\left(n_t\right)},e_{i12}^{\left(n_t\right)},e_{i22}^{\left(n_t\right)},...,\\ e_{\mathrm{iM}2}^{\left(n_t\right)},...,e_{{i1M}^{r-1}}^{\left(n_t\right)},...,e_{{\mathrm{iMM}}^{r-1}}^{\left(n_t\right)}\\ =(f_{i1}^{\left(n_t\right)},f_{i2}^{\left(n_t\right)},...,f_{{\mathrm{iM}}^r}^{\left(n_t\right)})\end{array}$

Wherein i=1,2 ..., M; M ^r-1for the subcode length in complete complementary code; The initial value of r is 3;

And by the sequence obtaining

replace the sequence C in Step II ₁, C ₂... C _m, return to execution step II; Can repeatedly perform step II and Step II I, every execution once, the complete complementary code constructing extended length M doubly, finally obtains three-dimensional complementary code

$X_k^{\left(n_t\right)}=E_k^{\left(n_t\right)}=\{E_{k1}^{\left(n_t\right)},E_{k2}^{\left(n_t\right)},...,E_{\mathrm{kM}}^{\left(n_t\right)}\}$

Wherein: k=1,2 ..., M;

3. the multicarrier MISO communication means based on chip-level Space Time Coding according to claim 2, is characterized in that the N constructing in Step II _t× M ²individual length is M ²sequence be:

$\begin{array}{c}{E}_{\mathrm{ij}}^{\left(n_t\right)}=(c_{i1}{d}_{j1}^{\left(n_t\right)},...,c_{\mathrm{iM}}{d}_{\mathrm{jM}}^{\left(n_t\right)},c_{i(M+1)}{d}_{j1}^{\left(n_t\right)},...,\\ c_{i\left(2M\right)}{d}_{\mathrm{jM}}^{\left(n_t\right)},...,c_{i(M^2-M+1)}{d}_{j1}^{\left(n_t\right)},...,c_{{\mathrm{iM}}^2}{d}_{\mathrm{jM}}^{\left(n_t\right)}.\\ =(e_{\mathrm{ij}1}^{\left(n_t\right)},e_{\mathrm{ij}2}^{\left(n_t\right)},...,e_{{\mathrm{ijM}}^2}^{\left(n_t\right)})\end{array}$

4. the multicarrier MISO communication means based on chip-level Space Time Coding according to claim 2, is characterized in that orthogonal matrix A described in step I and B all adopt Hadarmard matrix.

5. the multicarrier MISO communication means based on chip-level Space Time Coding according to claim 2, is characterized in that the production method of the D of orthogonal matrix described in Step II is: take Seed Matrix as basis, utilize Kronecker product to expand dimension;

Described Seed Matrix is:

$\begin{array}{cc}{D}_{2\&times;2}^{\left(1\right)}=\left[\begin{array}{cc}+& +\\ +& -\end{array}\right]& D_{2\&times;2}^{\left(2\right)}=\left[\begin{array}{cc}+& -\\ +& +\end{array}\right]\end{array}$

Images