Search Results for "embarcadero fft fourier"
Sort By:
Showing 14 open source projects for "embarcadero fft fourier"
View related business solutions-
Our Free Plans just got better! | Auth0 by OktaYou 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 secuirty. Auth0 now, thank yourself later.
-
Bright Data - All in One Platform for Proxies and Web ScrapingBright Data offers the highest quality proxies with automated session management, IP rotation, and advanced web unlocking technology. Enjoy reliable, fast performance with easy integration, a user-friendly dashboard, and enterprise-grade scaling. Powered by ethically-sourced residential IPs for seamless web scraping.
-
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
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.
-
4
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. -
ManageEngine Endpoint Central for IT ProfessionalsManageEngine's Endpoint Central is a Unified Endpoint Management Solution, that takes care of enterprise mobility management (including all features of mobile application management and mobile device management), as well as client management for a diversified range of endpoints - mobile devices, laptops, computers, tablets, server machines etc. With ManageEngine Endpoint Central, users can automate their regular desktop management routines like distributing software, installing patches, managing IT assets, imaging and deploying OS, and more.
-
5
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. -
6
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... -
7
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... -
8
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... -
9
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.
-
Create state-of-the-art conversational agents with Google AIDialogflow can analyze multiple types of input from your customers, including text or audio inputs (like from a phone or voice recording). It can also respond to your customers in a couple of ways, either through text or with synthetic speech. Dialogflow CX and ES provide virtual agent services for chatbots and contact centers. If you have a contact center that employs human agents, you can use Agent Assist to help your human agents. Agent Assist provides real-time suggestions for human agents while they are in conversations with end-user customers.
-
10
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.
-
11
This project is to implement a kind of educational program which will demonstrate FFT algorithm and help students better understand Fourier transformation.
-
12
-
13
A digital signal processing library for Microsoft .NET platform written in C#. Features complex number data types, a complex number math library and both real and complex number fast fourier transforms (FFT).
-
14
The Arbitrarily-Decomposed MPI FFT library is a C subroutine library for the computation of the multidimensional Fast Fourier Transform (FFT) of a distributed grid using the Message-Passing Interface (MPI).
- Previous
- You're on page 1
- Next