CN1555624A

CN1555624A - Full speed Turbo time-space coding method and device

Info

Publication number: CN1555624A
Application number: CNA028181255A
Authority: CN
Inventors: 李永会
Original assignee: Linkair Communications Inc
Current assignee: Linkair Communications Inc
Priority date: 2002-03-20
Filing date: 2002-03-20
Publication date: 2004-12-15
Also published as: AU2002238369A1; WO2003079595A1

Abstract

The invention provided a method of full speed TURBO space-time block coding and the apparatus, comprising: TURBO space-time block coding and interlacing the transmitting signal at the transmitting end, forming the coding information and interlaced mixed signal of the coding information; decoding the received mixed signal at the receiving end, when decoding, recovering sideband information of corresponding signal from the received mixed signal. The invention has the character of optimization in the existing space-time block coding technique, especially, at the receiving end, simultaneous reaching the high coding gain and the diversity gain.

Description

Full speed Turbo time-space coding method and device

A kind of method of full speed turbo space-time block coding and engineering device technique field

Concretely it is a kind of full rate TURBO space-time code method and devices the present invention relates to technical field of telecommunications.

Background technology

It is well known that in fading channel, the decline of signal is by the performance of severe exacerbation system.It is to use " diversity " to overcome the maximally effective means of decline.Space-time coding techniques（As described in document [1] to [3]）Diversity gain can be obtained, the influence of decline is overcome.

Recently, space-time code is combined with FEC and attracted attention, both effective combinations can make system, and camphane obtains diversity gain and coding gain simultaneously.

In original cascade space-time code（Such as document [4], [5] are described）, outer code is the TURBO codes of standard, and ISN is space-time block coding, which constitutes the cascade space-time TURBO codes of serial or parallel.

In addition, in document [6], [8] a kind of encoding scheme of full rate is proposed in, diversity gain is obtained by the interaction transmitting raw information between two antennas and the information after intertexture, this scheme can obtain larger coding gain, but it is due to simply transmitting portion signal, so there is no full diversity gains.

Another full rate and the space-time TURBO encoding schemes of full-diversity are provided in document [7], and this scheme passes through alternately（Scramb le) input information bits, to reach full rate and full-diversity.The major defect of this scheme is anti-sudden poor.

The content of the invention

It is an object of the present invention to provide a kind of method of full speed turbo space-time block coding and device, defect and deficiency to solve prior art presence.The present invention can improve the performance of system well, can be under conditions of full rate be reached, obtain very big coding gain and diversity gain, the present invention has optimal performance in existing Space-time coding techniques, particularly in receiving terminal, very high coding gain and diversity gain can be reached simultaneously.The technical scheme is that：The invention provides a kind of full rate TURBO space-time code methods, including：TURBO space-time codes and signal interleaving are carried out to transmission signal in transmitting terminal, coding information is formed and is encoded after interweaving The mixed signal of information；

Row decoding is entered to the mixed signal of reception in receiving terminal, needs to recover the side information of corresponding signal from the mixed signal of reception in decoding.

Described includes in transmitting terminal to transmission signal progress TURBO space-time codes and signal interleaving：Transmitting terminal can carry out series cascade TURBO space-time codes to transmission signal, wherein：

Can be with representing by f^wTo) transformation matrix；" the input bit sequence of TURBO space-time codes can be represented, ＞ can represent the output bit sequence of TURBO space-time codes；

Work as i, j, series cascade TURBO space-time code Bu Sudden are during k=1,2：

With 7⁽²⁾Be transformed to w and⁽¹²⁾, and¹²) it is interleaved after output bit stream be (O⁽¹¹⁾ , O⁽¹²⁾ ) ;

V^{n) . ¹²⁾It is interleaved to be with bit stream that is being exported after TURBO space-time codes（d⁽²¹⁾,0⁽²²⁾) ;

7⁽²⁾It is transformed to through TURBO space-time codes²¹⁾And ^²²⁾ , ²¹⁾With²²) it is interleaved after output bit stream be（d^{(31) (32)}) ;

f⁽²¹⁾、 ²²⁾It is interleaved to be with bit stream that is being exported after TURBO space-time codes（d⁽⁴¹⁾,d⁽⁴²⁾).Described includes in transmitting terminal to transmission signal progress TURBO space-time codes and signal interleaving：Transmitting terminal can carry out Parallel Concatenated TURBO space-time codes to transmission signal, wherein：

Can be with representing by the transformation matrix to ＞；The input bit sequence of TURBO space-time codes can be represented, the output bit sequence of TURBO space-time codes can be represented；

Work as i, j is the step of Parallel Concatenated TURBO space-time codes during k=1,2：

f(²) output bit stream be⁽¹¹),(5(¹²))；

/^(,)、 ⁽²⁾The bit stream exported after TURBO space-time codes is²¹⁾,d⁽²²⁾)；

、 /(²) it is interleaved after output bit stream be（d(³¹),d(³²))；

, the bit stream that exports after interleaved and TURBO space-time codes be（d⁽⁴¹) (⁴²⁾)。

Described includes in transmitting terminal to transmission signal progress TURBO space-time codes and signal interleaving：Transmitting terminal can carry out the TURBO space-time codes of series cascade modulation extension to transmission signal, wherein：

7 ^ can be used) represent by ＞ to ^ transformation matrix；The input bit sequence of TURBO space-time codes can be represented, the output bit sequence of TURBO space-time codes can be represented；

It is the step of the TURBO space-time codes of series cascade modulation extension when=1,2： ⁽¹⁾、 ⁽²⁾Be transformed to, f⁽¹²⁾ , ⁽ⁿ⁾ > ¹²⁾The bit stream of output is after interleaved

(„ );

F⁽¹¹⁾、 ¹²⁾It is interleaved to be with bit stream that is being exported after TURBO space-time codes（<5⁽²¹⁾,d⁽²²⁾); ("、 (²) through TURBO space-time codes be transformed to f (²¹)、 V⁽²²⁾ , f(²¹)、 ²²) it is interleaved after output bit stream be（d⁽³¹⁾,d⁽³²⁾);

V K ²²) bit stream that exports after interleaved and TURBO space-time codes is（<5(⁴¹ d⁽⁴²⁾);The symbol that the bit stream of output is mapped as after QPSK signals is, S₁₂, S_2l and ¾₂；

S_u, 5₁₂, and will by transforming function transformation function/(c, modulation expand to the symbol after 16QAM signals be and, i.e., with

S, and can launch after channel interleaving on two antennas.

Described includes in transmitting terminal to transmission signal progress TURBO space-time codes and signal interleaving：Transmitting terminal can carry out the TURBO space-time codes of Parallel Concatenated modulation extension to transmission signal, wherein：

It can be represented with W by " to ＞ transformation matrix；The input bit sequence of TURBO space-time codes can be represented) the output bit sequence of TURBO space-time codes can be represented；

Work as i, j is the step of the TURBO space-time codes of Parallel Concatenated modulation extension during k=1,2：

7⁽¹⁾) output bit stream be（<5⁽¹¹),ό(¹²))；

、 ⁽²) bit stream that is exported after TURBO space-time codes is⁽²¹⁾,d(²²⁾)；

、 ⁽²⁾The bit stream of output is after interleaved（(5^{(31) (32)})；

、 ⁽²⁾It is interleaved to be with bit stream that is being exported after TURBO space-time codes（d⁽⁴¹) 。

The symbol that the bit stream of output is mapped as after QPSK signals is, S₁₂, s₂₁ and s₂₂\

S_n, S_n, 4 Hes₂The symbol after 16QAM signals will be expanded to by transforming function transformation function/() modulation is and that is,=f (S_u,S_u) and=f (S_2VS₂₂)；

S, and can launch after channel interleaving on two antennas.

It is described row decoding is entered to the mixed signal of reception in receiving terminal to include：The LOG-MAP that can be extended in receiving terminal to the mixed signal of reception decodes

It is described row decoding is entered to the mixed signal of reception in receiving terminal to include：

The 2 dimension LOG-MAP decodings that the mixed signal of reception can be extended in receiving terminal, wherein：Receive signal form be： Ri = h_u ■S₁ +h₂₁ -S₂ = 2h_u -S_n +2h₂₁ -S₂₁ +h_n -S_n +h₂₁ -S₂₂

R₂ = h_n -S_x +h₂₂ - S₂ = 2h_n -S_u +2h₂₂ -S_2l +h -S_n +h₂₂ -S₂₂.

It is in moment k reception signal

r\k ~ k^sn, k +2k_{21 k}s_{2l k} +h_{u fc}s_{l2 k} + h ₂, _k s ₂₂,_k — k^su, k +2h_{2l k}p_{ll k} +h_u,_ks _{2 k} + h ₂,_k p _l2,_k , r2k ⁼

, A+hi2, k^SL, k+A 22,22, A:

k '

In formula, Α,_/£=¾,_ΛIt is information source ^ value of the verification sequence in moment k, similarly Α₂Λ. = ½,_ΑBe interweave after sequence verification sequence moment k value；

It is each to receive signal, it is essentially all the sum of 4 parts, including information sequence, information sequence after intertexture, the school ^ r sequences of information sequence after the verification sequence of information sequence, intertexture, they after different fading channels respectively through synthesizing reception signal.

The mixed signal of reception can be filtered in receiving terminal, radio frequency and intermediate frequency demodulation, despreading, the APP of baseband signal after calculating processing;The decoding includes 4 loops, and iterative decoding is carried out on this 4 loops；Wherein：

Joint probability density need to meet following condition：

f

_t ,σ _k ² ,u j)p{u_lk = u(i))p(u_2k = u(j))

P(y_k I σ,',η,,σ^ ,η^ = (πΝ₀Υ^Μ exp(--^- || y_k ~ E7H_AS, ||";Posterior probability need to meet following condition：

("u = u{i),u_2k = u(j) I 7)

Information bit need to meet following condition：

P( _u = u(i) I 7)

Information bit need to meet following condition after intertexture： P(u_2k = u(j) I 7)

In multipath conditions：

One²

P(y_k I a_k ^l ,u a_k ² ,Uj ) = {ττΝ₀Υ^Μ exp(- || )

Side information need to meet following condition：

V (F I u(i)) = P(u_u = "(0 I Y)-P(u_u = "())

L^e{Y I u{j)) = P{u_2k = u{j) I Y)-P{u_lk=u (j))-in iterative decoding, every 3 side information and using as the prior information of another 1 tunnel information, i.e.,： P(u = u_x(i)) = C I ^) + ₃("() I y₂) + L^(u(j) I y₂)

Similarly, the side information sum on other three tunnels is equal in other three roads information bits per prior information all the way.It is described row decoding is entered to the mixed signal of reception in receiving terminal to include：

The mixed signal of reception can be filtered in receiving terminal, radio frequency and intermediate frequency demodulation, despreading, the Α Ρ Ρ of baseband signal after calculating processing;The decoding includes 2 loops, and iterative decoding is carried out on this 2 loops；Wherein：Joint probability density need to meet following condition：

u(i))p(u_u = "(_/)) 2

)；

Posterior probability need to meet following condition：

P("u- = uf),u_u = u(j) I Y)

Information bit need to meet following condition：

P( _lk = u(i) I Y) σ _k ^l σ _k ²

Information bit need to meet following condition after intertexture：

P( _2k = (j) I Y)

"i* σ _t ¹ σ ₄ ²

In multipath conditions： P(y_k I ,u a_k ² ,Uj ) = (πΝ₀)~^Μ exp(- || )

Side information need to meet following condition：

L^e(Y I "(0) = P(u_lk = "(!·) I Y)-P(u_u = u(i))

L^e{Y I u{j)) = P(u_2k = u(j) I Y)-P(u_2k = u(j))

There are 1 side information output, the prior information that they are decoded respectively as next iteration in iterative decoding.

Described TURBO space-time codes can be recurrence space-time convolutional encoding.

Present invention also offers a kind of full rate TURBO space-time code devices, including emitter and reception device, it is characterised in that：Emitter at least includes TURBO space-time coders and signal interleaving device, and TURBO space-time coders are encoded to transmission signal, and signal interleaving device is interleaved to transmission signal, the mixed signal of coding information after forming coding information and interweaving；

Reception device enters row decoding to the mixed signal of reception, needs to recover the side information of corresponding signal from the mixed signal of reception in decoding.

Described emitter at least includes TURBO space-time coders and signal interleaving device refers to：TURBO space-time coders and signal interleaving device may make up series cascade TURBO space-time code devices.

Described emitter at least includes TURBO space-time coders and signal interleaving device refers to：TURBO space-time coders and signal interleaving device may make up Parallel Concatenated TURBO space-time code devices.

Described emitter includes：Series cascade TURBO space-time codes device, modulation and expanding unit, channel interleaver that TURBO space-time coders are constituted with information source interleaver；Wherein：

Launch after the coding for the series cascade TURBO space-time code devices that transmission signal is constituted through TURBO space-time coders and information source interleaver, modulation and the modulation of expanding unit extension, the intertexture of channel interleaver from corresponding antenna.

Described emitter includes：Parallel Concatenated TURBO space-time codes device, modulation and T extending apparatus, channel interleaver that TURBO space-time coders are constituted with information source interleaver；Wherein：

Launch after the coding for the Parallel Concatenated TURBO space-time code devices that transmission signal is constituted through TURBO space-time coders and information source interleaver, modulation and the modulation of expanding unit extension, the intertexture of channel interleaver from corresponding antenna.

Described reception device at least includes：The LOG- MAP code translators of extension, the LOG of the extension- MAP code translators can enter row decoding to the mixed signal of reception.

The LOG- MAP code translators of described extension can tie up LOG- MAP code translators for the 2 of extension, including matched filter, APP calculators, deinterleaver, adder, interleaver；

In decoding：Iterative decoding is carried out on 4 loops.

The LOG-MAP code translators of described extension can tie up LOG- MAP code translators for the 2 of extension, including matched filter, APP calculators, deinterleaver, adder, interleaver；

In decoding：Iterative decoding is carried out on 1 loop.

Beneficial effects of the present invention are：The present invention can improve the performance of system well, can be under conditions of full rate be reached, obtain very big coding gain and diversity gain, the present invention has optimal performance in existing Space-time coding techniques, particularly in receiving terminal, ^ blunt high coding gain and diversity gain can be reached simultaneously.

Brief description of the drawings

Fig. 1 is the structural representation of 2/8 multirate serial cascade TURBO space-time code of the inventive method in specific implementation；

Fig. 2 is the structural representation of 2/8 rate parallel cascade TURBO space-time code of the inventive method in specific implementation；

Fig. 3 is the QPSK signal constellation (in digital modulation) figures of the inventive method；

Fig. 4 is the 16QAM signal constellation (in digital modulation) figures of the inventive method；

Fig. 5 is the TURBO space-time code structured flowcharts of series cascade modulation extension of the apparatus of the present invention in specific implementation；

Fig. 6 is the TURBO space-time code structured flowcharts of Parallel Concatenated modulation extension of the apparatus of the present invention in specific implementation；

Fig. 7 receives the channel fading schematic diagram of system for the hair of the present invention two two；

Fig. 8 is the structural representation of the dimension LGO- MAP of extension 2 decoding algorithms 1 of the space-time TURBO codings of modulation extension of the apparatus of the present invention in specific implementation；

Fig. 9 is the structural representation of the dimension LOG-MAP of extension 2 decoding algorithms 2 of the space-time TURBO codings of modulation extension of the apparatus of the present invention in specific implementation；

Figure 10 extends the comparison figure of the BER performances of space-time code and the BER performances of other encoding schemes for full rate under fading channel of the present invention. Embodiment the invention provides a kind of method of full speed turbo space-time block coding, including：TURBO space-time codes and signal interleaving are carried out to transmission signal in transmitting terminal, the mixed signal of coding information after forming coding information and interweaving；

By taking the structural representation of the 2/8 multirate serial cascade TURBO space-time codes as shown in Fig. 1 as an example, to elaborate this encoding scheme.It has already been indicated that the performance of recurrence space-time convolutional encoding is better than non-recursive coding in [8], so space-time coder in fig. 1 and 2, general to use recurrence space-time convolution coder.

{ k) represented by the transformation matrix to (i, j, k=, 2) with Ty.

Wherein⁽⁴⁾,=1,2 and f i, j=1,2 are input and the output bit sequence of recursive convolutional encoder.4 row bit streams of cascade encoder final output are（(^" ）, (0⁽³¹⁾,ό⁽³²⁾), (0⁽²¹⁾,δ⁽²²⁾) and（<5(⁴¹),d(⁴²)), it is mapped as the symbol after QPSK signals for S₁₂, S₂₁ and ₂。

s_n, s₁₂, and₂By by following transforming function transformation function/c, two symbols are assembled into

^ and ^, i.e.,

(1)

S₂ = f(S_2l)S₂₂) (2)

^ and finally it will launch after channel interleaving on two antennas. .

Below only discuss when/(X, the situation during linear function for being, now has

In formula,_PfBe referred to as the power normalization factor, for ensure/conversion before and after, signal power keep it is constant.《, it is referred to as merging coefficient, α, Α are referred to as normalized merging coefficient.

It is computed, (4)

Can be constant, can also because in planisphere signaling point it is different and different, can so produce the rotation of phase.α is only discussed below, is the situation of constant.

At this point it is possible to be expressed as

Wherein=[β] is referred to as coefficient matrix_tFor example, α=^, β=so f_(x,_y)

Now QPSK signals, S_2lWith₂Will be by/x) it is for conversion into rectangle 16QAM signals

2S、 + S. 22

QPSK symbols, s_2lWith₂Signal constellation (in digital modulation) figure and conversion after sum 16QAM signal constellation (in digital modulation)s figure such as Fig. 3, shown in Fig. 4.

Therefore, this scheme is actually a kind of space-time coding scenarios for modulating extension, it is possible to use the modulation factor of extension goes to exchange diversity or coding gain for.

As shown in Fig. 2, Parallel Concatenated modulation extension space-time code is by the convolution coder of Parallel Concatenated, source symbol interleaver, the conversion of signal and mapper, and the composition such as channel interleaving.

The basic thought of time space frequency dimension design is discussed above, and utilizes a kind of encoding scheme of serial parallel cascade of thought design.The need for rationally difference can be met using time space frequency dimension, at utmost to reach diversity gain, coding gain and increase capacity.

For the time space frequency TURBO codings of modulation extension, due to actually containing two unknown signals and corresponding verification simultaneously in each reception signal, so traditional LOG- MAP algorithms can not complete the decoding of this coding structure system, this section will promote traditional LOG-MAP algorithms, obtain a kind of LOG-LOG interpretation methods of extension, this problem can be effectively solved, so this section first provides the MAP interpretation methods of extension time space frequency Turbo codings recited above.During using above-described coding method, the form for receiving signal is：

?】 = h_n . S_r + h₂₁ · S₂ = 2h · S_n + 2 "h^Γ _2l · S ⁼ ₂₁ + h_u . S₁₂ + h_2l . S₂ (7)

^R2 = i · ^Sl + i · ^S2 -

(8)

It is in moment k reception signal

+ 2h₂、_ks ,_k + h_u,_ks_n,_k + _{2l k}s_{22 k} — 2h_u,_ks_u,_k + 2h_2ltkp_nk + h_nks_nJi + h _kp_ilk (9)

r2k ⁼ 2h_l2,_ks_u,_k + 2h_22ks_2lk + h_uks_nk + h_22ks_22k

(10) in formula,；^=¾₄It is value of the verification sequence in moment k of information source, similarly P_1U^^ is value of the verification sequence in moment k of the sequence after ^ interweaves.

By（9), (10) it can be seen that, it is each to receive signal, it is essentially all the sum of 4 parts, including information sequence, the information sequence after intertexture, the verification sequence of information sequence, the verification sequence of information sequence after intertexture, they after different fading channels respectively through synthesizing reception signal.

(9),（10) in,₄, as shown in fig. 7, the channel fading between the transmitting antenna and the mat woven of fine bamboo strips transmitting antenna is represented,

Fig. 8 gives to be received to 2 hairs 2, the decoding block diagram of Parallel Concatenated modulation extension space-time code.2 receive signal and first pass around two reception matched filters, complete radio frequency and intermediate frequency demodulation, the function of despreading.Baseband signal after processing is admitted to two APP (posterior probability）Calculator.As can be seen from Figure 8, this decoding includes 4 loops, and iterative decoding is carried out on these loops.More detailed decoding algorithm is given below.

It is, order consistent with the derivation of traditional LOG- MAP decoding thoughts to utilize MAP algorithms, it will be assumed that be independent：

^SU,k " ^U ,^SV2,k ~ ^U2k (11)

Need to ask now：

P(¾

(12)

To use LOG- MAP interpretation methods, definition:

= ^pi^uik

a_k (σ^ ,σ,²) = P(a_k ^l ,σ^,Υ') (14)

(15)

, from state σ_¾' to+, and input for u { j), from state²Arrive₄₊₁ ², joint probability density when being output as.

Through abbreviation, it can obtain,

ΥΪ ¹ > ^σΜ ^σΜ ,y_k) = p(y_k I ^{σ w}« > ^σ¾ ² ' ^uj )P(^u = ^u f))p u_lk =" )) (17)

The independence that make use of in above formula.P, y in formula_k I ||²) (18)

2s, _u. +5.

In above formula, s_t=1-' ° 2k, if_Λ= _ι, H_k = (h _k A₂₁₄), and if；_t =r₂,

²Puk +Pm)

Μ represents the number of reception antenna in formula.

Above formula assumes that no parallel route is derived, has algorithm during parallel route identical with processing method above.

Similarly, the iterative formula that can be obtained,

β/(', σ_/£ ² ) σ_Μ ² ,y_k) (20)

Using above formula, posterior probability expression can be obtained,

P(u_k = u(i),u_2k = u(j) I Y)

(²¹)

So as to obtain

P(u,_k =u(i)\Y)

(²²⁾With

P( _2k = u(j) I Y)

^{= Λ}ΣΣΣ%(^σ ^² (σ ^₊/,σ ,_σ,₊ Λ)Α-_{+1 +} ^₊₁ ²) ⁽²³⁾When calculating h, as long as ensureing that upper two formula is 1 to the probability of all input sums, you can obtain corresponding h.

In multipath conditions, calculate;) formula can be modified to： p{y_k I y_ki - _sH_kls_kl \\ ) (24)

In above formula, subscript/expression the/footpath signal and decline, L are the number of multipath, and M is the number of reception antenna, and ^ represents moment 1, the channel matrix in the/footpath.

When there is parallel route, all calculating process are identical, parallel route need only also be handled when as common path, and calculating α, during Α, in addition it is also necessary to which parallel route is summed.So α, Α should be corresponded to for each path.To the system with parallel route, it is not recommended that with the method described in above, in [10], Bruce E.Wahlen provided a kind of Pragmatic Trellis codings designed for parallel route, it may be considered that its cascade is used in space-time code system.

So, the full information just obtained respectively, meanwhile, side information is presented as follows：

L^e (Y I "(0) = P(u_ik = u(i) I Y)― P(u_lk = u{i)) (25)

L^e (Y I u(j)) = P{u_2k = u(j) I Y) - P{ _u = u(j)) (26)

On each receive antenna, the side information of information bit after information bit can be obtained respectively and interweaved, so, in two reception antennas, actually, the side information of 4 bits for information about can be obtained, so if using iterative decoding, the code efficiency of 1/4 code check can be reached.

The system block diagram of iterative decoding is as shown in Fig. 8,9：

System is received to two hairs two, to first reception antenna, according to above-mentioned formula, information bit can be obtained respectively_¾With the side information of information bit ^ after intertexture (|_M(0), L y, and u j)) similarly to first reception antenna, according to above-mentioned formula, side information ^ (^ " (o), the ο ^ " of information bit after information bit ^ can be obtained respectively and is interweaved>).4 side information of bit for information about have so been actually get, L is designated as^e _k(_yiValue after I " (0) interweaves is L { y_x I u(i))。

So in iterative decoding, this equivalent to many TURBO codes iterative decoding in iterative decoding, every 3 side information and the prior information of information all the way in addition will be used as.For example, as shown in figure 8, in first reception antenna_UlkPrior information in iterative decoding, (u (j) | ^) will be equal to, L^e ₃(u(i)\y₂) , «)| ₂) sum.

I.e.： P(u_u = u_x (0) = (u(j) \_yi) + L (u(i) \y₂) + L^ (u(j) \ y₂) (27) similarly, the side information on other three tunnels is equal in other three roads information bits per prior information all the way Sum.

Decoding algorithm 1 given above, is substantially to do iterative decoding on two reception antennas.In fact, can be not used to do iterative decoding between two reception antennas, but merged in computation measure, go to obtain diversity gain, we term it decoding scheme 2.Fig. 9 gives the decoding block diagram of decoding algorithm 2, and now decoder is only included is carried out in two loops, this two-way information of iterative decoding.

Now the signal of two reception antennas is simply being calculated_Λ| diversity is carried out when σ Λ ", σ Λ " and is merged with now, the calculating of measurement should be two reception antenna measurement sums, can now be changed when calculating ^：

(28)

Conditional probability (I) in above formula should ~ be just：

P(y_k I σΛ",.,σΛ" Λ,· - II ) (²⁹)

In addition, the calculating of other probability is all identical with decoding algorithm 1.

Thus now only one of which APP calculators, only two side information outputs, the prior information that they are decoded respectively as next an iteration.

Analysis of simulation result is given below, as shown in Figure 10, provides and uses extension LOG- MAP decoding algorithms, mapping function/(^^^x+^y,_α„ ·. β_ηDuring=2,1, the program and the performance comparision in [6], the full rate space-time TURBO encoding schemes proposed in [8] and the Tarokh scheme proposed in [2].In emulation, this programme uses 4 states, each channel model is single path fading channel, channel estimation uses CP continuous pilot assisted channel estimation, and translational speed 60km/h, interior intertexture uses 512bi t random interleaver, channel interleaving uses 9800bi t random interleaver, spreading gain 32, using CP continuous pilot channel estimation, iteration 6 times.In the simulation result being provided below, it is assumed that the total transmission power of single antenna is identical when the total transmission power of two emitting antennas is with non-emissive diversity.

The present invention can improve the performance of system well, can be under conditions of full rate be reached, obtain very big coding gain and diversity gain, the present invention has optimal performance in existing Space-time coding techniques, particularly in receiving terminal, blunt high coding gain and diversity gain can be reached simultaneously.Bibliography cited in the present invention is as follows： [I] . S. M. Alamouti, " A simple transmit diversity technique for wireless [2] . V. Tarokh, H. Jafarkhani, and A. R. Calderbank, "Space time block coding for wireless communications: Performance results, " IEEE JSAC, voll.17, pp.451-460, Mar.1999.

[3] V. Tarokh, H. Jafarkhani, and A. R. Calderbank, "Space-time block coding for wireless communications: Theory of generalized orthogonal designs, " IEEE Trans. On Information Theory, vol.45, pp.1456-1467, July. 1999.

[4] G. Bauch, " Concatenation of space-time block codes and turbo TCM;; IEEE International Conference on Communications (ICC'99), pp.1202-1206, June 1999.

[5] K. R. Narayanan, "Turbo decoding of concatenated space-time codes, " 37^th

Annual Allerton Conference on Communication, Control and Computing, Sept, 1999.

[6] Hsuan-Jung Su and Evaggelos Geraniotis, " Space-Time Turbo Codes with Full Antenna Diversity ", IEEE Tans, on Commun, vol.49, NO.1, Jan 2001.

[7] Y.Liu _?M. P. Fitz and 0· Y, Takeshi ta, "QPSK space-time turbo codes," IEEE International Conference on Communications (ICC'OO) , June 2000.

[8] D. Cui and A. M. Haimovich, "A new bandwidth efficient antenna diversity scheme using turbo codes, " 34^thAnnual Conference on Information Sciences and Systems (CISS'00), vol.1, pp. TA -6.24- 29, Mar.2000, Princeton, NL

[9] Robert J. McElience, David J. C. Mackay and Jung-Fu, " Turbo Decoding as an Instance of Pearl's "Belief Propagation" Algorithm", IEEE JSAC,

Vol.16, No.2, Feb 1998.

[10] Bruce E. Wahlen and Calvin Y.Mai, "Turbo Coding Applied to Pragmatic Trellis- coded", IEEE Communication Letters, VOL.4, NO.2, Feb 2000.

[II] D, J. C. MacKay, "A free energy minimization framework for inference problems in modulo 2 arithmetic, " in Fast Software Encryption, B. Preneel, Ed.

Berlin, Germany: Spr inger-Verlag Lecture Notes in Computer Science, vol.1008, 1995, pp.179-195.

[12] D. J. C. MacKay and R. M. Neal, "Near Shannon limit performance of low density parity check codes, " Electron. Lett. , vol.32pp.1645-1646, Aug.1996.

[13] . E. Telatar, "Capacity of Multi-antenna Gaussian Channels", IEEE Trans.

Commun, vol.42, No.2/3/4, pp.1617-1627, November-December 1999.

[14] . C. Chuah, J. M. Kahn and D. Tse_?" Capacity of Multi-Antenna Array Systems in Indoor Wireless Environment ", accepted for publication in Globecom, Sydney, 1998,

Claims

Claim

1. a kind of full rate TURBO space-time code methods, including：TURBO space-time codes and signal interleaving are carried out to transmission signal in transmitting terminal, the mixed signal of coding information after forming coding information and interweaving；

Row decoding is entered to the mixed signal of reception in receiving terminal, needs to recover the side information of corresponding signal from the mixed signal of reception in decoding.

2. the method being confused according to claim 1, it is characterised in that described to include in transmitting terminal to transmission signal progress TURBO space-time codes and signal interleaving：Transmitting terminal can carry out series cascade TURBO space-time codes to transmission signal, wherein：

It can be represented with 2, (A) by the transformation matrix to ^ "；The input bit sequence of TURBO space-time codes can be represented, the output bit sequence of TURBO space-time codes can be represented；

It is the step of series cascade TURBO space-time codes when=1,2：

/^(,)With) be transformed to and²⁾ , f⁽ⁿ⁾With¹²⁾The bit stream of output is (0 after interleaved^(,1 ,0⁽¹²⁾)；

V^(W , ²⁾It is interleaved to be with bit stream that is being exported after TURBO space-time codes（(5⁽²¹^⁽²²⁾)； lK⁽²⁾It is transformed to through TURBO space-time codes²¹⁾With²²⁾ ,. ²¹⁾And ^²²⁾The bit stream of output is after interleaved（d⁽³¹⁾,d⁽³²⁾) ;

V^{{2l 22}) bit stream that exports after interleaved and TURBO space-time codes is（d(⁴¹⁾,d⁽⁴²⁾)。

3. the method according to claim 1, it is characterised in that described to include in transmitting terminal to transmission signal progress TURBO space-time codes and signal interleaving：Transmitting terminal can carry out Parallel Concatenated TURBO space-time codes to transmission signal, wherein：

Can with 2) represent by) transformation matrix；The input bit sequence of TURBO space-time codes can be represented, the output bit sequence of TURBO space-time codes can be represented；

Work as i, j, be the step of Parallel Concatenated TURBO space-time codes during k=1,2：

)、 /(²) output bit stream be（d⁽¹¹),d(¹²)) ;

、 7⁽²⁾The bit stream exported after TURBO space-time codes is（<5⁽²¹⁾, 0⁽²²⁾)；

、 ⁽²⁾The bit stream of output is after interleaved（d⁽³¹⁾,d⁽³²⁾) ;

、 7⁽²⁾It is interleaved to be with bit stream that is being exported after TURBO space-time codes（<5^{(41) (42)})。

4. the method according to claim 1, it is characterised in that described to include in transmitting terminal to transmission signal progress TURBO space-time codes and signal interleaving：Transmitting terminal can carry out the TURBO space-time codes of series cascade modulation extension to transmission signal, wherein：

Can with 7) represent by⁽" arrive) conversion square!¹Finally；(" can represent the input bit sequence of TURBO space-time codes, can represent the output bit sequence of TURBO space-time codes；

As A:It is the step of the TURBO space-time codes of series cascade modulation extension when=1,2：

、 /⁽²⁾It is transformed to "）、⁽¹²⁾ , f⁽ⁿ⁾、 ^(,2)The bit stream of output is after interleaved);

f⁽ⁿ⁾、 ¹²⁾It is interleaved to be with bit stream that is being exported after TURBO space-time codes（0⁽²¹), d⁽²²⁾)； /(²) it is transformed to ^ through TURBO space-time codes²¹)、 V²²⁾ , V ^{) 22}) it is interleaved after output bit stream be（<5⁽³¹⁾,d⁽³²⁾); '

V^{(21 22)}It is interleaved to be with bit stream that is being exported after TURBO space-time codes（d^{(41) (42)})；The symbol that the bit stream of output is mapped as after QPSK signals is_l2, S_2l and S₂₂； S_n, S_l2, and₂Will by transforming function transformation function/(x, modulation expand to the symbol after 16QAM signals be and, i.e. ,=/ (₁₁, 4) and₎¾=/( ₁, ₂)；

s_xIt can launch with after channel interleaving on two antennas.

5. the method according to claim 1, it is characterised in that described to include in transmitting terminal to transmission signal progress TURBO space-time codes and signal interleaving：Transmitting terminal can carry out the TURBO space-time codes of Parallel Concatenated modulation extension to transmission signal, wherein：

Can be with 7.) expression by the transformation matrix to ^ ^；The input bit sequence of TURBO space-time codes can be represented, ^ can represent the output bit sequence of TURBO space-time codes；

It is the step of the TURBO space-time codes of Parallel Concatenated modulation extension when=1,2：

/^(,)、： r(²) output bit stream be（d"¹),^¹)；

、 ⁽²⁾The bit stream exported after TURBO space-time codes is（<5(^{21) (22)})；

7⁽¹⁾、 /⁽²⁾The bit stream of output is after interleaved（0⁽³¹⁾,0⁽³²⁾)；

J⁽¹⁾, /⁽²⁾It is interleaved to be with bit stream that is being exported after TURBO space-time codes（0⁽⁴¹⁾,d⁽⁴²⁾)。

The symbol that the bit stream of output is mapped as after QPSK signals is, S_n, S_2l and ¾₂; S_n, S_u, ^ and ^ will be expanded to after 16QAM signals by transforming function transformation function/modulation Symbol is S and i.e. ^=/ (U₁₂) and=/ (₂₁,₂);

5. and it can launch after channel interleaving on two antennas.

6. the method according to claim 1, it is characterised in that described to enter row decoding to the mixed signal of reception in receiving terminal and include：The LOG-MAP decodings that the mixed signal of reception can be extended in receiving terminal.

7. the method according to claim 2, it is characterised in that described to enter row decoding to the mixed signal of reception in receiving terminal and include：

The 2 dimension LOG- MAP decodings that the mixed signal of reception can be extended in receiving terminal, wherein：Receive signal form be：

R_l = _n -^. +h_2l -S₂ = 2h_u -S_u +2h -S_2l +h_u -S +h₂₁ -S₂₂

R₂ = h_n -S! +h₂₁ -S₂ = 2h₁₂ - S_n +2h₂₂ -S_2l +h_u -S_l2 +h₂₂•5'₂₂.

It is in moment k reception signal

T 2k

⁼ 2/i _12> }_CS _k + 22, k Pll,k ^12, k^S 12, k + 22、 k P \2, lc ,

In formula, ^=^ is value of the verification sequence in moment k of information source, similarly Aw=,_tBe ^ interweave after sequence verification sequence moment k value；

It is each to receive signal, it is essentially all the sum of 4 parts, including information sequence, information sequence after intertexture, the verification sequence of information sequence after the school eyelid sequence of information sequence, intertexture, they after different fading channels respectively through synthesizing reception signal.

8. the method according to claim 3, it is characterised in that described to enter row decoding to the mixed signal of reception in receiving terminal and include：

The 2 dimension LOG- MAP decodings that the mixed signal of reception can be extended in receiving terminal, wherein：' receive signal form be：

R₁ = h_n -Si +h₂₁ -S₂ = 2h_n -S_u +2h_2l -S₂₁ +h_u -S_l2 + h_2l -S₂₂

R₂ = h_u . +h₂₂ -S₂ = 2h_n -S +2h₂₂ -S_2l +h₁₂ -S_u +h₂₂ -S₂₂.

It is in moment k reception signal ^^u,k^s \\ +2h_{21 k} p_{u k} ^- _{U) k}s _c +h_{2l c}p_{l2} k}；

r2k ~
2, fc ^S , k + 22, k ^S22, k

― 2¾₁₂₍ k^SU_t k ⁺ k '

In formula '_Al,₄=_¾,_/£It is value of the verification sequence in moment k of information source, similarly

Aw=be₁The dangerous sequence in the school of sequence after intertexture is at the moment^kValue；

It is each to receive signal, it is essentially all the sum of 4 parts, including information sequence, information sequence after intertexture, the verification sequence of information sequence after the school r sequences of information sequence, intertexture, they after different fading channels respectively through synthesizing reception signal.

9. the method according to claim 4, it is characterised in that described to enter row decoding to the mixed signal of reception in receiving terminal and include：

The 2 dimension LOG- MAP decodings that the mixed signal of reception can be extended in receiving terminal, wherein：Receive signal form be： ·

Ri = h_n -S! + ^2i = 2Λ„ -S_n +2h_2l -S_2l +h_n -S_u +h_2l -S₂₂

R₂ = h₁₂•S₁ +h₂₂ -S₂ = 2h_l2 -S_n +2h ₂₂ -S₂₁ +h_l2 -S₁₂ +h₂₂ -S₂₂.

It is in moment k reception signal

+ _kS ,_k + h_{2 k}S ₂₂,_k

r2k ~ 2Λ₁₂₎ fc^n, k ^^22,k^S2\,k ⁺ ^12, A ^12, k ⁺ ^ 22, A ⁵22, A:

― 2/?_{12) k} S_{Ut k} + 2? 2_2jHPu, k+, 2> k^S , k + ₂₂, _k P \₂, _k ,

In formula, A_W=¾_AIt is value of the verification sequence in moment k of information source 4, similarly

Aw=be interweave after sequence verification sequence at the moment^kValue；

It is each to receive signal, it is essentially all the sum of 4 parts, including information sequence, information sequence after intertexture, the verification sequence of information sequence after the dangerous sequence in the school of information sequence, intertexture, they after different fading channels respectively through synthesizing reception signal.

10. the method according to claim 5, it is characterised in that described to enter row decoding to the mixed signal of reception in receiving terminal and include：

The 2 dimension LOG-MAP decodings that the mixed signal of reception can be extended in receiving terminal, wherein： Receive signal form be：

i?, = h_u •S_i + h₂₁ -S 2 = 2h_u -S_n +2h₂₁ · S₂₁ +h_ll -S₁₂ + k₂₁ ■ S₂₂

R₂ = •S₁ +h₂₂ - S₂ = 2h_l2 -S_n +2h₂₂ -S₂₁ +h_n -S_n +h₂₂ · S ₂₁.,

It is in moment k reception signal

One ^¹ _ks _k + 2h ₂₁, _k p _u, _k -^-h_{l k}s_{l2 k} + h ₂, _k p ₂,_k ,

r2k ⁼ 2/¾_12l k^Sl\,k + 2h ₂₂,_k S ₂ , _k ch_{l2i k} S _k + Λ₂2, k^S 22,k

―
A + ₂₂,_kP ₂,_k,

In formula, Aw=,_tIt is value of the verification sequence in moment k of information source, similarly_Pxu=^^ is value of the verification sequence in moment k of the sequence after ^ interweaves；

It is each to receive signal, it is essentially all the sum of 4 parts, including information sequence, information sequence after intertexture, the verification sequence of information sequence after the verification sequence of information sequence, intertexture, they after different fading channels respectively through synthesizing reception signal.

11. the method according to claim 5, it is characterised in that described to enter row decoding to the mixed signal of reception in receiving terminal and include：

The mixed signal of reception can be filtered in receiving terminal, radio frequency and intermediate frequency demodulation, despreading, the APP of baseband signal after calculating processing;The decoding includes 4 loops, and iterative decoding is carried out on this 4 loops；Wherein：

Joint probability density need to meet following condition：

rl{cr_k ^l ,a_k÷l ^l ,a_k ² ,a_{k +} ² ,y_k) = p(y_k \ σ _k ^l ,u a _k ² ,u j)p{u_xk = u{i))p(u_2k = "(_/·))

P(y_k I ||²)；

Posterior probability need to meet following condition：

P{u_xk = u(i),u_2k = u(j) I 7)

Information bit need to meet following condition： P( _lk = u{i) I Y)

= ^A∑∑∑«Α(^σ-ι¹ '^σί²)χ| (^σλ·¹'^σ'¾ ₊ ^(Τλ-²'^σλ ₊ ι²' _ί) ?_{Α +} ι(σ_{ί +} ^σΑ ₊ ι²) information bit need to meet following condition after intertexture：

P(u_2k = u(j) I Y) σ ί ^σ k

In multipath conditions： p(y_k I || )

Side information need to meet following condition：

L^e{Y I "(!·)) = P{u_lk = u(i) I Y)~P(u_lk = "(/))

L^e(Y I u{j)) = P{u_2k = u{j) I Y)-P(u_2k = u(j))

In iterative decoding, every 3 side information and using as the prior information of another 1 tunnel information, i.e.,： p(u_lk = u, (0) = Jr «J I )+ ("(ζ·) I y₂)+L7 (u(j) I y₂)

Similarly, the side information sum on other three tunnels is equal in other three roads information bits per prior information all the way.

12. the method according to claim 5, it is characterised in that it is described receiving terminal to the mixed signal of reception ' enter row decoding and include：

The mixed signal of reception can be filtered in receiving terminal, radio frequency and intermediate frequency demodulation, despreading, the Α Ρ Ρ of baseband signal after calculating processing;The decoding includes 2 loops, and iterative decoding is carried out on this 2 loops；Wherein：

Joint probability density need to meet following condition：

r!(o-_k ^l
σ _k ² ,u j)p{u_xk = u(i))p(u_2k = "( )) p(y_kI )；

Posterior probability need to meet following condition：

P(u_lk = (i),u_2k = u(j) I 7)

Information bit need to meet following condition： P{ _xk = u{i) I Y)

Information bit need to meet following condition after intertexture：

P(u_2k = (j) I Y)

In multipath conditions： p{y_k I ,u_t,a_k ² ,_Uj) = (πΝ₀)~^{Μ ex}P(~ II )

Side information need to meet following condition：

L^e(Y I "(0) = P( _Uc = u(i) I Y)-P{u_xk = ιι(0)

L^e(Y I u(j)) = P(u_2k = u(j) I Y)-P(u_2k = u(j))

There are 2 side information outputs, the prior information that they are decoded respectively as next iteration in iterative decoding.

13. the method according to any one of claim 1 to 12, it is characterised in that described TURBO space-time codes can be recurrence space-time convolutional encoding.

14. a kind of full rate TURBO space-time code devices, including emitter and reception device, it is characterised in that：Emitter at least includes TURBO space-time coders and signal interleaving device, and TURBO space-time coders are encoded to transmission signal, and signal interleaving device is interleaved to transmission signal, the mixed signal of coding information after forming coding information and interweaving；

Reception device enters row decoding to the mixed signal of reception, needs to recover the side information of corresponding signal from the mixed signal of reception in decoding.

15. the device according to claim 14, it is characterised in that described emitter at least includes TURBO space-time coders and signal interleaving device refers to：TURBO space-time coders and signal interleaving device may make up series cascade TURBO space-time code devices.

16. the device according to claim 14, it is characterised in that described emitter at least includes TURBO space-time coders and signal interleaving device refers to：TURBO space-time coders and signal interleaving device may make up Parallel Concatenated TURBO space-time code devices.

17. the device according to claim 14, it is characterised in that described emitter includes：Series cascade TURBO space-time codes device that TURBO space-time coders and information source interleaver are constituted, Modulation and expanding unit, channel interleaver；Wherein：

Launch after the coding for the series cascade TURBO space-time code devices that transmission signal is constituted through TURBO space-time coders and information source interleaver, modulation and the modulation of expanding unit extension, the intertexture of channel interleaver from corresponding antenna.

18. the device according to claim 14, it is characterised in that described emitter includes：Parallel Concatenated TURBO space-time codes device, modulation and expanding unit, channel interleaver that TURBO space-time coders are constituted with information source interleaver；Wherein：

Launch after the coding for the Parallel Concatenated TURBO space-time code devices that transmission signal is constituted through TURBO space-time coders and information source interleaver, modulation and the modulation of expanding unit extension, the intertexture of channel interleaver from corresponding antenna.

19. the device according to any one of claim 14 to 18, it is characterised in that described reception device at least includes：The LOG- MAP code translators of extension, the LOG- MAP code translators of the extension can enter row decoding to the mixed signal of reception.

20. device according to claim 19, it is characterised in that the LOG- MAP code translators of described extension can tie up LOG- MAP code translators for the 2 of extension, including matched filter, APP calculators, deinterleaver, adder, interleaver；

In decoding：Iterative decoding is carried out on 4 loops.

21. device according to claim 19, it is characterised in that the LOG-MAP code translators of described extension can tie up LOG- MAP code translators for the 2 of extension, including matched filter, APP calculators, deinterleaver, adder, interleaver；

In decoding：Iterative decoding is carried out on 2 loops.