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

推荐订阅源

V
Visual Studio Blog
U
Unit 42
让小产品的独立变现更简单 - ezindie.com
让小产品的独立变现更简单 - ezindie.com
The GitHub Blog
The GitHub Blog
Microsoft Azure Blog
Microsoft Azure Blog
有赞技术团队
有赞技术团队
Stack Overflow Blog
Stack Overflow Blog
爱范儿
爱范儿
博客园 - 司徒正美
Vercel News
Vercel News
I
InfoQ
GbyAI
GbyAI
C
Check Point Blog
B
Blog RSS Feed
Martin Fowler
Martin Fowler
B
Blog
MyScale Blog
MyScale Blog
腾讯CDC
博客园 - Franky
Blog — PlanetScale
Blog — PlanetScale
钛媒体:引领未来商业与生活新知
钛媒体:引领未来商业与生活新知
Hugging Face - Blog
Hugging Face - Blog
freeCodeCamp Programming Tutorials: Python, JavaScript, Git & More
博客园 - 三生石上(FineUI控件)

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
On the Degrees of Freedom and Eigenfunctions of Line-of-S...
Juan Carlos Ruiz-Sicilia, Marco Di Renzo, Marco Donald Migliore, · 2023-08-16 · via cs.IT updates on arXiv.org

We consider a line-of-sight communication link between two holographic surfaces (HoloSs), and provide a closed-form expression for the effective degrees of freedom (eDoF), i.e., the number of orthogonal communication modes that can be established between them. The proposed framework can be applied to network deployments beyond the widely studied paraxial setting. This is obtained by partitioning the largest HoloS into sub-HoloSs, and proving that the supports of the Fourier transforms of the kernels of the obtained integral operators are limited and are almost disjoint in the wavenumber domain, provided that the sub-HoloSs are sufficiently small. Using the proposed approach, it is proved that (i) the eDoF correspond to an instance of Landau's second eigenvalue problem; (ii) the eigenvalues polarize asymptotically to multiple values; and (iii) the eDoF depend explicitly on the approximation accuracy according to Kolmogorov's n-width criterion. This result generalizes the analysis in the paraxial setting, in which it is known that the eigenvalues polarize asymptotically to two values. In addition, it is proved that the typical method of analysis utilized in the paraxial setting, which is based on a parabolic approximation of the wavefront in a local coordinates system, is equivalent to a quartic approximation of the wavefront in a general coordinates system. This facilitates the derivation of an explicit formula for the eDoF in terms of key system parameters, including the relative offset between the center-points of the HoloSs, and their relative rotation and tilt. We specialize the framework to canonical network deployments, and provide analytical expressions for the optimal, according to Kolmogorov's n-width criterion, basis functions (communication waveforms) for data encoding and decoding.