IEEE TRANSACTIONS ON BROADCASTING, VOL. 54, NO.

4, DECEMBER 2008

821

A Low Complexity Selected Mapping Scheme by Use of Time Domain Sequence

Superposition Technique for PAPR Reduction in OFDM System
L. Yang, K. K. Soo, Y. M. Siu, and S. Q. Li

AbstractBy using the time domain sequence superposition

(TDSS) technique, in this paper, we propose a low complexity selected mapping (LC-SLM) scheme for the peak-to-average power
ratio (PAPR) reduction of the orthogonal frequency division
multiplexing (OFDM) system. Unlike the conventional selected
mapping (SLM) scheme which needs several inverse fast Fourier
transform (IFFT) operations for an OFDM signal, the proposed
scheme requires to implement two IFFT operations only. Thus, it
can remarkably reduce the computational complexity. Simulation
results show that the proposed scheme can achieve similar PAPR
performance as the conventional SLM scheme.
Index TermsComputational complexity, orthogonal frequency
division multiplexing (OFDM), peak-to-average power ratio
(PAPR), selected mapping (SLM).

In this paper, we propose a low complexity SLM (LC-SLM)

scheme by using the time domain sequence superposition
(TDSS) technique which is operated after the IFFT process.
In this scheme, two-phase sequences are generated and multiplied with the input symbol sequence before transforming
the alternative sequences to time domain. Then, we fix one
time domain sequence and cyclically shift another one. The
PAPR can be reduced effectively by linearly combining the
fixed time domain sequence with the cyclically shifted time
domain sequence. The proposed LC-SLM scheme requires
only two IFFT operations for an OFDM signal and hence it can
achieve a lower computational complexity compared with the
conventional SLM scheme.

I. INTRODUCTION

II. THE CONVENTIONAL SLM SCHEME

RTHOGONAL Frequency Division Multiplexing

(OFDM) is an attractive technique for high-speed data
transmission of the future wireless communications systems. However, OFDM has some drawbacks in transmission
system. The main disadvantage of the OFDM system is the
potentially high peak to-average-power ratio (PAPR) at the
transmitter, which may result in significant inter-modulation
and out-of-band radiation due to the nonlinearity of power
amplifier. Thus, it is highly desirable to reduce the PAPR of an
OFDM signal.
Over the last decade, various schemes have been developed
to reduce the PAPR of an OFDM signal. The well-known PAPR
reduction techniques include clipping [1], block coding [2], active constellation extension (ACE) [3], nonlinear companding
transform [4], partial transmit sequence (PTS) [5][7] and selective mapping (SLM) [7][12]. Among them, SLM scheme
is relatively attractive since it can obtain better PAPR property
by modifying the OFDM signal without distortion. However,
the conventional SLM scheme suffers from high computational
complexity due to several inverse fast Fourier transform (IFFT)
operations.

Manuscript received January 09, 2008; revised September 09, 2008. Current
version published December 04, 2008. This work was supported in part by a
grant from the Research Grants Council of the Hong Kong Special Administrative Region, China (Project No. 9040622), Young Scholar Foundation of
Nanjing University of Science and Technology, the Excellent Young Teachers
Program of MOE, PRC, Natural Science Foundation of China (Contract No.
60271005 and 60171017), National Basic Research Program of China under
Grant 2007CB310604, and National Fundamental Research Program under
Grant A1420080150.
L. Yang and Q. Li are with the National Key Laboratory of Communication,
University of Electronic Science and Technology of China, Sichuan 610054,
China (e-mail: eelyang@uestc.edu.cn).
K. K. Soo and Y. M. Siu are with the Department of Electronic Engineering,
City University of Hong Kong, Tat Chee Avenue, Kowloon, Hong Kong SAR.
Digital Object Identifier 10.1109/TBC.2008.2007451

in one symbol period

The continuous time OFDM signal

can be represented as:

(1)
is the data symbol of the
subcarrier,
is the
where
is the frequency difference between
number of subcarriers,
is the OFDM symbol duration.
subcarriers and
is a bandlimited signal with the Nyquist frequency
. The PAPR of the OFDM signal
is defined
as:
(2)
where
is the expected value.
is usually generThe transmitted discrete time signal
. If sampling
ated by sampling the continuous time signal
might have an overly
at critical sampling or Nyquist rate,
optimistic PAPR value because it might loss some information
. Hence,
is usually oversampled by a
at the peak of
.
factor to have a better estimation of the PAPR value of
The oversampling by the factor can be realized by inserting
zeros in the middle of the -point frequency-domain signal
and passing the new
-point data sequence
-point IFFT unit, which can be expressed as:
through the
(3)
where

0018-9316/$25.00 2008 IEEE

It

was

,
shown

822

IEEE TRANSACTIONS ON BROADCASTING, VOL. 54, NO. 4, DECEMBER 2008

in reference [13] that

is sufficient to capture the peak
.
information of
statistically independent sequences
In the SLM scheme,
are first generated from the sequence and
individual phase sequences
.
Fig. 1. Block diagram of the LC-SLM scheme.

(4)
where denotes the component-wise multiplication of the two
vectors.
Then, a set of candidates
can be generated by performing the
-point IFFTs of the seas:
quences
(5)
The one with the lowest PAPR among all the candidates
is selected for transmission. Obviously
increases, the PAPR of the OFDM symbol is reduced
as
at a greater extent. However for large , the computational
-point
complexity becomes very high mainly due to the
IFFTs.

In the proposed LC-SLM scheme, the candidate can be generated by the linear combination of
with
:
(9)
is named the linear factor in our scheme.
where
Unlike the conventional SLM scheme which requires a
in
bank of IFFTs to obtain the candidates, the candidate
the LC-SLM scheme can be generated directly by using equ.
(9) without any IFFT operation given that the time domain
and
are known. All the candidates can
sequences
. The
be obtained by adjusting the parameters and
PAPR performance can be improved by searching over the new
candidates . The block diagram of the LC-SLM scheme is
shown in Fig. 1.
Re-using the linear property of Fourier transform, equ. (9) can
be expressed as:

III. THE LC-SLM SCHEME AND PAPR REDUCTION

In this section, a LC-SLM scheme using the TDSS technique
is proposed and the analysis shows that it has lower computational complexity than the conventional SLM scheme.
A. LC-SLM Scheme With TDSS Technique
Let
(
or 2) be the time domain sequence, which is
generated by the conventional SLM scheme as in equ. (5). In
and
the LC-SLM scheme, we fix one time domain sequence
cyclically shift another sequence . A new sequence
can be generated by cyclically shifting :
(6)
where the shifting number is

and
,
.
The minimum cyclically shifting number is denoted as
and
is the number of new sequence.
in
Using the linear property of Fourier transform,
equ. (6) can be expressed as
(7)

where

(10)
where the sequence
can be visualized as the
alternative phase sequence in the proposed scheme. In order to
assure correct recovery of from
in the receiver, it must
fulfill the following condition accordingly:
(11)
for
and
because the transmitted signal

. It is
,
is non-zeros in the position

and
given an
oversampling factor .
for
In our scheme, we assume that
and
. Generally, equ. (11)
and is an odd number
is satisfied given that
such as
,
etc.
, additional condition
In particular when
is required in order to satisfy equ. (11). Thus, at most
numbers of new candidates
can be obtained.
B. Computational Complexity

(8)

-point IFFT reIt is well known from the literature that a

quires
numbers of complex multiplication and
numbers of complex addition. The conventional

YANG et al.: LOW COMPLEXITY SELECTED MAPPING SCHEME BY USE OF TDSS TECHNIQUE

823

TABLE I
COMPUTATIONAL COMPLEXITY OF THE LC-SLM SCHEME AND THE
CONVENTIONAL SLM SCHEME WHEN

N = 256

SLM scheme with

individual phase sequences requires
IFFT operations. Therefore, the total numbers of complex
multiplication and complex addition for the conventional SLM
and
, respecscheme are
tively. While for the LC-SLM scheme, because only two IFFT
operations are required, the numbers of complex multiplicaand
tion and complex addition are reduced to
, respectively. The LC-SLM scheme requires
new candidates
because
and
can be
generating
regarded as candidates. Hence, LC-SLM scheme requires extra
numbers of complex addition.
The computational complexity reduction ratio (CCRR) of the
LC-SLM scheme over the conventional SLM scheme is defined
as

(12)
The CCRR of the LC-SLM scheme over the conventional
SLM scheme for typical values of and are given in Table I.
Here, we assume that the two schemes generate the same numbers of candidates. It is shown in Table I that the computational
complexity of the LC-SLM scheme is reduced rapidly with the
increase of .
In SLM scheme, the receiver requires side information in
order to know which candidate with the lowest PAPR is selected for transmission. Clearly, our scheme requires the same
side information as the traditional SLM scheme. Once the receiver knows the candidate with the lowest PAPR, we can obtain
easily given the candidate number
(usually
the power of 2). Then, the original can be recovered according
to receiver signal
and equ (10).
IV. SIMULATION RESULTS
To obtain the complementary cumulative density function
,
independent
CCDF
OFDM symbols with the carriers
are randomly
generated. The QPSK data symbols with the energy normalized to unity are used. The oversampling factor
. The

Fig. 2. PAPR performance of the LC-SLM scheme and the conventional SLM
, 8, 16, 32.
scheme with

M=4

conventional SLM scheme is used for the comparison of the

PAPR performance.
The CCDF of the original OFDM symbol, the LC-SLM
, 8,
scheme and the conventional SLM scheme with
16, 32 candidates are shown in Fig. 2. We can simply choose
, 64, 32, 16 in the LC-SLM scheme to generate
, 8, 16, 32 candidates, respectively. Obviously, both
the LC-SLM scheme and the conventional SLM scheme can
improve the PAPR over the original OFDM symbol.
The PAPR of the original OFDM symbol is about 11.4dB at
. When
, the PAPR of the LC-SLM
scheme and the conventional SLM scheme are improved to 9.30
and 9.15dB, respectively. With the increase of the candidates
, 16, 32, both the LC-SLM scheme and the conventional SLM scheme can continue to improve the PAPR. The
are reduced to 8.72, 8.27, 7.95 for the
PAPR at
LC-SLM scheme and to 8.48, 8.05, 7.75 for the conventional
SLM scheme, respectively. The result in Fig. 2 shows that the
, 8,
PAPR performance of the LC-SLM scheme when
16, 32 candidates is only slightly worse than the conventional
SLM scheme by about 0.2dB. However, the computational complexity of the LC-SLM scheme is significantly lower than the
conventional SLM scheme.
Fig. 3 shows a comparison of the BER performance of the
LC-SLM scheme with the conventional SLM scheme in the
additive white Gaussian noise (AWGN) channel. We can see
that the proposed scheme requires 2.5dB higher signal-to-noise
ratio (SNR) than the conventional scheme in order to achieve
for
. It is because the elements of the phase
rotation vectors in the LC-SLM scheme have different magnitudes. It may incur the original signal to have different gains
on different sub-carriers and hence result in degradation in BER.
, the
Although the BER performance is degraded for
LC-SLM scheme can have much less computational complexity

824

IEEE TRANSACTIONS ON BROADCASTING, VOL. 54, NO. 4, DECEMBER 2008

scheme but with significant reduction in the computational

complexity.
REFERENCES

Fig. 3. Comparison of BER performance of the conventional scheme and the

LC-SLM scheme in AWGN channels.

than the conventional SLM scheme. The LC-SLM scheme has

attractive value in practical implementation.

V. CONCLUSION
In this paper, we have presented a novel LC-SLM scheme
using TDSS technique to reduce the PAPR of an OFDM signal.
In this scheme, only two IFFT operations are required. The
cyclically shifted time domain sequences are combined linearly
with a time domain sequence to generate the new candidates.
Simulation result has shown that the LC-SLM scheme can
achieve similar PAPR performance as the conventional SLM

[1] X. D. Li and L. J. Cimini, Jr., Effects of clipping and filtering on the

performance of OFDM, IEEE Comm. Lett., vol. 2, no. 5, pp. 131133,
May 1998.
[2] A. E. Jones, T. A. Wilkinson, and S. K. Barton, Block coding scheme
for reduction of peak to mean envelope power ratio of multicarrier
transmission schemes, Elec. Lett., vol. 30, no. 25, pp. 20982099, Dec.
1994.
[3] B. S. Krongold and D. L. Jones, PAR reduction in OFDM via active
constellation extension, IEEE Trans. Broadcast., vol. 49, no. 3, pp.
258268, Sep. 2003.
[4] T. Jiang, W. B. Yao, P. Guo, Y. H. Song, and D. M. Qu, Two novel
nonlinear companding schemes with iterative receiver to reduce PAPR
in multi-carrier modulation systems, IEEE Trans. Broadcast., vol. 52,
no. 2, pp. 268273, Jun. 2006.
[5] D. W. Lim, S. J. Heo, J. S. No, and H. Chung, A new PTS OFDM
scheme with low complexity for PAPR reduction, IEEE Trans. Broadcast., vol. 52, no. 1, pp. 7782, Mar. 2006.
[6] L. Yang, R. S. Chen, Y. M. Siu, and K. K. Soo, PAPR reduction of
an OFDM Signal by use of PTS with low computational complexity,
IEEE Trans. Broadcast., vol. 52, no. 1, pp. 8386, Mar. 2006.
[7] R. J. Baxley and G. T. Zhou, Comparing selected mapping and partial
transmit sequence for PAR reduction, IEEE Trans. Broadcast., vol. 53,
no. 4, pp. 797803, Dec. 2007.
[8] R. W. Buml, R. F. H. Fischer, and J. B. Huber, Reducing the peak-to
average power ratio of multicarrier modulation by selected mapping,
Elec. Lett., vol. 32, no. 22, pp. 20562057, Oct. 1996.
[9] C. L. Wang and Y. Ouyang, Low-complexity selected mapping
schemes for peak-to-average power ratio reduction in OFDM systems, IEEE Trans. Signal Processing, vol. 53, no. 12, pp. 46524660,
Dec. 2005.
[10] S. J. Heo, H. S. Noh, J. S. No, and D.-J. Shin, A modified SLM scheme
with low complexity for PAPR reduction of OFDM systems, IEEE
Trans. Broadcast., vol. 53, no. 4, pp. 804808, Dec. 2007.
[11] T. Jiang, W. D. Xiang, P. C. Richardson, J. H. Guo, and G. X. Zhu,
PAPR reduction of OFDM signals using partial transmit sequences
with low computational complexity, IEEE Trans. Broadcast., vol. 53,
no. 3, pp. 719724, Sept. 2007.
[12] T. Jiang and Y. Y. Wu, An overview: peak-to-average power ratio
reduction techniques for OFDM signals, IEEE Trans. Broadcast., vol.
54, no. 2, pp. 257268, June 2008.
[13] C. Tellambura, Computation of the continuous-time PAR of an OFDM
signal with BPSK subcarriers, IEEE Commun. Lett., vol. 5, no. 5, pp.
185187, May 2001.