Theoretical Analysis for Extended Target Recovery in Randomized Stepped Frequency Radars

Lei Wang; Tianyao Huang; Yimin Liu

REVIEW 3 major objections 3 minor 1 cited by

Theoretical Analysis for Extended Target Recovery in Randomized Stepped Frequency Radars

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

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

Pith's one-line read This paper proves that randomized stepped frequency radar can exactly recover extended-target range-Doppler information by block-sparse $\ell_{2,1}$ minimization whenever the number of targets is $O(N/(M\log MN))$, improving the known…

desk verdict Solid block-coherence analysis for RSFR, but Theorem 3's proof has a scaling slip and the headline guarantee holds only for ξ_n=1, narrower than the wideband framing suggests. read the letter →

arxiv 1908.02929 v1 pith:EILAXQNS submitted 2019-08-08 eess.SP

Lei Wang , Tianyao Huang , Yimin Liu This is my paper · ORCID

classification eess.SP

keywords randomizedsteppedfrequencyradarblocksparserecoveryextendedtargetrange-Dopplerreconstructioncoherencespectralnormmixedl21minimizationagile

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

An extended target—one that spans several high-resolution range cells—shows up in a randomized stepped frequency radar's reconstruction as a block of nonzero entries sharing a single Doppler velocity. This paper proves that the radar can use that block structure: under a mild statistical model for the target scene, mixed $\ell_{2,1}$ minimization recovers the complete range-Doppler vector exactly with probability at least $1-\epsilon$ whenever the number of extended targets is $K=O(N/(M\log MN))$, or equivalently $KM=O(N/\log MN)$ scatterers. That improves on the earlier non-block sparse-recovery bound $KM=O(\sqrt{N}/\log MN)$ for the same randomized frequency model. The proof reduces the problem to showing the observation matrix satisfies a block-incoherence condition, and the paper reports simulations and field experiments in which block-sparse algorithms reconstruct extended targets with far fewer spurious peaks than ordinary sparse recovery.

What carries the argument

The load-bearing object is the Gram matrix $X=\Psi^H\Psi$ of the randomized stepped frequency radar. Each block $X_{q_1,q_2}$ is circulant, and the full matrix is block circulant with circulant blocks, so singular values are magnitudes of explicit eigenvalues: $\lambda^{\Delta q}_m = \frac{M}{N}\sum_{n=0}^{N-1}\zeta_{n,m}e^{j2\pi\Delta q n/N}$, where $\zeta_{n,m}$ is Bernoulli with parameter $1/M$. This identity converts the two coherence constants $\mu_I$ (how far diagonal blocks are from identity) and $\mu_B$ (the largest norm between distinct velocity blocks), together with the spectral norm, into quantities controlled by the random frequency code. A concentration bound on such sums gives the probability bounds on $\mu_I$ and $\mu_B$, while a direct calculation gives $\|\Psi\|_s=\sqrt{M}$; substituting these into inequality (20) produces the recovery guarantee.

What would settle it

For a wideband RSFR with, say, $B/f_c=0.1$, compute the empirical inter-block coherence and spectral norm of the full observation matrix in (11); if either exceeds the bounds from (40) and $\|\Psi\|_s=\sqrt{M}$, or if the exact-recovery rate for a block sparsity at the level (46) falls below $1-\epsilon$, the theorem's stated regime has been left.

Watch

Extended reading notes

Core claim

The central claim is Theorem 3: for any constant $\epsilon>0$ and sufficiently large $N$, the block-incoherence inequality (20) holds with probability at least $1-\epsilon$ when $K\le N(1/8-\delta_1-\delta_2)^2 / (81 M\log MN (1+2\delta_2/3))$, with $\delta_1,\delta_2$ tending to zero. Combined with the paper's inherited average-case recovery theorem, this means mixed $\ell_{2,1}$ minimization reconstructs the exact $K$-block-sparse range-Doppler vector with high probability, and the total number of recoverable scatterers is $KM=O(N/\log MN)$. The route is the structure of the observation matrix: each Gram block $\Psi^H_{q_1}\Psi_{q_2}$ is circulant, the full Gram matrix is block circulant with circulant blocks, and its eigenvalues are built from Bernoulli variables indexed by the random frequency code. From those, the paper derives tail bounds on the intra-block coherence $\mu_I$ and inter-block coherence $\mu_B$, and proves $\|\Psi\|_s=\sqrt{M}$. This extends the earlier single-scatterer analysis of frequency-agile radar to extended targets.

Load-bearing premise

The proof sets the Doppler phase to be independent of carrier frequency ($\xi_n=1$), which is accurate only when the relative bandwidth $B/f_c$ is negligible; when that fails, the coherence bounds and hence the recovery guarantee are not proven.

Editorial extensions

If this is right

The bound is quantitative: with $N$ pulses and $M$ frequency points, the radar can guarantee exact recovery of roughly $N/(M\log MN)$ extended targets with probability at least $1-\epsilon$.
The block-sparse bound admits up to about $\sqrt{N}$ times more scatterers than the non-block sparse bound for the same randomized frequency model.
In heavy clutter, block-sparse algorithms recover whole target profiles rather than isolated scatterers, which suppresses the spurious peaks seen with ordinary sparse recovery in both simulations and field data.
The key quantities depend only on the radar parameters $N$, $M$ and the independent uniform frequency code, so the result applies to any RSFR configuration with negligible relative bandwidth.

Reading between the lines

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

A natural next step is a wideband theorem with $\xi_n\ne 1$; the authors' own simulations show $\mu_B$ and $\|\Psi\|_s$ drift when the relative bandwidth is large, so the current guarantee should be read as a small-relative-bandwidth result.
The circulant-block structure comes from the random frequency code, not from the target model, so the same coherence analysis could be reused for other frequency-hop sensing matrices with block structure.
Proving a restricted isometry property for the RSFR matrix would replace the average-case statistical prior with a worst-case guarantee, making the recovery statement hold for every block-sparse vector rather than for typical ones.

Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

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

Desk Editor's Note

read the letter

Dear colleague,

The honest headline: this is a useful, mostly clean analysis of block-sparse recovery for randomized stepped frequency radar, but the main theorem is proved for a narrower regime than the paper advertises, and the proof of Theorem 3 has a scaling slip that needs fixing.

What's new and good: prior work [12] analyzed RSFR with ordinary sparsity; this paper identifies the block structure of the observation matrix, shows the off-diagonal blocks are circulant, computes the deterministic spectral norm ||Ψ||_s = √M, and gives tail bounds for the block coherences. Those calculations are real and, as far as I can tell, correct. The resulting sample-complexity bound K = O(N/(M log MN)) (equivalently KM = O(N/log MN) scatterers) is a genuine improvement over the earlier O(√N/log MN) ordinary-sparsity bound. The paper also uses the external average-case theorem of Bajwa et al. as a black box and fits no constants, so there is no circularity problem.

Soft spots. First, the proof of Theorem 3 in Appendix F does not follow from condition (20). The displayed algebra uses a √N scaling that matches a condition with the first term divided by √N, not by N as in (20). The final bound may still be salvageable, but as written the derivation doesn't connect to the theorem statement. That is a load-bearing gap, and a referee should ask for a corrected proof. Second, the entire analysis sets ξ_n = 1, i.e., it ignores the variation of Doppler phase across carrier frequencies. The authors do disclose this in Section IV and note it holds only when B/f_c is negligible. But the abstract and conclusion present KM = O(N/log MN) as a guarantee for wideband RSFR, and Section V's own figures show µ_B and ||Ψ||_s shift when ξ_n ≠ 1. So the theorem's guarantee does not cover the advertised system. That is a substantive overstatement, though the authors at least flag the caveat internally. The field experiments are nice but they do not test the theorem's assumptions; they show the algorithms work, which is a separate claim.

Verdict: the paper deserves a serious referee. With the Appendix F proof corrected and the claims scoped to the ξ_n = 1 / high-f_c regime (or extended), it would be a solid contribution. As it stands, the central result is plausible and mostly well derived, but the advertised headline is narrower than proven.

Referee Report

3 major / 3 minor

Summary. The paper studies block-sparse recovery of range-Doppler (range-velocity) profiles in randomized stepped frequency radar (RSFR). An extended target is modeled as a cluster of scatterers sharing one velocity, which yields a block-sparse vector x after discretization, as in (8). The observation matrix Ψ is given in (11); under the assumption ξ_n=1 (negligible relative bandwidth), the authors derive structural facts about Ψ: the blocks of the Gram matrix are circulant (Lemma 1), the eigenvalues have the closed form (26) and (28), the block-coherence quantities have the tail bounds (39) and (40), and the spectral norm is exactly √M (Corollary 1). Combining these with the average-case recovery theorem of [25] (Theorem 1), they claim exact recovery with high probability for block sparsity K=O(N/(M logMN)), i.e., KM=O(N/logMN) scatterers, and compare this with the non-block bound KM=O(√N/logMN) of [12]. The paper also presents simulations and field experiments comparing block and non-block sparse recovery algorithms. The main claims are the coherence analysis, the deterministic spectral-norm result, and the parametric recovery guarantee.

Significance. If the proof of Theorem 3 is corrected and the scope of the ξ_n=1 assumption is made explicit, this would be a genuinely useful contribution: it appears to be the first explicit block-coherence analysis for RSFR observation matrices, with a closed-form spectral norm √M, explicit tail bounds for intra- and inter-block coherence, and a first-principles derivation that does not fit free parameters to data. The structural results—circulant block Gram matrices, closed-form eigenvalues, and block-circulant full Gram structure—are clean and reusable for future analyses. The field experiments provide a practical demonstration of block-sparse methods for extended targets. However, the current text overstates the regime of validity of the guarantee: Theorem 3 is proved only for ξ_n=1, while the abstract and conclusion present KM=O(N/logMN) as a wideband RSFR guarantee.

major comments (3)

[Section IV; Abstract; Conclusion] The recovery guarantee in Theorem 3 is proved only under the assumption ξ_n=1, introduced in (21), which the paper itself states is valid only when the relative bandwidth B/f_c is negligible. Yet the abstract, introduction, and conclusion present KM=O(N/logMN) as a guaranteed recovery scale for 'wideband RSFR' without this qualification. Section V-A, especially Figs. 2 and 3, shows that when ξ_n≠1 (RB=0.01, 0.1) the CCDFs of μB and of ‖Ψ‖s shift, so the theoretical bounds (39) and (40) and the deterministic spectral-norm result (45) do not apply to that regime. The field experiments also use ξ_n≠1 and therefore do not validate the theorem's assumptions. The central claim must either be explicitly scoped to the narrowband/high-f_c regime or extended to ξ_n≠1; as written, the abstract overstates what is proved.
[Appendix F, Eq. (64)] Equation (64) does not follow from the displayed condition (20). With t=√(KM/N) and ‖Ψ‖s=√M, the left-hand side of (20) before rearrangement is 2t² + 17t√(logMN/N)(1+μI) + 48μB logMN + 3μI, so completing the square gives b=(17/4)√(logMN/N)(1+μI), not b=(17/4)√(logMN)(1+μI) as printed. As printed, (64) is a much stronger sufficient condition rather than a rewrite, and this is not justified by the algebra. The proof of Theorem 3 needs to be corrected: either derive (64) correctly from (20), or state explicitly that (64) is used only as a sufficient condition and verify the subsequent constants under that interpretation.
[Theorem 3, Eq. (46)] The constant in (46) appears inconsistent with the derivation in Appendix F. Substituting the definitions of c1 and c2 into (66) and squaring yields a denominator of 81M logMN (1+2δ2/3)^2, not 81M logMN (1+2δ2/3) as printed. As stated, (46) is stronger than what the proof establishes. In addition, the definitions of δ1 and δ2 contain ambiguous parentheses around the expression 2√logMN−logϵ; this should be displayed as 2√(logMN−logϵ)+1 if that is the intended expression.

minor comments (3)

[Throughout] There are numerous typographical errors that should be corrected: 'repectively' (Introduction), 'the the mixed' (Section V-A), 'amounted' for 'mounted' (Section V-B2), 'resuls' for 'results' (Section V-B1), 'validness' for 'validity' (Section V-B1), and 'HHR' for 'HRR'.
[Introduction and Section IV-C] The text uses K interchangeably as the 'number of extended targets' and as the number of nonzero blocks, but K in the model is the number of nonzero velocity blocks; two targets with the same velocity occupy the same block. This should be stated explicitly to avoid overcounting.
[Section V-A, Fig. 5] The figure captions do not specify the color scale for the hit-rate maps; please identify the color axis or state that the maps are normalized to the maximum hit rate.

Circularity Check

0 steps flagged · score 0.0 of 10

No significant circularity: Theorem 3 rests on an external condition from [25] and self-contained coherence bounds; the xi_n=1 restriction narrows the theorem's regime but does not make the derivation circular.

full rationale

The paper's central claim, Theorem 3, is derived by combining the external block-incoherence condition of [25] (Theorem 1) with self-contained probabilistic bounds on the block coherence and spectral norm of the RSFR observation matrix. The bounds (39), (40), and (45) are obtained from the random code statistics and the block-circulant structure of the Gram matrix, not from fitting or from the recovery result itself. The only self-citations, [1] and [12], are respectively a conference version of the same work and a prior sparse-recovery analysis used for comparison; neither supplies a load-bearing premise. The assumption xi_n=1 in Section IV is an explicitly stated modeling restriction whose failure is acknowledged and even demonstrated in Section V, so it narrows the theorem's valid regime rather than smuggling in the conclusion. No parameter is fitted to data and no 'prediction' is a renamed input. Accordingly, the derivation chain is self-contained in the relevant sense, and the circularity score is 0.

Assumptions & free parameters 0 free parameters · 8 assumptions · 0 invented entities

The paper introduces no new entities and fits no constants. Its guarantee rests on a standard external block-sparse recovery theorem, statistical assumptions on target scenes (M1-M3), and the xi_n = 1 approximation. The mismatch between Eq. (20) and Appendix F means the theorem is not actually derived as stated.

assumptions (8)

domain assumption The random frequency codes Cn are i.i.d. uniformly distributed over {0,...,M-1}.
This is the source of randomness in all probability statements; it enters in Section II-A and is used throughout the coherence analysis.
domain assumption Stop-and-go model: target delay is approximately constant over each pulse.
Used in Section II-B to write the received echo per pulse as a point delay with a fixed range and velocity.
domain assumption All scatterers lie exactly on the discretization grid (p/M, q/N).
Used in Section II-C to formulate y = Psi x without off-grid basis mismatch.
domain assumption Average-case statistical model M1-M3 from [25]: block support is uniform, entries have zero median, and nonzero blocks have independent directions.
Inherited from [25] in Section III-B; required by Theorem 1 for the average-case recovery guarantee.
domain assumption xi_n = 1, i.e., the relative bandwidth B/fc is negligible.
Section IV simplifies the observation matrix to (21). The authors acknowledge that this does not hold for large synthetic bandwidth unless fc is sufficiently high.
standard math Theorem 1 of [25], the block incoherence condition (20).
The paper reproduces this external theorem without proof and uses it as the core sufficient condition for block sparse recovery.
standard math Circulant matrices are diagonalized by the discrete Fourier transform.
Used in Lemmas 1-2 and Appendices A-B to obtain closed-form eigenvalues of the block products.
standard math Bernstein inequality for sums of bounded independent random variables.
Used in Appendix C to derive tail bounds on the singular values and hence on the block coherence.

how reviews work

0 comments

Cite this review

Pith. "Pith review of Theoretical Analysis for Extended Target Recovery in Randomized Stepped Frequency Radars." pith.science (2026). https://pith.science/paper/EILAXQNS

@misc{pith2026190802929,
  author       = {Pith},
  title        = {Pith review of: Theoretical Analysis for Extended Target Recovery in Randomized Stepped Frequency Radars},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/EILAXQNS}},
  note         = {Machine review of arXiv:1908.02929}
}

read the original abstract

Randomized Stepped Frequency Radar (RSFR) is very attractive for tasks under complex electromagnetic environment. Due to the synthetic high range resolution in RSRFs, a target usually occupies a series of range cells and is called an extended target. To reconstruct the range-Doppler information in a RSFR, previous studies based on sparse recovery mainly exploit the sparsity of the target scene but do not adequately address the extended-target characteristics, which exist in many practical applications. Block sparsity, which combines the sparsity and the target extension, better characterizes a priori knowledge of the target scene in a wideband RSFR. This paper studies the RSFR range-Doppler reconstruction problem using block sparse recovery. Particularly, we theoretically analyze the block coherence and spectral norm of the observation matrix in RSFR and build a bound on the parameters of the radar, under which the exact recovery of the range-Doppler information is guaranteed. Both simulation and field experiment results demonstrate the superiority of the block sparse recovery over conventional sparse recovery in RSFRs.

Figures

Figures reproduced from arXiv: 1908.02929 by the authors.

**Figure 2.** CCDFs of µB with N = 32 and M = 4. x 1.6 1.8 2 2.2 2.4 2.6 2.8 3 P r(k*ks > x) 0 0.1 0.2 0.3 0.4 0.5 0.6 0.7 0.8 0.9 1 RB = 0 RB = 0.01 RB = 0.1 [PITH_FULL_IMAGE:figures/full_fig_p008_2.png] view at source ↗

**Figure 3.** CCDFs of kΨks with N = 32 and M = 4. In the next two experiments, we verify the robustness of block sparse recovery algorithms and their superiority in comparison with conventional sparse recovery algorithms. The RSFR works with the parameters as follows: fc = 9GHz, Tr = 20µs, ∆f = 30MHz, M = 8 and N = 128. Multiple extended targets are simulated. And each one consists of Pk = 8 scatterers distributed in cluster alo… view at source ↗

Figures from the paper (3 more)

**Figure 6.** Figure 6: The reconstructed air targets using different methods. [PITH_FULL_IMAGE:figures/full_fig_p009_6.png]

**Figure 7.** Figure 7: The reconstructed surface target and clutter using different methods. [PITH_FULL_IMAGE:figures/full_fig_p010_7.png]

**Figure 8.** Figure 8: The photograph of the surface target scene. [PITH_FULL_IMAGE:figures/full_fig_p010_8.png]

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

Joint Radar-Communications Strategies for Autonomous Vehicles
cs.IT 2019-09 accept novelty 3.0 of 10

A survey that classifies joint radar-communications designs for autonomous vehicles into four strategy families and analyzes their trade-offs.

Reference graph

Works this paper leans on

33 extracted references · 28 canonical work pages · cited by 1 Pith paper

[12]

Analysis of frequency agile radar via compressed sensing,

T. Huang, Y . Liu, X. Xu, Y . C. Eldar, and X. Wang, “Analysis of frequency agile radar via compressed sensing,” IEEE Trans. Signal Process., vol. 66, no. 23, pp. 6228–6240, Dec 2018

2018
[25]

Conditioning of random block subdictionaries with applications to block-sparse recovery and regression,

W. U. Bajwa, M. F. Duarte, and R. Calderbank, “Conditioning of random block subdictionaries with applications to block-sparse recovery and regression,” IEEE Trans. Inf. Theory , vol. 61, no. 7, pp. 4060–4079, July 2015

work page 2015
[1]

Theoretical analysis for extended target recovery using RSFRs,

L. Wang, T. Huang, Y . Liu, and H. Tan, “Theoretical analysis for extended target recovery using RSFRs,” in 2019 IEEE Int. Conf. Signal, Inf. Data Process. , Dec 2019

work page 2019
[2]

Analysis of random step frequency radar and comparison with experiments,

S. R. J. Axelsson, “Analysis of random step frequency radar and comparison with experiments,” IEEE Trans. Geosci. Remote Sens. , vol. 45, no. 4, pp. 890–904, April 2007

work page 2007
[3]

Analysis of ultra wide band noise radar with randomized stepped frequency,

——, “Analysis of ultra wide band noise radar with randomized stepped frequency,” in 2006 Int. Radar Symposium , May 2006, pp. 1–4

work page 2006
[4]

Randomized stepped frequency ISAR imaging,

T. Huang, Y . Liu, G. Li, and X. Wang, “Randomized stepped frequency ISAR imaging,” in 2012 IEEE Radar Conf. , May 2012, pp. 0553–0557

work page 2012
[5]

A novel method of translational motion com- pensation for hopped-frequency ISAR imaging,

Z. Liu and S. Zhang, “A novel method of translational motion com- pensation for hopped-frequency ISAR imaging,” in Record of the IEEE 2000 Int. Radar Conf. , 2000, pp. 255–260

work page 2000
[6]

Random- frequency SAR imaging based on compressed sensing,

J. Yang, J. Thompson, X. Huang, T. Jin, and Z. Zhou, “Random- frequency SAR imaging based on compressed sensing,” IEEE Trans. Geosci. Remote Sens. , vol. 51, no. 2, pp. 983–994, Feb 2013

work page 2013

Show all 33 references

[7]

Phase compensation and image autofocusing for randomized stepped frequency ISAR,

L. Wang, T. Huang, and Y . Liu, “Phase compensation and image autofocusing for randomized stepped frequency ISAR,” IEEE Sensors J., vol. 19, no. 10, pp. 3784–3796, 2019

2019
[8]

Micro-motion parameters estimation using randomized stepped frequency radar,

C. Zhao, Y . Liu, T. Huang, L. Wang, and H. Tan, “Micro-motion parameters estimation using randomized stepped frequency radar,” in 2019 IEEE Radar Conf. , April 2019

2019
[9]

Cognitive random stepped frequency radar with sparse recovery,

T. Huang, Y . Liu, H. Meng, and X. Wang, “Cognitive random stepped frequency radar with sparse recovery,” IEEE Trans. on Aerosp. Electron. Syst., vol. 50, no. 2, pp. 858–870, April 2014

2014
[10]

Efﬁcient range-Doppler processing for random stepped frequency radar in automotive applications,

A. Al-Hourani, R. J. Evans, B. Moran, S. Kandeepan, and U. Parampalli, “Efﬁcient range-Doppler processing for random stepped frequency radar in automotive applications,” in2017 IEEE 85th Veh. Technol. Conf., June 2017, pp. 1–7

2017
[11]

Range-velocity estimation of multiple targets in randomised stepped-frequency radar,

Y . Liu, H. Meng, G. Li, and X. Wang, “Range-velocity estimation of multiple targets in randomised stepped-frequency radar,” Electron. Lett., vol. 44, no. 17, pp. 1032–1034, Aug 2008

2008
[13]

Randomized step frequency radar with adaptive compressed sensing,

T. Huang, Y . Liu, H. Meng, and X. Wang, “Randomized step frequency radar with adaptive compressed sensing,” in 2011 IEEE Radar Conf. , May 2011, pp. 411–414

2011
[14]

Adaptive detection of range distributed targets,

K. Gerlach and M. J. Steiner, “Adaptive detection of range distributed targets,” IEEE Trans. Signal Process. , vol. 47, no. 7, pp. 1844–1851, July 1999

1999
[15]

Uncertainty relations for shift-invariant analog signals,

Y . C. Eldar, “Uncertainty relations for shift-invariant analog signals,” IEEE Trans. Inf. Theory , vol. 55, no. 12, pp. 5742–5757, Dec 2009

2009
[16]

Robust face recognition via sparse representation,

J. Wright, A. Y . Yang, A. Ganesh, S. S. Sastry, and Y . Ma, “Robust face recognition via sparse representation,” IEEE Trans. Pattern Anal. Mach. Intell., vol. 31, no. 2, pp. 210–227, 2008

2008
[17]

Block sparse representation and suppression of narrow-band interference signals for quadrature compressive sampling radar,

C. Liu, S. Chen, F. Xi, and Z. Liu, “Block sparse representation and suppression of narrow-band interference signals for quadrature compressive sampling radar,” Signal Process. , vol. 150, pp. 135–144, 2018

2018
[18]

Theoretical and empirical results for recovery from multiple measurements,

E. Van Den Berg and M. P. Friedlander, “Theoretical and empirical results for recovery from multiple measurements,” IEEE Trans. Inf. Theory, vol. 56, no. 5, pp. 2516–2527, 2010

2010
[19]

Model selection and estimation in regression with grouped variables,

M. Yuan and Y . Lin, “Model selection and estimation in regression with grouped variables,” J. Roy. Stat. Soc. B, , vol. 68, pp. 49–67, 2006

2006
[20]

Block-sparse signals: Un- certainty relations and efﬁcient recovery,

Y . C. Eldar, P. Kuppinger, and H. Bolcskei, “Block-sparse signals: Un- certainty relations and efﬁcient recovery,” IEEE Trans. Signal Process. , vol. 58, no. 6, pp. 3042–3054, 2010

2010
[21]

Robust recovery of signals from a structured union of subspaces,

Y . C. Eldar and M. Mishali, “Robust recovery of signals from a structured union of subspaces,” IEEE Trans. Inf. Theory, vol. 55, no. 11, pp. 5302–5316, Nov 2009

2009
[22]

Model-based compressive sensing,

R. G. Baraniuk, V . Cevher, M. F. Duarte, and C. Hegde, “Model-based compressive sensing,” IEEE Trans. Inf. Theory, vol. 56, no. 4, pp. 1982– 2001, April 2010

1982
[23]

Block-sparse recovery via convex optimiza- tion,

E. Elhamifar and R. Vidal, “Block-sparse recovery via convex optimiza- tion,” IEEE Trans. Signal Process. , vol. 60, no. 8, pp. 4094–4107, Aug 2012

2012
[24]

Average case analysis of multichannel sparse recovery using convex relaxation,

Y . C. Eldar and H. Rauhut, “Average case analysis of multichannel sparse recovery using convex relaxation,” IEEE Trans. Inf. Theory , vol. 56, no. 1, pp. 505–519, Jan 2010

2010
[26]

M. A. Richards, Fundamentals of radar signal processing . Tata McGraw-Hill Education, 2005

2005
[27]

Y . C. Eldar and G. Kutyniok, Compressed sensing: theory and applica- tions. Cambridge University Press, 2012

2012
[28]

A study of a class of detection waveforms having nearly ideal range-Doppler ambiguity properties,

J. P. Costas, “A study of a class of detection waveforms having nearly ideal range-Doppler ambiguity properties,” Proc. IEEE, vol. 72, no. 8, pp. 996–1009, 1984

1984
[29]

P. J. Davis, Circulant matrices, 1st ed., ser. Pure and Applied Mathe- matics. John Wiley and Sons Inc, 1979

1979
[30]

Conjugate gradient methods for toeplitz systems,

R. Chan and M. Ng, “Conjugate gradient methods for toeplitz systems,” SIAM Review, vol. 38, no. 3, pp. 427–482, 1996

1996
[31]

A variant of the Johnson-Lindenstrauss lemma for circulant matrices,

J. Vyb ´ıral, “A variant of the Johnson-Lindenstrauss lemma for circulant matrices,” J. Funct. Anal. , vol. 260, no. 4, pp. 1096 – 1105, 2011

2011
[32]

Zhang, Matrix analysis and applications

X.-D. Zhang, Matrix analysis and applications . Cambridge University Press, 2017

2017
[33]

Recovering low-rank matrices from few coefﬁcients in any basis,

D. Gross, “Recovering low-rank matrices from few coefﬁcients in any basis,” IEEE Trans. Inf. Theory , vol. 57, no. 3, pp. 1548–1566, March 2011

2011

Pith tools

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

[1] [12]

Analysis of frequency agile radar via compressed sensing,

T. Huang, Y . Liu, X. Xu, Y . C. Eldar, and X. Wang, “Analysis of frequency agile radar via compressed sensing,” IEEE Trans. Signal Process., vol. 66, no. 23, pp. 6228–6240, Dec 2018

2018

[2] [25]

Conditioning of random block subdictionaries with applications to block-sparse recovery and regression,

W. U. Bajwa, M. F. Duarte, and R. Calderbank, “Conditioning of random block subdictionaries with applications to block-sparse recovery and regression,” IEEE Trans. Inf. Theory , vol. 61, no. 7, pp. 4060–4079, July 2015

work page 2015

[3] [1]

Theoretical analysis for extended target recovery using RSFRs,

L. Wang, T. Huang, Y . Liu, and H. Tan, “Theoretical analysis for extended target recovery using RSFRs,” in 2019 IEEE Int. Conf. Signal, Inf. Data Process. , Dec 2019

work page 2019

[4] [2]

Analysis of random step frequency radar and comparison with experiments,

S. R. J. Axelsson, “Analysis of random step frequency radar and comparison with experiments,” IEEE Trans. Geosci. Remote Sens. , vol. 45, no. 4, pp. 890–904, April 2007

work page 2007

[5] [3]

Analysis of ultra wide band noise radar with randomized stepped frequency,

——, “Analysis of ultra wide band noise radar with randomized stepped frequency,” in 2006 Int. Radar Symposium , May 2006, pp. 1–4

work page 2006

[6] [4]

Randomized stepped frequency ISAR imaging,

T. Huang, Y . Liu, G. Li, and X. Wang, “Randomized stepped frequency ISAR imaging,” in 2012 IEEE Radar Conf. , May 2012, pp. 0553–0557

work page 2012

[7] [5]

A novel method of translational motion com- pensation for hopped-frequency ISAR imaging,

Z. Liu and S. Zhang, “A novel method of translational motion com- pensation for hopped-frequency ISAR imaging,” in Record of the IEEE 2000 Int. Radar Conf. , 2000, pp. 255–260

work page 2000

[8] [6]

Random- frequency SAR imaging based on compressed sensing,

J. Yang, J. Thompson, X. Huang, T. Jin, and Z. Zhou, “Random- frequency SAR imaging based on compressed sensing,” IEEE Trans. Geosci. Remote Sens. , vol. 51, no. 2, pp. 983–994, Feb 2013

work page 2013