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

推荐订阅源

博客园 - 三生石上(FineUI控件)
Blog — PlanetScale
Blog — PlanetScale
B
Blog
GbyAI
GbyAI
爱范儿
爱范儿
月光博客
月光博客
N
Netflix TechBlog - Medium
T
Tailwind CSS Blog
G
Google Developers Blog
大猫的无限游戏
大猫的无限游戏
Vercel News
Vercel News
H
Hackread – Cybersecurity News, Data Breaches, AI and More
WordPress大学
WordPress大学
The GitHub Blog
The GitHub Blog
Recent Announcements
Recent Announcements
腾讯CDC
MyScale Blog
MyScale Blog
V
Visual Studio Blog
The Cloudflare Blog
Microsoft Security Blog
Microsoft Security Blog
A
About on SuperTechFans
Google DeepMind News
Google DeepMind News
Last Week in AI
Last Week in AI
OSCHINA 社区最新新闻
OSCHINA 社区最新新闻

cs updates on arXiv.org

Beyond Binary Edits Robust Multimodal Knowledge Editing with Adversarial Subspace Alignment Agentic Proving for Program Verification MemAudit: Post-hoc Auditing of Poisoned Agent Memory via Causal Attribution and Structural Anomaly Detection OpenSkillEval: Automatically Auditing the Open Skill Ecosystem for LLM Agents One Policy, Infinite NPCs: Persona-Traceable Shared RL Policies for Scalable Game Agents How Human-Like Are Large Language Models? A Register-Aware Linguistic Evaluation Framework Benchmarking Google Embeddings 2 against Open-Source Models for Multilingual Dense Retrieval and RAG Systems Structure-Guided Entity Resolution: Fine-Tuning LLMs for Robust Name Matching in Complex Linguistic Contexts Solving the Aircraft Disassembly Scheduling Problem Co-ReAct: Rubrics as Step-Level Collaborators for ReAct Agents CP or DP? Why Not Both: A Case Study in the Partial Shop Scheduling Problem Asking For An Old Friend: Diagnosing and Mitigating Temporal Failure Modes in LLM-based Statutory Question Answering EDGE-OPD: Internalizing Privileged Context with Evidence Guided On-Policy Distillation ARES: Automated Rubric Synthesis for Scalable LLM Reinforcement Learning SSDAU: Structured Semantic Data Augmentation for Joint Entity and Relation Extraction Naturalistic measure of social norms alignment Articulatory strategy as a source of variation in acoustic vowel dynamics When Planning Fails Despite Correct Execution: On Epistemic Calibration for LLM-Based Multi-Agent Systems EquiSumm : A Gender Bias-Aware Framework for Inclusive Tweet Summarization Metacognition as Reward: Reinforcing LLM Reasoning via Knowledge and Regulation Signals From Correctness to Preference: A Framework for Personalized Agentic Reinforcement Learning Cultural Adaptation in Large Language Models for Political Discourse Emotion Recognition in Sign Language Conversation ClimateChat-300K: A Multi-Modal Facebook Dataset for Understanding Diverse Perspectives in Climate Communication AraHopeCorpus: Annotation Guidelines and Dataset for Hope Speech in Arabic Social Media Crisis Discourse Human-in-the-Loop Multi-Agent Ventilator Decision Support with Contextual Bandit Preference Learning Convergence Without Understanding: When Language Models Agree on Representations but Disagree on Reasoning DART: Semantic Recoverability for Structured Tool Agents Ontological Knowledge Blocks: Executable Compliance and Profile-Based Validation for Trustworthy AI Systems Parallel Context Compaction for Long-Horizon LLM Agent Serving
A Low-PAPR, Synchronization-Robust Non-Coherent Grassmann...
[Submitted on 24 Jun 2026] · 2026-06-26 · via cs 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)