A fast algorithm for designing complementary sets of sequences

• Published in: Signal processing Vol. 93; no. 7; pp. 2096 - 2102
• Main Authors: Soltanalian, Mojtaba, Naghsh, Mohammad Mahdi, Stoica, Petre
• Format: Journal Article
• Language: English
• Published: Amsterdam Elsevier B.V 01.07.2013; Elsevier
• Subjects: Algorithms; Applied sciences; Autocorrelation; Binary sequences; Coding, codes; Complementary sets; Computation; Cyclic minimization; Exact sciences and technology; Information, signal and communications theory; Peak-to-average-power ratio (PAR); Sidelobe level; Signal and communications theory; Signal processing; Telecommunications and information theory; Complementary sets; Cyclic minimization; Sidelobe level; Autocorrelation; Peak-to-average-power ratio (PAR); Binary sequences; Autocorrelation function; Lateral lobe; Minimization; Frequency domain method; Complementarity problem; Binary sequence; Fast algorithm
• ISSN: 0165-1684; 1872-7557; 1872-7557
• DOI: 10.1016/j.sigpro.2013.02.008

In this paper, we introduce a fast computational frequency-domain approach for designing complementary sets of sequences. Following the basic idea of CAN-based algorithms, we propose an extension of the CAN algorithm to complementary sets of sequences (which we call CANARY). Moreover, modified versions of the proposed algorithm are derived to tackle the complementary set design problems in which low peak-to-average-power ratio (PAR), unimodular or phase-quantized sequences are of interest. Several numerical examples are provided to show the performance of CANARY.