article · 2024

Sparse Array Optimization Based on Bit-by-Bit Search Algorithm

Cited by 0Abstract and details only

Abstract

This paper presents a sparse array optimization method based on the bit-by-bit search strategy, specifically aimed at reducing the peak side-lobe level of the array. The algorithm initiates with a random global exploration, followed by a localized refinement through sequential bit-wise optimization, ingeniously integrating greedy strategies with principles of dynamic programming. This approach effectively circumvents local optima while accelerating convergence to the globally optimal configuration. Experimental results under comparable conditions demonstrate that, compared to existing methods such as Genetic Algorithms and Artificial Bee Colony algorithms, this strategy achieves significant enhancements in array performance while concurrently reducing computational complexity.

Cite this paper

APA 7

Jia, Y., Wu, Y., & Zhang, J. (2024). Sparse Array Optimization Based on Bit-by-Bit Search Algorithm. https://doi.org/10.1145/3708568.3708589

MLA 9

Jia, Yuanyuan, et al. “Sparse Array Optimization Based on Bit-by-Bit Search Algorithm.” 2024, pp. 125–28, https://doi.org/10.1145/3708568.3708589.

Chicago

Jia, Yuanyuan, Yifeng Wu, and Jinwan Zhang. 2024. “Sparse Array Optimization Based on Bit-by-Bit Search Algorithm.” https://doi.org/10.1145/3708568.3708589.

Harvard

Jia, Y., Wu, Y. and Zhang, J. (2024) ‘Sparse Array Optimization Based on Bit-by-Bit Search Algorithm’. Available at: https://doi.org/10.1145/3708568.3708589.

BibTeX

@article{jia2024sparse,
  title = {{Sparse Array Optimization Based on Bit-by-Bit Search Algorithm}},
  author = {Jia, Yuanyuan and Wu, Yifeng and Zhang, Jinwan},
  pages = {125--128},
  year = {2024},
  doi = {10.1145/3708568.3708589}
}

Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.