.png){kind=icon}
.png){kind=icon}
Return
A fast algorithm for designing complementary sets of sequences
.png){kind=icon}
PRE
AI
DOI：10.1016/j.sigpro.2013.02.008.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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. (C) 2013 Elsevier B.V. All rights reserved.
Keywords:
Autocorrelation
Binary sequences
Complementary sets
Cyclic minimization
Peak-to-average-power ratio (PAR)
Sidelobe level
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
3.6
Papers:
9.9K
Citations:
1.7W