View(s) :
7 (0 ULiège)
Download(s) :
4 (0 ULiège)
Some Remarks and Experiments with Fourier Decision Diagrams on Finite Non-Abelian Groups
p. 215-234
Abstract
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.
Text
References
Bibliographical reference
Radomir S. Stanković, Dejan Milenović and Dragan Janković, « Some Remarks and Experiments with Fourier Decision Diagrams on Finite Non-Abelian Groups », CASYS, 3 | 1999, 215-234.
Electronic reference
Radomir S. Stanković, Dejan Milenović and Dragan Janković, « Some Remarks and Experiments with Fourier Decision Diagrams on Finite Non-Abelian Groups », CASYS [Online], 3 | 1999, Online since 07 October 2024, connection on 15 July 2025. URL : http://popups.uliege.be/3041-539x/index.php?id=890
Authors
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
