By Topic

Fastest linearly independent transforms over GF(2) and their properties

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Rahardja, S. ; Inst. for Infocomm Res., Singapore ; Falkowski, B.J. ; Lozano, C.C.

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 recursive definitions and fast transform calculations of four basic fastest LI transforms are first given. The definitions are then extended to generate a larger family of LI transforms with the same computational cost through reordering and permutation. Various properties of the transforms and relations between them are presented followed by their hardware implementations as well as experimental results for some binary benchmark functions.

Published in:

Circuits and Systems I: Regular Papers, IEEE Transactions on  (Volume:52 ,  Issue: 9 )