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

推荐订阅源

腾讯CDC
aimingoo的专栏
aimingoo的专栏
S
SegmentFault 最新的问题
A
About on SuperTechFans
Engineering at Meta
Engineering at Meta
宝玉的分享
宝玉的分享
freeCodeCamp Programming Tutorials: Python, JavaScript, Git & More
博客园 - 叶小钗
WordPress大学
WordPress大学
N
Netflix TechBlog - Medium
MyScale Blog
MyScale Blog
Stack Overflow Blog
Stack Overflow Blog
Microsoft Azure Blog
Microsoft Azure Blog
博客园 - 聂微东
M
MIT News - Artificial intelligence
F
Fortinet All Blogs
奇客Solidot–传递最新科技情报
奇客Solidot–传递最新科技情报
Blog — PlanetScale
Blog — PlanetScale
T
Tailwind CSS Blog
Recent Announcements
Recent Announcements
Jina AI
Jina AI
大猫的无限游戏
大猫的无限游戏
Apple Machine Learning Research
Apple Machine Learning Research
J
Java Code Geeks

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
Area Rate Efficiency in Molecular Communications
Lukas Brand, Sebastian Lotter, Vahid Jamali, Robert Schober · 2021-05-04 · via cs.IT updates on arXiv.org

We consider a multiuser diffusion-based molecular communication (MC) system where multiple spatially distributed transmitter (TX)-receiver (RX) pairs establish point-to-point communication links employing the same type of signaling molecules. To realize the full potential of such a system, an in-depth understanding of the interplay between the spatial user density and inter-user interference (IUI) and its impact on system performance in an asymptotic regime with large numbers of users is needed. In this paper, we adopt a three-dimensional (3-D) system model with multiple independent and spatially distributed point-to-point transmission links, where both the TXs and RXs are positioned according to a regular hexagonal grid, respectively. Based on this model, we first derive an expression for the channel impulse responses (CIRs) of all TX-RX links in the system. Then, we provide the maximum likelihood (ML) decision rule for the RXs and show that it reduces to a threshold-based detector. We derive an analytical expression for the corresponding detection threshold which depends on the statistics of the MC channel and the statistics of the IUI. Furthermore, we derive an analytical expression for the bit error rate (BER) and the achievable rate of a single transmission link. Finally, we propose a new performance metric, which we refer to as area rate efficiency (ARE), that captures the tradeoff between the user density and IUI. The ARE characterizes how efficiently given TX and RX areas are used for information transmission and is given in terms of bits per area unit. We show that there exists an optimal user density for maximization of the ARE. Results from particle-based and Monte Carlo simulations validate the accuracy of the expressions derived for the CIR, optimal detection threshold, BER, and ARE.