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

推荐订阅源

小众软件
小众软件
V
Visual Studio Blog
博客园 - 三生石上(FineUI控件)
Last Week in AI
Last Week in AI
Blog — PlanetScale
Blog — PlanetScale
爱范儿
爱范儿
J
Java Code Geeks
A
About on SuperTechFans
F
Fortinet All Blogs
B
Blog
aimingoo的专栏
aimingoo的专栏
H
Hackread – Cybersecurity News, Data Breaches, AI and More
Engineering at Meta
Engineering at Meta
Y
Y Combinator Blog
有赞技术团队
有赞技术团队
G
Google Developers Blog
Apple Machine Learning Research
Apple Machine Learning Research
V
V2EX
博客园_首页
博客园 - 叶小钗
罗磊的独立博客
OSCHINA 社区最新新闻
OSCHINA 社区最新新闻
D
Docker
云风的 BLOG
云风的 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
Zero-Forcing Per-Group Precoding (ZF-PGP) for Robust Opti...
Thomas Ketseoglou, Ender Ayanoglu · 2018-10-19 · via cs.IT updates on arXiv.org

In this paper, we propose a new, combined Zero-Forcing Per-Group Precoding (ZF-PGP) method that achieves very high gains in comparison to ZF Precoding techniques, while it simultaneously offers individually separate streams to reach individual User Equipment (UE), i.e., it obliterates the need for coordinated, joint decoding by the group's UEs. Although ZF-PGP in general experiences a performance loss in comparison to the near-optimal Per-Group Precoding within groups (PGP-WG), it is much simpler to implement than PGP-WG. The method works extremely well in conjunction with Combined Frequency and Space Division and Multiplexing (CFSDM) in correlated channels or in cases in which the group's total number of antennas is greater than the group's available Virtual Channel Model Beams (VCMB) number. As we show by multiple examples, for a Uniform Linear Array (ULA), by combining the proposed technique with massive Multiple-Input Multiple-Output (MIMO) and Joint Spatial Division and Multiplexing for Finite Alphabets (JSDM-FA) type hybrid precoding or CFSDM a very efficient, near-optimal design with reduced complexity at the UEs is achieved, while each UE decodes its received data independently, without interference from data destined for other UEs. Due to JSDM-FA Statistical Channel State Information (SCSI) inner beamforming, the groups are easily identified. We show that the combined ZF-PGP scheme achieves very high gains in comparison to ZF and Regularized ZF (RZF) precoding and other modified sub-optimal techniques investigated, while its complexity is still relatively low due to PGP-WG. We also demonstrate the robustness of the proposed precoding techniques to channel estimation errors, showing minimal performance loss.