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

推荐订阅源

L
LangChain Blog
V
V2EX
爱范儿
爱范儿
freeCodeCamp Programming Tutorials: Python, JavaScript, Git & More
Martin Fowler
Martin Fowler
OSCHINA 社区最新新闻
OSCHINA 社区最新新闻
Apple Machine Learning Research
Apple Machine Learning Research
WordPress大学
WordPress大学
有赞技术团队
有赞技术团队
宝玉的分享
宝玉的分享
Last Week in AI
Last Week in AI
让小产品的独立变现更简单 - ezindie.com
让小产品的独立变现更简单 - ezindie.com
罗磊的独立博客
小众软件
小众软件
Vercel News
Vercel News
博客园 - 司徒正美
阮一峰的网络日志
阮一峰的网络日志
V
Visual Studio Blog
J
Java Code Geeks
P
Proofpoint News Feed
MongoDB | Blog
MongoDB | Blog
B
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 Space and Frequency Index Modulation
T. Datta, H. S. Eshwaraiah, A. Chockalingam · 2015-06-27 · via cs.IT updates on arXiv.org

Unlike in conventional modulation where information bits are conveyed only through symbols from modulation alphabets defined in the complex plane (e.g., quadrature amplitude modulation (QAM), phase shift keying (PSK)), in index modulation (IM), additional information bits are conveyed through indices of certain transmit entities that get involved in the transmission. Transmit antennas in multi-antenna systems and subcarriers in multi-carrier systems are examples of such transmit entities that can be used to convey additional information bits through indexing. In this paper, we introduce {\em generalized space and frequency index modulation}, where the indices of active transmit antennas and subcarriers convey information bits. We first introduce index modulation in the spatial domain, referred to as generalized spatial index modulation (GSIM). For GSIM, where bits are indexed only in the spatial domain, we derive the expression for achievable rate as well as easy-to-compute upper and lower bounds on this rate. We show that the achievable rate in GSIM can be more than that in spatial multiplexing, and analytically establish the condition under which this can happen. It is noted that GSIM achieves this higher rate using fewer transmit radio frequency (RF) chains compared to spatial multiplexing. We also propose a Gibbs sampling based detection algorithm for GSIM and show that GSIM can achieve better bit error rate (BER) performance than spatial multiplexing. For generalized space-frequency index modulation (GSFIM), where bits are encoded through indexing in both active antennas as well as subcarriers, we derive the achievable rate expression. Numerical results show that GSFIM can achieve higher rates compared to conventional MIMO-OFDM. Also, BER results show the potential for GSFIM performing better than MIMO-OFDM.