2005
DOI: 10.1109/taes.2005.1413763
|View full text |Cite
|
Sign up to set email alerts
|

Efficient exhaustive search for optimal-peak-sidelobe binary codes

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
19
0

Year Published

2007
2007
2018
2018

Publication Types

Select...
4
3
2

Relationship

0
9

Authors

Journals

citations
Cited by 64 publications
(19 citation statements)
references
References 9 publications
0
19
0
Order By: Relevance
“…Figure 4 shows the comparison of DFs of Binary sequences and thirty-two phase sequences. The correlation properties of the synthesized sequences are far better than Binary sequences Greg Coxson & Jon Russo (2004), Nadav Levanon & Eli Mozeson (2004) Matthew A Ferrara (2006). It can be seen from the figure that as the length increases, DF also increases but not linearly.…”
Section: Resultsmentioning
confidence: 96%
“…Figure 4 shows the comparison of DFs of Binary sequences and thirty-two phase sequences. The correlation properties of the synthesized sequences are far better than Binary sequences Greg Coxson & Jon Russo (2004), Nadav Levanon & Eli Mozeson (2004) Matthew A Ferrara (2006). It can be seen from the figure that as the length increases, DF also increases but not linearly.…”
Section: Resultsmentioning
confidence: 96%
“…If any sidelobe is worse than a desired threshold, the process backs up to the last branch, or decision, point. This is the approach used in [15] and [16].…”
Section: Notation and Terminologymentioning
confidence: 99%
“…The effective computing method for an exhaustive search of MPS binary sequences is presented in [8]. Optimal binary sequences by MPS criteria are consructed for the lengths N= [2,85].…”
Section: Introductionmentioning
confidence: 99%