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

推荐订阅源

B
Blog RSS Feed
有赞技术团队
有赞技术团队
OSCHINA 社区最新新闻
OSCHINA 社区最新新闻
阮一峰的网络日志
阮一峰的网络日志
V
V2EX
Y
Y Combinator Blog
Jina AI
Jina AI
G
Google Developers Blog
Last Week in AI
Last Week in AI
博客园 - 叶小钗
H
Hackread – Cybersecurity News, Data Breaches, AI and More
L
LangChain Blog
奇客Solidot–传递最新科技情报
奇客Solidot–传递最新科技情报
V
Visual Studio Blog
aimingoo的专栏
aimingoo的专栏
freeCodeCamp Programming Tutorials: Python, JavaScript, Git & More
J
Java Code Geeks
Stack Overflow Blog
Stack Overflow Blog
IT之家
IT之家
The GitHub Blog
The GitHub Blog
D
Docker
量子位
罗磊的独立博客
腾讯CDC

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
BICM-compatible Rate Adaptive Geometric Constellation Sha...
Metodi Plamenov Yankov, Smaranika Swain, Ognjen Jovanovic, Darko · 2023-11-10 · via cs.IT updates on arXiv.org

In this paper, a rate adaptive geometric constellation shaping (GCS) scheme which is fully backward-compatible with existing state of the art bit-interleaved coded modulation (BICM) systems is proposed and experimentally demonstrated. The system relies on optimization of the positions of the quadrature amplitude modulation (QAM) points on the I/Q plane for maximized achievable information rate, while maintaining quantization and fiber nonlinear noise robustness. Furthermore, `dummy' bits are multiplexed with coded bits before mapping to symbols. Rate adaptivity is achieved by tuning the ratio of coded and `dummy' bits, while maintaining a fixed forward error-correction block and a fixed modulation format size. The points' positions and their labeling are optimized using automatic differentiation. The proposed GCS scheme is compared to a time-sharing hybrid (TH) QAM modulation and the now mainstream probabilistic amplitude shaping (PAS) scheme. The TH without shaping is outperformed for all studied data rates in a simulated linear channel by up to 0.7 dB. In a linear channel, PAS is shown to outperform the proposed GCS scheme, while similar performances are reported for PAS and the proposed GCS in a simulated nonlinear fiber channel. The GCS scheme is experimentally demonstrated in a multi-span recirculating loop coherent optical fiber transmission system with a total distance of up to 3000 km. Near-continuous zero-error flexible throughput is reported as a function of the transmission distance. Up to 1-2 spans of increased reach gains are achieved at the same net data rate w.r.t. conventional QAM. At a given distance, up to 0.79 bits/2D symbol of gain w.r.t. conventional QAM is achieved. In the experiment, similar performance to PAS is demonstrated.