Transforms with $O(N \log N)$ Complexity

47 Views Asked by At

Beside the Discrete Fourier and Walsh-Hadamard operators, are there any non-trivial, bijective operators that admit an evaluation algorithm of $O(N \log N)$ time complexity or better, whose inverses do the same?