Search Results for "embarcadero fft fourier"
Sort By:
Showing 34 open source projects for "embarcadero fft fourier"
View related business solutions-
SKUDONET ADC, operates at the application layer, efficiently distributing network load and application load across multiple servers. This not only enhances the performance of your application but also ensures that your web servers can handle more traffic seamlessly.
-
Built for growing businesses and well-established enterprises alike, Multiview is a highly scalable and robust ERP.
-
1
AbstractFFTs.jl
A Julia framework for implementing FFTs
A general framework for fast Fourier transforms (FFTs) in Julia. This package is mainly not intended to be used directly. Instead, developers of packages that implement FFTs (such as FFTW.jl or FastTransforms.jl) extend the types/functions defined in AbstractFFTs. This allows multiple FFT packages to co-exist with the same underlying fft(x) and plan_fft(x) interface. -
2
NFFT
The official NFFT library repository
NFFT is a software library, written in C, for computing non-equispaced fast Fourier transforms and related variations. -
3
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. More info by clicking below: https://advantrigoncalc.sourceforge.io/ Advanced Trigonometry Calculator was only and always only developed by the Portuguese Renato Alexandre dos Santos Freitas. Also author of poems,... -
4
FFTW++ is a C++ header class for the FFTW Fast Fourier Transform library that automates memory allocation, alignment, planning, wisdom, and communication on both serial and parallel (OpenMP/MPI) architectures. In 2D and 3D, hybrid dealiasing of convolutions substantially reduces memory usage and computation time. Wrappers for C, Python, and Fortran are included.
-
Vertex AI offers everything you need to build and use generative AI—from AI solutions, to Search and Conversation, to 130+ foundation models, to a unified AI platform.
-
5
libdspl-2.0
libdspl-2.0 is opensource cross-platform digital signal processing alg
libdspl-2.0 — opensource cross-platform digital signal processing algorithm library, written in C language. Distributed under LGPL v3 license. This allows to use this library in all applications with dynamic linking. -
6
Book-Reviews-In-Mathematica
Partial Differential Equations, Complex Analysis, Mathematica, Farlow
Cliff* Notes, Mathematica Evaluatable "Partial Differential Equations for Scientists and Engineers", Farlow "Physics for Scientists and Engineers", Serway "A First Course in Complex Analysis", Beck "PDE", Asmar "PDE, An Introduction", Colton "Elementary Differential Equations", 7th, Rainville "Ordinary Differential Equations", Tenenbaum "Linear Algebra And It's Applications", Lay "Swokowski Calculus", 5th, Swokowski "Chemistry Concepts & Problems, A Self-Teaching Guide", Houk "Openstax... -
7
Eleana
Program for the analysis of spectroscopic data, in particular EPR(ESR)
... / differentiation, pseudomodulation, filtering, etc. More advanced functions are: Forward / Inverse Fourier Transforms, Hilbert Transforms, Nonlinear Curve Fit, Global Analysis Fit of Multiple Curves, and many other. It is also possible to create your own plugins extending Eleana's functionality. -
8
Description and detailed explanation on Fourier Transform, some FFT, LPC etc. Runable project demonstrates DCT transform on continuous audio, show and edit audio source with different zooming and view.
-
9
displaysound_chung
display, record, add special effects
displaysound chung is a small program to display the selected input sound port (for example the system input mixer of the computer , or the mic microphone ) data in a scope like or spectrum FFT fourier window. or midi keyboard. Is writtten in easy fast freebasic . Can record,playrec, saveasMP3, loadMP3 (added 01/2022) with automatic level record and autostart/stop rec max 20mn flat0=auto flat spectrum, flat1=auto clone spectrum, (4096 band equalizer exciter enhancer) usage example : correct... -
Computing infrastructure in predefined or custom machine sizes to accelerate your cloud transformation. General purpose (E2, N1, N2, N2D) machines provide a good balance of price and performance. Compute optimized (C2) machines offer high-end vCPU performance for compute-intensive workloads. Memory optimized (M2) machines offer the highest memory and are great for in-memory databases. Accelerator optimized (A2) machines are based on the A100 GPU, for very demanding applications.
-
10
radio_vocoder_FFT
a vocoder + equalizer + FFT effects version of radio_chung
radio vocoder chung is a vocoder + linear equalizer(s) + FFT effect(s) version of radio chung free internet web radio stream url and audio file generic path player ( * ,mp3,*name*.ogg,wav,...) with dsp(s) (baxandall , resonance , automod , decay , flat , noisered , speed , feedback ) using bass.dll , gui_chung , FFTdll.dll fft fast fourier transform and freebasic .high quality small pitch shift shifting for radio url . added record, playrec, save as MP3 , feedback , anticlick . -
11
resonance_chung free VST plugin effect
piano like variable dynamic reverb
resonance chung is a free gpl open source VST plugin variable dynamic reverb sound effect compatible with VST steinberg, fb_chungVST , midipiano_chung , freemp3_chung , dsp_chung , radio _chung music plugins support. It aims to simulate the increase of reverberation with the number of played notes like in a real acoustic piano . a quick fft small fourier transform is used to estimate a number of played notes and modify the reverb rate in real time. Is written in easy fast freebasic . -
12
DarkF
DarkF is an FFT optical simulation code for GW inteferometers
... (larger than a mirror) and a sampling rate of 256*256). With the Fourier transform method, it is easy to obtain a propagated beam and we can use this code to simulate a simple or a complex system as a Fabry Perot cavity or Advanced detector, like Advanced Virgo, Advanced LIGO or Kagra. It can include reflection and transmission maps from measurements or real mirrors. -
13
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
-
14
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.) AAFFT, implemented by Mark Iwen in 2008. This code is easy to use, and documented well, but not implemented very... -
15
HPC Challenge
HPC Challenge is an HPC benchmark for memory access patterns
...) - 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 -
16
A More Accurate Fourier Transform
Computes Accurate Fourier Transform via Explicit Integration not FFT
Fourier transform methods are used to analyze functions and data sets to provide frequencies, amplitudes, and phases of underlying oscillatory components. Fast Fourier transform (FFT) methods offer speed advantages over evaluation of explicit integrals (EI) that define Fourier transforms. It has been shown recently that EI methods can be more accurate than FFT methods (Courtney and Courtney, A More Accurate Fourier Transform) for scientific data analysis and that EI methods can be implemented... -
17
Generic simple and efficient Fast Fourier Transforms (FFT) implementation using policy-based design and template metaprogramming in C++
-
18
FFTL
Templated Fast Fourier Transform in C++
Now moved to GitHub: https://github.com/CoreyShay/FFTL Provides some relatively easier to use than normal templated FFT classes written in C++. This is currently still a work in progress, but the FFT portion (complex and real) both output the correct results, and the code executes very quickly, around only 30% or so slower than the much more difficult to compile FFTW on SSE enabled platforms. Though optimized code only runs on SSE (x86) based platforms, it's a very simple matter to port... -
19
StFFT
FFT on Structured text
Fast fourier transform algorithm written on IEC-61131-3 Structured text programming language for programmable logic controllers. Algorithm is split-radix FFT. StFFT is iterative contrary to more common recursive approach. Iterative solution was chosen because PLCs don't have support for recursion. For compatibility with as many as possible PLC models, algorithm have dependency only on sine and cosine functions. Dual licenced under LGPL and Commercial licence. For commercial licencing contact... -
20
QRealFourier
Qt-based FFT implementation
A Qt library for Fast Fourier Transform (FFT) of real samples. Based on the FFTReal library. -
21
Fast Fourier Transforms (FFT) for Multi-CPU (and RAM) Stress Testing. Shows detailed information about physical and logical processors in the system. Included CPU Benchmark feature for speed testing. Automatically utilizes and tests all CPU cores.
-
22
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. -
23
An implementation of the sparse FFT algorithms discovered by Mark Iwen and described in http://www.math.duke.edu/~markiwen/DukePage/Papers/JcFFTsubmit.pdf. Used for benchmarking in http://www.ima.umn.edu/preprints/jul2010/2326.pdf.
-
24
Program that does an FFT (Fast Fourier Transformation) algorithm on a 1 dimensional time buffer read from a file. It will display graphically.
-
25
A low memory scaling distributed 3D FFT library. The library is designed for calculating complex‐to‐complex Fast Fourier Transforms (FFT’s) on 3‐D distributed data. It is based on FORTRAN90 and MPI with the underlying FFT calculated using FFTW3.