Abstract
In this paper, calculation of spectral transforms through Decision diagrams (DDs) and relationship of this method with FFT-like algorithms is discussed. It is shown that in DDs methods the basic operations in FFT-like algorithms are performed not on vectors but instead on parts of DDs as a data structure. Such a data structure represents the input signals, the intermediate results obtained during the calculation as well as the final output results. It should be noticed that, unlike FFT-like algorithms, DDs methods permit to take advantages from both, the properties of the transform matrices and the particular properties of the processed signals.