Optimal odd-length binary Z-complementary pairs

A pair of sequences is called a Golay complementary pair (GCP) if their aperiodic auto-correlation sums are zero for all out-of-phase time shifts. Existing known binary GCPs only have even-lengths in the form of 2 10 26 (where ; ; are non-negative integers). To fill the gap left by the od...

Full description

Saved in:
Bibliographic Details
Main Authors: Liu, Zilong, Parampalli, Udaya, Guan, Yong Liang
Other Authors: School of Electrical and Electronic Engineering
Format: Article
Language:English
Published: 2015
Subjects:
Online Access:https://hdl.handle.net/10356/79498
http://hdl.handle.net/10220/24581
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Nanyang Technological University
Language: English
id sg-ntu-dr.10356-79498
record_format dspace
spelling sg-ntu-dr.10356-794982020-03-07T13:57:21Z Optimal odd-length binary Z-complementary pairs Liu, Zilong Parampalli, Udaya Guan, Yong Liang School of Electrical and Electronic Engineering DRNTU::Engineering::Computer science and engineering::Information systems A pair of sequences is called a Golay complementary pair (GCP) if their aperiodic auto-correlation sums are zero for all out-of-phase time shifts. Existing known binary GCPs only have even-lengths in the form of 2 10 26 (where ; ; are non-negative integers). To fill the gap left by the odd-lengths, we investigate the optimal odd-length binary pairs which display the closest correlation property to that of GCPs. Our criteria of “closeness” is that each pair has the maximum possible zerocorrelation zone (ZCZ) width and minimum possible out-of-zone aperiodic auto-correlation sums. Such optimal pairs are called optimal odd-length binary Z-complementary pairs (OB-ZCP) in this paper. We show that each optimal OB-ZCP has maximum ZCZ width of (N + 1)=2, and minimum out-of-zone aperiodic sum magnitude of 2, where N denotes the sequence length (odd). Systematic constructions of such optimal OP-ZCPs are proposed by insertion and deletion of certain binary GCPs, which settle the 2011 Li-Fan-Tang-Tu open problem positively. The proposed optimal OB-ZCPs may serve as a replacement for GCPs in many engineering applications where odd sequence lengths are preferred. In addition, they give rise to a new family of base-two almost difference families (ADF) which are useful in studying partially balanced incomplete block design (BIBD). Accepted version 2015-01-12T03:37:33Z 2019-12-06T13:26:48Z 2015-01-12T03:37:33Z 2019-12-06T13:26:48Z 2014 2014 Journal Article Liu, Z., Parampalli, U., & Guan, Y. L. (2014). Optimal odd-length binary Z-complementary pairs. IEEE transactions on information theory, 60(9), 5768-5781. https://hdl.handle.net/10356/79498 http://hdl.handle.net/10220/24581 10.1109/TIT.2014.2335731 en IEEE transactions on information theory © 2014 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works. The published version is available at: [http://dx.doi.org/10.1109/TIT.2014.2335731]. 13 p. application/pdf
institution Nanyang Technological University
building NTU Library
country Singapore
collection DR-NTU
language English
topic DRNTU::Engineering::Computer science and engineering::Information systems
spellingShingle DRNTU::Engineering::Computer science and engineering::Information systems
Liu, Zilong
Parampalli, Udaya
Guan, Yong Liang
Optimal odd-length binary Z-complementary pairs
description A pair of sequences is called a Golay complementary pair (GCP) if their aperiodic auto-correlation sums are zero for all out-of-phase time shifts. Existing known binary GCPs only have even-lengths in the form of 2 10 26 (where ; ; are non-negative integers). To fill the gap left by the odd-lengths, we investigate the optimal odd-length binary pairs which display the closest correlation property to that of GCPs. Our criteria of “closeness” is that each pair has the maximum possible zerocorrelation zone (ZCZ) width and minimum possible out-of-zone aperiodic auto-correlation sums. Such optimal pairs are called optimal odd-length binary Z-complementary pairs (OB-ZCP) in this paper. We show that each optimal OB-ZCP has maximum ZCZ width of (N + 1)=2, and minimum out-of-zone aperiodic sum magnitude of 2, where N denotes the sequence length (odd). Systematic constructions of such optimal OP-ZCPs are proposed by insertion and deletion of certain binary GCPs, which settle the 2011 Li-Fan-Tang-Tu open problem positively. The proposed optimal OB-ZCPs may serve as a replacement for GCPs in many engineering applications where odd sequence lengths are preferred. In addition, they give rise to a new family of base-two almost difference families (ADF) which are useful in studying partially balanced incomplete block design (BIBD).
author2 School of Electrical and Electronic Engineering
author_facet School of Electrical and Electronic Engineering
Liu, Zilong
Parampalli, Udaya
Guan, Yong Liang
format Article
author Liu, Zilong
Parampalli, Udaya
Guan, Yong Liang
author_sort Liu, Zilong
title Optimal odd-length binary Z-complementary pairs
title_short Optimal odd-length binary Z-complementary pairs
title_full Optimal odd-length binary Z-complementary pairs
title_fullStr Optimal odd-length binary Z-complementary pairs
title_full_unstemmed Optimal odd-length binary Z-complementary pairs
title_sort optimal odd-length binary z-complementary pairs
publishDate 2015
url https://hdl.handle.net/10356/79498
http://hdl.handle.net/10220/24581
_version_ 1681043270806798336