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

推荐订阅源

V
Visual Studio Blog
罗磊的独立博客
小众软件
小众软件
T
Tailwind CSS Blog
宝玉的分享
宝玉的分享
博客园_首页
N
Netflix TechBlog - Medium
B
Blog
Recent Announcements
Recent Announcements
Y
Y Combinator Blog
Blog — PlanetScale
Blog — PlanetScale
L
LangChain Blog
F
Fortinet All Blogs
The GitHub Blog
The GitHub Blog
Stack Overflow Blog
Stack Overflow Blog
C
Check Point Blog
Last Week in AI
Last Week in AI
Jina AI
Jina AI
V
V2EX
奇客Solidot–传递最新科技情报
奇客Solidot–传递最新科技情报
让小产品的独立变现更简单 - ezindie.com
让小产品的独立变现更简单 - ezindie.com
钛媒体:引领未来商业与生活新知
钛媒体:引领未来商业与生活新知
博客园 - 叶小钗
博客园 - 【当耐特】

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
Revisiting the Fraunhofer and Fresnel Boundaries for Phas...
Mehdi Monemi, Mehdi Rasti, Matti Latva-aho · 2024-10-21 · via cs.IT updates on arXiv.org

This paper presents the characterization of near-field propagation regions for phased array antennas, with a particular focus on the propagation boundaries defined by Fraunhofer and Fresnel distances. These distances, which serve as critical boundaries for understanding signal propagation behavior, have been extensively studied and characterized in the literature for single-element antennas. However, the direct application of these results to phased arrays, a common practice in the field, is argued to be invalid and non-exact. This work calls for a deeper understanding of near-field propagation to accurately characterize such boundaries around phased array antennas. More specifically, for a single-element antenna, the Fraunhofer distance is $d^{\mathrm{F}}=2D^2 \sin^2(θ)/λ$ where $D$ represents the largest dimension of the antenna, $λ$ is the wavelength and $θ$ denotes the observation angle. We show that for phased arrays, $d^{\mathrm{F}}$ experiences a fourfold increase (i.e., $d^{\mathrm{F}}=8D^2 \sin^2(θ)/λ$) provided that $|θ-\fracπ{2}|>θ^F$ (which holds for most practical scenarios), where $θ^F$ is a small angle whose value depends on the number of array elements, and for the case $|θ-\fracπ{2}|\leqθ^F$, we have $d^{\mathrm{F}}\in[2D^2/λ,8D^2\cos^2(θ^F)/λ]$, where the precise value is obtained according to some square polynomial function $\widetilde{F}(θ)$. Besides, we also prove that the Fresnel distance for phased array antennas is given by $d^{\mathrm{N}}=1.75 \sqrt{{D^3}/λ}$ which is $\sqrt{8}$ times greater than the corresponding distance for a conventional single-element antenna with the same dimension.