A Review Study of Prime Period Perfect Gaussian Integer Sequences

Preprint

Article

A Review Study of Prime Period Perfect Gaussian Integer Sequences

Altmetrics

Downloads

Views

Comments

A peer-reviewed article of this preprint also exists.

Ho-Hsuan Chang^*

,Shiqi Guan,

Miaowang Zeng,Peiyao Chen

Ho-Hsuan Chang^*

,Shiqi Guan,

Miaowang Zeng,Peiyao Chen

This version is not peer-reviewed

Submitted:

16 January 2024

Posted:

16 January 2024

You are already at the latest version

Alerts

Abstract

Prime period sequences can serve as the fundamental tool to construct arbitrary composite period sequences. This is a review study of prime period perfect Gaussian integer sequence (PGIS). When cyclic group {1,2,…,N−1} can be partitioned into k cosets, where N=kf+1 is an odd prime number, the construction of a degree-(k+1) PGIS can be derived from either matching the flat magnitude spectrum criterion or making the sequence with ideal periodic autocorrelation function (PACF). This is a systematic approach of prime period N=kf+1 PGIS construction, and is applied to construct PGISs with degrees 1, 2, 3 and 5. However, for degrees larger than 3, matching either the flat magnitude spectrum or achieving the ideal PACF encounters a great challenge of solving a system of nonlinear constraint equations. To deal with this problem, the correlation and convolution operations can be applied upon PGIS of lower degrees to generate new PGIS with degree-4 and other higher degrees, e.g., 6, 7, 10, 11, 12, 14, 20 and 21 in this paper. In this convolution based scheme, both degree and pattern of a PGIS vary and can be indeterminant, which is rather nonsystematic compared with the systematic approach. The combination of systematic and nonsystematic schemes contributes the great efficiency for constructing abundant PGISs with various degrees and patterns for the associated applications.

Keywords:

Subject: Computer Science and Mathematics - Mathematics

1. Introduction

A Gaussian integer sequence (GIS) is a sequence with coefficients that are complex numbers

a + b j

, where

j = \sqrt{- 1}

and a and b are integers. The construction of perfect Gaussian integer sequence (PGIS) has become an important research topic [1,2,3,4,5,6,7,8,9,10] because integers require less memory; also, the implementation of a PGIS is simpler than those of other perfect sequences (PSs) with real or complex coefficients, in which a sequence is perfect if and only if it has an ideal periodic autocorrelation function (PACF).

By tracing the construction of PGISs, a general form of even-period PGISs was presented in [1], in which the PGISs were constructed by linearly combining four base sequences or their cyclic shift equivalents using Gaussian integer coefficients of equal magnitude. Yang et al. [2] constructed PGISs of odd prime period p by using cyclotomic classes with respect to the multiplicative group of

GF (p)

. Ma et al. [3] later presented PGISs with a period of

p (p + 2)

based on Whiteman’s generalized cyclotomy of order two over

Z_{p (p + 2)}

, where p and

(p + 2)

are twin primes. In [4], Chang et al. introduced the concept of the degree of a sequence and constructed degree-2 and degree-3 PGISs of prime period p. Then, they up-sampled these PGISs by a factor of m and filled them with new coefficients to build degree-3 and degree-4 PGISs of arbitrary composite period

N = m p

. Lee et al. focused on constructing degree-2 PGISs of various periods using two-tuple-balanced sequences and cyclic difference sets [5,6]. Algorithms that could generate PGISs of arbitrary period were developed by Pei et al. [7], and one of these algorithms could be applied to construct degree-5 PGISs of prime period

p \equiv 1 (\mod 4)

by applying the generalized Legendre sequences (GLS). A systematic method for constructing sparse PGISs in which most of the elements are zeros was proposed [8]. PGISs of period

p^{k}

with degrees equal to or less than

k + 1

and those of period

q p

with degrees equal to or larger than four were proposed in [9] and [10].

With the above mentioned significant results of theoretical PGIS study and matured construction techniques, exploring the application of PGIS gradually becomes a new research topic [11,12,13,14,15,16,17]. In [11], a PGIS was applied to OFDM systems for peak-to-average power ratio (PAPR) reduction. Subsequently, the PGIS was used to construct the transform matrix for the associated precoded OFDM systems to achieve full frequency diversity and obtain optimal bit-error rate [12]. A CDMA scheme based on PGIS, called PGIS-CDMA system, was developed by Chang [13], where a set of PGISs could substitute and outperform the PN codes (e.g., m-sequences, Gold sequences, Kasami sequences, and bent sequences) in a direct sequence (DS) CDMA system. Construction of circular convolution group based on perfect sequences for block data transmission with high diversity order appeared in [14]. New application of PGIS to cryptography refers to [15], which a hybrid public/private key cryptography scheme based on PGIS of period

N = p q

was proposed. This hybrid cryptosystem can take the advantages of public and private-key systems, and it is with implementation simplicity for easy adaptation to an IoT platform. PGIS can also be applied to construct a set of zero circular convolution (ZCC) sequences [16], which ZCC sequences featured the advantage of possessing the desired PACF and the ideal periodic crosscorrelation function (PCCF) properties. ZCC sequences could be applied for multiuser channel estimation as well as the optimal joint symbol detection and channel estimation [16,17].

Different from that of binary sequence families, there are no upper bound the available numbers of PGISs, which one can construct as many different PGISs as one would expect. We can use degree, pattern and period as three parameters to uniquely define a PGIS. From the application point of view, the available numbers of degrees and patterns of a set of PGISs are desired when the period of a this set of PGISs is fixed. For example, the capacity of a PGIS-CDMA system is determined by the number of degrees and patterns [13]. In addition, prime period PGISs can serve as the fundamental tool for constructing arbitrary composite period PGISs [4]. These two reasons stimulate us to make a review and through study of constructing prime period PGIS from both degree and pattern points of view.

To construct more degrees and patterns of different PGISs is the goal of this study, which we conclude and group the construction approaches into systematic and nonsystematic two schemes. When perfect sequences are constructed by matching the flat magnitude spectrum or the ideal PACF criterion, the pattern and degree of a sequence are determined and known in advance. For example, the construction of degree-2 and degree-3 PGISs of prime period in [4] and the construction of degree-5 PGIS adopting from the generalized Legengre sequences(GLS) by Pei et al. [7]. This is the reason this approach can be called a systematic scheme. In this approach, when the cyclotomic order is greater than 3, solving constraint equations by matching flat magnitude spectrum criterion becomes a great challenge. With this aspect, we can apply correlation and convolution operations in this study to construct degree-4 and many other degrees which belong to the set

{6, 7, 10, 11, 12, 14, 20, 21}

. However, the degree, as well as the pattern, of a PGIS constructed from taking either correlation or convolution operation between two or more PGISs might vary, and is too complicated to be analyzed systematically, which is a case by case condition. This is rather a nonsystematic scheme of PGIS construction compared with the mentioned systematic scheme. One can apply systematic scheme to construct lower degree PGISs, and then these lower degree PGISs can be applied to construct many other higher degree PGISs using nonsystematic scheme. The proposed systematic and nonsystematic schemes can be combined to construct efficiently abundant PGISs with various degrees and patterns for the associated different applications.

The structure of this paper is briefly described. Followed by depicting the properties of PGISs in Section 2, Sections from 3 to 6 present a review study of the systematic construction of general prime period PGISs of degrees 1, 2, 3 and 5, respectively. New study of PGIS construction by correlation and convolution operations is addressed in Section 7, which there exist abundant degrees and patterns to those PGISs of particular prime periods, e.g.,

N = 2^{m} - 1

and

N = \frac{p^{m} - 1}{m - 1}

, where p is an odd prime. Conclusions are summarized in Section 8.

2. Definitions and PGIS Properties

2.1. Notations

δ [τ]

is the Kronecker delta sequence of period N. The boldface character

s

denotes a sequence or a vector of period N which is expressed as

s = {s [n]}_{n = 0}^{N - 1}

, and

s_{- 1}^{*} = {s^{*} [{(- n)}_{N}]}_{n = 0}^{N - 1}

, where the superscript * and

{(\cdot)}_{N}

stand for complex conjugate and modulo N operation, respectively. Let

s^{(- m)} = {s [{(n + m)}_{N}]}_{n = 0}^{N - 1}

and

s^{(m)} = {s [{(n - m)}_{N}]}_{n = 0}^{N - 1}

denote the circular shift of

s

to the left and right, respectively, by m places, where

0 \leq m \leq N - 1

. A set of N different sequences is expressed as

{s_{m}}_{m = 0}^{N - 1}

S_{1} \circ S_{2}

denotes component-wise product between

S_{1}

and

S_{2}

2.2. Definitions

2.2.1. Degree

The degree of a sequence is defined as the number of distinct non-zero elements within one period of the sequence.

2.2.2. Pattern

The pattern of a sequence is defined as the distribution of non-zero elements within one period of the sequence.

We can demonstrate two degree-6 PGISs of period 31, which are with different pattern, as follows:

(- 3, 9, 9, 2, 9, - 2, 2, 8, 9, - 2, - 2, 2, 2, 2, 8, - 5, 9, 2, - 2, 8, - 2, 2, 2, - 5, 2, 8, 2, - 5, 8, - 5, - 5),

and

(- 9, 0, 0, 1, 0, - 1, 1, - 2, 0, - 1, - 1, 5, 1, 5, - 2, 2, 0, 1, - 1, - 2, - 1, 5, 5, 2, 1, - 2, 5, 2, - 2, 2, 2) .

Notice that since sequence and pattern are periodic with period N, thus sequence

{s [n]}

and its circular shifts

{s [{(n \pm m)}_{N}]}

in this paper are considered to be with the same pattern, so are both sequences

{c s [n]}

and

{s^{*} [n]}

. However the pattern of sequence

{s [{(- n)}_{N}]}

may not be the same as that of

{s [n]}

2.2.3. Circular convolution

The circular convolution between

s_{1} = {s_{1} [n]}_{n = 0}^{N - 1}

and

s_{2} = {s_{2} [n]}_{n = 0}^{N - 1}

, denoted by

s_{1} \otimes s_{2}

{s_{12} [n]}_{n = 0}^{N - 1}

, where

s_{12} [n]

is the nth component of

s_{1} \otimes s_{2}

, is defined as

\begin{matrix} s_{12} [n] = \sum_{τ = 0}^{N - 1} s_{1} [τ] s_{2} [{(n - τ)}_{N}], \end{matrix}

where

{(\cdot)}_{N}

denotes modulo N.

2.2.4. PACF

Let

s = {s [n]}_{n = 0}^{N - 1}

denote a sequence of period N, where

s [n]

is the nth component of

s

R_{s} \equiv s \otimes s_{- 1}^{*} = {R [τ]}_{τ = 0}^{N - 1}

denote the periodic autocorrelation function (PACF) of

s

, i.e.,

\begin{matrix} R [τ] = \sum_{n = 0}^{N - 1} s [n] s^{*} [{(n - τ)}_{N}], \end{matrix}

where

s_{- 1} = {s [{(- n)}_{N}]}_{n = 0}^{N - 1}

. Let

S = {S [n]}_{n = 0}^{N - 1}

denote the discrete Fourier transform (DFT) of

s

. Then, the DFT of

R_{s}

S \circ S^{*}

{|S|}^{2}

, where

| \cdot |

denotes the Euclidean norm. The sequence

s

is called perfect if and only if

R_{s} = E \cdot δ [τ]

, where E is energy of the sequence

s

. The DFT pair-relationship between

R_{s} = E \cdot δ [τ]

and

S \circ S^{*} = {|S|}^{2}

indicates that a sequence

s

is perfect if and only if the magnitude spectrum of

s

is flat, i.e.,

|S [n]| = \sqrt{E}, \forall 0 \leq n \leq N - 1

2.2.5. PCCF

The periodic crosscorrelation function (PCCF) between

s_{1} = {s_{1} [τ]}_{τ = 0}^{N - 1}

and

s_{2} = {s_{2} [τ]}_{τ = 0}^{N - 1}

is defined as

\begin{matrix} R_{1, 2} [τ] = \sum_{n = 0}^{N - 1} s_{1} [n] s_{2}^{*} [{(n - τ)}_{N}] . \end{matrix}

2.2.6. Coset

Let

N = K M + 1

be an odd prime number, thus

Z_{N} = {1, 2, \dots, N - 1}

is both a multiplicative group and a cyclic group [22]. If

α \in Z_{N}

is a primitive element, it follows that

α^{N - 1} = 1

. Let

H \equiv {α^{m \cdot K}}_{m = 0}^{M - 1}

and

γ \in Z_{N}

. The subset

H γ \equiv {h γ | h \in H}

is called the right coset of subgroup

H

generated by

γ

. Define

\begin{matrix} H_{k} \equiv H α^{k}, k = 0, 1, \dots, K - 1 . \end{matrix}

(1)

It is easy to shown that

H_{k}, k = 0, 1, \dots, K - 1

, are distinct right cosets of

H

, where

H = H_{0}

. It can be further shown that

Z_{N} = H_{0} \cup H_{1} \cup \dots \cup H_{K - 1}

and

| Z_{N} | = | H_{0} | + | H_{1} | + \dots + | H_{K - 1} | = K M

. It is noted that

H_{k} = H α^{k} = H α^{(k + m \cdot K)}

, where

α^{k + m \cdot K}

m = 0, 1, \dots, M - 1

, belong to the same coset.

2.3. PGIS Properties

Only parts of PGIS properties, which are related to this study, are summarized to form the following Theorem. Especially the property 7 is applied for nonsystematic PGIS construction.

Theorem 1.

Let

s = {s [n]}_{n = 0}^{N - 1}

s_{1}

and

s_{2}

be three PGISs of prime period N. The following sequences are also PGISs of period N

{s [{(n \pm m)}_{N}]}

, where m is any integer;

{c s [n]}

, where c is any nonzero Gaussian integer;

{s^{*} [n]}

, where

s^{*} [n]

denotes complex conjugation;

{S [k]}

, the DFT of

{s [n]}

, given that

{s [n]}

is with constant amplitude;

{s [{(- n)}_{N}]}

;

s_{1} \otimes s_{2}

;

{R_{1, 2} [τ]}_{τ = 0}^{N - 1}

{R_{2, 1} [τ]}_{τ = 0}^{N - 1}

{R_{1, 1} [τ]}_{τ = 0}^{N - 1}

and

{R_{2, 2} [τ]}_{τ = 0}^{N - 1}

Proof.

1). The proof of properties 1) to 6) can refer to [21] and [13].

2). To prove property 7), at first

{s_{2}^{*} [{(- τ)}_{N}]}

is also a PGIS, and it has

{R_{1, 2} [τ]}

{s_{1} [τ]} \otimes {s_{2}^{*} [{(- τ)}_{N}]}

. The convolution between

{s_{1} [τ]}

and

{s_{2}^{*} [{(- τ)}_{N}]}

two PGISs yields that

{R_{1, 2} [τ]}

is also a PGIS of period N by property 6). Similarly

{R_{2, 1} [τ]}

{s_{2} [τ]} \otimes {s_{1}^{*} [{(- τ)}_{N}]}

{R_{1, 1} [τ]}

{s_{1} [τ]} \otimes {s_{1}^{*} [{(- τ)}_{N}]}

and

{R_{2, 2} [τ]}

{s_{2} [τ]} \otimes {s_{2}^{*} [{(- τ)}_{N}]}

are also PGISs of period N as well. □

When the degree of sequence is a great concern, one can apply the cyclotomic class for constructing systematically PS and PSIS according to following Theorem.

Theorem 2.

Let a cyclic group

Z_{N} = {1, 2, \dots, N - 1}

be partitioned into K cosets, where each coset contains M elements and

N = 1 + K M

. Let

c_{1}

c_{2}

, …,

c_{F}

be all the F positive factors of

N - 1

. There exist

F + 1

classes of PSs of period N with degrees 1,

1 + \frac{N - 1}{c_{1}}

1 + \frac{N - 1}{c_{2}}

, …,

1 + \frac{N - 1}{c_{F}}

, respectively. It is noted that

K \in {\frac{N - 1}{c_{1}}, \frac{N - 1}{c_{2}}, \dots, \frac{N - 1}{c_{F}}}

Proof.

Referred to [18]. □

Consider the case of

N = 13

, where the six positive factors of

N - 1 = 12

are 1, 2, 3, 4, 6 and 12, respectively. Therefore, the corresponding degrees of the PSs or PGISs are given by 13, 7, 5, 4, 3, and 2, respectively. We would like to mention that Theorem 2 can ensure the existence of six patterns of PSs with period

N = 13

, however it is challenging to construct PGISs of these six patterns where the coefficients of these sequences should be Gaussian integer numbers.

3. Unique Degree-1 PGIS

To encompass a broader scope of sequence degree, a particular degree-1 PGIS, which is originated from Kronecker delta sequence

δ [τ]

, is addressed in this section.

Theorem 3.

For any nonzero Gaussian integer a, sequence

s = (a, \underset{N - 1}{\underset{︸}{0, \dots, 0}})

and all

N - 1

other circular shifts of

s

, with notation

s^{(n)}

, are the only existing degree-1 PGISs of period N. In other words,

(a, 0, \dots, 0)

is the unique pattern of degree-1 PGIS.

Proof.

At first, the number of different nonzero elements for degree-1 PGIS is one. The DFT of

s = (a, \underset{N - 1}{\underset{︸}{0, \dots, 0}})

S = (a, \underset{N - 1}{\underset{︸}{a, \dots, a}})

, which

S

meets the flat magnitude spectrum criterion for sequence

s

to be a PGIS. Let

s^{(n)} = (\underset{n}{\underset{︸}{0, \dots, 0}}, a, \underset{N - n - 1}{\underset{︸}{0, \dots, 0}})

be the n-shift of

s

. The DFT of

s^{(n)}

S^{(n)} = {\{a e^{- j \frac{2 π n m}{N}}\}}_{m = 0}^{N - 1}

, where

|a e^{- j \frac{2 π n m}{N}}| = | a |, \forall m

. This infers that

s^{(n)}

is a degree-1 PGIS, and this is valid to all

n = 1, \dots, N - 1

When there exist 2 “a" elements in this sequence, e.g.,

s + s^{(n)}

, the DFT of sequence

s + s^{(n)}

becomes

S + S^{(n)} = {\{a (1 + e^{- j \frac{2 π n m}{N}})\}}_{m = 0}^{N - 1}

, where

|a (1 + e^{- j \frac{2 π n m}{N}})| \neq |a (1 + e^{- j \frac{2 π n k}{N}})|

0 \leq m, k \leq N - 1, m \neq k

. The flat magnitude spectrum criterion for a sequence to be perfect can not be maintained in this situation. By extending this result, when sequence exists more than two “a" elements, the DFT of this sequence becomes

{\{a (1 + \sum_{n \neq 0} e^{- j \frac{2 π n m}{N}})\}}_{m = 0}^{N - 1}

for some n, which it is straightforward that

|a (1 + \sum_{n \neq 0} e^{- j \frac{2 π n m}{N}})| \neq |a (1 + \sum_{n \neq 0} e^{- j \frac{2 π n k}{N}})|

is true,

0 \leq m, k \leq N - 1, m \neq k

. This leads conclusion that the sequence can no longer be a degree-1 PGIS when there exist two or more “a" elements. □

4. Degree-2 PGISs Consturction

Besides that of degree-2 PGISs that can be constructed using cyclotomic class the same as other degree PGISs do, many binary sequences, e.g., m-sequences and cyclic difference set, can also be adopted to construct degree-2 PGISs, where binary sequence construction is rather a matured topic with many construction schemes or algorithms [5,6,21]. This implies the more abundant patterns of degree-2 than other degrees. The significance of existence abundant sequence patterns of degree-2 PGISs has the merit that the more number of PGISs the more they can be applied to generate more new PGISs by means of taking convolution or correlation operation upon themselves. This topic of convolution technique on PGIS construction is addressed in the Section 7 of this paper.

4.1. Construction using cyclotomic class

4.1.1. Cyclotomic class of order 1

Let

N = k f + 1

be a odd prime. When

k = 1

, there is no partition the cyclic multiplicative group

Z_{N} = {1, 2, \dots, N - 1}

. In this situation, the pattern of degree-2 PGIS is

\begin{matrix} s = (a, \underset{N - 1}{\underset{︸}{b, \dots, b}}), \end{matrix}

(2)

where a and b are two nonzero Gaussian integers.

The autocorrelation function of sequence

s = (a, \underset{N - 1}{\underset{︸}{b, \dots, b}})

R [τ] = \{\begin{matrix} | a |^{2} + (N - 1) | b |^{2}, τ = 0 \\ a b^{*} + b a_{1}^{*} + (N - 2) | b |^{2}, τ \neq 0 . \end{matrix}

Constraint equation

a b^{*} + b a^{*} + (N - 2) | b |^{2} = 0

is the necessary as well as sufficient condition for sequence

s

to be a degree-2 PGIS with nonzero Gaussian integers

a = x_{1} + j y_{1}

and

b = x_{0} + j y_{0}

, which this equation can be further simplified as

\begin{matrix} 2 (x_{0} x_{1} + y_{0} y_{1}) + (N - 2) (x_{0}^{2} + y_{0}^{2}) = 0 . \end{matrix}

(3)

Example 1.

When

f = 4

and

N = 4 + 1 = 5

, Gaussian integers

a = 9 + 2 j

and

b = - 1 - 3 j

fulfill (3). A degree-2 PGIS of period 5 is given by

s = (9 + 2 j, - 1 - 3 j, - 1 - 3 j, - 1 - 3 j, - 1 - 3 j) .

4.1.2. Cyclotomic class of order 2

When k=2 and

N = 2 f + 1

is an odd prime. The cyclic group

Z_{N} = {1, 2, \dots, N - 1}

can be partitioned into two cosets

Z_{N} = H b_{0} \cup H b_{1}

, where

α^{2 f} = 1

H b_{0} = {α^{2 n}}_{n = 0}^{f - 1}

and

H b_{1} = {α^{2 n + 1}}_{n = 0}^{f - 1}

. To construct PGIS, at first, three base sequences

x_{δ}

and

x_{i} = {x_{i} [n]}_{n = 0}^{N - 1}, i = 0, 1

, are defined as follows:

\begin{matrix} x_{δ} = (1, \underset{N - 1}{\underset{︸}{0, \dots, 0}}), \end{matrix}

\begin{matrix} x_{i} [n] = \{\begin{matrix} 1, & n \in H b_{i} \\ 0, & otherwise . \end{matrix} \end{matrix}

Theorem 4.

Let

N = 2 f + 1

be an odd prime and f be an odd integer. The sequence

s = a (x_{δ} + x_{0}) + b x_{1}

with two nonzero Gaussian integers a and b is a degree-2 PGIS if the following constraint equation holds.

\begin{matrix} |a (f + 1) + b f| & = |\frac{(a - b) (1 + j \sqrt{N})}{2}| \\ = |\frac{(a - b) (1 - j \sqrt{N})}{2}| . \end{matrix}

(4)

Proof.

Referred to [4]. □

Corollary 1.

Let

N = 2 f + 1

be an odd prime and f be an odd integer. The sequence

s = b (x_{δ} + x_{1}) + a x_{0}

with two nonzero Gaussian integers a and b is a degree-2 PGIS if

\begin{matrix} |b (f + 1) + a f| & = |\frac{(b - a) (1 + j \sqrt{N})}{2}| \\ = |\frac{(b - a) (1 - j \sqrt{N})}{2}| . \end{matrix}

(5)

Proof.

The flat magnitude spectrum criterion leads to the constraint equation (5). □

Let

a = a_{R} + j a_{I}

and

b = b_{R} + j b_{I}

. The constraint equation (4) infers that the following equation should be fulfilled:

\begin{matrix} \frac{b_{R}^{2} + b_{I}^{2}}{{(a_{R} + b_{R})}^{2} + {(a_{I} + b_{I})}^{2}} = \frac{f + 1}{2} . \end{matrix}

(6)

And (5) infers that

\begin{matrix} \frac{a_{R}^{2} + a_{I}^{2}}{{(a_{R} + b_{R})}^{2} + {(a_{I} + b_{I})}^{2}} = \frac{f + 1}{2} . \end{matrix}

(7)

Example 2.

When

f = 15

and

N = 2 f + 1 = 31

, Gaussian integers

a = - 5

and

b = 6 + 2 j

fulfill (6). A degree-2 PGIS of period 31 is given by

\begin{matrix} s = (a, a, a, b, a, a, b, a, a, a, a, b, b, b, a, b, a, b, a, a, a, b, b, b, b, a, b, b, a, b, b) . \end{matrix}

(8)

Example 3.

Gaussian integers

a = 2 - 6 j

and

b = - 3 + 4 j

can fulfill (7). A degree-2 PGIS of period 31, but with different pattern to that of (8), is

\begin{matrix} s = (b, a, a, b, a, a, b, a, a, a, a, b, b, b, a, b, a, b, a, a, a, b, b, b, b, a, b, b, a, b, b) . \end{matrix}

(9)

However, there exists no degree-2 PGIS of prime period

N = 2 f + 1

when f is an even integer, if base sequences

x_{δ}

x_{0}

and

x_{1}

are applied for sequence construction[4].

4.2. Degree-2 PGISs of arbitrary prime period

Let’s define two base sequences

x_{a}

x_{b}

as follows:

\begin{matrix} x_{a} = (1, \underset{N - 1}{\underset{︸}{1, \dots, 1}}), \end{matrix}

(10)

\begin{matrix} x_{b} = (N - 1, \underset{N - 1}{\underset{︸}{- 1, \dots, - 1}}), \end{matrix}

Base sequences

x_{a}

and

x_{b}

can be applied to construct degree-2 PGIS of prime period

N = 2 f + 1

for both even and odd f according to Theorem 5.

Theorem 5.

The sequence

s = a x_{a} + b x_{b}

with nonzero Gaussian integers a and b is a degree-2 PGIS if

|a| = |b|

Proof.

Referred to [4]. □

Above all, there exist three different sequence patterns to degree-2 PGISs of odd prime period

N = 2 f + 1

when f is odd, but there is only one pattern when f is even. However, note that any degree-2 PGISs constructed based on Theorem 5 belong to the same sequence pattern as that of (2). To explain the reason, the two base sequences that span sequence pattern in (2) are

x_{δ}

and

x_{c} = (0, \underset{N - 1}{\underset{︸}{1, \dots, 1}})

, which

{x_{δ}, x_{c}}

and

{x_{a}, x_{b}}

can span the same vector space.

From sequence application point of view, it is desirable to design as many distinct sequences as possible for a given period. There do exist many other sequence patterns to the degree-2 PGIS family of particular prime period, addressed in the following two subsections.

4.3. Degree-2 PGISs adopting from ternary perfect sequences

4.3.1. Construction based on ternary perfect sequences

Ipatov derived a large class of ternary PSs of period

N = \frac{q^{m} - 1}{q - 1}

, where m is an odd number and

q = p^{s}

, p is an odd prime and s is an integer [21,23,24]. Having with sequence elements belong to

{0, + 1, - 1}

, the ternary PSs can be adopted to obtain general degree-2 PGISs by replacing

+ 1

and

- 1

with any nonzero Gaussian integers a and

- a

, respectively. The degree-2 PGISs derived from ternary PSs may contain many zero elements. Given

q = 3

and

m = 3

, ternary PS of period

13 = \frac{3^{3} - 1}{3 - 1}

(0, 0, 1, 0, 1, 1, 1, - 1, - 1, 0, 1, - 1, 1)

, and a degree-2 PGIS of period

N = 13

is given by:

\begin{matrix} s = (0, 0, a, 0, a, a, a, - a, - a, 0, a, - a, a) . \end{matrix}

(11)

4.3.2. Construction based on CIDTS

The second type degree-2 PGISs can be built adopting from the correlation identity derived ternary sequences(CIDTS) [21]. Momentarily we present only the construction of 12 different degree-2 PGISs of prime period

N = 2^{5} - 1

based on CIDTS, which are

{t_{1}, \dots, t_{12}}

, in Table 1. The detailed construction rules of this scheme can refer to Section 7.5.

4.4. Degree-2 PGISs of prime period $2^{m} - 1$

In the case of prime period

N = 2^{m} - 1

family, there exists many sequence patterns of degree-2 PGISs. In [5], Lee et al. constructed four different kinds of degree-2 PGISs of period

N = 2^{m} - 1

from the trace representations of Legendre sequences, Hall’s sextic residue sequences, m-sequences, and GMW sequences, respectively. In addition, a new design degree-2 PGISs using cyclic difference sets can refer to [6]. Let’s present Theorem 6 before addressing the construction of degree-2 PGISs of prime period

N = 2^{m} - 1

Theorem 6.

For any prime number N, the set of quadratic residues of N forms a multiplicative group with cardinality

\frac{N - 1}{2}

Proof.

There are

\frac{N - 1}{2}

quadratic residues of prime N, which are congruent to

1^{2}, 2^{2}, \dots, \frac{N - 1}{2},

respectively. The set

Z_{N} = {1, 2, \dots, N - 1}

is a cyclic group generated by a primitive root

α

modulo N, where

α^{N - 1} = 1

, and the set

{α^{2 n}}_{n = 0}^{f - 1}

forms the subgroup of

Z_{N}

. According to Euler’s Criterion[20], when

a \equiv α^{2 n} (mod N)

, an even power of a primitive root,

a^{\frac{N - 1}{2}} \equiv 1 (mod N)

is true. This implies a is a quadratic residue modulo N. The set

{α^{2 n}}_{n = 0}^{f - 1}

and the quadratic residues of N are isomorphic between each other. This proves the quadratic residues of N forms a multiplicative group. □

4.4.1. Degree-2 PGISs from Legendre sequences

According to Theorem 6, the set of quadratic residues of prime N is isomorphic to cyclotomic class of order 2. Thus, any degree-2 PGISs of prime period

2^{m} - 1

constructed using the trace representations of Legendre sequences belong to the same sequence patterns built according to Theorem 6.

4.4.2. Degree-2 PGISs from Hall’s sextic residue sequences

In the case of prime period

N = 4 a^{2} + 27 = 6 f + 1 = 2^{m} - 1

, where a, f and m are positive integers, e.g., N=31 and N=127, there exist six different sequence patterns of degree-2 PGISs derived from the trace representation of Hall’s sextic residue sequences [5].

4.4.3. Degree-2 PGISs from m-sequences

In the case of degree-2 PGISs derived from m-sequences of period

2^{m} - 1

, the number of distinct

m -

sequence is

\frac{ϕ (2^{m} - 1)}{m}

, where

ϕ (\cdot)

is the Euler’s totient function. For example, when N=7, there exist two patterns which are the same as that of the cyclotomic class of order 2. In case of N=31, the existing six sequence patterns are the same as that based on the Hall’s sextic residue sequences [5]. There exist 18 different sequence patterns when N=127, which these patterns are different from both the Hall’s sextic residue sequences and the cyclotomic class of order 2. The more details of this topic can refer to [5].

4.4.4. Degree-2 PGISs from cyclic difference set

The TABLE II in [6] presents the cyclic difference sets

(ν, κ, λ)

of order

(κ - λ) \leq 30

, among of which the two cyclic sets that belong to the family of prime period

N = 2^{m} - 1

are

(31, 6, 1)

and

(31, 15, 7)

. The degree-2 PGIS pattern constructed using

(31, 15, 7)

belongs to one of six patterns derived from m-sequences of period

2^{5} - 1

; while a new pattern can be generated using

(31, 6, 1)

, which when

a = - j

and

b = 1 + 3 j

are applied, the degree-2 PGIS of period

N = 31

\begin{matrix} s = (a, b, a, a, a, b, a, a, a, a, a, b, a, a, a, a, a, a, a, a, a, a, a, a, b, b, a, b, a, a, a) . \end{matrix}

(12)

5. Degree-3 PGISs Consturction

5.1. Construction using cyclotomic class of order 2

Let

N = 2 f + 1

be an odd prime. When f is odd, the autocorrelation function of sequence

s = a_{2} x_{δ} + a_{0} x_{0} + a_{1} x_{1}

can be expressed as follows:

\begin{matrix} R [τ] = \{\begin{matrix} | a_{2} |^{2} + f \cdot (| a_{0} |^{2} + | a_{1} |^{2}), & τ = 0 \\ a_{2} a_{1}^{*} + a_{0} \sum_{n \in H b_{0}} s^{*} [{(n - τ)}_{N}] + a_{1} \sum_{n \in H b_{1}} s^{*} [{(n - τ)}_{N}], & τ \in H b_{0} \\ a_{2} a_{0}^{*} + a_{0} \sum_{n \in H b_{0}} s^{*} [{(n - τ)}_{N}] + a_{1} \sum_{n \in H b_{1}} s^{*} [{(n - τ)}_{N}], & τ \in H b_{1} . \end{matrix} \end{matrix}

(13)

When f is even, the autocorrelation function becomes

\begin{matrix} R [τ] = \{\begin{matrix} | a_{2} |^{2} + f \cdot (| a_{0} |^{2} + | a_{1} |^{2}), & τ = 0 \\ a_{2} a_{0}^{*} + a_{0} \sum_{n \in H b_{0}} s^{*} [{(n - τ)}_{N}] + a_{1} \sum_{n \in H b_{1}} s^{*} [{(n - τ)}_{N}], & τ \in H b_{0} \\ a_{2} a_{1}^{*} + a_{0} \sum_{n \in H b_{0}} s^{*} [{(n - τ)}_{N}] + a_{1} \sum_{n \in H b_{1}} s^{*} [{(n - τ)}_{N}], & τ \in H b_{1} . \end{matrix} \end{matrix}

(14)

Let

a_{i} = x_{i} + j y_{i}

i = 0, 1, 2

, be three nonzero different Gaussian integers. For an odd f, the necessary and sufficient conditions for sequence

s

, with its autocorrelation function defined in (13), to be a degree-3 PGIS of period

N = 2 f + 1

leads to the following linear system of two equations with variables

x_{2}

and

y_{2}

. The same equations to that of (15) are shown in [2] and [4], where the derivation of (15) in [4] is based on the frequency-domain approach.

\begin{matrix} \{\begin{matrix} y_{0} x_{1} - y_{1} x_{0} = y_{2} (x_{1} - x_{0}) + x_{2} (y_{0} - y_{1}) \\ - (Δ + x_{0} x_{1} + y_{0} y_{1}) = x_{2} (x_{1} + x_{0}) + y_{2} (y_{1} + y_{0}) \end{matrix} \end{matrix}

(15)

where

Δ = \frac{f - 1}{2} ({(x_{0} + x_{1})}^{2} + {(y_{0} + y_{1})}^{2})

. For an even f, the requirement of

{R [τ]}_{τ = 1}^{N - 1} = 0

in (14) leads to the following linear system of two equations with variables

x_{2}

and

y_{2}

. Chang et al. derived the same constraint equations as that of (16) in [4]. However, their derivation is from the frequency domain approach.

\begin{matrix} \{\begin{matrix} \frac{(x_{1}^{2} - x_{0}^{2})}{2} + \frac{(y_{1}^{2} - y_{0}^{2})}{2} = x_{2} (x_{1} - x_{0}) + y_{2} (y_{1} - y_{0}) \\ Δ_{x} + Δ_{y} = - N x_{2} (x_{1} + x_{0}) - N y_{2} (y_{1} + y_{0}) \end{matrix} \end{matrix}

(16)

where

Δ_{x} = {(x_{0} + x_{1})}^{2} f^{2} - x_{0} x_{1} - \frac{(N + 1) {(x_{0} - x_{1})}^{2}}{4}

and

Δ_{y} = {(y_{0} + y_{1})}^{2} f^{2} - y_{0} y_{1} - \frac{(N + 1) {(y_{0} - y_{1})}^{2}}{4}

In [7], Pei et al. applied Legendre sequence and Gauss sum to construct degree-3 PGISs. This approach is more efficient in deriving the coefficients of sequence to achieve ideal PACF than solving the constraint equations of (15) and (16). However, as described in Theorem 5, the sequence pattern constructed based on the Legendre sequences is the same as that based on the cyclotomic class of order 2.

5.2. Degree-3 PGISs of prime period $2^{m} - 1$

This subsection presents more sequence patterns of degree-3 PGIS of prime period

2^{m} - 1

, which are derived from taking circular convolution upon two degree-2 PGISs. We present 12 illustrative examples to demonstrate the results of circular convolution in Table 2, which the former 12 patterns are obtained from circular convolution applied to degree-2 PGISs from Table 1, and the bottom row pattern is constructed using cyclotomic class of order 2.

5.3. Construction from ternary perfect sequences

There exists also degree-3 PGIS constructed from taking circular convolution between ternary PS and degree-2 PGIS with sequence pattern

s = (a, \underset{N - 1}{\underset{︸}{b, \dots, b}})

. One more degree-3 PGIS example

s = s_{10} \otimes s_{11}

of period

N = 2^{5} - 1

is present in Table 2.

Table 1. 23 patterns of degree-2 PGISs of period 31

$PGIS$	$sequence pattern$	$coefficients$
$s_{1}$	$(a, b, b, a, b, a, a, b, b, a, a, a, a, a, b, b, b, a, a, b, a, a, a, b, a, b, a, b, b, b, b)$	$a = - 1 + 3 j, b = 4 j$
$s_{2}$	$(a, b, b, b, b, a, b, a, b, a, a, a, b, a, a, b, b, b, a, a, a, a, a, b, b, a, a, b, a, b, b)$	$s_{1}$ to $s_{6}$
$s_{3}$	$(a, b, b, a, b, b, a, a, b, b, b, b, a, b, a, a, b, a, b, a, b, b, b, a, a, a, b, a, a, a, a)$	are derived from
$s_{4}$	$(a, a, a, a, a, b, a, a, a, b, b, b, a, b, a, b, a, a, b, a, b, b, b, b, a, a, b, b, a, b, b)$	m-sequences
$s_{5}$	$(a, a, a, b, a, b, b, b, a, b, b, a, b, a, b, a, a, b, b, b, b, a, a, a, b, b, a, a, b, a, a)$
$s_{6}$	$(a, a, a, b, a, a, b, b, a, a, a, b, b, b, b, a, a, b, a, b, a, b, b, a, b, b, b, a, b, a, a)$
$s_{7}$	$(a, b, a, a, a, b, a, a, a, a, a, b, a, a, a, a, a, a, a, a, a, a, a, a, b, b, a, b, a, a, a)$	$a = - j, b = 1 + 3 j$
$s_{8}$	$(b, a, a, b, a, a, b, a, a, a, a, b, b, b, a, b, a, b, a, a, a, b, b, b, b, a, b, b, a, b, b)$	$a = 2 - 6 j$ , $b = - 3 + 4 j$
$s_{9}$	$(a, a, a, b, a, a, b, a, a, a, a, b, b, b, a, b, a, b, a, a, a, b, b, b, b, a, b, b, a, b, b)$	$a = - 5$ , $b = 6 + 2 j$
$s_{10}$	$(a, b, b, b, b, b, b, b, b, b, b, b, b, b, b, b, b, b, b, b, b, b, b, b, b, b, b, b, b, b, b)$	$a = 88 + 63 j$ , $b = - 5 + j$
$s_{11}$	$(0, 0, a, 0, b, a, a, a, b, b, 0, a, b, b, 0, b, b, a, a, a, a, a, b, a, b, a, 0, a, a, b, a)$	a is Gaussian integer and $b = - a$ ,
$t_{1}$	$(b, b, b, a, b, 0, a, a, b, 0, 0, 0, a, 0, a, 0, b, a, 0, a, 0, 0, 0, 0, a, a, 0, 0, a, 0, 0)$	$s_{11}$ is ternary sequence,
$t_{2}$	$(b, 0, 0, a, 0, a, a, 0, 0, a, a, b, a, b, 0, 0, 0, a, a, 0, a, b, b, 0, a, 0, b, 0, 0, 0, 0)$	$t_{1}$ to $t_{12}$ are CIDTS
$t_{3}$	$(b, 0, 0, b, 0, a, b, 0, 0, a, a, a, b, a, 0, 0, 0, b, a, 0, a, a, a, 0, b, 0, a, 0, 0, 0, 0)$	constructed based on m-sequences
$t_{4}$	$(b, a, a, 0, a, 0, 0, 0, a, 0, 0, a, 0, a, 0, b, a, 0, 0, 0, 0, a, a, b, 0, 0, a, b, 0, b, b)$
$t_{5}$	$(b, 0, 0, 0, 0, b, 0, a, 0, b, b, a, 0, a, a, 0, 0, 0, b, a, b, a, a, 0, 0, a, a, 0, a, 0, 0)$
$t_{6}$	$(b, 0, 0, a, 0, 0, a, a, 0, 0, 0, 0, a, 0, a, b, 0, a, 0, a, 0, 0, 0, b, a, a, 0, b, a, b, b)$
$t_{7}$	$(b, b, b, 0, b, a, 0, 0, b, a, a, 0, 0, 0, 0, a, b, 0, a, 0, a, 0, 0, a, 0, 0, 0, a, 0, a, a)$
$t_{8}$	$(b, 0, 0, 0, 0, a, 0, b, 0, a, a, a, 0, a, b, 0, 0, 0, a, b, a, a, a, 0, 0, b, a, 0, b, 0, 0)$
$t_{9}$	$(b, a, a, 0, a, b, 0, 0, a, b, b, 0, 0, 0, 0, a, a, 0, b, 0, b, 0, 0, a, 0, 0, 0, a, 0, a, a)$
$t_{10}$	$(b, 0, 0, b, 0, 0, b, a, 0, 0, 0, 0, b, 0, a, a, 0, b, 0, a, 0, 0, 0, a, b, a, 0, a, a, a, a)$
$t_{11}$	$(b, a, a, a, a, 0, a, b, a, 0, 0, 0, a, 0, b, 0, a, a, 0, b, 0, 0, 0, 0, a, b, 0, 0, b, 0, 0)$
$t_{12}$	$(b, a, a, 0, a, 0, 0, 0, a, 0, 0, b, 0, b, 0, a, a, 0, 0, 0, 0, b, b, a, 0, 0, b, a, 0, a, a)$
$s_{10}$ , $s_{8}$ and $s_{9}$ are constructed using cyclotomic class of order 1,2,2, respectively, and $s_{7}$ is from (12)

Table 2. 14 patterns of degree-3 PGISs of period 31

$PGIS$	$sequence pattern$	$coefficients$
$s_{1} \otimes s_{3}$	$(a, b, b, c, b, c, c, b, b, c, c, a, c, a, b, b, b, c, c, b, c, a, a, b, c, b, a, b, b, b, b)$	$a = 112 - 44 j, b = 16 - 16 j,$
$s_{1} \otimes s_{4}$	$(a, a, a, c, a, b, c, c, a, b, b, b, c, b, c, b, a, c, b, c, b, b, b, b, c, c, b, b, c, b, b)$	$c = - 80 + 12 j$
$s_{1} \otimes s_{5}$	$(a, c, c, b, c, b, b, b, c, b, b, c, b, c, b, a, c, b, b, b, b, c, c, a, b, b, c, a, b, a, a)$	(all $s_{i}$ are from $Table 1$ )
$s_{1} \otimes s_{6}$	$(a, b, b, a, c, b, a, b, b, c, c, c, a, c, b, b, b, a, c, b, c, c, c, b, a, b, c, b, b, b, b)$
$s_{2} \otimes s_{3}$	$(a, b, b, c, b, b, c, c, b, b, b, b, c, b, c, a, b, c, b, c, b, b, b, a, c, c, b, a, c, a, a)$
$s_{2} \otimes s_{4}$	$(a, b, b, b, b, a, b, c, b, a, a, c, b, c, c, b, b, b, a, c, a, c, c, b, b, c, c, b, c, b, b)$
$s_{2} \otimes s_{5}$	$(a, b, b, b, b, c, b, a, b, c, c, c, b, c, a, b, b, b, c, a, c, c, c, b, b, a, c, b, a, b, b)$
$s_{2} \otimes s_{6}$	$(a, a, a, b, a, c, b, b, a, c, c, b, b, b, b, c, a, b, c, b, c, b, b, c, b, b, b, c, b, c, c)$
$s_{3} \otimes s_{5}$	$(a, b, b, a, b, b, a, c, b, b, b, b, a, b, c, c, b, a, b, c, b, b, b, c, a, c, b, c, c, c, c)$
$s_{3} \otimes s_{6}$	$(a, c, c, b, c, a, b, b, c, a, a, b, b, b, b, c, c, b, a, b, a, b, b, c, b, b, b, c, b, c, c)$
$s_{4} \otimes s_{5}$	$(a, c, c, b, c, b, b, b, c, b, b, a, b, a, b, c, c, b, b, b, b, a, a, c, b, b, a, c, b, c, c)$
$s_{4} \otimes s_{6}$	$(a, c, c, c, c, b, c, a, c, b, b, b, c, b, a, b, c, c, b, a, b, b, b, b, c, a, b, b, a, b, b)$
$s_{10} \otimes s_{11}$	$(a, a, b, a, c, b, b, b, c, c, a, b, c, c, a, c, c, b, b, b, b, b, c, b, c, b, a, b, b, c, b)$	$a = - 25 - 5 j, b = 68 - 67 j,$
		$c = - 118 - 57 j$
$s_{c y}$	$(a, b, b, c, b, b, c, b, b, b, b, c, c, c, b, c, b, c, b, b, b, c, c, c, c, b, c, c, b, c, c)$	$a = - 5 - 5 j, b = 3 + 3 j,$
	(construction using cyclotomic class of order 2)	$c = - 4 - 4 j$

6. Degree-5 PGISs Consturction

6.1. PGISs construction using GLS

Though the authors in [2] did not mention the degree concept of a sequence, they did make efforts on construction the degree-5 PGIS of prime period

N = 4 f + 1

, which by using the cyclotomic class of order 4 and depending on either odd or even f, two systems of four equations were derived, respectively. However, it is still in pending situation to solve these two constraint equations from which to show the existence of prime period degree-5 PGIS. Peiet al. made a breakthrough of constructing successfully the prime period degree-5 PGIS from adopting the GLS in stead of using cyclomotic class of order 4, though they did not mention the degree-5 concept either [7]. The more detailed study of constructing degree-5 PGIS by adopting GLS is addressed in this subsection.

At first, the GLS, denoted by

g

{g [n]}_{n = 0}^{N - 1}

, is defined [20] as follows:

\begin{matrix} g [n] = \{\begin{matrix} 0, & n = 0, \\ \exp [\frac{j 2 π ({ind}_{h} n)}{N - 1}], & n \neq 0 (mod N) . \end{matrix} \end{matrix}

(17)

In (17),

{ind}_{h} n

is the index function defined by

h^{{ind}_{h} n} \equiv n (mod N) .

In a further generalization, a scaling factor,

r = 1, 2, \dots, N - 2,

can be introduced in the definition (17), yielding

\begin{matrix} g [n] = \{\begin{matrix} 0, & n = 0, \\ \exp [\frac{j 2 π r ({ind}_{h} n)}{N - 1}], & n \neq 0 (mod N) . \end{matrix} \end{matrix}

(18)

Lemma 1.

Let

N = 4 f + 1

be an prime number. In (18), when the scaling factor r=f,

g [n] \in {1, j, - 1, - j}, n \neq 0

Proof.

Inserting r=f to (18) proves the result. □

Let

{G [n]}_{n = 0}^{N - 1}

be the DFT of GLS

g

Lemma 2.

Let

N = 4 f + 1

be an prime number. In (18), when the scaling factor r=f, the magnitude spectrum of

g = {g [n]}_{n = 0}^{N - 1}

is as follows:

\begin{matrix} | G [n] | = \{\begin{matrix} 0, & n = 0, \\ \sqrt{N}, & n \neq 0 (mod N) . \end{matrix} \end{matrix}

(19)

Proof.

Referred to [20]. □

We can adopt the results of Lemmas 1 and 2 and apply base sequence

x_{a}

, defined in (10), and GLS

g

to bound the coefficients of sequences in Gaussian integers, according to Theorem 7.

Theorem 7.

Let

N = 4 f + 1

be an prime number and a is nonzero Gaussian integer. The sequence

s = a \cdot x_{a} + N \cdot g

is a degree-5 PGIS of period N given that

{| a |}^{2} = N

Proof.

When

{| a |}^{2} = N

, the magnitude spectrum of

a \cdot x_{a}

N \sqrt{N} δ [n]

. By applying the result of Lemmas 1 and 2, it is straightforward that the magnitude spectrum of

s = a \cdot x_{a} + N \cdot g

is flat, as well as,

g [n] \in {1, j, - 1, - j}

implies that the number of different Gaussian integers appeared in sequence

s

is five. This proves that

s = a \cdot x_{a} + N \cdot g

is a degree-5 PGIS. □

Example 4 and 5 present odd and even f examples of degree-5 PGIS of period

N = 4 f + 1

, respectively.

Example 4.

When

f = 3

N = 4 \cdot 3 + 1 = 13

. Let

a = 2 - 3 j

, where

{| a |}^{2} = 13

. The GLS

g = (0, 1, j, 1, - 1, j, j, - j, - j, 1, - 1, - j, - 1)

. A degree-5 PGIS

s = a \cdot x_{a} + 13 \cdot g

of period 13 is given by

\begin{matrix} s = (a, b, c, b, d, c, c, e, e, b, d, e, d), \end{matrix}

(20)

where

a = 2 - 3 j

b = 15 - 3 j

c = 2 + 10 j

d = - 11 - 3 j

, and

e = 2 - 16 j

Example 5.

When

f = 4

N = 4 \cdot 4 + 1 = 17

. Let

a = 4 + j

, where

{| a |}^{2} = 17

. The GLS

g = (0, 1, - 1, j, 1, j, - j, - j, - 1, - 1, - j, - j, j, 1, j, - 1, 1)

. A degree-5 PGIS

s = a \cdot x_{a} + 17 \cdot g

of period 17 is given by

\begin{matrix} s = (a, b, c, d, b, d, e, e, c, c, e, e, d, b, d, c, b), \end{matrix}

(21)

where

a = 4 + j

b = 21 + j

c = - 13 + j

d = 4 + 18 j

, and

e = 4 - 16 j

6.2. Degree-5 PGISs of prime period $2^{m} - 1$

Addressed in the previous subsection, degree-5 PGIS of arbitrary prime period

N = 4 f + 1

can be constructed using the GLS, where for each

N = 4 f + 1

there exist two sequence patterns associated with even and odd f, respectively. This subsection presents the creation of more sequence patterns to the degree-5 PGIS family using the CIDTS scheme [21]. However, this scheme can be applied only to particular prime period, e.g.,

N = 2^{m} - 1

. The principles of CIDTS scheme are summarized as follows:

Let

s_{b} = {s_{b} [n]}_{n = 0}^{N - 1}

and

s_{c} = {s_{c} [n]}_{n = 0}^{N - 1}

be two sequences with two-valued autocorrelation functions (ACFs), i.e.

\begin{matrix} R_{b} [τ] = \{\begin{matrix} A_{b}, & τ = 0, \\ B_{b}, & n \neq 0 \end{matrix} \end{matrix}

\begin{matrix} R_{c} [τ] = \{\begin{matrix} A_{c}, & τ = 0, \\ B_{c}, & n \neq 0 \end{matrix} \end{matrix}

The CCF between

s_{b}

and

s_{c}

\begin{matrix} R_{b, c} [τ] = \sum_{n = 0}^{N - 1} s_{b} [n] s_{c}^{*} [{(n - τ)}_{N}], \end{matrix}

The following identity is true for periodic correlation functions

\begin{matrix} \sum_{n = 0}^{N - 1} R_{b, c} [n] R_{b, c}^{*} [{(n - τ)}_{N}] = \sum_{n = 0}^{N - 1} R_{b} [n] R_{c}^{*} [{(n - τ)}_{N}] . \end{matrix}

Let

s_{a} [n] = R_{b, c} [n]

, then

s_{a} = {s_{a} [n]}_{n = 0}^{N - 1}

is a periodic sequence with two-valued ACF given by [21]

\begin{matrix} R_{a} [τ] = \sum_{n = 0}^{N - 1} R_{b, c} [n] R_{b, c}^{*} [{(n - τ)}_{N}] = \{\begin{matrix} A_{b} A_{c} + (N - 1) B_{b} B_{c}, & τ = 0, \\ A_{b} B_{c} + A_{c} B_{b} + (N - 2) B_{b} B_{c}, & n \neq 0 . \end{matrix} \end{matrix}

(22)

From (22), when both

s_{b}

and

s_{c}

are PSs, then

s_{a}

does too. Otherwise, one can still do necessary adjustment and make

s_{a}

a PS [21]. The result of (22) can be adopted to construct a degree-5 PGIS of particular prime period, e.g.,

N = 2^{m} - 1

. For

m -

sequence of period

N = 2^{5} - 1 = 31

, the six distinct

m -

sequences are

{m_{1}, \dots, m_{6}}

, which are obtained from

{s_{1}, \dots, s_{6}}

, listed in Table 1, after substituting

a = 1

and

b = - 1

, respectively. Let’s make adjustment by setting

s_{a} [n] = R_{b, c} [n] + 1

to construct three different degree-5 PGISs

s_{a}

, presented in Example 6.

Example 6.

At first, when

s_{b} = {m_{1} [n]}_{n = 0}^{N - 1}

and

s_{c} = {m_{2} [n]}_{n = 0}^{N - 1}

, by setting

{t_{13} [n]} = {\frac{R_{b, c} [n] + 1}{4}}

, a degree-5 PGIS of period 31 is

\begin{matrix} t_{13} = (3, 0, 0, 1, 0, - 1, 1, - 2, 0, - 1, - 1, 1, 1, 1, - 2, 2, 0, 1, - 1, - 2, - 1, 1, 1, 2, 1, - 2, 1, 2, - 2, 2, 2) . \end{matrix}

(23)

Secondly, when

s_{b} = {m_{3} [n]}_{n = 0}^{N - 1}

and

s_{c} = {m_{4} [n]}_{n = 0}^{N - 1}

{t_{14} [n]} = {\frac{R_{b, c} [n] + 1}{4}}

obtains

\begin{matrix} t_{14} = (3, - 2, - 2, 1, - 2, 0, 1, - 1, - 2, 0, 0, 2, 1, 2, - 1, 1, - 2, 1, 0, - 1, 0, 2, 2, 1, 1, - 1, 2, 1, - 1, 1, 1) . \end{matrix}

(24)

Finally, when

s_{b} = {m_{5} [n]}_{n = 0}^{N - 1}

and

s_{c} = {m_{6} [n]}_{n = 0}^{N - 1}

are applied, the third PGIS is

\begin{matrix} t_{15} = (3, - 1, - 1, 2, - 1, - 2, 2, 0, - 1, - 2, - 2, 1, 2, 1, 0, 1, - 1, 2, - 2, 0, - 2, 1, 1, 1, 2, 0, 1, 1, 0, 1, 1) . \end{matrix}

(25)

Since

R_{c, b} [{(- n)}_{N}] = R_{b, c} [n]

, when

R_{c, b} [n] \neq R_{b, c} [n]

, setting

t_{- a} [n]

\frac{R_{c, b} [n] + 1}{4}

will generate distinct PSIS, where

{t_{- a} [n]}

{t_{a} [{(- n)}_{N}]}

. Consequently, there exist three other patterns associated with (23)-(25), respectively.

7. PGISs Construction from Convolution and Correlation Operations

Basically there are three parts in this section. The first part consists of subsections 7.1 and 7.2, which addresses the relationship between circulant matrix and circular convolution, and explores some properties of PGISs construction from convolution. Applying cascading convolution to construct successfully the degree-4 PGIS is discussed in subsection

7.3

. The last part presents more higher degrees PGISs construction of different types, which includes subsections

7.4

7.5

and

7.6

7.1. Relationship between convolution and circulant matrix

Let’s define a circulant matrix

C

of size

N \times N

based on sequence

c = {c [n]}_{n = 0}^{N - 1}

, where the elements of

c

form the first row of

C

. With this definition,

C = {c [{(k - n)}_{N}]}

, where the

(n, k)

entry of

C

, denoted by

C_{n, k}

, is

C_{n, k} = c [{(k - n)}_{N}] .

The eigenvalues of a circulant matrix comprise the DFT of the first row of the circulant matrix, and conversely first row of a circulant matrix is the inverse DFT of the eigenvalues. In particular all circulant matrices share the same eigenvectors, ([25] and p.267, [26])

\begin{matrix} y_{m} = \frac{1}{\sqrt{N}} {[1 e^{- j 2 π m / N} \dots e^{- j 2 π m (N - 1) / N}]}^{T}, m = 0, 1, \dots, N - 1, \end{matrix}

(26)

where

{[\cdot]}^{T}

denotes transpose. Let

U

be matrix consisting of the eigenvectors

y_{m}

as columns in order and

Ψ

=diag(

ψ_{k}

) is the diagonal matrix with diagonal elements

ψ_{0}, ψ_{1}, \dots, ψ_{N - 1}

. It is true that

U U^{H}

U^{H} U = I_{N}

, where

I_{N}

is an identity matrix.

Lemma 3.

Let

C = {c [{(k - n)}_{N}]}

and

B = {b [{(k - n)}_{N}]}

be circulant

N \times N

matrices with eigenvalues

ψ_{m}

and

β_{m}

, respectively,

m = 0, 1, \dots, N - 1

, where

ψ_{m} = \sum_{k = 0}^{N - 1} c [k] e^{- j 2 π k m / N},

β_{m} = \sum_{k = 0}^{N - 1} b [k] e^{- j 2 π k m / N} .

Then

C

and

B

commute and

CB = BC = U Ω U^{H},

where Ω=diag(

ψ_{m} β_{m}

) is the diagonal matrix with diagonal elements

ψ_{0} β_{0}, ψ_{1} β_{1}, \dots, ψ_{N - 1} β_{N - 1}

{[\cdot]}^{H}

denotes transpose and conjugate operation, and

CB

is also a circulant matrix.

Proof.

Referred to [25] and [26]. □

Theorem 8.

Let

s_{1}, s_{2}, \dots, s_{k}

be k distinct PGISs of period N. Then

s = s_{1} \otimes s_{2} \otimes \dots \otimes s_{k}

is a PGIS of period N, where ⊗ denotes circular convolution. In addition,

s

is also a PGIS of period N, when any numbers of

s_{i}

are substituted by

s_{- i} = {s_{i} [{(- n)}_{N}]}

s_{- i}^{*}, i = 1, \dots, k

Proof.

At first, taking convolution upon two PGISs

s_{1} \otimes s_{2}

obtains a new PGIS, then the resultant PGIS can be convoluted with the third PGIS

s_{3}

to generate other new PGIS, etc. This leads

s

a PGIS of period N. Next, when

s_{i}

is a PGIS, both

s_{- i}

and

s_{- i}^{*}

are PGISs as well. This derives

s

is also a PGIS of period N if

s_{i}

is substituted by

s_{- i}

s_{- i}^{*}

. □

With the defined circulant matrix

C_{s_{2}} = {s_{2} [{(n - k)}_{N}]}

, which is formed based on sequence

s_{- 2} = {s_{2} [{(- n)}_{N}]}_{n = 0}^{N - 1}

, the evaluation of circular convolution between

s_{1}

and

s_{2}

, denoted by

s = s_{1} \otimes s_{2}

, can be obtained by taking the matrix multiplication operation

S = C_{s_{2}} S_{1}

instead, where

S_{1} = {[s_{1} [0] s_{1} [1] \dots s_{1} [N - 1]]}^{T}

is a

N \times 1

vector consisting of N elements from

s_{1} = {s_{1} [n]}_{n = 0}^{N - 1}

. That is, the values of N components of PGIS

s = {s [n]}_{n = 0}^{N - 1}

can be derived from the N elements of a

N \times 1

vector

S = C_{s_{2}} S_{1}

When

s = s_{1} \otimes s_{2} \otimes \dots \otimes s_{r}

s

can be derived from

S = C_{a} S_{1}

. In this expression, circulant matrix

C_{a} = C_{s_{2}} C_{s_{3}} \dots C_{s_{r}}

U Ω U^{H}

and

Ω

=diag(

ψ_{m}

) is a diagonal matrix with diagonal elements

ψ_{0}, ψ_{1}, \dots, ψ_{N - 1}

, which each eigenvalue

ψ_{m} = ψ_{m 2} ψ_{m 3} \dots ψ_{m r}

is obtained from the product of eigenvalues

ψ_{m l}

of circulant matrices

C_{s_{l}} = {s_{l} [{(n - k)}_{N}]}, l = 2, 3, \dots, r

, respectively. The properties of circulant matrix

C_{a}

may bring insight to determine the degree and pattern of PSIS

s

generated from convoluting many PGISs.

7.2. Effect of convolution on degree and pattern expansion

This subsection addresses the effectiveness of convolution operation upon two sequences can increase degree and create new pattern to the resultant sequence, which this property is described in Theorem 10. The derivation of Theorem 10 is based on Theorem 9 and Lemmas 4 and 5.

Let

H b_{0} = {α^{k n}}_{n = 0}^{f - 1}

be a subgroup of cyclic group

Z_{N} = {1, 2, \dots, N - 1}

and

b_{i} \in Z_{N}

, where

N = f k + 1

. The subset

H b_{i} = {u b_{i} | u \in H b_{0}}

is called the right coset of subgroup

H b_{0}

generated by

b_{i}

. Let

H b_{0}, H b_{1}, \dots, H b_{k - 1}

be the distinct right cosets of

H b_{0}

Z_{N}

. Then

Z_{N} = H b_{0} \cup H b_{1} \cup \dots \cup H b_{k - 1}

, which is a disjoint union and

| Z_{N} | = | H b_{0} | + | H b_{1} | + \dots + | H b_{k - 1} | = | H b_{0} | + | H b_{0} | + \dots + | H b_{0} | = k | H b_{0} | = k f

Lemma 4.

Let

l, n \in Z_{N}

, which

l \neq n

\sum_{m \in H b_{i}} e^{- j 2 π m n / N} = \sum_{m \in H b_{i}} e^{- j 2 π m l / N} \Leftrightarrow l, n \in H b_{a}

, where

H b_{a} \subset {H b_{0}, H b_{1}, \dots, H b_{k - 1}}

Proof.

Let

H b_{0} n = {u n | u \in H b_{0}}

and

H b_{0} l = {u l | u \in H b_{0}}

be two cosets of

H b_{0}

generated by n and l, respectively. If l and n belong to the same coset, which means

{u l | u \in H b_{0}} = {u n | u \in H b_{0}}

, then

m l \in {b_{i} l u | u \in H b_{0}}

and

m n \in {b_{i} l u | u \in H b_{0}}

. This implies that

m l

and

m n

belong to the same coset of

H b_{0}

generated by

b_{i} l

, denoted as

H b_{i} l

, where

H b_{i} l \subset {H b_{0}, H b_{1}, \dots, H b_{k - 1}}

. The summation of

e^{- j 2 π m n / N}

with respect to m, where m comes across the domain of one coset, results in

\sum_{m \in H b_{i}} e^{- j 2 π m n / N} = \sum_{m \in H b_{i}} e^{- j 2 π m l / N} = \sum_{m \in H b_{i} l} e^{- j 2 π m / N}

Conversely, when

l, m, n \in Z_{N}

, it is obvious that

\gcd (m n, N) = 1

and

\gcd (m l, N) = 1

. Since both

e^{- j 2 π m l / N}

and

e^{- j 2 π m n / N} \in U_{N}

, where

U_{N} = {e^{- j 2 π m / N} | m = 0, 1, \dots, N - 1}

denotes the group of Nth roots of unity, thus

l \neq n \Leftrightarrow e^{- j 2 π m l / N} \neq e^{- j 2 π m n / N}

and

\sum_{m \in H b_{i}} e^{- j 2 π m l / N} = \sum_{m \in H b_{i}} e^{- j 2 π m n / N} \Rightarrow {m l (mod N) | m \in H b_{i}} = {m n (mod N) | m \in H b_{i}}

. This infers that l and n belong to the same coset. □

Let

N = k f + 1

k^{'} f^{'} + 1

be an odd prime. The cyclic group

Z_{N} = {1, 2, \dots, N - 1}

can be partitioned either into k cosets

H b_{i}, i = 0, \dots, k - 1,

k^{'}

cosets

{H b'}_{i}, i = 0, \dots, k^{'} - 1

, respectively, where both

H b_{0}

{α^{k n}}_{n = 0}^{f - 1}

and

H b_{0}^{'}

{α^{k^{'} n}}_{n = 0}^{f^{'} - 1}

are subgroups of

Z_{N}^{*}

H b_{i}

α^{i} H b_{0}

{α^{k n + i}}_{n = 0}^{f - 1}

H b_{i}^{'}

α^{i} H b_{0}^{'}

{α^{k^{'} n + i}}_{n = 0}^{f^{'} - 1}

, and

α

is the generator of

Z_{N}

. When

k^{'} = m k

and

m \geq 2

is an integer, each

H b_{i}, i = 0, \dots, k - 1

, can be further partitioned into m cosets, e.g.,

H b_{i}

H b_{i}^{'} \cup H b_{k + i}^{'} \cup \dots \cup H b_{(m - 1) k + i}^{'}

i = 0, \dots, k - 1

, where the cardinality of all

H b_{i}, i = 0, \dots, k - 1,

is f, and that of

H b_{i}^{^{'}}, i = 0, \dots, (m k - 1),

f^{^{'}} = f / m

Let’s define two sequence sets

x_{i} = {x_{i} [n]}_{n = 0}^{N - 1},

i = 0, \dots, k - 1,

and

x_{i}^{'} = {x_{i}^{'} [n]}_{n = 0}^{N - 1},

i = 0, \dots, k^{'} - 1,

as follows:

\begin{matrix} x_{i} [n] = \{\begin{matrix} 1, & n \in H b_{i} \\ 0, & otherwise . \end{matrix} \end{matrix}

(27)

\begin{matrix} x_{i}^{'} [n] = \{\begin{matrix} 1, & n \in H b_{i}^{'} \\ 0, & otherwise . \end{matrix} \end{matrix}

(28)

The DFTs of

x_{i}

and

x_{i}^{'}

are

X_{i} = {X_{i} [n]}_{n = 0}^{N - 1}

and

X_{i}^{'} = {X_{i}^{'} [n]}_{n = 0}^{N - 1}

, respectively.

Theorem 9.

All

X_{0}, X_{1}, \dots, X_{k - 1}

are

(k + 1)

-valued, where the elements of these vectors belong to the following set

\begin{matrix} \{f, \sum_{m \in H b_{0}} e^{- j 2 π m / N}, \sum_{m \in H b_{1}} e^{- j 2 π m / N}, \dots, \sum_{m \in H b_{k - 1}} e^{- j 2 π m / N}\} . \end{matrix}

Proof.

Since

x_{i} [n] = 1, n \in H b_{i}

and

x_{i} [n] = 0, n \notin H b_{i}

, the nth element of

X_{i} = {X_{i} [n]}_{n = 0}^{N - 1}

X_{i} [n] = \sum_{m = 0}^{N - 1} x_{i} [m] e^{- j 2 π m n / N} = \sum_{m \in H b_{i}} e^{- j 2 π m n / N}

. When

n = 0

\begin{matrix} X_{i} [0] = \sum_{m \in H b_{i}} e^{- j 2 π m n / N} |_{n = 0} = | H b_{i} | = f . \end{matrix}

Given that

m \in H b_{i}

, it has

m Z_{N} = {m, 2 m, \dots, (N - 1) m}

and

m Z_{N} (mod N) = Z_{N}

, In other words,

m Z_{N} = Z_{N}

modulo N. Both

m Z_{N}

and

Z_{N}

have the same partition, which means

m Z_{N} = {H b_{0} \cup H b_{1} \cup \dots \cup H b_{k - 1}}

modulo N. Based on the partition of

m Z_{N}

, the set

{X_{i} [n]}_{n = 1}^{N - 1}

can be grouped into k subsets, i.e.,

\begin{matrix} {X_{i} [n]}_{n = 1}^{N - 1} = {X_{i} [n]}_{n \in H b_{0}}^{N - 1} \cup {X_{i} [n]}_{n \in H b_{1}}^{N - 1} \cup \dots \cup {X_{i} [n]}_{n \in H b_{k - 1}}^{N - 1} . \end{matrix}

According to Lemma 4,

{X_{i} [n]}_{n \in H b_{d}}^{N - 1} = {X_{i} [m]}_{m \in H b_{d}}^{N - 1}, d = 0, 1, \dots, k - 1

. This concludes that for

i = 0, 1, \dots, k - 1

, all

X_{i} = {X_{i} [n]}_{n = 0}^{N - 1}

are

(k + 1)

-valued which draw distinct

k + 1

values from the following set

\begin{matrix} \{f, \sum_{m \in H b_{0}} e^{- j 2 π m / N}, \sum_{m \in H b_{1}} e^{- j 2 π m / N}, \dots, \sum_{m \in H b_{k - 1}} e^{- j 2 π m / N}\} . \end{matrix}

□

Let

N = k f + 1

k^{'} f^{'} + 1

be an odd prime, where

k^{'} = m k

and

m \geq 2

. The relationship between the DFTs of sequences defined in (27) and (28), which are

X_{i} = {X_{i} [n]}_{n = 0}^{N - 1}

and

X_{i}^{'} = {X_{i}^{'} [n]}_{n = 0}^{N - 1}

, respectively, is governed by following lemma.

Lemma 5.

X_{i}

X_{i}^{'} + X_{k + i}^{'} + \dots + X_{(m - 1) k + i}^{'},

for all

i = 0, \dots, k - 1

. In these vectors,

X_{i} [0] = m X_{i}^{'} [0]

, and all elements in set

{X_{i} [n]}_{n \in H b_{i}}

are the same; however, the elements in set

{X_{i}^{'} [n]}_{n \in H b_{i}}

have m different values, which

X_{i} [n]

X_{i}^{'} [n] + X_{k + i}^{'} [n] + \dots + X_{(m - 1) k + i}^{'} [n]

n \in H b_{i}

, for all

i = 0, \dots, k - 1

Proof.

Since

H b_{i}

H b_{i}^{'} \cup H b_{k + i}^{'} \cup \dots \cup H b_{(m - 1) k + i}^{'}

, it results in

x_{i}

x_{i}^{'} + x_{k + i}^{'} + \dots + x_{(m - 1) k + i}^{'}

and derives that

X_{i}

X_{i}^{'} + X_{k + i}^{'} + \dots + X_{(m - 1) k + i}^{'}

is true, for

i = 0, \dots, k - 1 .

Theorem

9, it is straightforward that

X_{i} [0] = m X_{i}^{'} [0]

and

X_{i} [n]

X_{i}^{'} [n] + X_{k + i}^{'} [n] + \dots + X_{(m - 1) k + i}^{'} [n]

n \in H b_{i}

. □

Let

N = k f + 1

k^{'} f^{'} + 1

be an odd prime, where

k^{'} = m k

and

m \geq 2

. Let

s_{k}

and

s_{k^{'}}

be degree-

(k + 1)

and degree-

(k^{'} + 1)

PGISs constructed using sequences

{x_{i}}_{i = 0}^{k}

and

{x_{i}^{'}}_{i = 0}^{k^{'}}

, respectively. The following Theorem can be derived based on the results of Lemma 4 and Lemma 5.

Theorem 10.

The degree and pattern of sequence

s = s_{k} \otimes s_{k^{'}}

are the same as that of

s

. However, when

k^{'}

and k are relatively coprime, sequence

s = s_{k} \otimes s_{k^{'}}

has new pattern and the degree of PGIS

s

is larger than that of

s_{k}

and

s_{k^{'}} .

Proof.

Let the DFTs of

s_{k}

and

s_{k^{'}}

{X [n]}

and

{X^{'} [n]}

, respectively. The DFT of

s_{k} \otimes s_{k^{'}}

is the component-wise product between

{X [n]}

and

{X^{'} [n]}

. Based on

Lemma 4

and

Lemma 5

, when

k^{'} = m k

H b_{i}^{'}

\subset H b_{i}

, the sequence pattern of

s_{k} \otimes s_{k^{'}}

is governed by

s_{k^{'}}

, because all elements in set

{X_{i} [n]}_{n \in H b_{i}}

is the same, but the elements in set

{X_{i}^{'} [n]}_{n \in H b_{i}}

have m different values. When sequences are constructed using base sequences

{x_{i}}_{i = 0}^{k}

and

{x_{i}^{'}}_{i = 0}^{k^{'}}

, the number of distinct elements of their DFTs determines the degree of the associated sequences according to

Theorem

9. This is the reason the degree of

s = s_{k} \otimes s_{k^{'}}

is determined also by

s_{k^{'}}

When

k^{'}

and k are relatively coprime,

H b_{i}^{'}

⊈ H b_{i}

, there exist different non-overlap components between

{X [n]}

and

{X^{'} [n]}

. In case of existing distinct non-overlap components between

{X [n]}

and

{X^{'} [n]}

s_{k} \otimes s_{k^{'}}

constructs new sequence pattern. Moreover, since both elements of

{X [n]}

and

{X^{'} [n]}

are not zeros, the component-wise product between

{X [n]}

and

{X^{'} [n]}

creates only nonzero elements as well, and the number of distinct elements from component-wise product between

{X [n]}

and

{X^{'} [n]}

is larger than that of both

{X [n]}

and

{X^{'} [n]}

. This derives that the degree of

s_{k} \otimes s_{k^{'}}

is larger than both

s_{k}

and

s_{k^{'}}

two sequences. □

7.3. Degree-4 PGISs construction from convolution

This subsection presents the construction of degree-4 PGIS of particular prime period

N = \frac{3^{3} - 1}{3 - 1} = 13

and

N = 2^{5} - 1 = 31

from convolution operation. At first, let’s define three PGISs of period

N = 13

as follows:

\begin{matrix} s_{t} = (0, 0, 1, 0, 1, 1, 1, - 1, - 1, 0, 1, - 1, 1), \end{matrix}

\begin{matrix} s_{b} = (a, \underset{12}{\underset{︸}{b, \dots, b}}), \end{matrix}

\begin{matrix} s_{s} = (c, d, e, d, d, e, e, e, e, d, d, e, d), \end{matrix}

where

a = 1 + 2 j

b = - 2 + j

c = 5 + 5 j

d = 10 - 6 j

and

e = - 6 + 10 j

Example 7.

Sequence

s

s_{t} \otimes s_{b} \otimes s_{s}

is a degree-4 PGIS of period

N = 13

, which is given by

\begin{matrix} s = (a, a, b, a, c, b, b, d, d, a, c, d, c), \end{matrix}

(29)

where

a = 684 + 198 j

b = 333 + 211 j

c = - 1539 + 413 j

and

d = - 837 + 439 j

Let

s_{-} t

{s_{t} [{(- n)}_{N}]}

. In (29), when

s_{t}

is replaced by

s_{-} t

, it constructs a new sequence

s_{-}

s_{-} t \otimes s_{b} \otimes s_{s}

given by

\begin{matrix} s_{-} = (a, c, d, c, a, d, d, b, b, c, a, b, a) . \end{matrix}

Example 8.

Two construction examples of prime period

N = 2^{5} - 1 = 31

are

t_{1} \otimes t_{3}

and

t_{5} \otimes t_{15}

, which are

\begin{matrix} t_{1} \otimes t_{3} = (a, b, b, 0, b, c, 0, d, b, c, c, c, 0, c, d, 0, b, 0, c, d, c, c, c, 0, 0, d, c, 0, d, 0, 0), \end{matrix}

(30)

\begin{matrix} t_{5} \otimes t_{15} = (e, f, f, 0, f, g, 0, h, f, g, g, 0, 0, 0, h, f, f, 0, g, h, g, 0, 0, f, 0, h, 0, f, h, f, f), \end{matrix}

(31)

where

a = - 2

b = 3

c = - 1

d = 1

e = 2

f = - 1

g = 1

and

h = 3

7.4. Convolution derived PGISs based on m-sequences

There exists one-to-one mapping between distinct

m -

sequences and the pattern of degree-2 PGISs. Let’s present PGISs of period

N = 2^{5} - 1

as the examples for demonstration, which the six degree-2 PGISs of period

N = 2^{5} - 1

derived from m-sequences are

{s_{1}, \dots, s_{6}}

, listed in Table 1. Note that the number of different combination of

s_{l}

s_{k}

\in {s_{1}, \dots, s_{6}},

l \neq k,

is 15. We summarize the results of convolution upon two PGISs draw from the set

{s_{1}, \dots, s_{6}}

as follows:

1). Sequences

s_{1} \otimes s_{2}

s_{3} \otimes s_{4}

and

s_{5} \otimes s_{6}

are degree-2 PGISs, which the pattern of these three PGISs is the same as that of

s_{10}

which is listed in Table 1.

2). The other 12 kinds of

s_{l} \otimes s_{k}

PGISs are degree-3 PGISs, listed in Table 2.

3). The six sequences,

s_{m} \otimes s_{m}, m = 1, \dots, 6

, are degree-6 PGISs, which are listed in Table 3.

In Section 6.2, the CIDTS-based PGIS construction applies

m -

sequences,

{m_{1}, \dots, m_{6}}

, directly, which CCF

R_{b, c} [n]

is created and then made adjustment by setting

{\frac{R_{b, c} [n] + 1}{4}}

to construct PGIS, where

1 \leq b, c \leq 6

. The results are summarized as follows:

1). Three CCFs,

{m_{1} [n]} \otimes {m_{2}^{*} [{(- n)}_{N}]}

{m_{3} [n]} \otimes {m_{4}^{*} [{(- n)}_{N}]}

and

{m_{5} [n]} \otimes {m_{6}^{*} [{(- n)}_{N}]}

, can be adjusted to construct three degree-5 PGISs, which are

{t_{13}, t_{14}, t_{15}}

, presented in (23)-(25). Similarly, the three sequences constructed from

{m_{2} [n]} \otimes {m_{1}^{*} [{(- n)}_{N}]}

{m_{4} [n]} \otimes {m_{3}^{*} [{(- n)}_{N}]}

and

{m_{6} [n]} \otimes {m_{5}^{*} [{(- n)}_{N}]}

are also degree-5 PGISs, denoted by

{t_{- 13}, t_{- 14}, t_{- 15}}

2). The 12 distinct CIDTS-based sequences constructed by other 12 kinds of CCFs

{m_{l} [n]} \otimes {m_{k}^{*} [{(- n)}_{N}]},

l \neq k,

are all with degree-2, which are denoted by

{t_{1}, \dots, t_{12}}

, listed in Table 1. In addition, 12 kinds of CCFs

{m_{k} [n]} \otimes {s_{l}^{*} [{(- n)}_{N}]}

will construct other 12 different degree-2 PGISs, which are

{t_{- 1}, \dots, t_{- 12}}

7.5. Convolution derived PGISs based on CIDTS

In the previous subsection, he number of CIDTS-based PGISs of period

N = 2^{5} - 1

is 30, which are

{t_{13}, t_{14}, t_{15}} \cup

{t_{- 13}, t_{- 14}, t_{- 15}} \cup

{t_{1}, \dots, t_{12}} \cup

{t_{- 1}, \dots, t_{- 12}}

. By taking convolution operation

t_{m} \otimes t_{k}

upon any two sequences over these 30 PGISs, where the number of different convolution combination of

t_{m}

and

t_{k}

\frac{30!}{28! \cdot 2!} = 435

, for

m \neq k

, the number of different degrees and patterns of new generated PGISs can be abundant. The detailed analysis and categorization of these PGISs are not the purpose of this study. For brevity reason, we present only two results.

1). The 12 different sequences built from

t_{m} \otimes t_{m}, m = 1, \dots, 12

, are PGISs of degree-6, listed in Table 3; while three

t_{k} \otimes t_{k}

k = 13, 14, 15

construct three different PGISs of degree-7, but belong to the same pattern, which the pattern of

t_{13} \otimes t_{13}

is listed in Table 4.

2). When

m \neq k

, some PGISs generated by

t_{m} \otimes t_{k}

are provided for comparison, where the degrees of these examples belong to the set

{1, 2, 4, 5, 6}

. The degree of PGISs

t_{13} \otimes t_{14}

t_{13} \otimes t_{15}

and

t_{15} \otimes t_{14}

is 6. The degree of

t_{1} \otimes t_{2}

t_{1} \otimes t_{4}

t_{1} \otimes t_{5}

t_{2} \otimes t_{3}

t_{2} \otimes t_{4}

t_{2} \otimes t_{6}

t_{3} \otimes t_{4}

and

t_{5} \otimes t_{6}

is 5. The degree of

t_{3} \otimes t_{5}

t_{3} \otimes t_{6}

t_{4} \otimes t_{5}

and

t_{4} \otimes t_{6}

is 2. The two PGISs of degree-1 are

t_{1} \otimes t_{6}

and

t_{2} \otimes t_{5}

. We do not make a pattern list of these PGISs for brevity. Finally, two degree-4 examples are

t_{1} \otimes t_{3}

and

t_{5} \otimes t_{15}

, which are (30) and (31), respectively.

7.6. Convolution between different types of PGISs

This study addresses different construction of PGISs. Therefore, their exist various many different convolution operation applied across different type PGISs. This subsection presents only some examples for the purpose of demonstration the versatile of convolution-derived PGISs.

7.6.1. Convolution between ternary sequence and CIDTS derived PGISs

Table 5 presents 7 kinds of PGISs obtained from convolution between perfect ternary sequence and CIDTS derived PGISs, which are

s_{11} \otimes t_{15}

s_{11} \otimes t_{14}

s_{- 11} \otimes t_{14}

s_{11} \otimes t_{1}

s_{- 11} \otimes t_{1}

s_{11} \otimes t_{5}

and

s_{- 11} \otimes t_{5}

for comparison. The patterns are all different and the degrees of these PGISs are 20, 20, 20, 14, 12, 12 and 12, respectively.

7.6.2. Convolution between ternary sequence and m-sequences derived PGISs

Table 5 presents 2 kinds of PGISs obtained from convolution between perfect ternary sequence and m-sequences derived PGISs, which are

s_{1} \otimes s_{1} \otimes s_{11}

and

s_{2} \otimes s_{2} \otimes s_{11}

. The degrees are 21 and 20 respectively.

7.6.3. Convolution between ternary sequence and cyclotomic class PGIS

Table 5 presents also one PGIS obtained from convolution between perfect ternary sequence and degree-3 PGIS using cyclotomic class of order2, which is

s_{c y} \otimes s_{11}

and the degree is 11.

7.6.4. Convolution between CIDTS derived and cyclotomic class PGIS

The 15 different PGISs obtained from convolution between CIDTS derived PGISs, which are

{t_{1}, \dots, t_{15}}

, and degree-3 PGIS using cyclotomic class of order2

s_{c y}

can be distributed into degree-7 and degree-6 two groups, which 6 PGISs belong to set

{s_{c y} \otimes t_{m}, m = 2, 4, 5, 7, 10, 11}

are degree-6 and the rest of other 9 PGISs are degree-7. The patterns of these PGISs belong to those patterns listed in Table 3.

Table 3. 14 patterns of degree-6 and -7 PGISs of period 31

$PGIS$	$sequence pattern$	$coefficients$
$s_{1} \otimes s_{1}$	$(a, b, b, c, b, d, c, e, b, d, d, c, c, c, e, f, b, c, d, e, d, c, c, f, c, e, c, f, e, f, f)$	$a = - 128 - 26 j, b = 16 + 16 j,$
$s_{2} \otimes s_{2}$	$(a, f, f, e, f, c, e, c, f, c, c, d, e, d, c, b, f, e, c, c, c, d, d, b, e, c, d, b, c, b, b)$	$c = - 32 + 2 j, d = 64 + 30 j,$
$s_{3} \otimes s_{3}$	$(a, e, e, c, e, b, c, d, e, b, b, f, c, f, d, c, e, c, b, d, b, f, f, c, c, d, f, c, d, c, c)$	$e = 112 + 44 j, f = - 80 - 12 j$
$s_{4} \otimes s_{4}$	$(a, c, c, d, c, f, d, c, c, f, f, b, d, b, c, e, c, d, f, c, f, b, b, e, d, c, b, e, c, e, e)$
$s_{5} \otimes s_{5}$	$(a, d, d, f, d, e, f, b, d, e, e, c, f, c, b, c, d, f, e, b, e, c, c, c, f, b, c, c, b, c, c)$
$s_{6} \otimes s_{6}$	$(a, c, c, b, c, c, b, f, c, c, c, e, b, e, f, d, c, b, c, f, c, e, e, d, b, f, e, d, f, d, d)$
$t_{4} \otimes t_{15}$	$(a, b, b, c, b, d, c, e, b, d, d, f, c, f, e, f, b, c, d, e, d, f, f, f, c, e, f, f, e, f, f)$	$a = - 3, b = 9, c = 2,$
		$d = - 2, e = 8, f = - 5$
$t_{1} \otimes t_{1}$	$(a, b, b, c, b, d, c, e, b, d, d, 0, c, 0, e, f, b, c, d, e, d, 0, 0, f, c, e, 0, f, e, f, f)$	$a = 11, b = 1, c = 3,$
		$d = 2, e = - 3, f = - 2$
$t_{2} \otimes t_{2}$	$(a, 0, 0, b, 0, c, b, d, 0, c, c, e, b, e, d, f, 0, b, c, d, c, e, e, f, b, d, e, f, d, f, f)$	$a = - 9, b = 1, c = - 1,$
		$d = - 2, e = 5, f = 2$
$t_{3} \otimes t_{3}$	$(a, 0, 0, b, 0, c, b, d, 0, c, c, e, b, e, d, f, 0, b, c, d, c, e, e, f, b, d, e, f, d, f, f)$	$a = 11, b = 1, c = 3,$
		$d = - 2, e = 3, f = 2$
$t_{4} \otimes t_{4}$	$(a, b, b, c, b, d, c, 0, b, d, d, e, c, e, 0, f, b, c, d, 0, d, e, e, f, c, 0, e, f, 0, f, f)$	$a = - 9, b = - 1, c = 2,$
		$d = - 2, e = 1, f = 5$
$t_{5} \otimes t_{5}$	$(a, b, b, c, b, d, c, e, b, d, d, f, c, f, e, 0, b, c, d, e, d, f, f, 0, c, e, f, 0, e, 0, 0)$	$a = - 9, b = 2, c = - 2,$
		$d = 5, e = 1, f = - 1$
$t_{6} \otimes t_{6}$	$(a, b, b, c, b, 0, c, d, b, 0, 0, e, c, e, d, f, b, c, 0, d, 0, e, e, f, c, d, e, f, d, f, f)$	$a = 11, b = - 2, c = - 3,$
		$d = 3, e = 2, f = 1$
$t_{7} \otimes t_{7}$	$(a, b, b, 0, b, c, 0, d, b, c, c, e, 0, e, d, f, b, 0, c, d, c, e, e, f, 0, d, e, f, d, f, f)$	$a = - 9, b = 5, c = 1,$
		$d = 2, e = - 2, f = - 1$
$t_{8} \otimes t_{8}$	$(a, b, b, c, b, d, c, e, b, d, d, f, c, f, e, 0, b, c, d, e, d, f, f, 0, c, e, f, 0, e, 0, 0)$	$a = 11, b = 2, c = - 2,$
		$d = - 3, e = 1, f = 3$
$t_{9} \otimes t_{9}$	$(a, b, b, 0, b, c, 0, d, b, c, c, e, 0, e, d, f, b, 0, c, d, c, e, e, f, 0, d, e, f, d, f, f)$	$a = 11, b = - 3, c = 1,$
		$d = 2, e = - 2, f = 3$
$t_{10} \otimes t_{10}$	$(a, b, b, c, b, 0, c, d, b, 0, 0, e, c, e, d, f, b, c, 0, d, 0, e, e, f, c, d, e, f, d, f, f)$	$a = - 9, b = - 2, c = 5,$
		$d = - 1, e = 2, f = 1$
$t_{11} \otimes t_{11}$	$(a, b, b, c, b, d, c, e, b, d, d, 0, c, 0, e, f, b, c, d, e, d, 0, 0, f, c, e, 0, f, e, f, f)$	$a = - 9, b = 1, c = - 1,$
		$d = 2, e = 5, f = - 2$
$t_{12} \otimes t_{12}$	$(a, b, b, c, b, d, c, 0, b, d, d, e, c, e, 0, f, b, c, d, 0, d, e, e, f, c, 0, e, f, 0, f, f)$	$a = 11, b = 3, c = 2,$
		$d = - 2, e = 1, f = - 3$
$t_{13} \otimes t_{13}$	$(a, b, b, c, b, d, c, e, b, d, d, f, c, f, e, g, b, c, d, e, d, f, f, g, c, e, f, g, e, g, g)$	$a = - 21, b = 8, c = - 3, d = - 17$
	(degree-7)	$e = 2, f = 13, g = 14$
$s_{11} \otimes t_{13}$	$(a, b, b, c, b, d, e, f, b, d, d, g, e, g, f, g, b, e, d, f, d, g, g, g, e, f, g, g, f, g, g)$	$a = - 11, b = 4, c = - 2, d = - 9$
	(degree-7)	$e = - 1, f = 1, g = 7$
Note that the following pairs have the same sequence pattern:
$(s_{5} \otimes s_{5}$ , $t_{4} \otimes t_{15})$ , $(t_{1} \otimes t_{1}$ , $t_{11} \otimes t_{11})$ , $(t_{2} \otimes t_{2}$ , $t_{3} \otimes t_{3})$ , $(t_{4} \otimes t_{4}$ , $t_{12} \otimes t_{12})$ , $(t_{5} \otimes t_{5}$ , $t_{8} \otimes t_{8})$ , $(t_{6} \otimes t_{6}$ , $t_{10} \otimes t_{10})$ , $(t_{7} \otimes t_{7}$ , $t_{9} \otimes t_{9})$

Table 4. 6 patterns of degree-10 PGISs of period 31

$PGIS$	$sequence pattern$	$coefficients$
$s_{1} \otimes s_{11}$	$(a, b, b, c, d, e, e, f, e, g, f, e, a, h, f, d, f, g, b, i, e, d, d, k, h, d, h, b, f, b, g)$	$a = - 6 + 22 j, b = - 2 - 6 j,$
$s_{2} \otimes s_{11}$	$(b, f, b, c, d, b, e, e, a, h, e, g, e, h, f, f, a, g, g, i, e, b, d, d, g, f, d, e, a, l, f)$	$c = 2 - 34 j, d = 1 - 27 j,$
$s_{3} \otimes s_{11}$	$(b, b, e, f, e, b, b, d, d, g, c, f, d, f, f, d, b, k, g, e, e, g, h, b, a, e, a, d, i, h, f)$	$e = - 4 + 8 j, f = - 5 + 15 j,$
$s_{4} \otimes s_{11}$	$(f, d, e, f, a, b, e, b, f, h, c, a, d, a, e, d, l, d, g, g, b, f, g, g, e, e, b, f, i, h, e)$	$g = - 3 + j, h = - 1 - 13 j,$
$s_{5} \otimes s_{11}$	$(h, a, e, f, d, e, d, g, d, g, f, i, h, b, c, e, h, b, k, f, b, f, a, g, d, b, b, e, e, f, d)$	$i = - 20 j, k = - 8 + 36 j,$
$s_{6} \otimes s_{11}$	$(d, b, b, e, f, e, f, f, d, h, f, i, g, l, c, a, h, g, d, a, b, e, e, g, d, e, f, e, g, a, b)$	$l = 3 - 41 j$

Table 5. Period 31 PGISs of various degrees

$PGIS$	$sequence pattern$	$coefficients$
$s_{1} \otimes s_{1} \otimes s_{11}$	$(a, b, c, c, d, e, f, g, h, i, i, k, l, m, n, d, m, p, q, e, b, g, r, s, t, t, u, v, r, w, n)$	$a = - 8 + 26 j, b = - 56 + 12 j,$
	(degree-21)	$c = - 104 - 2 j, d = 256 + 103 j,$
		$e = - 152 - 16 j, f = 184 + 82 j,$
		$g = 16 + 33 j, h = 424 + 152 j,$
		$i = - 80 + 5 j, k = 40 + 40 j,$
		$l = 88 + 54 j, m = 64 + 47 j,$
		$n = 160 + 75 j, p = - 224 - 37 j,$
		$q = - 248 - 44 j, r = - 32 + 19 j,$
		$s = - 344 - 72 j, t = 208 + 89 j,$
		$u = - 128 - 9 j, v = 136 + 68 j,$
		$w = - 200 - 30 j$
$s_{2} \otimes s_{2} \otimes s_{11}$	$(c, g, a, b, u, a, w, e, a, d, a, m, v, d, t, f, c, n, h, e, k, q, r, d, n, l, m, p, b, h, i)$	$a = - 8 + 26 j, b = - 56 + 12 j,$
	(degree-20)	$c = 232 + 96 j, d = 256 + 103 j,$
		$e = - 152 - 16 j, f = - 272 - 51 j,$
		$g = 16 + 33 j, h = 112 + 61 j,$
		$i = - 80 + 5 j, k = 40 + 40 j,$
		$l = - 320 - 65 j, m = 64 + 47 j,$
		$n = 160 + 75 j, p = - 296 - 58 j,$
		$q = - 248 - 44 j, r = - 32 + 19 j,$
		$w = - 200 - 30 j, t = 208 + 89 j,$
		$u = - 128 - 9 j, v = 136 + 68 j$
$s_{11} \otimes t_{15}$	$(a, b, c, d, e, f, g, h, e, d, h, c, g, i, j, k, l, m, n, p, j, q, r, s, p, t, f, u, 0, l, q)$	$a = 7, b = 2, c = 8, d = 5,$
	(degree-20)	$e = - 9, f = 4, g = - 7, h = - 5,$
		$i = 10, j = 6, k = - 16, l = - 1,$
		$m = 12, n = 16, p = 3, q = 1,$
		$r = - 2, s = 11, t = - 4, u = - 6$
$s_{11} \otimes t_{14}$	$(a, b, a, c, d, e, f, g, h, i, e, j, j, k, i, h, l, m, n, 0, p, c, q, r, s, t, u, q, p, k, g)$	$a = 4, b = 7, c = - 5, d = - 16,$
	(degree-20)	$e = 6, f = - 4, g = 1, h = - 9,$
		$i = 5, j = 3, k = - 1, l = 10,$
		$m = 16, n = 11, p = 8, q = - 7,$
		$r = 12, s = - 2, t = - 6, u = 2$
$s_{- 11} \otimes t_{14}$	$(a, b, c, b, d, e, f, g, h, i, j, k, l, i, c, h, m, k, e, n, p, p, c, q, r, s, t, t, u, 0, l)$	$a = 1, b = 8, c = - 9, d = 15,$
	(degree-20)	$e = - 8, f = 10, g = - 4, h = - 3,$
		$i = - 5, j = 5, k = 2, l = - 1,$
		$m = 7, n = 3, p = 4, q = 13,$
		$r = 12, s = 14, t = 2, u = - 7$
$s_{11} \otimes t_{1}$	$(a, b, 0, b, c, d, 0, e, f, f, e, g, h, i, j, k, l, l, b, m, c, m, m, b, j, 0, c, n, d, m, g)$	$a = 3, b = - 1, c = 2, d = - 2,$
	(degree-14)	$e = - 4, f = 3, g = 4, h = 1,$
		$i = 6, j = 8, k = - 3, l = 5,$
		$m = - 3, n = - 5$
$s_{- 11} \otimes t_{1}$	$(a, b, c, d, e, d, 0, a, 0, f, f, 0, g, f, g, 0, c, h, h, e, i, g, e, j, f, k, d, l, f, 0, c)$	$a = 6, b = 3, c = - 3, d = - 2,$
	(degree-12)	$e = 1, f = - 1, g = - 4, h = 7,$
		$i = 5, j = 9, k = 2, l = 4$
$s_{11} \otimes t_{5}$	$(a, b, a, a, c, d, e, f, g, h, d, i, d, j, h, i, a, k, j, d, 0, a, h, l, b, i, c, 0, 0, c, k)$	$a = 2, b = 5, c = - 3, d = - 2,$
	(degree-12)	$e = - 6, f = - 4, g = 4, h = 3,$
		$i = 1, j = 9, k = - 1, l = - 5$
$s_{- 11} \otimes t_{5}$	$(a, b, c, d, e, f, g, b, c, g, d, 0, 0, h, i, i, g, b, g, c, a, g, i, a, i, j, 0, k, 0, e, l)$	$a = 2, b = 3, c = 4, d = - 3,$
	(degree-12)	$e = - 2, f = 5, g = - 1, h = - 10,$
		$i = 1, j = 6, k = 9, l = - 6$
$s_{c y} \otimes s_{11}$	$(a, a, b, c, d, b, e, f, d, g, c, h, i, k, c, d, k, m, m, h, b, f, i, m, i, e, a, e, h, k, f)$	$a = - 13 - 13 j, b = - 14 - 14 j,$
	(degree-11)	$c = - 6 - 6 j, d = 30 + 30 j,$
		$e = 21 + 21 j, f = 7 + 7 j,$
		$g = - 19 - 19 j, h = - 7 - 7 j,$
		$i = 2 + 2 j, k = - 12 - 12 j,$
		$m = - 35 - 35 j$

8. Conclusions

Prime period sequences can serve as the fundamental tool to construct arbitrary composite period sequences. The construction of prime period PGISs becomes an important research topic. This paper provides systematic and nonsystematic two different approaches for construction prime period PGISs. Systematic approach encounters difficulty to solve constraint equations when the degree of sequence is lager than 3, however the merit of this approach is that both degree and pattern of a sequence are known, and PGISs of degrees 1, 2, 3 and 5 examples are presented for demonstration. The nonsystematic approach can contribute abundant numbers of degrees and patterns to the constructed PGISs, but both degree and pattern might vary. We provide PGISs of different patterns and degree-4 and other higher degrees of 6, 7, 10, 11, 12, 14, 20 and 21 examples to show the results of nonsystematic approach. The proposed systematic and nonsystematic schemes can be combined to construct efficiently abundant PGISs with various degrees and patterns for the associated different applications.

References

W.-W. Hu, S.-H. Wang, and C.-P. Li, “Gaussian integer sequences with ideal periodic autocorrelation functions," IEEE Trans. Signal Process., vol. 60, no. 11, pp. 6074–6079, Nov. 2012. [CrossRef]
Y. Yang, X. Tang, and Z. Zhou, “Perfect Gaussian integer sequences of odd prime length," IEEE Signal Process. Letters., vol. 19, no. 10, pp. 615–618, Oct. 2012. [CrossRef]
X. Ma, Q. Wen, J. Zhang, and H. Zuo, “New perfect Gaussian integer sequences of period pq," IEICE Trans. Fundam., vol. E96-A, no. 11, pp.2290–2293, Nov. 2013. [CrossRef]
H.-H. Chang, C.-P. Li, C.-D. Lee, S.-H. Wang, and T.-C. Wu, “Perfect Gaussian integer sequences of arbitrary composite length," IEEE Trans. Inf. Theory, vol. 61, no. 7, pp. 4107–4115, Jul. 2015.
Chong-Dao Lee, Yu-Pei Huang, Yaotsu Chang, and Ho-Hsuan Chang, “Perfect Gaussian integer sequences of odd period 2^m-1," IEEE Signal Process. Letters, vol.12, no.7, pp. 881–885, July, 2015.
C.-D. Lee, C.-P. Li, H.-H. Chang, and S.-H. Wang, “Further results on degree-2 Perfect Gaussian integer sequences," IET Commun., Vol. 10, no.12, pp. 1542–1552, 2016.
Soo-Chang Pei and Kuo-Wei Chang, “Perfect Gaussian Integer Sequences of Arbitrary Length," IEEE Signal Process. Letters, vol.22, no.8, pp. 1040–1044, July, 2015.
S.-H. Wang, C.-P. Li, H.-H. Chang, and C.-D. Lee, “A systematic method for constructing sparse Gaussian integer sequences with ideal periodic autocorrelation functions," IEEE Trans. Communications, vol. 64, no. 1, pp. 365–376, Jan. 2016.
K.-J. Chang and H.-H. Chang, “Perfect Gaussian integer sequences of period p^k with degrees equal to or less than k+1," IEEE Trans. Communications, vol. 65, no.9, pp. 3723-3733, Sep. 2017.
H.-H. Chang, K.-J. Chang and C.-P. Li, “Construction of Period qp PGISs With Degrees Equal To or Larger Than Four," IEEE Access, vol. 65, no.9, pp. 3723-3733, Sep. 2018.
C.-P. Li, S.-H. Wang, and C.-L. Wang, “Novel low-complexity SLM schemes for PAPR reduction in OFDM systems," IEEE Trans. Signal Process., vol. 58, no. 5, pp. 2916–2921, May 2010. [CrossRef]
S.-H. Wang, C.-P. Li, K.-C. Lee and H.-J Su, “A novel low-complexity precoded OFDM system with reduced PAPR," IEEE Trans. Signal Process., vol. 63, no. 6, pp. 1368–1376, Mar., 2015. [CrossRef]
H.-H. Chang, S.-C. Lin, and C.-D. Lee, “A CDMA scheme based on perfect Gaussian integer sequences," AEU International Journal of Electronics and Communications, vol. 75, pp. 70–81, May 2017. [CrossRef]
H.-H. Chang, C. Li, D. Xuan, and H. Liang, “Construction of Circular Convolution Group for Block Data Transmission with High Diversity Order,"Proc. of the International Conference on Electrical, Computer, Communications and Mechatronics Engineering (ICECCME), 7-8 October 2021, Mauritius.
C.-H. Hsia, S.-J. Lou, H.-H. Chang, and D. Xuan, “Novel Hybrid Public/Private Key Cryptography Based on Perfect Gaussian Integer Sequences,"IEEE Access, vol. 9, pp. 145045–145059, Oct. 2021. [CrossRef]
D. Xuan, H.–H. Chang, C. Li, and W. Xie,“Construction of Zero Circular Convolution Sequences," Proc. of the International Conference on Electrical, Computer, Communications and Mechatronics Engineering (ICECCME), 16-18 November, 2022, Maldives.
D. Xuan, H.-H. Chang, and G. Huang, “Novel Zero Circular Convolution Sequences for Detection and Channel Estimations," IEEE Access, vol. 11, pp. 48276–48291, May. 2023.
C.-P. Li, K.-J. Chang, H.-H. Chang, and Y.-M. Chen, “Perfect Sequences of Odd Prime Length," IEEE Signal Processing Letters, vol. 25, no.7, pp 966–969, July 2018. [CrossRef]
W. K. Nicholson, Introduction to Abstract Algebra. 2nd Edition, John Wiley & Sons, Inc. 1999.
M. R. Schroeder, Number Theory in Science and Communications. Berlin, Germany: Springer-Verlag, 1997.
P. Z. Fan and M. Darnell, Sequences Design for Communications Applications. New York: Wiley, 1996.
J. M. Howie, Fields and Galois Theory. London: Springer, 2006.
V.P. Ipatov, “Ternary sequences with ideal autocorrelation properties," radio Eng. Electron. Phys., vol 24, pp. 75–79, Oct. 1979.
V.P. Ipatov, “Contribution to the theory of sequences with perfect period autocorrelation properties," radio Eng. Electron. Phys., vol 24, pp. 31–34, Apr. 1980.
P. Lancaster, Theory of Matrices. NY: Academic Press, 1969.
P. J. Davis, Circulant Matrices. NY: Wiley-Interscience, 1979.

Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

© 2024 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (http://creativecommons.org/licenses/by/4.0/).

Copyright: This open access article is published under a Creative Commons CC BY 4.0 license, which permit the free download, distribution, and reuse, provided that the author and preprint are cited in any reuse.

MDPI Initiatives

Important Links

Choose an area of interest and we will send you notifications of new preprints at your preferred frequency.

Disclaimer

A Review Study of Prime Period Perfect Gaussian Integer Sequences

Abstract

1. Introduction

2. Definitions and PGIS Properties

2.1. Notations

2.2. Definitions

2.2.1. Degree

2.2.2. Pattern

2.2.3. Circular convolution

2.2.4. PACF

2.2.5. PCCF

2.2.6. Coset

2.3. PGIS Properties

3. Unique Degree-1 PGIS

4. Degree-2 PGISs Consturction

4.1. Construction using cyclotomic class

4.1.1. Cyclotomic class of order 1

4.1.2. Cyclotomic class of order 2

4.2. Degree-2 PGISs of arbitrary prime period

4.3. Degree-2 PGISs adopting from ternary perfect sequences

4.3.1. Construction based on ternary perfect sequences

4.3.2. Construction based on CIDTS

4.4. Degree-2 PGISs of prime period 2 m − 1

4.4.1. Degree-2 PGISs from Legendre sequences

4.4.2. Degree-2 PGISs from Hall’s sextic residue sequences

4.4.3. Degree-2 PGISs from m-sequences

4.4.4. Degree-2 PGISs from cyclic difference set

5. Degree-3 PGISs Consturction

5.1. Construction using cyclotomic class of order 2

5.2. Degree-3 PGISs of prime period 2 m − 1

5.3. Construction from ternary perfect sequences

6. Degree-5 PGISs Consturction

6.1. PGISs construction using GLS

6.2. Degree-5 PGISs of prime period 2 m − 1

7. PGISs Construction from Convolution and Correlation Operations

7.1. Relationship between convolution and circulant matrix

7.2. Effect of convolution on degree and pattern expansion

7.3. Degree-4 PGISs construction from convolution

7.4. Convolution derived PGISs based on m-sequences

7.5. Convolution derived PGISs based on CIDTS

7.6. Convolution between different types of PGISs

7.6.1. Convolution between ternary sequence and CIDTS derived PGISs

7.6.2. Convolution between ternary sequence and m-sequences derived PGISs

7.6.3. Convolution between ternary sequence and cyclotomic class PGIS

7.6.4. Convolution between CIDTS derived and cyclotomic class PGIS

8. Conclusions

References

MDPI Initiatives

Important Links

Subscribe

4.4. Degree-2 PGISs of prime period $2^{m} - 1$

5.2. Degree-3 PGISs of prime period $2^{m} - 1$

6.2. Degree-5 PGISs of prime period $2^{m} - 1$