搜索结果

　离散余弦变换对图象信号有近似最优的去相关能力, 但多维的变换公式一直没有给出. 为此深入研究了 三维离散余弦变换, 提出了任意尺寸的三维函数f (x , y , z ) 的正交离散余弦变换公式, 克服了以前系数的取值必须 相等的缺点, 并将之应用于彩色静止图象的压缩编码中, 使得彩色图象的R、G、B 3 帧可以作为一个整体同时进行 ...

I. C. Wong, Z. Shen, J. G. Andrews, and B. L. Evans, ``A Low Complexity Algorithm for Proportional Resource Allocation in OFDMA Systems , Proc. IEEE Int. Work. Signal Processing Systems, 针对这篇文章给出的源代码

Getting to Know the FFT What is the FFT? FFT = Fast Fourier Transform. The FFT is a faster version of the Discrete Fourier Transform (DFT). The FFT utilizes some clever algorithms to do the same thing as the DTF, but in much less time.

Hilbert transform on ADSP chip (one from DSP steps)

This is a simple one dimensional Fast Fourier Transform (and Inverse FFT) test program. FFT(and Inverse FFT) is implemeted as a function. 2^n-point FFT is possible.

离散系统Z域分析 实验步骤： 主界面下进入实验六的“离散系统Z域分析”，输入分子多项式的系数向量 按照 z 降幂的顺序输入，如：，输入为。 输入分母多项式的系数向量，按照 z 降幂的顺序输入。 鼠标单击确定按钮，显示系统函数的幅频特性曲线，相频特性曲线。 ...

xZXZXZX, ZX, x<Z xx XZ

Fast Fourier Transform using MPI libraries (Source Code)

A basic Fourier transform identity coupled with an iterative convergence algorithm provides a powerful method to align band-limited signals.

Contourlet is a new approach in image transform. There have something better than Fourier and Wavalet transform.