使用位移的快速数字卷积
Fast Digital Convolutions using Bit-Shifts
AI总结:
提出一种无乘法、无量化误差的精确一对一变换,用于任意2的幂次长度的数字循环卷积,通过模素数下的位移和加法实现。
摘要:
提出了一种精确的一对一变换,该变换不仅允许数字循环卷积,而且对于任意2的幂次变换长度,无需乘法和量化误差。该变换类似于离散傅里叶变换,其中标准谐波被一组仅使用位移和模素数加法计算的循环整数替代。素数可以选择为当代字长,或者对于加密或数据隐藏应用选择非常大的数。该变换是通过Carmichael定理对Rader变换的扩展。这些性质允许精确卷积,不受数值溢出影响,并可以利用快速傅里叶变换算法。
英文摘要:
An exact, one-to-one transform is presented that not only allows digital circular convolutions, but is free from multiplications and quantisation errors for transform lengths of arbitrary powers of two. The transform is analogous to the Discrete Fourier Transform, with the canonical harmonics replaced by a set of cyclic integers computed using only bit-shifts and additions modulo a prime number. The prime number may be selected to occupy contemporary word sizes or to be very large for cryptographic or data hiding applications. The transform is an extension of the Rader Transforms via Carmichael's Theorem. These properties allow for exact convolutions that are impervious to numerical overflow and to utilise Fast Fourier Transform algorithms.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。