Description: 用c语言实现下列的数字信号处理算法
1．离散傅里叶级数合成连续周期信号
2．DIF FFT 测试程序
3．将输入数据的幅度画出图形
4．使用FFT实现快速卷积
5．使用FFT实现快速相关
6．取样混迭演示程序
-language used to achieve the following digital signal processing algorithms 1. Discrete Fourier series synthetic signal two consecutive cycles. DIF FFT three test procedures. The input data rate of 4 paint graphics. Use FFT fast convolution 5. Use FFT fast correlation 6. Aliasing sampling Demonstration Program Platform: |
Size: 19741 |
Author:胡叶 |
Hits:
Description: 快速卷积算法实现，使用MFC实现界面，适合数字信号处理的初学者。-fast convolution algorithm, using MFC interface, digital signal processing for beginners. Platform: |
Size: 37680 |
Author:gwen |
Hits:
Description: 关于二维小波变换的程序 [精华]
说明：此算法重在概念，速度并不是很快。因为FOR循环的缘故。此程序从循环矩阵的观点出发，把圆周卷积和快速幅里叶变换建立了联系。实现了分解和无失真重构。它只做了一层分解，即将256x256图形分解成为64x64的四个图形，避免了使用WKEEP()的困惑。主要思想为用小波滤波器族构造正交阵W,变换写为B=W*A*W ,反变换为：A=W *A*W,这与所有正交变换无异。W为循环正交矩阵，因此可用FFT实现快速运算，难点就在重构矩阵上。若用矩阵概念明确，一个共扼转置可以搞顶。但FFT的使用必须找到与分解序列的关系。-on Wavelet Transform procedures [best] Note : This algorithm important concept is not speed quickly. Because FOR cycle nowadays. This program cycle from the point of view of Matrix, circular convolution and fast Fourier transform is established links. To achieve the decomposition and reconstruction without distortion. It only had one decomposition, 256x256 graphics will be 64x64 decomposition of the four graphics, avoiding the use of WKEEP () confusion. The main idea of using wavelet filter generator orthogonal array W, write to transform B = W* A* W, anti-Transform : A = W* A* W, which is orthogonal transformation all the same. W cycle orthogonal matrix, can be used to achieve rapid FFT computation, on the difficult reconstruction matrix. If a clear matrix concept, a home to a total o Platform: |
Size: 3072 |
Author:罗松溪 |
Hits:
Description: 利用循环卷积和线性卷积之间的关系，用FFT和IFFT的现有程序实现信号线性卷积快速实现-cyclic and linear convolution convolution of the relationship between FFT and IFFT with the existing procedures of linear convolution signal Fast Platform: |
Size: 21504 |
Author:孙涛 |
Hits:
Description: 自编的快速小波变换mallat算法，使用‘db1’小波函数，在卷积时使用wkeep命令进行了数据截取。重构信号和原信号比较误差较小。-self fast wavelet transform Mallat algorithm, the use of 'db1' wavelet function, Convolution in the use of wkeep order the interception of data. Reconstruction of the original signal and signal more smaller error. Platform: |
Size: 1024 |
Author:高锋 |
Hits:
Description: 用c语言实现下列的数字信号处理算法
1．离散傅里叶级数合成连续周期信号
2．DIF FFT 测试程序
3．将输入数据的幅度画出图形
4．使用FFT实现快速卷积
5．使用FFT实现快速相关
6．取样混迭演示程序
-language used to achieve the following digital signal processing algorithms 1. Discrete Fourier series synthetic signal two consecutive cycles. DIF FFT three test procedures. The input data rate of 4 paint graphics. Use FFT fast convolution 5. Use FFT fast correlation 6. Aliasing sampling Demonstration Program Platform: |
Size: 19456 |
Author:胡叶 |
Hits:
Description: 快速卷积算法实现，使用MFC实现界面，适合数字信号处理的初学者。-fast convolution algorithm, using MFC interface, digital signal processing for beginners. Platform: |
Size: 37888 |
Author:gwen |
Hits:
Description: 1．通过实验加深对快速傅立叶变换（FFT）基本原理的理解。
2．了解FFT点数与频谱分辨率的关系，以及两种加长序列FFT与原序列FFT的关系。
离散傅里叶变换（DFT）和卷积是信号处理中两个最基本也是最常用的运算，它们涉及到信号与系统的分析与综合这一广泛的信号处理领域。实际上卷积与DFT之间有着互通的联系：卷积可化为DFT来实现，其它的许多算法，如相关、滤波和谱估计等都可化为DFT来实现，DFT也可化为卷积来实现。-1. Deepen the experimental fast Fourier transform (FFT) the basic tenets of understanding. 2. Understand the FFT spectrum and points of the resolution, and two extended sequence with the original FFT FFT relations. Discrete Fourier Transform (DFT) and the convolution of two signal processing is the most commonly used basic arithmetic, they relate to the signal and system analysis and synthesis of the wide range of signal processing field. DFT actually convolution and interoperability between contact : DFT into convolution can be achieved in many other algorithms, If relevant, filtering and spectral estimation could be achieved as DFT, DFT into convolution can be achieved. Platform: |
Size: 3072 |
Author:深蓝 |
Hits:
Description: 图形算法合集4：快速线性插值、半色调技术、使用lookup查找表的快速卷积、Nurbs曲面三角化等等。-Graphical Collection 4: rapid linear interpolation, halftoning techniques, the use of look-up table lookup fast convolution, Nurbs surface triangulation and so on. Platform: |
Size: 354304 |
Author:metallica |
Hits:
Description: 本文件包含三个小程序，分别为用fft实现功率谱估计、实现快速卷积和快速相关。对了解fft在c中的编程很有帮助-This document contains three procedures were used to achieve power spectrum estimation fft, fast convolution and fast correlation. Fft to know programming in c in the helpful Platform: |
Size: 13312 |
Author:魏玮 |
Hits:
Description: 很全的数字信号C语言资料，包括：数字信号的产生，数字信号处理（FFT计算等），快速离散正交变换，快速卷积与相关，数字滤波器的时域和频域相应，IIR数字滤波器的设计，FIR数字滤波器的设计，以及谱估计，数字图像处理，人工神经网络方面的内容-The digital signal is full C language, including: the emergence of digital signal, digital signal processing (FFT calculation, etc.), fast discrete orthogonal transform, fast convolution and correlation, digital filter in time domain and corresponding frequency domain, IIR digital filter design, FIR digital filter design, as well as the spectral estimation, digital image processing, artificial neural network aspects Platform: |
Size: 6790144 |
Author:李元柳 |
Hits:
Description: This package contains some MatLab tools for multi-scale image
processing. Briefly, the tools include:
- Recursive multi-scale image decompositions (pyramids), including
Laplacian pyramids, QMFs, Wavelets, and steerable pyramids. These
operate on 1D or 2D signals of arbitrary dimension. Data
structures are compatible with the MatLab wavelet toolbox.
- Fast 2D convolution routines, with subsampling and boundary-handling.
- Fast point-operations, histograms, histogram-matching.
- Fast synthetic image generation: sine gratings, zone plates, fractals, etc.
- Display routines for images and pyramids. These include several
auto-scaling options, rounding to integer zoom factors to avoid
resampling artifacts, and useful labeling (dimensions and gray-range).
-This package contains some MatLab tools for multi-scale image
processing. Briefly, the tools include:
- Recursive multi-scale image decompositions (pyramids), including
Laplacian pyramids, QMFs, Wavelets, and steerable pyramids. These
operate on 1D or 2D signals of arbitrary dimension. Data
structures are compatible with the MatLab wavelet toolbox.
- Fast 2D convolution routines, with subsampling and boundary-handling.
- Fast point-operations, histograms, histogram-matching.
- Fast synthetic image generation: sine gratings, zone plates, fractals, etc.
- Display routines for images and pyramids. These include several
auto-scaling options, rounding to integer zoom factors to avoid
resampling artifacts, and useful labeling (dimensions and gray-range).
Platform: |
Size: 2065408 |
Author:not applicable |
Hits:
Description: 本程序的主要内容是实现了数字信号处理的快速卷积算法。经过证明，此算法较其他的算法有相当的优势。-The main content of this program is to achieve a fast convolution algorithm for digital signal processing. Proven, this algorithm has a considerable advantage over other algorithms.
Platform: |
Size: 2048 |
Author:徐斌 |
Hits:
Description: 探索卷积的不同的实现方法，而非用matlab中的卷积命令(explore how this can be calculated efficiently using the FFT. This entails understanding the
difference between linear and circular convolution. We will explore using the FFT and compare it with a conventional
direct implementation of the convolution. To obtain the greatest advantage of the fft all the filters that we will use
have a sample length that is an integer power of 2. In general, it is always possible to pad an FIR filter with zeros to
achieve this.) Platform: |
Size: 580608 |
Author:Jessicapu |
Hits:
Search - fast convolution