Pith. sign in

REVIEW 4 major objections 5 minor 30 references

ISAC Super-Resolution Receivers: The Effect of Different Dictionary Matrices

T0 review · 4 major / 5 minor · reviewed 2026-08-12 · deepseek-v4-flash

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

Pith's one-line read A lifted atomic norm minimization receiver can recover radar target parameters and communication data from the same received signal, without any pilot link, provided the transmit dictionary is incoherent and L^4 ≥ C µ K T log(10KT/δ).

desk verdict A useful extension of LANM to MIMO ISAC with a coherence-based sample-complexity claim, but the main theorem is stated without proof and references the wrong problem. read the letter →

arxiv 2411.12672 v1 pith:AQV3BB4K submitted 2024-11-19 cs.IT eess.SPmath.IT

Iman Valiulahi , Christos Masouros , Athina P. Petropulu This is my paper · ORCID
classification cs.ITeess.SPmath.IT MSC 94A1290C22
keywords integratedsensingandcommunicationliftedatomicnormminimizationsemidefiniterelaxationoff-the-gridestimationdictionarycoherencejointradar-communicationsuper-resolutionMIMOradar
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

This paper proposes a receiver for integrated sensing and communication (ISAC) systems that estimates radar target parameters and decodes communication data from the same received signal, without relying on a pilot or reference link. The key move is to model the transmitted probing signals as lying in a known low-dimensional subspace spanned by a dictionary matrix D, and to write the received data as a linear map of a sparse low-rank matrix U. The paper claims a theorem: if the dictionary has coherence µ and the target parameters are separated, then with probability at least 1−δ, the condition $L^{4}$ ≥ C µ K T log(10KT/δ) guarantees exact recovery of U, and hence of both target parameters and transmitted symbols. The infinite-dimensional dual is solved by a semidefinite relaxation, and simulations with Hadamard, Fourier, and Gaussian dictionaries confirm the coherence-based sample-complexity predictions. A sympathetic reader would care because this offers a path to pilot-free, off-the-grid joint sensing and communication with a tunable cost/complexity trade-off.

What carries the argument

The central object is the lifted matrix U and its atomic-norm gauge. The received vector y is written as y = X(U), where the atoms are a(τ) v^H with τ = (θ, φ, τ, v) ranging over the 4D torus and v an arbitrary unit-norm vector; X is a linear operator that couples the dictionary D and the array responses. Recovery is performed by minimizing the atomic norm of U subject to the observation constraint. The paper's proof machinery is the dual problem (9)/(14): it constructs a dual polynomial whose norm certifies that the true U is the unique atomic-norm minimizer, and the feasibility condition for that certificate produces the $L^{4}$ sample bound. The semidefinite relaxation (15), built from Toeplitz matrices via sum-of-squares theory, converts the infinite-dimensional search into a finite convex program.

What would settle it

Construct a dictionary D with coherence µ=1 (e.g., Hadamard), draw targets satisfying the separation condition (11), and solve the SDR (15) for an instance with L just above the theorem's bound; if the recovered U differs from the true U by more than 1e-3 in relative Frobenius norm, or if the dual polynomial from (15) exceeds magnitude 1 at any off-grid point, the theorem's SDR-equivalence premise fails.

Watch

Extended reading notes

Core claim

The paper establishes a sample-complexity guarantee for blind joint radar-communication estimation in a bistatic MIMO ISAC system. It shows that when the unknown transmit waveforms xk are expressed as D hk through a known dictionary D with coherence µ (Assumption 1), and the target parameters (angle of departure, angle of arrival, delay, Doppler) are separated as in Assumption 3, the received signal y is a linear map of a lifted matrix U that is a sparse combination of rank-one atoms. Theorem 1 states that with probability at least 1−δ, the condition $L^{4}$ ≥ C µ K T log(10KT/δ) ensures U can be recovered by solving the atomic-norm minimization problem (5). Because U encodes both the target parameters and the hk, this recovery simultaneously localizes the K targets and decodes the communication symbols. The paper further proposes solving the infinite-dimensional dual via a semidefinite relaxation (15), and shows numerically that different dictionaries, with Hadamard and Fourier giving coherence µ=1, require fewer observations than a Gaussian dictionary with µ=6 log T.

Load-bearing premise

The paper assumes without proof that the semidefinite relaxation in (15) exactly represents the infinite-dimensional dual problem (14); if that relaxation is loose, the recovered matrix need not be the atomic-norm minimizer, and Theorem 1's guarantee no longer applies.

Editorial extensions

If this is right

  • With Hadamard or continuous Fourier dictionaries (µ=1), the required observation count is minimized, and the receiver can cut antennas or sampling rate while keeping the same recovery guarantee.
  • The estimator removes the need for a direct transmitter-receiver reference link, avoiding the bandwidth waste and demodulation errors that pilots introduce.
  • The same LANM formulation handles AWGN through the denoised problem (13)-(15); simulations show NMSE and SER improve with SNR across all dictionaries.
  • Choosing a dictionary controls receiver complexity: larger coherence µ increases the required L, so in the paper's experiments the Gaussian dictionary performs worst.

Reading between the lines

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

  • Beyond the paper: if the SDR duality is exact, the same lifting trick should generalize to estimating additional continuous parameters as long as the separation condition is measured in the product metric; this can be tested by extending the Toeplitz constraints in (15) to higher-order tensors.
  • The theorem's sample bound is stated for the noiseless case; for the noisy model (12)-(15) the paper gives no explicit error rate, so a natural test is to check whether NMSE decays as σ² with a constant that depends only logarithmically on K and T.
  • Because the bound depends on µ but not on the dictionary's detailed structure, deterministic low-coherence dictionaries should achieve the same guarantee; verifying this would require removing the i.i.d. assumption in Assumption 1.
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.

Referee Report

4 major / 5 minor

Summary. The manuscript proposes a lifted atomic norm minimization (LANM) receiver for a MIMO ISAC system that simultaneously estimates radar target parameters (AoD, AoA, delay, Doppler) and decodes communication symbols from the received signal without a pilot link. The transmit waveforms are assumed to lie in the range of a known dictionary matrix D, and the recovery problem is cast as atomic norm minimization over a four-dimensional parameter set; the dual problem is relaxed to an SDP. The paper states a sample-complexity theorem of the form L4 ≥ CµKT log(10KT/δ), discusses Gaussian, Hadamard, and Fourier dictionaries with different coherence parameters µ, and reports numerical NMSE/SER and phase-transition experiments. The main claimed contribution is the sample-complexity guarantee and the resulting dictionary-dependent trade-off in receiver complexity.

Significance. If the theorem and the SDR equivalence were established, the paper would be a useful contribution to the ISAC literature: it would provide an off-the-grid, pilot-free receiver with a quantitative sample-complexity bound that could be reduced by choosing low-coherence dictionaries. The paper does make a falsifiable qualitative prediction—Hadamard and Fourier dictionaries (µ=1) should outperform a Gaussian dictionary (µ=6logT)—and the simulations in Figs. 3–4 are consistent with that ordering, so the empirical section is not circular. The weakness is that the central theoretical claim is unproved, and the derivations connecting the atomic program to the implementable SDP are asserted rather than demonstrated. As it stands, the paper is an algorithmic proposal with illustrative simulations rather than a supported theoretical result.

major comments (4)
  1. [Section II, Theorem 1] Theorem 1 is the paper's only quantitative sample-complexity guarantee, but it is stated without proof and without a reference to a proof for this setting. The statement says recovery is 'through problem (5)', yet (5) is only the linear observation model y = X(U); the actual estimator is the atomic-norm program (8), whose dual is (9)/(14). No argument is given that a dual certificate exists under Assumptions 1–3, and the constant C is left unspecified. In addition, L is not defined before the theorem: the system model uses \bar L for the sampled vector length, while L is later used as the number of observations in the simulations. Since the introduction claims that the paper proves the proportionality between the number of samples and CµKT log(10KT/δ), this missing proof is a load-bearing gap, not a stylistic omission.
  2. [Section II, Eq. (15)] The conversion of the infinite-dimensional dual (14) into the SDR (15) is asserted with a reference to [29] but not derived. Exact equality between the SDP and the dual over [0,1)^4 is required for the solution of (15) to certify optimality of the atomic-norm minimizer in (8), and hence for Theorem 1 to apply to the algorithm actually implemented. The text does not specify the relaxation degrees, the dimensions of Q, or the conditions under which the sum-of-squares representation is exact for the four-dimensional atom set A in (6) coupled with the dictionary operator X. If (15) is a loose relaxation, the recovered U need not be the LANM solution, so the SDR exactness is a separate load-bearing premise.
  3. [Section III, Figs. 3–4] The numerical section does not test the theorem. It shows NMSE/SER at L=225 and phase transitions for L in [120,170] with K,T up to 7, but no experiment varies L against the predicted L4 scaling, no experiment checks the probability bound 1−δ, and the unspecified constant C makes such a check impossible. The simulations are useful for demonstrating the qualitative dictionary ordering, but they cannot compensate for the absence of a proof of Theorem 1. The phase-transition study also uses only 20 Monte Carlo trials per setting, which is a small sample for a success-rate plot.
  4. [Section II, Eq. (14)] The noisy dual program in (14) is stated as max_q ⟨q,y_w⟩_R − (σ/4)∥q∥_2 subject to ∥X*(q)∥*_A ≤ 1, but this does not follow from the constrained program (13) in the displayed form: the constraint ∥y_w−X(U)∥_2 ≤ σ^2 does not by itself produce the fixed penalty σ/4. Since the SDR (15) and all noisy simulations use this dual, the derivation should be provided or the program should be corrected. The inner product ⟨·,·⟩_R is also never defined.
minor comments (5)
  1. [Title page, author line] The affiliation line for the first author reads 'Tman Valiulahi'; this should be 'Iman Valiulahi'.
  2. [Section II, Eq. (3)] The symbol τk is overloaded: τk is the delay parameter of target k and also the four-dimensional vector [θk,φk,τk,vk]^T. The atom index (r,s,l,k,1) also uses k both as a target index and as an array index, which makes the equation hard to parse.
  3. [Section II, Eq. (16)] The optimization in (16) contains the typo 'prpr,∀r', and the matrix \tilde D_j is not defined; the role of the index j in the dictionary and the sum over j needs clarification.
  4. [Section III, Fig. 4] The caption of Fig. 4 says 'for k = 2' although the horizontal axis already varies the number of targets, and the text refers to 'Figs. 4(a), 4(a), and 4(b)' while the panels are labeled (a), (b), (c). These cross-references should be corrected.
  5. [Section II, after Eq. (15)] The sentence 'we use results from trigonometric polynomial theory [29] to propose an semidefinite relaxation' has an article error ('an semidefinite'); more substantively, the exact roles of the zero-padding and the relaxation degrees s', r', l', k' are not explained.

Circularity Check

0 steps flagged · score 0.0 of 10

No significant circularity; the main shortcoming is an unproved Theorem 1 and an asserted SDR equivalence, which are rigor gaps rather than circular reasoning.

full rationale

The central claim, Theorem 1, is stated without proof, and the paper asserts without derivation that the finite SDR (15) exactly represents the infinite-dimensional dual problem (14). These are correctness/rigor gaps, not circular reasoning: no equation in the paper defines a prediction in terms of the result it is supposed to establish. The observation model y = X(U) in (5) is the measurement equation, while the actual estimator is the atomic-norm program (8); even though Theorem 1 loosely says recovery is 'through problem (5)', this is an internal misstatement rather than a self-definitional reduction. The coherence parameters for Gaussian, Hadamard, and Fourier dictionaries are taken from distributional assumptions on the dictionary columns (Assumption 1) and standard coherence calculations, not fitted to the simulation outputs; the simulations merely confirm the predicted ordering µ=1 for Hadamard/Fourier versus µ=6 log T for Gaussian. Self-citations to earlier LANM work are used as background context, not as the load-bearing justification for Theorem 1 or the SDR relaxation. Overall, no specific circular step can be exhibited from the paper's equations or citation chain, so the appropriate finding is no significant circularity.

Assumptions & free parameters 1 free parameters · 5 assumptions · 0 invented entities

The central claim rests on three explicit modeling assumptions about the dictionary, the data vectors, and target separation, plus an unproved equivalence between the SDR and the dual problem. The paper introduces no new physical entities. The separation constant is a hand-chosen parameter, and the universal constant C in Theorem 1 is left unspecified.

free parameters (1)
  • separation constant in Assumption 3 = 10/(NtNr-1)
    The minimum separation between target parameters is set to 10/(NtNr-1) without justification. The recovery guarantee in Theorem 1 depends on this hand-chosen constant.
assumptions (5)
  • domain assumption Assumption 1: columns of D^H are iid from a population with E[d d^H] = I_T and max |d(i)|^2 ≤ μ
    The dictionary must be isotropic and incoherent. The recovery guarantee and the stated μ values for Gaussian, Hadamard, and Fourier dictionaries depend on this assumption.
  • domain assumption Assumption 2: data vectors h_k are uniformly random on the complex unit sphere
    Randomness of h_k is used for the probability statement in Theorem 1. Real QAM symbols are not uniformly distributed on the sphere, so the link between the assumption and the communication setting is not established.
  • domain assumption Assumption 3: target parameters are separated by at least 10/(NtNr-1) in the wrap-around metric
    The exact recovery guarantee requires this minimum separation, which limits the achievable resolution of the estimator.
  • ad hoc to paper The semidefinite relaxation in (15) exactly represents the dual problem (14)
    The paper states that this SDR follows from trigonometric polynomial theory but gives no proof. This is a load-bearing, unproved step in the derivation of the recovery algorithm.
  • standard math Strong duality holds between the atomic norm minimization in (8) and its dual in (9)
    The paper implicitly assumes zero duality gap for the infinite-dimensional convex program. This is standard in finite-dimensional convex optimization but requires care in the atomic norm setting.

how reviews work

0 comments
Cite this review

Pith. "Pith review of ISAC Super-Resolution Receivers: The Effect of Different Dictionary Matrices." pith.science (2026). https://pith.science/paper/AQV3BB4K

@misc{pith2026241112672,
  author       = {Pith},
  title        = {Pith review of: ISAC Super-Resolution Receivers: The Effect of Different Dictionary Matrices},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/AQV3BB4K}},
  note         = {Machine review of arXiv:2411.12672}
}
read the original abstract

This paper presents an off-the-grid estimator for ISAC systems using lifted atomic norm minimization (LANM). The main challenge in the ISAC systems is the unknown nature of both transmitted signals and radar-communication channels. We use a known dictionary to encode transmit signals and show that LANM can localize radar targets and decode communication symbols when the number of observations is proportional to the system's degrees of freedom and the coherence of the dictionary matrix. We reformulate LANM using a dual method and solve it with semidefinite relaxation (SDR) for different dictionary matrices to reduce the number of observations required at the receiver. Simulations demonstrate that the proposed LANM accurately estimates communication data and target parameters under varying complexity by selecting different dictionary matrices.

Figures

Figures reproduced from arXiv: 2411.12672 by the authors.

Figure 1
Figure 1. System model. The operators tr(·) and (·) H are trace of a matrix, hermitian of a vector, respectively. II. SYSTEM MODEL AND PROBLEM FORMULATION We consider an ISAC system with a transmitter having Nt antennas and a receiver with Nr antennas, targeting K objects, where K < Nt. The targets are located in the far field of the arrays, with uniformly spaced transmit and receive antennas, where the spacing is Nt 2fc and … view at source ↗
Figure 2
Figure 2. The absolute value of the dual polynomial is shown in the [PITH_FULL_IMAGE:figures/full_fig_p004_2.png] view at source ↗
Figure 3
Figure 3. The NMSE and SER of the proposed estimator, using [PITH_FULL_IMAGE:figures/full_fig_p004_3.png] view at source ↗
Figures from the paper (1 more)
Figure 4
Figure 4. Figure 4: The success rate of LANM versus the number of targets and the subspace dimension [PITH_FULL_IMAGE:figures/full_fig_p005_4.png]

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

30 extracted references · 22 canonical work pages

  1. [29]

    Dumitrescu, Positive trigonometric polynomials and signal processing applications

    B. Dumitrescu, Positive trigonometric polynomials and signal processing applications. Springer, 2007, vol. 103

    2007

  2. [1]

    Joint radar and communication design: Applications, state-of-the-art, and the road ahead,

    F. Liu, C. Masouros, A. P. Petropulu, H. Griffiths, and L. Hanzo, “Joint radar and communication design: Applications, state-of-the-art, and the road ahead,” IEEE Transactions on Communications , vol. 68, no. 6, pp. 3834–3862, 2020

    work page 2020

  3. [2]

    Network-level integrated sensing and communication: Interference management and bs coordina- tion using stochastic geometry,

    K. Meng, C. Masouros, G. Chen, and F. Liu, “Network-level integrated sensing and communication: Interference management and bs coordina- tion using stochastic geometry,” arXiv preprint arXiv:2311.09052, 2023

    arXiv 2023

  4. [3]

    Dual-blind deconvolution for overlaid radar-communications systems,

    E. Vargas, K. V . Mishra, R. Jacome, B. M. Sadler, and H. Arguello, “Dual-blind deconvolution for overlaid radar-communications systems,” IEEE Journal on Selected Areas in Information Theory , 2023

    work page 2023

  5. [4]

    Net-zero energy dual- functional radar-communication systems,

    I. Valiulahi, C. Masouros, and A. Salem, “Net-zero energy dual- functional radar-communication systems,” IEEE Transactions on Green Communications and Networking , vol. 7, no. 1, pp. 356–369, 2023

    2023

  6. [5]

    Robust Joint Active-Passive Beamforming Design for IRS-Assisted ISAC Systems

    M. AlaaEldin, E. Alsusa, K. G. Seddik, C. Masouros, and I. Valiulahi, “Robust joint active-passive beamforming design for irs-assisted isac systems,” arXiv preprint arXiv:2309.00978 , 2023

    work page Pith review arXiv 2023

  7. [6]

    Antenna selection for energy-efficient dual-functional radar-communication systems,

    I. Valiulahi, C. Masouros, A. Salem, and F. Liu, “Antenna selection for energy-efficient dual-functional radar-communication systems,” IEEE Wireless Communications Letters , vol. 11, no. 4, pp. 741–745, 2022

    work page 2022

  8. [7]

    Cost-efficient design of an energy-neutral uav-based mobile network,

    M. Virgili, N. Babu, M. Javidsharifi, I. Valiulahi, C. Masouros, A. J. Forsyth, T. Kerekes, and C. B. Papadias, “Cost-efficient design of an energy-neutral uav-based mobile network,” IEEE Transactions on Communications, vol. 70, no. 10, pp. 6890–6901, 2022

    work page 2022

Show all 30 references
  1. [8]

    Integrated sensing and communications: Toward dual-functional wire- less networks for 6g and beyond,

    F. Liu, Y . Cui, C. Masouros, J. Xu, T. X. Han, Y . C. Eldar, and S. Buzzi, “Integrated sensing and communications: Toward dual-functional wire- less networks for 6g and beyond,” IEEE journal on selected areas in communications, vol. 40, no. 6, pp. 1728–1767, 2022

    2022

  2. [9]

    A pencil-music algorithm for finding two-dimensional angles and polarizations using crossed dipoles,

    Y . Hua, “A pencil-music algorithm for finding two-dimensional angles and polarizations using crossed dipoles,” IEEE Transactions on Antennas and Propagation, vol. 41, no. 3, pp. 370–376, 1993

    1993

  3. [10]

    Sensing-assisted communication in vehicular networks with intelligent surface,

    K. Meng, Q. Wu, W. Chen, and D. Li, “Sensing-assisted communication in vehicular networks with intelligent surface,” IEEE Transactions on V ehicular Technology, 2023

    2023

  4. [11]

    Cooper- ative isac networks: Opportunities and challenges,

    K. Meng, C. Masouros, A. P. Petropulu, and L. Hanzo, “Cooper- ative isac networks: Opportunities and challenges,” arXiv preprint arXiv:2405.06305, 2024

    2024 arXiv

  5. [12]

    Intrapulse radar-embedded com- munications,

    S. D. Blunt, P. Yatham, and J. Stiles, “Intrapulse radar-embedded com- munications,” IEEE Transactions on Aerospace and Electronic Systems , vol. 46, no. 3, pp. 1185–1200, 2010

    2010

  6. [13]

    To- ward dual-functional radar-communication systems: Optimal waveform design,

    F. Liu, L. Zhou, C. Masouros, A. Li, W. Luo, and A. Petropulu, “To- ward dual-functional radar-communication systems: Optimal waveform design,” IEEE Transactions on Signal Processing , vol. 66, no. 16, pp. 4264–4279, 2018

    2018

  7. [14]

    Beamspace matrix completion in subarray-based sparse linear array for high-resolution automotive mimo radar,

    K. Han, M. Bauduin, and A. Bourdoux, “Beamspace matrix completion in subarray-based sparse linear array for high-resolution automotive mimo radar,” in 2024 IEEE Radar Conference (RadarConf24) . IEEE, 2024, pp. 1–6

    2024

  8. [15]

    Isac receiver design: A learning- based two-stage joint data-and-target parameter estimation,

    J. Hu, I. Valiulahi, and C. Masouros, “Isac receiver design: A learning- based two-stage joint data-and-target parameter estimation,” IEEE Wire- less Communications Letters , 2024

    2024

  9. [16]

    Multiple emitter location and signal parameter estimation,

    R. Schmidt, “Multiple emitter location and signal parameter estimation,” IEEE transactions on antennas and propagation , vol. 34, no. 3, pp. 276– 280, 1986

    1986

  10. [17]

    Two-stage esprit for unambiguous an- gle and range estimation in fda-mimo radar,

    Y . Yan, J. Cai, and W.-Q. Wang, “Two-stage esprit for unambiguous an- gle and range estimation in fda-mimo radar,” Digital Signal Processing , vol. 92, pp. 151–165, 2019

    2019

  11. [18]

    High-resolution phased-subarray mimo radar with grating lobe cancellation technique,

    K. Han and S. Hong, “High-resolution phased-subarray mimo radar with grating lobe cancellation technique,” IEEE Transactions on Microwave Theory and Techniques , vol. 70, no. 5, pp. 2775–2785, 2022

    2022

  12. [19]

    Sensitivity to basis mismatch in compressed sensing,

    Y . Chi, L. L. Scharf, A. Pezeshki, and A. R. Calderbank, “Sensitivity to basis mismatch in compressed sensing,” IEEE Transactions on Signal Processing, vol. 59, no. 5, pp. 2182–2195, 2011

    2011

  13. [20]

    Range-angle decoupling and estimation for fda-mimo radar via atomic norm minimization and accelerated proximal gradient,

    W.-G. Tang, H. Jiang, and Q. Zhang, “Range-angle decoupling and estimation for fda-mimo radar via atomic norm minimization and accelerated proximal gradient,” IEEE Signal Processing Letters , vol. 27, pp. 366–370, 2020

    2020

  14. [21]

    Robustness of two-dimensional line spectral estimation against spiky noise,

    I. Valiulahi, F. Haddadi, and A. Amini, “Robustness of two-dimensional line spectral estimation against spiky noise,” IEEE Transactions on Signal Processing, vol. 67, no. 23, pp. 5998–6008, 2019

    2019

  15. [22]

    Eliminating impulsive noise in pilot-aided ofdm channels via dual of penalized atomic norm,

    I. Valiulahi, F. Parvaresh, and A. A. Beheshti, “Eliminating impulsive noise in pilot-aided ofdm channels via dual of penalized atomic norm,” IEEE Communications Letters , vol. 23, no. 11, pp. 2059–2062, 2019

    2019

  16. [23]

    Super-resolution radar,

    R. Heckel, V . I. Morgenshtern, and M. Soltanolkotabi, “Super-resolution radar,” Information and Inference: A Journal of the IMA , vol. 5, no. 1, pp. 22–75, 2016

    2016

  17. [24]

    Super-resolution mimo radar,

    R. Heckel, “Super-resolution mimo radar,” in 2016 IEEE international symposium on information theory (ISIT) . IEEE, 2016, pp. 1416–1420

    2016

  18. [25]

    Guaranteed blind sparse spikes deconvolution via lifting and convex optimization,

    Y . Chi, “Guaranteed blind sparse spikes deconvolution via lifting and convex optimization,” IEEE Journal of Selected Topics in Signal Pro- cessing, vol. 10, no. 4, pp. 782–794, 2016

    2016

  19. [26]

    Noncoherent ofdm transmission via off-the-grid joint channel and data estimation,

    M. Bigdeli, H. Fathi, I. Valiulahi, and C. Masouros, “Noncoherent ofdm transmission via off-the-grid joint channel and data estimation,” IEEE Wireless Communications Letters , vol. 12, no. 1, pp. 99–103, 2022. 6

    2022

  20. [27]

    Mathematical theory of atomic norm de- noising in blind two-dimensional super-resolution,

    M. A. Suliman and W. Dai, “Mathematical theory of atomic norm de- noising in blind two-dimensional super-resolution,” IEEE Transactions on Signal Processing , vol. 69, pp. 1681–1696, 2021

    2021

  21. [28]

    Super-resolution delay-doppler estimation for ofdm passive radar,

    L. Zheng and X. Wang, “Super-resolution delay-doppler estimation for ofdm passive radar,” IEEE Transactions on Signal Processing , vol. 65, no. 9, pp. 2197–2210, 2017

    2017

  22. [30]

    Cvx: Matlab software for disciplined convex programming, version 2.1,

    M. Grant and S. Boyd, “Cvx: Matlab software for disciplined convex programming, version 2.1,” 2014

    2014

Pith tools

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