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

推荐订阅源

MyScale Blog
MyScale Blog
Apple Machine Learning Research
Apple Machine Learning Research
H
Help Net Security
雷峰网
雷峰网
V
Visual Studio Blog
G
Google Developers Blog
Microsoft Azure Blog
Microsoft Azure Blog
Hugging Face - Blog
Hugging Face - Blog
爱范儿
爱范儿
IT之家
IT之家
Engineering at Meta
Engineering at Meta
Microsoft Security Blog
Microsoft Security Blog
aimingoo的专栏
aimingoo的专栏
大猫的无限游戏
大猫的无限游戏
M
MIT News - Artificial intelligence
月光博客
月光博客
A
About on SuperTechFans
B
Blog RSS Feed
奇客Solidot–传递最新科技情报
奇客Solidot–传递最新科技情报
The GitHub Blog
The GitHub Blog
N
Netflix TechBlog - Medium
J
Java Code Geeks
云风的 BLOG
云风的 BLOG
Blog — PlanetScale
Blog — PlanetScale

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
Cellular Interference Alignment: Omni-Directional Antenna...
Vasilis Ntranos, Mohammad Ali Maddah-Ali, Giuseppe Caire · 2014-04-26 · via cs.IT updates on arXiv.org

Although interference alignment (IA) can theoretically achieve the optimal degrees of freedom (DoFs) in the $K$-user Gaussian interference channel, its direct application comes at the prohibitive cost of precoding over exponentially-many signaling dimensions. On the other hand, it is known that practical "one-shot" IA precoding (i.e., linear schemes without symbol expansion) provides a vanishing DoFs gain in large fully-connected networks with generic channel coefficients. In our previous work, we introduced the concept of "Cellular IA" for a network topology induced by hexagonal cells with sectors and nearest-neighbor interference. Assuming that neighboring sectors can exchange decoded messages (and not received signal samples) in the uplink, we showed that linear one-shot IA precoding over $M$ transmit/receive antennas can achieve the optimal $M/2$ DoFs per user. In this paper we extend this framework to networks with omni-directional (non-sectorized) cells and consider the practical scenario where users have $2$ antennas, and base-stations have $2$, $3$ or $4$ antennas. In particular, we provide linear one-shot IA schemes for the $2\times 2$, $2\times3$ and $2\times 4$ cases, and show the achievability of $3/4$, $1$ and $7/6$ DoFs per user, respectively. DoFs converses for one-shot schemes require the solution of a discrete optimization problem over a number of variables that grows with the network size. We develop a new approach to transform such challenging optimization problem into a tractable linear program (LP) with significantly fewer variables. This approach is used to show that the achievable $3/4$ DoFs per user are indeed optimal for a large (extended) cellular network with $2\times 2$ links.