{"id":"9a6d44fe-6331-4e44-9194-26f247e9192d","arxiv_id":"1911.06700","paper_version":1,"verdict":"REJECT","confidence":"MODERATE","novelty_score":4.0,"correctness_risk":"high","formal_verification":"none","parameter_count":3,"one_line_summary":"A gridless atomic-norm approach to one-bit MIMO-OFDM channel estimation is proposed, but validation is limited to an uncompared simulation.","lead":"This paper proposes two algorithms, Binary Atomic Norm Minimization and a reweighted version, to estimate sparse millimeter-wave MIMO-OFDM channels from one-bit quantized measurements. The authors claim these gridless methods outperform grid-based one-bit compressive sensing, but the paper provides only one simulation figure with no comparison to existing methods.","discovery_kind":"extension","skeptic_critique":{"model":"deepseek-v4-flash","headline":"The sign-consistency constraints in (9)/(11) do not follow from the noise-corrupted one-bit model, so the true normalized channel can be infeasible and the recovery claim is unsupported.","rationale":"The reader's rejection is justified, and the most load-bearing weakness is exactly the sign-consistency constraint. Equations (9) and (11) impose elementwise nonnegativity of the real and imaginary parts of r_i (Phi h)_i, but under the stated one-bit model r = sign(Phi h + n) these inequalities are not implied. Whenever noise flips a sign, the true normalized channel becomes infeasible, so the convex program may return a biased or arbitrary point; no theorem in the paper rules this out. The majority-vote oversampling in Section IV reduces sign-error probability but is not a principled fix, and it is never analyzed. The paper also contains internal inconsistencies, such as describing the convex relaxation in (11) as nonconvex and NP-hard, and the reweighted formulation in (12) is stated without a convergence argument. The single simulation figure compares only the two proposed estimators and has no grid-based one-bit CS baseline, so the claimed improvement cannot be checked against known methods. Overall, these issues leave the central claim unverified, so the reader's REJECT verdict should be maintained unchanged.","tokens_in":6073,"tokens_out":7436,"duration_ms":81902,"concrete_test":"Run a feasibility check with the Fig. 1 settings (M=64, N=64, L=3): for each Monte Carlo trial, generate h from the channel model and noise n, compute r = sign(Phi h + n), apply the majority-vote oversampling with 5 noise realizations as in Section IV, normalize h_true = h/||h||_2, and test whether every one-bit measurement satisfies Re(r_i (Phi h_true)_i) >= 0 and Im(r_i (Phi h_true)_i) >= 0. Repeat over the SNR values used in Fig. 1 and across 1000 trials. A nonzero infeasibility rate at any plotted SNR shows the SDP feasible set excludes the true channel, so Fig. 1 does not establish recovery; a zero rate over all plotted SNR would weaken the objection.","verdict_should_be":"UNCHANGED","load_bearing_attack":"Equations (9) and (11) impose, for every one-bit measurement i, that Re(r_i (Phi h)_i) >= 0 and Im(r_i (Phi h)_i) >= 0. The paper justifies this by saying the product of each quantized measurement with the measurement is always non-negative. This is not valid under the stated model r = sign(Phi h + n). With additive noise, sign(Phi h + n)_i can differ from sign(Phi h)_i whenever the noise is comparable in magnitude to the signal, in which case the true normalized h violates the constraints and lies outside the feasible set. The Section IV majority-vote oversampling reduces the probability of such sign flips but does not eliminate them, and the majority-voted r is still not guaranteed to be sign-consistent with any h. Even in the noiseless case, under the componentwise real/imaginary sign convention stated in Section I, Re(sign(z) z) and Im(sign(z) z) are not both nonnegative for every complex z; for example z = 1 + 3j gives sign(z) = 1 + j and Re(sign(z) z) = -2. Therefore the feasible set can be empty or exclude the ground truth, and the atomic-norm objective has no recovery guarantee. Because the only simulation, Fig. 1, compares BiANM only with ReBiANM and not with any existing grid-based one-bit compressive sensing method, the reported NMSE improvement cannot be attributed to identifying the correct h. This makes the central claim of gridless recovery of the normalized sparse channel from one-bit measurements unsupported.","agreement_with_reader":"agree"},"referee_report":{"model":"deepseek-v4-flash","summary":"This paper considers channel estimation for millimeter-wave massive MIMO OFDM systems with one-bit ADCs. The received signal is modeled as r = sign(Φh + n), where h is a sparse channel vector composed of a small number of propagation paths. The authors propose a gridless method, Binary Atomic Norm Minimization (BiANM), which estimates the normalized sparse channel by minimizing an atomic norm subject to sign-consistency constraints, and a reweighted version (ReBiANM). They claim that the method avoids the grid mismatch of prior grid-based one-bit compressive sensing approaches. The only simulation, Fig. 1, compares BiANM with ReBiANM, with and without a majority-vote oversampling scheme.","tokens_in":6531,"tokens_out":8209,"duration_ms":70198,"significance":"If the method were correct, a gridless one-bit channel estimator for mmWave MIMO OFDM would be a useful contribution to the low-resolution ADC literature. The paper, however, does not provide a valid derivation of the optimization constraints, and the experimental evidence is limited to a self-comparison of the proposed variants. The central recovery claim is therefore unsupported, and the paper's contribution is limited to a suggestion that such a technique might be possible.","major_comments":[{"comment":"The sign-consistency constraints are not valid under the stated measurement model. The paper argues that Re(R' Φ h) ≥ 0 and Im(R' Φ h) ≥ 0 follow from the product of each quantized measurement with the measurement being nonnegative, but this is false for the model r = sign(Φh + n). With additive noise, sign(Φh + n)_i can differ from sign(Φh)_i whenever noise changes the quadrant of the argument. Even in the noiseless case, the paper's own definition of sign (applied componentwise to real and imaginary parts) does not imply nonnegativity of those products; for example, z = 1 + 3j gives sign(z) = 1 + j and Re(sign(z) z) = -2. Hence the true normalized h need not satisfy the constraints, the feasible set may be empty, and the BiANM recovery claim is unsupported.","section":"Section III, Eqs. (9) and (11)"},{"comment":"The majority-vote oversampling procedure does not repair the sign-consistency issue. With finite SNR, sign(Φh + n) disagrees with sign(Φh) at a nonzero fraction of coordinates; a majority vote over five noise realizations reduces but does not eliminate these disagreements, and the majority-voted r is still not guaranteed to be consistent with any h. The paper provides no analysis of the residual probability of infeasibility, so the proposed workaround does not restore the validity of the constraints.","section":"Section IV, oversampling paragraph"},{"comment":"The only reported experiment compares BiANM with ReBiANM under two oversampling conditions, but it does not compare against any existing grid-based one-bit compressive sensing method, a classical least-squares estimator, or a lower bound. Without such baselines, the NMSE curves cannot be interpreted as evidence of accuracy, and the claimed advantage over grid-based approaches is untested. In addition, the number of Monte-Carlo runs is not stated and no error bars are provided, making the reported curves unverifiable.","section":"Section IV, Fig. 1"},{"comment":"The equivalence between the atomic norm of the two-level Vandermonde channel and the SDP (10) is asserted but not established. The paper neither defines T_2D(u) explicitly nor verifies that the two-level Toeplitz/SDP conditions hold for the channel vector h in (4). Since the convex reformulation is the foundation of both BiANM and ReBiANM, this gap leaves the numerical solver and the claim of convexity unsubstantiated.","section":"Section III, Eqs. (10)-(11)"}],"minor_comments":[{"comment":"The phrase 'recover sparse channel form one-bit measurements' should read 'from one-bit measurements'.","section":"Abstract"},{"comment":"The first paragraph contains typographical errors, including 'scalating demand', 'etracted', and 'trigged'; a careful proofread is needed.","section":"Introduction"},{"comment":"Section II presents the uplink scenario, whereas Section IV describes the simulation as 'downlink mmWave channel estimators'; the system model should be consistent.","section":"Section II and Section IV"},{"comment":"Reference [10] is cited with a year of 2007 for an Asilomar conference paper on one-bit quantization, which appears to be incorrect; reference [12]'s title also seems unrelated to the channel-estimation topic. Please verify the references.","section":"References"},{"comment":"The definition of the reweighting matrix Θ_j is garbled and the label 'BiReANM' is inconsistent with the text's 'ReBiANM'; please clarify the update rule and unify the notation.","section":"Section IV, Eq. (12)"},{"comment":"The simulation section states results are averaged over 'many independent realizations' but does not specify the number of realizations or error bars; please provide these for reproducibility.","section":"Section IV, simulation setup"}],"recommendation":"reject","confidential_remarks":"The sign-consistency constraints at the heart of the proposed BiANM/ReBiANM formulation are not valid under the paper's own one-bit measurement model, and the issue cannot be fixed by the majority-vote oversampling described in Section IV. The experimental section does not include any baseline comparison. I recommend rejection."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"The paper proposes a gridless one-bit channel estimator for mmWave MIMO-OFDM. The specific combination—two-level Toeplitz structure plus reweighted atomic norm for the one-bit MIMO-OFDM setting—is new, and it addresses a real hardware constraint. That is the main credit. The optimization problems are plausible extensions of existing atomic norm tools, and the paper is honest that only the normalized channel can be recovered.\n\nThe problem is that the sign-consistency constraints in equations (9) and (11) are not valid under the paper's own sign definition. The paper defines sign(.) componentwise on real and imaginary parts, so sign(z) = sign(Re z) + j sign(Im z). Then Re(sign(z) z) = |Re(z)| - |Im(z)|, which is negative whenever the imaginary part is larger in magnitude. Example: z = 1 + 3j gives Re(sign(z) z) = -2. Both real and imaginary parts can be negative. So the constraints do not follow from the product being nonnegative, even in the noiseless case. The majority-vote oversampling in Section IV does not repair this; it only changes the measurement vector, and the constraints still do not derive from any noise model. This is a load-bearing mathematical error, not a missing proof or an awkward heuristic.\n\nThe paper also lacks supporting evidence. There is no derivation of the two-level Toeplitz SDP or the reweighting scheme, just citations to prior work. The only simulation (Fig. 1) compares BiANM only against ReBiANM and their oversampled variants, with no baseline from grid-based one-bit CS methods or any existing channel estimator. No error bars, no complexity analysis, no code or data. The claim of improved accuracy is therefore unsupported.\n\nI would not send this to peer review as is. A referee would have to reformulate the core constraints before the method could be evaluated. The paper could be useful as a cautionary example in a reading group on one-bit compressed sensing, but it does not deserve referee time in its current form.","headline":"The proposed sign-consistency constraints do not follow from the paper's own one-bit model, and the error is central enough to sink the recovery claim.","tokens_in":6887,"tokens_out":3168,"would_cite":false,"duration_ms":32597,"reading_group":"maybe","serious_thinker":"no","would_accept_peer_review":false},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":[],"pacs":[],"model":"deepseek-v4-flash","headline":"The paper proposes a gridless atomic-norm method for estimating sparse mmWave MIMO-OFDM channels from one-bit quantized measurements.","keywords":["atomic norm minimization","one-bit quantization","millimeter wave MIMO","OFDM channel estimation","gridless compressive sensing","reweighted atomic norm minimization","massive MIMO","sparse channel estimation"],"falsifier":"A concrete test is to take a fixed sparse channel, generate noiseless one-bit signs, then deliberately flip a known fraction of them (or add noise until that fraction flips), and run BiANM and ReBiANM against the true normalized channel: if the normalized error jumps abruptly at any nonzero flip fraction, or if removing the majority-vote oversampling destroys low-SNR recovery, the sign-consistency assumption is doing load-bearing work that the paper does not justify.","tokens_in":5886,"feed_emoji":"📡","tokens_out":13637,"duration_ms":122457,"temperature":0.7,"pith_summary":"One-bit analog-to-digital converters are the cheapest and least power-hungry way to digitize the very wide bandwidths used in millimeter-wave communication, but a one-bit receiver discards all magnitude information, and previous compressive-sensing estimators put the channel's angles and delays on a fixed grid, so a channel that falls between grid points is estimated with bias. This paper proposes a gridless estimator, Binary Atomic Norm Minimization (BiANM), and a reweighted version, ReBiANM, that recover the normalized sparse mmWave MIMO-OFDM channel directly from one-bit measurements without any grid. The central claim is that atomic-norm minimization, formulated as a semidefinite program, can enforce the sign constraints imposed by one-bit quantization while exploiting the continuous angle-delay sparsity of the channel, and that reweighting makes the estimate more accurate. If correct, the method gives low-power one-bit receivers a channel-estimation path that avoids grid mismatch while keeping the estimation problem convex.","feed_headline":"Gridless atomic norm reads mmWave channels from one-bit data","feed_subtitle":"New estimators use atomic norm minimization to recover sparse channels from sign-only measurements.","key_machinery":"The load-bearing object is the atomic norm over the atom set $\\mathcal{A} = \\{\\mathbf{a}(\\omega) : \\omega \\in [0,1]^2\\}$, where $\\mathbf{a}(\\omega)$ is the Kronecker product of an angle steering vector and a delay Vandermonde vector; the atomic norm is the convex hull of these atoms and is evaluated by a semidefinite program involving a two-level Hermitian Toeplitz matrix $T_{\\mathrm{2D}}(\\mathbf{u})$. BiANM minimizes this norm subject to the sign-consistency inequalities $\\Re(\\mathbf{R}'\\mathbf{\\Phi}\\mathbf{h})\\ge 0$ and $\\Im(\\mathbf{R}'\\mathbf{\\Phi}\\mathbf{h})\\ge 0$ elementwise, plus the unit-norm constraint $\\|\\Re(\\mathbf{\\Phi}\\mathbf{h})\\|^2 + \\|\\Im(\\mathbf{\\Phi}\\mathbf{h})\\|^2 = 1$ that prevents the zero solution. ReBiANM changes the objective to $\\operatorname{trace}(\\mathbf{\\Theta}_j T_{\\mathrm{2D}}(\\mathbf{u}))$ with $\\mathbf{\\Theta}_j$ updated from the previous iterate, which lets the solver move between $\\ell_0$-style sparsity and $\\ell_1$-style convexity. The two-level Toeplitz Vandermonde decomposition is what turns continuous parameter recovery into a finite-dimensional semidefinite program.","core_discovery":"The paper's central claim is that one-bit channel estimation can be posed as a gridless convex optimization: replace the non-convex atomic $\\ell_0$ norm by its convex envelope, the atomic norm, and add elementwise sign-consistency constraints that require each quantized measurement to agree with the sign of the corresponding noiseless linear measurement. In this formulation, named BiANM, the channel is estimated as $\\hat{\\mathbf{h}}$ from $\\mathbf{r} = \\operatorname{sign}(\\mathbf{\\Phi}\\mathbf{h}+\\mathbf{n})$ with $\\mathbf{\\Phi} = (\\mathbf{X}^T\\otimes \\mathbf{I}_M)$; because the atoms are continuous in angle and delay, no grid is introduced. ReBiANM iterates the same semidefinite program with a weight $\\mathbf{\\Theta}_j$ built from the previous solution, interpolating between $\\ell_0$-like sparsity enhancement and the convex $\\ell_1$-like atomic norm. The paper states, and supports by Monte-Carlo simulation, that both methods estimate the channel normalized to unit norm, with ReBiANM improving accuracy.","pith_inferences":["Editorial inference: the hard sign constraints could be replaced by a probabilistic sign-flip model to make the estimator robust to noisy measurements; the paper's majority-vote oversampling is an ad hoc step toward this but no probabilistic model is given.","Editorial inference: the two-level Toeplitz semidefinite-program structure is not specific to one-bit quantization, so a similar gridless formulation could in principle handle other quantized or nonlinear measurement models once the constraints are adapted.","Editorial inference: because the output is only the normalized channel, a real link would need a separate amplitude-recovery stage to obtain channel gains; the paper leaves that open.","Editorial inference: a direct comparison with a grid-based one-bit compressive sensing method at matched complexity would separate the benefit of going gridless from the benefit of reweighting, since the paper's simulations compare only gridless variants."],"forward_implications":["Grid mismatch is removed as a source of error: angles and delays are recovered on the continuum rather than from a finite dictionary, so a path falling between grid points no longer biases the estimate.","One-bit receivers can support channel estimation at low power, because the estimator needs only the sign of each measurement instead of high-resolution samples.","ReBiANM is claimed to give more accurate normalized channel estimates than plain BiANM, with the paper's simulations showing the largest gains at low SNR where noise flips signs.","Because the optimization is a semidefinite program, the method has a tractable convex solver despite the NP-hardness of the original atomic $\\ell_0$ problem.","The recovered channel is normalized to unit norm, so tasks that depend on channel direction, such as beam alignment, can proceed without amplitude recovery."],"supporting_citations":[{"why":"supplies the sparse wideband mmWave MIMO channel model with angle-delay structure used in the system description","marker":"[18]"},{"why":"introduces gridless compressive sensing for line spectral estimation from one-bit measurements, the direct precursor of BiANM","marker":"[19]"},{"why":"establishes the convex-geometry view of atomic norms that justifies replacing the non-convex atomic zero norm by the convex hull","marker":"[20]"},{"why":"shows exact joint sparse frequency recovery via optimization, grounding the atomic-norm relaxation for continuous parameters","marker":"[21]"},{"why":"gives the semidefinite-program formulation of atomic norm minimization for off-grid compressed sensing, used in equation (10)","marker":"[22]"},{"why":"provides the two-level Toeplitz Vandermonde decomposition that lets the 2D atomic norm be computed with a semidefinite program","marker":"[23]"},{"why":"introduces reweighted atomic norm minimization for enhanced sparsity and resolution, which ReBiANM adapts to one-bit measurements","marker":"[24]"}],"fun_headline_variants":["Gridless atomic norm unlocks one-bit channel estimation for mmWave","No grid needed: atomic norm recovers one-bit mmWave channels","One-bit quantization meets gridless atomic norm for channel estimation","BiANM and ReBiANM: gridless one-bit channel recovery","Sign-only measurements yield gridless mmWave channel estimates"],"cache_read_input_tokens":3200,"weakest_assumption_plain":"The method assumes the recorded one-bit signs are consistent with the true noiseless sign pattern, so the sign-consistency constraints in the optimization remain feasible, even though the measurement model includes noise.","fun_headline_variants_meta":{"raw":{"variants":["Gridless atomic norm unlocks one-bit channel estimation for mmWave","No grid needed: atomic norm recovers one-bit mmWave channels","One-bit quantization meets gridless atomic norm for channel estimation","BiANM and ReBiANM: gridless one-bit channel recovery","Sign-only measurements yield gridless mmWave channel estimates"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.00054,"raw_usage":{"total_tokens":2541,"prompt_tokens":845,"completion_tokens":1696,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":461,"completion_tokens_details":{"reasoning_tokens":1609}},"tokens_in":461,"tokens_out":1696,"duration_ms":12952,"temperature":1.0,"reasoning_tokens":1609,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-14T12:36:57.542201+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"A concrete test is to take a fixed sparse channel, generate noiseless one-bit signs, then deliberately flip a known fraction of them (or add noise until that fraction flips), and run BiANM and ReBiANM against the true normalized channel: if the normalized error jumps abruptly at any nonzero flip fraction, or if removing the majority-vote oversampling destroys low-SNR recovery, the sign-consistency assumption is doing load-bearing work that the paper does not justify.","supporting_citations":[{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"supplies the sparse wideband mmWave MIMO channel model with angle-delay structure used in the system description"},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"introduces gridless compressive sensing for line spectral estimation from one-bit measurements, the direct precursor of BiANM"},{"cited_title":"Chandrasekaran, B","cited_arxiv_id":null,"evidence_quote":"establishes the convex-geometry view of atomic norms that justifies replacing the non-convex atomic zero norm by the convex hull"},{"cited_title":"Exact Joint Sparse Frequency Recovery via Optimization Methods","cited_arxiv_id":"1405.6585","evidence_quote":"shows exact joint sparse frequency recovery via optimization, grounding the atomic-norm relaxation for continuous parameters"},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"gives the semidefinite-program formulation of atomic norm minimization for off-grid compressed sensing, used in equation (10)"},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"provides the two-level Toeplitz Vandermonde decomposition that lets the 2D atomic norm be computed with a semidefinite program"},{"cited_title":"Yang and L","cited_arxiv_id":null,"evidence_quote":"introduces reweighted atomic norm minimization for enhanced sparsity and resolution, which ReBiANM adapts to one-bit measurements"}],"review_version":1}