Open access peer-reviewed chapter

# A Direct Construction of Intergroup Complementary Code Set for CDMA

Written By

Palash Sarkar and Sudhan Majhi

Submitted: 23 January 2019 Reviewed: 08 May 2019 Published: 10 July 2019

DOI: 10.5772/intechopen.86751

From the Edited Volume

## Coding Theory

Chapter metrics overview

View Full Metrics

## Abstract

A collection of mutually orthogonal complementary codes (CCs) is said to be complete complementary codes (CCCs) where the number of CCs are equal to the number of constituent sequences in each CC. Intergroup complementary (IGC) code set is a collection of multiple disjoint code groups with the following correlation properties: (1) inside the zero-correlation zone (ZCZ), the aperiodic autocorrelation function (AACF) of any IGC code is zero for all nonzero time shifts; (2) the aperiodic cross-correlation function (ACCF), of two distinct IGC codes, is zero for all time shifts inside the ZCZ when they are taken from the same code groups; and (3) the ACCF, for two IGC codes from two different code groups, is zero everywhere. IGC code set has a larger set size than CCC, and both can be applicable in multicarrier code-division multiple access (CDMA). In this chapter, we present a direct construction of IGC code set by using second-order generalized Boolean functions (GBFs), and our IGC code set can support interference-free code-division multiplexing. We also relate our construction with a graph where the ZCZ width depends on the number of isolated vertices present in a graph after the deletion of some vertices. Here, the construction that we propose can generate IGC code set with more flexible parameters.

### Keywords

• complementary code (CC)
• code-division multiple access (CDMA)
• generalized
• Boolean function (GBF)
• intergroup complementary (IGC) code set
• zero-correlation zone
• (ZCZ) sequences

## 1. Introduction

Code-division multiple access (CDMA) [1] is an important communication technology where sequence signatures with good correlation properties are used to separate multiple users. In CDMA systems, multipath interference (MPI) and multiple access interference (MAI) degrade the performance where MPI and MAI occur due to the multipath propagation, non-ideal synchronization, and non-ideal correlation properties of spreading codes. Spreading code plays a significant role on the overall performance of a CDMA system. The interference-resist capability and system capacity are determined by the correlation properties and available number of spreading codes. Due to ideal auto- and cross-correlation properties, complete complementary codes (CCCs) have been applied to asynchronous multicarrier CDMA (MC-CDMA) [2] communications in order to provide zero interference performance.

Golay proposed a pair of sequences in Golay [3] known as Golay complementary pair (GCP) which is a set of two equal length sequences with the property that the sum of their aperiodic autocorrelation function (AACF) is zero everywhere except at the zero shift. Tseng and Liu [4] extended the idea of GCP to complementary set or complementary code (CC) which contains two or more than two sequences. Davis and Jedwab [5] proposed a direct construction of GCP called Golay-Davis-Jedwab (GDJ) pair by using second-order generalized Boolean functions (GBFs) to reduce peak-to-mean envelope power ratio (PMEPR) for OFDM system. As a generalization of GDJ pair, Paterson introduced a construction of CC Paterson [6] by associating each CC with a graph. Recently, a construction of CC has been reported in Sarkar et al. [7] which is a generalization of Paterson’s CC construction. Later, Rathinakumar and Chaturvedi extended Paterson’s construction to CCC Rathinakumar and Chaturvedi [8] which is a collection of mutually orthogonal CCs. Although CCs have ideal AACF and aperiodic cross-correlation function (ACCF), they are unable to support a maximum number of users as the set size cannot be larger than the flock size [9, 10, 11], where the flock size denotes the number of constituent sequences in each CC. The application of CCC has been extended for the enabling of interference-free MC-CDMA communication by designing a fractional-delay-resilient receiver in Liu et al. [12].

The binary Z-complementary sequences were first introduced by Fan et al. [13] and later extended to quadriphase Z-complementary sequences by Li et al. [14].

Recently, a construction of binary Z-complementary pairs has been reported in Adhikary et al. [15]. A direct construction of polyphase Z-complementary codes has been reported in Sarkar et al. [16], which is an extension of Rathinakumar’s CCC construction. Due to favorable correlation properties of Z-complementary codes, it can be easily utilized for MC-CDMA system as spreading sequences to mitigate MPI and MAI efficiently [17]. The theoretical bound given in Liu et al. [18] shows that the Z-complementary codes have a much larger set size than CCCs.

IGC code set was first proposed by Li et al. [19] based on CCCs. Their code assignment algorithm shows that the CDMA systems employing the IGC codes (IGC-CDMA) outperform traditional CDMA with respect to bit error rate (BER). However, the ZCZ width of IGC codes [19] is fixed to the length of the elementary codes of the original CCCs, which limits the number of IGC codes. Another improved construction method of IGC codes is proposed in Feng et al. [20] based on the CCCs, interleaving operation, and orthogonal matrix which provides a flexible choice of the ZCZ width. However, there is no such construction which can directly produce IGC code set without having operation on CCCs; it motivates us to give a direct construction of IGC code set.

This chapter contains a direct method to construct IGC code set by applying second-order GBFs. This construction is capable of generating IGC code set with more flexible parameters such as ZCZ width and set size. We also relate our construction with a graph, and it has been shown that ZCZ width and set size of the IGC code set obtained by using our method depend on the number of isolated vertices present in a graph which is achieved by deleting some vertices from a graph.

## 2. Preliminary

### 2.1 Correlations of sequences

The ACCF between two sequences a = a 0 a 1 a L 1 and b = b 0 b 1 b L 1 is defined as follows:

C a b τ = Σ i = 0 L 1 τ a i + τ b i , 0 τ < L , Σ i = 0 L + τ 1 a j b i τ J L < τ < 0 , 0 , otherwise , E1

where τ is an integer. The above defined function in Eq. (1) is said to be AACF of a (or, b) if a = b . The AACF of a at τ is denoted by A a τ .

Definition 1 An ordered set a 0 a 1 , a P 1 containing P sequences of equal length L is called CC lf

i = 0 P 1 A a j τ = LP , τ = 0 , 0 , otherwise . E2

Definition 2 Let C 0 C 1 , C K 1 be a set of K CCs where each of the CC contains P K P constituent sequences of length L. The αth constituent sequence of C i is C i , α = C i , α , 0 C i , α , 1 C i , α , L 1 where α = 0 , 1, , P 1 , i = 0 , 1, , K 1 . The ACCF of the CCs is given by

C C i C j τ = α = 0 P 1 C C i , α C j , α τ = 0 , τ , i j . E3

The code set is said to be CCC when K = P .

Definition 3 Given an IG C code set I (K,P,L,Z) (Li et al. [19]), K denotes a number of codes, P denotes the number of constituent sequences in each code, L denotes the length of each constituent sequence, and Z denotes ZCZ width, where K = PL / Z . The K codes can be divided into P code groups denoted by I g g = 0 1 P 1 , each group contains K / P = L / Z codes. The code set I K P L Z has the following properties:

C C i C j τ = PL , i = j , τ = 0 , 0 , i = j , 0 < τ < Z , 0 , i j , C i , C j I g , τ < Z , 0 , C i I g 1 , C j I g 2 , g 1 g 2 , τ < L , others , otherwise . E4

### 2.2 Generalized Boolean functions

Let f : 0 1 m Z q (q is average number, not less than 2) be a function of m variables x 0 , x 1 , , x m 1 . The product of k distinct variables χ i 0 χ i 1 χ i k 1 0 i 0 < i 1 < < i k 1 m 1 is called a monomial of degree k . The monomials 1, x 0 , , x m 1 , x 0 x 1 , , x m 2 x m 1 , , x 0 x 1 x m 1 are the list of 2 m monomials over the variables x 0 , x 1 , , x m 1 . A GBF f can uniquely be presented as a linear combination of these 2 m monomials, where the coefficient of each monomial belongs to Z q . We denote the complex valued sequence corresponding to the GBF f by ψ f and define it as

ψ f = ω f 0 ω f 1 ω f 2 m 1 , E5

where f i = f i 0 i 1 i m 1 , ω = exp 2 π 1 / q , and i 0 i 1 i m 1 are the binary representation of the integer i i = i = 0 m 1 i j 2 j . Let C be an order set of P Boolean functions given by C = f 0 f 1 f P 1 . Then the complex valued code corresponding to the set of Boolean function C is denoted by ψ C , given by ψ C = ψ f 0 ψ f 1 ψ f P 1 . The code can also be viewed as a matrix where ψ f i 1 is the ith row of the matrix.

For any given GBF f of m variables, the function f 1 x 0 1 x 1 1 x m 1 is denoted by f ˜ . For a Z q valued vector e = e 0 e 1 e L 1 , we denote the vector e ¯ by e ¯ 0 e ¯ 1 e ¯ L 1 where e ¯ i = q 2 e i i = 0 1 L 1 . Now, we define the following notations a ¯ and a , where a ¯ is derived from a by reversing it and a is the complex conjugate of a .

### 2.3 Quadratic forms and graphs

In this context, we introduce some lemmas and new notations which will be used for our proposed construction.

Definition 4 Let f be a GBF of variables x 0 , x 1 , , x m 1 over Z q . Consider a list of k 0 k < m indices 0 j 0 < j 1 < j k < m , and write x = x j 0 x j 1 x j k 1 . Consider c = c 0 c 1 c k 1 to be a fixed binary vector. Then we define ψ f x = c as a complex valued vector with ω f i 0 ' i 1 ' ' i m 1 as a ith component if i j α = c α for each 0 α < k and equal to zero otherwise. For k = 0 , the complex valued vector ψ f x = c is nothing, but the vector ψ f is defined before.

Let Q : 0 1 m Z q be a quadratic form of m variables x 0 , x 1 , , x m 1 . A quadratic GBF is of the form Rathinakumar and Chaturvedi [8]

f = Q + i = 0 m 1 g i x i + g , E6

where g , g i Z q are arbitrary.

For a quadratic GBF, f , G f denotes the graph of f . The G f is obtained by joining the vertices x i and x j by an edge if there is a term q i , j x i x j 0 i < j m 1 in the GBF f with q i , j 0 q i , j Z q . Consider a function f x j = c , derived by fixing x j at c in f . The graph of f x j = c is denoted by G f x j = c which is obtained by deleting the vertex x j and all the edges which are connected to x j from G f . Then G f x = c is obtained from G f by deleting x j 0 , x j 1 , , x j k 1 . G f x = c represent the same graph for all c 0 1 k . Therefore, for all c in 0 1 k f x = c have the same quadratic form. Note that the quadratic forms of f and f ˜ are the same; thus, they have associated with the same graph.

Lemma 1 Construction of CCC [8].

Let f : 0 1 m Z q be a GBF and f its reversal. Assume that G f x = c is a path for each c 0 1 k and the edges in the path have the same weight q / 2 . Let b 0 b 1 b k 1 be the binary representation of the integer t . Define the order sets of GBFs C t to be

f + q 2 α = 0 k 1 d α x j α + α = 0 k 1 b α x j α + dx γ : d d α 0 1 , E7

and the order set of GBFs C ˜ t to be

f ˜ + q 2 α = 0 k 1 d α x ¯ j α + α = 0 k 1 b α x ¯ j α + d ¯ x γ : d ¯ d α 0 1 , E8

where x γ is one of the end vertices in the path. Then

ψ C t : 0 t < 2 k ψ C ˜ t : 0 t < 2 k E9

generates a set of CCC, where ψ denotes the complex conjugate of ψ .

## 3. Construction of IGC code set from GBFs

In this section, we propose a direct construction of IGC code set by using Boolean algebra and graph theory. Before proposing the main theorem of the construction, we define some sets and vectors and present some lemmas. First we define some notations which will be used throughout in our construction:

• x = x j 0 x j 1 x j k 1 Z 2 k , x = x m p ' x m p + 1 x m 1 Z 2 p .

• b = b 0 b 1 b k 1 , b i = b i , 0 b i , 1 b i , k 1 Z 2 k i = 1 2 2 k .

• d = d 0 d 1 d k 1 Z 2 k , d = d 1 d 2 d p and d j = d j , 1 d j , 2 d j , p Z 2 p j = 1 2 2 p .

• Γ = g m p J g m p + 1 ' ' g m 1 Z q p .

• a · b denotes the dot products of any two vectors a and b which are of the same length.

• A B denotes the Kronecker product of any two matrices of arbitrary size.

• i , j , i = 0 , 1 , , M 1 and j = 1 , 2 , , N denotes a matrix of order M × N .

Let f be a GBF of m variables x 0 , x 1 , , x m 1 over Z q . For b Z 2 k , d Z 2 p , we define order sets S b d and S ˜ b d corresponding to the GBF f as follows:

S b d f + q 2 α = 0 k d α x j α + α = 0 1 b α x j α + α = 1 p d α x m p + α 1 + dx γ : d d α 0 1 , E10

or

S b d = f + q 2 d + b x + d x + dx γ : d Z 2 d Z 2 k , E11

and

S ˜ b d = f ˜ + q 2 d + b x ¯ + d x ¯ + d ¯ x γ : d Z 2 d Z 2 k E12

From the above expression, it is clear that each of the order sets S b d and S ˜ b d contains 2 k + 1 GBFs.

Lemma 2 Let f be a GBF of m variables with the property that each c 0 1 k ,   G ( f x = c ) contains a path over m k p 0 k < m p 0 vertices and p isolated vertices labeled m p , m p + 1 , , m 1 such that 0 k + p m 2 m 2 . Further, assume that there was no edges between deleted vertices (as defined before, the restricted variables in a GBF are considered as the vertices to be deleted in the graph of the Boolean function) and isolated vertices before the deletion. Let x γ be one of the end vertices of the path in G f x = c and the weight of each edge in the path be q / 2 . Let a 1 , a 2 , , a 2 m p be binary vector representations of 0 , 1 , 2 m p 1 of length m p and r 1 , r 2 , , r 2 p be binary vector representations of 0 , 1, 2 p 1 of length p . Also let l be a positive integer such that l = Σ i = 0 k 1 d i 2 j + d 2 k . Then for any choice of g , g j Z q , the codes ψ ( S b d ) and ψ S ˜ b d can be expressed as

ψ S b d = ψ F b l ω Γ + q 2 d r j , l = 0 , 1 , , 2 k + 1 1 , j = 1 , 2 , , 2 p , ψ S ˜ b d = ψ F b l ω Γ + q 2 d r ¯ j , l = 0 , 1 , , 2 k + 1 1 , j = 1 , 2 , , 2 p , E13

where

ψ F b l = ω F b l a 1 ω F b l a 2 ω F b l a 2 m p , ψ F b l ' = ω F b l a 1 ω F b l a 2 ω F b l a 2 m p , F b l = f + q 2 d + b x + dx γ , F b l = f ˜ + q 2 d + b x ¯ + d ¯ x γ , f = Q + i = 0 m p 1 g i x i + g . E14

Proof 1 Since there are no edges between the deleted and isolated vertices before the deletion of k vertices x j 0 , x j 1 , , x j k 1 , the quadratic form Q presented in G f can be expressed as

Q = q 2 α = 0 m k p 1 x π α x π α + 1 + 0 μ < v k 1 b j μ , j v x j μ x j v + α = 0 m k p 1 σ = 0 k 1 c π α j σ x π α x j σ , E15

where π is a permutation over the set 0 1 m 1 j 0 j 1 j k 1 m p m p + 1 m 1 , b j μ , j v Z q which denotes the weight between the vertices x j μ and x j v and c π α , j σ Z q denotes the weight between the vertices x π α and x . Therefore, f is a GBF of m p variables x 0 , x 1 , , x m p 1 , and the GBF f of m variables can be expressed as.

f = f + i = m p m 1 g i x i E16

or

f = f + Γ x ' . E17

Now we define a GBF F l b over m variables by

F l b = f + q 2 d + b x + d x + dx γ = F b l + Γ + q 2 d x . E18

Let a 1 , a 2 , , a 2 m be binary vector representations of 0 , 1 , 2 m 1 of length m , given in Table 1 . The truth table given in Table 1 can also be expressed as the truth table given in Table 2 . Table 3 contains a truth table over m p variables.

 a 1 a 2 ⋮ a 2 m

### Table 1.

Truth table over m variables.

 a 1 ′ r 1 a 2 ′ r 1 ⋮ a 2 m − p ′ r 1 a 1 ′ r 2 a 2 ′ r 2 ⋮ a 2 m − p ′ r 2 ⋮ a 1 ′ r 2 p a 2 ′ r 2 p ⋮ a 2 m − p ′ r 2 p

### Table 2.

Truth table over m variables.

 a 1 ′ a 2 ′ ⋮ a 2 m − p ′

### Table 3.

Truth table over m p variables.

From Tables 1 3 , it is observed that the code ψ S b d can be expressed as

ψ S b d = ω F l b a j , l = 0 , 1 , 2 k + 1 1 , j = 1 , 2 , , 2 m E19

or

ψ S b d = ψ F b l ω Γ + q 2 d r j , l = 0 , 1 , , 2 k + 1 1 , j = 1 , 2 , , 2 p , E20

where

ψ F b l = ω F b l a 1 ω F b l a 2 ω F b l a 2 m 0 , l = 0 , 1 , 2 k + 1 1 . E21

Similarly, we can show that

ψ S ˜ b d = ψ F b l ω Γ + q 2 d r ¯ j , l = 0 , 1 , 2 k + 1 1 , j = 1 , 2 , , 2 p . E22

Example 1 Let f be a GBF of four variables over Z 4 , given by

f x 0 x 1 x 2 x 3 = 2 x 1 x 2 + 3 x 0 x 1 + x 2 + x 0 + x 2 + x 3 + 1 . E23

From the G f , given in Figure 1 , it is clear that after the deletion of the vertex x 0 , the resultant graph contains a path over the vertices x 1 , x 2 and an isolated vertex x 3 . For this example k = 1 and p = 1 . Therefore, the vectors b , d , d , x , Γ and x are of length one and belong to Z 2 .

Hence, b = b j 0 = b 0 = b 0 , d = d 0 = d 0 , d = d 1 = d 1 , x = x j 0 = x 0 = x 0 , Γ = g m p = g 0 = 1 , and x = x m p = x 3 = x 3 . The set of Boolean functions S b 0 d 1 and S ˜ b 0 d 1 are given below:

S b 0 d 1 = f + q 2 d 0 x 0 + b 0 x 0 + d 1 x 3 + dx 2 : d d 0 { 0 1 } , E24

and

s ˜ b 0 d 1 = f ˜ + q 2 d 0 x ¯ 0 + b 0 x ¯ 0 + d 1 x ¯ 3 + d ¯ x 2 : d d 0 { 0 1 } . E25

The GBFs F b 0 l and F b 0 l are given by

F b 0 l = 2 x 1 x 2 + 3 x 0 x 1 + x 2 + x 0 + x 2 + 1 + q 2 d 0 x 0 + b 0 x 0 + dx 2 E26

and

F b 0 l = 2 x ¯ 1 x ¯ 2 + 3 x ¯ 0 x ¯ 1 + x ¯ 2 + x ¯ 0 + x ¯ 2 + 1 + q 2 d 0 x ¯ 0 + b 0 x ¯ 0 + d ¯ x 2 , E27

where l = 0,1,2,3 .

The codes corresponding to the sets of Boolean functions are listed below:

1 ) ψ S 00 = ω 1 ω 2 ω 1 ω 1 ω 2 ω 2 ω 0 ω 3 ω 2 ω 3 ω 2 ω 2 ω 3 ω 3 ω 1 ω 0 ω 1 ω 0 ω 1 ω 3 ω 2 ω 0 ω 0 ω 1 ω 2 ω 1 ω 2 ω 0 ω 3 ω 1 ω 1 ω 2 ω 1 ω 2 ω 1 ω 1 ω 0 ω 0 ω 2 ω 1 ω 2 ω 3 ω 2 ω 2 ω 1 ω 1 ω 3 ω 2 ω 1 ω 0 ω 1 ω 3 ω 0 ω 2 ω 2 ω 3 ω 2 ω 1 ω 2 ω 0 ω 1 ω 3 ω 3 ω 0 = ω 0 ψ C 0 ω 1 ψ C 0 E28

where

ψ C 0 = ω 1 ω 2 ω 1 ω 1 ω 2 ω 2 ω 0 ω 3 ω 1 ω 0 ω 1 ω 3 ω 2 ω 0 ω 0 ω 1 ω 1 ω 2 ω 1 ω 1 ω 0 ω 0 ω 2 ω 1 ω 1 ω 0 ω 1 ω 3 ω 0 ω 2 ω 2 ω 3 .
2 ) ψ S ˜ 00 = ω 0 ω 1 ω 3 ω 3 ω 0 ω 0 ω 1 ω 0 ω 3 ω 0 ω 2 ω 2 ω 3 ω 3 ω 0 ω 3 ω 2 ω 1 ω 1 ω 3 ω 2 ω 0 ω 3 ω 0 ω 1 ω 0 ω 0 ω 2 ω 1 ω 3 ω 2 ω 3 ω 0 ω 1 ω 3 ω 3 ω 2 ω 2 ω 3 ω 2 ω 3 ω 0 ω 2 ω 2 ω 1 ω 1 ω 2 ω 1 ω 2 ω 1 ω 1 ω 3 ω 0 ω 2 ω 1 ω 2 ω 1 ω 0 ω 0 ω 2 ω 3 ω 1 ω 0 ω 1 = ω 1 ψ C ˜ 0 ω 0 ψ C ˜ 0 E29

where

ψ C ˜ 0 = ω 3 ω 0 ω 2 ω 2 ω 3 ω 3 ω 0 ω 3 ω 1 ω 0 ω 0 ω 2 ω 1 ω 3 ω 2 ω 3 ω 3 ω 0 ω 2 ω 2 ω 1 ω 1 ω 2 ω 1 ω 1 ω 0 ω 0 ω 2 ω 3 ω 1 ω 0 ω 1 .
3 ) ψ S 01 = ω 1 ω 2 ω 1 ω 1 ω 2 ω 2 ω 0 ω 3 ω 0 ω 1 ω 0 ω 0 ω 1 ω 1 ω 3 ω 2 ω 1 ω 0 ω 1 ω 3 ω 2 ω 0 ω 0 ω 1 ω 0 ω 3 ω 0 ω 2 ω 1 ω 3 ω 3 ω 0 ω 1 ω 2 ω 1 ω 1 ω 0 ω 0 ω 2 ω 1 ω 0 ω 1 ω 0 ω 0 ω 3 ω 3 ω 1 ω 0 ω 1 ω 0 ω 1 ω 3 ω 0 ω 2 ω 2 ω 3 ω 0 ω 3 ω 0 ω 2 ω 3 ω 1 ω 1 ω 2 . = ω 0 ψ C 0 ω 3 ψ C 0 E30
4 ) ψ S ˜ 01 = ω 2 ω 3 ω 1 ω 1 ω 2 ω 2 ω 3 ω 2 ω 3 ω 0 ω 2 ω 2 ω 3 ω 3 ω 0 ω 3 ω 0 ω 3 ω 3 ω 1 ω 0 ω 2 ω 1 ω 2 ω 1 ω 0 ω 0 ω 2 ω 1 ω 3 ω 2 ω 3 ω 2 ω 3 ω 1 ω 1 ω 0 ω 0 ω 1 ω 0 ω 3 ω 0 ω 2 ω 2 ω 1 ω 1 ω 2 ω 1 ω 0 ω 3 ω 3 ω 1 ω 2 ω 0 ω 3 ω 0 ω 1 ω 0 ω 0 ω 2 ω 3 ω 1 ω 0 ω 1 . = ω 3 ψ C ˜ 0 ω 0 ψ C ˜ 0 E31
5 ) ψ S 10 = ω 1 ω 0 ω 1 ω 3 ω 2 ω 0 ω 0 ω 1 ω 2 ω 1 ω 2 ω 0 ω 3 ω 1 ω 1 ω 2 ω 1 ω 2 ω 1 ω 1 ω 2 ω 2 ω 0 ω 3 ω 2 ω 3 ω 2 ω 2 ω 3 ω 3 ω 1 ω 0 ω 1 ω 0 ω 1 ω 3 ω 0 ω 2 ω 2 ω 3 ω 2 ω 1 ω 2 ω 0 ω 1 ω 3 ω 3 ω 0 ω 1 ω 2 ω 1 ω 1 ω 0 ω 0 ω 2 ω 1 ω 2 ω 3 ω 2 ω 2 ω 1 ω 1 ω 3 ω 2 = ω 0 ψ C 1 ω 1 ψ C 1 E32

where

ψ C 1 = ω 1 ω 0 ω 1 ω 3 ω 2 ω 0 ω 0 ω 1 ω 1 ω 2 ω 1 ω 1 ω 2 ω 2 ω 0 ω 3 ω 1 ω 0 ω 1 ω 3 ω 0 ω 2 ω 2 ω 3 ω 1 ω 2 ω 1 ω 1 ω 0 ω 0 ω 2 ω 1 .
6 ) ψ S ˜ 10 = ω 2 ω 1 ω 1 ω 3 ω 2 ω 0 ω 3 ω 0 ω 1 ω 0 ω 0 ω 2 ω 1 ω 3 ω 2 ω 3 ω 0 ω 1 ω 3 ω 3 ω 0 ω 0 ω 1 ω 0 ω 3 ω 0 ω 2 ω 2 ω 3 ω 3 ω 0 ω 3 ω 2 ω 1 ω 1 ω 3 ω 0 ω 2 ω 1 ω 2 ω 1 ω 0 ω 0 ω 2 ω 3 ω 1 ω 0 ω 1 ω 0 ω 1 ω 3 ω 3 ω 2 ω 2 ω 3 ω 2 ω 3 ω 0 ω 2 ω 2 ω 1 ω 1 ω 2 ω 1 = ω 1 ψ C ˜ 1 ω 0 ψ C ˜ 1 E33

where

ψ C ˜ 1 = ω 1 ω 0 ω 0 ω 2 ω 1 ω 3 ω 2 ω 3 ω 3 ω 0 ω 2 ω 2 ω 3 ω 3 ω 0 ω 3 ω 1 ω 0 ω 0 ω 2 ω 3 ω 1 ω 0 ω 1 ω 3 ω 0 ω 2 ω 2 ω 1 ω 1 ω 2 ω 1 .
7 ) ψ S 11 = ω 1 ω 0 ω 1 ω 3 ω 2 ω 0 ω 0 ω 1 ω 0 ω 3 ω 0 ω 2 ω 1 ω 3 ω 3 ω 0 ω 1 ω 2 ω 1 ω 1 ω 2 ω 2 ω 0 ω 3 ω 0 ω 1 ω 0 ω 0 ω 1 ω 1 ω 3 ω 2 ω 1 ω 0 ω 1 ω 3 ω 0 ω 2 ω 2 ω 3 ω 0 ω 3 ω 0 ω 2 ω 3 ω 1 ω 1 ω 2 ω 1 ω 2 ω 1 ω 1 ω 0 ω 0 ω 2 ω 1 ω 0 ω 1 ω 0 ω 0 ω 3 ω 3 ω 1 ω 0 . = ω 0 ψ C 1 ω 3 ψ C 1 E34
8 ) ψ S ˜ 11 = ω 0 ω 3 ω 3 ω 1 ω 0 ω 2 ω 1 ω 2 ω 1 ω 0 ω 0 ω 2 ω 1 ω 3 ω 2 ω 3 ω 2 ω 3 ω 1 ω 1 ω 2 ω 2 ω 3 ω 2 ω 3 ω 0 ω 2 ω 2 ω 3 ω 3 ω 0 ω 3 ω 0 ω 3 ω 3 ω 1 ω 2 ω 0 ω 3 ω 0 ω 1 ω 0 ω 0 ω 2 ω 3 ω 1 ω 0 ω 1 ω 2 ω 3 ω 1 ω 1 ω 0 ω 0 ω 1 ω 0 ω 3 ω 0 ω 2 ω 2 ω 1 ω 1 ω 2 ω 1 . = ω 3 ψ C ˜ 1 ω 0 ψ C ˜ 1 E35

Theorem 1 Let f be a GBF over m variables as defined in Lemma 1 and Lemma 2. Suppose I 0 , I 1 , , I 2 k + 1 1 are a list of 2 k + 1 code groups defined by

I t = I s t : 0 s < 2 p = ψ S b d : d 0 1 p E36

and

I 2 k + t = I s 2 k + t : 0 s < 2 p = ψ S ˜ b d : d 0 1 p , E37

which forms an IG C code set I 2 k + p + 1 2 k + 1 2 m 2 m p .

Proof 2 Let ψ S b d 1 and ψ S b d 2 be any two codes from a code group I t . Then the ACCF of ψ S b d 1 and ψ S b d 2 at the time shift η 2 m p + τ (where 0 η < 2 p , η Z , 0 τ < 2 m p , τ Z ) is

C ψ S b d 1 ψ S b d 2 η 2 m p + τ = l = 0 2 k + 1 1 C ( ψ F b l , ψ F b l τ i = 1 2 p η ω Γ + q 2 d 1 r i + η Γ + q 2 d 2 r i + l = 0 2 k + 1 1 C ( ψ F b l , ψ F b l τ 2 m p i = 1 2 p η 1 ω Γ + q 2 d 1 r i + η + 1 Γ + q 2 d 2 r i = C ψ C t ψ C t τ i = 1 2 p η ω Γ + q 2 d 1 r i + η Γ + q 2 d 2 r i + C ψ C t ψ C t τ 2 m p i = 1 2 p η 1 ω Γ + q 2 d 1 r i + η + 1 Γ + q 2 d 2 r i = A ψ C t τ i = 1 2 p η ω r + q 2 d 1 r i + η Γ + q 2 d 2 r i + A ψ C t τ 2 m p i = 1 2 p η 1 ω Γ + q 2 d 1 r i + η + 1 Γ + q 2 d 2 r i . E38

For d 1 = d 2 = d , the ACCF given in Eq. (38) reduced to AA C F as follows:

A ψ S b d η 2 m p + τ = 2 m + k p + 1 × Σ i = 1 2 p η ω Γ + q 2 d 1 r i + η Γ + q 2 d 2 r i , τ = 0 , 0 η < 2 p , 0 , 0 < τ < 2 m p , 0 η < 2 p . E39

For d 1 d 2 , the ACCF given in Eq. (38) can be expressed as

C ψ S b d 1 ψ S b d 2 η 2 m p + τ = 2 m + k p + 1 × Σ i = 1 2 p η ω Γ + q 2 d 1 r i + η Γ + q 2 d 2 r i , τ = 0 , 0 < η < 2 p , 0 , τ = 0 , η = 0 , 0 , 0 < τ < 2 m p , 0 η < 2 p . E40

The terms in Eqs. (39) and (40) are derived from the autocorrelation properties of the CC ψ C t . It is also observed that the codes from the same code group I t have ideal auto- and cross-correlation properties inside the Z C Z width 2 m p . Similarly, we can show that

A ψ S ˜ b d η 2 m p + τ = 2 m + k p + 1 × Σ i = 1 2 p η ω Γ + q 2 d 2 r ¯ i Γ + q 2 d 1 r ¯ i + η , τ = 0 , 0 η < 2 p , 0 , 0 < τ < 2 m p , 0 η < 2 p , E41

and for d 1 d 2 ,

C ψ S ˜ b d 1 ' ψ S ˜ b d 2 η 2 m p + τ = 2 m + k p + 1 × Σ i = 1 2 p η ω Γ + q 2 d 2 r ¯ i Γ + q 2 d 1 r ¯ i + η , τ = 0 , 0 < η < 2 p , 0 , τ = 0 , η = 0 , 0 , 0 < τ < 2 m p , 0 η < 2 p . E42

From Eqs. (41) and (42), we get that the codes from the same code group I 2 k + t have ideal auto- and cross-correlation properties inside the Z C Z width 2 m p .

Now we show that the ACCFs between any two codes of any two different code groups I t 1 and I t 2 0 t 1 t 2 < 2 k are zeros everywhere. Let ψ S b 1 d 1 I t 1 , ψ S b 2 d 2 I t 2 where b 1 , b 2 are binary vector representations of t 1 , t 2 , and d 1 , d 2 are any two binary vectors in Z 2 p . Then

C ψ S b 1 d 1 ψ S b 2 d 2 η 2 m p + τ = l = 0 2 k + 1 1 C ( ψ F b 1 l , ψ F b 2 l τ i = 1 2 p η ω Γ + q 2 d 1 r i + η Γ + q 2 d 2 r i + l = 0 2 k + 1 1 C ( ψ F b 1 l , ψ F b 2 l τ 2 m p i = 1 2 p η 1 ω Γ + q 2 d 1 r i + η + 1 Γ + q 2 d 2 r i = C ψ C t ψ C t τ i = 1 2 p η ω Γ + q 2 d 1 r i + η Γ + q 2 d 2 r i + C ψ C t ψ C t τ 2 m p i = 1 2 p η 1 ω Γ + q 2 d 1 r i + η + 1 Γ + q 2 d 2 r i = 0 τ , η . E43

Similarly, we can also show that the ACCFs between any two codes of any two different code groups I 2 k + t 1 and I 2 k + t 2 0 t 1 t 2 < 2 k are zeros everywhere, i.e.,

C ψ S ˜ b 1 d 1 ψ S ˜ b 2 d 2 η 2 m p + τ = l = 0 2 k + 1 1 C ( ψ F b 1 l , ψ F b 2 l τ i = 1 2 p η ω Γ + q 2 d 2 r i Γ + q 2 d 1 r i + η + l = 0 2 k + 1 1 C ( ψ F b 1 l , ψ F b 2 l τ 2 m p i = 1 2 p η 1 ω Γ + q 2 d 2 r i Γ + q 2 d 1 r i + η + 1 = C ψ C ˜ t 1 ψ C ˜ t 2 τ 2 m p i = 1 2 p η 1 ω Γ + q 2 d 2 r i Γ + q 2 d 1 r i + η + C ψ C ˜ t 1 ψ C ˜ t 2 τ 2 m p i = 1 2 p η 1 ω Γ + q 2 d 2 r i Γ + q 2 d 1 r i + η + 1 = 0 τ , η . E44

The results in Eqs. (43) and (44) are obtained by using the ideal cross-correlation properties of CCCs. To complete the proof, now we only need to show that the ACCFs of any code from I t u and I 2 k + t v u v Z 1 u v 2 k are zeros everywhere. In this case, t u and t v are any two integers in 0 2 k and may or may not be equal. Let ψ ( S b u d 1 ' I t u , ψ S ˜ b v d 2 ' I 2 k + t v where b u , b v are binary vector representations of t u , t v , respectively. Then

C ψ S b u d 1 ψ S ˜ b v d 2 η 2 m p + τ = l = 0 2 k + 1 1 C ( ψ F b u l , ψ F b v l τ i = 1 2 p η ω Γ + q 2 d 1 r i + η Γ + q 2 d 2 r i + l = 0 2 k + 1 1 C ( ψ F b u l , ψ F b vl τ i = 1 2 p η ω Γ + q 2 d 1 r i + η Γ + q 2 d 2 r i = C ψ C t u ψ C t v τ 2 m p i = 1 2 p η 1 ω Γ + q 2 d 1 r i + η Γ + q 2 d 2 r i + C ψ C t u ψ C ˜ t v τ 2 m p i = 1 2 p η 1 ω Γ + q 2 d 1 r i + η + 1 Γ + q 2 d 2 r i = 0 τ , η . E45

The above result is also obtained by using the ideal cross-correlation properties of CCCs. From Eqs. (39)-(45), we observed that the AA C Fs and ACCFs of the codes of the same group are zeros inside the ZCZ width 2 m p and the ACCFs of the codes from different code groups are zeros everywhere. Hence, we can conclude that I 0 , I 1 , , I 2 k + 1 1 form an IG C code set I 2 k + p + 1 2 k + 1 2 m 2 m p .

Example 2 Let f be a GBF of four variables as given in Example 1. Then the obtained IG C code set I 8,4,16,8 corresponding to the GBF f is given below:

Code group 1:

I 0 0 = ψ S 00 = ω 1 ω 2 ω 1 ω 1 ω 2 ω 2 ω 0 ω 3 ω 2 ω 3 ω 2 ω 2 ω 3 ω 3 ω 1 ω 0 ω 1 ω 0 ω 1 ω 3 ω 2 ω 0 ω 0 ω 1 ω 2 ω 1 ω 2 ω 0 ω 3 ω 1 ω 1 ω 2 ω 1 ω 2 ω 1 ω 1 ω 0 ω 0 ω 2 ω 1 ω 2 ω 3 ω 2 ω 2 ω 1 ω 1 ω 3 ω 2 ω 1 ω 0 ω 1 ω 3 ω 0 ω 2 ω 2 ω 3 ω 2 ω 1 ω 2 ω 0 ω 1 ω 3 ω 3 ω 0 I 1 0 = ψ S 01 = ω 1 ω 2 ω 1 ω 1 ω 2 ω 2 ω 0 ω 3 ω 0 ω 1 ω 0 ω 0 ω 1 ω 1 ω 3 ω 2 ω 1 ω 0 ω 1 ω 3 ω 2 ω 0 ω 0 ω 1 ω 0 ω 3 ω 0 ω 2 ω 1 ω 3 ω 3 ω 0 ω 1 ω 2 ω 1 ω 1 ω 0 ω 0 ω 2 ω 1 ω 0 ω 1 ω 0 ω 0 ω 3 ω 3 ω 1 ω 0 ω 1 ω 0 ω 1 ω 3 ω 0 ω 2 ω 2 ω 3 ω 0 ω 3 ω 0 ω 2 ω 3 ω 1 ω 1 ω 2 . E46

Code group 2:

I 0 1 = ψ S 10 = ω 1 ω 0 ω 1 ω 3 ω 2 ω 0 ω 0 ω 1 ω 2 ω 1 ω 2 ω 0 ω 3 ω 1 ω 1 ω 2 ω 1 ω 2 ω 1 ω 1 ω 2 ω 2 ω 0 ω 3 ω 2 ω 3 ω 2 ω 2 ω 3 ω 3 ω 1 ω 0 ω 1 ω 0 ω 1 ω 3 ω 0 ω 2 ω 2 ω 3 ω 2 ω 1 ω 2 ω 0 ω 1 ω 3 ω 3 ω 0 ω 1 ω 2 ω 1 ω 1 ω 0 ω 0 ω 2 ω 1 ω 2 ω 3 ω 2 ω 2 ω 1 ω 1 ω 3 ω 2 I 1 1 = ψ S 11 = ω 1 ω 0 ω 1 ω 3 ω 2 ω 0 ω 0 ω 1 ω 0 ω 3 ω 0 ω 2 ω 1 ω 3 ω 3 ω 0 ω 1 ω 2 ω 1 ω 1 ω 2 ω 2 ω 0 ω 3 ω 0 ω 1 ω 0 ω 0 ω 1 ω 1 ω 3 ω 2 ω 1 ω 0 ω 1 ω 3 ω 0 ω 2 ω 2 ω 3 ω 0 ω 3 ω 0 ω 2 ω 3 ω 1 ω 1 ω 2 ω 1 ω 2 ω 1 ω 1 ω 0 ω 0 ω 2 ω 1 ω 0 ω 1 ω 0 ω 0 ω 3 ω 3 ω 1 ω 0 . E47

Code group 3:

I 0 2 = ψ S ˜ 00 = ω 0 ω 3 ω 1 ω 1 ω 0 ω 0 ω 3 ω 0 ω 1 ω 0 ω 2 ω 2 ω 1 ω 1 ω 0 ω 1 ω 2 ω 3 ω 3 ω 1 ω 2 ω 0 ω 1 ω 0 ω 3 ω 0 ω 0 ω 2 ω 3 ω 1 ω 2 ω 1 ω 0 ω 3 ω 1 ω 1 ω 2 ω 2 ω 1 ω 2 ω 1 ω 0 ω 2 ω 2 ω 3 ω 3 ω 2 ω 3 ω 2 ω 3 ω 3 ω 1 ω 0 ω 2 ω 3 ω 2 ω 3 ω 0 ω 0 ω 2 ω 1 ω 3 ω 0 ω 3 I 1 2 = ψ S ˜ 01 = ω 2 ω 1 ω 3 ω 3 ω 2 ω 2 ω 1 ω 2 ω 1 ω 0 ω 2 ω 2 ω 1 ω 1 ω 0 ω 1 ω 0 ω 1 ω 1 ω 3 ω 0 ω 2 ω 3 ω 2 ω 3 ω 0 ω 0 ω 2 ω 3 ω 1 ω 2 ω 1 ω 2 ω 1 ω 3 ω 3 ω 0 ω 0 ω 3 ω 0 ω 1 ω 0 ω 2 ω 2 ω 3 ω 3 ω 2 ω 3 ω 0 ω 1 ω 1 ω 3 ω 2 ω 0 ω 1 ω 0 ω 3 ω 0 ω 0 ω 2 ω 1 ω 3 ω 0 ω 3 . E48

Code group 4:

I 0 3 = ψ S ˜ 10 = ω 2 ω 3 ω 3 ω 1 ω 2 ω 0 ω 1 ω 0 ω 3 ω 0 ω 0 ω 2 ω 3 ω 1 ω 2 ω 1 ω 0 ω 3 ω 1 ω 1 ω 0 ω 0 ω 3 ω 0 ω 1 ω 0 ω 2 ω 2 ω 1 ω 1 ω 0 ω 1 ω 2 ω 3 ω 3 ω 1 ω 0 ω 2 ω 3 ω 2 ω 3 ω 0 ω 0 ω 2 ω 1 ω 3 ω 0 ω 3 ω 0 ω 3 ω 1 ω 1 ω 2 ω 2 ω 1 ω 2 ω 1 ω 0 ω 2 ω 2 ω 3 ω 3 ω 2 ω 3 I 1 3 = ψ S ˜ 11 = ω 0 ω 1 ω 1 ω 3 ω 0 ω 2 ω 3 ω 2 ω 3 ω 0 ω 0 ω 2 ω 3 ω 1 ω 2 ω 1 ω 2 ω 1 ω 3 ω 3 ω 2 ω 2 ω 1 ω 2 ω 1 ω 0 ω 2 ω 2 ω 1 ω 1 ω 0 ω 1 ω 0 ω 1 ω 1 ω 3 ω 2 ω 0 ω 1 ω 0 ω 3 ω 0 ω 0 ω 2 ω 1 ω 3 ω 0 ω 3 ω 2 ω 1 ω 3 ω 3 ω 0 ω 0 ω 3 ω 0 ω 1 ω 0 ω 2 ω 2 ω 3 ω 3 ω 2 ω 3 . E49

The correlation properties of I (8, 4, 16, 8) are described in Figure 2 where Figure 2a presents the absolute value of AACF sum of each code in I 8,4,16,8 , Figure 2b shows absolute value of ACCF sum between any two distinct codes from the same code group, and Figure 2c presents the absolute value of ACCF sum between any two distinct codes from different code groups.

## 4. Summary

In this chapter, we have presented a direct construction of IGC code set by using second-order GBFs. The AACF sidelobes of the codes of constructed IGC code set are zeros within ZCZ width, and the ACCFs of any two different codes of the same code group are zeros inside the ZCZ width, whereas the ACCFs of any two different codes from two different code groups are zeros everywhere. We have shown that there is a relation between our proposed construction and graph. The ZCZ width of the proposed IGC code set depends on the number of isolated vertices present in a graph after the deletion of some vertices. We also have shown that the ZCZ width of the proposed IGC code set by our construction is flexible and it can extend their applications. It is observed that most of the constructions given in literature are based on CCCs, whereas our construction can produce IGC code set directly.

## References

1. 1. Hanzo LL, Yang L-L, Kuan E-L, Yen K. CDMA Overview. United States: IEEE; 2004. Available from: https://ieeexplore.ieee.org/document/5732958
2. 2. Fazel K, Kaiser S. MC-CDMA and MC-DS-CDMA. United States: Wiley; 2008. Available from: https://ieeexplore.ieee.org/document/8043168
3. 3. Golay M. Complementary series. IRE Transactions on Information Theory. 1961;7(2):82-87
4. 4. Tseng C-C, Liu C. Complementary sets of sequences. IEEE Transactions on Information Theory. 1972;18(5):644-652
5. 5. Davis JA, Jedwab J. Peak-to-mean power control in OFDM, Golay complementary sequences, and Reed-Muller codes. IEEE Transactions on Information Theory. 1999;45(7):2397-2417
6. 6. Paterson KG. Generalized Reed-Muller codes and power control in OFDM modulation. IEEE Transactions on Information Theory. 2000;46(1):104-120
7. 7. Sarkar P, Majhi S, Liu Z. A direct and generalized construction of polyphase complementary set with low PMEPR and high code-rate for OFDM system. n.d. Available from: http://arxiv.org/abs/1901.05545
8. 8. Rathinakumar A, Chaturvedi AK. Complete mutually orthogonal Golay complementary sets from Reed-Muller codes. IEEE Transactions on Information Theory. 2008;54(3):1339-1346
9. 9. Ke P, Zhou Z. A generic construction of Z-periodic complementary sequence sets with flexible flock size and zero correlation zone length. IEEE Signal Processing Letters. 2015;22(9):1462-1466
10. 10. Liu Z, Guan YL, Parampalli U. New complete complementary codes for peak-to-mean power control in multi-carrier CDMA. IEEE Transactions on Communications. 2014;62(3):1105-1113
11. 11. Das S, Budišin S, Majhi S, Liu Z, Guan YL. A multiplier-free generator for polyphase complete complementary codes. IEEE Transactions on Signal Processing. 2018;66(5):1184-1196
12. 12. Liu Z, Guan YL, Chen HH. Fractional-delay-resilient receiver design for interference-free MC-CDMA communications based on complete complementary codes. IEEE Transactions on Wireless Communications. 2015;14(3):1226-1236
13. 13. Fan P, Yuan W, Tu Y. Z-complementary binary sequences. IEEE Signal Processing Letters. 2007;14(8):509-512
14. 14. Li X, Fan P, Tang X, Hao L. Constructions of quadriphase Z-complementary sequences. In: Fourth International Workshop on Signal Design and its Applications in Communications; 2009. pp. 36-39
15. 15. Adhikary AR, Majhi S, Liu Z, Guan YL. New sets of even-length binary Z-complementary pairs with asymptotic ZCZ ratio of 3/4. IEEE Signal Processing Letters. 2018;25(7):970-973
16. 16. Sarkar P, Majhi S, Liu Z. Optimal Z-complementary code set from generalized Reed-Muller codes. IEEE Transactions on Communications. 2019;67(3):1783-1796
17. 17. Zhang C, Tao X, Yamada S, Hatori M. Sequence set with three zero correlation zones and its application in MC-CDMA system. IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences. 2006;E89-A(9):2275-2282
18. 18. Liu Z, Guan YL, Ng BC, Chen HH. Correlation and set size bounds of complementary sequences with low correlation zone. IEEE Transactions on Communications. 2011;59(12):3285-3289
19. 19. Li J, Huang A, Guizani M, Chen HH. Inter group complementary codes for interference resistant CDMA wireless communications. IEEE Transactions on Wireless Communications. 2008;7(1):166-174
20. 20. Feng L, Zhou X, Fan P. A construction of inter-group complementary codes with flexible ZCZ length. Journal of Zhejiang University SCIENCE-C. 2011;12(10):846-854

Written By

Palash Sarkar and Sudhan Majhi

Submitted: 23 January 2019 Reviewed: 08 May 2019 Published: 10 July 2019