ArXivCSExplorer
☆☆Bookmarks🏆RSSHow to UseFAQ
Built with and by Teycir Ben Soltane•
How to Use•FAQ•GitHub•arXiv.org•
Share:

20 results for “CSI compression”

CS papers only

Hybrid search: Keyword + semantic, ranked by combined score.ⓘ

Want pure semantic search? Try claim verification →

eess.SPcs.ITcs.LGEmpiricalRecentJun 15, 2026

Context-Aware Markov VAE for CSI Compression in Wireless Systems

Efstathios Chatziloizos, Konstantinos Vandikas, Aneta Vulgarakis Feljan, Zheng Chen +1 more

This paper proposes a context-aware compression framework for neural channel state information (CSI) in FDD systems with limited feedback resources.

View →
eess.SPEmpiricalRecentJul 24, 2026

A Foundation Model for Cross-Band CSI Reconstruction

Hongpu Zhang, Shu Sun, Ruifeng Gao, Tongjia Zhang +1 more

This paper proposes a model for cross-band CSI reconstruction in multi-band low-altitude wireless systems using radio-frequency metadata and pilot-guided cross-attention.

View →
cs.ITcs.DSEmpiricalRecentJun 16, 2026

The 2026 Algorithmic Information Theory Data Compression Challenge

André Ribeiro, Rúben Garrido, Violeta Ramos, António Alberto +27 more

This paper presents the 2026 Algorithmic Information Theory Data Compression Challenge, evaluating lossless compressors under realistic constraints and revealing performance dependencies.

View →
cs.SDcs.AIeess.ASEmpiricalRecentJun 10, 2026

Towards Data-free and Training-free Compression for Speech Foundation Models Using Parameter Clustering

Haoning Xu, Zhaoqing Li, Huimeng Wang, Youjun Chen +3 more

A novel data-free and training-free compression approach for speech foundation models using channelwise clustering via k-means is proposed.

View →
cs.ITcs.ETcs.NITheoreticalRecentAug 13, 2026

Energy-Aware Compression-Computation Co-Adaptation for Latency Minimization in Multi-User Semantic Communication

Loc X. Nguyen, Yumin Park, Avi Deb Raha, Huy Q. Le +3 more

This paper proposes an energy-aware compression-computation co-adaptation framework for DeepJSCC semantic communication to meet user heterogeneity in terms of QoS, channel condition, and local energy.

View →
cs.ITEmpiricalRecentJun 10, 2026

STCC: A Unified Source-Channel Semantic Token Coding Framework for Semantic Communications

Zhicheng Bao, Chen Dong, Sen Wang, Long Liu +5 more

This paper proposes a unified source-channel semantic token coding framework for transmitting discrete semantic tokens of foundation models over noisy channels.

View →
cs.ITTheoreticalRecentJun 29, 2026

Lossy Compression for Sparse Aggregation

Yijun Fan, Fangwei Ye, Raymond W. Yeung

This paper proposes a compression scheme for transmitting sparse local updates in distributed learning systems, and provides a converse based on f-divergence to characterize the communication-accuracy…

View →
eess.SPEmpiricalRecentJun 24, 2026

CSI-CLIP++: A Scalable Channel Foundation Model for Wireless Communication via CIR-CSI Consistency

Jun Jiang, Wenjun Yu, Yunfan Li, Yuan Gao +1 more

Proposes a scalable channel foundation model for MIMO wireless channels

View →
cs.DBcs.DSEmpiricalRecentJun 15, 2026

C^2: Cache-Conscious Succinct Tries with Adaptive Unary Path Compression

Kepan Zhang, Tiancheng Zhao, Helen Xu

This paper proposes C^2, a set of techniques to improve the spatial locality of succinct tries, resulting in faster query performance and reduced memory footprint.

View →
cs.ITEmpiricalRecentJun 15, 2026

Set Shaping Theory Applied to Universal Coding

Alix Petit, Aida Koch, Logan Lewis, Lily Scott

A Set Shaping Theory transformation reduces the average universal coding length of uniformly generated sequences.

View →
cs.DSTheoreticalRecentJul 17, 2026

A Unified Theory of Sparsification

Sanjeev Khanna, Aaron Putterman, Madhu Sudan

This paper introduces a structural theorem for the sparsifiability of real-valued codes, which generalizes both combinatorial and continuous notions of sparsification.

View →
eess.SPEmpiricalRecentJun 11, 2026

Mitigating SAR-ADC Non-Idealities in Massive MU-MIMO Systems via Affine Models

Jérémy Guichemerre, Christoph Studer

This paper proposes two affine models to account for non-idealities in SAR ADCs in massive MU-MIMO wireless systems.

View →
cs.ITcs.CCTheoreticalRecentJun 22, 2026

Tighter Bounds for Algorithmic Complexity Estimation Using a Reusable Code-Based Block Decomposition Method

Eduardo Yuji Sakabe, Felipe S. Abrahão, Santiago Hernández-Orozco, Ricardo Gudwin +1 more

The authors extend the Block Decomposition Method (BDM) to utilize dependencies between blocks to reduce description length.

View →
cs.ARcs.AIEmpiricalRecentJul 30, 2026

WitCert: Sound Runtime Risk Observability and Gating for KV-Cache Quantization

Fanzhe Wei, Li Liu

This paper introduces a provably sound runtime meter for KV-cache quantization to ensure compression does not damage the served request in real-time.

View →
cs.ARcs.DCEmpiricalRecentOct 24, 2026

ZipFusion: Fusing Lossless KV Decompression with Attention for Efficient LLM Decoding

Yuetao Chen, Peng Wang, Hong Xu

This paper presents ZipFusion, a method that enables attention to consume losslessly compressed key-value (KV) cache directly, improving model decode throughput and reducing memory-bandwidth bound.

View →
cs.ITTheoreticalRecentJun 24, 2026

The Condition for Structured Coding to Improve Random Coding in the Binary Modulo-sum Problem

Yohsuke Tsujino, Shun Watanabe

This paper analytically characterizes the conditions under which multi-letter extended AH coding improves upon SW coding in the modulo-sum problem.

View →