Skip to main content
CenXiv.org
This website is in trial operation, support us!
We gratefully acknowledge support from all contributors.
Contribute
Donate
cenxiv logo > eess > arXiv:2510.02646

Help | Advanced Search

Electrical Engineering and Systems Science > Signal Processing

arXiv:2510.02646 (eess)
[Submitted on 3 Oct 2025 ]

Title: Rate-Adaptive Semantic Communication via Multi-Stage Vector Quantization

Title: 通过多阶段矢量量化实现速率自适应语义通信

Authors:Jinsung Park, Junyong Shin, Yongjeong Oh, Jihun Park, Yo-Seb Jeon
Abstract: This paper proposes a novel framework for rate-adaptive semantic communication based on multi-stage vector quantization (VQ), termed \textit{MSVQ-SC}. Unlike conventional single-stage VQ approaches, which require exponentially larger codebooks to achieve higher fidelity, the proposed framework decomposes the quantization process into multiple stages and dynamically activates both stages and individual VQ modules. This design enables fine-grained rate adaptation under varying bit constraints while mitigating computational complexity and the codebook collapse problem. To optimize performance, we formulate a module selection problem that minimizes task loss subject to a rate constraint and solve it using an incremental allocation algorithm. Furthermore, we extend the framework by incorporating entropy coding to exploit non-uniform codeword distributions, further reducing communication overhead. Simulation results on the CIFAR-10 dataset demonstrate that the proposed framework outperforms existing digital semantic communication methods, achieving superior semantic fidelity with lower complexity while providing flexible and fine-grained rate control.
Abstract: 本文提出了一种基于多阶段矢量量化(VQ)的速率自适应语义通信的新框架,称为\textit{MSVQ-SC}。与传统的单阶段VQ方法不同,后者需要指数级更大的码本以实现更高的保真度,所提出的框架将量化过程分解为多个阶段,并动态激活各个阶段和单独的VQ模块。这种设计在不同的比特约束下实现了细粒度的速率自适应,同时减轻了计算复杂性和码本崩溃问题。为了优化性能,我们提出了一个模块选择问题,在满足速率约束的前提下最小化任务损失,并使用增量分配算法进行求解。此外,我们通过引入熵编码扩展了该框架,以利用非均匀码字分布,进一步降低通信开销。在CIFAR-10数据集上的仿真结果表明,所提出的框架优于现有的数字语义通信方法,在实现更优语义保真度的同时具有更低的复杂度,并提供了灵活且细粒度的速率控制。
Subjects: Signal Processing (eess.SP)
Cite as: arXiv:2510.02646 [eess.SP]
  (or arXiv:2510.02646v1 [eess.SP] for this version)
  https://doi.org/10.48550/arXiv.2510.02646
arXiv-issued DOI via DataCite

Submission history

From: Yo-Seb Jeon [view email]
[v1] Fri, 3 Oct 2025 00:46:48 UTC (2,510 KB)
Full-text links:

Access Paper:

    View a PDF of the paper titled
  • View Chinese PDF
  • View PDF
  • HTML (experimental)
  • TeX Source
view license
Current browse context:
eess.SP
< prev   |   next >
new | recent | 2025-10
Change to browse by:
eess

References & Citations

  • NASA ADS
  • Google Scholar
  • Semantic Scholar
a export BibTeX citation Loading...

BibTeX formatted citation

×
Data provided by:

Bookmark

BibSonomy logo Reddit logo

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)
IArxiv Recommender (What is IArxiv?)
  • Author
  • Venue
  • Institution
  • Topic

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)
  • About
  • Help
  • contact arXivClick here to contact arXiv Contact
  • subscribe to arXiv mailingsClick here to subscribe Subscribe
  • Copyright
  • Privacy Policy
  • Web Accessibility Assistance
  • arXiv Operational Status
    Get status notifications via email or slack

京ICP备2025123034号