惯性聚合 高效追踪和阅读你感兴趣的博客、新闻、科技资讯
阅读原文 在惯性聚合中打开

推荐订阅源

Y
Y Combinator Blog
S
SegmentFault 最新的问题
WordPress大学
WordPress大学
让小产品的独立变现更简单 - ezindie.com
让小产品的独立变现更简单 - ezindie.com
美团技术团队
博客园 - 叶小钗
大猫的无限游戏
大猫的无限游戏
罗磊的独立博客
Hugging Face - Blog
Hugging Face - Blog
博客园 - 司徒正美
小众软件
小众软件
博客园 - 聂微东
阮一峰的网络日志
阮一峰的网络日志
博客园 - 三生石上(FineUI控件)
月光博客
月光博客
The Cloudflare Blog
T
Tailwind CSS Blog
博客园 - 【当耐特】
Jina AI
Jina AI
量子位
有赞技术团队
有赞技术团队
博客园 - Franky
V
Visual Studio Blog
V
V2EX

math updates on arXiv.org

Coupling-Robust Accuracy in Multiphysics Physics Informed Neural Networks via Kronecker-Preconditioned Optimization Non-normal spectral signatures of instability in neural network training dynamics Optimization of randomized neural networks for transfer operator approximation Selective Ambulance Dispatch Under Contextual Travel-Time Uncertainty LLAMA LIMA: A Living Meta-Analysis on the Effects of Generative AI on Learning Mathematics Neural Flow Operators can Approximate any Operator: Abstract Frameworks and Universal Approximations LLMs as Noisy Channels: A Shannon Perspective on Model Capacity and Scaling Laws On the Stability of Spherical Hellinger-Kantorovich Flows and Their Implications for Differential Privacy Training-Free Looped Transformers Move on Muon : A Hamiltonian probability gradient flow perspective of Muon optimizer Entrywise Error Bounds for Spectral Ranking with Semi-Random Adversaries Asymmetric Scaling Laws from Sparse Features Is Dimensionality a Barrier for Retrieval Models? RA-DCA: A Randomized Active-Set DCA for Directional Stationarity in Max-Structured DC Programs Commutator-Induced Uncertainty in VAEs Weisfeiler-Leman Is Incomplete on Simple Spectrum Graphs, so Canonicalize Them Sparse In-Network Learning via Shortest-Path Backpropagation and Finite-Rate Gating Instance-Optimal Estimation with Multiple LLM Judges on a Budget Entropy Equivalence Testing Expand More, Shrink Less: Shaping Effective-Rank Dynamics for Dense Scaling in Recommendation Any-Dimensional Invariant Universality Operationalizing Individual Fairness via Gradient Descent and Bradley-Terry Models Anytime Training with Schedule-Free Spectral Optimization Diffusion-based Denoising Beats Vanilla Score Matching in Parameter Estimation: A Theoretical Explanation Resilience Characterization of AI-Native Wireless Receivers via Persistent Homology The General Theory of Localization Methods Group-Algebraic Tensors: Provably-optimal Equivariant Learning and Physical Symmetry Discovery General Lower Bounds for Differentially Private Federated Learning with Arbitrary Public-Transcript Interactions PilotWiMAE: Pilot-Native Representation Learning for Wireless Channels Proximal basin hopping: global optimization with guarantees
Moving Target SAR Imaging Using Planar Arrays And Multidi...
Guangpu Guo, Xiang-Gen Xia · 2026-06-13 · via math updates on arXiv.org

Based on the framework proposed in Part I, the Part II of this two-part paper investigates two-subarray designs for moving target SAR imaging using planar antenna arrays and the multidimensional Chinese remainder theorem (MD-CRT). In this Part II, we focus on the performance analysis and the detailed two planar subarray designs. In particular, we study a common-scaling two-subarray design, under which the two subarrays share the same scaling factor in the MD-CRT formulation. Under this design, ambiguity resolution can be performed on a common integer frequency vector. As a result, the same unambiguous range as in the general two-subarray framework in Part~I is preserved, while the sufficient conditions for robust recovery become weaker and the corresponding reconstruction error bounds become tighter. Within this common-scaling design, we compare the proposed planar array framework with a conventional separated scheme, in which the motion-induced cross-range shift is recovered by a one-dimensional CRT-based method and the target height is estimated by cross-track interferometric processing. Under the same platform size and minimum antenna spacing constraints, the proposed planar array framework can realize the common-scaling design, whereas the corresponding one-dimensional non-uniform linear array scheme does not admit such a design. With this design, the planar array framework leads to a weaker sufficient condition for robust recovery and thus performs better in moving target imaging. We also compare several planar array designs under fixed platform size and minimum antenna spacing. The analysis shows that recovery performance depends not only on the number of antennas but also on the array geometry. In particular, non-separable planar array geometries can provide better robustness than separable ones when their antenna numbers are comparable.