Low-Bit Quantization of Bandlimited Graph Signals via Iterative Methods

We study the quantization of real-valued bandlimited signals on graphs, focusing on low-bit representations. We propose iterative noise-shaping algorithms for quantization, including sampling approaches with and without vertex replacement. The methods leverage the spectral properties of the graph Laplacian and exploit graph incoherence to achieve high-fidelity approximations. Theoretical guarantees are provided for the random sampling method, and extensive numerical experiments on synthetic and real-world graphs illustrate the efficiency and robustness of the proposed schemes.

Source: arXiv:2601.18782v1 - http://arxiv.org/abs/2601.18782v1 PDF: https://arxiv.org/pdf/2601.18782v1 Original Link: http://arxiv.org/abs/2601.18782v1