Begin4
Title:          fxt
Version:        2010-06-15
Entered-date:   2010-06-15
Description:    fxt is a library package implementing various algorithms for:
                Fast Fourier Transform (FFT), complex and real-valued,
                Fast Hartley Transform (FHT).  Convolution (cyclic, linear and
                weighted), correlation and power spectrum.
                Mass storage convolution and fast multiplication routines.
                Number Theoretic Transform (NTT), Walsh Transform,
                Reed-Muller transform, Haar Transform, Wavelet Transform.
                Combinatorial generation: Combinations, Permutations, subsets.
                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).
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, multiplication
                combinatorial generation (permutations, combinations)
                sorting, searching, data structures, bit-wizardry
Author:         arndt@jjj.de (Joerg Arndt)
Maintained-by:  arndt@jjj.de (Joerg Arndt)
Primary-site:   http://www.jjj.de/fxt/
Original-site:  http://www.jjj.de/fxt/
Platforms:      Unix with a C++ compiler
Copying-policy: GPL
End