Turbo codes in MIMO system Mingxin Tan, the Department of Information Technology, Central Chinese Normal University, 430079

Abstract In this paper, Turbo code is considered as channel code, and multiple antennas at both transmitter and receiver are used to overcome the interference over Rayleigh fading channel. Performance analysis is given after the simulation results. Key words iteration, Turbo code, MIMO 1 Introduction Space-Time coding [1] improves the system capacity by employing multiple antennas to achieve signal diversity. But in order to fully exploit the capacity of MIMO channel, channel code should be used to obtain coding gain. As the best code known for SISO channel, Turbo code [2 4] is a good candidate for this 3 purpose. Turbo code combines with more and more technology with each passing day, references [567] disign turbo code in WLAN, and the analysis is based on Turbo theory [8]. In this paper, Turbo code is considered as Space-time channel code, and multiple antennas at both transmitter and receiver are used to overcome the interference over Rayleigh fading channel, and the paper is organised as follows. The next section introduces both Space-time code and Turbo codes, including the advantage of combining these two technologies together. The third section describes the system model and the block diagram of the system then some simulation results for various cases. The last section indicates possible topics in the future. 2 Turbo codes and MIMO Turbo and spacetime are two of the most explored concepts in modern-day communication theory and wireless research. Antenna arrays have been used to combat various types of channel impairments [9]. An antenna array with sufficient antenna spacing can

provide spatial diversity to mitigate multi-path fading. Transmitting and reception diversity can be employed to combat the effect of delay spread and co-channel interference. The technology of using GHz carriers in wireless networks reduces the size requirements of the antenna arrays. One implicit assumption underlying these traditional uses of antenna arrays is that the information content transmitted or received by each antenna element is identical. Turbo coding/processing is a way to approach the Shannon limit on channel capacity, while spacetime processing is a way to increase the possible capacity by exploiting the multi-path nature of fading wireless environments [10]. However, either of them is only useful to combat particular channel impairments and has some disadvantages they cannot overcome by themselves. Fortunately, it seems that many disadvantages of one technique can be solved by another one. One distinctive characteristic of the Turbo Codes is iterative decoding, in which the result of one decoder is passed to the other decoder for the next decoding iterations. The intuition of iteration is that a decoder gets part of the information of the decoding bits. Iteration is useful in sharing the information from one decoder to another. In the Turbo decoding algorithm, the first decoder does not have the output information of the second decoder in the first iteration. After the first iteration, the output of the second decoder will be fed back into the input of the first decoder. Thus the first decoder has more information in the second iteration and thereafter, correspondingly, the decoding performance is improved. The Turbo Code is the parallel concatenation of two or more RSC (recursive systematic codes). It is common practice to puncture the output of the encoder in order to increase the code rate to 1/2. For punctured

0-7803-9335-X/05/$20.00 2005 IEEE

281

turbo code with code rate 1/2, the first output stream is the input stream itself plus the necessary padding, namely, tail bits to the data block, while the second output stream is generated by multiplexing the M outputs of the RSC encoders. The Log-MAP algorithm finds the log likelihood ratio of the transmitted bit d k as showed in figure 1.

Turbo decoder, we have extrinsic information from the other decoder, which can be used to provide a priori information about P (d k = d ) . Finally we can obtain the equation below
n 1

{ln[ k (i )] + ln[ k (i, j1 )] + ln[ k ( j1 )]} {ln[ k (i )] + ln[ k (i, j0 )] + ln[ k ( j0 )]}

L(d k ) =

i =0 n 1 i =0

Figure 1

Turbo decoder Block Diagram

It can be shown that for a memory ( 2 states) systematic feedback convolutional code that

2 1 1 1 k (i ) k (i, j1 ) k ( j1 ) L(d k ) = log 2i =0 1 0 0 k (i ) k (i, j0 ) k ( j0 ) i =0

In our design, Turbo code is considered as an channel code, and multiple antennas at both transmitter and receiver are used to overcome the interference over the Rayleigh fading channel. There are two advantages to the use of multiple antennas to transmit/receive Turbo coded signals. First, because we scatter adjacent symbols in space (transmit on different antennas), the correlation between them will decrease. Second, multiple antennas increase signal diversity, which reduces the probability of a burst error, since when a signal on one antenna are faded deeply, signals on other antennas can compensate its effect on system performance. Figure 2 is the system block diagram.
s1

and can be determined iteratively by

Spatial Formatter
h11 H = h1 j h1n hi1 hij hin

s2
sn
hn1 hnj hnn

k +1 = k (i1 ) k (i1 , j ) + k (i0 ) k (i0 , j ) k 1 = k (i1 ) k (i1 , j ) + k (i0 ) k (i0 , j ) k (i ) is the probability of transferring to state i
from current state for trellis section k , k (i ) is the probability of transferring from state i to current state for trellis section k , k (i, jd ) = P[bk (i, jd ) | {i, rk }] is the a posteriori probability of the branch bk (i, j ) , given the received signal for trellis section k , rk . In a
Figure 2
Space-Time Decoder
Turbo decoder

hij

r1

Multi Path Fading

Space-Time Demodulator

r2 rn

nj

System Block Diagram

3 Simulation Results and Analyse In this section, we present some simulation results to demonstrate the performance of the proposed scheme and make some comparisons.

0-7803-9335-X/05/$20.00 2005 IEEE

282

We use (7, 5) 8 Turbo code, the code rate 1 / 2 . Only BPSK modulation is studied in this paper. We use the Log-MAP algorithm to perform Turbo decoding with 8 iterations. In Figure 3, the performance curve of BER SNR is plotted to show the increase of diversity gain with the number of antennas when Turbo coding is used. The simulations are running under the assumption that the channel is block (frame) Rayleigh fading. In Figure 3, we simulate 4 kinds of antenna distribution from 11 to 2 2 , 4 4 ,till 16 16 . By continuing to double the number of antenna we get more diversity gain and coding gain as well. Here much higher gains are obtained by increasing the number of antennas. For block (frame) fading, all the signals transmitted from one antenna have the same fading, and this will limit the potential advantage of channel coding. More antennas can efficiently scatter adjacent symbols and make their fading uncorrelated, thus reducing the possibility of frame burst error.

antennas, such as broadband services to lap-top computers. References [1] Branka Vucetic, Jinhong Yuan, Space-Time Coding, Wiley Editorial Office 2003 [2] C. Berrou, A. Glavieux and P. Thitimajshima. Near Shannon limit error-correcting codingand decoding: Turbo-codes (1). ICC'93. 1993: l064-1074P [3] C. Berrou and A. Giavieux. Near optimum error correcting coding and decoding: Turbo-codes. IEEE Trans. Commun., vol. 44, no. 10. Oct., 1996:1261-1271P [4] C. Berrou and A.Giavieux. Reflections on the prize paper: Near optimum error correcting coding and decoding: turbo-codes. IEEE Inform. Theory Society Newsletter, vol.48, no.2. June,1998: 23-31P [5] Bord Bangerter, Eric Jacobsen, Minnie Ho, High-Throughput Wireless LAN Air Interface, Intel Technology Journal, Vol. 07, Issue 3, August, 2003, page 47-57 [6] Robert W. Heath, Erik G. Larsson, Ross Murch, Arye Nehorai, Murat Uysal, Wireless Communications and Mobile Computing, John Wiley & Sons, Ltd., Nov, 2004 [7] Nenad, Veselinovic, Iterative Receivers for Interference cancellation and Suppression in Wireless Communications, Oulu University Press, 2004 [8] Frank Schreeckenbach and Gerhard Bauch, Irregular Signal Constellations, Mappings and Precoder, International Symposium on Information Theory and its Applications, ISITA 2004 [9] Da-shan Shiu, Wireless Communication Using Dual Antenna Arrays, Kluwer Academic Publishers, 2000 [10] Sirikiat Lek Ariyavisitakul, Turbo Space Time Processing to Improve Wireless Channel Capacity, IEEE Transactions on communications, vol. 48, no. 8, August2000

Figure 3 Performance of BER versus. SNR

4 Conclusion From above simulation results and analysis we know that turbo code in MIMO system significantly improve the system performance over the block (frame) Rayleigh fading channel. As the number of antennas increases, both the throughput and BER performance are improved, and in mobile systems, the most promising applications equipped with this technology ultimately will involve terminals which can accommodate multiple

0-7803-9335-X/05/$20.00 2005 IEEE

283