loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
34th International Symposium on Multiple-Valued Logic (ISMVL'04)
Fast Optimization of Fixed-Polarity Reed-Muller Expansions over GF(5)
University of Toronto, Toronto, Canada
May 19-May 22
ISBN: 0-7695-2130-4
ASCII Text
x 
 
Bogdan J. Falkowski, Cicilia C. Lozano, Susanto Rahardja, "Fast Optimization of Fixed-Polarity Reed-Muller Expansions over GF(5)," Multiple-Valued Logic, IEEE International Symposium on, pp. 162-167, 34th International Symposium on Multiple-Valued Logic (ISMVL'04), 2004.
 
 
BibTex
x
 
@article{ 10.1109/ISMVL.2004.1319936,
author = {Bogdan J. Falkowski and Cicilia C. Lozano and Susanto Rahardja},
title = {Fast Optimization of Fixed-Polarity Reed-Muller Expansions over GF(5)},
journal ={Multiple-Valued Logic, IEEE International Symposium on},
volume = {0},
year = {2004},
issn = {0195-623X},
pages = {162-167},
doi = {http://doi.ieeecomputersociety.org/10.1109/ISMVL.2004.1319936},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Multiple-Valued Logic, IEEE International Symposium on
TI - Fast Optimization of Fixed-Polarity Reed-Muller Expansions over GF(5)
SN - 0195-623X
SP162
EP167
A1 - Bogdan J. Falkowski,
A1 - Cicilia C. Lozano,
A1 - Susanto Rahardja,
PY - 2004
KW - null
VL - 0
JA - Multiple-Valued Logic, IEEE International Symposium on
ER -
 
Bogdan J. Falkowski, Nanyang Technological University
Cicilia C. Lozano, Nanyang Technological University
Susanto Rahardja, Institute for Infocomm Research
An efficient algorithm for optimization of Fixed-Polarity Reed-Muller (FPRM) expansions over GF(5) is developed in this paper. The new algorithm operates on FPRM expansion in polarity zero of a five-valued function and completely generates its FPRM polarity matrix to obtain its best FPRM expansion. Due to the simplicity and recursive nature of the algorithm, it can be implemented efficiently using fast parallel programming. This, together with low computational cost enhances the effectiveness of this algorithm as shown by the presented experimental results. The proposed algorithm can also be utilized to derive FPRM expansions in specific polarities without first constructing the complete polarity matrix.
Citation:
Bogdan J. Falkowski, Cicilia C. Lozano, Susanto Rahardja, "Fast Optimization of Fixed-Polarity Reed-Muller Expansions over GF(5)," ismvl, pp.162-167, 34th International Symposium on Multiple-Valued Logic (ISMVL'04), 2004
Usage of this product signifies your acceptance of the Terms of Use.