Abstract:
The fastest transform in the family of fast Linearly Independent Arithmetic (LIA) logic is introduced in this paper. The transform is the most efficient LIA transform in ...Show MoreMetadata
Abstract:
The fastest transform in the family of fast Linearly Independent Arithmetic (LIA) logic is introduced in this paper. The transform is the most efficient LIA transform in terms of complexity. Recursive equations defining the LIA transform and the corresponding butterfly diagrams are shown. Finally, application of the new LIA transform in Boolean functions verifications is discussed.
Published in: 2002 IEEE International Symposium on Circuits and Systems. Proceedings (Cat. No.02CH37353)
Date of Conference: 26-29 May 2002
Date Added to IEEE Xplore: 07 August 2002
Print ISBN:0-7803-7448-7
Contents 