# New Constructions of Complementary Sequence Pairs over 4^q-QAM

The previous constructions of quadrature amplitude modulation (QAM) Golay complementary sequences (GCSs) were generalized as 4^q-QAM GCSs of length 2^m by Li (the generalized cases I-III for q> 2) in 2010 and Liu (the generalized cases IV-V for q> 3) in 2013 respectively. Those sequences are represented as the weighted sum of q quaternary standard GCSs. In this paper, we present two new constructions for 4^q-QAM GCSs of length 2^m, where the proposed sequences are also represented as the weighted sum of q quaternary standard GCSs. It is shown that the generalized cases I-V are special cases of these two constructions. In particular, if q is a composite number, a great number of new GCSs other than the sequences in the generalized cases I-V will arise. For example, in the case q=4, the number of new GCSs is seven times more than those in the generalized cases IV-V. In the case q=6, the ratio of the number of new GCSs and the generalized cases IV-V is greater than six and will increase in proportion with m. Moreover, our proof implies all the mentioned GCSs over QAM in this paper can be regarded as projections of Golay complementary arrays of size 2×2×...×2.

There are no comments yet.

## Authors

• 17 publications
• 3 publications
• 9 publications
• ### Generalized Constructions of Complementary Sets of Sequences of Lengths Non-Power-of-Two

The construction of complementary sets (CSs) of sequences with different...
11/28/2019 ∙ by Gaoxiang Wang, et al. ∙ 0

• ### Two-Dimensional Golay Complementary Array Sets from Generalized Boolean Functions

The one-dimensional (1-D) Golay complementary set (GCS) has many well-kn...
02/08/2021 ∙ by Cheng-Yu Pai, et al. ∙ 0

• ### A New Method to Construct Gloay Complementary Set by Paraunitary Matrices and Hadamard Matrices

Golay complementary sequences have been put a high value on the applicat...
10/23/2019 ∙ by Zilong Wang, et al. ∙ 0

• ### New Construction of Complementary Sequence (or Array) Sets and Complete Complementary Codes (II)

Previously, we have presented a framework to use the para-unitary (PU) m...
10/23/2019 ∙ by Zilong Wang, et al. ∙ 0

• ### New Construction of Complementary Sequence (or Array) Sets and Complete Complementary Codes

A new method to construct q-ary complementary sequence sets (CSSs) and c...
01/12/2020 ∙ by Zilong Wang, et al. ∙ 0

• ### Symmetrical Z-Complementary Code Sets (SZCCSs) for Optimal Training in Generalized Spatial Modulation

This paper introduces a novel class of code sets, called "symmetrical Z-...
10/22/2020 ∙ by Yajing Zhou, et al. ∙ 0

• ### Maximally recoverable local reconstruction codes from subspace direct sum systems

Maximally recoverable local reconstruction codes (MR LRCs for short) hav...
11/05/2021 ∙ by Shu Liu, et al. ∙ 0

##### This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.

## 1 Introduction

A pair of sequences is called a Golay complementary pair (GCP) [11] if their aperiodic autocorrelation sums for any nonzero shifts are all equal to zero. Each sequence in the GCP is called a Golay complementary sequence (GCS). The concept of binary GCP was extended later to the polyphase case [22] and complementary sequence sets [23]. These sequences have found numerous applications in various fields of science and engineering, especially in orthogonal frequency-division multiplexing (OFDM) systems. One of the major impediments to deploying OFDM is the high peak-to-mean envelope power ratio (PMEPR) of uncoded OFDM signals. PMEPR reduction in OFDM transmission can be implemented [1][19] by using codes constructed from the sequences in the complementary sequence sets, especially GCSs.

GCPs were initially constructed by the recursive methods [11][3]. An extensive study on this topic was made by Davis and Jedwab in [7] by a direct construction of polyphase complementary sequences based on generalized Boolean functions (GBFs), which have been referred to as the standard GCSs subsequently. Non-standard GCPs were studied in [16][8][9] and complementary sequence sets were constructed in [18][21] based on GBFs later on.

All the aforementioned sequences are constructed over the phase-shift keying (PSK) constellations. Since quadrature amplitude modulation (QAM) are widely employed in high rate OFDM transmissions, -QAM sequences based on weighted quaternary PSK (QPSK) GCSs were studied by Rößing and Tarokh [20] in 2001. Chong et al. [5] then proposed a construction of 16-QAM GCSs based on standard GCSs over QPSK and first-order offsets in three cases. It was pointed out in [5] that an OFDM system with 16-QAM GCSs has a higher code rate than that with binary or quaternary standard GCSs, given the same PMEPR constraint. In 2006, Lee and Golomb [13] proposed a construction of -QAM GCSs with the weighted-sum of three standard GCSs over QPSK and first-order offsets in five cases. Further improvements of constructions of GCSs over 16-QAM and 64-QAM were given by Li et al. [14] and Chang et al. [6] later on. These results were extended to the general construction GCSs over -QAM by Li et al. [15] in 2010 and Liu et al. [17] in 2013, respectively. All these GCSs over QAM are constructed based on standard QPSK GCSs and compatible offsets. Depending on the algebraic structure of the compatible offsets, the GCSs proposed in [15] and [17] are referred to as the generalized cases I-III and the generalized cases IV-V, respectively.

In 2018, Budišin and Spasojevi [2] introduced a new recursive algorithm in multiplicative form to generate GCPs over QAM by para-unitary (PU) matrices, where any element of a sequence can be generated by indexing the entries of unitary matrices with the binary representation of the discrete time index. Sequences derived from unitary matrix over QAM constellation are referred to as the -Qum case. It is shown that the 1-Qum case and 2-Qum case can generate the sequences in the generalized cases I-III [15] and cases IV-V [17], respectively. Moreover, a large number of new GCSs over QAM are produced from the -Qum case when . For instance, the numerical results show that the overall increase in the total number of GCSs including 1-Qum and 2-Qum cases of length 1024 is up to and , for 64-, 256-, and 1024-QAM, respectively. However, for given and sequence length , the acceptable unitary matrices over QAM can be obtained only by exhaustive search, and the lack of explicit algebraic expression of GCSs leads to unexpected duplication for -Qum case when .

In this paper, we propose two new general constructions of GCSs over -QAM of length by explicit GBFs based on standard GCSs over QPSK and compatible offsets. The known generalized cases I-V in [15, 17] are special cases of our new constructions. Moreover, if is a composite number, the proposed constructions significantly increase the number of the GCSs given in [15, 17]. An example for shows that the number of new GCSs from our constructions is seven times more than that in generalized cases IV-V [17]. Another example for shows that the ratio of the number of new GCSs and the generalized cases IV-V is greater than six and will increase in proportion with . Note that the number of GCSs in generalized cases IV-V is much larger than that in cases I-III when is large.

Although the GCSs over QAM proposed in our construction are represented by explicit algebraic expression of weighted-sum of standard GCSs over QPSK, the ideas here are inspired by the para-unitary algorithm [2] and the Golay array pairs (GAPs) [10]. GAPs and their relationship with GCPs over PSK by a three-stage construction process were introduced by F. Fiedler et al. [10] in 2008. We extend this idea from PSK modulation to QAM modulation, and propose a mapping from a GAP of size to a large number of GCPs over QAM of length instead of previous three-stage construction process. We also make a connection of the construction of the GAPs and the specified PU matrices with multi-variables over -QAM. Finally, by the technique to derive GBFs from PU matrices introduced in our recent work [24], two new general constructions of GCSs over -QAM are obtained.

For the general cases I-III [15], general cases IV-V [17], and the constructions in this paper, the GCSs over -QAM of length are all expressed by the standard GCSs over QPSK and compatible offsets. If is a prime, the proposed constructions are identical to the general case I-V. However, if is a composite number, the proposed constructions comprise of not only the general case I-V, but also a great number of new GCSs. The numbers of the GCSs proposed in the general cases I-V and this paper are all equal to the product of the number of the standard GCSs over QPSK (which is determined) and the number of the compatible offsets. It has been shown that the numbers of the compatible offsets in general cases I-III and cases IV-V are linear polynomials of and quadratic polynomial of , respectively. We show that the numbers of the new compatible offsets in this paper is seven times more than that in general cases IV-V for , and is at least a cubic polynomial of for .

On the other hand, from the proof of the proposed constructions, the GCSs proposed in this paper give the explicit algebraic expressions of GCSs from the PU construction in [2] for special -Qum cases when . Moreover, our proof implies all the mentioned GCSs over QAM in this paper can be regarded as projections of Golay complementary arrays of size , so the results in this paper provide a partial solution to an open problem from [10] for GAPs of size :

How can the three-stage construction process be used to simplify or extend known results on the construction of Golay sequences in QAM modulation?

The rest of this paper is organized as follows. In the next section, we introduce the definitions of GCP and GCS, and the known constructions of the GCPs over QAM. In Section 3, we present two new general constructions of -QAM GCSs including the generalized cases I-V as special cases in Theorem 1 and 2. Enumerations of the new GCSs other than the generalized cases I-V for and are given in Section 4. The proofs of our main results are presented in the following two sections. In Section 5, we explain our main theory on GAPs, PU matrices and corresponding GBFs. What’s more, we propose the array form of our result in Theorem 5 and 6, namely -QAM GAPs based on PU matrices, from which the main result on GCSs can be derived directly. The proofs of Theorem 5 and 6 are shown in Section 6. We conclude the paper in Section 7.

## 2 Preliminary

The following notations will be used throughout the paper.

• are all positive integers, where .

• For any positive integer , is the residue class ring modulo .

• For positive integers and , define as a set and .

• is the finite field with two elements, and

is m-dimension vector space over

.

• , where each is a indeterminate for .

• is the complex field, and is the real number field.

• For any , is the conjugation of .

• is a permutation of symbols , and is a permutation of symbols .

### 2.1 Golay Complementary Pair

A complex-valued sequence of length can be expressed by a function , i.e.,

 F(y)=(F(0),F(1),⋯,F(L−1)).

The aperiodic auto-correlation of at shift () is defined by

 CF(τ)=∑yF(y+τ)⋅¯¯¯¯¯¯¯¯¯¯¯F(y),

where if or is not defined.

A pair of sequences of length is said to be Golay complementary pair (GCP) if

 CF(τ)+CG(τ)=0,(∀τ≠0). (1)

And either sequence in a GCP is called a Golay complementary sequence (GCS) [11].

### 2.2 GCPs over QPSK

A generalized Boolean function (GBF) (or over is a function from to . Such a function can be uniquely expressed as a linear combination over of the monomials

 1,x1,x2,⋯,xm,x1x2,x1x3,⋯,xm−1xm,⋯,x1x2x3⋯xm,

where the coefficient of each monomial belongs to .

For , can be written uniquely in a binary expansion as where . Then a sequence of length over QPSK can be associated with a GBF over by

 F(y)=ξf(x). (2)

where is a fourth primitive root of unity.

There are several constructions of GCPs over QPSK based on GBFs, such as [7], [16], [8] and [9]. The most typical GCPs are so called standard GCPs given in [7], which are associated with GBFs over given below.

###### Fact 1

[7] For GBF

 f(x)=2⋅m−1∑k=1xπ(k)xπ(k+1)+m∑k=1ck⋅xk+c0, (3)

where , and , the sequence pair associated with the GBFs over

 {f(x),f(x)+2xπ(1)+c′,or{f(x),f(x)+2xπ(m)+c′,

form a GCP over QPSK.

### 2.3 GCPs over QAM

In this subsection, we show some of the known results about sequence and GCPs over QAM based on the weighted sums of sequences over QPSK.

A vectorial GBF (V-GBF) is a function from to , denoted by

 →f(x)=(f(0)(x),f(1)(x),⋯,f(q−1)(x)),

where each component function is a GBF over .

A sequence over -QAM can be viewed as the weighted sums of sequences over QPSK, with weights in the ratio of . Then a sequence over -QAM of length can be associated with a V-GBF over by

 F(y)=q−1∑p=02p⋅ξf(p)(y), (4)

where and . Obviously, the sequence over QPSK can be seen as a special case of QAM sequence when .

The GCPs of length over -QAM were well studied by their associated V-GBFs in the literature. Such V-GBFs are usually given by

• standard GCSs in form (3),

• offset V-GBF ,

• paring difference V-GBF ,

or more clearly,

 {→f(x)=→1⋅f(x)+→s(x)→g(x)=→f(x)+→μ(x) (5)

where denotes the -dimension vector . The offset V-GBFs and paring difference V-GBFs proposed in the generalized cases I-III given by Li et al. [15] and the generalised cases IV-V given by Liu et al. [17] are shown below respectively.

###### Fact 2

(The generalized cases I-III [15]) form a -QAM GCP of length if the offset V-GBF and paring difference V-GBF in their associated V-GBFs satisfy one of the following cases:

1. The generalized case I:

 s(p)(x)=d(p)0+d(p)1xπ(1),1≤p≤q−1,→μ(x)=→2⋅xπ(m),
2. The generalized case II:

 s(p)(x)=d(p)0+d(p)1xπ(m),1≤p≤q−1,→μ(x)=→2⋅xπ(1),
3. The generalized case III:

 s(p)(x)=d(p)0+d(p)1xπ(ω)+d(p)2xπ(ω+1),1≤p≤q−1,

with or , , and

###### Definition 1

([17]) A complex number is called a Gaussian integer if its real and imaginary part are both integers. Define

 Q(b1,b2,…,bq−1)=2q−1+q−1∑p=12q−1−pξbp,bp∈Z4. (6)

Then a one-to-one mapping from to , which is a set consisting of Gaussian integers.

For and , a pair of distinct Gaussian integers with identical magnitude, and which are not conjugate with each other, namely:

 |Q0|=|Q1|, Q0≠Q1, and Q0≠¯¯¯¯¯¯¯Q1, (7)

is called a non-symmetrical Gaussian integer pair (NSGIP).

###### Fact 3

(The generalized cases IV-V [17]) Given a non-symmetrical Gaussian integer pair , forms a -QAM GCP of length if the offset V-GBFs and paring difference V-GBFs in their associated V-GBFs satisfy one of the following cases:

1. The generalized case IV:

 s(p)(x)=bp+(b′p−bp)xπ(ω),1≤p≤q−1,

with or , .

2. The generalized case V:

 s(p)(x)=bp+(b′p−bp)xπ(ω)+(−b′p−bp)xπ(υ),1≤p≤q−1,

with or , , .

## 3 Main Results

In this section, we will propose two new constructions of GCPs over -QAM. The generalized cases I-III [15] and generalized cases IV-V [17] are special cases of our first and second constructions, respectively. Different from the offset V-GBFs and paring difference V-GBFs shown in Fact 2 and 3, the new proposed and relate to the factorization of the integer .

###### Definition 2

Let be a factorization of , where are positive integers. For , define as sets of integers by

 Tk=(q0⋅q1⋯qk−1)⋅Zqk=(k−1∏i=0qi)⋅Zqk. (8)

For the case , the above definition is extended to . For any given permutation of symbols , we can define mappings for such that .

The rationale of the definition of is guaranteed by the following remark.

###### Remark 1

Any can be uniquely decomposed as , where . In fact, () can be uniquely determined by the following recursive formula:

 ⎧⎪ ⎪⎨⎪ ⎪⎩p0≡p(modq0),pk≡p−k−1∑i=0pi(modk∏i=0qk),1≤k≤m.

It is easy to verify .

###### Example 1

For and the factorization , we have

 k qk k−1∏i=0qi⋅Zqk Tk 0 3 Z3 {0,1,2} 1 2 3⋅Z2 {0,3} 2 1 3⋅Z1 {0} ⋮ ⋮ ⋮ ⋮ m 1 3⋅Z1 {0}

Suppose that the permutation satisfies and . For , the decomposition of () is given below:

 k Tσ(k) ρk(p) p=0 p=1 p=2 p=3 p=4 p=5 k≠ω,m {0} ρk(p) 0 0 0 0 0 0 ω {0,3} ρω(p) 0 0 0 3 3 3 m {0,1,2} ρm(p) 0 1 2 0 1 2
###### Definition 3

For , define such that . In particular, we always define .

For any , There are possible values of , which are given as follows

 (0,0,0),(0,1,3),(0,2,2),(0,3,1),(1,0,2),(1,1,1),(1,2,0),(1,3,3), (2,0,0),(2,1,3),(2,2,2),(2,3,1),(3,0,2),(3,1,1),(3,2,0),(3,3,3).

### 3.1 The First Construction

Our first construction includes the results in the generalized cases I-III in [15] as a special case.

###### Theorem 1

For any factorization and permutation , let () be mappings given in Definition 2, and () elements over given in Definition 3. Denote the vectors and respectively by

 →d1=(d(ρ0(0))1,d(ρ0(1))1,⋯,d(ρ0(q−1))1)and→d2=(d(ρm(0))2,d(ρm(1))2,⋯,d(ρm(q−1))2). (9)

Sequences over -QAM of length associated with V-GBFs in (5) form a GCP if the offset V-GBFs and paring difference V-GBFs satisfy the following conditions:

 ⎧⎪ ⎪⎨⎪ ⎪⎩s(p)(x)=m∑k=1(d(ρk(p))1+d(ρk−1(p))2)xπ(k)+m∑k=0d(ρk(p))0,→μ(x)=→2⋅xπ(1)+→d1% or→2⋅xπ(m)+→d2. (10)

The detailed proof of Theorem 1 will be given in Sections 5 and 6. We first explain the sequences in Theorem 1 by the following examples.

Let the factorization of be trivial, i.e., such that for and for . Let be the identity permutation. We have

 Tk={Zq,ifk=ω;{0},otherwise,andρk(p)={p,ifk=ω;0,otherwise.

From Definition 2, we obtain equals if , and equals otherwise. Then the offset and pairing difference set V-GBFs for different can be obtained immediately by Theorem 1.

• If , i.e., , then and We have

 {s(p)(x)=d(p)0+d(p)2xπ(1),→μ(x)=→2⋅xπ(m); (11)

or

 (12)
• If , i.e., , then and We have

 {s(p)(x)=d(p)0+d(p)1xπ(m),→μ(x)=→2⋅xπ(1); (13)

or

 (14)
• If , i.e., , then We have

 {s(p)(x)=d(p)0+d(p)1⋅xπ(ω)+d(p)2⋅xπ(ω+1),→μ(x)=→2⋅xπ(1)or→μ(x)=→2⋅xπ(m). (15)

It is obvious that the offset V-GBFs and paring difference V-GBFs shown in (11), (13), (15) agree with the generalized cases I-III in [15]. New paring difference V-GBFs shown in (12), (14) lead to new GCPs over -QAM, but they do not produce new GCSs.

Moreover, new GCPs and GCSs over QAM can be constructed from Theorem 1 if is a composite number and is a non-trivial factorization. Two examples are given below to illustrate it.

###### Example 2

For , suppose that the factorization and is the identity permutation. Then we have

 k qk k−1∏i=0qi⋅Zqk Tσ(k)=Tk 0 2 Z2 {0,1} 1 1 2⋅Z1 {0} ⋮ ⋮ ⋮ ⋮ m 2 2⋅Z2 {0,2}

From Theorem 1, the -QAM sequence pair associated with the V-GBFs

form a GCP of length , where is given in (3). Considering for , the offset and vectors are given in the table respectively:

 p ρ0(p) ρ3(p) d(ρ0(p))1 d(ρm(p))2 offset : s(p)(x) 0 0 0 d(0)1 d(0)2 0 1 1 0 d(1)1 d(0)2 d(1)2xπ(1)+d(1)0 2 0 2 d(0)1 d(2)2 d(2)1xπ(m)+d(2)0 3 1 2 d(1)2 d(2)1 d(1)2xπ(1)+d(2)1xπ(m)+d(1)0+d(2)0

where for and .

###### Example 3

For and , suppose that the factorization is given by and permutation satisfies and . Then and the decomposition of () are shown in Example 1. Notice that for . For , the offset in (10) is simplified to

 s(p)(x)=d(ρω(p))1xπ(ω)+d(ρω(p))2xπ(ω+1)+d(ρω(p))0+d(ρm(p))1xπ(m)+d(ρm(p))0, (16)

where for and , i.e.,

 p ρω(p) ρm(p) d(ρm(p))2 offset : s(p)(x) 0 0 0 d(0)2 0 1 0 1 d(1)2 d(1)1xπ(m)+d(1)0 2 0 2 d(2)2 d(2)1xπ(m)+d(2)0 3 3 0 d(0)2 d(3)1xπ(ω)+d(3)2xπ(ω+1)+d(3)0 4 3 1 d(1)2 d(3)1xπ(ω)+d(3)2xπ(ω+1)+d(3)0+d(1)1xπ(m)+d(1)0 5 3 2 d(2)2 d(3)1xπ(ω)+d(3)2xπ(ω+1)+d(3)0+d(2)1xπ(m)+d(2)0

Thus the sequence pair over -QAM associated with the V-GBFs

 ⎧⎨⎩→f(x)=→1⋅f(x)+(s(0)(x),s(1)(x),⋯,s(5)(x)),→g(x)=→f(x)+→2⋅xπ(1)or→f(x)+→2xπ(m)+→d2

form a GCP of length , where is given in (3) and vector is given in the table above.

To the best of our knowledge, the expressions of offset V-GBFs shown in the above examples have never been reported before.

### 3.2 The Second Construction

In this subsection, we slightly modify the conditions in the first construction, and obtain our second construction which include the generalized cases IV-V in [17].

###### Definition 4

Let be a factorization of , where and are positive integers. For , define as sets of integers by

 T′k=(q′⋅q0⋅q1⋯qk−1)⋅Zqk=(q′⋅k−1∏i=0qi)⋅Zqk. (17)

For the case , we extend the definition to . For any given permutation of symbols , define mappings and , such that .

Similar to the mappings in the first construction, can be uniquely decomposed as