The DOI matches its Crossref record; 16 of the 16 references it cites were found in a registry or an index.
Optimization Methods for Designing Sequences With Low Autocorrelation Sidelobes
Open accessAbstract
Unimodular sequences with low autocorrelation are desired in many applications, especially in radar systems and code-division multiple access (CDMA) communication systems. In this paper, we propose a new algorithm to design unimodular sequences with low autocorrelation via directly minimizing the integrated sidelobe level (ISL) of the autocorrelation. The algorithm is derived based on the general framework of majorization-minimization (MM) algorithms and thus shares the monotonic property of such methods, and two acceleration schemes have been considered to accelerate the overall convergence. In addition, the proposed algorithm can be implemented via fast Fourier transform (FFT) operations and thus is computationally efficient. Furthermore, after some modifications the algorithm can be adapted to incorporate spectral constraints, which makes the design more flexible. Numerical experiments show that the proposed algorithms outperform existing ones in terms of both the merit factors of designed sequences and the computational complexity.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Two-Point Step Size Gradient Methods
BARZILAI, J., & BORWEIN, J. M. (1988) · IMA Journal of Numerical Analysis · doi:10.1093/imanum/8.1.141 · Cited by 2,873
Convex Analysis and Optimization
Bertsekas, D. P., Nedić, A., & Ozdaglar, A. (2003) · DSpace@MIT (Massachusetts Institute of Technology) · Cited by 2,148
Hunter, D. R., & Lange, K. (2004) · The American Statistician · doi:10.1198/0003130042836 · Cited by 1,783
A Unified Convergence Analysis of Block Successive Minimization Methods for Nonsmooth Optimization
Razaviyayn, M., Hong, M., & Luo, Z.-Q. (2013) · SIAM Journal on Optimization · doi:10.1137/120891009 · Cited by 1,304
Cognitive radar: a way of the future
Haykin, S. (2006) · IEEE Signal Processing Magazine · doi:10.1109/msp.2006.1593335 · Cited by 1,229
Signal Design for Good Correlation: For Wireless Communication, Cryptography, and Radar
Golomb, S. W., & Gong, G. (2005) · Cambridge University Press eBooks · doi:10.1017/cbo9780511546907 · Cited by 857
New Algorithms for Designing Unimodular Sequences With Good Correlation Properties
Stoica, P., He, H., & Li, J. (2009) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2009.2012562 · Cited by 475
Simple and Globally Convergent Methods for Accelerating the Convergence of Any EM Algorithm
VARADHAN, R., & ROLAND, C. (2008) · Scandinavian Journal of Statistics · doi:10.1111/j.1467-9469.2007.00585.x · Cited by 352
Decomposition by Partial Linearization: Parallel Optimization of Multi-Agent Systems
Scutari, G., Facchinei, F., Song, P., Palomar, D. P., & Pang, J.-S. (2014) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2013.2293126 · Cited by 338
Self-citationSieves for low autocorrelation binary sequences
Golay, M. (1977) · IEEE Transactions on Information Theory · doi:10.1109/tit.1977.1055653 · Cited by 225
Designing Unimodular Codes Via Quadratic Optimization
Soltanalian, M., & Stoica, P. (2014) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2013.2296883 · Cited by 222
Design of Phase Codes for Radar Performance Optimization With a Similarity Constraint
De Maio, A., De Nicola, S., Huang, Y., Luo, Z.-Q., & Zhang, S. (2009) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2008.2008247 · Cited by 219
Exhaustive Search for Low-Autocorrelation Binary SequencesPreprint
Mertens, S. (1996) · Cited by 101
A class of finite binary sequences with alternate auto-correlation values equal to zero (Corresp.)
Golay, M. (1972) · IEEE Transactions on Information Theory · doi:10.1109/tit.1972.1054797 · Cited by 98
Exhaustive search for low-autocorrelation binary sequences
Mertens, S. (1996) · Journal of Physics A Mathematical and General · doi:10.1088/0305-4470/29/18/005 · Cited by 91
A Survey of the Merit Factor Problem for Binary Sequences
Jedwab, J. (2005) · Lecture notes in computer science · doi:10.1007/11423461_2 · Cited by 90
Cited by
Reconfigurable Intelligent Surfaces for Energy Efficiency in Wireless Communication
Huang, C., Zappone, A., Alexandropoulos, G. C., Debbah, M., & Yuen, C. (2019) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2019.2922609 · Cited by 3,761
Majorization-Minimization Algorithms in Signal Processing, Communications, and Machine Learning
Sun, Y., Babu, P., & Palomar, D. P. (2017) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2016.2601299 · Cited by 1,820
Self-citationAsymptotic Max-Min SINR Analysis of Reconfigurable Intelligent Surface Assisted MISO Systems
Nadeem, Q.-U.-A., Kammoun, A., Chaaban, A., Debbah, M., & Alouini, M.-S. (2020) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2020.2986438 · Cited by 527
Enabling Secure Wireless Communications via Intelligent Reflecting Surfaces
Yu, X., Xu, D., & Schober, R. (2019) · 2019 IEEE Global Communications Conference (GLOBECOM) · doi:10.1109/globecom38437.2019.9014322 · Cited by 355
Sequence Design to Minimize the Weighted Integrated and Peak Sidelobe Levels
Song, J., Babu, P., & Palomar, D. P. (2016) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2015.2510982 · Cited by 312
Self-citation
Metadata
- Authors
- Song, J., Babu, P., & Palomar, D. P.
- Venue
- IEEE Transactions on Signal Processing
- Published
- 2015-08
- Volume
- 63
- Issue
- 15
- Pages
- 3998-4009
- ISSN
- 1053-587X (ISSN-L)
- 1941-0476
- OpenAlex
- W2962834015
- Cited by
- 382
- References
- 16
- FWCI
- 42.77
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.