Académique Documents
Professionnel Documents
Culture Documents
Abstract—In orthogonal frequency division multiplexing impulse response (FIR) channel order is comparable with the
(OFDM) systems, for every block of data samples, an overhead number of subcarriers used in the OFDM system.
of samples of cyclic prefix (CP) or zero padding (ZP) is added In this paper, we propose a scheme called interleaved or-
to combat frequency selective channels. The code rate, which is
defined as the ratio ( + ), is a measure of the efficiency thogonal frequency division multiplexing (IOFDM), which has
of transmitting user information. In this paper, a new system a higher code rate than the conventional OFDM. IOFDM en-
is proposed to increase the code rate without increasing the hances the code rate without bandwidth expansion and without
number of subcarriers and without increasing the bandwidth. The increasing the number of subcarriers but with a moderate in-
proposed system considers appending the zeros (ZP) once for crease in computational complexity and delay.
every blocks of data samples, which would increase the code
rate to ( + ). It is assumed that the channel is not In the proposed IOFDM system, it is assumed that the
varying over the transmission of consecutive data blocks. In channel is not varying over the transmission of consecutive
order to recover the data blocks in a computationally efficient data blocks. It is proposed that ZP is used once for every
manner, an interleaving scheme is proposed, and the proposed transmission of consecutive data blocks, which would
system is called the interleaved OFDM (IOFDM) system. Various increase the code rate. However, there is an introduction of
issues such as computational complexity, peak-to-average power
ratio (PAPR), and the effect of synchronization errors on the IBI. In order to recover the data symbols in a computationally
performance of the IOFDM system are also presented. Based on efficient manner, an interleaving scheme is proposed. In [6],
a numerical simulation study, the average bit-error-rate (BER) a scheme called vector OFDM (VOFDM) was presented to
performance of the IOFDM system is shown to be very close to that increase the code rate. Even though the VOFDM transmitter
of the OFDM system for a moderate increase in computational and the IOFDM transmitter look similar, the receiver sections
complexity and delay.
are entirely different. The IOFDM system is computationally
Index Terms—Code rate, cyclic prefix, interblock interference, more efficient than the VOFDM system, as shown later.
interleaving, OFDM, zero padding. Peak-to-average power ratio (PAPR) of the IOFDM system and
the effect of synchronization errors on the performance of the
I. INTRODUCTION IOFDM system are also presented.
The paper is organized as follows. In Section II, the conven-
shift keying (QPSK), 16-QAM, etc. The sequence is parsed Define the -transforms:1 ,
into blocks of length , and . Then,
. The symbol block is then mapped to a precoded block the -transform of is given by
of length through
a precoder such that
(1)
(10)
.. .. .. ..
. . . .
One way to increase the code rate is by increasing the number of (14)
subcarriers in the OFDM system. Let us consider the number of
It is assumed that the channel is constant over the trans-
subcarriers in the OFDM system to be , where . The
mission of .
code rate would then be equal to , which
At the receiver, the corresponding received block
is greater than . Fig. 2 shows the improvement in the code
of length in the absence
rate, which is denoted by , as a function of , for
of noise is given by
different values of and . It is to be noted that the code rate
improvement flattens out after a moderate value of . The code (15)
rate improvement for moderate values of is between 16 and
32%, which is significant. Since the OFDM systems are very where is the channel convolution matrix, where the
sensitive to frequency offsets, the larger the number of subcar- th element is . The -transform of is given
riers implies a decrease in the frequency spacing, and therefore, by
frequency accuracy becomes more and more critical. In addi-
tion, the PAPR increases with the number of subcarriers.
In VOFDM,2 vectors of length are used as
the cyclic prefix once for every transmission of consecu-
tive symbol vectors of length . The code rate in the VOFDM
(16)
system, which is denoted by , is given by
Evaluating (16) at , we get
(13)
Therefore, we have equations with unknowns. We need Solving the set of equations given by (22) is not an expensive
additional equations to retrieve the information symbols process because number of 2 2 Vandermonde matrix in-
. Considering additional versions are needed to retrieve
distinct points on the complex -plane, we get [8]. We can further reduce the computational complexity of
the receiver by preprocessing the symbol block at
the transmitter. The preprocessing results in the precoded block
being
(23)
(18)
where diag is the preprocessing matrix.
In order to decode , we define Because of preprocessing, (22) becomes
and write the set of equations given by (17) and (18) in a ma- (24)
trix/vector form as follows:
Solving the set of equations given by (24) needs two-point
(19)
inverse discrete Fourier transform (IDFT) operations. Next, we
where diag , generalize the above idea by considering consecutive symbol
and blocks.
A. IOFDM Transceiver
.. .. .. .. .. We consider consecutive symbol blocks
. . . . . and then preprocess the symbol block
as follows:
.. .. .. .. ..
. . . . .
(25)
Solving the set of equations given by (19) is an expensive where diag is the preprocessing matrix.
process because we need to invert the matrix . In Now, the preprocessed block is the effective symbol block.
addition, the choice of and, therefore, the inversion It is linearly mapped to a precoded block through the pre-
of is not straightforward to establish. coder such that
To address this issue, we propose to construct the transmitted
block of length by interleaving the elements (26)
of and as follows:
A transmitted block of length is formed
by interleaving the elements of and
(20) padding zeros as follows:
.. .. .. .. ..
. . . . .
(29) (34)
(35)
where diag ,
, and
. After frequency
domain equalization and -point IDFT, we obtain the decision
vector
of length as follows:
(30)
carrier locations, but these methods may not give the com-
putational advantage. However, the benefit of code rate
improvement and PAPR improvement (discussed in a later
section) still exists with the use of IOFDM.
C. Computational Complexity
Fig. 6. Deinterleaving process at the IOFDM receiver for P = 3. Even though IOFDM improves the code rate, there is a mod-
erate increase in computational complexity. In the conventional
, for proper data recovery. In IOFDM, the condition on OFDM system, for a carrier system, the transmitter has to
the channel nulls remains similar, but the precoder is operate a general precoder matrix of size , which
designed using only distinct points . could result in a computation cost of complex multi-
• Equation (36) reveals that IDFT operations are plications (CMs). In case of the IOFDM system, it would re-
required to retrieve . This quire CMs for precoder operation and an additional
is less expensive than the matrix inversion. CMs for diagonal transformation, as in (25), resulting in a total
• There is an increase in the processing delay as data number of CMs to be , which would be less than the
blocks have to be received. previous case. For the case when is the IDFT matrix (as in the
example above), the reduction in CMs is analogous to to savings
B. Example of the IOFDM System obtained due to splitting the -point IDFT into smaller but-
Let be the distinct points on terflies.
the complex -plane. For this choice of , the points The number of CMs required to retrieve consecutive
, the matrices , , , , and the constant are symbols at the receiver is
as shown in the equation at the bottom of the page, where is taken as the complexity measure. Let and be integer powers
the overlap-add operation matrix, which is defined as of 2, i.e., and . The number of CMs required
follows: to find the -point DFT is .
For the choice of , we compare
the complexity of IOFDM with the complexities of OFDM and
where is the th column of . For this choice of , VOFDM. In the conventional OFDM system, the number of
we can exploit the computational advantage of fast Fourier CMs required to evaluate is .
transform (FFT) to implement the IOFDM system. The number of CMs required to evaluate and to get
Remarks: from as in (11) is . Therefore, the com-
plexity of the conventional OFDM system, which is denoted by
• The form of receiver considered is not robust to channel
, is given by
nulls at subcarrier locations . Other solutions
(like the pseudoinverse solution [4] and [5]) can be used
for ZP-IOFDM, which are robust to channel nulls at sub- (37)
diag
diag
PRASAD AND HARI: IOFDM SYSTEM 1717
(38) (43)
To obtain the computational complexity of the VOFDM Because of the superposition of many statistically independent
system, let and be the transmitted block and the subcarrier signals, the OFDM signal exhibits high instantaneous
received block, respectively. The -transform of the received peak signal level with respect to average signal level. This high
block in the absence of noise is given by peak-to-average nature of the OFDM signal results in harmonic
distortion, unless the transmitter’s power amplifier exhibits lin-
(39) earity throughout the dynamic range of the signal. PAPR is used
as a measure to compare the instantaneous peak signal level
Rewriting (39) in terms of polyphase components [9], we get with the average signal level. PAPR of the conventional OFDM
system, which is denoted by , is defined as
(40)
(44)
(45)
where
where is the symbol having largest power in the consid-
ered modulation alphabet.
.. .. .. .. In an IOFDM system that is implemented by interleaving
. . . . consecutive data blocks of length , the transmitted signal
is given by
and .
The number of CMs required to evaluate both
and is .
In order to get from as in (41), we need CMs. and (46)
Therefore, the complexity of the VOFDM system, which is The PAPR of the IOFDM system, which is denoted by , is
denoted by , is given by defined as
(42)
else.
In the presence of a carrier frequency offset , the received The sequence denotes the inter carrier interference (ICI)
signal in the absence of noise is given by and has an average power of
(50)
(56)
where denotes the FIR channel
between the transmitter and the receiver. The received signal In the proposed IOFDM system, the continuous-time base-
is sampled at the time instances band representation of the transmitted signal over an
, where denotes the normalized timing offset. IOFDM symbol period is given by
The discrete-time baseband representation of the received signal
is
(51)
(57)
where denotes the normalized carrier frequency In the presence of a carrier frequency offset and a normal-
offset, and ized timing offset , the received signal in the absence noise
is given by
(58)
(52)
and
(59)
PRASAD AND HARI: IOFDM SYSTEM 1719
(60)
where we have (61), shown at the bottom of the page. The se-
quence denotes ICI and has an average power of
(62)
(61)
1720 IEEE TRANSACTIONS ON SIGNAL PROCESSING, VOL. 52, NO. 6, JUNE 2004
Fig. 9. Performance comparison of IOFDM systems in channel model B. Fig. 11. Effect of normalized frequency offset of 1 = 0 05 : on the
performance of various systems.
V. CONCLUSION
A new OFDM system based on interleaving the elements of
consecutive precoded blocks has been presented. The pro-
posed IOFDM system promises higher code rate compared with
Fig. 10. Performance comparison of IOFDM systems in channel model E.
the conventional OFDM system without bandwidth expansion,
without increasing number of subcarriers, and with moderate
i.e., s and . Jakes’ Doppler spectrum corre- increase in computational complexity. The IOFDM system im-
sponding to a terminal speed of 3 m/s is assumed for all taps in plemented by interleaving data blocks of length has less
the channel. To gain insights into the average BER performance, worst-case PAPR compared with the OFDM system consisting
we have taken 8000 information symbol blocks, of length subcarriers. Both systems are equally affected by synchro-
, per trial and averaged over 25 trials. In effect, for each nization errors. Simulation results verify that the performance
value considered, the BER values are obtained based on of the IOFDM system in terms of BER is very close to that of
25.6 bits. Channel model B and channel model E are con- the conventional OFDM system.
sidered in our simulations.
Example 3: We study the performance of the IOFDM system ACKNOWLEDGMENT
in channel model B. Fig. 9 shows the performance comparison
of IOFDM systems in channel model B. The authors would like to thank the reviewers for their valu-
Example 4: We consider the case of using IOFDM for chan- able comments, which have helped the technical content of the
nels that are longer than the ZP used in an OFDM system. In paper significantly.
channel model E, the minimum length of the ZP needed to avoid
IBI is . The HIPERLAN/2 standard uses in gen- REFERENCES
eral. Because of the reduced ZP, the performance of the con- [1] J. A. C. Bingham, “Multicarrier modulation for data transmission: An
ventional OFDM system is poor. To avoid this degradation, we idea whose time has come,” IEEE Commun. Mag., pp. 5–14, May 1990.
[2] L. J. Cimini Jr., “Analysis and simulation of a digital mobile channel
use the complete ZP, i.e., , and interleave more than two using orthogonal frequency division multiplexing,” IEEE Trans.
precoded blocks, i.e., . Fig. 10 shows the performance Commun., vol. COM-33, pp. 665–675, July 1985.
PRASAD AND HARI: IOFDM SYSTEM 1721
[3] R. W. Heath Jr and G. B. Giannakis, “Exploiting input cyclostationarity K. V. S. Hari (SM’97) received the B.E. degree
for blind channel identification in OFDM systems,” IEEE Trans. Signal from Osmania University, Hyderabad, India, in
Processing, vol. 47, pp. 848–856, Mar. 1999. 1983, the M.Tech. degree from the Indian Institute
[4] B. Muquet, M. de Courville, P. Duhamel, and G. B. Giannakis, “OFDM of Technology, New Delhi, India (IIT Delhi), in
with trailing zeros versus OFDM with cyclic prefix: Links, comparisons 1985, and the Ph.D. degree from the University of
and application to the HIPERLAN/2 system,” in Proc. Int. Contr. Conf., California San Diego, La Jolla, in 1990.
New Orleans, LA, June 2000, pp. 1049–1053. He has been an Associate Professor with the De-
[5] S. Zhou and G. B. Giannakis, “Finite-alphabet based channel estimation partment of Electrical Communication Engineering,
for OFDM and related multicarrier systems,” IEEE Trans. Commun., Indian Institute of Science (IISc), Bangalore, India,
vol. 49, pp. 1402–1414, Aug. 2001. since February 1998. His research interests are
[6] X.-G. Xia, “Precoded and vector OFDM robust to channel spectral nulls in statistical signal processing. He has worked on
and with reduced cyclic prefix length in single transmit antenna sys- space-time signal processing algorithms for direction-of-arrival estimation,
tems,” IEEE Trans. Commun., vol. 49, pp. 1363–1374, Aug. 2001. acoustic signal separation using microphone arrays, and MIMO wireless
[7] Z. Liu, G. B. Giannakis, S. Barbarossa, and A. Scaglione, “Transmit- communication systems. He has also worked on MIMO wireless channel mea-
antenna space-time block coding for generalized OFDM in the presence surements and modeling and is the co-author of the IEEE 802.16 standard on
of unknown multipath,” IEEE J. Selected Areas Commun., vol. 19, pp. wireless channel models for fixed broadband wireless communication systems.
1352–1364, July 2001. He was a visiting faculty at Helsinki University of Technology, Espoo, Finland,
[8] V. G. S. Prasad and K. V. S. Hari, “Interleaved orthogonal frequency di- from May to July 2002; Stanford University, Stanford, CA, from September
vision multiplexing system,” in Proc. IEEE ICASSP, Orlando, FL, May 1999 to December 2000; and the Royal Institute of Technology, Stockholm,
2002, pp. 2745–2748. Sweden, from July to September 1995. He was an Assistant Professor with
[9] P. P. Vaidyanathan, Multirate Systems and Filter Banks. Englewood the Department of Electrical and Computer Engineering, IISc, from February
Cliffs, NJ: Prentice-Hall, 1993. 1992 to January 1998 and a scientist at Osmania University, from December
[10] S. A. Fechtel, “A novel approach to modeling and efficient simulation 1990 to January 1991. He was also with the Defence Electronics Research Lab,
of frequency selective fading radio channels,” IEEE J. Select. Areas Hyderabad, from December 1985 to July 1987.
Commun., vol. 11, pp. 422–431, Apr. 1993.