arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2409.04077eess.SP
收藏

盲自适应量化器

Blind-Adaptive Quantizers

Aman Rishal Chemmala, Satish Mulleti

AI总结:

针对输入分布未知导致的量化失配问题,提出结合放大、模折叠与均匀量化的盲自适应方法,并利用展开技术恢复样本,以过采样换取更低失配与量化误差。

摘要:

采样和量化在数字信号处理中至关重要,但量化会引入误差,尤其是由于输入信号与量化器之间的分布不匹配所致。现有减少该误差的方法需要精确掌握输入分布,而这通常无法获得。为解决这一问题,我们提出一种盲且自适应的方法,无需输入分布的先验知识即可最小化分布不匹配。该方法采用包含放大和模折叠的非线性变换,随后接一个均匀量化器。理论分析表明,充分放大可使模折叠的输出分布接近均匀,从而降低高斯、指数和均匀等多种分布下的不匹配。为恢复真实量化样本,我们建议使用现有展开技术;尽管其需要大量过采样,但能有效降低不匹配和量化误差,提供类似预测编码策略的良好折中。

英文摘要:

Sampling and quantization are crucial in digital signal processing, but quantization introduces errors, particularly due to distribution mismatch between input signals and quantizers. Existing methods to reduce this error require precise knowledge of the input's distribution, which is often unavailable. To address this, we propose a blind and adaptive method that minimizes distribution mismatch without prior knowledge of the input distribution. Our approach uses a nonlinear transformation with amplification and modulo-folding, followed by a uniform quantizer. Theoretical analysis shows that sufficient amplification makes the output distribution of modulo-folding nearly uniform, reducing mismatch across various distributions, including Gaussian, exponential, and uniform. To recover the true quantized samples, we suggest using existing unfolding techniques, which, despite requiring significant oversampling, effectively reduce mismatch and quantization error, offering a favorable trade-off similar to predictive coding strategies.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑