FXT is a C++ library containing code for various fast orthogonal transforms (Fourier-, Hartley-, Walsh-, Haar-, Wavelet-transform) and convolution. It contains a large collection of low (bit) level routines and combinatorial algorithms (permutations, combinations, necklaces, de Bruijn sequences). Number theoretic transforms and modular arithmetics are implemented. Operations on binary polynomials and arithmetics in finite fields GF(2^n) are included. The package contains more than 150 short programs that demonstrate how to use its functionality. (Source: http://freecode.com/)
Keywords for this software
References in zbMATH (referenced in 4 articles , 1 standard article )
Showing results 1 to 4 of 4.
- Chan, Swee Hong; Hollmann, Henk D.L.; Pasechnik, Dmitrii V.: Sandpile groups of generalized de Bruijn and Kautz graphs and circulant matrices over finite fields (2015)
- Fernández, Antonio; Álvarez, Marcos X.; Bianconi, Francesco: Texture description through histograms of equivalent patterns (2013)
- Cantone, Domenico; Faro, Simone; Giaquinta, Emanuele: On the bit-parallel simulation of the nondeterministic Aho-Corasick and suffix automata for a set of patterns (2012)
- Arndt, Jörg: Matters computational. Ideas, algorithms, source code. (2011)