Fast, modern C++ DSP framework, FFT, Sample Rate Conversion, FIR/IIR/Biquad Filters (SSE, AVX, AVX-512, ARM NEON)
-
Updated
May 7, 2024 - C++
Fast, modern C++ DSP framework, FFT, Sample Rate Conversion, FIR/IIR/Biquad Filters (SSE, AVX, AVX-512, ARM NEON)
Ocean Simulation Based on a Model By Keith Lantz (https://www.keithlantz.net/)
The Marinchip/Autodesk/Fourmilab floating point benchmark, used since 1980 to evaluate the performance of machines and compilers on trigonometry-intensive floating point computations
Multi-dimensional arrays (or tensors) for performing numpy like operations (Fun Project in Development)
A Volume Integral Equation-Fast Fourier Transform Method for Modeling Optical Response of Nanostructures
Real-time ocean simulation developed in C++/OpenGL, that employs Fast Fourier Transform (FFT), inspired by Jerry Tessendorf's paper 'Simulating Ocean Water'. Parallelized using OpenCL and features physically-based rendering (PBR), image-based lighting (IBL) for enhanced realism, and an HDR skybox for a dynamic and immersive sky.
Semester-3 Exploratory Project on "Parallel Programming" under the guidance of Dr. Lavanya Selvaganesh
Simulate the output of simple combinations of several analog/digital inputs
The Marinchip/Autodesk/Fourmilab floating point benchmark, used since 1980 to evaluate the performance of machines and compilers on trigonometry-intensive floating point computations
An implementation of the Radix-2 Decimation-In-Time (DIT) form of the Cooley-Tukey FFT algorithm, as well as its inverse. The algorithm is used to multiply 2 polynomials and compute the convolution of 2 vectors in O(nlogn) time.
Fast Fourier Transform algorithm implementation
This is a basic code for fast fourier transform based on Cooley-Turkey method.
Fast Fourier Transform Algorithm / Number Theoretic Transform
Solving circulant linear systems using FFT
Radix-2 Out-of-Place DIT FFT Algorithm for 1D Real Input
Distributed Fast Fourier Transforms for heterogeneous GPU Systems
Fork: OTFFT-6.5 (OK Ojisan's Template FFT) - a C++ Template-based Fast Fourier Transform Library
A library that helps the user to perform all arithematic operations on big integers having up to 1000 digits.
Практика с курс "Алгоритмы и модели вычисления"
computaional toolbox for solving Radiative Transport Equations
Add a description, image, and links to the fast-fourier-transform topic page so that developers can more easily learn about it.
To associate your repository with the fast-fourier-transform topic, visit your repo's landing page and select "manage topics."