IEEE TRANSACTIONS ON COMMUNICATIONS, VOL. 57, NO.

7, JULY 2009

1903

Novel Conversion Matrices for Simplifying the IFFT Computation of an

SLM-Based PAPR Reduction Scheme for OFDM Systems
Chin-Liang Wang, Senior Member, IEEE, and Sheng-Ju Ku, Student Member, IEEE

AbstractThere have been a set of conversion matrices proposed recently by Wang and Ouyang to simplify the inverse fast
Fourier transform (IFFT) computation involved in the selected
mapping (SLM) scheme for reduction of the peak-to-average
power ratio (PAPR) in orthogonal frequency division multiplexing (OFDM) systems. As compared to the conventional SLM
scheme, the modified approach achieves close PAPR reduction
with much lower complexity but degraded bit error rate (BER)
performance. In this paper, we propose a new set of conversion
matrices for the SLM scheme such that the complexity can be
reduced without sacrificing the BER performance. It is shown
that the improved SLM method has better BER performance and
lower complexity than the previous work by Wang and Ouyang,
at the cost of a slight PAPR reduction loss.
Index Termsinverse fast Fourier transform (IFFT), orthogonal frequency division multiplexing (OFDM), peak-to-average
power ratio (PAPR) reduction, selected mapping (SLM).

I. I NTRODUCTION
HE orthogonal frequency division multiplexing (OFDM)
technique is attractive for high-speed data transmission
because it has high spectral efficiency and is robust against
multipath fading [1]. OFDM has been adopted in many wireless and wired applications, such as digital audio broadcasting
(DAB) [2], digital video broadcasting (DVB) [3], wireless
local area networks [4], and digital subscriber lines (DSL) [5].
One main drawback of OFDM systems is the high peak-toaverage power ratio (PAPR) at the transmitters output, where
a high-PAPR OFDM signal may cause poor power efficiency,
in-band distortion, and undesired spectral spreading when it
passes through a nonlinear power amplifier [1], [6].
Many methods have been developed to resolve the high
PAPR problem of OFDM systems, including amplitude clipping [7], coding [8], companding transforms [9]-[11], selected
mapping (SLM) [12]-[14], and partial transmit sequences
(PTS) [15], [16]. Each of these schemes has its own distinct
features and advantages. In the following, we restrict our
attention to SLM for PAPR reduction. In the SLM scheme,
the original data sequence is multiplied by a set of predetermined phase rotation vectors and then passed through
a bank of inverse fast Fourier transform (IFFT) blocks to

Paper approved by A. Anastasopoulos, the Editor for Iterative Detection,

Estimation and Coding of the IEEE Communications Society. Manuscript
received April 2, 2007; revised January 18, 2008 and September 1, 2008.
C.-L. Wang is with the Department of Electrical Engineering and the
Institute of Communications Engineering, National Tsing Hua University,
Hsinchu, Taiwan 30013, Republic of China (e-mail: clwang@ee.nthu.edu.tw).
S.-J. Ku is with the Institute of Communications Engineering, National
Tsing Hua University, Hsinchu, Taiwan 30013, Republic of China (e-mail:
d909611@oz.nthu.edu.tw).
This work was supported by the National Science Council of the Republic
of China under Grants NSC 94-2213-E-007-048, NSC 95-2221-E-007-119,
and NSC 95-2221-E-007-041.
Digital Object Identifier 10.1109/TCOMM.2009.07.070156

generate candidate OFDM signals, where the one with the

lowest PAPR is selected for transmission. The SLM method
has good PAPR reduction performance, but its complexity is
usually too high to be acceptable in practical applications.
To reduce the complexity of the conventional SLM scheme,
Wang, Hsu, and Ouyang [13] proposed two conversion matrices based on two special phase rotation vectors (whose
elements are of periods two and four respectively) to simplify
the IFFT computation. For an OFDM system with N subcarriers and L times oversampling, these two conversion matrices
can replace some of the IFFT blocks in the conventional
SLM method, where each conversion process requires only
3LN complex additions to compute an LN -point IFFT. As
compared to the conventional SLM scheme, this modified
approach achieves similar PAPR reduction performance with
only about half computational complexity. For further complexity reduction, Wang and Ouyang [14] developed more
conversion matrices (originated or modified from some phase
rotation vectors of period four) to replace more IFFT blocks in
the conventional SLM scheme, where each conversion process
also involves 3LN complex additions to compute an LN -point
IFFT. With these conversion matrices, we can use only one
IFFT output to generate other candidate signals. As compared
to the conventional SLM scheme and the modified SLM
scheme in [13], the approach in [14] achieves comparable
PAPR reduction with much lower complexity but degraded bit
error rate (BER) performance. The BER degradation is due to
the fact that the elements of each phase rotation vector may
have different magnitudes, which results in different gains for
the modulated signals at different subcarriers. Moreover, the
receiver for the approach in [14] may perform N complex
divisions to remove the phase rotation vectors effect when
recovering the frequency-domain data, which is not needed in
the conventional SLM scheme and the work in [13].
In this paper, we propose a new set of phase rotation
vectors/conversion matrices without the above-mentioned disadvantages for SLM-based PAPR reduction in OFDM systems.
As compared to the phase rotation vectors/conversion matrices
described by Wang and Ouyang [14], the proposed ones can
make the SLM scheme achieve better BER performance with
lower complexity and a slight loss in PAPR reduction.
II. BACKGROUND
The continuous-time OFDM signal of a system with N
subcarriers can be represented as
x(t) =

c 2009 IEEE
0090-6778/09$25.00 

N 1
1 
Xk ej2kf t , 0tT
N
k=0

(1)

1904

IEEE TRANSACTIONS ON COMMUNICATIONS, VOL. 57, NO. 7, JULY 2009

where Xk is the data symbol carried by the kth subcarrier,

f is the frequency difference between subcarriers, and T =
1/f is the OFDM symbol duration. The PAPR of x(t) is
defined by
PAPR =

max |x(t)|2

0tT

E[|x(t)|2 ]

(2)

where E[] denotes the expectation operation. For digital

implementation, we need to express x(t) in discrete time.
If x(t) is sampled by the Nyquist rate N/T , we may miss
some signal peaks and have optimistic results for the PAPR.
To estimate the PAPR from discrete-time samples, x(t) is
usually oversampled by a factor of L, i.e., the sampling rate
is LN/T . It was derived in [17] that the PAPR is at most
CL = 1/(cos(/2L))2 times the estimated PAPR from L
times oversampling, where C4 = 1.1716. As shown in [6],
the use of L = 4 can result in good performance for PAPR
reduction methods.
In the SLM method, the N -point data sequence X =
[X0 , X1 , ..., XN 1 ]T is multiplied by M 1 different phase
rotation vectors ri = [ri,0 , ri,1 , ..., ri,N 1 ]T to form Ri X at
the transmitter, where Ri is a diagonal matrix with elements
Ri,kk = ri,k , 1 i M 1, and 0 k N 1. X
and Ri X are then processed by IFFT blocks to generate M
candidate signals, i.e., x = QX and xi = QRi X, where Q is
the N N IFFT matrix with the (n, k)th element defined by
ej2nk/N /N . At the receiver, the received signal is processed
by an FFT block and then divided by the corresponding
ri to recover X. The elements in ri are selected from the
set {1, j} such that the operations of multiplication and
division by ri can be simply implemented. It was derived
in [13] and [14] that the relationship between x and xi
can be expressed as xi = Ti x, where Ti = QRi Q1 =
1>
, t<2>
, . . . , t<N
] is referred to as the conversion
[ti , t<1>
i
i
i
matrix (CM) corresponding to ri with ti = IF F T {ri } = Qri
and t<k>
being a circularly down-shifted version of the
i
column vector ti by k elements. If L times oversampling is
considered, Q and Ti are both of LN LN dimensions.
In the works of [13] and [14], some low-complexity CMs
were presented. These CMs have only two or four nonzero
elements (1 or j) in each row as well as each column such
that they can generate LN -point IFFT outputs with only 3LN
complex additions. Two modified SLM architectures were
presented in [14], which use CMs to replace some of the IFFT
blocks. As compared with the conventional SLM scheme, they
can reach close PAPR reduction performance with much lower
computational complexity, but the BER performance may be
degraded. Are there any other low-complexity CMs that can
be used to generate candidate signals for the SLM scheme
without sacrificing the BER performance? In the following, we
will derive a theorem that can help find more low-complexity
CMs for the SLM scheme.
III. P ROPOSED P HASE ROTATION V ECTORS AND
C ONVERSION M ATRICES FOR THE IFFT C OMPUTATION
To make a CM (corresponding to a phase rotation vector
r) multiplication-free for the IFFT computation, the real
and imaginary parts of each element of its first column

t = IF F T {r} are required in the set {0, 1} (ignoring the

constant factor throughout this paper). For ease of presentation, we define the least period of an N -element sequence
{r0 , r1 , ..., rN 1 } as the least positive integer P such that
ri = r(i+P )modN for i = 0, 1, ..., N 1.
Theorem: Let r be an N -dimensional phase rotation vector
with elements in the set {1, j}, where N is a power of
2. If the least period P of the N -element sequence is greater
than 8, there is at least one element of t = IF F T {r} whose
real or imaginary part is not in the set {0, 1}.
The proof of the theorem is given in the Appendix. According to this theorem, it is only necessary to search those
sequences of ri with least periods less than or equal to 8 (i.e.,
least periods 2, 4, 8) if we would like to find new CMs Ti
that are multiplication-free.
Let ri = [ri,0 , ri,1 , ..., ri,7 ]T , where ri,k is in the set
{1, j} for 0 k 7. For an OFDM system with
N subcarriers and L times oversampling, the phase rotation
vector ri = [rTi , rTi , ..., rTi ]T , where the vector ri repeats
LN/8 times. To select ri for constructing ri such that the
corresponding Ti can be used to generate IFFT outputs with
the same computational complexity as those CMs proposed in
[13] and [14] (i.e., 3LN complex additions for the LN -point
IFFT outputs), we put the following two constraints:
1) The first column vector ti = Qri of Ti has m nonzero
elements, where m = 2, 3, or 4.
2) The real and imaginary parts of each nonzero element in
ti must be +1, 1, or 0 (ignoring the constant factor of 1/2).
By substituting {1, j} for the eight elements of ri , there
are 48 cases to be checked whether the above two constraints
are satisfied or not. During the search process, there exist
some redundant cases whose CMs can be obtained by simply
scaling or circularly shifting another CMs. After removing
these redundant cases, we find that there are eleven solutions
of ri . Without loss of generality, we list these ri along with
the corresponding ti for the case of LN = 16 in Table I. It
can be seen that t1 , t6 , and t7 are part of those in [13] and
[14]. Note that all the CMs constructed with these eleven ti
can generate an LN -point IFFT output using 3LN complex
additions. Since the proposed phase rotation vectors consist
of elements in the set {1, j}, they have the same unity
gain for the modulated signals at different subcarriers and will
not cause BER degradation. It is also clear that the receiver
does not need division operations to remove the phase rotation
vectors effect.
IV. S IMULATION R ESULTS
To verify the effectiveness of the proposed CMs, computer
simulations were conducted based on the first modified SLM
scheme (MSLM-1) in Fig. 3 of [14]. For the purpose of
comparison, the CMs proposed in [14] were also considered in
our simulations. The OFDM system used consists of N = 64
subcarriers with 16 quadrature-amplitude modulation (16QAM), where four times oversampling is considered, i.e.,
L = 4. Moreover, we assume that the transmitter and receiver
are perfectly synchronized and that the side information of the
SLM scheme is correctly detected by the receiver.
Fig. 1 shows simulation results of the complementary
cumulative distribution function of PAPR (CCDF = Pr(PAPR>

WANG and KU: NOVEL CONVERSION MATRICES FOR SIMPLIFYING THE IFFT COMPUTATION OF AN SLM-BASED PAPR REDUCTION SCHEME . . .

TABLE I
P ROPOSED 11 T YPES OF ri AND THE C ORRESPONDING ti FOR LN = 16
r1 =[1 j 1 j 1 j 1 j]T

t1 =[1+j 0 0 0 0 0 0 0 1-j 0 0 0 0 0 0 0]T

r2 =[1 1 -j j 1 1 -j j]T

t2 = [1 0 0 0 1+j 0 0 0 -j 0 0 0 0 0 0 0]T

r3 =[1 -1 j j 1 -1 j

t3 =[j 0 0 0 1-j 0 0 0 1 0 0 0 0 0 0 0]T

r4 =[1 -j j 1 1 -j j 1]T

t4 =[1 0 0 0 1+j 0 0 0 -j 0 0 0 0 0 0 0]T

r5 =[1 -j -j -1 1 -j -j -1]T

t5 =[-j 0 0 0 1+j 0 0 0 1 0 0 0 0 0 0 0]T

r6 =[1 j 1 -j 1 j 1 -j]T

t6 =[1 0 0 0 -1 0 0 0 1 0 0 0 1 0 0 0]T

r7 =[1 1 1 -1 1 1 1

10

-1]T

t7 =[1 0 0 0 j 0 0 0 1 0 0 0 -j 0 0 0]T

r8 =[1 j -j -j -1 j j -j]T

t8 =[0 0 1 0 -1 0 0 0 0 0 1 0 1 0 0 0]T

r9 =[1 1 j -1 -1 1 -j -1]T

t9 =[0 0 0 0 j 0 1 0 0 0 0 0 -j 0 1 0]T

r10 =[1 1 -j 1 -1 1 j 1]T

t10 =[1 0 1 0 0 0 0 0 -1 0 1 0 0 0 0 0]T

r11 =[1 1 -j -1 -1 1 j -1]T

t11 =[0 0 1 0 j 0 0 0 0 0 1 0 -j 0 0 0]T

10

BER

j]T

10

MSLM1 with proposed CMs

MSLM1 with CMs in [14] (M= 4)
MSLM1 with CMs in [14] (M= 8)
MSLM1 with CMs in [14] (M=12)

10

1905

10
SNR (dB)

10

15

20

CCDF(PAPR )=Pr(PAPR>PAPR )

Fig. 2.
Comparison of BER performance between MSLM-1 with the
proposed CMs and MSLM-1 with the CMs in [14] for AWGN channels.
1

10

M=12
M=4

10

Original
MSLM1 with CMs in [14] (M= 4)
MSLM1 with CMs in [14] (M=12)
MSLM1 with proposed CMs (M= 4)
MSLM1 with proposed CMs (M=12)

10

6
PAPR (dB)

10

to reduce the computational complexity of the conventional

SLM scheme. As compared to the related work of [14], the
SLM scheme using the proposed CMs can achieve better BER
performance with slightly worse PAPR reduction. Moreover,
since the elements of each phase rotation vector are from
{1, j}, there is no need for the proposed approach to
perform division operations for removing the phase rotation
vectors effect at the receiver, and the total computational
complexity is further reduced. The low-complexity and goodperformance features of the proposed CMs make the SLM
scheme more practical and more useful for OFDM systems.
A PPENDIX

Fig. 1. Comparison of PAPR reduction performance between MSLM-1 with

the proposed CMs and MSLM-1 with the CMs in [14].

P AP R0 )) for MSLM-1 with the proposed CMs and MSLM-1

with the CMs in [14]. It can be seen that the proposed CMs
result in a slightly worse PAPR reduction than the CMs in
[14]. This degradation is due to the fact that the elements of
the proposed phase rotation vectors are with all periodic (with
least period 2, 4, or 8), while those in [14] are most aperiodic
(with a least period equal to LN ); in other words, the proposed
phase rotation vectors have more correlation than those in
[14]. Fig. 2 shows a BER performance comparison between
MSLM-1 with the proposed CMs and MSLM-1 with the CMs
in [14] for additive white Gaussian noise (AWGN) channels.
It illustrates that the former has a significant performance
improvement over the latter.
V. C ONCLUSION
In this paper, we have developed a new set of conversion
matrices (CMs) for the SLM scheme based on some periodic
properties of the IFFT matrix. For an N -point OFDM system
with L times oversampling, the proposed CMs use an LN point IFFT to generate other LN -point IFFTs (i.e., candidate
signals) for the SLM scheme with only 3LN complex additions. These CMs can replace some of the IFFT blocks

Proof of the Theorm

For an N -dimensional phase rotation vector r =
[r0 , r1 , . . . , rN 1 ]T with elements in {1, j} and with a
least period P , the vector t = IF F T {r} can be expressed
as

t0
t1

t = . = Qr
..
tN 1

r0 + r1 + . . . + rN 1
(N 1)

r0 + r1 WN1 + . . . + rN 1 WN
1

..
N

.
(N 1)

r0 + r1 WN

(N 1)(N 1)

+ . . . + rN 1 WN

(A.1)
where N and P are both powers of two with P
N and WN ej2/N . Denoting row n of Q by qTn =
n(N 1)
]/N , we have tn = qTn r,
[1, WNn , WN2n , . . . , WN
where n = 0, 1, 2, ..., N 1. It is easy to check that qTn
has a least period Pn = N/gcd(n, N ) with 1 Pn N ,
where gcd(n, N ) is the greatest common divisor of n and N
n(Pn 1)
and the least-periods sequence {1, WNn , ..., WN
}
T
repeats N/Pn times in qn . Note that the second-half sequence
of a least-period is just the negative of its first-halfs, except

1906

IEEE TRANSACTIONS ON COMMUNICATIONS, VOL. 57, NO. 7, JULY 2009

for the case of qT0 which is a constant sequence with P0 = 1.

We can also derive the following two properties: 1) for
n = (2m + 1)N/P with 0 m P/2 1, Pn = P ; 2)
for n = 2mN/P with 0 m P/2 1, Pn P/2.
n(k+P/2)
= WNnk
For qTn with Pn = P , we have WN
and the corresponding tn can be expressed as follows:
tn = t(2m+1)N/P = tm,P/2
=

P/21
N 1 
(2m+1)N k/P
[
(rk rk+P/2 )WN
]
P N
k=0
P/21

1  1 k
mk
[ WP (rk rk+P/2 )]WP/2
,
P/2
2
k=0

0mP/2 1.

(A.2)

It is interesting to see that (A.2) represents a P/2-point

n(k+P/2)
IFFT. Similarly, for qTn with Pn = P/2, WN
=
n(k+P/4)
nk
WN
= WN
and the corresponding tn becomes
tn = t2(2m+1)N/P = tm,P/4
=

P/21
1 
2(2m+1)N k/P
(rk + rk+P/2 )WN
P
k=0
P/21

1 
k
mk
WP/2
(rk + rk+P/2 )WP/4
P
k=0
P/41

1 
k
WP/2
[rk + rk+P/2
P

R EFERENCES

k=0

mk
(rk+P/4 + rk+3P/4 )]WP/4
, 0mP/4 1. (A.3)

For qTn with Pn P/4, we can derive

tn = t4mN/P = tm,P/4
=

P/21
1 
4mN k/P
(rk + rk+P/2 )WN
P
k=0
P/21

1 
mk
(rk + rk+P/2 )WP/4
P
k=0
P/41

1 
mk
[rk + rk+P/2 + (rk+P/4 + rk+3P/4 )]WP/4
,
P
k=0

0mP/4 1
n(k+P/2)

greater than or equal to 16), there exists at least one tm,P/2

whose real or imaginary part is not a rational number and
is not in the set {0, 1} (ignoring the constant factor) for
0 m P/2 1. For the other subcases of case I, (A.2)
becomes the P/2-point IFFT of a sequence with two or more
impulse signals, where at least one of them is 0.5WPk (rk
rk+P/2 )[nk] with k {1, 2, ..., P/41, P/4+1, ..., P/2
1}. Since the resulting P/2-point IFFT samples do not have
constant magnitude, there exists at least one tm,P/2 whose real
or imaginary part is not in the set {0, 1}.
Case II: rk = rk+P/2 for k {1, 2, ..., P/4 1, P/4 +
1, ..., P/2 1}.
In this case, the term rk + rk+P/2 rk+P/4 rk+3P/4 in
(A.3) and the term rk + rk+P/2 + rk+P/4 + rk+3P/4 in (A.4)
cannot be equal to zero simultaneously for k {1, 2, ..., P/4
1, P/4 + 1, ..., P/2 1}. Thus, the P/4-point IFFT given by
(A.3) or (A.4) will contain at least P/8 nonzero terms in the
summation. If P is greater than or equal to 16, (A.3) or (A.4)
becomes the P/4-point IFFT of a sequence with two or more
impulse signals. Consequently, the IFFT samples do not have
constant magnitude and there is at least one tm,P/4 or tm,P/4
whose real or imaginary part is not in the set {0, 1}.
Based on all the above results, we can conclude that, if the
least period P of the N -element sequence in r is greater than
8, there is at least one element of IF F T {r} whose real or
imaginary part is not in the set {0, 1}. This concludes the
theorem.

(A.4)
n(k+P/4)

where WN
= WNnk = WN
. Note that
both (A.3) and (A.4) are P/4-point IFFTs. In the following,
we will check the values of (A.2), (A.3), and (A.4) based on
two exclusive cases.
Case I: rk = rk+P/2 for some k {1, 2, ..., P/4 1, P/4 +
1, ..., P/2 1}.
First, we consider the subcase where r0 = rP/2 , rP/4 =
r3P/4 , and rk = rk+P/2 for only one k {1, 2, ..., P/4
1, P/4+1, ..., P/21}. In this subcase, (A.2) is corresponding
to the P/2-point IFFT of an impulse signal 0.5WPk (rk
rk+P/2 )[n k], and the resulting samples tm,P/2 = (rk
mk
/P for 0 m P/2 1 have the same
rk+P/2 )WPk WP/2
magnitude but different phases. If P is greater than 8 (i.e.,

[1] R. van Nee and R. Prasad, OFDM for Wireless Multimedia Communications. Boston: Artech House, 2000.
[2] ETSI, Radio broadcasting systems: Digital Audio Broadcasting (DAB)
to mobile, portable and fixed receivers," WTS 300 401 v1.3.2, Sept.
2000.
[3] ETSI, Digital Video Broadcasting (DVB): framing structure, channel
coding and modulation for digital terrestrial television," ETS 300 744
v1.3.3, Sept. 2000.
[4] IEEE, Part 11: Wireless LAN Medium Access Control (MAC) and
Physical Layer (PHY) Specifications," IEEE Std. 802.11, Aug. 1999.
[5] P. S. Chow, J. C. Tu, and J. M. Cioffi, Performance evaluation of a
multichannel transceiver system for ADSL and VHDSL services," IEEE
J. Select. Areas Commun., vol. 9, pp. 909-919, Aug. 1991.
[6] J. Tellado, Multicarrier Modulation with Low PAR: Applications to DSL
and Wireless. Norwell, MA: Kluwer, 2000.
[7] R. Gross and D. Veeneman, Clipping distortion in DMT ADSL
systems," Electron. Lett., vol. 29, pp. 2080-2081, Nov. 1993.
[8] J. A. Davis and J. Jedwab, Peak-to-mean power control in OFDM,
Golay complementary sequences, and Reed-Muller codes," IEEE Trans.
Inform. Theory, vol. 45, pp. 2397-2417, Nov. 1999.
[9] X. Huang, J. Lu, J. Zheng, K. B. Letaief, and J. Gu, Companding
transform for reduction in peak-to-average power ratio of OFDM
signals," IEEE Trans. Wireless Commun., vol. 3, pp. 2030-2039, Nov.
2004.
[10] T. Jiang, Y. Yang, and Y. H. Song, Exponential companding technique
for PAPR reduction in OFDM systems," IEEE Trans. Broadcasting, vol.
51, pp. 244-248, June 2005.
[11] C.-L. Wang and S.-J. Ku, A low-complexity companding transform for
peak-to-average power ratio reduction in OFDM systems," in Proc. 2006
IEEE Int. Conf. Acoust., Speech, Signal Processing (ICASSP), Toulouse,
France, May 2006, pp. IV 329-332.
[12] R. W. Bauml, R. F. H. Fischer, and J. B. Huber, Reducing the peak-toaverage power ratio of multicarrier modulation by selected mapping,"
Electron. Lett., vol. 32, pp. 2056-2057, Oct. 1996.
[13] C.-L. Wang, M.-Y. Hsu, and Y. Ouyang, A low-complexity peak-toaverage power ratio reduction technique for OFDM systems," in Proc.
2003 Global Telecommun. Conf. GLOBECOM 2003, San Francisco, CA,
Dec. 2003, pp. 2375-2379.

WANG and KU: NOVEL CONVERSION MATRICES FOR SIMPLIFYING THE IFFT COMPUTATION OF AN SLM-BASED PAPR REDUCTION SCHEME . . .

[14] 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, pp. 4652-4660, Dec. 2005.
[15] S. H. Mller and J. B. Huber, OFDM with reduced peak-to-average
power ratio by optimum combination of partial transmit sequences,"
Electron. Lett., vol. 33, pp. 368-369, Feb. 1997.
[16] L. J. Cimini and N. R. Sollenberger, Peak-to-average power ratio

1907

reduction of an OFDM signal using partial transmit sequence," IEEE

Commun. Lett., vol. 4, pp. 86-88, Mar. 2000.
[17] G. Wunder and H. Boche, Peak value estimation of bandlimited signals
from their samples, noise enhancement, and a local characterization in
the neighborhood of an extremum," IEEE Trans. Signal Processing, vol.
51, pp. 771-780, Mar. 2003.