{"id":"3b3db2f4-b0d7-4c80-b146-3f0113c1ac57","arxiv_id":"1908.10487","paper_version":2,"verdict":"CONDITIONAL","confidence":"MODERATE","novelty_score":6.0,"correctness_risk":"medium","formal_verification":"none","parameter_count":4,"one_line_summary":"A one-bit MIMO radar with time-varying thresholds can estimate angles and Doppler frequencies gridlessly via ℓ1-regularized atomic norm minimization, using only about 3% of the data of a classic 16-bit radar.","lead":"This paper proposes a one-bit MIMO radar that uses time-varying thresholds and compressive sensing to estimate target angles and Doppler frequencies from sign-only measurements. If the method works as shown, radar hardware could become cheaper and lower-power while keeping high-resolution estimation.","discovery_kind":"extension","skeptic_critique":{"model":"deepseek-v4-flash","headline":"Sparse-perturbation rationale fails for RGT: with threshold variance 5σ² the sign-flip rate is SNR-independent (~10%), so p_q is not sparse in the strategy that yields the paper's best results.","rationale":"The reader identified the sparse-perturbation equivalence as the weakest assumption. I agree with that diagnosis and find it the most load-bearing gap in the paper's argument. However, I would sharpen it: the reader's example ('threshold centered at the signal at low SNR') is actually realized by the RGT strategy at all SNRs, not just low SNR, because the threshold variance is proportional to σ². This makes the sparse-perturbation premise fail precisely in the high-SNR regime where the paper advertises its best performance. The paper's Theorem 1 is correct but weak, and Figure 1 only demonstrates sparsity empirically for a threshold configuration that is not the one used for the headline results. The ADMM derivation and CRB analysis appear internally consistent, and the simulation results are plausible, so I do not see a contradiction that would justify rejection. The lack of a recovery guarantee and the mismatch between the sparsity assumption and the RGT strategy are serious enough to keep the verdict at CONDITIONAL, requesting either a theoretical guarantee under explicit conditions or a clear statement that the method's success is empirical and threshold-dependent. My proposed test would determine whether the concern actually lands by measuring the sign-flip rate for RGT and whether the ℓ1 penalty is essential.","tokens_in":26407,"tokens_out":26531,"duration_ms":263572,"concrete_test":"Run the Monte Carlo used for Fig. 1, but with the paper's RGT threshold parameters (threshold mean = r_q, variance 5σ², noise variance σ²) at SNR = 40 dB and SNR = −10 dB. Compute the average percentage of nonzero entries of p_q constructed via Theorem 1 with the true X and true noise. If the percentage stays near 10% (or any value not decreasing with SNR), then the sparse-perturbation rationale does not apply to RGT. Additionally, set λ = 0 in (19) and compare RGT MSE at SNR = 40 dB; if performance does not degrade, sparsity is not needed, and the motivation for the ℓ1 penalty is not load-bearing.","verdict_should_be":"UNCHANGED","load_bearing_attack":"Section IV.B justifies the ℓ1 penalty in (19) via Theorem 1 plus the empirical claim that the constructed p_q is sparse (Fig. 1). Theorem 1 only bounds ‖p_q‖₀ by ‖w_q‖₀; the actual support is the set of sign flips, whose sparsity is SNR-dependent. Figure 1 shows non-sparse p at low SNR (≈45% at −20 dB), but the more serious problem is the RGT strategy used for the headline results in Figs. 3 and 6. For RGT, the threshold mean equals r_q and σ_r² = 5σ², so d = r_q − h_q ∼ N(0, 5σ²) and the noise real part ∼ N(0, σ²/2). The flip probability P(sign(d+w) ≠ sign(d)) is independent of σ; with these parameters it is about 0.10 for the real part (and similarly for the imaginary part), so the average ‖p_q‖₀ / (LR) does not go to zero as SNR → ∞. Hence the sparse-impulsive-perturbation precondition used to motivate the ℓ1 term is violated in the very setup (RGT, high SNR) where the paper reports MSEs of 10⁻⁷–10⁻⁹. No recovery guarantee is supplied for (19) even under sparsity, so the central claim rests entirely on simulations, and the theoretical bridge is weakest exactly where the headline performance is achieved.","agreement_with_reader":"partial"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper studies a one-bit MIMO radar (1b-MIMO) that combines temporal one-bit sampling with time-varying thresholds, random antenna selection (SAA) in the spatial domain, and reduced time-on-target (RTT) in the Doppler domain. The observation model is given by (5)-(9), and the goal is to estimate K angle-Doppler pairs from sign measurements. The authors prove an atomic-norm/rank equivalence (Appendix A), introduce a perturbation vector p_q, and, based on the claimed sparsity of p_q, formulate the convex 1b-ANM-L1 problem (19). They derive an ADMM algorithm with closed-form updates (34)-(40), compute the CRB for one-bit data as a weighted version of the unquantized FIM (Section VI), and compare random uniform thresholds (RUT) with random Gaussian thresholds (RGT). Numerical experiments show that, after successful detection, the 1b-MIMO radar can achieve MSEs as low as 10^-7 to 10^-9 for normalized spatial and Doppler frequencies at high SNR, with a data volume about 3% of a classic 16-bit MIMO radar.","tokens_in":26720,"tokens_out":14451,"duration_ms":145912,"significance":"If the central claims hold, the paper provides a practical architecture and algorithm for reducing ADC cost, energy, and data volume in MIMO radar while retaining high-resolution angle-Doppler estimation. The strength of the manuscript is its explicit convex formulation, the closed-form ADMM updates (34)-(40), and the CRB analysis (51)-(54) that correctly exhibits the weighted-FIM structure known from [24]; Appendix A gives a proof of the atomic-norm/rank equivalence used in (12). The numerical study is broad, covering SNR sweeps, threshold bit depth, number of samples, number of targets, and runtime comparisons with CVX solvers. The main weakness is that the theoretical justification of the sparse perturbation is not established for the RGT strategy that underlies several of the headline results, so the current version is better viewed as a heuristic validated by simulation than as a fully guaranteed estimator.","major_comments":[{"comment":"The sparse-perturbation justification for the ℓ1 term in (19) is not valid for the random Gaussian threshold (RGT) strategy that yields the best results in Figs. 3 and 6. In the RGT simulation, the threshold mean equals the signal and σ_r² = σ_i² = 5σ², so d_n = ([r_q]_n - [h_q^r]_n)/σ ∼ N(0,5) independently of SNR, while the real-part noise has variance 1/2 on the same scale. Consequently P(sign(d_n + w_n) ≠ sign(d_n)) is an SNR-independent constant (about 0.10 per real component, hence about 0.19 per complex sample), and the expected support of the perturbation p_q constructed in Theorem 1 does not tend to zero as SNR→∞. Theorem 1 only establishes existence with ‖p_q‖₀ ≤ ‖w_q‖₀, which is trivial for dense Gaussian noise; the actual sparsity of p_q is therefore an additional empirical assumption, and Figure 1 does not document the threshold strategy used. Since no recovery guarantee is supplied for (19) even under genuine sparsity, the theoretical bridge is weakest exactly in the high-SNR RGT regime where the paper reports MSEs of 10⁻⁷ to 10⁻⁹. Please prove a sign-flip sparsity bound for RGT, restrict the sparse-perturbation claim to strategies such as RUT where flips vanish asymptotically, or explicitly reposition (19) as a heuristic and add experiments showing robustness to roughly 10-20% randomized sign flips.","section":"Section IV.B, Fig. 1, Eq. (19)"},{"comment":"The RGT implementation uses threshold means equal to estimates of r_q and i_q provided by the RUT-based 1b-MIMO algorithm on the same data. As the footnote acknowledges, this demonstrates the best achievable performance of RGT rather than a standalone implementable strategy. The conclusion that the RGT strategy can improve performance in the high SNR regime by utilizing a priori information should be qualified accordingly, and the sensitivity of the RGT curves to the quality of the prior estimates should be quantified, for example by using only a fraction of the data or a lower-fidelity prior.","section":"Section VII.A and footnote 1"},{"comment":"The MSE curves are averaged only over trials in which detection is successful, while the CRB curves are unconditional lower bounds. A conditional MSE can fall below the unconditional CRB, so the closeness of the MSE and CRB curves in Fig. 3 may be partly an artifact of the conditioning. Please either compute the CRB under the same conditioning, report unconditional MSE as well, or state explicitly that the CRB overlay is only indicative.","section":"Section VII.B, Fig. 3"}],"minor_comments":[{"comment":"The phrase 'during the the q-th pulse' contains a duplicated 'the'.","section":"Section III, after Eq. (5)"},{"comment":"The quantities a(θ) and b(θ) are vectors, not matrices; the text should say 'steering vectors' rather than 'steering matrices'.","section":"Section II"},{"comment":"Algorithm 1 updates X, then u1 and u2, then p and b, whereas Eqs. (23)-(26) present a joint X, P update followed by b and H; please state that the algorithm is a Gauss-Seidel variant of (23)-(26).","section":"Section V, Algorithm 1"},{"comment":"The bound I(θ) ≼ (2/π) Ĩ(θ) is stated without proof; a one-line argument that the weight function ω(x) is bounded above by 2/π would make the section self-contained.","section":"Section VI.C"},{"comment":"The step from (A9) to the conclusion 'K = K*' is terse; a sentence justifying that the matrices Z1 and Z2 can be chosen with the stated factorization would help the reader.","section":"Appendix A"},{"comment":"Figure 1 should state the threshold strategy and all simulation parameters; as written, the empirical sparsity claim used to motivate (19) cannot be reproduced or checked.","section":"Fig. 1"}],"recommendation":"major_revision","confidential_remarks":"The paper is within the journal's scope and the core algorithmic and CRB material is solid. The main risk is the gap between the theoretical sparse-perturbation narrative and the RGT experiments that produce the headline numbers; the revision should address this directly. I would not recommend rejection, because the central convex formulation and the experiments can be reframed or repaired, but the issue is load-bearing for the stated main contribution."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"Dear [colleague],\n\nThe paper is a competent and useful engineering contribution. The 1b-ANM-L1 problem (19) for joint angle/Doppler estimation from one-bit MIMO data with time-varying thresholds is new, the ADMM solver with closed-form updates is derived in detail and appears correct, and the CRB analysis for one-bit MIMO under RUT and RGT is a genuine extension of the weighted-FIM structure from [24]. The lemmas and Theorem 1 are correct as stated, and the simulations are thorough: SNR sweeps, target count, code length, runtime comparisons, and a fair data-volume comparison against 16-bit MIMO systems.\n\nThat said, the central theoretical claim is overstated. The abstract says noise in one-bit sampling is \"equivalent to that of sparse impulsive perturbations.\" Theorem 1 only shows existence of a perturbation p_q with support no larger than the support of the noise; it does not establish sparsity. For the RGT strategy used in the paper's headline results, the threshold mean equals the signal and the threshold variance is 5σ², so the sign-flip probability is constant in SNR—roughly 10% per real/imaginary component. As SNR→∞, ‖p_q‖₀ does not go to zero. The perturbation is not sparse in exactly the high-SNR RGT regime where the paper reports MSEs of 10⁻⁷–10⁻⁹. Figure 1's empirical sparsity plot corresponds to a different threshold setting; it does not rescue the claim.\n\nThis is a real gap, but it is not fatal if the paper is honest about it. The ℓ1 penalty can be presented as a regularizer that works well in practice, rather than a certified sparse-recovery guarantee. The recovery theory for (19) is absent anyway, so the frame should be \"empirically motivated convex relaxation\" not \"equivalence.\" The CRB section, ADMM derivation, and numerical study stand on their own. Two minor issues: no code or data are released, which makes the 10⁻⁹ MSE claims unverifiable by others; and the model-order heuristic in Fig. 8 (min{0.5+SNR/50, 0.9}) is ad hoc and unexplained.\n\nThis paper is for the radar/signal-processing community working on low-bit ADCs and atomic norm methods. It deserves a serious referee—the formulation is new, the solver is usable, and the CRB is applicable. My recommendation: send to peer review, expect major revision, and ask the authors to either prove a sparsity result for RGT or reframe the ℓ1 term as a heuristic and soften the abstract accordingly.","headline":"Solid engineering with a genuine new formulation and careful CRB analysis, but the central sparse-perturbation argument fails exactly in the RGT regime where the paper's best numbers are produced.","tokens_in":27294,"tokens_out":3950,"would_cite":true,"duration_ms":45596,"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":"The paper claims one-bit MIMO radar can jointly estimate target angles and Doppler frequencies off the grid, with mean-squared errors down to 10^-9 in simulations while storing about 3% of the data of a 16-bit system.","keywords":["one-bit MIMO radar","time-varying thresholds","atomic norm minimization","gridless parameter estimation","angle and Doppler estimation","sparse perturbation","Cramér-Rao bound","ADMM"],"falsifier":"Simulate the paper's 1b-MIMO setup at, say, SNR = -20 dB with a time-varying threshold whose mean equals the true signal level, so many samples sit near the comparator, and count how often entries of the perturbation $p_q$ from Theorem 1 are nonzero. If that fraction is high, above roughly 40-50%, at the same time that the 1b-ANM-L1 mean-squared error stops tracking the derived Cramér-Rao bound as the sample length $L$ grows, then the sparse-perturbation premise is what breaks.","tokens_in":26175,"feed_emoji":"📡","tokens_out":13235,"duration_ms":115860,"temperature":0.7,"pith_summary":"This paper asks whether a MIMO radar can replace its high-bit ADCs with one-bit comparators, keeping only the sign of each sample against a known time-varying threshold, and still estimate target angles and Doppler frequencies accurately. It claims yes: noise in the signed measurements can be modeled as a sparse impulsive perturbation, so a convex program that recovers a low-rank matrix and an $\\ell^1$-sparse correction solves the problem without putting the frequencies on a grid. In simulations the one-bit radar reaches normalized-frequency mean-squared errors of $10^{-7}$ to $10^{-9}$ at high SNR while generating only about 3% of the data volume of a classic 16-bit MIMO radar. A derived Cramér-Rao bound shows the one-bit Fisher information is a weighted version of the unquantized one, capped at about 64% of it.","feed_headline":"One-bit radar estimates angles and Doppler to 10^-9 error","feed_subtitle":"A comparator-only 1b-MIMO radar needs only about 3% of classic data while staying gridless.","key_machinery":"The load-bearing mechanism is the 1b-ANM-L1 formulation (problem (19)), which pairs the atomic norm of the two-dimensional sinusoidal data matrix with $\\ell^1$ regularization on the perturbation vectors $p_q$. The atomic norm is the trace-minimization surrogate for the sparsest decomposition of $X$ into atoms $w(\\phi_1) v^H(\\phi_2)$, realized through a positive-semidefinite block matrix $[T(u_1) \\, X; \\, X^H \\, T(u_2)] \\succeq 0$; the $\\ell^1$ term is justified by Theorem 1, which says a sparse $p_q$ exists whenever the noisy signed data are consistent with some signal. The same machinery also produces the parameter estimates: the Toeplitz factors $T(u_1)$ and $T(u_2)$ carry the angle and Doppler frequencies, and their Vandermonde decompositions yield the gridless angle-Doppler pairs.","core_discovery":"At the center of the paper is the claim that a one-bit MIMO radar, where each receive antenna keeps only the sign of the real and imaginary parts of the received waveform relative to a known, time-varying threshold, can estimate target angles and Doppler frequencies without any discretization grid. The enabling observation is Theorem 1: for each transmitted pulse, the effect of the unknown noise on the sign measurements can be replaced by a perturbation vector $p_q$ with no more nonzero entries than the noise itself, so the one-bit consistency constraint can always be met. This leads to the 1b-ANM-L1 program (problem (19)): minimize the trace of two Toeplitz matrices, the atomic norm of the low-rank data matrix $X = \\sum_{k=1}^K \\beta_k c(\\theta_k) d^H(\\nu_k)$, plus an $\\ell^1$ penalty on the perturbing vectors, subject to a positive-semidefinite block-Toeplitz constraint and the sign constraints. Angle and Doppler frequencies are then obtained by Vandermonde decomposition of the two Toeplitz factors. The paper also shows that the Fisher information matrix of the one-bit data is a weighted version of the unquantized Fisher information, with weights bounded by $2/\\pi$, and reports simulations in which the one-bit radar approaches the accuracy of 16-bit systems at low SNR and reaches $10^{-9}$ normalized-frequency errors at high SNR.","pith_inferences":["The paper does not explore this, but the sparse-perturbation equivalence suggests the same 1b-ANM-L1 template transfers to any one-bit low-rank recovery problem, such as massive MIMO channel estimation or passive radar, wherever the matrix to recover is a sum of a few 2D sinusoids.","The random-Gaussian-threshold results imply an adaptive-threshold design that the paper only sketches: use a first coarse one-bit pass to center later thresholds on the signal, then shrink the threshold variance as the estimate improves; the paper fixes the variance at five times the noise variance rather than optimizing it.","A testable extension would be to replace the fixed $\\ell^1$ penalty with a weighted or reweighted $\\ell^1$ scheme that exploits knowledge of where sign flips are more likely, near threshold crossings, potentially improving low-SNR performance beyond the reported results.","Because the CRB weight function $\\omega(x)$ is largest when the threshold sits exactly on the signal, threshold placement and signal distribution interact; one could design time-varying thresholds to match the expected signal histogram and approach the $2/\\pi$ Fisher-information cap more closely."],"forward_implications":["A MIMO radar can be built around one-bit comparators and still resolve targets: in the paper's configuration it stores only about 3% of the data of a classic 16-bit MIMO radar while keeping angle-Doppler estimates accurate.","In the low-SNR regime the one-bit radar matches or beats its 16-bit counterparts in probability of successful detection; the high-SNR gap is narrowed by using random Gaussian thresholds that center on the signal.","The Cramér-Rao bound analysis implies a constant information loss from one-bit sampling: the one-bit Fisher information matrix is at most $2/\\pi$ times the unquantized one, so roughly 2 dB of information is gone regardless of the threshold choice.","Increasing the temporal sampling rate $L$ is a practical lever for the one-bit radar: the simulations show its MSE falls steadily as $L$ grows even though the bit budget stays far below the high-bit rivals, because one-bit ADCs are cheap at high rates.","The ADMM-based solver keeps the 1b-ANM-L1 program tractable as the array and CPI dimensions grow, where a generic interior-point solver becomes slow or runs out of memory."],"supporting_citations":[{"why":"Establishes that sparse signals can be recovered from one-bit measurements, the premise that justifies sparsity-promoting recovery from sign data.","marker":"[19]"},{"why":"Supplies the quantized-spectral atomic-norm recovery approach and the weight-function form of the one-bit Fisher information used in the CRB analysis.","marker":"[24]"},{"why":"Introduces time-varying thresholds for one-bit sampling of multiple sinusoids, the threshold model the radar system adopts.","marker":"[22]"},{"why":"Applies one-bit sampling with time-varying thresholds to radar pulse-Doppler sensing, the direct precursor of the 1b-MIMO setup.","marker":"[27]"},{"why":"Provides the off-the-grid compressed-sensing/super-resolution theory that lets frequency parameters be estimated without a grid.","marker":"[44]"},{"why":"Defines atomic norm denoising, the core tool for recovering the low-rank matrix and the baseline used for the classic MIMO comparison.","marker":"[45]"},{"why":"Supplies the ADMM framework in which the iterative solver for the 1b-ANM-L1 problem is derived.","marker":"[49]"},{"why":"Gives the Vandermonde decomposition of Toeplitz matrices used to factor the recovered positive-semidefinite matrix into angle and Doppler frequency estimates.","marker":"[63]"}],"fun_headline_variants":["One-bit radar attains 10^-9 accuracy with few percent of data","Gridless one-bit MIMO radar: angle and Doppler precision at 10^-9","One-bit MIMO radar: 10^-9 error with 3% data","Gridless one-bit radar: 10^-9 angle and Doppler from 3% data","Time-varying thresholds sharpen one-bit radar to 10^-9"],"cache_read_input_tokens":3200,"weakest_assumption_plain":"The whole method rests on the premise that the perturbation $p_q$ that repairs the one-bit sign flips is sparse; the paper proves only that $p_q$ is no denser than the noise, and the actual sparsity is observed empirically, so if sign flips become dense, for instance a threshold centered on the signal at low SNR, the $\\ell^1$ penalty stops matching the noise and the estimator loses its justification.","fun_headline_variants_meta":{"raw":{"variants":["One-bit radar attains 10^-9 accuracy with few percent of data","Gridless one-bit MIMO radar: angle and Doppler precision at 10^-9","One-bit MIMO radar: 10^-9 error with 3% data","Gridless one-bit radar: 10^-9 angle and Doppler from 3% data","Time-varying thresholds sharpen one-bit radar to 10^-9"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.000719,"raw_usage":{"total_tokens":3276,"prompt_tokens":1043,"completion_tokens":2233,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":659,"completion_tokens_details":{"reasoning_tokens":2129}},"tokens_in":659,"tokens_out":2233,"duration_ms":14891,"temperature":1.0,"reasoning_tokens":2129,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-14T10:42:55.410392+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"Simulate the paper's 1b-MIMO setup at, say, SNR = -20 dB with a time-varying threshold whose mean equals the true signal level, so many samples sit near the comparator, and count how often entries of the perturbation $p_q$ from Theorem 1 are nonzero. If that fraction is high, above roughly 40-50%, at the same time that the 1b-ANM-L1 mean-squared error stops tracking the derived Cramér-Rao bound as the sample length $L$ grows, then the sparse-perturbation premise is what breaks.","supporting_citations":[{"cited_title":"1-bit compressive sensing,","cited_arxiv_id":null,"evidence_quote":"Establishes that sparse signals can be recovered from one-bit measurements, the premise that justifies sparsity-promoting recovery from sign data."},{"cited_title":"Quantized spectral compressed sens- ing: CramerRao bounds and recovery algorithms,","cited_arxiv_id":null,"evidence_quote":"Supplies the quantized-spectral atomic-norm recovery approach and the weight-function form of the one-bit Fisher information used in the CRB analysis."},{"cited_title":"One-bit compre s- sive sampling with time-varying thresholds for multiple sinusoids,","cited_arxiv_id":null,"evidence_quote":"Introduces time-varying thresholds for one-bit sampling of multiple sinusoids, the threshold model the radar system adopts."},{"cited_title":"Compressive radar sensing via one-bit sam- pling with time-varying thresholds,","cited_arxiv_id":null,"evidence_quote":"Applies one-bit sampling with time-varying thresholds to radar pulse-Doppler sensing, the direct precursor of the 1b-MIMO setup."},{"cited_title":"Com- pressed sensing off the grid,","cited_arxiv_id":null,"evidence_quote":"Provides the off-the-grid compressed-sensing/super-resolution theory that lets frequency parameters be estimated without a grid."},{"cited_title":"Atomic norm denoising with applications to line spectral estimation,","cited_arxiv_id":null,"evidence_quote":"Defines atomic norm denoising, the core tool for recovering the low-rank matrix and the baseline used for the classic MIMO comparison."},{"cited_title":"Distributed optimization and statistical learning via the alternating direction method of multipliers,","cited_arxiv_id":null,"evidence_quote":"Supplies the ADMM framework in which the iterative solver for the 1b-ANM-L1 problem is derived."},{"cited_title":"¨Uber den zusammenhang der extremen von harmonischen funktionen mit ihren koefzienten und ¨ uber den picard-landauschen satz,","cited_arxiv_id":null,"evidence_quote":"Gives the Vandermonde decomposition of Toeplitz matrices used to factor the recovered positive-semidefinite matrix into angle and Doppler frequency estimates."}],"review_version":1}