5 Ofdm: 5.1 Overview About An OFDM System
5 Ofdm: 5.1 Overview About An OFDM System
In the last chapter we introduced the multipath propagation and its inuence on the transmission. In sec. 4.4 OFDM is mentioned as one possible solution for mitigating the inuence of delay spread and to increase the robustness of the transmission. Transmitting digital signals with high data rates using single carrier results in a lot of diculties because of the multipath propagation. Due to the short symbol time and the long channel response time for it, this results in very high requirements for the equaliser. Dividing the data rate in N subcarriers results in an N times longer symbol duration. In spite of this improvement there are still some inter-symbol-interferences due to the different runtimes of the signals in the multipath environment. To reduce the inter-symbolinterference a guard interval is introduced. This guard interval provides some time for the symbols to raise and decay. The following paragraph explains some special features of OFDM compared to other multi carrier systems. One of the most advantages is the abdication of complex lter banks due to the use of digital signal processing. A characteristic of an OFDM system is the equidistant subchannel order. The distance between dierent subchannels is chosen in a way that they do not disturb each other. To obtain this, the carriers of two adjacent subchannels are orthogonal. This results in the distance of two subchannels f = 1 . Ts (5.1)
Rectangular pulses are used for calculating the magnitude spectrum. In g. 5.1 the known (x ) form of the function si(x) = sin is shown. x Fig. 5.2 shows the spectrum of an OFDM signal as a composition of frequency shifted subcarriers. If the frequency shift is exactly an integer multiple of 1/T (refering to 5.1), the interference of adjacent cariers is equal to zero. There are no inter-carrier-interferences in spite of an overlapping spectrum.
57
5 OFDM
4pi
3pi
2pi
1pi
pi
2pi
3pi
4pi
5pi
4pi
3pi
2pi
1pi
pi
2pi
3pi
4pi
5pi
58
5 OFDM
Figure 5.3: OFDM-System overview is a serial to parallel converter (S/P). This converter translates our encoded serial data stream into N parallel data streams. These N data stream are in the next step mapped to the dierent subchannels. The mapping process itself is described in sec. 2.2. After the mapping we have with the IFFT the second new element. The IFFT is a method in digital signal processing and converts our subchannel signals from the frequency domain into a time domain signal. After the conversion into time domain the guard interval is inserted to eliminate inter-symbol-interference and the signal is send over the channel. At the receiver the rst step is to have syncronisation of the OFDM symbols using cyclic extension. At this point the additional guard interval is removed. In a second step the FFT of the signal is calculated. A further explanation about the FFT can be found in sec. 2.7.2 and in sec. 5.3. With the FFT the signal is converted back from time domain into frequency domain. As a result we obtain the N dierent subcarriers. In the parallel to serial converter the dierent subchannels are converted back to one single data stream. The rest of the OFDM system is the same as we had already introduced and discussed in sec. 3 and 2.
5.2 Interleaving
From the basic principles of OFDM, we know that in the frequency and time selective transmission environment, the channel does not change signicantly in one OFDM symbol or one OFDM sub-carrier, however it changes from sub-carrier to subcarrier in the frequency domain and symbol to symbol in the time domain. When the channel has a deep fading, some sub-carriers and some OFDM symbols will suer from strong noise interference, which causes a degrading SNR at these positions resulting in excessive burst errors at the receiver. To overcome this problem, coding and interleaving are employed in OFDM system. As we see in the diagram, the block of coding could be done by implementing the convolutional encoder that we discussed in chapter 3. In the rest of this section, we would focus on the block of interleaving. As mentioned above, interleaving is an ecient way to combat burst error, which is achieved by rearrange the order of the transmit bits. For example, g. 5.4 shows how a certain type of interleaver works. This interleaver simply writes the coded bits into the matrix by rows and then reads them out afterwards by columns. The deinterleaver at the receiver side performs the reverse procedure, i.e., the bits are written by columns and read out by rows. The bits in the gure are written row-by-row into a 6 8 matrix and reading out column-by-column. We dene the number of rows B = 6 as the interleaving depth,
59
5 OFDM
( b0 , b1 , b2 , , b7 )
Write bits
Figure 5.4: Block Interleaver 8 6 and the number of columns N = 8 as the interleaving length. After this kind of interleaving, the fading processes that aect N successive symbols will be uncorrelated. Therefore, it makes the burst errors appear as random errors, which can be corrected by coding. Since the interleaver requires memory and deinterleaver causes extra delay (because deinterleaving takes place only after all the interleaved data is received), the dimension of the interleaver is a compromise between the delay and the performance of the system. Frequency interleaving is usually employed in IEEE802.11a standard, which is to interleave the information across the sub-carriers prior to transmissions. By implementing frequency interleaving in OFDM systems, the local deep fading is averaged over the whole bandwidth of the system. It is implemented for all the data symbols in a single OFDM symbol. The interleaving pattern shows us how to rearrange the order of the data symbols, which should be chosen according to the channel and the coding technique used. The following matlab code describe the interleaving pattern used in HIPERLAN type 2: cBitsPerBlock = nrDataCarriers*log2(length(map)); bitBlock = 0 : cBitsPerBlock-1; perm1 = (cBitsPerBlock/16)*rem(bitBlock, 16)+floor(bitBlock/16)+1; s2 = max([log2(length(map))/2 1]); perm2 = s2*floor((1/s2)*bitBlock)+rem(bitBlock+cBitsPerBlock-... floor((16/cBitsPerBlock)*bitBlock), s2)+1; perm = perm2(perm1); As shown above, all coded data bits shall be interleaved by a block interleaver with a block size corresponding to the number of bits in a single OFDM symbol, cBitsPerBlock. bitBlock represents the index of the coded bit. The interleaver is dened by a two step permutation. The rst ensures that adjacent coded bits are mapped onto nonadjacent sub-carriers, which is described in the third line. The second permutation ensures that adjacent coded bits are mapped alternately onto less and more signicant bits of the constellation, which is implemented in the 5th and 6th line.
60
5 OFDM
Task: With the dened interleaving pattern, the frequency interleaver can be implemented as following: if (~isempty(perm)) for ii = 0 : cBitsPerBlock : length(enc)-cBitsPerBlock enc(1, perm+ii) = enc(1, ii+1:ii+cBitsPerBlock); end end
where enc is the vector of encoded bits. The for-loop rearranges the coded bits according to the interleaving pattern described in perm. Try to understand how the code of interleaver works above, and explain it. Task: Based on the understanding of the interleaver, try to write a function of deinterleaver Y = deinterleaver(X,cBitsPerBlock,perm) \nonumber where X is the vector of input bits to the deinterleaver, cBitsPerBlock is the number of bits in a single OFDM symbol and perm represents the interleaving pattern discussed before.
61
5 OFDM
.5pi
.5pi
pi
1.5pi
2pi
Figure 5.5: Cyclic extension (red) is copied before the OFDM symbol in time domain than the guard interval can be avoided by this method. Since the output of the IFFT (the OFDM symbol) is a periodic function, the guard interval is a copy of the last part of the OFDM symbol and pasted in front of this symbol. Fig. 5.5 shows the input of the cyclic extension.
62
5 OFDM interval, which results in the OFDM symbol length. Calculate the total number of OFDM symbols in the input stream. Rearrange the input vector in to a matrix with as many columns as number of OFDM symbols and with a number of rows corresponding to symleng. Crop the submatrix not belonging to the guard intervall and apply a FFT. After this, shift the second half of rows in front of the rst half and delete the frequency samples which do not belong to the used carriers.
63
5 OFDM
64
Bibliography
[1] Proakis, J. G.: 0071181830 Digital Communications. 4th ed. McGraw-Hill, 2001. ISBN
[2] The MathWorks: Communications Toolbox 3 Users Guide. http://www. mathworks.com/access/helpdesk/help/pdf_doc/comm/comm.pdf, March 2007 [3] ETSI EN 300 744 V1.5.1 (Hrsg.): Digital Video Broadcasting (DVB); Framing structure, channel coding and modulation for digital terrestrial television. ETSI EN 300 744 V1.5.1, November 2004 [4] Kattenbach, Ralph: Charakterisierung zeitvarianter Indoor-Funkkan ale anhand ihrer System- und Korrelationsfunktionen, Universit at Kassel, Diss., 1997 [5] Bello, P.: Characterization of Randomly Time-Variant Linear Channels. In: Communications, IEEE Transactions on [legacy, pre - 1988] 11 (1963), Nr. 4, S. 360393
65