Construction of recursive algorithms for polarity matrices calculation in polynomial logical function representation
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...
Elmentve itt :
| Szerző: | |
|---|---|
| Testületi szerző: | |
| Dokumentumtípus: | Cikk |
| Megjelent: |
1999
|
| Sorozat: | Acta cybernetica
14 No. 2 |
| Kulcsszavak: | Számítástechnika, Kibernetika |
| Tárgyszavak: | |
| Online Access: | http://acta.bibl.u-szeged.hu/12626 |
| Tartalmi kivonat: | 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. |
|---|---|
| Terjedelem/Fizikai jellemzők: | 263-283 |
| ISSN: | 0324-721X |