- Research Article
- Open Access

# Z-Complementary Sets Based on Sequences with Periodic and Aperiodic Zero Correlation Zone

- Zhenyu Zhang
^{1, 2}Email author, - Wei Chen
^{1}, - Fanxin Zeng
^{2}, - Hua Wu
^{1}and - Yuanhong Zhong
^{1}

**2009**:418026

https://doi.org/10.1155/2009/418026

Â© Zhenyu Zhang et al. 2009

**Received:**18 September 2008**Accepted:**10 February 2009**Published:**23 March 2009

## Abstract

Methods of constructing Z-complementary sequence sets are described. Different from those constructions using complementary sequences as a kernel, the proposed constructions are based on sequences with periodic and aperiodic zero-correlation zone (PAZCZ). These PAZCZ sequences are unitary sequences, not complementary sequences. By means of interleaving iteration and orthogonal matrix expansion of PAZCZ sequences, desirable bivalued zero cross-correlation zone (ZCCZ) characteristics can be obtained. Compared with Z-complementary sequence sets with single value ZCCZ which is generally equal to the length of an element sequence, the proposed Z-complementary sequence sets with bivalued ZCCZ have larger set size and then can support more users.

## Keywords

- Correlation Property
- Element Sequence
- Complementary Sequence
- Flock Size
- Code Division Multiple Access System

## 1. Introduction

Complementary sequences, first studied by Golay [1], have many useful properties for radar applications and spread-spectrum communications. Different from unitary sequences which work on a one-sequence-per-user basis, complementary sequences work on a one-flock-per-user basis [2]. It was shown in [3, 4] that orthogonal complementary (OC) sequences with ideal autocorrelation function (ACF) and cross-correlation function (CCF) can improve spectrum efficiency and bit error rate (BER) performance of code division multiple access (CDMA) systems.

Although OC sequences have ideal correlation properties, they cannot support the large number of users since the set size must not be larger than the flock size [2, 5]. To increase the set size of complementary sequence sets, the idea of zero-correlation zone (ZCZ) [6â€“8] or interference-free windows (IFWs) [9, 10] was exploited to the generation of complementary sequences, and generalized pairwise complementary (GPC) sequences [11] with the setwise uniform IFWs were constructed on the basis of complete complementary sequences [12] and generalized even shift orthogonal sequences [13]. Similar to the construction idea of GPC sequences, generalized pairwise Z-complementary (GPZ) sequences were generated in [14]. GPZ sequences are based on generalized even shift orthogonal-like sequences and include GPC sequences as a special case.

Compared with GPC and GPZ sequences which limit the flock size to be two, Z-complementary binary sequences [15] have fewer restrictions on the flock size. As a more general concept, Z-complementary sequences include the conventional complementary sequences as special cases. These sequences can efficiently resolve the limits on the lengths of conventional complementary sequences, and the theoretical bound given by [15] shows that Z-complementary sequences have much larger set size than conventional complementary sequences. In terms of the set of Z-complementary mates generated in [15], the zero cross-correlation zone (ZCCZ) is equal to the length of element sequences, and is usually larger than the zero autocorrelation zone (ZACZ) except that Z-complementary sequences become conventional complementary sequences.

Different from Z-complementary sequences with single value ZCCZ, intergroup complementary (IGC) sequences [16] possess a bivalued ZCCZ. The IGC sequence set is divided into several sequence groups. CCFs of any two sequences from the same group are zero within an intragroup IFW, while CCFs of any two sequences from different groups are zero everywhere. According to the theoretical bound in [15], the set size of IGC sequences comes up to the maximum number. However, just like other complementary sequences, IGC sequences still use a complementary sequence set as a basic kernel, which limits the employment of unitary sequences in the construction of complementary sequences.

Actually, the idea of dividing a sequence set into multiple groups and hence obtaining bivalued ZCCZ first appears in [17] as mutually orthogonal sets of ZCZ sequences. Each of these sets is a ZCZ set, and any two sets are mutually orthogonal, which increases the number of available sequences for CDMA systems. Mutually orthogonal sets of ZCZ sequences can also be constructed in a new framework for constructing mutually orthogonal complementary sets and ZCZ sequences [18]. The framework involved characteristic matrices and mutually orthogonal Golay complementary sets (MOGCSs), and the required complete MOGCS in the framework was further studied on the basis of Reed-Muller codes in [19]. In comparison with MOGCS, GPC, Z-complementary sequences, IGC, and GPZ, it can be seen that mutually orthogonal sets of ZCZ sequences are unitary sequence sets, not complementary sequence sets.

This paper proposes methods to construct Z-complementary sets based on a set of sequences with PAZCZ which is a set of unitary sequences. By means of orthogonal matrix expansion and interleaving operation, two novel sets of Z-complementary sequences can be generated from a basic kernel of a PAZCZ sequence set. As an extension for Z-complementary sequences with single value ZCCZ in [15], the presented Z-complementary sequences have a bivalued ZCCZ like IGC sequences and can come up to the maximal set size as long as the kernel of PAZCZ sequences comes up to the maximal set size in terms of the theoretical bound on ZCZ sequences in [20].

The paper is organized as follows. In Section 2, we briefly introduce the definitions and notations used in the present paper. By using a PAZCZ sequence set as a basic kernel, Sections 3 and 4 present two construction schemes of Z-complementary sequences on the basis of orthogonal matrix expansion and interleaving operation, respectively. Some potential applications of the proposed sequence sets are described in Section 5, and we conclude the paper in Section 6.

## 2. Preliminary Considerations

Z-complementary sequences generally have larger set size than normal complementary sequences at the expense of correlation properties. Actually, a Z-complementary set can be considered to be a trade-off between correlation properties and set size. Although ideal correlation properties cannot be obtained, the CCFs and out-of-phase ACFs of Z-complementary sequences are zero within a region around the zero shift. Z-complementary sequences can be defined as follows.

where is the aperiodic ACF of element sequence . The notations and denote the length of ZCZ and the energy of element sequence , respectively.

where the symbol* denotes a complex conjugate. When , the above definition becomes aperiodic ACF .

where is performed modulo . When , the above definition becomes periodic ACF of .

where denotes the largest integer smaller than or equal to .

From (5), a Z-complementary set generally has larger set size than a conventional complementary set even if the conventional complementary set is complete. However, for the fixed processing gain and the length of ZCZ, the set size of a Z-complementary set is smaller than that of mutually orthogonal ZCZ sequence sets in [17â€“19] and is usually comparable to the set size of each set of mutually orthogonal ZCZ sequence sets without regard to correlation properties.

When a Z-complementary set is divided into several sequence groups, the set will have the bivalued ZCCZ characteristics like IGC sequences. We assume that a Z-complementary set with set size , flock size , element sequence length , and ZCZ length , contains sequence groups, then the Z-complementary set can be denoted by .

According to the definition of Z-complementary sequences, a Z-complementary set becomes a conventional complementary set when , and becomes a PAZCZ set when in terms of the definition of PAZCZ sequences in [21, 22]. Then Z-complementary sequences include the conventional complementary sequences and PAZCZ sequences as special cases.

## 3. Sequence Construction Based on Orthogonal Matrix Expansion

A new scheme for the construction of Z-complementary set is presented in this section. The constructed sequences have good correlation properties and large set size. To show the performance of the generated sequences, a construction example is given.

### 3.1. The Construction Scheme

The proposed construction uses an arbitrary PAZCZ sequence set as a basic kernel. By means of orthogonal matrix expansion, the bivalued ZCCZ characteristics can be obtained.

Construction 1.

is a Z-complementary set , where the notation denotes Kronecker product.

becomes a group, and each group consists of
sequences with each sequence containing
element sequences of length
. Then the constructed Z-complementary set
consists of
Z-complementary sequences, and the
th Z-complementary sequence which is also referred to as the *k* th Z-complementary sequence in the *u* th group can be denoted by
, where
,
,
and
denotes the *v* th element sequence of
.

When , the above Z-complementary set becomes the PAZCZ sequence set . Therefore, is a special case of the constructed Z-complementary set and can be also denoted by .

### 3.2. Correlation Properties of the Constructed Set

The aperiodic and periodic correlation properties of the designed set in Construction 1 satisfy the following theorem.

Theorem 1.

The generated Z-complementary set in Construction 1 has bivalued ZCCZ. The ZCCZ of any two sequences in a group is equal to , and the ZCCZ of any two sequences from different groups is equal to , that is, sequences from different groups are completely complementary. The ZACZ of the set is .

Proof.

For (10), when and , becomes ACF of and is equal to . Then the ZACZ of set is the same as one of the PAZCZ set and is .

When and , (10) represents CCF of two sequences from the same group, namely, intragroup CCF. We have . Then the intragroup ZCCZ of set is the same as the ZCCZ of the PAZCZ set and is .

When , (10) denotes CCF of two sequences from different groups, namely, intergroup CCF. Due to the orthogonality of matrix , we have , and then .

According to the above analysis, the aperiodic correlation properties of the constructed sequences satisfy Theorem 1. Similar to aperiodic correlation properties, periodic correlation properties can be easily analyzed, and the corresponding proof is omitted.

In terms of Theorem 1, it is obvious that the constructed Z-complementary sequences have better correlation properties than unitary sequences, such as m-sequence and gold sequences. In addition, for the same intragroup ZCCZ, the Z-complementary set with bivalued ZCCZ has larger intergroup ZCCZ than mutually orthogonal ZCZ sequence sets, since the generated Z-complementary set has ideal intergroup cross-correlation properties while a sequence from one set of mutually orthogonal ZCZ sequence sets is usually nonorthogonal to a sequence from another set for nonzero shifts. Compared with the idea of large ZCZ set with smaller subsets of larger ZCZ than the original set [18, 19], the intergroup ZCCZ of the constructed Z-complementary set with bivalued ZCCZ is usually larger than its intragroup ZCCZ.

### 3.3. Set Size of the Constructed Set

We assume that the PAZCZ sequence set has the maximum set size in terms of the theoretical bound in [20], namely, . Then it is obvious that the constructed Z-complementary set has the maximum set size in terms of (5) as long as , in which case the set size of is times large as that of conventional complete complementary set like complete MOGCS.

### 3.4. An Example

Let be a Walsh-Hadamard matrix and be expressed as .

## 4. Sequence Construction Based on Interleaving Iteration

According to Construction 1, the orthogonal matrix expansion method assures that the generated Z-complementary sequences from different groups are completely complementary. However, this method cannot increase the ZACZ and intragroup ZCCZ which are the same as the ZCZ of a basic PAZCZ set kernel. In order to obtain larger ZCZ than one of a basic PAZCZ set kernel, the interleaving method is used to construct Z-complementary sets in this section.

### 4.1. The Iterative Construction

The interleaving operation is a significant expansion method and has wide applications to constructions of conventional complementary sequences [5, 23]. In [15], the bit-interleaved operation can be used to lengthen the element sequences of a single Z-complementary sequence, and then a new Z-complementary sequence can be obtained from a shorter Z-complementary sequence. Compared with the interleaving method for a single Z-complementary sequence in [15], we generate a novel Z-complementary set by interleaving an arbitrary PAZCZ set kernel which is a unitary sequence set. Different from the results with single value ZCCZ in [5, 15, 23], the constructed Z-complementary set with multiple sequence groups has bivalued ZCCZ characteristics while its ZACZ and intragroup ZCCZ can be increased by the iterative procedure of the interleaving operation.

Construction 2.

where
represents the matrix whose *ij* th entry is the *ij* th negation of
, and
denotes the bit-interleaved operation between
and
. Then the set
in matrix form is a Z-complementary set
.

Each row of the set
in matrix form is a Z-complementary sequence. After
iterations, there are
Z-complementary sequences in total. These sequences are divided into
groups with each group containing
Z-complementary sequences. The sequences from the
th row to the
th row in
compose the *r* th group, where
. The *s* th element sequence of the *k* th Z-complementary sequence in the *r* th group for
can be denoted by
, where
and
.

In comparison with the interleaving operation in [15], the proposed method in Construction 2 can generate multiple sequence groups and obtain larger set size, which guarantees that the CDMA systems using such Z-complementary sets can accommodate more users.

### 4.2. Correlation Properties of the Constructed Set

Theorem 2.

The generated Z-complementary set in Construction 2 has bivalued ZCCZ. Intergroup ZCCZ is , that is, sequences from different groups are completely complementary. Both of ZACZ and intragroup ZCCZ are equal to .

Proof.

We first consider aperiodic correlation properties. Let and denote the Z-complementary sequence in the group and the Z-complementary sequence in the group for , respectively, where and .

where denotes the chip index of the correlation function of . Equation (15) is the ACF of when and is the intragroup CCF of when .

When , we have

*n*th iteration, we have

where and .

From (19), (20), (22), and (23), we have proved that the aperiodic correlation properties of the constructed sequences in Construction 2 satisfy Theorem 2. For periodic correlation properties, similar analysis can be easily obtained, and the corresponding proof is omitted.

### 4.3. Set Size of the Constructed Set

Similar to Construction 1, when the PAZCZ sequence set has the maximum set size (namely, ), the constructed Z-complementary set in Construction 2 has the maximum set size in terms of (5).

### 4.4. An Example

## 5. Applications

Compared with PAZCZ sequence sets, the proposed Z-complementary sets in this paper have bivalued ZCCZ characteristics. Then better correlation properties can be obtained, and wider applications can be considered. The constructed sequences can be used in IGC-CDMA systems [16] since IGC sequences also possess bivalued ZCCZ characteristics. In addition, when the flock sizes of Constructions 1 and 2 are fixed to be two, we can apply the generated Z-complementary sets to those systems exploiting GPC [11] and GPZ [14] sequences. By choosing a suitable PAZCZ set kernel and controlling construction parameters in Constructions 1 and 2, the designed sequences can be adapted to various requirements of the above systems.

It should be noted that sequences with ZCZ just for periodic correlation function, which are usually called ZCZ sequences, can be used as a basic kernel when some CDMA systems only need good periodic correlation properties. Compared PAZCZ sequences, ZCZ sequences have received more attention. Then one can have a wider choice to generate Z-complementary sets just with periodic ZCZ in terms of Constructions 1 and 2.

Since correlation functions of complementary sequences are based on a flock of element sequences jointly instead of a single sequence, these element sequences should be transmitted via different channels which are usually different carriers like the cases in [3, 4, 16]. Therefore, complementary sequences, such as IGC sequences and Z-complementary sequences, are more sensitive to frequency selective fading channel than mutually orthogonal ZCZ sequence sets which are unitary sequence sets. It actually becomes the main drawback in applications of complementary sequences to multicarrier systems.

## 6. Conclusions

In this paper, two novel kinds of Z-complementary sets on the basis of a PAZCZ set are generated. As a basic kernel, the PAZCZ set affects significantly the ZCZ length and set size of the designed Z-complementary set, and it can be expanded by means of orthogonal matrix and the interleaving iteration. The proposed expansions of a PAZCZ set provide efficient and flexible ways to construct Z-complementary sets with bivalued ZCCZ characteristics.

## Declarations

### Acknowledgment

This work was supported in part by the National Science Foundation of China (NSFC) under Grant no. 60872164.

## Authorsâ€™ Affiliations

## References

- Golay MJE: Complementary series.
*IRE Transactions on Information Theory*1961, 7(2):82-87. 10.1109/TIT.1961.1057620MathSciNetView ArticleGoogle Scholar - Chen H-H, Chiu H-W: Generation of perfect orthogonal complementary codes for their applications in interference-free CDMA systems.
*Proceedings of the 15th IEEE International Symposium on Personal, Indoor and Mobile Radio Communications (PIMRC '04), September 2004, Barcelona, Spain*1: 734-738.Google Scholar - Tseng S-M, Bell MR: Asynchronous multicarrier DS-CDMA using mutually orthogonal complementary sets of sequences.
*IEEE Transactions on Communications*2000, 48(1):53-59. 10.1109/26.818873View ArticleGoogle Scholar - Chen H-H, Yeh J-F, Suehiro N: A multicarrier CDMA architecture based on orthogonal complementary codes for new generations of wideband wireless communications.
*IEEE Communications Magazine*2001, 39(10):126-135. 10.1109/35.956124View ArticleGoogle Scholar - Fan PZ, Darnell M:
*Sequence Design for Communications Applications*. John Wiley & Sons, London, UK; 1996.Google Scholar - Fan PZ, Suehiro N, Kuroyanagi N, Deng XM: Class of binary sequences with zero correlation zone.
*Electronics Letters*1999, 35(10):777-779. 10.1049/el:19990567View ArticleGoogle Scholar - Fan PZ, Hao L: Generalized orthogonal sequences and their applications in synchronous CDMA systems.
*IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences*2000, E83-A(11):2054-2066.Google Scholar - Torii H, Nakamura M, Suehiro N: A new class of zero-correlation zone sequences.
*IEEE Transactions on Information Theory*2004, 50(3):559-565. 10.1109/TIT.2004.825399MATHMathSciNetView ArticleGoogle Scholar - Li D: A method for spread spectrum multiple access coding with zero correlation window. PCT/CN2000/000028, August 2001Google Scholar
- Li D: The perspectives of large area synchronous CDMA technology for the fourth-generation mobile radio.
*IEEE Communications Magazine*2003, 41(3):114-119. 10.1109/MCOM.2003.1186554View ArticleGoogle Scholar - Chen H-H, Yeh Y-C, Zhang X,
*et al*.: Generalized pairwise complementary codes with set-wise uniform interference-free windows.*IEEE Journal on Selected Areas in Communications*2006, 24(1):65-74.View ArticleGoogle Scholar - Suehiro N, Hatori M: N-shift cross-orthogonal sequences.
*IEEE Transactions on Information Theory*1988, 34(1):143-146. 10.1109/18.2615MathSciNetView ArticleGoogle Scholar - Taki Y, Miyakawa H, Hatori M, Namba S: Even-shift orthogonal sequences.
*IEEE Transactions on Information Theory*1969, 15(2):295-300. 10.1109/TIT.1969.1054284MathSciNetView ArticleGoogle Scholar - Feng LF, Fan PZ, Tang XH, Loo K-K: Generalized pairwise Z-complementary codes.
*IEEE Signal Processing Letters*2008, 15: 377-380.View ArticleGoogle Scholar - Fan PZ, Yuan W, Tu Y: Z-complementary binary sequences.
*IEEE Signal Processing Letters*2007, 14(8):509-512.View ArticleGoogle Scholar - Li J, Huang A, Guizani M, Chen H-H: Inter-group complementary codes for interference-resistant CDMA wireless communications.
*IEEE Transactions on Wireless Communications*2008, 7(1):166-174.View ArticleGoogle Scholar - Rathinakumar A, Chaturvedi AK: Mutually orthogonal sets of ZCZ sequences.
*Electronics Letters*2004, 40(18):1133-1134. 10.1049/el:20045628View ArticleGoogle Scholar - Rathinakumar A, Chaturvedi AK: A new framework for constructing mutually orthogonal complementary sets and ZCZ sequences.
*IEEE Transactions on Information Theory*2006, 52(8):3817-3826.View ArticleGoogle Scholar - Rathinakumar A, Chaturvedi AK: Complete mutually orthogonal Golay complementary sets from Reed-Muller codes.
*IEEE Transactions on Information Theory*2008, 54(3):1339-1346.MATHMathSciNetView ArticleGoogle Scholar - Tang XH, Fan PZ, Matsufuji S: Lower bounds on correlation of spreading sequence set with low or zero correlation zone.
*Electronics Letters*2000, 36(6):551-552. 10.1049/el:20000462View ArticleGoogle Scholar - Li D: A high spectrum efficient multiple access code.
*Proceedings of the 5th Asia-Pacific Conference on Communications and 4th Optoelectronics and Communications Conference (APCC/OECC '99), October 1999, Beijing, China*1: 598-605.Google Scholar - Donelan H, O'Farrell T: Families of ternary sequences with aperiodic zero correlation zones for MC-DS-CDMA.
*Electronics Letters*2002, 38(25):1660-1661. 10.1049/el:20021134View ArticleGoogle Scholar - Tseng C-C, Liu CL: Complementary sets of sequences.
*IEEE Transactions on Information Theory*1972, 18(5):644-652. 10.1109/TIT.1972.1054860MATHMathSciNetView ArticleGoogle Scholar

## Copyright

This article is published under license to BioMed Central Ltd. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.