Referenced Items are not available for this document.
A new algorithm to construct a full polarity matrix for n-variable quaternary Reed-Muller expansions has been introduced. The new algorithm directly utilizes the truth vector of the function to construct the polarity matrix. The computational complexity of the algorithm is analyzed and compared with other existing algorithms. It is shown that for n⩽6, the new algorithm is computationally more efficient than all existing algorithms. Finally the fast flow diagram which is useful for implementation of the algorithm in hardware has also been shown
Published in:
Multiple-Valued Logic, 2000. (ISMVL 2000) Proceedings. 30th IEEE International Symposium on
Date of Conference: 2000
- Page(s):
- 153 - 158
- Meeting Date :
- 23 May 2000-25 May 2000
- ISSN :
- 0195-623X
- Print ISBN:
- 0-7695-0692-5
- INSPEC Accession Number:
- 6629805
- Conference Location :
- Portland, OR
- Digital Object Identifier :
- 10.1109/ISMVL.2000.848614
- Product Type:
- Conference Publications
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
