Construction of recursive algorithms for polarity matrices calculation in polynomial logical function representation

Janković Dragan: Construction of recursive algorithms for polarity matrices calculation in polynomial logical function representation. In: Acta cybernetica, (14) 2. pp. 263-283. (1999)

[thumbnail of cybernetica_014_numb_002_263-283.pdf]
Preview
Cikk, tanulmány, mű
cybernetica_014_numb_002_263-283.pdf

Download (1MB) | Preview

Abstract

There is no algorithm for the calculation of optimal fixed polarity expansion. Therefore, the efficient calculation of polarity matrix consisting of all fixed polarity expansion coefficients is very important task. We show that polarity matrix can be generated as convolution of function f with rows of relates transform matrix. The recursive properties of the convolution matrix affect to properties of polarity matrix. In literature are known some recursive algorithms for the calculation of polarity matrix of some expressions for Multiple-valued (MV) functions [3,6]. We give a unique method to construct recursive procedures for the polarity matrices calculation for any Kronecker product based expression of MV functions. As a particular cases we derive • two recursive algorithms for calculation of fixed polarity Reed-Muller-Fourier expressions for four-valued functions.

Item Type: Article
Journal or Publication Title: Acta cybernetica
Date: 1999
Volume: 14
Number: 2
ISSN: 0324-721X
Page Range: pp. 263-283
Language: English
Place of Publication: Szeged
Event Title: Conference for PhD Students in Computer Science (1.) (1998) (Szeged)
Related URLs: http://acta.bibl.u-szeged.hu/38508/
Uncontrolled Keywords: Számítástechnika, Kibernetika
Additional Information: Bibliogr.: p. 282-283. ; összefoglalás angol nyelven
Subjects: 01. Natural sciences
01. Natural sciences > 01.02. Computer and information sciences
Date Deposited: 2016. Oct. 15. 12:26
Last Modified: 2022. Jun. 14. 09:12
URI: http://acta.bibl.u-szeged.hu/id/eprint/12626

Actions (login required)

View Item View Item