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

推荐订阅源

博客园_首页
博客园 - Franky
大猫的无限游戏
大猫的无限游戏
博客园 - 三生石上(FineUI控件)
量子位
博客园 - 聂微东
OSCHINA 社区最新新闻
OSCHINA 社区最新新闻
S
SegmentFault 最新的问题
Apple Machine Learning Research
Apple Machine Learning Research
爱范儿
爱范儿
V
Visual Studio Blog
雷峰网
雷峰网
T
Tailwind CSS Blog
宝玉的分享
宝玉的分享
Blog — PlanetScale
Blog — PlanetScale
有赞技术团队
有赞技术团队
博客园 - 叶小钗
Microsoft Azure Blog
Microsoft Azure Blog
T
The Blog of Author Tim Ferriss
U
Unit 42
钛媒体:引领未来商业与生活新知
钛媒体:引领未来商业与生活新知
小众软件
小众软件
阮一峰的网络日志
阮一峰的网络日志
Y
Y Combinator 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
A Low-PAPR, Synchronization-Robust Non-Coherent Grassmann...
[Submitted on 24 Jun 2026] · 2026-06-26 · via cs.IT updates on arXiv.org

View PDF HTML (experimental)

Abstract:Non-coherent Grassmannian (unitary space-time) signaling detects on the received subspace, which is invariant to a branch-side (polarization or mode-coupling) rotation and to a phase that is constant over the coherence block. It therefore needs no carrier-phase or polarization recovery within the block and is robust to phase noise when the per-block phase drift is small, while a multi-branch (polarization or spatial) front end harvests diversity without channel estimation or pilots. However, the Grassmannian-constellation literature usually assumes a distortion-free, linear channel and transmitter and already-acquired symbol timing. This paper closes both gaps while reusing off-the-shelf Grassmannian packings. First, we impose a constant-modulus (low peak-to-average-power-ratio, PAPR) constraint on the constellation and quantify the PAPR/chordal-distance trade-off: a constant-modulus design lowers the 0.1% PAPR from 6.1 dB (unconstrained) to 3.6 dB -- 1.6 dB below 16-QAM (5.2 dB) -- easing the optical modulator linear range and the fiber Kerr-nonlinearity penalty, at a ~1.8 dB cost in high-SNR coding gain. Second, we derive a phase-blind subspace timing-error detector (TED) that exploits the invariance of the GLRT projection energy to the unknown carrier phase, plus a feedforward acquisition metric, supplying clock recovery without prior carrier or polarization recovery. The TED yields a clean S-curve with a stable lock point for roll-offs down to beta=0.1. Under block fading the proposed estimator attains genie-timing SER within a fraction of a dB and recovers full diversity, whereas an uncorrected 0.35-symbol timing offset floors the error rate near 0.4. Results use a symbol-rate block-fading abstraction; full fiber, modulator, and phase-noise modeling is future work. The scheme combines low PAPR with the diversity and phase-recovery-free operation of non-coherent reception.

Submission history

From: Eylon E. Krause [view email]
[v1] Wed, 24 Jun 2026 23:59:13 UTC (452 KB)