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

推荐订阅源

J
Java Code Geeks
Martin Fowler
Martin Fowler
B
Blog RSS Feed
D
DataBreaches.Net
L
LangChain Blog
月光博客
月光博客
S
SegmentFault 最新的问题
阮一峰的网络日志
阮一峰的网络日志
V
Visual Studio Blog
美团技术团队
Jina AI
Jina AI
博客园 - 司徒正美
雷峰网
雷峰网
Last Week in AI
Last Week in AI
让小产品的独立变现更简单 - ezindie.com
让小产品的独立变现更简单 - ezindie.com
IT之家
IT之家
博客园 - 三生石上(FineUI控件)
WordPress大学
WordPress大学
小众软件
小众软件
罗磊的独立博客
博客园_首页
freeCodeCamp Programming Tutorials: Python, JavaScript, Git & More
A
About on SuperTechFans
Engineering at Meta
Engineering at Meta

cs.IT updates on arXiv.org

Theoretical Limits of Language Model Alignment $f$-Divergence Regularized RLHF: Two Tales of Sampling and Unified Analyses A Unified Measure-Theoretic View of Diffusion, Score-Based, and Flow Matching Generative Models When Can Voting Help, Hurt, or Change Course? Exact Structure of Binary Test-Time Aggregation When Semantic Communication Meets Queueing: Cross-Layer Latency and Task Fidelity Optimization Convexity in Disguise: A Theoretical Framework for Nonconvex Low-Rank Matrix Estimation Conditional Diffusion Under Linear Constraints: Langevin Mixing and Information-Theoretic Guarantees Sharp Capacity Thresholds in Linear Associative Memory: From Winner-Take-All to Listwise Retrieval Expert Routing for Communication-Efficient MoE via Finite Expert Banks Contextual Memory-Enhanced Source Coding for Low-SNR Communications Realizable Bayes-Consistency for General Metric Losses Leveraging Code Automorphisms for Improved Syndrome-Based Neural Decoding A Hierarchical Sampling Framework for bounding the Generalization Error of Federated Learning Dueling DDQN-Based Adaptive Multi-Objective Handover Optimization for LEO Satellite Networks The Causal Description Gap: Information-Theoretic Separations Across Pearl's Hierarchy Optimization of CV-QKD Under Practical Constraints Benchmarking Wireless Representations: High-Dimensional vs. Compressed Embeddings for Efficiency and Robustness Real-Time Text Transmission via LLM-Based Entropy Coding over Fixed-Rate Channels SwiftChannel: Algorithm-Hardware Co-Design for Deep Learning-Based 5G Channel Estimation Evolving Token Communication with Parametric Memory Network Remote Action Generation: Remote Control with Minimal Communication The (Marginal) Value of a Search Ad: An Online Causal Framework for Repeated Second-price Auctions Stabilizing Private LASSO under Heterogeneous Covariates via Anisotropic Objective Perturbation Linear-Readout Floors and Threshold Recovery in Computation in Superposition Soft Graph Diffusion Transformer for MIMO Detection Hierarchical Federated Learning for Networked AI: From Communication Saving to Architecture-Aware Design Exponential families from a single KL identity MIFair: A Mutual-Information Framework for Intersectionality and Multiclass Fairness Diffusion-OAMP for Joint Image Compression and Wireless Transmission Decoupled Descent: Exact Test Error Tracking Via Approximate Message Passing
Moving Target SAR Imaging Using Planar Arrays And Multidi...
Guangpu Guo, Xiang-Gen Xia · 2026-06-13 · via cs.IT updates on arXiv.org

In this two-part paper, we investigate synthetic aperture radar (SAR) moving target imaging using planar antenna arrays. For a target moving over a three-dimensional terrain, its accurate localization requires the joint estimation of the motion-induced cross-range shift and the target height. In Part I of this two-part paper, starting from the planar array imaging geometry and the corresponding signal model, we show that these two quantities can be unified into a two-dimensional parameter vector and represented, after two-dimensional discrete Fourier transform (2D-DFT) processing across the planar array, through a natural vector remainder formulation. We first develop a general 2D-DFT matrix modulus framework and show that, in the two-dimensional setting, the associated 2D-DFT matrix modulus affects the propagation of vector remainder errors. Under a fixed array geometry and antenna number constraint, we derive an optimal construction of this matrix modulus and adopt it in the subsequent analysis. Under this construction, a single planar array provides only a folded estimate when the true parameter vector lies outside its unambiguous range. To resolve this ambiguity, we develop a multi-subarray framework in which multiple planar subarrays generate multiple vector remainders with different matrix moduli, and the desired parameter vector is recovered through the multidimensional Chinese remainder theorem (MD-CRT). To account for practical errors introduced by 2D-DFT quantization and additive noise, we further introduce an approximate 2D-DFT peak model for non-integer frequency vectors, incorporate robust MD-CRT, and establish sufficient conditions together with explicit reconstruction error bounds for both noiseless and noisy settings. Numerical results verify that the proposed multi-subarray framework enlarges the unambiguous range compared with a single planar array.