From FFT to decision diagrams in calculation of spectral transforms for discrete functions

Abstract

In this tutorial paper, we discuss relationships between FFT-like algorithms and methods for the calculation of spectral transforms through decision diagrams (DDs). It is pointed out that in both FFT-like algorithms and DDs methods, the same basic FFT operations are used. However, these operations are performed over different data structures used to represent the processed signals. We have shown the basic features of DDs providing efficiency of DDs methods for calculation of spectral transforms.