References

@article{Jankovi\'{c}2007521,

title = {Implementation complexity of algorithms for optimization of galois field expressions for multiple-valued functions},

author = {Dragan Jankovi\'{c} and Radomir S. Stankovi\'{c} and Claudio Moraga},

url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-36348946286\&partnerID=40\&md5=31d1eea4452b2302b3eebbd962ee1aa0},

year  = {2007},

date = {2007-01-01},

journal = {Journal of Multiple-Valued Logic and Soft Computing},

volume = {13},

number = {4-6},

pages = {521 \textendash 536},

abstract = {This paper discusses methods for efficient implementation of algorithms for determination of Fixed-polarity Galois field (FPGF) expressions for q-valued logic functions (q-prime). Calculations of coefficients in FPGF expressions can be most efficiently performed in terms of space and time, if conversion of an expression for a given polarity into the expression for another polarity is done along the so-called extended dual polarity route. However, there are many possible extended dual polarity routes which differ in the associated processing rules. The complexity of whatever software or hardware resources required for calculations of FPGF expressions depends on the number of different processing rules required along a route. In this paper, we introduce the notion of homogeneous extended dual polarity routes and show that calculations along these routes can be performed with a reduced number of processing rules required. Due to that, both hardware and software implementation of the procedure for determination of all possible FPGF expressions for a given function is considerably simplified. © 2007 Old City Publishing. Inc.},

keywords = {Computational complexity; Computer software; Formal logic; Functional analysis; Optimization; Fixed polarity galois field expressions; Galois field expressions; Multiple valued functions; Valued logic functions; Algorithms},

pubstate = {published},

tppubtype = {article}

}