Some Remarks and Experiments with Fourier Decision Diagrams on Finite Non-Abelian Groups
p. 215-234
Résumé
This paper presents a study of the complexity of Fourier Decision Diagrams on finite Non-Abelian Groups (FNADDs) for representation of discrete functions. FNADDs are introduced as a generalization of Spectral transform decision diagrams. They are offered as a solution for depth reduction problem in DDs representations of discrete functions. This study is intended to prove experimentally basic features of FNADDs. It is performed through some examples showing complexity of FNADDs for switching and multiple-output switching functions. Comparison with some other decision diagrams is provided. It is shown that FNADDs are very efficient in representation of algebraic functions.
Texte
Citer cet article
Référence papier
Radomir S. Stanković, Dejan Milenović et Dragan Janković, « Some Remarks and Experiments with Fourier Decision Diagrams on Finite Non-Abelian Groups », CASYS, 3 | 1999, 215-234.
Référence électronique
Radomir S. Stanković, Dejan Milenović et Dragan Janković, « Some Remarks and Experiments with Fourier Decision Diagrams on Finite Non-Abelian Groups », CASYS [En ligne], 3 | 1999, mis en ligne le 01 July 2024, consulté le 20 September 2024. URL : http://popups.lib.uliege.be/1373-5411/index.php?id=890
Auteurs
Radomir S. Stanković
Dept. of Computer Science, Faculty of Electronics, Beogradska 14, 18 000 Niš, Yugoslavia
Dejan Milenović
Dept. of Computer Science, Faculty of Electronics, Beogradska 14, 18 000 Niš, Yugoslavia
Dragan Janković
Dept. of Computer Science, Faculty of Electronics, Beogradska 14, 18 000 Niš, Yugoslavia