• No results found

Golay Complementary Sequences Over the QAM Constellation

N/A
N/A
Protected

Academic year: 2020

Share "Golay Complementary Sequences Over the QAM Constellation"

Copied!
23
0
0

Loading.... (view fulltext now)

Full text

(1)

Golay Complementary Sequences Over the

QAM Constellation

Wenping Ma1Chen Yang2and Shaohui Sun3

1 National Key Lab. of ISN, Xidian University , Xi’an 710071, P.R.China

wp [email protected]

2 China Electronic Standardization Institute, Beijing 100007, P.R.China

[email protected]

3Datang Mobile Communications Equipment Co.,Lid,Beijing 100083, P.R.China

Abstract. In this paper,we present new constructions for M2 -QAM

and 2M Q-P AM Golay complementary sequences of length 2nfor inte-ger n, whereM = 2m for integer m. New decision conditions are pro-posed to judge whether the sequences with offset pairs propro-posed by Ying Li are Golay complementary, and with the new decision conditions, we prove the conjecture 1 and point out some drawbacks in conjecture 2 proposed by Ying Li. We describe a new offset pairs and construct new 64-QAM Golay sequences based on this new offset pairs. We also study the 128-QAM Golay complementary sequences, and propose a new de-cision condition to judge whether the sequences are 128-QAM Golay complementary.

Index Terms: Golay Complementary Sequences, Quadrature Ampli-tude Modulation(QAM), Orthogonal Frequency Division Multiplexing (OF DM), Quadrature Pulse Amplitude Modulation (Q-P AM).

1

Introduction

Complementary binary sequences were first introduced by Marcel Golay [1] to study problems in infrared multislit spectrometry. Nowadays,Golay sequences have many applications in communications, including peak power control for orthogonal frequency division multiplexing(OF DM) signals, channel estimation, and complementary code-code division multiple access(CC-CDM A).

Multicarrier communications including orthogonal frequency division multi-plexing (OF DM) has been receiving increasing attention [3]. However, a major drawback toOF DMapplications is the large peak to mean envelope power ratio (P M EP R). A large peak to mean power ratio (P M EP R) brings disadvantages such as an increased complexity of the analog-to-digital and digital-to-analog converters , a reduced efficiency of the RF power amplifier, and sometimes for certain applications, like ultra-wide-band communications, the peak transmit power is limited by regulations.

(2)

J.A.Davis and J.Jedwab[2] discovered an important relation between Golay se-quences and Reed-Muller codes, their method of generating binary and nonbi-nary Golay sequences is known as the GDJ construction. Davis and Jedwab made major progress in attacking the P M EP Rproblem by coding techniques; they proposed the coding scheme forOF DMtransmission for 2h-aryP SK mod-ulation to reduce the P M EP R. In 2000, V.Tarokh and H.Jafarkhani[6] intro-duced a geometric approach to the offset selection problem forP SKmodulation. In 2000, K.G.Paterson and V.Tarokh[5] found the lower bound on the achiev-able rate of a code of a given length, the minimum Euclidean distance and the maximum peak-to-average power ratio (P AP R). 1n 2001, Cornelai Robing and V.Tarokh[7] made significant progress on the construction of complementary se-quences for both amplitude and phase modulation. 1n 2003, Chan Vee Chong,R. Venkataramani, and V.Tarokh[8] explicitly constructed 16-QAM complemen-tary sequences using cosets of second order Reed-Muller codes by setting up the two coordinates. 1n 2003,B. Tarokh and H.R.Sadjadpour[9] derived the upper bound for the P EP for square M-QAM Golay sequences under the assump-tion that all the symbols are equiprobable. 1n 2006, Heekwan Lee and Solomon W.Golomb extended the constructions of 16-QAMGolay sequences to 64-QAM

constellation using the offsets discovered in [10]. 1n 2008, M. Anand and P. Vijay Kumar[11] studied the low correlation sequences over the QAM constellation. In 2008, Ying Li [15, 16] gave some corrections for the sequence pairing descrip-tions of 16-QAM and 64-QAM, he proposed two conjectures to describe the new offset pairs and enumerate all known first order offset pairs.

In this paper, we extend the constructions of 16-QAM Golay sequences and 64-QAM Golay sequences to M2-QAM constellations and 2M Q-P AM

con-stellations using the offsets discovered in [7, 10]. We study the 64-QAM Golay sequences using the offsets discovered in [16], propose two sufficient conditions to judge whether the sequences are Golay complementary sequences,and as a result, we prove the conjectures in [16]. A new Golay complementary sequence constructed by new offset pairs is described in this paper. We also give a suffi-cient condition to judge whether a sequence over 128-QAM using the offsets in [16] is Golay complementary.

2

The Golay Complementary Sequences over

M

2

-

QAM

constellation

TheM2-QAM constellation is the set

{a+bj| −M+ 1≤a, b≤M−1, a, b odd}.

WhereM = 2m,this constellation can alternately be described as

{p2j( mX1

k=0

2kjak)|a

(3)

Where by2jwe mean the element 1 +j. We now present new constructions of

M2-QAM Golay sequences that is similar to that of 16-QAM Golay sequences

and 64-QAM Golay sequences as derived in [7, 10].

Theorem 1. Let A(x) = 2Pkn=11(k)(k+1)+

Pn

k=1ckxk+c,

a(k)(x) =A(x) +s(k)(x),

b(k)(x) =A(x) +s(k)(x) +µ(x).

Whereck∈Z4,k= 0,1,· · · , m−1,c∈Z4,πis a permutation from{1,2,· · · , n}

to{1,2,· · ·, n} ,s(k)(x)andµ(x)satify the following cases.

Case 1:s(k)=d(k) 0 +d

(k) 1 (1),

µ(x) = 2(n).

Case 2:s(k)(x) =d(k)

0 +d(1k)(n),

µ(x) = 2(1).

Case 3:s(k)=d(k) 0 +d

(k)

1 (ω)+d(2k)(ω+1),1≤ω≤n−1,

2d(0k)+d1(k)+d(2k)= 0,

µ(x) = 2(1) or2(n).

Whered(0k), d(1k), d2(k)∈Z4 ,k= 0,1,· · ·, m−1.

Then the M2-QAMsequences

c(x) =2j(Pkm=012kja(k)(x)

),d(x) =2j(Pmk=012kjb(k)(x)

) ,M = 2m

are Golay complementary sequences.

Proof:

Case 1: The aperiodic autocorrelation function of sequencesc(x) , where x= 0,1,· · · ,2n1,at delay shiftτ is

Cc(τ) =

P2n1τ i=0 cic∗i+τ

= 2P2i=0n−1−τ[Pmk=012k(j)a(k)(i)

][Pmk=012k(j)−a(k)(i+τ)

]

= 2{Pmk=0122kC

a(k)(τ) +

P

k,f,k6=f2k+fCa(k),a(f)(τ)}

(4)

Cd(τ) =

P2n1τ i=0 did∗i+τ

= 2{Pmk=0122kC

b(k)(τ) +

P

k,f,k6=f2k+fCb(k),b(f)(τ)}

Forτ >0,

Cc(τ) +Cd(τ) = 2{ Pm1

k=0 22k[Ca(k)(τ) +Cb(k)(τ)]

+Pk,f,k6=f2k+f[C

a(k),a(f)(τ) +Cb(k),b(f)(τ)]}

= 2Pk,f,k6=f2k+f[C

a(k),a(f)(τ) +Cb(k),b(f)(τ)]

Ca(k),a(f)(τ) +Ca(f),a(k)(τ) +Cb(k),b(f)(τ) +Cb(f),b(k)(τ)

=Pi2=0n−1−τ(j)A(i)+d(0k)+d1(k)(i)π(1)−A(i+τ)−d(0f)−d (f) 1 (i+τ)π(1)

+Pi2=0n−1−τ(j)A(i)+d(0f)+d1(f)(i)π(1)−A(i+τ)−d(0k)−d (k) 1 (i+τ)π(1)

+P2i=0n−1−τ(j)A(i)+d(0k)+d1(k)(i)π(1)+2(i)π(n)−A(i+τ)−d(0f)−d (f)

1 (i+τ)π(1)2(i+τ)π(n)

+P2i=0n−1−τ(j)A(i)+d(0f)+d1(f)(i)π(1)+2(i)π(n)−A(i+τ)−d(0k)−d (k)

1 (i+τ)π(1)2(i+τ)π(n)

=P2i=0n−1−τ(j)A(i)−A(i+τ)[(j)d0(k)+d(1k)(i)π(1)−d0(f)−d(1f)(i+τ)π(1)

+(j)d(0f)+d1(f)(i)π(1)−d(0k)−d (k)

1 (i+τ)π(1)]×[1 + (1)(i)π(n)+(i+τ)π(n)]

If (i)π(n)= (6 i+τ)π(n),then 1 + (1)(i)π(n)+(i+τ)π(n) = 0.

If (i)π(n)= (i+τ)π(n),Let ν denote the largest index for which(i)π(ν)6= (i+

τ)π(ν),then (i)π(k)= (i+τ)π(k),ν < k≤n. Let i0 andj0 denote indexes whose

binary representations differ from those of i and j only at position π(ν + 1) .

Similar to the Proof in [1], we obtain jA(i)−A(i+τ)=jA(i0)A(i0+τ)

.

Obviously,ν+ 16= 1, then

(j)d(0k)+d1(k)(i)π(1)−d(0f)−d (f)

1 (i+τ)π(1)+ (j)d(0f)+d (f)

1 (i)π(1)−d(0k)−d (k) 1 (i+τ)π(1)

= (j)d(0k)+d(1k)(i0)

π(1)−d(0f)−d (f)

1 (i0+τ)π(1)+ (j)d(0f)+d (f)

1 (i0)π(1)−d(0k)−d (k)

1 (i0+τ)π(1)

(5)

P2n1τ

i=0 (j)A(i)−A(i+τ)[(j)d (k) 0 +d

(k)

1 (i)π(1)−d(0f)−d (f) 1 (i+τ)π(1)

+(j)d(0f)+d1(f)(i)π(1)−d(0k)−d (k)

1 (i+τ)π(1)] ×[1 + (1)(i)π(n)+(i+τ)π(n)]

= 0.

We obtain,

Cc(τ) +Cd(τ) = 0

Case 2:The proof is similar to the proof in the case 1.

Case 3:In the Case 3, we haveπ(i)ν+π(i+τ)π(ν+1)= 1,

(i)π(ν+1)= (i+τ)π(ν+1)= 1(i0)π(ν+1)= 1(i0+τ)π(ν+1)

(j)d(0k)+d1(k)(i)π(ν)+d(2k)(i)π(ν+1)−d(0f)−d (f)

1 (i+τ)π(ν)−d2(f)(i+τ)π(ν+1)

+(j)d(0f)+d1(f)(i)π(ν)+d(2f)(i)π(ν+1)−d(0k)−d (k)

1 (i+τ)π(ν)−d2(k)(i+τ)π(ν+1)

= (j)d(0f)+d(1f)(i0)

π(ν)+d(2f)(i0)π(ν+1)−d(0k)−d (k)

1 (i0+τ)π(ν)−d2(k)(i0+τ)π(ν+1)

+(j)d(0k)+d(1k)(i0)

π(ν)+d(2k)(i0)π(ν+1)−d(0f)−d (f)

1 (i0+τ)π(ν)−d2(f)(i0+τ)π(ν+1)

Then, P2n1τ

i=0 (j)A(i)−A(i+τ)[1 + (1)(i)π(n)+(i+τ)π(n)]

×[(j)d(0k)+d(1k)(i)π(ν)+d(2k)(i)π(ν+1)−d(0f)−d (f)

1 (i+τ)π(ν)−d2(f)(i+τ)π(ν+1)

+(j)d(0f)+d1(f)(i)π(ν)+d(2f)(i)π(ν+1)−d(0k)−d (k)

1 (i+τ)π(ν)−d2(k)(i+τ)π(ν+1)]

= 0

thus, they are also complementary sequences.

3

The Golay Complementary Sequences over

Q

-

P AM

constellation

The class ofQ-P AM constellation considered in this paper is the subset of the

M2-QAM constellation of size 2M = 2m+1 having representation

{√2j(ja0+Pm−1

(6)

These representations suggest that quaternary sequences be used in the con-struction of Golay complementary sequences over these constellations.

Theorem 2. Let A(x) = 2Pkn=11(k)(k+1)+

Pn

k=1ckxk+c,

a(0)(x) =A(x) +s(0)(x),

b(0)(x) =A(x) +s(0)(x) +µ(x),

Whereck∈Z4,k= 0,1,· · · , m−1,c∈Z4,πis a permutation from{1,2,· · · , n}

to{1,2,· · ·, n} ,s(k)(x)andµ(x)satify the following cases.

Case 1:s(k)=d(k)

0 +d(1k)(1),

µ(x) = 2(n).

Case 2:s(k)(x) =d(k) 0 +d

(k) 1 (n),

µ(x) = 2(1).

Case 3:s(k)=d(k) 0 +d

(k)

1 (ω)+d(2k)(ω+1),1≤ω≤n−1,

2d(0)0 +d(0)1 +d(0)2 = 0, d(1k)=d(2k),

µ(x) = 2(1) or2(n).

Whered(0)0 , d(0)1 , d(0)2 ∈Z4 ,d(0k), d1(k), d(2k)∈Z2 ,k= 1,· · · , m−1.

Then the 2M-QP AM sequences

c(x) =2j(ja0(x)

+Pmk=112k(j)a0(x)+2s(k)(x)

),

d(x) =2j(jb0(x)

+Pmk=112k(j)b0(x)+2s(k)(x)

)

are Golay complementary sequences.

The proof is similar to the proof in the theorem 1, we omit it.

Example 1:The 8-aryQ-P AM constellation is a subset of the 16-QAM con-stellation given by

{√2j(ja0+ 2ja0+2a1)|a

0∈Z4, a1∈Z2}

Then as discussed above, let a0 = f(x1, x2, x3) = x1x2+x2x3 , a1 = 1 +x3

(7)

−√2j,−√2j,−√2j,√2j,32j,32j,−32j,32j,

−√2j,√2j,−√2j,−√2j,32j,−32j,−32j,−32j.

4

Golay Complementary Sequences over 64-

QAM

Using

Offset Pairs Proposed By Ying Li

Based on offset pairs proposed by Ying Li[16], he proposed two constructions called modified case 4 and modified case 5 respectively, based on the construc-tions, he also proposed two conjectures. Now we study the constructions and prove the conjectures. We rewrite original modified case 4 and modified case 5 in[16] as case 4 and case 5 in this paper.

Case 4:LetA(x) = 2Pnk=11(k)(k+1)+

Pn

k=1ckxk+c,

a1(x) =A(x) +s(1)(x),

a2(x) =A(x) +s(2)(x),

B(x) =A(x) +µ(x),

b1(x) =a1(x) +µ(x),

b2(x) =a2(x) +µ(x),

(s(1)(x), s(2)(x)) = (d

0+d1(ω), d00+d01(ω)), with 2≤ω≤n−1.

µ(x) = 2(1) or 2(n),

c(x) = 4jA(x)+ 2ja1(x)+ja2(x), d(x) = 4jB(x)+ 2jb1(x)+jb2(x),

Then,

Cc(τ) =

P2n1τ i=0 cic∗i+τ

=P2i=0n−1−τ(8jA(i)−A(i+τ)+ 4ja1(i)−a1(i)−a1(i+τ)+ja2(i)−a2(i+τ))

+Pi2=0n−1−τ2[4(jA(i)−a1(i+τ)+ja1(i)−A(i+τ))

+2(jA(i)−a2(i+τ)+ja2(i)−A(i+τ)) + (ja1(i)−a2(i+τ)+ja2(i)−a1(i+τ))]

Cd(τ) =

(8)

=P2i=0n−1−τ(8jB(i)−B(i+τ)+ 4jb1(i)−b1(i+τ)+jb2(i)−b2(i+τ))

+P2i=0n−1−τ2[4(jB(i)−b1(i+τ)+jb1(i)−B(i+τ))+2(jB(i)−b2(i+τ)+jb2(i)−B(i+τ))+

(jb2(i)−b1(i+τ)+jb1(i)−b2(i+τ))]

The following three equations can be verified easily. P2n1τ

i=0 (jA(i)−a1(i+τ)+ja1(i)−A(i+τ)+jB(i)−b1(i+τ)+jb1(i)−B(i+τ)) (1)

=P2i=0n−1−τ[jA(i)−A(i+τ)−d0−d1(i+τ)π(ω)+jA(i)−A(i+τ)−d0−d1(i+τ)π(ω)+2(i)π(1)2(i+τ)π(1)]

+Pi2=0n−1−τ[j−A(i+τ)+A(i)+d0+d1(i)π(ω)+j−A(i+τ)+A(i)+d0+d1(i)π(ω)+2(i)π(1)2(i+τ)π(1)]

=P2i=0n−1−τjA(i+τ)+A(i)[jd0+d1(i)π(ω)+j−d0−d1(i+τ)π(ω)][1 + (1)(1)+(i+τ)π(1)]

P2n1τ

i=0 (jA(i)−a2(i+τ)+ja2(i)−A(i+τ)+jB(i)−b2(i+τ)+jb2(i)−B(i+τ)) (2)

=P2i=0n−1−τ[jA(i)−A(i+τ)−d0

0−d01(i+τ)π(ω)+jA(i)−A(i+τ)−d00−d01(i+τ)π(ω)+2(i)π(1)2(i+τ)π(1)]

+P2i=0n−1−τ[j−A(i+τ)+A(i)+d0

0+d01(i)π(ω)+j−A(i+τ)+A(i)+d00+d01(i)π(ω)+2(i)π(1)2(i+τ)π(1)]

=P2i=0n−1−τjA(i+τ)+A(i)[jd0

0+d01(i)π(ω)+j−d00−d01(i+τ)π(ω)][1 + (1)(1)+(i+τ)π(1)]

P2n1τ

i=0 (ja1(i)−a2(i+τ)+ja2(i)−a1(i+τ)+jb2(i)−b1(i+τ)+jb1(i)−b2(i+τ)) (3)

=P2i=0n−1−τ[jA(i)+d0+d1(i)π(ω)−A(i+τ)−d00+d01(i+τ)π(ω)

+jA(i)+d0+d1(i)π(ω)−A(i+τ)−d00−d01(i+τ)π(ω)+2(i)π(1)2(i+τ)π(1)]

+P2i=0n−1−τ[j−A(i+τ)−d0−d1(i+τ)π(ω)+A(i)+d00+d01(i)π(ω)

+j−A(i+τ)−d0+d1(i)π(ω)+A(i)+d00+d01(i)π(ω)+2(i)π(1)2(i+τ)π(1)]

=P2i=0n−1−τjA(i+τ)+A(i)[jd0

0+d01(i)π(ω)−d0−d1(i+τ)π(ω)+j−d00−d01(i+τ)π(ω)+d0+d1(i)π(ω)]

×[1 + (1)(1)+(i+τ)π(1)]

Thus we obtain the following equation

4×(1) + 2×(2) + (3)

(9)

+2(jA(i)−a2(i+τ)+ja2(i)−A(i+τ)+jB(i)−b2(i+τ)+jb2(i)−B(i+τ))

+(ja1(i)−a2(i+τ)+ja2(i)−a1(i+τ)+jb2(i)−b1(i+τ)+jb1(i)−b2(i+τ))]

=Pi2=0n−1−τjA(i+τ)+A(i)Q(i)[1 + (1)(1)+(i+τ)π(1)]

WhereQ(i) = 4(jd0+d1(i)π(ω)+j−d0−d1(i+π)π(ω))+2(jd00+d01(i)π(ω)+j−d00−d01(i+π)π(ω))

+(jd0

0+d01(i)π(ω)−d0−d1(i+τ)π(ω)+j−d00−d01(i+τ)π(ω)+d0+d1(i)π(ω))

Similar to the proof of theorem 1, we set (i)π(ω) = (i +τ)π(ω) = 0 , then

the above equation is

4(jd0+j−d0) + 2(jd00+j−d00) + (jd00−d0+j−d00+d0),

and set (i)π(ω)= (i+τ)π(ω)= 1 , then the above equation is

4(jd0+d1+j−d0−d1) + 2(jd00+d01+j−d00−d10) + (jd00+d01−d0−d1+j−d00−d01+d0+d1),

thenc(x) andd(x) are Golay complementary pair if

4(jd0+j−d0) + 2(jd00+j−d00) + (jd00−d0+j−d00+d0),

(4) = 4(jd0+d1+j−d0−d1) + 2(jd00+d01+j−d00−d10) + (jd00+d01−d0−d1+j−d00−d01+d0+d1),

By exhaust search, there are 32 sets of (d0, d1, d00, d01) satisfying the above equation(4),

and the four sets{(0123),(0321),(1311),(3133)}proposed by Ying Li in [16] also satisfy the equation.

Case 5:LetA(x) = 2Pnk=11(k)(k+1)+

Pn

k=1ckxk+c,

a1(x) =A(x) +s(1)(x),

a2(x) =A(x) +s(2)(x),

B(x) =A(x) +µ(x),

b1(x) =a1(x) +µ(x),

b2(x) =a2(x) +µ(x),

(s(1)(x), s(2)(x)) = (d

0+d1(ω)+d2(k), d00 +d01(ω)+d02(k)),

(10)

µ(x) = 2(1) or 2(n),

c(x) = 4jA(x)+ 2ja1(x)+ja2(x), d(x) = 4jB(x)+ 2jb1(x)+jb2(x).

It is easy to check the following three equations hold. P2n1τ

i=0 (jA(i)−a1(i+τ)+ja1(i)−A(i+τ)+jB(i)−b1(i+τ)+jb1(i)−B(i+τ))

=Pi2=0n−1−τjA(i)−A(i+τ)[1 + (1)(1)(i+τ)π(1)]

×[jd0+d1(i)π(ω)+d2(i)π(k)+j−d0−d1(i+τ)π(ω)−d2(i+τ)π(k)]

P2n1τ

i=0 (jA(i)−a2(i+τ)+ja2(i)−A(i+τ)+jB(i)−b2(i+τ)+jb2(i)−B(i+τ))

=Pi2=0n−1−τjA(i)−A(i+τ)[1 + (1)(1)(i+τ)π(1)]

×[jd0

0+d01(i)π(ω)+d02(i)π(k)+j−d00−d01(i+τ)π(ω)−d02(i+τ)π(k)]

P2n1τ

i=0 (ja1(i)−a2(i+τ)+ja2(i)−a1(i+τ)+jb2(i)−b1(i+τ)+jb1(i)−b2(i+τ))

=Pi2=0n−1−τjA(i)−A(i+τ)[1 + (1)(1)(i+τ)π(1)]×

[jd0

0+d01(i)π(ω)+d02(i)π(k)−d0−d1(i+τ)π(ω)−d2(i+τ)π(k)

+jd0+d1(i)π(ω)+d2(i)π(k)−d00−d01(i+τ)π(ω)−d02(i+τ)π(k)]

then as in case 4, we obtain c(x) and d(x) are Golay complementary pair if the following conditions hold.

4(jd0+d1+d2y+j−d0−d1−d2z) + 2(jd00+d01+d02y+j−d00−d01−d02z)

+(jd0

0+d01+d02y−d0−d1−d2z+jd0+d1+d2y−d00−d01−d02z)

= 4(jd0+d2y+j−d0−d2z)+2(jd00+d02y+j−d00−d20z)+(jd00+d02y−d0−d2z+jd0+d2y−d00−d02z) (5)

4(jd0+d1y+j−d0−d1z) + 2(jd00+d01y+j−d00−d01z)

+(jd0

0+d01y−d0−d1z+jd0+d1y−d00−d01z)

= 4(jd0+d1y+d2+j−d0−d1z−d2)+2(jd00+d01y+d02+j−d00−d01z−d02) (6)

+(jd0

0+d01y+d02−d0−d1z−d2+jd0+d1y+d2−d00−d01z−d02)

(11)

By exhaust search, there are 52 sets of (d0, d1, d2, d00, d01, d02) satisfying the above

equation(5)and equation (6), and the four sets{(013231),(031213),(133111),

(311333)}proposed by Ying Li in[16] also satisfy the equations.

In the paper[16], the author asserted that there only exist four sets of coeffi-cients for the case 4 and case 5 respectively, but, based on the proposed judgment conditions above, we find there are 32 sets of coefficients for the case 4 and 52 sets of coefficients for the case 5 using exhaust search. We provide these detail materials in the appendix 1 and appendix 2 respectively.

Due to the discussion above, we have proved the conjecture 1 proposed in[16]by Ying Li. Because the conjecture 2 is based on conjecture 1 and there are some drawbacks existing in counting the set elements, some drawbacks can be found in conjecture 2.

Here, we extend the method proposed by Ying Li and introduce a new case called case 6 as follows:

Case 6:LetA(x) = 2Pnk=11(k)(k+1)+

Pn

k=1ckxk+c,

a1(x) =A(x) +s(1)(x),

a2(x) =A(x) +s(2)(x),

B(x) =A(x) +µ(x),

b1(x) =a1(x) +µ(x),

b2(x) =a2(x) +µ(x),

(s(1)(x), s(2)(x)) =

(d0+d1(ω)+d2(k)+d3(l), d00 +d01(ω)+d02(k)+d03(l)),

with 2≤ω≤n−4 ,ω+ 2≤k≤n−2 ,k+ 2≤l≤n.

µ(x) = 2(1) or 2(n),

c(x) = 4jA(x)+ 2ja1(x)+ja2(x), d(x) = 4jB(x)+ 2jb1(x)+jb2(x).

It is easy to check the following three equations hold. P2n1τ

i=0 (jA(i)−a1(i+τ)+ja1(i)−A(i+τ)+jB(i)−b1(i+τ)+jb1(i)−B(i+τ))

=Pi2=0n−1−τjA(i)−A(i+τ)[1 + (1)(1)(i+τ)π(1)]×

(12)

P2n1τ

i=0 (jA(i)−a2(i+τ)+ja2(i)−A(i+τ)+jB(i)−b2(i+τ)+jb2(i)−B(i+τ))

=Pi2=0n−1−τjA(i)−A(i+τ)[1 + (1)(1)(i+τ)π(1)]×

[jd0

0+d01(i)π(ω)+d02(i)π(k)+d03(i)π(l)+j−d00−d01(i+τ)π(ω)−d02(i+τ)π(k)−d03(i+τ)π(l)]

P2n1τ

i=0 (ja1(i)−a2(i+τ)+ja2(i)−a1(i+τ)+jb2(i)−b1(i+τ)+jb1(i)−b2(i+τ))

=Pi2=0n−1−τjA(i)−A(i+τ)[1 + (1)(1)(i+τ)π(1)]×

[jd0

0+d01(i)π(ω)+d02(i)π(k)+d03(i)π(l)−d0−d1(i+τ)π(ω)−d2(i+τ)π(k)−d3(i+τ)π(l)

+jd0+d1(i)π(ω)+d2(i)π(k)+d3(i)π(l)−d00−d01(i+τ)π(ω)−d02(i+τ)π(k)−d03(i+τ)π(l)]

then as in case 4, we obtain c(x) and d(x) are Golay complementary pair if the following conditions hold.

4(jd0+d2y1+d3y3+j−d0−d2y2−d3y4) + 2(jd00+d02y1+d03y3+j−d00−d02y2−d03y4)

+(jd0

0+d02y1+d03y3−d0−d2y2−d3y4+jd0+d2y1+d3y3−d00−d02y2−d03y4)

= 4(jd0+d1+d2y1+d3y3+j−d0−d1−d2y2−d3y4)+2(jd00+d01+d02y1+d03y3+j−d00−d01−d20y2−d03y4) (7)

+(jd0

0+d01+d20y1+d03y3−d0−d1−d2y2−d3y4+jd0+d1+d2y1+d3y3−d00−d01−d02y2−d03y4)

4(jd0+d1y1+d3y3+j−d0−d1y2−d3y4) + 2(jd00+d01y1+d03y3+j−d00−d01y2−d03y4)

+(jd0

0+d01y1+d03y3−d0−d1y2−d3y4+jd0+d1y1+d3y3−d00−d01y2−d03y4)

= 4(jd0+d1y1+d2+d3y3+j−d0−d1y2−d2−d3y4)+2(jd00+d01y1+d20+d03y3+j−d00−d01y2−d02−d03y4) (8)

+(jd0

0+d01y1+d02+d03y3−d0−d1y2−d2−d3y4+jd0+d1y1+d2+d3y3−d00−d01y2−d02−d03y4)

4(jd0+d1y1+d2y3+j−d0−d1y2−d2y4) + 2(jd00+d01y1+d02y3+j−d00−d01y2−d02y4)

+(jd0

0+d01y1+d02y3−d0−d1y2−d2y4+jd0+d1y1+d2y3−d00−d01y2−d02y4)

= 4(jd0+d1y1+d2y3+d3+j−d0−d1y2−d2y4−d3)+2(jd00+d01y1+d20y3+d03+j−d00−d01y2−d02y4−d03) (9)

+(jd0

(13)

Wherey1, y2, y3, y4∈ {0,1}.

By exhaust search, there are 76 sets of (d0, d1, d2, d3, d00, d01, d02, d03) satisfying

the above equation(7),equation (8) and equation (9), please see appendix 3. Note. We can choose

(s(1)(x), s(2)(x)) =

(d0+d1(ω1)+d2(ω2)+· · ·+dlxπ(ωl), d

0

0+d01(ω1)+d

0

2(ω2)+· · ·+d

0

lxπ(ωl)),

there are somewhat difficult to obtain sufficient conditions for judging whether the sequence using above offset pairs is Golay Complementary sequence.

5

Golay Complementary Sequences over 128-

QAM

Constellation

It is easy to construct Golay complementary sequences over 128-QAM constel-lation using the offset pairs in the Case 1, Case 2 and Case 3.We consider the case 5 here.

LetA(x) = 2Pnk=11(k)(k+1)+

Pn

k=1ckxk+c,

a1(x) =A(x) +s(1)(x),

a2(x) =A(x) +s(2)(x),

a3(x) =A(x) +s(3)(x),

b1(x) =a1(x) +µ(x),

b2(x) =a2(x) +µ(x),

b3(x) =a3(x) +µ(x),

s(1)(x) =d

0+d1(ω)+d2(k),

s(2)(x) =d0

0+d01(ω)+d02(k),

s(3)(x) =d

0+d∗1(ω)+d∗2(k),

With 2≤ω≤n−2 ,ω+ 2≤k≤n.

(14)

Then the 128-QAM sequences can be constructed as follows

c(x) = 8jA(x)+ 4ja1(x)+ 2ja2(x)+ja3(x),

d(x) = 8jB(x)+ 4jb1(x)+ 2jb2(x)+jb3(x).

It is easy to check the following five equations hold. P2n1τ

i=0 (jA(i)−a1(i+τ)+ja1(i)−A(i+τ)+jB(i)−b1(i+τ)+jb1(i)−B(i+τ))

=Pi2=0n−1−τjA(i)−A(i+τ)[1 + (1)(1)(i+τ)π(1)]

[jd0+d1(i)π(ω)+d2(i)π(k)+j−d0−d1(i+τ)π(ω)−d2(i+τ)π(k)]

P2n1τ

i=0 (jA(i)−a2(i+τ)+ja2(i)−A(i+τ)+jB(i)−b2(i+τ)+jb2(i)−B(i+τ))

=Pi2=0n−1−τjA(i)−A(i+τ)[1 + (1)(1)(i+τ)π(1)]

[jd0

0+d01(i)π(ω)+d02(i)π(k)+j−d00−d01(i+τ)π(ω)−d02(i+τ)π(k)]

P2n1τ

i=0 (ja1(i)−a2(i+τ)+ja2(i)−a1(i+τ)+jb2(i)−b1(i+τ)+jb1(i)−b2(i+τ))

+P2i=0n−1−τ(jA(i)−a3(i+τ)+ja3(i)−A(i+τ)+jB(i)−b3(i+τ)+jb3(i)−B(i+τ))

=Pi2=0n−1−τjA(i)−A(i+τ)[1 + (1)(1)(i+τ)π(1)]×

[jd0

0+d01(i)π(ω)+d02(i)π(k)−d0−d1(i+τ)π(ω)−d2(i+τ)π(k)

+jd0+d1(i)π(ω)+d2(i)π(k)−d00−d01(i+τ)π(ω)−d02(i+τ)π(k)]

+Pi2=0n−1−τjA(i)−A(i+τ)[1 + (1)(1)(i+τ)π(1)]×

[jd∗

0+d∗1(i)π(ω)+d∗2(i)π(k)+j−d0∗−d∗1(i+τ)π(ω)−d∗2(i+τ)π(k)]

P2n1τ

i=0 (ja1(i)−a3(i+τ)+ja3(i)−a1(i+τ)+jb1(i)−b3(i+τ)+jb3(i)−b1(i+τ))

=Pi2=0n−1−τjA(i)−A(i+τ)[1 + (1)(1)(i+τ)π(1)]×

[jd∗

0+d∗1(i)π(ω)+d∗2(i)π(k)−d0−d1(i+τ)π(ω)−d2(i+τ)π(k)

(15)

P2n1τ

i=0 (ja2(i)−a3(i+τ)+ja3(i)−a2(i+τ)+jb2(i)−b3(i+τ)+jb3(i)−b2(i+τ))

=Pi2=0n−1−τjA(i)−A(i+τ)[1 + (1)(1)(i+τ)π(1)]×

[jd∗

0+d∗1(i)π(ω)+d∗2(i)π(k)−d00−d01(i+τ)π(ω)−d02(i+τ)π(k)

+jd0

0+d01(i)π(ω)+d02(i)π(k)−d∗0−d∗1(i+τ)π(ω)−d∗2(i+τ)π(k)]

then similar to the case 4, c(x) and d(x) are Golay complementary pair if the following conditions hold.

16(jd0+d2y+j−d0−d2z) + 8(jd00+d02y+j−d00−d02z)

+4(jd0

0+d02y−d0−d2z+jd0+d2y−d00−d02z) + 4(jd∗0+d∗2y+j−d∗0−d∗2z)

+2(jd∗

0+d∗2y−d0−d2z+jd0+d2y−d∗0−d∗2z)

+(jd∗

0+d∗2y−d00−d02z+jd00+d02y−d∗0−d∗2z)

= 16(jd0+d1+d2y+j−d0−d1−d2z)+8(jd00+d01+d02y+j−d00−d01−d02z) (10)

+4(jd0

0+d01+d02y−d0−d1−d2z+jd0+d1+d2y−d00−d01−d02z)+4(jd∗0+d∗1+d2∗y+j−d∗0−d∗1−d∗2z)

+2(jd∗

0+d∗1+d∗2y−d0−d1−d2z+jd0+d1+d2y−d0∗−d∗1−d∗2z)

+(jd∗

0+d∗1+d∗2y−d00−d01−d02z+jd00+d01+d02y−d∗0−d∗1−d∗2z)

16(jd0+d1y+j−d0−d2z) + 8(jd00+d01y+j−d00−d01z)

+4(jd0

0+d01y−d0−d1z+jd0+d1y−d00−d01z) + 4(jd∗0+d∗1y+j−d∗0−d∗1z)

+2(jd∗

0+d∗1y−d0−d1z+jd0+d1y−d∗0−d∗1z)

+(jd∗

0+d∗1y−d00−d01z+jd00+d01y−d∗0−d∗1z)

= 16(jd0+d1y+d2+j−d0−d1z−d2)+8(jd00+d01y+d02+j−d00−d01z−d02) (11)

+4(jd0

0+d01y+d20−d0−d1z−d2+jd0+d1y+d2−d00−d01z−d02)+4(jd∗0+d∗1y+d∗2+j−d∗0−d∗1z−d∗2)

+2(jd∗

0+d∗1y+d∗2−d0−d1z−d2+jd0+d1y+d2−d0∗−d∗1z−d∗2)

+(jd∗

(16)

Wherey, z∈ {0,1}.

By exhaust search, there are 260 sets of (d0, d1, d2, d00, d01, d02) satisfying the above

equation (10) and equation (11) , please see appendix 4.

6

Conlusion

We propose a new method to judge whether the sequences over theQAM con-stellation constructed using new offset pairs are Golay complementary sequences. Based on this method, we prove the conjectures[16] and find some new Golay complementary sequences over 64-QAM constellation. We propose a new offset pairs, based on the pairs, we construct new Golay complementary sequences over 64-QAMconstellation. 260 new Golay complementary sequences over 128-QAM

constellation can also be found. One can find many Golay complementary se-quences overQAM andQ−P AM constellation based on the method proposed in this paper.

7

Acknowledgment

This work was supported by National Science Foundation of China under grant No.60773002, the Project sponsored by SRF for ROCS, SEM, 863 Program (2007AA01Z472), and the 111 Project (B08038). The authors are grateful to Miss Xiao Zhang and Mr. Haolei Qin for help.

References

1. Marcel J.E.Golay, ”Complementary Series”, IRE Transactions on Information The-ory, 82-87, April, 1961.

2. J.A.Davis and J.Jedwab, ”Peak to mean power control in OFDM, Golay com-plementary sequences, and Reed Muller codes”, IEEE Trans. Inf. Theory, Vol.45, no.7,2397-2417, Nov,1999.

3. J.A.C.Bingham, ”Multicarrier modulation for data transmission: An idea whose time has come,” IEEE Commun. Mag, Vol28, 5-14, May 1990.

4. Kenneth G.Paterson, ”Generalized Reed -Muller Codes and Power Control in OFDM Modulation’, IEEE Transactions of Information Theory, Vol.46, No.1, 104-120, January, 2000 .

5. K.G.Paterson and V. Tarokh, ” On the existence and construction of good codes with low peak to average ratios,” IEEE Trans. Inf. Theory, Vol.46, No.6, 1974-1987, Sep.2000.

(17)

7. Cornelia Roring and Vahid Tarokh, ”A Construction of OFDM 16-QAM Sequences Having Low Peak Powers”, IEEE Transactions of Information Theory, Vol.47, No.5, 2091-2094, July,2001.

8. Chan Vee Chong, Raman Venkataramani, and Vahid Tarokh, ” A New Construc-tion 16-QAM Golay Complementary sequences”, IEEE TransacConstruc-tions of InformaConstruc-tion Theory, Vol.49, No.11, 2953-2959, November,2003.

9. B. Tarokh and H.R.Sadjadpour,”Construction of OFDM M-QAM sequences with low peak -to average power ratio,” in Proc. Conf. Information Science and Systems, Baltimore,MD, Mar.2003.

10. Heekwan Lee and Solomon W.Golomb, ”A New Construction of 64-QAM Go-lay Complementary sequences”, IEEE Transactions of Information Theory, Vol.52, No.4, 1663-1670, July,2006.

11. M.Anand,P.Vijay Kumar, ” Low Correlation Sequences Over the QAM Constella-tion”, IEEE Transactions on Information Theory, Vol. 54, No.2, 791-810, February 2008.

12. Beeta Tarokh and Hamid R.Sadjadpour, ”Construction of OFDM M-QAM Se-quences with Low Peak to Average Power Ratio”, IEEE Transactions of Informa-tion Theory, Vol.51, No.1, 25-28, January,2003.

13. Kai-Uwe Schmidt, ”On Cosets of the Generalized First-Order Reed-Muller Code with Low PMEPR”, IEEE Transactions of Information Theory, Vol.52, No.7, 3220-3232, July,2006.

14. Frank Fiedler and Jonathan Jedwab, ” How Do More Golay Sequences Arise?”, IEEE Transactions of Information Theory, Vol.52, No.9, 4261-4266, July,2006. 15. Ying Li and Wen Bin Chu, ” More Golay Sequences”, IEEE Transactions of

Infor-mation Theory, Vol.51, No.3, 1141-1145, July,2001.

16. Ying Li, ”Comments on ’A New Construction of 16-QAM Golay Complementary Sequences’ and Extension for 64-QAM Golay Sequences”, IEEE Transactions of Information Theory, Vol.54, No.7, 3246-3251, July,2008.

(18)
(19)
(20)
(21)
(22)
(23)

References

Related documents

Keywords: fractional differential system; integral boundary conditions; singular problem; iterative positive solution; mixed monotone operator..

Dari hasil pengukuran diketahui nilai rata-rata harapan pelanggan yaitu sebesar 4,19 dengan nilai rata-rata aktual performance jasa yang diterima sebesar 3,53 sehingga

The third one is a lo- cal version of the nonlinear small-gain theorem also establishing the existence and boundedness properties simultaneously by still using the Schauder’s fixed

Organization charts Staffing plans Job descriptions Sewer use ordinance Overall map of system showing facilities such as pump stations, treatment plants, major gravity sewers, and

Occupation: Shadow Academy student Base: The Elysian Academy, Emerald City. From the late 1970s onwards, Preston Cutler and Josephine Sherman built their costumed-criminal

Durability of Goods: Durable goods are elastic because consumers replace them when their   price falls and postpone their purchase when price increase e.g., a consumer thinks

Trustworthy service evaluation (TSE) systems enable service providers or any third trusted authority to receive user feedback, known as service reviews or simply