8点基二fft Fast Fourier Transform (FFT). Using 8 points, takes about 1.2 ms to execute one FFT. Se
8点基二fft Fast Fourier Transform (FFT). Using 8 points, takes about 1.2 ms to execute one FFT. Sets up General Purpose Timer 1 to generate events a...
wavelet transform技术资料
资源总数：175
wavelet transform热门资料
查看全部175个资源 »fftw,the fastest fourier transform in the West。用于快速计算离散傅里叶变换
fftw,the fastest fourier transform in the West。用于快速计算离散傅里叶变换，用c编程...
dom4j与Transform配合操作XML文档,并调用Xslt进行格式化的例子
dom4j与Transform配合操作XML文档,并调用Xslt进行格式化的例子...
object recognition using fast adaptive hough transform 快速自适应霍夫变换 作者：D.D. Haule. A.S. Malowany Comp
object recognition using fast adaptive hough transform 快速自适应霍夫变换 作者：D.D. Haule. A.S. Malowany Computer Vision and Robotics Laboratory Department of...
A set of C++ and Matlab routines implementing the surfacelet transform surfacelet的一个非常好用的工具箱
A set of C++ and Matlab routines implementing the surfacelet transform surfacelet的一个非常好用的工具箱...
wavelet transform资料分类