.png){kind=icon}
.png){kind=icon}
Return
Optimization of Orthogonal Waveform Using Memetic Algorithm with Iterative Greedy Code Search
.png){kind=icon}
OA
AI
DOI：10.3390/rs17050856.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
The orthogonality of transmitted waveforms is an important factor affecting the performance of MIMO radar systems. The orthogonal coded signal is a commonly adopted waveform in MIMO radar, and its orthogonality depends on the used orthogonal discrete code sequence set (ODCSs). Among existing optimization algorithms for ODCSs, the results designed by the greedy code search-based memetic algorithm (MA-GCS) have exhibited the best autocorrelation and cross-correlation properties observed so far. Based on MA-GCS, we propose a novel hybrid algorithm called the memetic algorithm with iterative greedy code search (MA-IGCS). Extensions involve replacing the greedy code search used in MA-GCS with a more efficient approach, iterative greedy code search. Furthermore, we propose an individual uniqueness strategy and incorporate it into our algorithm to preserve population diversity throughout iteration, thereby preventing premature stagnation and ensuring the continued pursuit of feasible solutions. Finally, the design results of our algorithm are compared with the MA-GCS. Experimental results demonstrate that the MA-IGCS exhibits superior search capability and generates more favorable design results than the MA-GCS.
Keywords:
radar orthogonal waveforms
optimization algorithm
orthogonal discrete code sequence set (ODCSs)
iterative greedy code search (IGCS)
Journal
IF:
4.1
Papers:
6.9K
Citations:
15.1W