radix transform [数] 基数变换
For the integer DCT radix cannot be the unique within the same transform framework,finding the radix is another valuable research topic besides integer DCT theory. A generic generating algorithm for integer DCT transform radix is presented in this paper.
整数变换是其提高压缩性能最主要的改进方法之一,基于同样的整数变换过程的变换基可以不唯一,因此在整数变换的理论确定后,寻找变换基是一件重要的工作,提出了一种通用的变换基生成算法。
参考来源 - 整数DCT变换中变换基的通用生成算法 in C·2,447,543篇论文数据，部分数据来源于NoteExpress
The error of the decimate in time (DIT) radix-2 fast Fourier transform (FFT) is analyzed, where the data format is two's complement.
分析了按时间抽取（DIT）基-2快速傅里叶变换（FFT）的误差，数据格式为二进制补码。
Based on the prime radix DFT and number theory, an algorithm using the second order recursive filter and the zero factor prime radix Fourier Transform (ZFT) is presented.
从素基数DFT出发，应用数论理论讨论了一种应用二阶递归滤波结构的算法及零因子转换算法(ZFT)。
The radix-2 decimation-in-time algorithm based on 16-bit fixed-point operation and pipeline architecture are adopted in the core module IFFT(Inverse Fast Fourier Transform).
核心模块快速傅立叶逆变换（IFFT）采用基于16位定点运算的基-2时间抽取算法和流水线结构。
应用推荐