http://popups.lib.uliege.be/1373-5411/index.php?id=894 Index terms fr 0 http://popups.lib.uliege.be/1373-5411/index.php?id=890 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. Mon, 01 Jul 2024 14:05:25 +0200 Mon, 07 Oct 2024 15:35:04 +0200 http://popups.lib.uliege.be/1373-5411/index.php?id=890