20 results for “CSI compression”
CS papers onlyHybrid search: Keyword + semantic, ranked by combined score.ⓘ
Want pure semantic search? Try claim verification →
This paper proposes a context-aware compression framework for neural channel state information (CSI) in FDD systems with limited feedback resources.
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.
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.
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.
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.
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.
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…
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.
A Set Shaping Theory transformation reduces the average universal coding length of uniformly generated sequences.
This paper introduces a structural theorem for the sparsifiability of real-valued codes, which generalizes both combinatorial and continuous notions of sparsification.
This paper proposes two affine models to account for non-idealities in SAR ADCs in massive MU-MIMO wireless systems.
The authors extend the Block Decomposition Method (BDM) to utilize dependencies between blocks to reduce description length.
This paper introduces a provably sound runtime meter for KV-cache quantization to ensure compression does not damage the served request in real-time.
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.
This paper analytically characterizes the conditions under which multi-letter extended AH coding improves upon SW coding in the modulo-sum problem.