Call between 8 a.m. and 4 p.m.
Mail us for support
Laboratory address
Aleksandra Medvedeva 4
Niš, Serbia
Advancing healthcare through technology
Call between 8 a.m. and 4 p.m.
Mail us for support
Laboratory address
Jankovic, Dragan; Drechsler, Rolf
Method for construction of recursive algorithms for Reed-Muller-Fourier polarity matrices calculation Journal Article
In: Journal of Multiple-Valued Logic and Soft Computing, vol. 10, no. 1, pp. 29 – 50, 2004.
Abstract | Links | BibTeX | Tags: Algorithms; Heuristic methods; Matrix algebra; Optimization; Polynomials; Switching; Vectors; Binary circuits; Recursive algorithm; Reed-Muller-Fourier (RMF) polarity matrices; Computer science
@article{Jankovic200429,
title = {Method for construction of recursive algorithms for Reed-Muller-Fourier polarity matrices calculation},
author = {Dragan Jankovic and Rolf Drechsler},
url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-3142707555\&partnerID=40\&md5=b5113585661c3a4218c7525023efda26},
year = {2004},
date = {2004-01-01},
journal = {Journal of Multiple-Valued Logic and Soft Computing},
volume = {10},
number = {1},
pages = {29 \textendash 50},
publisher = {Old City Publishing},
abstract = {A method was proposed to construct recursive matrix algorithms for Reed-Muller-Fourier (RMF) polarity matrices calculation. The efficiency of the algorithms was estimated through the number of calculations required to compute the polarity matrix. In these algorithms, polarities for variable used in optimization of Galois Field (GF)-expressions were considered. Optimization of RMF expressions is possible by using different polarities for variables.},
keywords = {Algorithms; Heuristic methods; Matrix algebra; Optimization; Polynomials; Switching; Vectors; Binary circuits; Recursive algorithm; Reed-Muller-Fourier (RMF) polarity matrices; Computer science},
pubstate = {published},
tppubtype = {article}
}