By Topic

Fast transforms for multiple-valued input binary output PLI logic

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

2 Author(s)
Falkowski, B.J. ; Sch. of Electr. & Electron. Eng., Nanyang Technol. Univ., Singapore ; Rahardja, S.

Fast forward and inverse transforms for multiple-valued input binary output PLI logic are derived. New matrix functions are introduced which allow feasible transformation of arbitrary q-valued input binary output functions. This allows representation of the function in the algebra of GF(2), where q⩾2. The representation of MVB functions in various functional bases having always fast algorithms is the foundation for the efficient synthesis of PLI expansions of MVB functions. The computational complexity of such algorithms is essentially reduced when compared to standard matrix multiplication and inversion based methods of the earlier work in PLI logic

Published in:

Multiple-Valued Logic, 2000. (ISMVL 2000) Proceedings. 30th IEEE International Symposium on

Date of Conference:

2000