CN1555605A

CN1555605A - Time-space frequency Turbo encoding method and device

Info

Publication number: CN1555605A
Application number: CNA028181166A
Authority: CN
Inventors: 李永会; 李轶
Original assignee: Linkair Communications Inc
Current assignee: Linkair Communications Inc
Priority date: 2002-04-05
Filing date: 2002-04-05
Publication date: 2004-12-15
Also published as: AU2002252946A1; WO2003088503A1

Abstract

A method and device for space-time-frequency tubo encodnig, wherein: coding input bit in the cascaded space-time trellis by the transmitting terminal; when coding, the inside and outside code in cascade is the space-time trellis code, and combined encoding by way of the frequency domain as a dimension; decoding the receiving signal in the receiving terminal. The present invention extends space-time encoding to the frequency domain, it has the advantage of making more flexible design space for space-time encoding, more advancing systemic spectra efficiency and obtaining more diversity gain and encoding gain.

Description

Time-space frequency Turbo encoding method and device

A kind of time space frequency TURBO coding methods and device

Technical field

The present invention relates to communication technical field, a kind of more particularly to serial and concurrent space-time frequency coding method for communication system is concretely a kind of time space frequency TURBO coding methods and device.Background technology

In communication system, existing anti-fading scheme, which is mainly, uses diversity technique, particularly the Space-time coding techniques in diversity technique, referring to bibliography [13], [14], what is introduced in the prior art is all space-time code, is set foot in without people in time space frequency coding field.The content of the invention

It is an object of the present invention to provide a kind of time space frequency TURBO coding methods and device.In fact, space-time code is expanded into frequency domain, more flexible design space can be provided for space-time code, the spectrum efficiency of bigger raising system and obtain bigger diversity gain and coding gain.

The technical scheme is that：A kind of time space frequency TURBO coding methods, including：The space-time TRELLIS that transmitting terminal carries out cascade to input bit is encoded；During coding, the interior outer code of cascade is space-time TRELLIS codings, and carries out combined coding using frequency domain as a dimension of coding；Receiving terminal enters row decoding to the signal of reception.

The space-time TRELLIS codings that described transmitting terminal carries out cascade to input bit refer to：The space-time TRELLIS that transmitting terminal can carry out Parallel Concatenated to input bit is encoded, and the space-time TRELLIS encoded signals before and after two are interweaved respectively are modulated on two carrier waves respectively；In receiving terminal, two front and rear space-time TRELLIS encoded signals that interweave can be recovered respectively, and this just constitutes time space frequency TURBO codings.

The space-time TRELLIS codings that described transmitting terminal carries out cascade to input bit refer to：The space-time TRELLIS that transmitting terminal can carry out series cascade to input bit is encoded, wherein：Then information and checking symbol that outer code is formed after being encoded through space-time TRELLIS, modulate on two carrier waves and launch each by space-time TRELLIS codings again after interweaving respectively.

The space-time TRELLIS codings that described transmitting terminal carries out Parallel Concatenated to input bit can also refer to：The space-time TRELLIS for the Parallel Concatenated that transmitting terminal to input bit can spread out of an information symbol and three checking symbols is encoded, wherein：Using to two load wave modulations, the space-time TRELLIS encoded signals before two intertextures and the space-time TRELLIS encoded signals after two intertextures can be recovered respectively, then modulates and launches on two carrier waves.

Described receiving terminal enters row decoding to the signal of reception and referred to：Receiving terminal can enter to the signal of reception The LOG-MAP decodings of row time space frequency.

For the time space frequency TURBO codings of Parallel Concatenated, described receiving terminal enters row decoding to the signal of reception and referred to：Receiving terminal can carry out the LOG- MAP decodings of symbol level to the signal of reception；

Described decoding can be iterative decoding, and described iterative decoding should meet following condition：

Lc{u_k = u(i) 17) = log{p(u_k = u(i) | 7)) = log^ p(u_k = u(i),a_k,a_k+l | 7)) = l。g(A exp(a_A. (a_k ) + β_Μ (σ_Μ ) + fl ' σ_Μ, y_k )))

― max— ― _.

=h + ( _k (a_k ) + β_Μ (σ_Μ ) + γ (a_k, σ_Μ , y_k ))

k

In above formula, to " (0 summation, it can be deduced that：

― ^max _ ―

h = log(/ = -2, (σ, ) + β_Μ (σ_ί+1 ) + f_k (a_k , σ_Μ , y_k)) can now be iterated decoding, calculate obtain be full information ^ (^=）|), need to utilize side information y during iteration_A.l " (0), can set prior information as.Shellfish ij

Le{y_k | u(i)) = Lc{u_k = u{i) | Y)~Lo{u_k = u(i)) .

During judgement, the maximum likelihood decision criterion of symbolization level,

The maximum judgement symbol as the k moment is exported；

For ^, Α, initial state, using to each rsc encoder, tailing bit forces the scheme of zero respectively, now：) its value

One 1,<y_k =°

^ ^{) = {}ο, _σΑOther values

If any the situation of parallel route in decoding, as long as parallel route as common branch, but need to should also add one to sum parallel branch in related all formula summed to state.

For serial time space frequency TURBO codings, described receiving terminal enters row decoding to the signal of reception and referred to：Receiving terminal can carry out bit-level LOG- MAP decodings to the signal of reception；

Described decoding can be iterative decoding, be the step of the iterative decoding：

(1) signal that carrier wave 1 and carrier wave 2 are received is respectively through the filtering for receiving matched filter, and carries out APP calculating respectively, utilizes formula：

p (u_k;0) = p (u = u_k I ^ ) = A∑∑ «, (σ, )β_Μ (σ_ί+Ι )γ[ (σ, , σ_Μ , y_k), calculating obtains ISN The code word 4 of space-time code^1);,4²⁾' ' the posterior probability of symbol level, then utilize formula

k。

Pi^ I F) = Π p{b_tI 7), the likelihood ratio of bit-level is converted into, full posterior probability is respectively obtained

1=1

Likelihood ratio

^²⁾ ;J) = 0;

(two）Then formula is utilized： j = ι"··Α

Pliu_kU) = o-o) 。) = ln- ·^{) = 1;0)} j = l,...,n₀

p_k ^e(c_k(j) = 0;O)

Side information is calculated,

；

(3) 1 side information 4 of obtained ISN will be calculated^1)£(" );0), f^e(u_lU, o) reciprocal cross knitted as outer code ^.,^.Prior information (cr /);), (c) /);), wherein subscript " 0 " represents outer code；

(four）Utilize formula： ( ;)=f ^ (4 calculate 4 (;), when the posteriority likelihood information of outer code is calculated, 1₄(^;/) it is always zero；By obtained ^_k(u_k;), I formula λ (c (y) are brought into; O) = max l_k(a_k) + β_Μ (σ_Μ ) + λ, (u_k； J) +_k (c, (σ, );/)]

- max [ ¾ ( ^ ) + β_Μ (σ_Μ ) + _k (u_k ;Ι) + λ_1ζ (c_k (a_k);/)] in, obtain 1^ (φ);0), j=l ,-, n₀Then be brought into formula：

(c(J');0) = (c( );O)— ( ( );J in), calculating obtains (c (_ /);O), 7=1 ,-,₀；Utilize formula：/ I=, the likelihood ratio of side information is converted to the posterior probability of symbol

/=1

(five）Will_P ^e c_k0th, serioparallel exchange is carried out first, obtains 0_fc;O),/ ^)e( ;), O obtained respectively through intertexture, the prior information that this information after interweaving is encoded as ISN time space frequency ；

(six）In follow-up iteration, above-described 5 steps Dong is repeated；

(seven）In last time iteration, the l (" 0 of outer code is exported);), O j=l ,-, made decisions by the way of following： _uDoor₌I, when>o

"-o, when_A( >O ° is then return to 1, carries out the decoding of next frame.

For serial time space frequency TURBO codings, described receiving terminal enters row decoding to the signal of reception and referred to：Receiving terminal can carry out the LOG- MAP decodings of symbol level to the signal of reception；

Now all probabilistic informations are represented with the posterior probability of symbol level, the likelihood ratio without using bit-level, utilize formula： p_k 0、 = ptJ ;。 P ^u _kI calculates the code word ^'' for obtaining ISN space-time code, 4²⁾' symbol level posterior probability side information 0_A;O) , p ^)e{u_k;0), now it is not required to calculate likelihood information again, but its reciprocal cross is knitted to the prior information as outer code decoder device

A(c:²)。;/);

In outer code decoder：

¾₊ι ) = max( , (σ_/£ ) + p_k(u_k;I) + p_k (c_k (a_k ); J) (σ_Α. ) = max(¾_+I (a_k ) + p_k (u_k ;I) + p_k (c_k (a_k ); I) ή , ,y_k) = hp_k (c; I)p_k (u; I)

Calculating the obtained posterior probability of full information is：

Pt (^c; 0) = max [a_k (a_k ) + β_Μ (σ_Μ ) + p_k (u_k ;I) + p_k (c_k (σ, );/)]

° ( (σ_¾)=1

One people, n

- : ( ( ）=0 ) + A+i (^σΜ ) + Λ (¾； ) + P_k (c_k (σ, ); /) pl(c;0) = pt(c;0)-p_k(c;), I wherein being always zero in the iteration of outer code；By p_k ^e {c_k；O) serioparallel exchange and the prior information encoded respectively as ISN time space frequency that interweaves

, it is later iterative process.

A kind of time space frequency TURBO code devices, wherein：Transmitting terminal at least includes space-time TRELLIS encoders and interleaver, and described space-time TRELLIS encoders and interleaver constitute the space-time TRELLIS code devices of cascade；During coding：Input bit inputs space-time TRELLIS encoders and interleaver, and encoded rear output respectively；Receiving terminal at least includes the time space frequency code translator decoded based on LOG- MAP.

The space-time TRELLIS code devices of described cascade refer to：The space-time TRELLIS code devices of Parallel Concatenated, it is made up of space-time TRELLIS encoders, interleaver, modulator, antenna；During coding：Input bit inputs space-time TRELLIS encoders and interleaver respectively, is exported after the bit of input space-time TRELLIS encoders is encoded to modulator, the signal of modulator output is sent through antenna；It is defeated Need to input other space-time TRELLIS encoders after the Bit Interleave for entering interleaver, and it is encoded after export to other modulator, the signal of modulator output is sent through other antenna.

The space-time TRELLIS code devices of described cascade refer to：The space-time TRELLIS code devices of series cascade, it is made up of space-time TRELLIS encoders, interleaver, modulator, antenna；During coding：Input bit first inputs space-time TRELLIS encoders, the output of space-time TRELLIS encoders is respectively the input of at least two interleavers, the output of interleaver is respectively the input of at least two other space-time TRELLIS encoders, the output of at least two space-time TRELLIS encoders is respectively the input of at least two modulators, and the signal of at least two modulator output is sent through at least two antennas respectively.

The space-time TRELLIS code devices of described cascade refer to：The space-time TRELLIS code devices of the Parallel Concatenated of an information symbol and three checking symbols can be spread out of, it is made up of space-time TRELLIS encoders, interleaver, modulator, antenna；During coding：Input bit inputs a space-time TRELLIS encoders and an interleaver respectively, is exported after the bit of input space-time TRELLIS encoders is encoded to a modulator, the signal of modulator output is sent through an antenna；

Need to input second space-time TRELLIS encoder and second interleaver respectively after the Bit Interleave for inputting interleaver, second interleaver is output as the input of the 3rd space-time TRELLIS encoder, the output of second space-time TRELLIS encoder is sent with the common input for second modulator of output of the 3rd space-time TRELLIS encoder, the signal of second modulator output through second antenna.

Described code translator can be the parallel time space frequency TURBO decoder of single-rate；It is made up of matched filter, APP calculators, interleaver, anti-interleaver, discriminating gear；In decoding：The signal that carrier wave 1 and carrier wave 2 are received enters two APP calculators respectively through matched filter 1,2 is received, and completes to decode through the iterative decoding based on LOG- MAP decoding algorithms.

Described code translator can be serial time space frequency TURBO decoder；It is made up of matched filter, APP calculators, interleaver, anti-interleaver, discriminating gear；In decoding：The signal that carrier wave 1 and carrier wave 2 are received enters two APP calculators respectively through matched filter 1,2 is received, the output of two described APP calculators is respectively the input of anti-interleaver 1,2, the output of described anti-interleaver 1,2 is common to turn into the input of the 3rd APP calculator, completes to decode through the iterative decoding based on LOG- MAP decoding algorithms.

Beneficial effects of the present invention are：Space-time code is expanded to frequency domain by the present invention, can provide more flexible design space for space-time code, the spectrum efficiency of bigger raising the system diversity gain and coding gain bigger with acquisition. Brief description of the drawings

Fig. 1 is parallel time space frequency coding structure block diagram；

Fig. 2 is serial time space frequency coding structure block diagram；

Fig. 3 is one information symbol of processing and the parallel time space frequency coding structure block diagram of three checking symbols；Fig. 4 is the parallel time space frequency TURBO decoder structured flowchart of single-rate；

Fig. 5 is serial time space frequency decoder architecture block diagram；

Fig. 6 is the FER performance curves that serial parallel time space frequency is encoded when translational speed is 5km/h；Fig. 7 is the FER performance curves that serial parallel time space frequency is encoded when translational speed is 60km/h.

Embodiment

I serial parallel time space frequency coding structures：

In serial parallel time space frequency coding, the interior outer code of cascade is all space-time TRELLIS codings.The dimension that frequency domain now simply is also served as into a coding, which is taken into account, carrys out combined coding.

The structure of parallel time space frequency coding is as shown in Fig. 1, it will be seen that using to two load wave modulations, we can individually recover two front and rear space-time coding signals that interweave in figure, thus, actually this just constitutes time space frequency TURBO codings., can greatly cylinder decoding algorithm it will be seen that using the encoding scheme of single-rate above in decoding algorithm below.This scheme, under single footpath channel, in two reception antennas, can reach 1/2 coding gain and 8 heavy diversity gains above.

Fig. 2 gives the coding structure of serial time space frequency, in serial time space frequency encoder, the information and checking symbol formed after outer code space-time code, then modulates and launches on two carrier waves each by two space-time coders again after interweaving respectively.Two intertextures shown in figure should be identical, or first by the information of outer code and verification and can get up, and interweaves, then separates again.

Parallel time space frequency coding can have another encoding scheme, as shown in Fig. 3, now, similar to 1/4 TURBO encoders, it is different from structure above, now pass an information symbol, and 3 checking symbols, the low code rate of P bars, but add the complexity of decoding.

The LOG- MAP decodings of the parallel time space frequency TURBO codings of II symbol levels：

Serial and concurrent time space frequency encoder is we illustrated above, and we provide the symbol level LOG- MAP decoding algorithms of the parallel time space frequency encoder for more than herein：

Given in [8] [9] [10], for the general MAP decoding algorithms based on SIS0 models of Concatenated code, the present invention will use for reference SIS0 models therein and MAP decoding algorithms, and be applied in the LOG- MAP decoding algorithms of time space frequency. In following derivation, our LOG- MAP decoding algorithms general to TURBO codes（[15]) without detailed derivation, and main length is placed on the LOG-MAP decoding algorithms of symbol level.

In moment k, the posterior probability of information symbol is：

P(u_k = u {

(1) in formula, p u_k = u(i), o_k , a_mI Y) represent it is known receive signal+when, u_k, σ, σ,₊₁Joint probability distribution, below derivation it is identical with the LOG- MAP of common TURBO codes decoding algorithm, we only provide result, and detailed content may be referred to BCJR decoding algorithm [1] [2].

（1) in formula, using bayesian criterion, it can obtain：

P(u_k = u(i), a_k , σ₄₊₁ I Ϋ) = hp(u_k = u(i), a_k , a_k+1) h in (2) formula meets

^ΣΣΣ^ - =" '),σ„σ,₊₁, 7)=1 (3) we willBe divided into f=(-, then have

P{u_k = u{i), a_k , σ_Α.₊₁ , 7) = p(u_k = u(i), a_k , σ_Μ ~,y_k>f_k ⁺) ( ₄ )

= P(Y_k ⁺ I u_k =u(i),a_k,a_k+l,Y_k~,y_k)p(u_k = u(i)_k, a_k+1 ,y_k \a_k, Y_k~)p(a_k , Y_k) according to the property of Markov chain, if it is known that σ_ω, then⁺Other specification is will not depend on, is now had

P(Y_k ⁺ I u_k = u(i),a_k,a_M,Y_k',y_k) = p(f_k ⁺ \ σ_Μ)

Similarly P (=u (i)_k,^_k+l,y_k \a_k,Y_k~) = p(u_k =u(i)_k,a_M,y_k\a_k),

If we define

Rk' ,)=p (^uk = "(!·)' ' y_k I _k )

a_k(a_k) = p(a_k,Y,;) so,（2) our forms that can be written as of formula：

P{u_k = "(0, o-_k , σ_Μ I Υ) = ha_k (a_k )β _ι (a_k+i )γ[ (a_k , a_k+l, y_k )

In moment k, when input is ^) when, from state σ_έIt is transferred to σ_Α+1Joint probability distribution, can be expressed as：

ή , ^σ ι ,y_k)

= "(^?:),^ak ' ^σΜ )p(^uk = "(01。_k,₊₁ )ρ(σ_ΜI σ (5) if we assume that be when inputting《(when 0, in TRELLIS trrellis diagrams, from state σ_ΑIt is transferred to σ_Μ, so, (5) formula can be expressed as ή (^k , ^σί₊ι ,y_k) = p(y_k I "(0, σ_λ. )p(u_k=)) i7 (3 in (6) above formula_/£ |_w(), ）Conditional probability is represented, is represented in moment k, in state, when input is_M(when 0, receive the probability that signal is Λ

Because_Λ=#+so P (I u (i), a_k) = (πΝ₀Υ^Μ exp(--L|k_c - _kS_k()

N,

M in above formula is the number of reception antenna.

If for each fading channel, there is L separable multipaths, then above formula will be changed into：

P(y_k I u(i),a_k) -H_H¾ ')

In above formula, with/each variable represent corresponding the/footpath signal, thus simply when computation measure, the measurement of L separable multipaths is added up.

Using LOG- MAP decoding algorithms, we define：

Yk (σ₄ , σ_Α.₊₁ ,y_k) = \og{y_k (a_k , σ_Μ , y_k)) can obtain

l^Qg(∑ exp(¾ (<y_k ) + f_k (σ, , σ_Μ , y_k ))

t

« ax( _k (a_k ) + f_k (a_k , a_k+1 , y_k)) similarly,

(cr_k ) = l。g(∑ exp(¾₊₁ (a_k ) + f_k {a_k , a_k+l, y_k ))

« max(^₊₁ (a_k ) + _k (c_k , σ_Μ, y_k)) because₊₁(σ ) , (σ_έ) gradually increase in an iterative process, so to prevent_Μ(σ_Μ), spilling, it is necessary to they are normalized, so-called normalization simply subtracts the process of maximum：

k ' (σ_λ. ) = a_k (a_k ) - max a_k (a_k )

°

')=(σ)-max β, (σ) and ' (σ and A'() is used in the iteration and calculating of postorder, it has proved that (σ_Α) and (）A factor is added and subtracted, any influence will not be produced to the calculating of posterior probability below, this factor is eventually disappeared. Because in the state σ at k+1 moment₄₊₁, it is to work as to input in state to be《(transfering state when 0, so（1) in the summation of formula, we need to only sum to state ^, now（1) expression of formula be changed into after logarithm operation be：

Lc{u_k = u(i) I Ϋ) = log(p(u_k = u(i) | 7)) = log^ p(u_k = u(i),a_k,a_k+l 1 7))

= l°g(^∑ ex (¾ (σ_Α. ) + ¾₊₁ (σ,₊₁ ) + γ[ p_k , a_k+l, y_k ))) ( η )

- max-mono- _

= h + ( _k (σ_/£ ) + β_Μ (a_k+l ) + f_k (σ_/£, σ_Μ , y_k)) in above formula, we are to " (0 summation, can be obtained

- ^-, max _ — _.

Λ = log(/z) = -2^ {a_k (a_k ) + β_Μ (σ_Α+1 ) + γ (σ, , σ_Μ , y_k ))

'· ^Gk

Now, we can be iterated decoding,（7) in formula, that calculating is obtained is full information Lc { u_k=u (i) I), need to utilize side information Le (y during iteration_kU (i)), we assume that prior information be Lo { u_k = u(i))

Le(y_k | u(i)) = Lc(u_k = u(i) | Y) ~Lo{u_k = u(i))

During judgement, the maximum likelihood decision criterion of our symbolization levels takes posterior probability p { u_k=|) maximum " (0 exports as the judgement symbol at k moment.

It is similar with traditional TURBO codes for initial state, because we use recursive convolution code, so using the method for traditional plus zero tail bit, it is impossible to ensure the state zero of system.In TURBO codes, if the state without TRELLIS is terminated, the performance of system can greatly deteriorate [3], [4], [5].For simplify system design, we interweave when, simply information bit is interleaved, each RSC encoders have the tail bit of oneself, although this can the property brought loss of energy [6] [7], but can cylinder system design.In our scheme, each RSC state is terminated, using the state return-to-zero method forced, as we know that the state at the end of each RSC encoders, so we can be by increasing tail bit, anancastia zero.This algorithm that the present invention is used is simultaneously non-optimal, the state of optimal TURBO codes is terminated, need tailing bit [1] [3] before intertexture, it can so ensure that TURBO has maximum free distance, because at this moment, it is equivalent to, it is understood that the TRELLIS trrellis diagrams of whole TURBO codes, are that the state of the whole trrellis diagram of TURBO codes is terminated.The state zero algorithm of this slightly TURBO codes of complexity is designed together, it is necessary to combine with interleaver, it is ensured that the performance being optimal, specific algorithm may be referred to the bibliography of the above.

In the present invention, we are using to each RSC encoders, tailing bit forces the side of zero respectively Case, now

One._k = 0

^Ω<3(^σί') ^{= {}0, σ_/£For other values

1, σ₄ = 0

^^^ ^, ^^ are other values

Fig. 4 gives the decoding architecture of the parallel time space frequency of single-rate, there is the situation of parallel route in a decoder, as long as we as common branch, in the now all above formula summed to state, should also add one to sum parallel branch parallel route.Now, other all formula need not all do any change, you being applied to has a case that parallel route.

III. the LOG- MAP decodings of the serial time space frequency TURBO codings of symbol level：

Above we talk of the LOG- MAP decoding algorithms of parallel time space frequency, manage us at this and introduce the LOG-MAP decoding algorithms of serial time space frequency TURBO codings.The decoding process of serial time space frequency TURBO codings is for the decoding that parallel space-time TURBO is encoded, it is slightly complicated, because during decoding, it is necessary to repeatedly bit likelihood ratio and symbol posterior probability calculating between mutually phase transformation.But the performance of serial time space frequency coding is better than parallel time space frequency coding, from emulation forth below, it can be seen that this point.

The decoding algorithm of the series cascade TURBO codes of symbol level is described in [11] [12] [13].Because space-time TURBO codings are the codings based on symbol, so traditional idea thinks that its decoding can use the LOG- MAP decoding algorithms based on symbol level.

Herein, the framework of traditional concept is abolished, the decoding algorithm of if- frequencies TURBO codes when providing a kind of series cascade of bit-level first, this decoding algorithm is more complicated than symbol level decoding algorithm, introduce being intended to for this algorithm, illustrate that time space frequency coding both can be with the LOG- MAP decoding algorithms of symbolization level, it would however also be possible to employ the LOG- MAP decoding algorithms of bit-level.And according to this decoding algorithm, can easily derive the decoding algorithm of symbol level.The LOG-MAP decoding algorithms of symbol level will be provided according to this algorithm below.

In this decoding algorithm, we can use the calculating of the likelihood ratio of bit-level, but also the rear Stagger probability of symbol level is calculated in accounting, so first providing the posterior probability of known symbol below, seek the process of the likelihood ratio of bit-level, and the likelihood ratio of known bits level, calculate the process of the posterior probability of symbol.

The posterior probability of known symbol, seeks the likelihood ratio of bit-level:

It is assumed that glossary of symbols is S-, ^ ..., ^ }, and each symbol is by k.Individual bit composition, be designated as, ^ ...,:.}.The posterior probability for setting N symbol in symbol level S simultaneously is designated as P=(p_i,p₂,-,p_N) = {p(s_l \Y),p(s₂ \Y),-,p(s_NY), a/bit in symbol is given below Likelihood ratio l, λ _ Ρ ,=Y) _ kind (9)

'"^=017)" ∑p(_SiY) in above formula, e { b/=1 } represents the set of a/bit in symbol for 1 all symbols.Rear-face f of known symbol both rates, seek the likelihood ratio of bit-level：

The definition of assemble of symbol and its element is identical with what is practised physiognomy, it is assumed that it is understood that the likelihood of the posterior probability of a/bit is obtained first：

1 + β^λ'

1

p(b_l =0\Y) =

\ + ε^λ·

Upper two formula can be write as one and general use b by us_tThe formula of expression, p (b, I Y)=⁶

1 + β^λ'

If symbol is by k_QIndividual bit composition, be designated as { b .., } shellfish ' J: p(s_i \Y) = flp(b_l \Y) (10)

1=1

(9), (10) two formulas give the posterior probability of symbol and calculate the likelihood ratio of bit-level and the algorithm of the posterior probability of symbol is calculated by the likelihood ratio of bit, and this will all be used in calculating below.

The LOG- MAP decoding algorithms of the bit-level of time space frequency TURBO codings：

In this decoding algorithm, we are appreciated that the posterior probability of symbol level in receiving terminal, and in the calculating and iteration of outer code, what is used is all the likelihood ratio of bit-level.

First, it is the convenience that derives below, we first define some symbols and represented, if without special explanation, the meaning of these symbols is exactly the implication being described below：

u：Represent information bit (w (l), M (2) ..., the u (k of input₀ )

c：Represent the code word after information coding（c(l),c(2),...,c(i.）

/:Represent the input information of decoder

0:Represent the output information of decoder（Including full information and side information）

u(j)：Represent the of input information bits u：J bit

c(j)：Code word c j-th of bit after presentation code Represent the likelihood ratio of posterior probability

P_k ^AQ:Represent full posterior probability

()：Represent full likelihood ratio information

Similar with derivation above, in moment k, the posterior probability of information symbol is：

(11) glossary of symbols ^ is belonged in above formula

We can be write as the formula expansion of equation right side summation symbol,_Μ, γ [expression formula, i.e.,：^ (" so：

Ρί (

_k , σ_Μ ,y_k) ( ₁₂) above in formula, β_Μ, implication it is identical with above with expression formula.Key is ^ calculating.

In the LOG- MAP decoding algorithms of bit-level, both the likelihood ratio of bit-level had been used in iteration, also to use above formula calculating symbol level posterior probability, then using the symbol level above provided posterior probability to the likelihood ratio of bit-level conversion formula（9) changed.

Above, we obtain

ή ' ^σΜ)=Pu (Λ I "=ⁱ,^σ*,^σΜ )p_k (^u^^uK k,^σΜ )Pk (^σλ-₊ι \ k) ( ¹³) if we assume that when incoming symbol is ^, in TRELLIS trrellis diagrams, from state σ_λIt is transferred to₊₁, so, above formula can be expressed as

r_k ^l^_k,a_k+l,y_k) = p_k(y_k \ u_k,a_k)p_k{u = u_k) in (14) above formula ρ (_Λ1^, ）Conditional probability is represented, is represented in moment k, in state cr_t, when input is ^, receive the probability that signal is Λ

Because (Λ I=exp (- | | j | |²) M in (15) above formula be reception antenna number.

Meanwhile, and/々 iteration expression formulas are as follows

«_ί+ι ) * max( , (σ, ) + f_k (σ, , σ_ω ,y_k)) (16) _k (σ₄) gangster (₊₁ (σ_Α ) + , ( _Α , σ_Μ ,y_k)) (17) utilization（12) formula, we can obtain symbol full posterior probability ^ (;O), then side information can in the hope of for：

pt(u_k;0) = pt(u_k;0)-_Pk(u_k;I) (17-2) and then utilization [9] formula, we can obtain the likelihood ratio of side information

To each carrier wave, we can calculate (^ ();0), if the likelihood ratio for setting the side information that two carrier waves calculating are obtained is respectively：

With 4^2)e (" ■); 0)

It is designated as respectively to ISN space-time coder 1, and the code word of ISN space-time coder 1 if note outer code is exported_c ° , c ⁾⁰, then actually（^1)e (u_k U); o) , ^2)e(«, ω;O) it is respectively) that inner code decoder device 1,2 calculates obtained ^., ^).Probabilistic information.

All it is to carry out computing using likelihood ratio in the whole decoding process of outer code, so, it is given below, the expression formula for the posterior probability likelihood ratio derived using likelihood ratio.

Now, remove; ^( ,σ_ί+1,_Λ) calculating need outside the expression that represents to be converted to the likelihood ratio of bit-level from the conditional probability of symbol level, others calculate essentially identical with above.

Above, have been given by

ϊ[ (o-_k , ,y_k) = p_k (y_k \u_k,a_k)p(u_k =u) = p_k (y_k | c_k )_Pk (u; I)

In above formula) expression, state is 0 "_t, the output when input is ^.

P(^ck)

In above formula so ^ (,₊₁,^) = ( »; ) ( ²⁰) using the posterior probability and the conversion relational expression (9) of likelihood ratio of symbol, the posterior probability represented with likelihood ratio is brought into（20) in formula, we can obtain

(u(j); 0)= max [ a_k (a_k ) + (σ,₊₁ ) + γ[ (a_k , a ,y_k)] =,)+d (^σ"ι ) + 4 ½;Ή* (c_k (a_k)；/)] one,_η [ ) + d (^σ"ι ) + ·(¾;^/) + Κ (σ_Α)；/)]

J=,-, (in 2D above formulas,

Similarly, we obtain

A_k{c{j);0)= max [ a_k (a_k ) + ¾₊₁ (σ_/£+1 ) + ^ (_Μ,； /) + λ_!( (c_k (a_k ); /) ]

People-: c_A(J)( _A)-l

One max,_n [ ¾ (σ^ ) + β_Μ (σ_Α+1 ) + ^ (Μ^; /) + ^ ( _k (a_k); /) ] j' = l, ···,".（24) Α iteration expression formula is changed into formula：

a_k+l (σ_Μ ) = max(a, (a_k ) + _k(u_k;I) + X_k (c_k (a_k ); I) k (^k ) = max(¾₊₁ (a_k ) + _k(u_k;I) + X_k (c_k (a_k);/) simultaneously, the side information calculating process in iterative process is as follows：

(uU); 0) = X^A _k (uU); 0) - _k (u_k(7)； /) j = l,-,k₀ ( 25 ) λ (c(j); O) = ^A _k (c(j); O) - X_k (c_k(;)； ) j = h-,n₀(26) our compares figures 5 below, for solve the process of serial time space frequency decoding.The LOG- MAP of serial time space frequency TURBO codings decode process and are：

(one）The signal that carrier wave 1 and carrier wave 2 are received enters two APP computing modules respectively through matched filter 1,2 is received, and utilizes（12) formula, calculates the code word for obtaining ISN space-time coder 1 and 2_c ',_cRear-dangerous rate of symbol level, is then utilized（10) formula, is converted into the likelihood ratio of bit-level, respectively obtains likelihood ratio (" ■ of full posterior probability);0), _ /=1, ' Α, during primary iteration, order=0,

Q.

(two）Then (18) are utilized, (19) calculate side information 4¹⁾²( );O), d );O).(three）2 side information 4 of obtained ISN will be calculated in 2nd step^1)£ (J');O) ,

Reciprocal cross is knitted as outer code ^.^^.Prior information ^ (^.( ；), c⁰u);D, wherein Subscript " 0 " represents outer code.

(four）The calculating of (23) formula of utilization (;/), when the posteriority likelihood information of outer code is calculated, A_k(u_k;I it is always) zero;By obtain 4 (;/), (u_k;I), it is brought into (24), obtains λ]);0) , j = l,-,n₀', then it is brought into (26), calculating obtains Ι Φ);0) ,=l ,-, w.；Utilize [10] formula, by the likelihood ratio of side information be converted to symbol posterior probability (;O)

(five）By ^_Ct;O serioparallel exchange) is carried out first, is obtained, and respectively through interleaver 1,2, is obtained; ^⁾²( ;O), (_¾;O), using this information after interweaving as the prior information of ISN time space frequency encoder 1,2;

(six）In follow-up iteration, repeat²- 5 steps.

(seven）In last time iteration, the j=l ", k of outer code are exported₀, k is made decisions by the way of following

1 is then return to, the decoding of next frame is carried out.

The LOG-MAP decoding algorithms of symbol level are derived by the LOG- MAP decoding algorithms of bit-level：The LOG-MAP decoding algorithms of a kind of bit-level and symbol level mixing are given above, in this trifle, according to LOG-MAP decoding algorithm of this algorithmic derivation based on symbol level.Now all probabilistic informations are represented with the posterior probability of symbol level, the likelihood ratio without using bit-level.

(17-2) is utilized to calculate the side information of the posterior probability for the code-word symbol level for obtaining ISN space-time coder 1 and 2₄;0), p ^)e{u_k- 0), now it is not required to calculate likelihood information again.But its reciprocal cross is knitted to the prior information as outer code decoder device,_Pk(c ⁾⁰- )。

In outer code decoder,

¾·₊ι ) = max(a_k (σ, ) + p_k {u_k； I) + p_k (c_k (a_k );/)

。

(σ_Α. ) = max(¾₊₁ (a_k ) + _Pk (u_k； J) + p_k (c_k (a_k ); /)

ή , σ ,y_k) = hp_k (c; I)p_k (u;I)

Calculating the obtained posterior probability of full information is（The ρ ^ in the iteration of outer code, ' Γ) it is always zero）

Pt (^c; O) = m^c [ a_k (a_k ) + ¾₊₁ (σ_Μ ) + p_k (u_k ;I) + p_k (c_k (a_k ); /) ]

- max [ a_k (σ, ) + β_Μ (σ,₊₁ ) + p_k (u_k ;I) + p_k (c, (σ, ); I) σ*¾·Ο)(σ·*:)=⁰ pt(c;0) = pt(c;0)-p_k(c;l)

By ^ (;O) serioparallel exchange and the prior information interweaved respectively as ISN time space frequency encoder 1,2

;), I later iterative process is identical with trifle 3.

IV. simulation result and Analysis of conclusion：

It is given below using simulation result during parallel and serial time space frequency encoding and decoding algorithm recited above, main simulation parameter is listed in table 1, in following simulation result, it has been contemplated that the general power after time space frequency coding is identical with the power encoded without time space frequency.

Two figures have distinguished parallel time space frequency coding and (have expanded to and encoded in two frequencies with traditional space-time block coding [13] [14] with serial time space frequency coding below）Performance comparision.

In figure 6, the FER performance curves of serial parallel time space frequency coding when giving translational speed for 5km/h.From figure, it can be seen that in high s/n ratio, serial time space frequency coding efficiency is optimal.Under the conditions of 10E- 4 FER, the parallel well about 0.5dB of serial time space frequency encoding ratio, than the performance well about 4dB, and with the raising of signal to noise ratio of traditional space-time block coding, this gap can be increasing.In 10E-5 FER, the parallel well about 1.5dB of serial time space frequency encoding ratio.

In the figure 7, the FER performances of serial parallel time space frequency coding when giving translational speed for 60km/h Curve.It can be seen that being still that serial time space frequency coding efficiency is optimal in high s/n ratio.Under the conditions of 10E-4 FER, parallel well about 0. 5dB of serial time space frequency encoding ratio, than performance well about 1. 5dB of traditional space-time block coding.In 10E- 5 FER, the parallel well about IdB of serial time space frequency encoding ratio, frequently traditional space-time block coding well about 2. 5dB.

In analysis above, it is known that serial time space frequency decoding, slightly more complex for parallel decoding, but many of complexity are wanted relative to traditional space-time block coding.Simulation results show, serial time space frequency gain is maximum, therefore the improvement of performance is using the increase of decoding complexity as cost.

Space-time code is expanded to frequency domain by the present invention, can provide more flexible design space for space-time code, the frequency language efficiency of bigger raising the system diversity gain and coding gain bigger with acquisition.

Above embodiment is to illustrate the invention and not to limit the present invention.Bibliography of the present invention is as follows：

[l].L.R.Ba l,J.Cocke,F.Jelinek, and J.Raviv, "Optimal decoding of linear codes for minimizing symbol error rate," IEEE Transactions on Information Theory, pp.284- 287,Mar.l974.

[2] .P.Robertson and T.Worz, "Bandwidth-efficient turbo trellis-coded modulation using punctured component codes," IEEE Journal on Selected Areas in Communications, vol.l6,pp.206-218,Feb.l998.

[3].Johan Hokfelt, Ove Edfors, and Torleiv Maseng, "On the Theory and Performance of Trellis Termination Methods for Turbo Codes", IEEE JSAC, vol.19, No.5, May 2001.

[4].A.S.Barbulescu and S.S.Pietrobon, "Termination for turbo encoders," in 17^th Biennial Symp. Communications, Kingston, ON, Canada, May 1994,PP.389-392.

[5].M.Hattori, J.Murayama, and RJ.McElice, "Pseudo-random and self-terniinating and interleavers for turbo codes," in Information Theory Workshop, San Diego, CA, Feb.1998.pp.9-10.

[6].Jung.P., and NABHAN.M, " Dependence of the error performance of turbo codes on the interleaver structure in short frame transmission systems,", Electron. Lett., 1994,30,pp.287-288.

[7] Jung.p, and NABHAN.M, " Performance evaluation of turbo codes for short frame transmission systems, " Electron Shang ett., 1994,30, pp.l 11-113.

[8]. J.Hagenauer, P.Robertson, and L.Papke, "Iterative(Turbo) decoding of systematic convolutional codes with the MAP and SOVA algorithms," in Proceedings of the ITG Conference,VDE— Verlag, Oct.1994.

[9]. S.Benedetto, G.Montorsi, D.Divsalar, and F.Pollara, " A soft-input soft-output maximum a posteriori (MAP) to decode parallel and serial concatenated codes," in The Telecommunications and Data Acquisition Progress Report 42-127, pp.1-20, Jet Propulsion Laboratory, Nov.1996. [10]. S.Benedetto, G.Montorsi, D.Divsalar, and F.Pollara, "A soft-input soft -output APP module for iterative decoding of concatenated codes," IEEE Communications Letters, vol.1, pp.22-24₃ Jan.1997.

[11]. S.Benedetto, D.Divsalar, G.Montorsi, and F.Pollara, "Serial concatenated trellis coded modulation with iterative decoding: Design and Performance," in IEEE Communications Theory Mini Conference, pp.38-43,1997.

• [12].S.Benedetto_? D.Divsalar, G.Montorsi, and F.Pollara, "Serial concatenated trellis coded modulation with iterative decoding: Design and Performance," in International Symposium on Information Theory, (Ulm, Germany.), IEEE, Juiie-July_?1997.

[13].V.Tarokh₅N.Seshadri₃A.R.Calderbank₅ "Space-Time Codes for High Data Rate Wireless Communication: Performance Criterion and Code Construction", IEEE Trans. Inforai.Theory_?vol.44,No.2_? March 1998.

[14]. S.Alamouti, "A simple transmit diversity technique for wireless communications/' IEEE JSAC, vol 14, No,8,1451-1458,OcU998.

[ 15] . J.Hagenauer₃Elke Offer, and Lutz Papke, "Iterative Decoding of Binary Block and Convolutional Codes", IEEE Trans on Information Theory, Vol,42,No.2 March 1996.

Claims

Claim

1. a kind of time space frequency TURBO coding methods, including：The space-time TRELLIS that transmitting terminal carries out cascade to input bit is encoded；During coding, the interior outer code of cascade is space-time TRELLIS codings, and carries out combined coding using frequency domain as a dimension of coding；

Receiving terminal enters row decoding to the signal of reception.

2. according to the method described in claim 1, it is characterised in that the space-time TRELLIS codings that described transmitting terminal carries out cascade to input bit refer to：The space-time TRELLIS that transmitting terminal can carry out Parallel Concatenated to input bit is encoded, and the space-time TRELLIS encoded signals before and after two are interweaved respectively are modulated on two carrier waves respectively；

In receiving terminal, two front and rear space-time TRELLIS encoded signals that interweave can be recovered respectively, and this just constitutes time space frequency TURBO codings.

3. according to the method described in claim 1, it is characterised in that the space-time TRELLIS codings that described transmitting terminal carries out cascade to input bit refer to：The space-time TRELLIS that transmitting terminal can carry out series cascade to input bit is encoded, wherein：

Then information and checking symbol that outer code is formed after being encoded through space-time TRELLIS, modulate on two carrier waves and launch each by space-time TRELLIS codings again after interweaving respectively.

4. according to the method described in claim 1, it is characterised in that the space-time TRELLIS codings that described transmitting terminal carries out Parallel Concatenated to input bit can also refer to：The space-time TRELLIS for the Parallel Concatenated that transmitting terminal to input bit can spread out of an information symbol and three checking symbols is encoded, wherein：

Using to two load wave modulations, the space-time TRELLIS encoded signals before two intertextures and the space-time TRELLIS encoded signals after two intertextures can be recovered respectively, then modulates and launches on two carrier waves.

5. according to the method described in claim 1, it is characterised in that described receiving terminal enters row decoding to the signal of reception and referred to：Receiving terminal can carry out the LOG-MAP decodings of time space frequency to the signal of reception.

6. the method according to claim 2 or 4, it is characterised in that described receiving terminal enters row decoding to the signal of reception and referred to：Receiving terminal can carry out the LOG- MAP decodings of the parallel time space frequency TURBO codings of symbol level to the signal of reception；

Described decoding can be iterative decoding, and described iterative decoding should meet following condition： Lc{u_k = u(i) I 7) = logCp( = u(i) 17)) = log(∑ (u_A = u(i),a_k,a_k+1 \ Ϋ))

= log(A∑ exp(a_A. (a_k ) + β_Μ (σ,₊₁ ) + γ[ (σ_Ι( , a_k+l , y_k ))) max

=^h + (σ_/£ ) + β_!(+1 (σ_Μ ) + γ[ (a_k , σ_Μ , y_k)) in above formula, to " ω sums, it can be deduced that：

Mono- _ of--, max

h = iog(A) = ~ J
)+k (,^ΣΜ , y_k)) can now be iterated decoding, calculate obtain be full letter iteration when need using side information e (| Μ (Ζ)), can set prior information as

Le{y_k I u(i)) = Lc(u_k = u(i) | Y)~Lo u_k = u(i))

During judgement, the maximum likelihood decision criterion of symbolization level, that is, the judgement symbol as the k moment for taking posterior probability 7 (^=' } |) maximum is exported；

For,；, initial ^ state, using to each rsc encoder, tailing bit forces the scheme of zero respectively, now：

1, G_K = 0

α° ^{) = {}ο, is other values

_ 1, a_k =0

β^Λσ=, ^ be other values

If any the situation of parallel route in decoding, as long as parallel route as common branch, but need to should also add one to sum parallel branch in related all formula summed to state.

7. method according to claim 3, it is characterised in that described receiving terminal enters row decoding to the signal of reception and referred to：Receiving terminal can carry out the LOG-MAP decodings of the serial time space frequency TURBO codings of bit-level to the signal of reception；

Described decoding can be iterative decoding, and the iterative decoding Bu Sudden are：

(one）The signal that carrier wave 1 and carrier wave 1 are received carries out APP calculating respectively respectively through the filtering for receiving matched filter, utilizes formula：

Pt(u_k;0) = p (u = u_k I Ϋ_Χ ^Ν) = A∑∑ )β_Μ (σ,₊₁ )γ[ (σ, , σ_Α._+Ι), calculate the code word ^ for obtaining ISN space-time code^); ,_cBoth rate after symbol level, is then utilized（10) formula：

P(s_i \Y) = f[ P(b_{I Y), be converted into the likelihood ratio of bit-level ' respectively obtain it is complete after ^ both rates

1=1

Likelihood ratio iT (W);O) , W));O), _ /=ι, during ' Α ' primary iteration, order; ^)( ;/)=ο, O (2) "/) = 0;

(two）Then formula is utilized：

Calculate side information O ')； O),^2)e(%(y);C);

(3) 2 side information 0 of obtained ISN will be calculated_£ /);O) , ^(u_kU);0) reciprocal cross, which is knitted, is used as outer code ^).,^).Prior information,_k(c^°(j);), I wherein subscript " 0 " represents outer code；

(four）Utilize formula： (_c/t;J)= _c) calculate when the posteriority likelihood information of outer code is calculated, it is always zero；By obtained l_t( ;/), (u_k;), I it is brought into formula λ^ΛΜ] ;0)= max [ _k (a_k ) + β_Μ (σ_Μ ) + _k(u_k;I) + _k (c_k (σ, ); /) ]

― 、

σ_Α:¾Ο)(σ_λ.)= n0 [ ^ ( ） + ) + + X_k (c_k (a_k);/)] in, obtain ^ (_C( );O) , 7=1,-, «₀；Then it is brought into formula：

(c(j); 0) = λ\ (c(j);0) - _k (c_k(j);I in), calculating is obtained (φ);0), j=l,-,n₀;Utilize, the likelihood ratio of side information is converted to the posterior probability of symbol

(five）Will (_C；O serioparallel exchange) is carried out first, obtains 0_A;O),; )^e( ;), O the priori letter that this information after interweaving encode as ISN time space frequency is obtained respectively through interweaving
；

(six）In follow-up iteration, above-described 5 steps are repeated；

(seven）In last time iteration, the o/of outer code is exported);O) , j = i,-,k₀, made decisions by the way of following：

1 is then return to, the decoding of next frame is carried out.

8. method according to claim 3, it is characterised in that described receiving terminal enters row decoding to the signal of reception and referred to：Receiving terminal can carry out the serial time space frequency TURB0 of symbol level to the signal of reception The LOG- MAP decodings of coding；

Described decoding can be iterative decoding, be the step of the iterative decoding：

Now all probabilistic informations are represented with symbol Grade posterior probability, the likelihood ratio without using bit-level, utilize formula： =_Λ(^;/), calculating obtains ISN space-time , p^)eU, -0), now it is not required to calculate likelihood information again, but its reciprocal cross is knitted to the prior information as outer code decoder device

Λ( ).;),

In outer code decoder：

¾₊1 (σ_Α+Ι ) = max(a_k (a_k ) + p_k {u_k ;I) + p_k {c_k (a_k ); /)

。

k ( ) = ma (¾₊₁ (a_k ) + p_k (u_k； J) + p_k (c_/c (a_k ); I) ή , ^σΜ, Λ)^{= h}Pk i^c' )Pk (^M; )

Calculating the obtained posterior probability of full information is：

Pt (c; 0) = max [a_k (a_k ) + β_Μ (σ_Μ ) + p_k (u_k ;I) + p_k (c_k {a_k)；/)] one^χ、 _n [ ) + ¾₊i (<^M ) + Pk (^Uk ' ) + Pk (^Ck (^k ); I) pl(c;0) = p (c;0)- p_k(c;), I wherein in the iteration of outer code ^;/) it is always zero；By Pt (_k；O) serioparallel exchange and the prior information P encoded respectively as ISN time space frequency that interweaves(u_k-I),
, it is later iterative process.

9. a kind of time space frequency TURB0 code devices, wherein：Transmitting terminal at least includes space-time TRELLIS encoders and interleaver, and described space-time TRELLIS encoders and interleaver constitute the space-time TRELLIS code devices of cascade；During coding：Input bit inputs space-time TRELLIS encoders and interleaver, and encoded rear output respectively；

Receiving terminal at least includes the time space frequency code translator decoded based on LOG-MAP.

10. the blunt device according to described in claim 9 of, it is characterised in that the when TRELLIS code devices of described cascade refer to：The space-time TRELLIS code devices of Parallel Concatenated, its by when TRELLIS encoders, interleaver, modulator, antenna constitute；

During coding：Input bit inputs space-time TRELLIS encoders and interleaver respectively, is exported after the bit of input space-time TRELLIS encoders is encoded to modulator, the signal of modulator output is sent through antenna；Need to input other space-time TRELLIS encoders after the Bit Interleave for inputting interleaver, and it is encoded after export to other modulator, the signal of modulator output is sent through other antenna.

11. the device according to claim 9, it is characterised in that described cascade when TRELLIS code devices refer to：The space-time TRELLIS code devices of series cascade, it is made up of space-time TRELLIS encoders, interleaver, modulator, antenna；

During coding：Input bit first inputs space-time TRELLIS encoders, the output of space-time TRELLIS encoders is respectively the input of at least two interleavers, the output of interleaver is respectively the input of at least two other space-time TRELLIS encoders, the output of at least two space-time TRELLIS encoders is respectively the input of at least two modulators, and the signal of at least two modulator output is sent through at least two antennas respectively.

12. the device according to claim 9, it is characterised in that the space-time TRELLIS code devices of described cascade refer to：The space-time TRELLIS code devices of the Parallel Concatenated of an information symbol and three school ^ r symbols can be spread out of, it is made up of space-time TRELLIS encoders, interleaver, modulator, antenna；

During coding：Input bit inputs a space-time TRELLIS encoders and an interleaver respectively, is exported after the bit of input space-time TRELLIS encoders is encoded to a modulator, the signal of modulator output is sent through an antenna；

Need to input second space-time TRELLIS encoder and second interleaver respectively after the Bit Interleave for inputting interleaver, second interleaver is output as the input of three space-time TRELLIS encoders of the mat woven of fine bamboo strips, the output of second space-time TRELLIS encoder is sent with the common input for second modulator of output of the 3rd space-time TRELLIS encoder, the signal of second modulator output through second antenna.

13. the device according to claim 10 or 12, it is characterised in that described code translator can be the parallel time space frequency TURBO decoder of single-rate；It is made up of matched filter, APP calculators, interleaver, anti-interleaver, discriminating gear；

In decoding：The signal that carrier wave 1 and carrier wave 2 are received enters two APP calculators respectively through matched filter 1,2 is received, and completes to decode through the iterative decoding based on LOG-MAP decoding algorithms.

14. device according to claim 11, it is characterised in that described code translator can be serial time space frequency TURBO decoder；It is made up of matched filter, APP calculators, interleaver, anti-interleaver, discriminating gear；

In decoding：The signal that carrier wave 1 and carrier wave 2 are received enters two APP calculators respectively through matched filter 1,2 is received, the output of two described APP calculators is respectively the input of anti-interleaver 1,2, the output of described anti-interleaver 1,2 is common to turn into the input of the 3rd APP calculator, completes to decode through the iterative decoding based on LOG- MAP decoding algorithms.