Boolean verification with fastest LIA transforms
B.J. Falkowski, Susanto Rahardja · 2003
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.