fxt

Version: 2012-10-14
Entered-date: 2012-10-14
Description: FXT is a library implementing algorithms for: Fast Fourier Transform (FFT), complex and real-valued, Fast Hartley Transform (FHT). Convolution (cyclic, linear, weighted, and subset convolution), correlation and power spectrum. Number Theoretic Transform (NTT), Walsh Transform, Reed-Muller transform, Haar Transform, Wavelet Transform.
generation: Combinatorial generation: combinations, compositions, permutations, subsets, multisets, Gray codes, Catalan objects, necklaces, Lyndon words. Sorting, Searching, Stack (FIFO), Queue (LIFO), heap and priority-queue. Bit-manipulations, shift registers (LFSR), modular arithmetics and computations in binary finite fields GF(2**n).
http://www.jjj.de/fxt/
Keywords: Fourier transform Hartley transform number theoretic transform, Walsh transform, Haar transform, wavelet transform convolution, negacyclic convolution, right angle convolution correlation, spectrum, mass storage FFT, combinatorial generation (permutations, combinations) sorting, searching, data structures, bit-wizardry
Author: arndt@jjj.de (Joerg Arndt)
Maintained-by: arndt@jjj.de (Joerg Arndt)
http://www.jjj.de/fxt/
Platforms: Unix with a C++ compiler
Copying-policy: GPL

Note: Not all entries contain correct, complete filenames or URLs. FTP sites often refuse connections due to excessive traffic. If you have difficulty with the provided links to individual files, try the first link, which is usually to a directory or web site for the program as a whole.

Up to Linux Software Map