Fast Linearly Independent Arithmetic Expansions

Authors:
Susanto Rahardja;Bogdan J. Falkowski
Affiliations:
Nanyang Technological Univ., Singapore;Nanyang Technological Univ., Singapore
Venue:
IEEE Transactions on Computers
Year:
1999

Citing 4
Cited 4

Boolean functions with engineering applications and computer programs

Boolean functions with engineering applications and computer programs
Arithmetic Spectrum Applied to Fault Detection for Combinational Networks

IEEE Transactions on Computers
Probabilistic Aspects of Boolean Switching Functions via a New Transform

Journal of the ACM (JACM)
Family of fast mixed arithmetic logic transforms for multiple-valued input binary functions

ISMVL '96 Proceedings of the 26th International Symposium on Multiple-Valued Logic

Family of Ternary Arithmetic Polynomial Expansions Based on New Transforms

Automation and Remote Control
Malyugin's Theorems: A New Concept in Logical Control, VLSI Design, and Data Structures for New Technologies

Automation and Remote Control
Approximate Algorithms for Minimization of Binary Decision Diagrams on the Basis of Linear Transformations of Variables

Automation and Remote Control
Modeling Combinational Circuits Using Linear Word-level Structures

Automation and Remote Control

Quantified Score

Hi-index	14.98

Visualization

Abstract

The concept of Linearly Independent arithmetic (LIA) transforms and expansions is introduced in this paper. The recursive ways of generating forward and inverse fast transforms for LIA are presented. The paper describes basic properties and lists those LIA transforms which have convenient fast forward algorithms and easily defined inverse transforms. In addition, those transforms which require horizontal or vertical permutations to have fast transform are also discussed. The computational advantages and usefulness of new expansions based on LIA logic in comparison to known arithmetic expansions are discussed.