A Differential Evolution Algorithm with Neighbor-hood Mutation for DOA Estimation

Bo Zhou; Kaijie Xu; Mengdao Xing; Yinghui Quan

REVIEW 3 major objections 5 minor 36 references

A Differential Evolution Algorithm with Neighbor-hood Mutation for DOA Estimation

T0 review · 3 major / 5 minor · reviewed 2026-08-06 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗ Review JSON

Pith's one-line read The paper claims that reformulating 2D-MUSIC spectral peak search as a multimodal optimization problem, solved by differential evolution with neighborhood mutation and DBSCAN postprocessing, matches exhaustive grid search accuracy while…

desk verdict A solid engineering recipe that swaps 2D-MUSIC grid search for an off-the-shelf multimodal optimizer plus DBSCAN peak extraction, but the accuracy and speed claims only hold for a narrow configuration and the peak-miss rate is never quantified. read the letter →

arxiv 2507.06020 v2 pith:4FWAQMQN submitted 2025-07-08 eess.SP cs.NE

Bo Zhou , Kaijie Xu , Yinghui Quan , Mengdao Xing This is my paper · ORCID

classification eess.SPcs.NE

keywords DOAestimation2D-MUSICMultimodaloptimizationDifferentialevolutionNeighborhoodmutationDBSCANArraysignalprocessingSpectralpeaksearch

verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

Two-dimensional MUSIC is a high-resolution direction-of-arrival estimator, but its exhaustive search over a two-dimensional angular grid is its computational bottleneck. The paper argues that this peak-finding step can be recast as a multimodal optimization problem—finding several peaks at once—and solved with a differential-evolution variant (a population-based optimizer) whose mutation uses each individual's nearest neighbors, followed by a density-based clustering pass (DBSCAN) that turns the final population into DOA estimates. The central claim is that this pipeline finds all spectral peaks with near-100% success and delivers mean absolute error comparable to, and in the reported configuration better than, the conventional 1-degree grid search, at a fraction of the floating-point operations for large arrays. If that is right, real-time high-resolution 2D DOA estimation becomes practical without special array geometries or dimensionality-reduction tricks.

What carries the argument

The load-bearing object is the neighborhood-mutation strategy added to differential evolution. Standard DE mutates a vector using three randomly chosen population members; DE-NM instead restricts mutation to the m nearest neighbors of each individual, confining exploration to distinct basins of attraction so multiple spectral peaks can be optimized simultaneously. The second component is DBSCAN postprocessing, which clusters the final population by spatial density, treats isolated points as noise, and takes the highest-fitness point of each cluster as a DOA estimate, preventing one peak from being counted twice and preventing outliers from becoming phantom sources. The precomputed noise-subspace projection matrix $G_n = U_n U_n^H$ makes each fitness evaluation a cheap matrix-vector product, and the complexity comparison is carried out in FLOPs, with $C_{population} = M^2(L+2) + Max\_iter \cdot N_R \cdot ((M+1)(M-L) + (N_R-1))$ against $C_{MUSIC} = M^2(L+2) + J(M+1)(M-L)$.

What would settle it

Run DE-NM with DBSCAN on a 32-element uniform circular array with four closely spaced sources over 1,000 Monte Carlo trials at SNR = 0 dB and count how often the number of output clusters is fewer than four; a non-negligible omission rate would contradict the near-100% peak-detection success on which the accuracy claim rests.

Watch

Extended reading notes

Core claim

The discovery, on the paper's own terms, is that replacing the exhaustive 2D-MUSIC spectrum scan with a multimodal differential-evolution search is not only computationally cheaper but statistically no worse, and often better, than grid search. DE-NM mutates each individual using only its m nearest neighbors, so subpopulations converge to different local maxima of the MUSIC pseudo-spectrum; DBSCAN then groups the converged individuals, discards scattered outliers, and selects the highest-fitness member of each cluster as the estimated DOA. The paper reports that on a 12-element uniform circular array with three sources, a population of 256 and 20 iterations achieves near-100% peak-detection success with lower mean absolute error than a 1-degree exhaustive search, and that the FLOP savings grow with array size.

Load-bearing premise

The load-bearing premise is that the tuned optimizer finds every true spectral peak nearly every time: the near-100% success rate is demonstrated only for one 12-element circular array with three sources, and a single missed peak means one source is lost entirely rather than estimated with a small error.

Editorial extensions

If this is right

With a population of 256 and 20 iterations, the population-based search is reported to use about half the FLOPs of a 1-degree exhaustive search for a 12-element array and about one-sixth for a 128-element array with one or three sources.
Mean absolute error over 1,000 Monte Carlo trials is comparable to or better than the conventional 2D-MUSIC grid search, including at SNR = -5 dB.
The population size can be lowered to trade some accuracy for further speed, making the method tunable to real-time computation limits.
DBSCAN's noise filtering is what makes the pipeline deployable: earlier population-based 2D-MUSIC methods lacked a principled way to extract final estimates from the population and were only evaluated by picking the point closest to the true peak in simulation.
Because the search no longer samples a fixed grid, its accuracy is not limited by grid resolution, which the paper argues lets the optimizer beat a 1-degree grid's MAE.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

Editorial extension: the same reformulation should transfer to other pseudo-spectrum estimators, such as Capon beamforming or alternating projection, whenever the objective is a multimodal surface; the paper itself only demonstrates 2D-MUSIC on a 12-element uniform circular array.
Editorial extension: the near-100% peak-detection success is shown for a single array size and three sources, so the unexplored failure regime is closely spaced or numerous sources, where spectral peaks merge and DBSCAN might collapse two sources into one cluster.
Editorial extension: the FLOP comparison assumes a 1-degree grid, so the reported speedup is resolution-dependent; a coarser grid would shrink the advantage and a finer grid would enlarge it.
Editorial extension: a wall-clock benchmark that includes the cost of nearest-neighbor searches and DBSCAN parameter tuning would test whether the FLOP savings translate into actual runtime savings on hardware.

Share X Bluesky LinkedIn Reddit HN

Signed reviews

No signed human review yet.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Desk Editor's Note

read the letter

Quick take: this is a legitimate engineering application paper. The optimizer is taken verbatim from Qu et al. 2012, but the DBSCAN postprocessing step is a genuine practical advance over prior population-based MUSIC work, which never explained how to turn the final population into DOA estimates. The code is on GitHub, which makes the recipe reproducible.

What is done well: the simulations are thorough within their scope. They compare against several DE variants, DPSO, and MUSIC-AP, all individually tuned. The CDF and MAE plots are useful. The authors are also honest that multimodal peak search can miss peaks entirely, which would lose a source.

The soft spots are concentrated in the central claims. First, "surpasses grid search" is an artifact of comparing against a 1-degree grid. A finer grid would erode that advantage. Second, the near-100% success rate is demonstrated for one configuration: 12-element UCA, 3 sources. The paper never reports detection rate or per-peak omission statistics, only MAE averaged over trials. Missing a peak is catastrophic, and the failure rate under other array sizes, source counts, and SNRs is unquantified. Table 3 shows that for M=12, L=10 the population method is actually 1.68x more expensive than grid search, but no accuracy experiment is run there, so the "significant reduction in computation time" claim does not generalize to that regime. Third, the hyperparameters (F, CR, neighborhood size, DBSCAN epsilon and MinPts) are not fully reported; only population size is swept in Figure 8. That hurts reproducibility despite the code. Minor: MAE curves lack error bars, though 1000 trials makes that a small issue.

The novelty is limited—DE-NM is from reference [32] and DPSO already applied a multimodal PSO to DOA—but the specific combination plus the clustering-based peak extraction is new and practically useful. The paper is honestly written, gives credit where due, and does not oversell the optimizer itself.

Who this is for: someone working on real-time 2D-MUSIC with large arrays who wants a ready-made accelerator. It deserves a serious referee, but the revision should add a fine-grid baseline, report detection rates across configurations, disclose all parameters, and temper the accuracy claim. I would not cite it in my own work, but if I were in the array processing subfield I would want to know it exists.

Referee Report

3 major / 5 minor

Summary. The manuscript proposes replacing the exhaustive two-dimensional spectral search of the 2D-MUSIC algorithm with a multimodal optimization approach. The core pipeline is DE-NM, a neighborhood-mutation variant of differential evolution taken from Qu et al. [32], used to locate several spectral peaks simultaneously, followed by a DBSCAN clustering postprocessing step that extracts L DOA estimates from the final population. The central claim is that this pipeline achieves estimation accuracy comparable to, or better than, conventional 2D-MUSIC with a 1-degree grid, while substantially reducing computation. The simulation study considers a 12-element uniform circular array with three sources, compares against several multimodal optimizers and MUSIC-AP, and reports MAE, CDFs, and a FLOP-based complexity comparison. The implementation code is made available.

Significance. If the main claim were established across a broader set of configurations, the paper would offer a practical way to reduce the computational burden of 2D-MUSIC while retaining peak-finding reliability. The paper has notable strengths: the code is released, the complexity model is explicit in Eq. (7) and Eq. (8), and the comparison includes several relevant baselines. However, the empirical evidence is currently narrow—one array geometry, one source count, and a baseline with coarse angular quantization—so the significance is real but conditional on the missing robustness evidence.

major comments (3)

[Section 4.B, Section 4.C, Figs. 4 and 8] The claim that DE-NM 'surpasses' conventional 2D-MUSIC in accuracy is not robust because the baseline 2D-MUSIC uses a 1-degree uniform grid, as acknowledged in Section 4.C. The quantization error of a 1-degree grid is bounded by about 0.5 degrees and has a standard deviation of roughly 0.29 degrees, which can dominate the MAE at high SNR. Thus the observed accuracy advantage may be an artifact of the coarse baseline rather than a property of the proposed estimator. To support the central accuracy claim, the authors should compare against a finer grid, for example 0.1 degrees, or report MAE as a function of grid spacing and show that the advantage persists as the grid is refined.
[Section 4.C, Section 4.A, Fig. 8, Table 3] The reliability premise that DE-NM plus DBSCAN finds all true spectral peaks is supported only for a single configuration: M=12, L=3, and a few SNR levels. The paper states that the success rate 'approaches 100%' for this configuration, but it never reports the detection probability or per-peak omission rate over the 1,000 Monte Carlo trials, and it does not show how these rates vary with SNR, snapshots, source count, or array geometry. Because the paper itself notes that missing a peak means losing a real source—a catastrophic failure mode—the current evidence is insufficient for the broad claim of 'comparable accuracy at reduced cost.' In particular, Table 3 lists the M=12, L=10 case where the proposed method is actually 1.68 times more expensive than grid search, yet no accuracy or detection-rate experiment is reported for that regime. The authors should add explicit detection-rate metrics and sensitivity experiments over M, L, snapshot count, and SNR.
[Section 4.A, Eq. (8), Table 3] The complexity formula in Eq. (8) is described as the 'overall computational complexity of the population-based algorithm,' but it omits at least two components that are part of the proposed pipeline: the cost of the DBSCAN postprocessing step and the cost of sorting or selecting the m nearest neighbors for the neighborhood mutation. The pairwise distance term N_R(N_R-1) per iteration is counted, but turning those distances into neighborhoods and running DBSCAN is not. Since the second central claim is computational savings, the comparison in Table 3 is incomplete. The authors should include the DBSCAN cost in the FLOP model or report measured wall-clock times, and should also qualify the claim that computation is always reduced, given the slower M=12, L=10 row in Table 3.

minor comments (5)

[Section 4.C] Several figure references appear mismatched: the text refers to 'Figure 6' for the comparison of DBSCAN with k-localmax and k-means++, but the caption for Figure 6 is 'MAE versus population size'; similarly, the text refers to 'Figure 7' for the population-size trade-off, but Figure 7 is the DBSCAN clustering visualization. The numbering should be corrected.
[Abstract and Section 3.C] The abstract says the paper 'propose[s]' DE-NM, but DE-NM is taken directly from Qu et al. [32]; the novelty here is the application to 2D-MUSIC and the DBSCAN-based extraction. The wording should be adjusted to avoid overclaiming.
[Section 4.C] The DBSCAN parameters (epsilon and MinPts) and the parameters for k-localmax and k-means++ are not reported. Because the postprocessing step is part of the proposed contribution, these settings should be given explicitly.
[Section 4.B] The MAE results in Figure 4 are averaged over 1,000 trials but no confidence intervals or error bars are shown; adding them would make the comparison with the other algorithms more informative, especially where curves are close.
[Table 2] The table header reads 'NDE Algorithm' but the method is called DE-NM; this should be corrected.

Circularity Check

1 steps flagged · score 2.0 of 10

Minor tuning-as-prediction circularity in the reliability claim; no load-bearing self-citation or derivation-level circularity.

fitted input called prediction [Section 4 (intro) and Section 4.C, Figure 8 discussion]
"All algorithms were individually tuned on the 2D-MUSIC spectrum to ensure a fair balance between accuracy and computational efficiency. ... From Figure 8, it is evident that using a population size of 256 allows the proposed method to achieve superior accuracy compared with the standard 2D-MUSIC algorithm. Under this configuration, the algorithm successfully identifies nearly all DOA peaks with a success rate close to 100%."

The population size N_R=256 (with Max_iter=20) is selected from Figure 8, which plots MAE versus N_R on the same 12-element, 3-source simulation scenario later used as the headline accuracy result. The subsequent statement that this configuration 'successfully identifies nearly all DOA peaks with a success rate close to 100%' reports the value that was tuned for, rather than an out-of-sample prediction. The abstract's 'comparable estimation accuracy' is likewise asserted only after choosing the population size that beats grid-search MAE in that scenario. This is not a derivation-level circularity in the optimization-to-MUSIC mapping, which is independently well-founded, but it is a fitted input presented as a performance prediction.

full rationale

The central algorithmic steps are not circular: DE-NM is attributed to the external reference [32], DBSCAN to [33], and the reformulation of 2D-MUSIC peak search as multimodal optimization is a recognized reduction applied to an existing spectrum. The self-citations [1], [18], [19] are contextual or concern alternative array-transformation methods, not load-bearing premises of the proposed pipeline; no uniqueness theorem or ansatz is imported from the authors' prior work. The only noteworthy circular element is the parameter-selection procedure: the authors tune population size and related parameters on the same scenario used for evaluation, then report the resulting near-100% success rate and superior MAE as evidence. This is a mild fitting-to-metric issue rather than a derivation that is equivalent to its inputs by construction, so the overall circularity score is low.

Assumptions & free parameters 6 free parameters · 4 assumptions · 0 invented entities

The paper introduces no new physical entities or mathematical constructs. It relies on standard subspace-based DOA assumptions and on a set of DE-NM and DBSCAN hyperparameters that are tuned in simulation and largely unreported. The most consequential free parameters are the algorithm tuning choices that produce the near-100% success rate.

free parameters (6)

population size N_R = 256
Chosen in Section 4.C to achieve near-100% peak detection for the tested scenario; not derived.
max iterations Max_iter = 20
Set with N_R to balance accuracy and cost; used in Table 3.
scaling factor F = not reported
DE mutation step size; coarsely tuned per configuration, value omitted.
crossover rate CR = not reported
Controls offspring diversity; tuned, value omitted.
neighborhood size m = not reported
Number of nearest neighbors in DE-NM mutation; critical for multimodal behavior, not specified.
DBSCAN epsilon and MinPts = not reported
Clustering resolution parameters; influence the number of detected peaks, not reported.

assumptions (4)

domain assumption The MUSIC pseudo-spectrum P(theta, phi) = 1/(a^H G_n a) has local maxima exactly at the true source DOAs.
Used to formulate peak finding as multimodal optimization (Section 3.B). Requires accurate covariance estimate and known number of sources L.
domain assumption The number of sources L is known a priori.
MUSIC subspace decomposition in Eq. (4) assumes L; the algorithm selects the top L DBSCAN clusters.
domain assumption Noise is zero-mean and independent of the signals.
Stated in Section 2 for the covariance model in Eq. (3).
ad hoc to paper The 1-degree uniform grid represents the standard exhaustive 2D-MUSIC implementation.
Baseline accuracy and complexity in Table 3 and Figure 8 assume this grid; a finer grid would change the comparison.

how reviews work

0 comments

Cite this review

Pith. "Pith review of A Differential Evolution Algorithm with Neighbor-hood Mutation for DOA Estimation." pith.science (2026). https://pith.science/paper/4FWAQMQN

@misc{pith2026250706020,
  author       = {Pith},
  title        = {Pith review of: A Differential Evolution Algorithm with Neighbor-hood Mutation for DOA Estimation},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/4FWAQMQN}},
  note         = {Machine review of arXiv:2507.06020}
}

read the original abstract

Two-dimensional (2D) Multiple Signal Classification algorithm is a powerful technique for high-resolution direction-of-arrival (DOA) estimation in array signal processing. However, the exhaustive search over the 2D an-gular domain leads to high computa-tional cost, limiting its applicability in real-time scenarios. In this work, we reformulate the peak-finding process as a multimodal optimization prob-lem, and propose a Differential Evolu-tion algorithm with Neighborhood Mutation (DE-NM) to efficiently lo-cate multiple spectral peaks without requiring dense grid sampling. Simu-lation results demonstrate that the proposed method achieves comparable estimation accuracy to the traditional grid search, while significantly reduc-ing computation time. This strategy presents a promising solution for real-time, high-resolution DOA estimation in practical applications. The imple-mentation code is available at https://github.com/zzb-nice/DOA_multimodel_optimize.

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

36 extracted references · 36 canonical work pages

[32]

Differential Evolution With Neighborhood Mutation for Multimodal Optimization,

B. Y. Qu, P. N. Suganthan, and J. J. Liang, “Differential Evolution With Neighborhood Mutation for Multimodal Optimization,” IEEE Transactions on Evolutionary Computation, vol. 16, no. 5, pp. 601–614, Oct. 2012

work page 2012
[1]

Robust DOA estimation and tracking for integrated sensing and communication massive MIMO OFDM systems,

K. Xu et al., “Robust DOA estimation and tracking for integrated sensing and communication massive MIMO OFDM systems,” Science China Information Sciences, vol. 66, no. 10, p. 202302, Nov. 2023

work page 2023
[2]

Multi -stage 2D DoA estimation in low SNR,

X. Wei, D. Saha, G. Hellbourg, and A. Dutta, “Multi -stage 2D DoA estimation in low SNR,” in Proc. 2023 IEEE International Conference on Communications (ICC), Rome, Italy, pp. 2785–2790, May 2023

work page 2023
[3]

Joint DOD and DOA estimation for bistatic MIMO radar,

M. Jin, G. Liao, and J. Li, “Joint DOD and DOA estimation for bistatic MIMO radar,” Signal Processing, vol. 89, no. 2, pp. 244–251, Feb. 2009

work page 2009
[4]

CPHD - DOA tracking of multiple extended sonar targets in impulsive environments,

A.-A. Saucan, T. Chonavel, C. Sintes, and J. -M. Le Caillec, “CPHD - DOA tracking of multiple extended sonar targets in impulsive environments,” IEEE Transactions on Signal Processing, vol. 64, no. 5, pp. 1147–1160, Mar. 2016

work page 2016
[5]

Joint angle and delay estimation (JADE) for multipath signals arriving at an antenna array,

M. C. Vanderveen, C. B. Papadias, and A. Paulraj, “Joint angle and delay estimation (JADE) for multipath signals arriving at an antenna array,” IEEE Communications Letters, vol. 1, no. 1, pp. 12–14, Jan. 1997

work page 1997
[6]

Estimation of multipath parameters in wireless communications,

M. C. Vanderveen, A.-J. Van Der Veen, and A. Paulraj, “Estimation of multipath parameters in wireless communications,” IEEE Transactions on Signal Processing, vol. 46, no. 3, pp. 682–690, Mar. 1998

work page 1998
[7]

A DBO -Based Improved 2D - MUSIC Algorithm for Localization Using OFDM,

X. Hu, L. Li, Z. Wang, and Z. Chen, “A DBO -Based Improved 2D - MUSIC Algorithm for Localization Using OFDM,” in Proc. 2025 IEEE Wireless Communications and Networking Conference (WCNC), Milan, Italy, pp. 01–06, Mar. 2025

work page 2025

Show all 36 references

[8]

Joint Estimation of TOA and DOA in IR-UWB System Using a Successive MUSIC Algorithm,

F. Wang, X. Zhang, and F. Wang, “Joint Estimation of TOA and DOA in IR-UWB System Using a Successive MUSIC Algorithm,” Wireless Personal Communications, vol. 77, no. 4, pp. 2445–2464, Aug. 2014

2014
[9]

Performance Analysis of Joint Range-Velocity Estimator With 2D -MUSIC in OFDM Radar,

R. Xie, D. Hu, K. Luo, and T. Jiang, “Performance Analysis of Joint Range-Velocity Estimator With 2D -MUSIC in OFDM Radar,” IEEE Transactions on Signal Processing, vol. 69, pp. 4787–4800, 2021

2021
[10]

3D Indoor Positioning Using the 2D-MUSIC Algorithm,

P. P. Hassan, I. Marsland, R. Smith, R. Kerr, E. Iun, and I. Lambadaris, “3D Indoor Positioning Using the 2D-MUSIC Algorithm,” in Proc. 2024 IEEE Global Communications Conference (GLOBECOM), Cape Town, South Africa, pp. 1881–1887, Dec. 2024

2024
[11]

Low -Complexity Joint Angle of Arrival and Time of Arrival Estimation of Multipath Signal in UWB System,

W. Deng, J. Li, Y. Tang, and X. Zhang, “Low -Complexity Joint Angle of Arrival and Time of Arrival Estimation of Multipath Signal in UWB System,” Sensors, vol. 23, no. 14, p. 6363, Jul. 2023

2023
[12]

Frequency Domain Joint TOA and DOA Estimation in IR -UWB,

M. Navarro and M. Najar, “Frequency Domain Joint TOA and DOA Estimation in IR -UWB,” IEEE Transactions on Wireless Communications, vol. 10, no. 10, pp. 1–11, Oct. 2011

2011
[13]

Joint Doppler and DOA estimation using (Ultra-)Wideband FMCW signals,

S. Xu, B. J. Kooij, and A. Yarovoy, “Joint Doppler and DOA estimation using (Ultra-)Wideband FMCW signals,” Signal Processing, vol. 168, p. 107259, Mar. 2020

2020
[14]

Three -dimensional Multiple Signal Classification (3D -MUSIC) for Super -resolution FMCW Radar Detection,

Zhao, F. Zhang, D. Zhang, and S. Pan, “Three -dimensional Multiple Signal Classification (3D -MUSIC) for Super -resolution FMCW Radar Detection,” in Proc. 2019 IEEE MTT -S International Wireless Symposium (IWS), Guangzhou, China, pp. 1–3, May 2019

2019
[15]

A Computationally Light MUSIC Based Algorithm for Automotive RADARs,

M. A. Maisto, A. Dell’Aversano, A. Brancaccio, I. Russo, and R. Solimene, “A Computationally Light MUSIC Based Algorithm for Automotive RADARs,” IEEE Transactions on Computational Imaging, vol. 10, pp. 446–460, 2024

2024
[16]

A Reduced-Dimension MUSIC Algorithm for Monostatic FDA-MIMO Radar,

M. Feng, Z. Cui, Y. Yang, and Q. Shu, “A Reduced-Dimension MUSIC Algorithm for Monostatic FDA-MIMO Radar,” IEEE Communications Letters, vol. 25, no. 4, pp. 1279–1282, Apr. 2021

2021
[17]

Direction of Departure (DOD) and Direction of Arrival (DOA) Estimation in MIMO Radar with Reduced- Dimension MUSIC,

X. Zhang, L. Xu, L. Xu, and D. Xu, “Direction of Departure (DOD) and Direction of Arrival (DOA) Estimation in MIMO Radar with Reduced- Dimension MUSIC,” IEEE Communications Letters, vol. 14, no. 12, pp. 1161–1163, Dec. 2010

2010
[18]

Fast Direction of Arrival Estimation for Uniform Circular Arrays With a Virtual Signal Subspace,

K. Xu, Y. Quan, B. Bie, M. Xing, W. Nie, and H. E, “Fast Direction of Arrival Estimation for Uniform Circular Arrays With a Virtual Signal Subspace,” IEEE Transactions on Aerospace and Electronic Systems , vol. 57, no. 3, pp. 1731–1741, Jun. 2021

2021
[19]

A multi -direction virtual array transformation algorithm for 2D DOA estimation,

K. Xu, W. Nie, D. Feng, X. Chen, and D. Fang, “A multi -direction virtual array transformation algorithm for 2D DOA estimation,” Signal Processing, vol. 125, pp. 122–133, Aug. 2016

2016
[20]

On the limited memory BFGS method for large scale optimization,

C. Liu and J. Nocedal, “On the limited memory BFGS method for large scale optimization,” Mathematical Programming, vol. 45, no. 1 –3, pp. 503–528, Aug. 1989

1989
[21]

A novel swarm intelligence optimization approach: sparrow search algorithm,

J. Xue and B. Shen, “A novel swarm intelligence optimization approach: sparrow search algorithm,” in Proc. ICNN’95 - International Conference on Neural Networks, Perth, WA, Australia, pp. 22–34, Jan. 2020

2020
[22]

Differential Evolution: A Survey of the State-of-the-Art,

S. Das and P. N. Suganthan, “Differential Evolution: A Survey of the State-of-the-Art,” IEEE Transactions on Evolutionary Computation, vol. 15, no. 1, pp. 4–31, Feb. 2011

2011
[23]

Particle swarm optimization,

J. Kennedy and R. Eberhart, “Particle swarm optimization,” in Proc. ICNN’95 - International Conference on Neural Networks , Perth, WA, Australia, pp. 1942–1948, 1995

1942
[24]

Evolutionary programming with ensemble of explicit memories for dynamic optimization,

L. Yu and P. N. Suganthan, “Evolutionary programming with ensemble of explicit memories for dynamic optimization,” in Proc. 2009 IEEE Congress on Evolutionary Computation, Trondheim, Norway, pp. 431– 438, May 2009

2009
[25]

A clearing procedure as a niching method for genetic algorithms,

A. P etrowski, “A clearing procedure as a niching method for genetic algorithms,” in Proc. IEEE International Conference on Evolutionary Computation (ICEC-96), Nagoya, Japan, pp. 798–803, 1996

1996
[26]

A self-adaptive niching genetic algorithm for multimodal optimization of electromagnetic devices,

E. Dilettoso and N. Salerno, “A self-adaptive niching genetic algorithm for multimodal optimization of electromagnetic devices,” IEEE Transactions on Magnetics, vol. 42, no. 4, pp. 1203–1206, Apr. 2006

2006
[27]

Multimodal optimization using crowding -based differential evolution,

R. Thomsen, “Multimodal optimization using crowding -based differential evolution,” in Proc. 2004 Congress on Evolutionary Computation (CEC), Portland, OR, USA, pp. 1382–1389, 2004

2004
[28]

Density based clustering with crowding differential evolution,

D. Zaharie, “Density based clustering with crowding differential evolution,” in Proc. Seventh International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC’05), Timisoara, Romania, p. 8, 2005

2005
[29]

Clustering with Niching Genetic K- means Algorithm,

W. Sheng, A. Tucker, and X. Liu, “Clustering with Niching Genetic K- means Algorithm,” in Proc. Genetic and Evolutionary Computation (GECCO), Berlin, Heidelberg, pp. 162–173, 2004

2004
[30]

Niching Without Niching Parameters: Particle Swarm Optimization Using a Ring Topology,

X. Li, “Niching Without Niching Parameters: Particle Swarm Optimization Using a Ring Topology,” IEEE Transactions on Evolutionary Computation, vol. 14, no. 1, pp. 150–169, Feb. 2010

2010
[31]

A Particle Swarm Optimizer Based on Niche Technique with Application to DOA Estimation,

R. Zhu and M. Zhuang, "A Particle Swarm Optimizer Based on Niche Technique with Application to DOA Estimation," in Proc. 2019 IEEE 13th International Conference on Anti -counterfeiting, Security, and Identification (ASID) , pp. 112-116, Xiamen, China, Oct. 2019

2019
[33]

DBSCAN Revisited, Revisited: Why and How You Should (Still) Use DBSCAN,

E. Schubert, J. Sander, M. Ester, H. P. Kriegel, and X. Xu, “DBSCAN Revisited, Revisited: Why and How You Should (Still) Use DBSCAN,” ACM Transactions on Database Systems, vol. 42, no. 3, pp. 1 –21, Sep. 2017

2017
[34]

Maximum likelihood localization of multiple sources by alternating projection,

Ziskind and M. Wax, “Maximum likelihood localization of multiple sources by alternating projection,” IEEE Transactions on Acoustics, Speech, and Signal Processing , vol. 36, no. 10, pp. 1553 –1560, Oct. 1988

1988
[35]

Application of the alternating projection strategy to the Capon beamforming and the MUSIC algorithm for azimuth/elevation AOA estimation,

J.-H. Lee, S. -W. Cho, and H. -J. Moon, “Application of the alternating projection strategy to the Capon beamforming and the MUSIC algorithm for azimuth/elevation AOA estimation,” Journal of Electromagnetic Waves and Applications, vol. 27, no. 12, pp. 1439–1454, Aug. 2013

2013
[36]

Fast subspace decomposition,

Xu and T. Kailath, “Fast subspace decomposition,” IEEE Transactions on Signal Processing, vol. 42, no. 3, pp. 539–551, Mar. 1994

1994

Pith tools

Reviewed August 6, 2026 · model on record in the stance chip above.

[1] [32]

Differential Evolution With Neighborhood Mutation for Multimodal Optimization,

B. Y. Qu, P. N. Suganthan, and J. J. Liang, “Differential Evolution With Neighborhood Mutation for Multimodal Optimization,” IEEE Transactions on Evolutionary Computation, vol. 16, no. 5, pp. 601–614, Oct. 2012

work page 2012

[2] [1]

Robust DOA estimation and tracking for integrated sensing and communication massive MIMO OFDM systems,

K. Xu et al., “Robust DOA estimation and tracking for integrated sensing and communication massive MIMO OFDM systems,” Science China Information Sciences, vol. 66, no. 10, p. 202302, Nov. 2023

work page 2023

[3] [2]

Multi -stage 2D DoA estimation in low SNR,

X. Wei, D. Saha, G. Hellbourg, and A. Dutta, “Multi -stage 2D DoA estimation in low SNR,” in Proc. 2023 IEEE International Conference on Communications (ICC), Rome, Italy, pp. 2785–2790, May 2023

work page 2023

[4] [3]

Joint DOD and DOA estimation for bistatic MIMO radar,

M. Jin, G. Liao, and J. Li, “Joint DOD and DOA estimation for bistatic MIMO radar,” Signal Processing, vol. 89, no. 2, pp. 244–251, Feb. 2009

work page 2009

[5] [4]

CPHD - DOA tracking of multiple extended sonar targets in impulsive environments,

A.-A. Saucan, T. Chonavel, C. Sintes, and J. -M. Le Caillec, “CPHD - DOA tracking of multiple extended sonar targets in impulsive environments,” IEEE Transactions on Signal Processing, vol. 64, no. 5, pp. 1147–1160, Mar. 2016

work page 2016

[6] [5]

Joint angle and delay estimation (JADE) for multipath signals arriving at an antenna array,

M. C. Vanderveen, C. B. Papadias, and A. Paulraj, “Joint angle and delay estimation (JADE) for multipath signals arriving at an antenna array,” IEEE Communications Letters, vol. 1, no. 1, pp. 12–14, Jan. 1997

work page 1997

[7] [6]

Estimation of multipath parameters in wireless communications,

M. C. Vanderveen, A.-J. Van Der Veen, and A. Paulraj, “Estimation of multipath parameters in wireless communications,” IEEE Transactions on Signal Processing, vol. 46, no. 3, pp. 682–690, Mar. 1998

work page 1998

[8] [7]

A DBO -Based Improved 2D - MUSIC Algorithm for Localization Using OFDM,

X. Hu, L. Li, Z. Wang, and Z. Chen, “A DBO -Based Improved 2D - MUSIC Algorithm for Localization Using OFDM,” in Proc. 2025 IEEE Wireless Communications and Networking Conference (WCNC), Milan, Italy, pp. 01–06, Mar. 2025

work page 2025