2018
DOI: 10.1109/tsp.2018.2814990
|View full text |Cite
|
Sign up to set email alerts
|

Constructing Binary Sequences With Good Correlation Properties: An Efficient Analytical-Computational Interplay

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1

Citation Types

0
10
0

Year Published

2018
2018
2024
2024

Publication Types

Select...
5
4

Relationship

1
8

Authors

Journals

citations
Cited by 25 publications
(10 citation statements)
references
References 55 publications
0
10
0
Order By: Relevance
“…where z = [z 1 z 2 ....z P ] T 1×P . Apart from the unimodular constraint, there are interests in imposing constraints like binary constraint [28], [26], [40], spectral constraint [41], [42], [43], similarity constraint [44], [45], Peak to Average Power Ratio (PAPR) constraint [46] to name a few.…”
Section: A Signal Model and Problem Formulationmentioning
confidence: 99%
See 1 more Smart Citation
“…where z = [z 1 z 2 ....z P ] T 1×P . Apart from the unimodular constraint, there are interests in imposing constraints like binary constraint [28], [26], [40], spectral constraint [41], [42], [43], similarity constraint [44], [45], Peak to Average Power Ratio (PAPR) constraint [46] to name a few.…”
Section: A Signal Model and Problem Formulationmentioning
confidence: 99%
“…Hence, algebraic approaches are not viable to generate sequences of large lengths. To overcome this issue, recently, computational approaches [7], [26], [27], [28], came into existence and enabled a way to design sequences of arbitrary lengths at a slighter computational cost. Some of the developed computational approaches are the stochastic search methods [29], exhaustive search methods [30],…”
Section: Iintroductionmentioning
confidence: 99%
“…As a special case of that, the study of discrete sequence also attracts many researchers. The authors in [36] bridged the gap between the exhaustive search method and the analytical constructions method, and proposed a construction method which can be accomplished in polynomial time. The authors in [37] formulated the sequence sets design as a quadratically constrained quadratic program problem and proposed an algorithm based on semidefinite program (SDP) relaxation and randomized projection technique to tackle it.…”
Section: Introductionmentioning
confidence: 99%
“…There continues to be extensive research on designing optimal PC waveforms for MIMO applications [6], [17], [18] and cognitive radar applications [19]- [21]. Additionally, the general study of developing algorithms to design PC waveforms with specific AF/ACF shape is still a problem of interest to the radar and sonar communities [22]- [26].…”
Section: Introductionmentioning
confidence: 99%