Fast Algorithm for DFT (Discrete Fourier Transform)
Radix-2 FFT: A Fast Algorithm for Discrete Fourier Transform (DFT)
Explore MATLAB source code curated for "快速算法" with clean implementations, documentation, and examples.
Radix-2 FFT: A Fast Algorithm for Discrete Fourier Transform (DFT)
A rapid algorithm for adaptive chirplet decomposition, addressing the challenges of numerous unknown parameters and implementation difficulties. This algorithm computes the quadratic phase function of signals to determine energy concentration along chirp rate curves, enabling simultaneous estimation of chirplet parameters (chirp rate, time center, and amplitude) via spectral peak detection. Initial frequency and bandwidth estimates are obtained through de-chirping techniques. The effectiveness of this method is validated through simulation results.
A fast algorithm for computing third-order cumulants of cyclostationary signals with implementation insights and computational efficiency improvements.
MATLAB source code implementation of Mallat's fast algorithm for 2D discrete wavelet transform, featuring multi-level decomposition and reconstruction of images with comprehensive algorithm explanations and key function descriptions.
Implementation of the CVPR best paper award-winning dark channel prior image dehazing algorithm with soft matting, featuring algorithm improvements including color distortion correction and a fast algorithm achieving soft matting effects
Fractional Fourier transform program featuring a fast algorithm based on interpolation, decimation operations, and convolution computations.
MATLAB source code designed for auxiliary wavelet analysis and applications, featuring implementations of common conventional algorithms and fast algorithms for wavelet analysis. This repository serves as an effective learning tool for understanding wavelet transform principles through practical code examples.
This resource presents both standard and optimized fast algorithms for calculating correlation functions of cyclostationary signals, complete with implementation examples and practical applications to assist researchers and engineers.
The core principle of the fast median filtering algorithm introduced in this paper is that during the sliding window movement process on the original data sequence, the current window only needs to remove its earliest element and incorporate the new element following the window to form the content of the next window. This implementation corresponds to pre-packaged algorithm code in MATLAB, designed for optimized computational efficiency.
Fast ICA, a rapid independent component analysis algorithm with complete research papers available in two formats (PDF and PS), featuring efficient implementation and signal separation capabilities.