Search Results for "inverse discrete fourier transform"
Sort By:
Showing 21 open source projects for "inverse discrete fourier transform"
View related business solutions-
Try Google Cloud Risk-Free With $300 in CreditUse your credit across every product. Compute, storage, AI, analytics. When it runs out, 20+ products stay free. You only pay when you choose to.
-
MongoDB Atlas runs apps anywhereMongoDB Atlas gives you the freedom to build and run modern applications anywhere—across AWS, Azure, and Google Cloud. With global availability in over 115 regions, Atlas lets you deploy close to your users, meet compliance needs, and scale with confidence across any geography.
-
1
WavTokenizer
SOTA discrete acoustic codec models with 40/75 tokens per second
...Its architecture incorporates a broader vector-quantization space, extended contextual windows, and improved attention networks, combined with multi-scale discriminators and inverse Fourier transform blocks to enhance waveform reconstruction. Extensive experiments show that WavTokenizer matches or surpasses previous neural codecs across speech, music, and general audio on both objective metrics and subjective listening tests. -
2
sleef
Vectorized libm
SLEEF stands for SIMD Library for Evaluating Elementary Functions. SLEEF implements vectorized versions of all C99 math functions, that utilize SIMD instructions of modern processors to make computation more efficient. The library also includes vectorized DFT subroutines. -
3
C++ FFT
C++ radix 2 & 3 multi-dimension complex FFT & graphical test program
This C++ code does radix 2 & 3 multi-dimension (any) complex FFT and its inverse. Array dimensions with sizes that are not 2^m 3^n are automatically zero-padded to the nearest larger size integer of the form 2^m 3^n. The new array has the original data centered, except when a dimension size is increased by an odd number, the zero padding on the left is one less than the zero padding on the right. This FFT code is in is own namespace and is in one source file and one include file. There is... -
4
Advanced Trigonometry Calculator
Precision Trigonometry: Advanced Calculator for Complex Math
Advanced Trigonometry Calculator is equipped with a user-friendly interface that allows for easy input of problems and instant computation. Professionals such as engineers who need to perform advanced trigonometric calculations in their work will find this tool extremely useful. ATC Online Alpha: https://advantrigoncalc.sourceforge.io/atc/ More info by clicking below: https://advantrigoncalc.sourceforge.io/ Advanced Trigonometry Calculator was only and always only developed by... -
Our Free Plans just got better! | Auth0You asked, we delivered! Auth0 is excited to expand our Free and Paid plans to include more options so you can focus on building, deploying, and scaling applications without having to worry about your security. Auth0 now, thank yourself later.
-
5
NFFT
The official NFFT library repository
NFFT is a software library, written in C, for computing non-equispaced fast Fourier transforms and related variations. -
6
vocoder chung is a small educational vocoder using discrete fourier transform FFT spectrum written in easy fast compiled freebasic . (24/12/2019) uses fast and accurate FFTdll.dll (28/03/2020) algorythmic voice cloning / change / morphing experiment added
-
7
VStar
Multi-platform Variable Star Visualisation and Analysis
VStar is a multi-platform, easy-to-use variable star observation visualisation and analysis tool. Data can be read from a file or the AAVSO database, light curves and phase plots created, period analysis performed, and filters applied. Plugins can be developed, e.g. to make additional observation sources available. See also: 1. http://www.aavso.org/vstar-overview 2. http://www.aavso.org/forums/about-aavso/vstar 3. http://dbenn.wordpress.com/category/astronomy-science/vstar 4.... -
8
MACE Algebraic Calculator
MACE is a Mathematical program for Algorithms, Calculations, Equations
...MACE can also calculate with complex numbers, integral residue classes and complex differentiable functions. In the latest release MACE has got: + Sequences as variable containers and discrete signals. + A Signal Processing section including the (fast) (inverse) Fourier transform, several filters and fir / iir Systems + bug fixes -
9
Finite Transform Library
A Library is for Finite Transforms
The Library is for Finite Transforms such as the Number Theoretic Transform (NTT) and Finite Radon Transform (FRT). Current modules include NTTW for NTTs with high resolution (microsecond) timing, basic array and imaging. The transforms are optimised for performance. -
Full-stack observability with actually useful AI | Grafana CloudBuilt on open standards like Prometheus and OpenTelemetry, Grafana Cloud includes Kubernetes Monitoring, Application Observability, Incident Response, plus the AI-powered Grafana Assistant. Get started with our generous free tier today.
-
10
karaoke chung is a mp3 player version of mp3tomid_chung , using the discrete fourier transform of mp3tomid_chung to add resynthesis special effects to the played mp3 sound (no it's not a karaoke) .It is written in easy fast freebasic ; Otherwise, can be used as an ordinary mp3 player with playlist , speed , repeat ,autovolcomp, equ effects.. .
-
11
MSU's Sparse Fourier Repository
The Home of DMSFT, AAFFT, GFFT, and MSFFT.
A collection of sparse Fourier transform codes developed by faculty at MSU. Currently codes for four different prototype sparse FFTs are here: 1.) DMSFT, implemented by Ruochuan Zhang. This is a fast, stable, noise robust, and *fully discrete* improvement on the ideas in GFFT below. It is THE BEST sparse FFT around!!! If you're looking for AAFFT, try this out first. 2.) -
12
HPC Challenge
HPC Challenge is an HPC benchmark for memory access patterns
HPC Challenge benchmark consists of 7 tests: (1) HPL - the Linpack TPP benchmark which measures the floating point rate of execution for solving a linear system of equations. (2) DGEMM - measures the floating point rate of execution of double precision real matrix-matrix multiplication. (3) STREAM - a simple synthetic benchmark program that measures sustainable memory bandwidth (in GB/s) and the corresponding computation rate for simple vector kernel. (4) PTRANS (parallel matrix transpose) - exercises the communications where pairs of processors communicate with each other simultaneously - a useful test of the total communication capacity of the network. (5) RandomAccess - measures the rate of integer random updates of memory (GUPS). (6) FFT - measures the floating point rate of execution of double precision complex one-dimensional Discrete Fourier Transform (DFT). (7) Communication bandwidth and latency test for simultaneous communication patterns. http://icl.cs.utk.edu/hpcc -
13
Brainwave Analyzer
Discrete Fourier Transform of Brainwaves
The Brainwave Analyzer is NOT a finished program. So far it does do Discrete Fourier Transform of brainwaves (very slow), but does not yet do Fast Fourier Transform of brainwaves, nor does it yet calculate frequency. (Later more complete versions should be coming over the next few months.) Written in C# 2010 Access file and csv sample files included. Program assumes that access file is at: C:\Openvibe\OpenVibe.accdb The Brainwave Analyzer is a free open source program written by ??? ... -
14
ICE (Interval Calculator for Engineer)
Interval Calculator for Engineer
ICE is a simple mathematical calculator with very useful shortcuts for Engineer: works natively with tolerance, can run Monte Carlo analysis, uses engineer notation, includes most of the day by day functions used by engineers. -
15
KL1p
A portable C++ library for Compressed Sensing
KL1p is a portable C++ framework for handling sparse recovery of inverse problems of underdetermined linear systems, like in compressed sensing technique. -
16
Fast Matrix for Java
General purpose matrix utilities for Java in Parallel Computing
Fast Matrix for Java (fm4j) is a general-purpose matrix utility library for computing with dense matrices. fm4j encapsulated different underlying implementations and select the optimal one in run-time depending on the size of the input matrix. Moreover, fm4j employs Java (Tm) Concurrency to take advantage of the computation power of multi-cor processors. -
17
This program is intended as an educational tool to explain the concept of Discrete Fourier Transform (DFT). It uses the Fast Fourier Transform to calculate the DFT of a given arbitrary time domain signal and plots it graphically.
-
18
tiny-DSP library
small and fast library dealing with signal processing
Tiny-DSP library contains c sources of a fast, tiny, portable and generic FFT (Fast Fourier transform) and inverse FFT. Supported are all power of two sizes (like 2,4,8,16,32,...) for one and two dimensional floating point arrays. -
19
FFTW
Fast Fourier Transform Library (FFTW)
A C subroutine library for computing the discrete Fourier transform (DFT) in one or more dimensions, of arbitrary input size, and of both real and complex data. -
20
Fast-Fourier-Transform-based number theory code to test Mersenne numbers for primality using the Lucas-Lehmer test and the Crandall-Fagin irrational-base discrete weighted transform (IBDWT) algorithm (Math. Computation 62 (205), pp.305-324, January 1994)
-
21
Ekstasis
A digital signal processing (DSP) framework (w/ audio to midi focus)
...Tools for creating and destroying the communication queues, loading/saving PCM 44100 Hz to/from the signal processing chain, windowing the data (currently only a Hann windowing function module), performing a Discrete Fourier Transform (DFT) on the data (using FFT, currently only real part), detecting the presence of an event within a data segment/packet via normalized spectral signature matching/comparison, and the generation of a midi file from the detection of said patterns (i.e., event occurrences) as output are currently available.
- Previous
- You're on page 1
- Next
