IEEE TRANSACTIONS ON COMMUNICATIONS, VOL. 58, NO.
2, FEBRUARY 2010
Novel Sequence Design for
Low-PMEPR and High-Code-Rate OFDM Systems
Scott C.-H. Huang, Member, IEEE, Hsiao-Chun Wu, Senior Member, IEEE, Shih Yu Chang, Member, IEEE,
and Xian Liu, Senior Member, IEEE
Abstract—In this paper, we propose a new family of 64-
QAM based sequences for achieving the lowest PMEPR and the
highest code rate compared to all other 64-QAM based schemes,
which can be applied for OFDM systems. The construction of
the proposed sequences is simple and the theoretical analysis is
presented.
Index Terms—Peak-to-mean-envelope-power ratio, OFDM 16-
QAM sequences, Golay sequences.
I. I NTRODUCTION
I N 2001, Rößing and Tarokh constructed a family of
OFDM (orthogonal frequency division multiplexing) 16-
QAM (quadrature amplitude modulation) sequences, each by
combining two Golay sequences, for achieving the upper-
bounded peak-to-mean-envelope-power ratios (PMEPRs) [1].
In 2003, Chong et al explored the in-depth mathematical
properties and extended this idea to construct Golay comple-
mentary pairs for achieving the same PMEPR upper bound [2].
In 2006, Lee and Golomb further extended Chong’s work from
the OFDM 16-QAM sequences to the OFDM 64-QAM se-
quences [3]. Li made the essential clarifications to address the
aforementioned studies [4]. Note that the sequences proposed
by Rößing and Tarokh are not necessarily Golay sequences [1].
Chong et al constructed the OFDM 16-QAM sequences which
exhibit the properties of Golay sequences themselves [2].
Similarly, Lee and Golomb constructed the OFDM 64-QAM
sequences which are also Golay sequences [3]. As a matter
of fact, Golay sequences are originated from multi-slit spec-
troscopy and they lead to many applications for ultrasonic
or acoustic measurements. The mathematical properties of
these 64-QAM Golay sequences intrinsically imposed some
restrictions and hence these sequences may not be optimal for
the OFDM system design.
This work attempts to address the concerns about both
PMEPR and code rate emerging in OFDM systems. Our goal
Paper approved by N. Benvenuto, the Editor for Modulation and Detection
of the IEEE Communications Society. Manuscript received April 25, 2009;
revised July 27, 2009.
S. C.-H. Huang is with the Department of Computer Science, City Univer-
sity of Hong Kong, Kowloon, Hong Kong (e-mail: shuang@cs.cityu.edu.hk).
H.-C. Wu is with the Department of Electrical and Computer Engineer-
ing, Louisiana State University, Baton Rouge, LA 70803, USA (e-mail:
wu@ece.lsu.edu).
S. Y. Chang is with the Department of Computer Science, National Tsing
Hua University, Taiwan (e-mail: shihyuch@cs.nthu.edu.tw).
X. Liu is with Department of Systems Engineering, University of Arkansas
at Little Rock, Little Rock, Arkansas, USA (e-mail: xxliu@ualr.edu).
This work was supported by Information Technology Research Award for
National Priorities (NSF-ECCS 0426644) from National Science Foundation,
National Science Foundation-Louisiana Pilot Fund, and Office of Naval
Research-DEPSCoR grant.
Digital Object Identifier 10.1109/TCOMM.2010.02.090055
0090-6778/10$25.00 ⃝
c 2010 IEEE
Authorized licensed use limited to: Jeppiaar Engineering College. Downloaded on May 01,2010 at 04:03:53 UTC from IEEE Xplore. Restrictions apply.
405
is to design a collection of sequences, not necessarily Golay
sequences, which can greatly lower the PMEPR upper bound
while the code rate can also be increased (compared to other
existing sequences) in the meantime. Thus, we propose a
novel family of 64-QAM sequences that could outperform
other existing OFDM sequences in terms of both PMEPR
and code rate. Our proposed 64-QAM sequences achieve the
PMEPR upper bound 2.85 as compared to the best value
4.66 in [3]. Particularly, the code rate resulting from our
proposed scheme is roughly the square of that proposed
by [3]. We use Golay sequences as the building blocks to
construct the new sequences, which are not necessarily Golay
sequences ultimately. Our proposed sequences can be deemed
very promising for the future OFDM systems.
II. P ROBLEM F ORMULATION
Throughout this paper, we denote the set of natural numbers,
the set of integers, the set of real numbers, and the set of
complex N, Z, R, and C, respectively. Besides,
√ numbers by
−1 and 𝑔 ∗ represents the complex conjugate of
def
i =
𝑔 ∈ C. Suppose that an OFDM system has 𝑛 sub-carriers,
where transmitted information is represented as complex-
valued sequences of length 𝑛. Each sequence (within one
OFDM symbol period) is also called a codeword. Let 𝕊 be a
collection of length-𝑛 sequences in C. Throughout this paper,
we use the following naming convention for the sequences
and their elements. Given a sequence ⟨𝑐⟩ ∈ 𝕊, then we always
use 𝑐𝑘 to denote the 𝑘-th element in ⟨𝑐⟩, for 0 ≤ 𝑘 < 𝑛. In
other words, ⟨𝑐⟩ = (𝑐0 , . . . , 𝑐𝑛−1 ). Now the complex-valued
transmitted OFDM signal 𝑆𝑐 (𝑡) is given by
𝑛−1
∑
1
𝑆𝑐 (𝑡) = 𝑐𝑘 𝑒i 2𝜋(𝑓𝑟 +𝑘𝑓𝑠 )𝑡 , for 0 ≤ 𝑡 ≤ , (1)
𝑓𝑠
𝑘=0
where 𝑓𝑟 is the carrier frequency and 𝑓𝑠 is the bandwidth of
each tone. Its peak envelope power (PEP) is defined as
( ) def
PEP ⟨𝑐⟩ = max ∣𝑆𝑐 (𝑡)∣2 . (2)
0≤𝑡≤1/𝑓𝑠
Assume that codewords are uniformly transmitted over 𝕊 (all
codewords are equally probable) and thus the probability for
transmitting any codeword is 1/∣𝕊∣ (∣𝕊∣ represents the number
of codewords in 𝕊). Thus, the mean envelope power 𝑃av can
be calculated as
∑ 1 1 ∑
𝑃av = E ∥⟨𝑐⟩∥2 = ∥⟨𝑐⟩∥2 = ∥⟨𝑐⟩∥2 , (3)
⟨𝑐⟩∈𝕊 ∣𝕊∣ ∣𝕊∣
⟨𝑐⟩∈𝕊 ⟨𝑐⟩∈𝕊
where E denotes the (statistical) expectation and ∥⟨𝑐⟩∥ denotes
the ℓ2 -norm of ⟨𝑐⟩. The PMEPR for codeword ⟨𝑐⟩ is defined
406 IEEE TRANSACTIONS ON COMMUNICATIONS, VOL. 58, NO. 2, FEBRUARY 2010

as for such GSs of an arbitrary length 𝑛 is still questionable [5].

( ) def PEP(⟨𝑐⟩) Hence, the corresponding construction of an arbitrary-length
PMEPR ⟨𝑐⟩ = , (4) GS is hard to achieve thereby. Recently, Davis and Jedwab
𝑃av
proposed a concrete construction method for GSs and GCPs
and the PMEPR for the collection 𝕊 is defined as the maximum of length 2𝑚 for any 𝑚 ∈ N [6]. The work in [6] provides the
PMEPR over all codewords, which is given by useful mathematical properties which can benefit our studies
( )
def
PMEPR(𝕊) = max PMEPR ⟨𝑐⟩ . (5) in this paper. Note that although this method provides the
⟨𝑐⟩∈𝕊 construction approach for the GSs and the GCPs of length
PMEPR is a very important metric to determine the im- 2𝑚 , not all GSs or GCPs of length 2𝑚 can be constructed
plementation difficulty for the corresponding OFDM system. thoroughly. In other words, there may exist some GCs or GCPs
However, the existing PMEPR schemes mitigating the PMEPR of length 2𝑚 for some 𝑚 which cannot be constructed using
problem would lower the code rates as a trade-off. In this Davis’ and Jedwab’s method in [6].
paper, we would like to address this code rate concern too.
Any existing OFDM communication-related standard requires
IV. O UR P ROPOSED N OVEL OFDM 64-QAM S EQUENCES
the PMEPR below a pre-specified value due to the limited
linear range of the amplifiers at the transceiver. The code rate To illustrate our proposed sequence construction method,
ℛ(𝕊) is defined as we need to define some mathematical functions here. For any
log2 ∣𝕊∣
def
𝑢, 𝑣, 𝑤 ∈ Z4 , we define 𝜁(𝑢, 𝑣, 𝑤) as follows:
ℛ(𝕊) = . (6)
𝑛 4 2 1
𝜁(𝑢, 𝑣, 𝑤) = √ 𝑒i𝜋/4 i𝑢 + √ 𝑒i𝜋/4 i𝑣 + √ 𝑒i𝜋/4 i𝑤 . (11)
def

Since 𝑛 is fixed, ℛ(𝕊) depends solely on the number of 21 21 21

codewords ∣𝕊∣. This metric in (6) will also be used to evaluate
the OFDM system performance. Consequently, the 64-QAM constellation set 𝒢 is defined as
Now, our problem is stated as follows. Given 𝑛, 𝑓𝑟 , 𝑓𝑠 , the def

objective is to design an appropriate collection of sequences 𝕊 𝒢 = {𝜁(𝑢, 𝑣, 𝑤)∣𝑢, 𝑣, 𝑤 ∈ Z4 }. (12)

such that PMEPR(𝕊) is reduced and ∣𝕊∣ is enlarged compared
Note that the definition of the above 64-QAM constellation
to other existing schemes.
is the same as [3]. Nevertheless, how to choose the appropriate
exponents 𝑢, 𝑣, 𝑤 to form the 64-QAM sequences involves
III. G OLAY S EQUENCES AND G OLAY C OMPLEMENTARY very different ideas. In this paper, we propose to use a
PAIRS combination of GCP and GS for determining 𝑢, 𝑣, 𝑤 such
To facilitate the background for our proposed new se- that the PMEPR of the resulted 64-QAM sequence can be
quences, in this section, we provide a brief introduction significantly reduced while the corresponding code rate can
to Golay Sequences (GSs) and Golay Complementary Pairs also be significantly increased. In this paper, we focus on the
(GCPs) over Z4 = {0, 1, 2, 3}. Given a sequence ⟨𝑠⟩ = sequence length of 𝑛 = 2𝑚 due to the availability of the GS
(𝑠0 , . . . , 𝑠𝑛−1 ) over Z4 , its aperiodic autocorrelation with construction method. The collection of our novel 64-QAM
displacement 𝜏 ∈ N ∪ {0} is given by sequences, denoted by 𝔾, is defined as follows:
( ) def 𝑛−𝜏
∑−1 { 
⟨𝑐⟩ 𝑐𝑘 = 𝜁(𝑢𝑘 , 𝑣𝑘 , 𝑤𝑘 ) ∀𝑘,
def
𝑅 ⟨𝑠⟩, 𝜏 = i𝑠𝑙 −𝑠𝑙+𝜏 . (7) 𝔾 =
𝑙=0 ⟨𝑢⟩, ⟨𝑣⟩ are a GCP, ⟨𝑤⟩ is a GS} , (13)
Two sequences ⟨𝑥⟩, ⟨𝑦⟩ over Z4 are a GCP if and only if
{ where 𝑛 is the common sequence length of ⟨𝑢⟩, ⟨𝑣⟩, ⟨𝑤⟩,
( ) ( ) 2𝑛, if 𝑚 = 0 and 0 ≤ 𝑘 < 𝑛. According to our proposed OFDM sequence
𝑅 ⟨𝑥⟩, 𝑚 + 𝑅 ⟨𝑦⟩, 𝑚 = . (8)
0, otherwise construction scheme defined by (13), we analyze the corre-
sponding performance in terms of PMEPR and code rate in
We can also express (8) in polynomial form. We associate
the two subsequent subsections.
⟨𝑥⟩ and ⟨𝑦⟩ with the polynomials x(𝑧) = 𝑥0 + 𝑥1 𝑧 + . . . +
𝑥𝑛−1 𝑧 𝑛−1 and y(𝑧) = 𝑦0 +𝑦1 𝑧+. . .+𝑦𝑛−1 𝑧 𝑛−1 , respectively.
Then x(𝑧) and y(𝑧) are a GCP if equivalently the following A. PMEPR
holds:
The following theorem facilitates the upper bound of PEP
x(𝑧)x(𝑧 −1 ) + y(𝑧)y(𝑧 −1 ) = 2𝑛. (9) for 𝔾 in Eq. (13).
Accordingly, Eq. (9) implies (when it is evaluated along ∣𝑧∣ = Theorem 1:
1) ( )
8√
PEP(𝔾) ≤ 2 + 5 𝑛 ≃ 2.85𝑛. (14)
∣x(𝑧)∣2 + ∣y(𝑧)∣2 = 2𝑛. (10) 21

A sequence is called a GS if it is a member of GCP (i.e. if (Proof.)

there exists another sequence such that together they form a The proof of Theorem 1 is rather complicated and lengthy,
GCP). Although Golay sequences and Golay complementary so we only highlight the important steps here due to the
def
pairs possess wonderful mathematical properties, the existence page limit. Let 𝑧 = exp[i2𝜋𝑓𝑠 𝑡] and ⟨𝑐⟩ ∈ 𝔾 where 𝑐𝑘 =

Authorized licensed use limited to: Jeppiaar Engineering College. Downloaded on May 01,2010 at 04:03:53 UTC from IEEE Xplore. Restrictions apply.
HUANG et al.: NOVEL SEQUENCE DESIGN FOR LOW-PMEPR AND HIGH-CODE-RATE OFDM SYSTEMS 407

⎛ 2 ⎞
𝜁(𝑢𝑘 , 𝑣𝑘 , 𝑤𝑘 ) for a GCP ⟨𝑢⟩, ⟨𝑣⟩ and a GS ⟨𝑤⟩. According to √ 𝑛−1
∑ 
 
(1), we have + (1 + 2 5) ⎝ i𝑤𝑘 𝑧 𝑘  ⎠ . (18)
 
𝑘=0
 2
𝑛−1 ) 
2 ∑ (
i2𝜋𝑓𝑟 𝑡 i2𝜋𝑓𝑠 𝑡 𝑘 
∣𝑆𝑐 (𝑡)∣ =  𝑐𝑘 𝑒 𝑒  Since ⟨𝑢⟩, ⟨𝑣⟩ are a GCP, and ⟨𝑤⟩ is a GS, according to (10),
 
𝑘=0 we have
  2  2
 𝑛−1  𝑛−1 
 i2𝜋𝑓𝑟 𝑡 ∑ 𝑘 ∑ 𝑘

𝑛−1
2 
 𝑛−1
2


𝑛−1
2

= 𝑒

𝑐𝑘 𝑧  = 
 
𝑐𝑘 𝑧 
  ∑ 𝑢𝑘 𝑘   ∑ 𝑣𝑘 𝑘   ∑ 𝑤𝑘 𝑘 
 i 𝑧  + i 𝑧  = 2𝑛,  i 𝑧  ≤ 2𝑛. (19)
 ( 𝑘=0 𝑘=0      
∑𝑛−1
4 2
𝑘=0 𝑘=0 𝑘=0

= √ 𝑒i𝜋/4 i𝑢𝑘 + √ 𝑒i𝜋/4 i𝑣𝑘
 21 21 According to (18) and (19), we obtain
𝑘=0
) 2 √ √
1  4 4
 Υ(4, 2, 1) + Υ(2, −4, 0) + Υ( 20, 0, −4/ 20)
+ √ 𝑒i𝜋/4 i𝑤𝑘 𝑧 𝑘  √ √ √
21  4 4
+Υ(0, 20, −2/ 20) = (42 + 8 5)𝑛. (20)
𝑛−1 2
1  ∑ 𝑢𝑘 𝑣𝑘 𝑤𝑘

𝑘
√ √ √ √
Since Υ(2, −4, 0), Υ( 4 20, 0, −4/ 4 20), Υ(0, 4 20, −2/ 4 20)
=  (4i + 2i + i ) 𝑧 
21   ≥ 0, we get
𝑘=0
 2
1  ∑ 𝑢𝑘 𝑘  √
𝑛−1 𝑛−1
∑ 𝑛−1
∑
𝑣𝑘 𝑘 𝑤𝑘 𝑘  Υ(4, 2, 1) ≤ (42 + 8 5)𝑛. (21)
= 4 i 𝑧 +2 i 𝑧 + i 𝑧  . (15)
21  
𝑘=0 𝑘=0 𝑘=0
Therefore, from (15), (16), and (21), we obtain
In order to establish an upper-bound for (15), we introduce
the following function: Υ(4, 2, 1)
 𝑛−1 2 ∣𝑆𝑐 (𝑡)∣2 =
 ∑ ∑ 𝑣 𝑘
𝑛−1 ∑ 𝑤 𝑘 
𝑛−1 21 ( )
 √
Υ(𝛼, 𝛽, 𝛾)
def
= 𝛼
𝑢𝑘 𝑘
i 𝑧 +𝛽 i 𝑧 +𝛾
𝑘
i 𝑧  ,
𝑘
1 8√
  ≤ (42 + 8 5𝑛) = 2 + 5 𝑛, (22)
𝑘=0 𝑘=0 𝑘=0 21 21
𝛼, 𝛽, 𝛾 ∈ R. (16)
and
Thus, ∣𝑆𝑐 (𝑡)∣2 = (1/21)Υ(4, 2, 1). Note that Υ(𝛼, 𝛽, 𝛾) ≥ 0,
( )
∀𝛼, 𝛽, 𝛾 ∈ R. We expand Υ(𝛼, 𝛽, 𝛾) as 8√
PEP(𝔾) = max ∣𝑆𝑐 (𝑡)∣2 ≤ 2+ 5 𝑛, (23)
 2  2 ⟨𝑐⟩∈𝔾 21
𝑛−1
∑  𝑛−1
∑ 
2 𝑢𝑘 𝑘  2 𝑣𝑘 𝑘 
Υ(𝛼, 𝛽, 𝛾) = 𝛼  i 𝑧  +𝛽  i 𝑧  so the proof is complete. □
   
𝑘=0 𝑘=0
𝑛−1 2 [𝑛−1 ] [𝑛−1 ]∗ Now we study the mean envelope power 𝑃av of 𝔾, defined
∑  ∑ ∑
2 𝑤𝑘 𝑘  𝑢𝑘 𝑘 𝑣𝑘 𝑘 in Eq. (13). According to our sequence construction method
+𝛾  i 𝑧  + 𝛼𝛽 i 𝑧 i 𝑧
  defined in (13), the determination of the corresponding 𝑃av is
𝑘=0 𝑘=0 𝑘=0
[𝑛−1 ]∗ [𝑛−1 ] non-trivial. As a matter of fact, in our sequence construction,
∑ ∑ ⟨𝑢⟩ and ⟨𝑣⟩ are not necessarily statistically independent of
+ 𝛼𝛽 i𝑢𝑘 𝑧 𝑘 i𝑣𝑘 𝑧 𝑘
𝑘=0 𝑘=0
each other. The following lemma shows that, although ⟨𝑢⟩
[𝑛−1 ] [𝑛−1 ]∗ and ⟨𝑣⟩ are not necessarily independent, their GCP properties
∑ ∑
+ 𝛽𝛾 𝑣𝑘 𝑘
i 𝑧 i𝑤𝑘 𝑘
𝑧 result in the same mean envelope power as if they were subject
𝑘=0 𝑘=0
to the statistical independence.
[𝑛−1 ]∗ [𝑛−1 ] Lemma 1: The mean envelope power of 𝔾 is 𝑃av = 𝑛.
∑ ∑
𝑣𝑘 𝑘 𝑤𝑘 𝑘
+ 𝛽𝛾 i 𝑧 i 𝑧 (Proof.) For any ⟨𝑐⟩ ∈ 𝔾, 𝑐𝑘 = 𝜁(𝑢𝑘 , 𝑣𝑘 , 𝑤𝑘 ) for a GCP ⟨𝑢⟩
𝑘=0 𝑘=0 and ⟨𝑣⟩ and a GS ⟨𝑤⟩. Thus,
[𝑛−1 ] [𝑛−1 ]∗
∑ ∑
i𝑢𝑘 𝑧 𝑘 i𝑤𝑘 𝑧 𝑘 ∑
𝑛−1
+ 𝛼𝛾  2
∥⟨𝑐⟩∥2 = 𝑐𝑘 
𝑘=0 𝑘=0
[𝑛−1 ]∗ [𝑛−1 ] 𝑘=0
∑ ∑  2
𝑢𝑘 𝑘 𝑤𝑘 𝑘 ∑
𝑛−1
 4 i𝜋/4 𝑢 2 i𝜋/4 𝑣𝑘 1 i𝜋/4 𝑤𝑘 
+ 𝛼𝛾 i 𝑧 i 𝑧 . (17) = √ 𝑒 i 𝑘
+ √ 𝑒 i + √ 𝑒 i
 21 21 21 
𝑘=0 𝑘=0 𝑘=0

8 ∑ ( 𝑢𝑘 −𝑣𝑘
𝑛−1
According to (15)-(17), to bound ∣𝑆𝑐 (𝑡)∣2 , we can use the )
= 𝑛+ i + i𝑣𝑘 −𝑢𝑘
following identity: 21 𝑘=0
√
4
√4 4 ∑ ( 𝑢𝑘 −𝑤𝑘
𝑛−1
)
Υ(4, 2, 1) + Υ(2, −4, 0) + Υ( 20, 0, −4/ 20) + i + i𝑤𝑘 −𝑢𝑘
√4
√4
21
+Υ(0, 20, −2/ 20) 𝑘=0
⎛ 2  2 ⎞ 2 ∑ ( 𝑣𝑘 −𝑤𝑘
𝑛−1
)
( √ ) 𝑛−1 ∑ 

𝑛−1
 ∑ 
 + i + i𝑤𝑘 −𝑣𝑘 .
= 20 + 2 5 ⎝ i𝑢𝑘 𝑧 𝑘  +  i𝑣𝑘 𝑧 𝑘  ⎠ 21
𝑘=0
   
𝑘=0 𝑘=0 (24)

Authorized licensed use limited to: Jeppiaar Engineering College. Downloaded on May 01,2010 at 04:03:53 UTC from IEEE Xplore. Restrictions apply.
408 IEEE TRANSACTIONS ON COMMUNICATIONS, VOL. 58, NO. 2, FEBRUARY 2010

According to (3) and (24), we have Therefore,

∑ 𝑛−1
∑( )
1 ∑ i𝑢𝑘 −𝑣𝑘 + i𝑣𝑘 −𝑢𝑘
𝑃av = ∥⟨𝑐⟩∥2
∣𝔾∣ ⟨𝑐⟩∈𝔾 𝑘=0
⟨𝑐⟩∈𝔾
( 𝑛−1
𝑛−1
∑ ∑ ( )
1 ∑ 8 ∑ ( 𝑢𝑘 −𝑣𝑘 ) = i𝑢𝑘 −𝑣𝑘 + i𝑣𝑘 −𝑢𝑘
= 𝑛+ i + i𝑣𝑘 −𝑢𝑘
∣𝔾∣ 21 𝑘=0 ⟨𝑐⟩∈𝔾
⟨𝑐⟩∈𝔾 𝑘=0
𝑛−1
∑ ∑ ∑
𝑛−1 ( 𝑢𝑘 −𝑣𝑘 )
4 ∑ ( 𝑢𝑘 −𝑤𝑘 ) = i + i𝑣𝑘 −𝑢𝑘 . (28)
+ i + i𝑤𝑘 −𝑢𝑘
21 𝑘=0 ⟨𝑢⟩ ⟨𝑣⟩∈𝒢𝒞𝒫 ⟨𝑢⟩
𝑘=0
𝑛−1
)
2 ∑ ( 𝑣𝑘 −𝑤𝑘 𝑤𝑘 −𝑣𝑘
) However,
+ i +i ∑ ( 𝑢𝑘 −𝑣𝑘 )
21 i + i𝑣𝑘 −𝑢𝑘
𝑘=0
𝑛−1
1 ∑ 8 ∑ ∑ ( 𝑢𝑘 −𝑣𝑘
⟨𝑣⟩∈𝒢𝒞𝒫 ⟨𝑢⟩
1 )
= 𝑛+ ⋅ i + i𝑣𝑘 −𝑢𝑘 ∑ 3
∑ ( 𝑢𝑘 −(𝑣𝑘 +𝑙) )
∣𝔾∣ ∣𝔾∣ 21 1
⟨𝑐⟩∈𝔾 ⟨𝑐⟩∈𝔾 𝑘=0 = i + i(𝑣𝑘 +𝑙)−𝑢𝑘 , (29)
𝑛−1
4
1 4 ∑ ∑ ( 𝑢𝑘 −𝑤𝑘 ) ⟨𝑣⟩∈𝒢𝒞𝒫 ⟨𝑢⟩ 𝑙=0
+ ⋅ i + i𝑤𝑘 −𝑢𝑘
∣𝔾∣ 21 where 𝑣𝑘 + 𝑙, 𝑙 = 0, 1, 2, 3, is the 𝑘-th element of a sequence
⟨𝑐⟩∈𝔾 𝑘=0
belonging to [𝑣]. Note that
𝑛−1
1 2 ∑ ∑ ( 𝑣𝑘 −𝑤𝑘 )
+ ⋅ i + i𝑤𝑘 −𝑣𝑘 (25) 3
∑ ( 𝑢𝑘 −(𝑣𝑘 +𝑙) )
∣𝔾∣ 21 i + i(𝑣𝑘 +𝑙)−𝑢𝑘
⟨𝑐⟩∈𝔾 𝑘=0
𝑛 ∑ 𝑙=0
( 𝑢𝑘 −𝑣𝑘 ) ( )
= 1 + 0 + 0 + 0 = 𝑛, (26)
∣𝔾∣ = i + i𝑣𝑘 −𝑢𝑘 + i𝑢𝑘 −(𝑣𝑘 +1) + i(𝑣𝑘 +1)−𝑢𝑘
⟨𝑐⟩∈𝔾 ( )
+ i𝑢𝑘 −(𝑣𝑘 +2) + i(𝑣𝑘 +2)−𝑢𝑘
( )
where (25) results in (26) because of Lemma 2 stated as + i𝑢𝑘 −(𝑣𝑘 +3) + i(𝑣𝑘 +3)−𝑢𝑘
below. □ ( 𝑢𝑘 −𝑣𝑘 ) ( )
= i + i𝑣𝑘 −𝑢𝑘 + i𝑢𝑘 −(𝑣𝑘 +1) + i(𝑣𝑘 +1)−𝑢𝑘
Lemma 2: With the same assumption as Lemma 1, the ( 𝑢𝑘 −𝑣𝑘 )
− i + i𝑣𝑘 −𝑢𝑘
following identity holds: ( 𝑢𝑘 −(𝑣𝑘 +1) )
− i + i(𝑣𝑘 +1)−𝑢𝑘
∑ 𝑛−1
∑( ) = 0. (30)
i𝑢𝑘 −𝑣𝑘 + i𝑣𝑘 −𝑢𝑘
⟨𝑐⟩∈𝔾 𝑘=0 Therefore, from (29) and (30), we obtain
∑ 𝑛−1
∑ ∑ 3
∑
( 𝑢𝑘 −𝑤𝑘 ) ( 𝑢𝑘 −(𝑣𝑘 +𝑙) )
= i + i𝑤𝑘 −𝑢𝑘 i + i(𝑣𝑘 +𝑙)−𝑢𝑘
⟨𝑐⟩∈𝔾 𝑘=0 ⟨𝑣⟩∈𝒢𝒞𝒫 ⟨𝑢⟩ 𝑙=0
𝑛−1
∑
∑ ∑ ( 𝑣𝑘 −𝑤𝑘 ) = 0 = 0. (31)
= i + i𝑤𝑘 −𝑣𝑘 = 0. (27)
⟨𝑣⟩∈𝒢𝒞𝒫 ⟨𝑢⟩
⟨𝑐⟩∈𝔾 𝑘=0
According to (28), (29), and (30), we get
(Proof.) We will use the characteristics of equivalence ∑ 𝑛−1
∑( )
relation and equivalence classes in this proof. Details of i𝑢𝑘 −𝑣𝑘 + i𝑣𝑘 −𝑢𝑘 = 0. (32)
equivalence relation and equivalence classes can be found ⟨𝑐⟩∈𝔾 𝑘=0
in [7]. First, we make the following claim. We can prove
(Claim:) If ⟨𝑢⟩, ⟨𝑣⟩ are a GCP over Z4 , then ⟨𝑢⟩, ⟨𝑣 ′ ⟩ are also
a GCP if 𝑣𝑘′ = 𝑣𝑘 + 𝑙 for some 𝑙 ∈ Z4 for all 𝑘. In addition, ∑ 𝑛−1
∑( )
i𝑢𝑘 −𝑤𝑘 + i𝑤𝑘 −𝑢𝑘 = 0,
if ⟨𝑢⟩ is a GS, then ⟨𝑢′ ⟩ is also a GS if 𝑢′𝑘 = 𝑢𝑘 + 𝑙 for some
⟨𝑐⟩∈𝔾 𝑘=0
𝑙 ∈ Z4 for all 𝑘.
It is trivial to prove this claim because ⟨𝑢⟩ and ⟨𝑢′ ⟩ have ex- ∑ 𝑛−1
∑( )
i𝑣𝑘 −𝑤𝑘 + i𝑤𝑘 −𝑣𝑘 = 0 (33)
actly the same aperiodic autocorrelation for any displacement
⟨𝑐⟩∈𝔾 𝑘=0
𝜏 . Therefore, we define the equivalence relation ‘≡’ on the
set of length-𝑛 sequences over Z4 as follows: ⟨𝑢⟩ ≡ ⟨𝑢′ ⟩ if in a similar, yet simpler manner because 𝑢𝑘 , 𝑤𝑘 and 𝑣𝑘 , 𝑤𝑘
and only if 𝑢′𝑘 = 𝑢𝑘 + 𝑙 for some 𝑙 ∈ Z4 ∀𝑘. Now, we can are pair-wise statistically independent. The proof of Eq. (33)
classify these sequences according to this equivalence relation. is omitted due to the page limit. □
We use the Since Theorem 1 provides the PEP bound, the correspond-
{ following notation to denote
} the equivalence class
by [𝑢] = ⟨𝑢′ ⟩ ∈ C𝑛 ∣ ⟨𝑢′ ⟩ ≡ ⟨𝑢⟩ . Given a GS ⟨𝑢⟩, the set
def
ing PMEPR can also be bounded thereby. The following
containing all the associated partner sequences of the GCPs corollary facilitates an upper bound for the PMEPR of our
def { }
is denoted by 𝒢𝒞𝒫 ⟨𝑢⟩ = ⟨𝑣⟩ ∈ C𝑛 ∣ ⟨𝑢⟩, ⟨𝑣⟩ are a GCP . proposed set 𝔾 of 64-QAM sequences.

Authorized licensed use limited to: Jeppiaar Engineering College. Downloaded on May 01,2010 at 04:03:53 UTC from IEEE Xplore. Restrictions apply.
HUANG et al.: NOVEL SEQUENCE DESIGN FOR LOW-PMEPR AND HIGH-CODE-RATE OFDM SYSTEMS 409

TABLE I
PMEPR S OF D IFFERENT OFDM QAM S EQUENCES

Constellation size Scheme PMEPR

16-QAM Rößing and Tarokh [1] 3.6
16-QAM Chong et al [2]: overall, and subclasses 1 & 2 3.6, 2.0, 2.8
16-QAM Li’s modification [4] from [2] same as [2]
64-QAM Lee and Golomb [3] 4.66
64-QAM Li’s modification [4] from [3] 4.66
64-QAM Our proposed scheme 2.85

TABLE II
N UMBERS OF C ODEWORDS FOR D IFFERENT 64-QAM S CHEMES

Sequence length (2𝑚 ) Lee and Golomb [3] Li’s modification [4] from [3] Our proposed scheme
𝑚=2 31,744 46,336 16,384
𝑚=3 620,544 746,496 2,359,296
𝑚=4 11,993,088 15,040,512 603,979,776
𝑚=5 not available 3.64 × 108 2.42 × 1011
𝑚=6 not available 1.03 × 1010 1.39 × 1014
( )
𝑚>6 not available conjectured to be 𝑂(𝑚!4𝑚 𝑚2 ) 𝑂 (𝑚!)2 42𝑚

TABLE III
C ODE R ATES FOR D IFFERENT 64-QAM S CHEMES

Sequence length (2𝑚 ) Lee and Golomb [3] Li’s modification [4] from [3] Our proposed scheme
𝑚=2 3.73 3.87 3.50
𝑚=3 2.41 2.43 2.65
𝑚=4 1.47 1.49 1.82
𝑚=5 not available 0.89 1.18
𝑚=6 not available 0.52 0.73

Corollary 1: code rates in Table III. It can be observed that the number
8√ of the codewords resulting from our scheme grows rapidly as
PMEPR(𝔾) ≤ 2 + 5 ≃ 2.85. (34) 𝑚 increases, and the corresponding code rate is significantly
21
larger than those resulting from other schemes even for a very
For comparison, we list the PMEPR bounds for different small 𝑚.
OFDM QAM sequences in Table I. Li made the conjecture (conjecture 2 in [4]) that the number
of the first-order offsets (in the modified cases) is 240(𝑚 +
1)+ 4 + 2(𝑚− 2)(𝑚+ 1). Generally speaking, such offsets are
B. Code Rate
around 𝑂(𝑚2 ). It implies that the number of the codewords
We establish the following lemma for the total number of proposed by [3] is 𝑂(𝑚!4𝑚 𝑚2 ) for the sequence length 𝑛 =
codewords. 2𝑚 . Therefore, compared to the aforementioned schemes, the
Lemma 3: If 𝑛 = 2𝑚 , then number
( ) codewords brought by our scheme is ∣𝔾∣ =
of the
∣𝔾∣ ≥ 24𝑚+4 (𝑚!)2 . (35) 𝑂 (𝑚!)2 42𝑚 , which is obviously significantly larger.

(Proof.) Note that any of our 64-QAM sequences is a combi-

nation of a GCP and a GS. According to [6], we can explicitly
generate 26 ⋅22𝑚−2 ⋅𝑚!/2 GCPs and 22(𝑚+1) ⋅𝑚!/2 GSs for the
sequence length 𝑛 = 2𝑚 . Hence, the multiplication between
them yields the result. □ scheme also has the advantage of the easy sequence con-
For the 64-QAM sequences generated in [3], the number of
codewords is
(𝑚!/2)4𝑚+1 × (number of offsets),
which has been corrected by [4]. Since the number of offsets
in [3] and [4] is very complicated to express, we cannot
directly compare it with our result given by Lemma 3. Table II
demonstrates the numbers of codewords for different 64-QAM
schemes. According to Table II, we list the corresponding
C. Remarks on the Construction of Our Proposed 64-QAM
Sequences
In addition to low PMEPR and high code-rate, our proposed
struction compared to other schemes for the following reason.
In (13), each GCP ⟨𝑢⟩, ⟨𝑣⟩ and each GS ⟨𝑤⟩ correspond to
exactly one codeword (uniquely decodeable). However, for
(36)
the sequence construction methods in [3] and [4], there exist
five cases, but identical sequences could be generated from
different cases. Therefore, extra coding schemes are definitely
necessary to facilitate the uniquely-decodeable codebooks
for [3] and [4]. When 𝑚 is small, the extra coding schemes
can be carried out to spot identical codewords by performing

Authorized licensed use limited to: Jeppiaar Engineering College. Downloaded on May 01,2010 at 04:03:53 UTC from IEEE Xplore. Restrictions apply.
410
the exhaustive search, but this is impossible when 𝑚 is large.
Therefore, in order to apply the methods in [3] or [4] for
practical OFDM systems, such an extra coding scheme would
be burdensome. On the other hand, our proposed 64-QAM
sequences can be applied directly with the intrinsic unique-
decodability.
V. C ONCLUSION
In this work, we propose a new family of OFDM 64-
QAM sequences which achieve the lowest peak-to-mean-
envelope-power ratio (PMEPR) and the highest code-rate
compared to all other existing OFDM 64-QAM sequences, to
the best of our knowledge. The PMEPR upper-bound of our
proposed scheme is 2.85, which is a significant improvement
over other existing OFDM 64-QAM schemes with a typical
PMEPR upper-bound 4.66. Besides, our scheme can lead to
( )
𝑂 (𝑚!)2 42𝑚 codewords when the sequence length is 2𝑚 and
this number is significantly larger than 𝑂(𝑚!4𝑚 𝑚2 ) given
by [3] and [4]. In addition, our proposed scheme also has
the easy-construction advantage compared to other existing
methods. Our proposed scheme can be directly applied to
Authorized licensed use limited to: Jeppiaar Engineering College. Downloaded on May 01,2010 at 04:03:53 UTC from IEEE Xplore. Restrictions apply.
IEEE TRANSACTIONS ON COMMUNICATIONS, VOL. 58, NO. 2, FEBRUARY 2010
the practical OFDM systems because it possesses the unique-
decodability while other existing techniques do not.
R EFERENCES
[1] C. Rößing and V. Tarokh, “A construction of OFDM 16-QAM sequences
having low peak powers," IEEE Trans. Inf. Theory, vol. 47, no. 7, pp.
2091-2094, July 2001.
[2] C. V. Chong, R. Venkataramani, and V. Tarokh, “A new construction
of 16-QAM OFDM Golay complementary sequences," IEEE Trans. Inf.
Theory, vol. 49, no. 11, pp. 2953-2959, 2003.
[3] H. Lee and S. W. Golomb, “A new construction of 64-QAM Golay
complementary sequences," IEEE Trans. Inf. Theory, vol. 52, no. 4, pp.
1663-1670, 2006.
[4] Y. Li, “Comments on “A new construction of 16-QAM Golay comple-
mentary sequences" and extension for 64-QAM Golay sequences," IEEE
Trans. Inf. Theory, vol. 54, no. 7, pp. 3246-3251, 2008.
[5] K. G. Paterson, “Generalized Reed-Muller codes and power control in
OFDM modulation," IEEE Trans. Inf. Theory, vol. 46, no. 1, pp. 104-
120, 2000.
[6] J. A. Davis and J. Jedwab, “Peak-to-mean power control in OFDM,
Golay complementary sequences, and Reed-Muller codes," IEEE Trans.
Inf. Theory, vol. 45, no. 7, pp. 2397-2417, 1999.
[7] I. N. Herstein, Topics in Algebra. John Wiley & Sons, 1975.