A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2007; you can also visit the original URL.
The file type is application/pdf
.
Fastest linearly independent transforms over GF(2) and their properties
2005
IEEE Transactions on Circuits and Systems I Fundamental Theory and Applications
New classes of linearly independent (LI) transforms that possess fast forward and inverse butterfly diagrams and their corresponding polynomial expansions over Galois Field (2) [GF(2)] are introduced in this paper. The transforms have the smallest computational complexity among all known LI transforms and therefore can be calculated in shorter time when the computation is done by software. Alternatively, the transforms can also be calculated easily and efficiently using hardware. Here, the
doi:10.1109/tcsi.2005.852209
fatcat:cc4zedtepzd6jl5hfyf6ha2b7u