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

推荐订阅源

B
Blog RSS Feed
Jina AI
Jina AI
雷峰网
雷峰网
Blog — PlanetScale
Blog — PlanetScale
Hugging Face - Blog
Hugging Face - Blog
奇客Solidot–传递最新科技情报
奇客Solidot–传递最新科技情报
Last Week in AI
Last Week in AI
博客园 - 司徒正美
罗磊的独立博客
J
Java Code Geeks
Engineering at Meta
Engineering at Meta
WordPress大学
WordPress大学
Vercel News
Vercel News
A
About on SuperTechFans
I
InfoQ
D
DataBreaches.Net
爱范儿
爱范儿
freeCodeCamp Programming Tutorials: Python, JavaScript, Git & More
U
Unit 42
aimingoo的专栏
aimingoo的专栏
宝玉的分享
宝玉的分享
P
Proofpoint News Feed
Microsoft Azure Blog
Microsoft Azure Blog
美团技术团队

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
Generalized Signal Alignment: On the Achievable DoF for M...
Kangqi Liu, Meixia Tao · 2014-05-05 · via cs.IT updates on arXiv.org

This paper studies the achievable degrees of freedom for multi-user MIMO two-way relay channels, where there are $K$ source nodes, each equipped with $M$ antennas, one relay node, equipped with $N$ antennas, and each source node exchanges independent messages with an arbitrary set of other source nodes via the relay. By allowing an arbitrary information exchange pattern, the considered channel model is a unified one. It includes several existing channel models as special cases: $K$-user MIMO Y channel, multi-pair MIMO two-way relay channel, generalized MIMO two-way X relay channel, and $L$-cluster MIMO multiway relay channel. Previous studies mainly considered the achievability of the DoF cut-set bound $2N$ at the antenna configuration $N < 2M$ by applying signal alignment. This work aims to investigate the achievability of the DoF cut-set bound $KM$ for the case $N\geq 2M$. To this end, we first derive tighter DoF upper bounds for three special cases of the considered channel model. Then, we propose a new transmission framework, generalized signal alignment, to approach these bounds. The notion of GSA is to form network-coded symbols by aligning every pair of signals to be exchanged in a compressed subspace at the relay. A necessary and sufficient condition to construct the relay compression matrix is given. We show that using GSA, the new DoF upper bound is achievable when i) $\frac{N}{M} \in \big(0, 2+\frac{4}{K(K-1)}\big] \cup \big[K-2, +\infty\big)$ for the $K$-user MIMO Y channel; ii) $\frac{N}{M} \in \big(0, 2+\frac{4}{K}\big] \cup \big[K-2, +\infty\big)$ for the multi-pair MIMO two-way relay channel; iii) $\frac{N}{M} \in \big(0, 2+\frac{8}{K^2}\big] \cup \big[K-2, +\infty\big)$ for the generalized MIMO two-way X relay channel. We also provide the antenna configuration regions for the general multi-user MIMO two-way relay channel to achieve the total DoF $KM$.