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

推荐订阅源

爱范儿
爱范儿
WordPress大学
WordPress大学
C
Check Point Blog
GbyAI
GbyAI
U
Unit 42
Google DeepMind News
Google DeepMind News
B
Blog RSS Feed
Blog — PlanetScale
Blog — PlanetScale
J
Java Code Geeks
I
InfoQ
freeCodeCamp Programming Tutorials: Python, JavaScript, Git & More
Hugging Face - Blog
Hugging Face - Blog
Vercel News
Vercel News
博客园 - 【当耐特】
美团技术团队
小众软件
小众软件
S
SegmentFault 最新的问题
Jina AI
Jina AI
阮一峰的网络日志
阮一峰的网络日志
让小产品的独立变现更简单 - ezindie.com
让小产品的独立变现更简单 - ezindie.com
The Cloudflare Blog
Last Week in AI
Last Week in AI
OSCHINA 社区最新新闻
OSCHINA 社区最新新闻
V
Visual Studio 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
Downlink Secrecy Rate of One-Bit Massive MIMO System with...
M. A. Teeti · 2020-02-29 · via cs.IT updates on arXiv.org

In this study, we consider the physical layer security in the downlink of a Massive MIMO system employing one-bit quantization at the base station (BS). We assume an active eavesdropper that attempts to spoiling the channel estimation acquisition at the BS for a legitimate user, whereas overhearing on downlink transmission. We consider the two most widespread methods for degrading the eavesdropper's channel, the nullspace artificial noise (NS-AN) and random artificial noise (R-AN). Then, we present a lower bound on the secrecy rate and asymptotic performance, considering zero-forcing beamforming (ZF-BF) and maximum-ratio transmission beamforming (MRT-BF). Our results reveal that even when the eavesdropper is close enough to the intercepted user, a positive secrecy rate --which tends to saturation with increasing the number of BS antennas $N$---is possible, as long as the transmit power of eavesdropper is less than that of the legitimate user during channel training. We show that ZF-BF with NS-AN provides the best performance. It is found that MRT-BF and ZF-BF are equivalent in the asymptotic limit of $N$ and hence the artificial noise technique is the performance indicator. Moreover, we study the impact of \emph{power-scaling law} on the secrecy rate. When the transmit power of BS is reduced proportional to $1/N$, the performance is independent of artificial noise asymptotically and hence the beamforming technique is the performance indicator. In addition, when the BS's power is reduced proportional to $1/\sqrt{N}$, all combinations of beamforming and artificial noise schemes are equally likely asymptotically, independent of quantization noise. We present various numerical results to corroborate our analysis.