Different Decision Diagrams (DDs) for representation of discrete functions
are discussed. DDs can be derived by applying some reduction rules to Decis
ion Trees (DTs) which in turn are graphical representations of some functio
n expressions for discrete functions. Various DTs and their generalizations
based on lesser known AND-EXOR rather than AND-OR expressions are surveyed
. Finally, the concept of spectral interpretation of DDs and some of their
applications and ways of calculation are also presented.