{"id":"324f8344-f403-4e7c-aa37-dff81edf026f","arxiv_id":"2411.15532","paper_version":1,"verdict":"CONDITIONAL","confidence":"MODERATE","novelty_score":5.0,"correctness_risk":"medium","formal_verification":"none","parameter_count":2,"one_line_summary":"An FFT-based coarse scan plus 1D beamforming narrows the search region so a refined 2D-MUSIC stage localizes near-field sources with much lower complexity than full 2D-MUSIC.","lead":"This letter presents a faster way to locate nearby wireless signal sources by first using a quick Fourier-based scan to narrow down where to look, then applying a precise search only in those small regions. The method aims to make high-resolution near-field sensing practical for very large antenna arrays in future 6G systems.","discovery_kind":"new_method","skeptic_critique":{"model":"deepseek-v4-flash","headline":"The central claim depends on an unproved containment guarantee: the coarse FFT and beamforming stages must never discard a true source, and Step 4 cannot restore an angle lost in Step 1. No miss probability or threshold analysis is given for this guarantee.","rationale":"The reader's weakest_assumption is the same one I would flag: the coarse-to-fine search is only valid if the coarse stages are conservative. My stress-test reading did not find a more basic flaw: the system model is conventional, the complexity expressions are internally consistent, the reported simulation shows a real speedup, and compatibility with lambda/2 spacing is a genuine advantage over RD-MUSIC and RR-MUSIC. The weak point is not a contradiction in the final 2D-MUSIC step but the absence of a containment guarantee before it. I would sharpen the concern: the Step 2 justification for Eq. (11) is not merely unproved; it relies on a qualitative claim about local minima of near-field beam patterns that is not derived from the steering-vector model, so even the distance-cluster half of the inclusion assumption is at risk. The Step 4 fallback cannot repair a missed angle, and although K is known and a miss would cause count mismatch, the algorithm has no procedure to redo the angle clustering. This makes the central accuracy claim conditional on delta_theta, delta_d, and the unverified geometry of beta_n intersect beta-bar_n. I do not think the paper should be rejected: the idea is promising and the simulations are encouraging, but the authors should provide either a miss-probability analysis, a conservative threshold choice with sensitivity curves, or a direct check of Eq. (11). The proposed Monte-Carlo containment test settles the question cleanly, and since the reader already conditions the verdict on such support, I leave the verdict unchanged as CONDITIONAL in substance.","tokens_in":6957,"tokens_out":14677,"duration_ms":138291,"concrete_test":"Instrument the Section V simulator with oracle knowledge of the true sources and run a Monte Carlo sweep over SNR 5-25 dB and over random source configurations (K=4, r_k in [0,40] m, theta_k in [-20,40] degrees). For each trial, run Steps 1 and 2 exactly as written with the same delta_theta and delta_d used in the paper, and record (i) whether every true angle theta_k lies in some angle cluster and (ii) whether every true range r_k lies in the associated distance cluster R_n of Eq. (11). Report the containment rate, the RMSE over all trials, and the RMSE conditioned on full containment. If the containment rate is not 1.0, or if the two RMSE values differ materially, the central claim is unsupported and the authors must supply a conservative threshold choice or a miss-probability bound to make the complexity-accuracy trade-off valid.","verdict_should_be":"UNCHANGED","load_bearing_attack":"Section IV, Step 1 forms angle clusters with threshold Gamma_theta = min({p_Theta}) - delta_theta, and Step 2 forms distance clusters via Eq. (11), R_n = beta_n intersect beta-bar_n. The paper's central claim that the refined 2D-MUSIC stage matches full 2D-MUSIC is valid only if every true (theta_k, r_k) is contained in one of the resulting angle-distance clusters. No proof, miss probability, or threshold-selection rule is given for this containment. The physical justification for Eq. (11) is a qualitative statement that off-boresight near-field beam patterns have local minima at the true range; no derivation from the steering-vector model in Eqs. (1)-(2) is supplied. It is therefore not established that r_k is a minimum of both P_low(r) and P_up(r), that beta_n and beta-bar_n are nonempty, or that their intersection contains r_k. The only fallback, Step 4, expands distance clusters when the detected count is wrong; it never re-opens angle clusters, so a source excluded in Step 1 is irrecoverable. Because the entire complexity reduction is obtained by shrinking the 2D-MUSIC search to these clusters, the accuracy comparison in Fig. 5 and the runtime in Table I are both conditional on this unverified containment. This is an internal gap, not a disagreement with community consensus: the authors themselves provide no argument that the coarse stages cannot discard a source.","agreement_with_reader":"agree"},"referee_report":{"model":"deepseek-v4-flash","summary":"This letter proposes a low-complexity near-field source localization algorithm. It first forms an FFT-based angle spectrum (Eq. (8)) and partitions the angle domain into clusters using a threshold Gamma_theta = min({p_Theta}) - delta_theta, then uses 1D beamforming at the cluster boundaries (Eq. (10)) to form distance clusters R_n = beta_n intersect beta-bar_n (Eq. (11)), and finally applies 2D-MUSIC only inside the surviving angle-distance cells. The reported simulation for one geometry with four sources shows RMSE comparable to full 2D-MUSIC with runtime 3.38 s versus 22.07 s.","tokens_in":7238,"tokens_out":6098,"duration_ms":55524,"significance":"If the inclusion property of the coarse stages can be rigorously established, the proposal would be a useful complexity-reduction scheme for near-field localization, with the practical advantage of not requiring d <= lambda/4. The complexity analysis is explicit, the simulation setup is clearly described, and the authors correctly identify that the final stage is the standard 2D-MUSIC estimator. However, the central claim currently rests on unproved containment assumptions for the angle and distance clusters, and the threshold parameters delta_theta and delta_d are not specified; these issues must be resolved before the complexity/accuracy trade-off can be considered established.","major_comments":[{"comment":"The spectral formula p_theta = diag(W R W^{-1}) is undefined as written because W is an S x S DFT matrix while R is M x M (M=512 and S=1024 in the simulations); the multiplication is not conformable unless zero-padding or resizing is implicitly assumed, which the manuscript never states. The text says FFT and IFFT are applied to column and row vectors, but the displayed matrix expression does not correspond to that description and no derivation from the near-field steering model in Eqs. (1)-(2) is supplied.","section":"Section IV, Step 1, Eq. (8)"},{"comment":"The central complexity reduction is valid only if every true source angle theta_k lies in one of the angle clusters alpha_n and every true distance r_k lies in the corresponding distance cluster R_n. The manuscript provides no proof, no miss probability, and no rule for selecting delta_theta and delta_d; it only states that thresholds are set as Gamma_theta = min({p_Theta}) - delta_theta and pr <= min{pr} + delta_d. Because Step 4 can only expand distance clusters and never re-opens angle clusters, a source whose angle is excluded in Step 1 is irrecoverable, so the comparison with full 2D-MUSIC in Fig. 5 and the runtime in Table I are conditional on an unverified containment property.","section":"Section IV, Steps 1 and 3"},{"comment":"The assertion that the off-boresight beam patterns P_low(r) and P_up(r) exhibit local minima at the true distance is supported only by a qualitative comment and Fig. 3; no derivation from the steering-vector model in Eqs. (1)-(2) is given. It is therefore not established that beta_n and beta-bar_n are nonempty, that their intersection contains r_k, or that the distance cluster R_n = beta_n intersect beta-bar_n always contains the true source, which is the load-bearing condition for Step 3.","section":"Section IV, Step 2, Eq. (11)"},{"comment":"The numerical validation uses a single favorable configuration (four sources with angles 6, 7, 8, and 20 degrees and distances 3, 4, 5, and 32 m) and does not report the values of delta_theta and delta_d, the number of Monte Carlo trials, error bars, or the fraction of runs in which all true sources were contained in the clusters. The statement that the proposed algorithm can theoretically attain the same performance as 2D-MUSIC is true by construction once the clusters are correct, since the final stage is the same estimator; what must be demonstrated is that the coarse stages do not discard true sources, and the current results do not substantiate that over a range of geometries or SNRs.","section":"Section V"}],"minor_comments":[{"comment":"The text says 'Sum the number of close sources Kclose as well as distant sources Kclose'; the second symbol should be Kdistant.","section":"Algorithm 1, line 16"},{"comment":"The axis labels appear to be inconsistent with the captions: panel (a) is titled 'RMSE of distance versus SNR' but the y-axis is labeled 'RMSE(°)', while panel (b) is 'RMSE of angle versus SNR' with y-axis 'RMSE(m)'.","section":"Fig. 5"},{"comment":"The statement that the search complexity is 'O[M^4]' is imprecise; the complexity is O[n_theta n_r (M-K)(M+1)], which scales as O[M^4] only if n_theta n_r is proportional to M^2, and this scaling should be stated explicitly.","section":"Section III"},{"comment":"If W is the unnormalized DFT matrix, then W^{-1} is (1/S) W^H, and the normalization convention should be stated to avoid ambiguity in the diagonal extraction.","section":"Section IV, Eq. (8)"}],"recommendation":"major_revision","confidential_remarks":"The underlying idea is plausible and the missing pieces are in principle addressable: a corrected spectral formula, a containment or miss-probability analysis for the clustering steps, explicit threshold values, and a sensitivity study. If the authors can supply those, the contribution could be acceptable for a letter; as it stands, the complexity claim cannot be evaluated independently of unverified cluster-containment assumptions. I would ask the editor to require a substantive revision rather than reject, since the identified gaps are load-bearing but not obviously unfixable within the manuscript's scope."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"Honest take: this is a plausible complexity-reduction trick for near-field 2D-MUSIC, and the simulation shows a real speedup with matching accuracy in one favorable configuration. But the paper never proves the coarse stages cannot discard a true source, and the threshold parameters are left unspecified. That gap is the difference between a conditional accept and a reject.\n\nWhat's new: adapting the FFT coarse search plus distance-domain beamforming idea from far-field [11,12] to spherical wavefronts, and doing so at half-wavelength spacing, which RR-MUSIC and RD-MUSIC cannot handle. The complexity analysis is explicit, and the runtime table shows 3.38 s versus 22.07 s for full 2D-MUSIC. The RMSE curves in Fig. 5 show the proposed scheme tracking 2D-MUSIC across SNR, with RD/RR-MUSIC failing at d=λ/2 as expected. That is a real, useful result for XL-MIMO near-field sensing.\n\nWhere it gets soft: the load-bearing step is the angle-cluster and distance-cluster containment. Step 1 sets Γθ = min({pΘ})−δθ, which only guarantees that the detected peaks are included; if a true source is weak enough to not appear as a peak, or its spectral response falls below Γθ, it is excluded permanently. Step 4 can widen distance clusters but cannot re-open an angle cluster. Similarly, Eq. (11) assumes the true range lies in β_n ∩ β_n because off-boresight beam patterns have local minima there; the paper gives no derivation, and the parameters δ_θ, δ_d are never assigned values or given a selection rule. Without a miss probability or sensitivity analysis, the central claim that the refined stage matches full 2D-MUSIC is only conditional on assumptions that may fail. Also, Eq. (8)'s diag(W R W^{-1}) is notationally odd—normally one would see a DFT on the array covariance, such as W R W^H—and no code or data are provided, with a single simulation setup and no error bars on the RMSE.\n\nWho it is for: someone working on near-field localization/ISAC for XL-MIMO who wants a low-complexity alternative to 2D-MUSIC and is willing to test the thresholds themselves. The idea is worth engaging with; the paper is not ready to be taken as a finished robustness claim.\n\nRecommendation: send it to peer review. The gap is addressable—supply threshold rules, a detection guarantee or at least a sensitivity sweep, and ideally code—and the relevance to 6G sensing is high enough that a serious referee should look at it.","headline":"Plausible complexity-reduction for near-field 2D-MUSIC with a real speedup, but the unproven containment guarantee and unspecified thresholds keep it conditional.","tokens_in":7799,"tokens_out":2955,"would_cite":false,"duration_ms":23736,"reading_group":"maybe","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":[],"pacs":[],"model":"deepseek-v4-flash","headline":"A coarse-to-fine FFT-pruned search achieves near-field 2D-MUSIC accuracy at a fraction of the runtime, with no extra antenna-spacing constraints.","keywords":["FFT-MUSIC","near-field source localization","super-resolution sensing","2D-MUSIC","angle and distance estimation","spectrum peak search","extremely large-scale MIMO","beamforming"],"falsifier":"Pick the paper's configuration ($M=512$, $\\lambda/2$ spacing, four sources, SNR from 5 to 25 dB) and run many random source placements; record whether every true angle lies inside some angle cluster and every true distance lies inside the corresponding $R_n = \\beta_n \\cap \\overline{\\beta}_n$. If any trial yields a cluster count below $K$ or a true range outside the intersection, then the coarse stages are not lossless and the claim of matching full 2D-MUSIC accuracy fails for that scenario.","tokens_in":6680,"feed_emoji":"📡","tokens_out":7408,"duration_ms":59553,"temperature":0.7,"pith_summary":"This paper claims that near-field source localization—estimating both angle and distance from an extremely large array—can be made cheap without giving up resolution. The proposed algorithm scans the angle domain with an FFT to discard most of the search space, then uses 1D beamforming at the edges of each surviving angle cluster to narrow the distance range, and finally runs the full 2D-MUSIC peak search only inside the remaining small angle-distance boxes. The result is that the dominant $n_\\theta n_r (M-K)(M+1)$ spectrum-search cost shrinks to $L n'_\\theta n'_r (M-K)(M+1)$ with $n'_\\theta \\ll n_\\theta$ and $n'_r \\ll n_r$, and the numerical example reports a runtime of 3.38 seconds against 22.07 seconds for full 2D-MUSIC at the same localization RMSE. A practical payoff is that the method keeps the standard half-wavelength antenna spacing, which reduced-rank and reduced-dimension MUSIC cannot do.","feed_headline":"FFT search slashes near-field localization cost to 3.38 s","feed_subtitle":"A coarse FFT angle scan plus narrow 2D-MUSIC refinement matches full 2D-MUSIC accuracy at one-seventh the runtime.","key_machinery":"The central objects are angle clusters and distance clusters. An angle cluster is a contiguous block of FFT-spectrum samples exceeding the threshold $\\Gamma_\\theta = \\min(\\{p_\\Theta\\})-\\delta_\\theta$; it is designed to contain any group of sources whose energy spreads across adjacent bins. A distance cluster is the intersection $R_n = \\beta_n \\cap \\overline{\\beta}_n$ of the distance sets found by beamforming scans at the two angular bounds $\\underline{\\alpha}_n$ and $\\overline{\\alpha}_n$ of an angle cluster, and the paper asserts that the true distance of every 'close' source lies inside this intersection. These clusters work by shrinking the 2D-MUSIC search domain from the whole $n_\\theta n_r$ grid to $L n'_\\theta n'_r$ points, turning a search whose cost is comparable to $M^4$ into one comparable to $2MS\\log_2(S) + 2Ln_rM^2$ plus a tiny final refinement.","core_discovery":"The central claim is that a coarse-to-fine spectral search solves the near-field joint angle-and-distance localization problem at a fraction of the cost of 2D-MUSIC while retaining its resolution. The algorithm first applies an FFT/IFFT to the sample covariance matrix to form an angle spectrum, groups spectral peaks above a threshold into angle clusters, and classifies clusters as containing either a single 'distant' source or multiple 'close' sources. For close-source clusters, a pair of 1D beamforming scans at the cluster's two angular bounds produces distance sets, and the intersection of those sets is taken as the distance cluster that must contain the true ranges; a final 2D-MUSIC inside each angle-distance cluster yields precise and automatically paired angle-distance estimates. The paper's numerical evidence shows localization RMSE matching full 2D-MUSIC while running in 3.38 s versus 22.07 s, with total complexity $O[M^3 + M^2J + 2MS\\log_2(S) + 2Ln_rM^2 + L n'_\\theta n'_r (M-K)(M+1)]$.","pith_inferences":["The inclusion guarantees for the coarse stages are the true load-bearing assumption; a miss-probability analysis for $\\Gamma_\\theta$ and $\\delta_d$ across SNR would tell how generally the speedup holds.","The saving depends on the number $L$ of angle clusters and the sizes $n'_\\theta, n'_r$: scenes with many well-separated sources will dilute the advantage, so a scaling law in $K$ would sharpen the complexity claim.","The same coarse-to-fine pruning could be transplanted to other high-resolution estimators or to polar-domain beam training codebooks, since the FFT angle scan and the distance-cluster intersection do not rely on the specific final estimator."],"forward_implications":["The dominant 2D spectrum-search complexity drops from $O[n_\\theta n_r (M-K)(M+1)]$ to $O[L n'_\\theta n'_r (M-K)(M+1)]$, which the numerical example realizes as a runtime reduction from 22.07 s to 3.38 s.","Because angle and distance are estimated directly through the near-field steering vector without Taylor-approximation decoupling, the algorithm remains valid at $\\lambda/2$ antenna spacing, where RR-MUSIC and RD-MUSIC fail.","The final super-resolution stage is exactly 2D-MUSIC restricted to a small box, so the resolution and the automatic angle-distance pairing within that box match full 2D-MUSIC.","For 'distant' sources whose FFT spectrum is a sharp single peak, the algorithm outputs angle and distance immediately, so only the close sources pay the refined 2D-MUSIC cost."],"supporting_citations":[{"why":"Supplies the near-field 2D-MUSIC algorithm whose full-grid peak search is the complexity baseline the paper reduces.","marker":"[4]"},{"why":"The reduced-rank MUSIC baseline the paper compares against; it has lower complexity but requires $\\lambda/4$ spacing.","marker":"[7]"},{"why":"The reduced-dimension MUSIC baseline; the paper matches its complexity while removing its $\\lambda/4$ spacing restriction.","marker":"[8]"},{"why":"One of two FFT-plus-MUSIC coarse-to-fine schemes the angle-cluster stage adapts to the near-field case.","marker":"[11]"},{"why":"The other FFT-plus-MUSIC scheme that motivates the coarse FFT angle scan followed by fine MUSIC refinement.","marker":"[12]"},{"why":"Provides the near-field spherical-wavefront model and the sensing context that the algorithm targets.","marker":"[2]"}],"fun_headline_variants":["FFT coarsens then refines to cut near-field localization time by 85%","Near-field super-resolution in 3.38s with FFT-aided 2D-MUSIC","Coarse-to-fine FFT scan beats 2D-MUSIC speed, keeps accuracy","One-seventh runtime for near-field localization: FFT + refined MUSIC","FFT slashes near-field sensing complexity, matches 2D-MUSIC"],"cache_read_input_tokens":3200,"weakest_assumption_plain":"The entire speedup rests on the claim that the coarse FFT angle scan and the beamforming distance scans never discard a real source: if a true angle falls below the cluster threshold, or a true distance falls outside the intersection $R_n$, the final refined search cannot recover it, and the paper gives no proof or miss-probability bound for these inclusions.","fun_headline_variants_meta":{"raw":{"variants":["FFT coarsens then refines to cut near-field localization time by 85%","Near-field super-resolution in 3.38s with FFT-aided 2D-MUSIC","Coarse-to-fine FFT scan beats 2D-MUSIC speed, keeps accuracy","One-seventh runtime for near-field localization: FFT + refined MUSIC","FFT slashes near-field sensing complexity, matches 2D-MUSIC"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.000211,"raw_usage":{"total_tokens":1415,"prompt_tokens":949,"completion_tokens":466,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":565,"completion_tokens_details":{"reasoning_tokens":351}},"tokens_in":565,"tokens_out":466,"duration_ms":4466,"temperature":1.0,"reasoning_tokens":351,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-12T14:11:03.522073+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"Pick the paper's configuration ($M=512$, $\\lambda/2$ spacing, four sources, SNR from 5 to 25 dB) and run many random source placements; record whether every true angle lies inside some angle cluster and every true distance lies inside the corresponding $R_n = \\beta_n \\cap \\overline{\\beta}_n$. If any trial yields a cluster count below $K$ or a true range outside the intersection, then the coarse stages are not lossless and the claim of matching full 2D-MUSIC accuracy fails for that scenario.","supporting_citations":[{"cited_title":"Near-field multiple source localization by passive sensor array,","cited_arxiv_id":null,"evidence_quote":"Supplies the near-field 2D-MUSIC algorithm whose full-grid peak search is the complexity baseline the paper reduces."},{"cited_title":"Passive localization of noncircular sources in the near-field,","cited_arxiv_id":null,"evidence_quote":"The reduced-rank MUSIC baseline the paper compares against; it has lower complexity but requires $\\lambda/4$ spacing."},{"cited_title":"Localization of near-field sources: A reduced-dimension music algorithm,","cited_arxiv_id":null,"evidence_quote":"The reduced-dimension MUSIC baseline; the paper matches its complexity while removing its $\\lambda/4$ spacing restriction."},{"cited_title":"Signal processing for passive radar using ofdm waveforms,","cited_arxiv_id":null,"evidence_quote":"One of two FFT-plus-MUSIC coarse-to-fine schemes the angle-cluster stage adapts to the near-field case."},{"cited_title":"Frequency estimation based on modulation fft and music algorithm,","cited_arxiv_id":null,"evidence_quote":"The other FFT-plus-MUSIC scheme that motivates the coarse FFT angle scan followed by fine MUSIC refinement."},{"cited_title":"Cram ´er-rao bounds for near-field sensing with extremely large-scale mimo,","cited_arxiv_id":null,"evidence_quote":"Provides the near-field spherical-wavefront model and the sensing context that the algorithm targets."}],"review_version":1}