Abstract
We present a novel transform for periodic complementary sets (PCSs) over two-valued alphabets from a large set of difference families. This is achieved by generalizing Golomb's idea in 1992, which was for transformed perfect sequences with zero autocorrelations only. Based on the properties of difference family, a sufficient condition for such two-valued PCSs is derived. Systematic constructions of two-valued periodic complementary pairs are presented. It is shown that many lengths for which binary PCSs do not exist become admissible for our proposed two-valued PCSs.
Original language | English |
---|---|
Article number | 7964719 |
Pages (from-to) | 1270-1274 |
Number of pages | 5 |
Journal | IEEE Signal Processing Letters |
Volume | 24 |
Issue number | 9 |
DOIs | |
Publication status | Published - Sept 2017 |
Externally published | Yes |
Bibliographical note
Publisher Copyright:© 1994-2012 IEEE.
ASJC Scopus Subject Areas
- Signal Processing
- Applied Mathematics
- Electrical and Electronic Engineering
Keywords
- Difference family (DF)
- difference set
- periodic autocorrelation function (ACF)
- periodic complementary pairs (PCPs)
- periodic complementary sets (PCSs)