Fourier transformation is a powerful analytical tool with wide-ranging applications in many fields. In certain cases, some of the inputs to the transformation function are zero, while the others are real or complex. For the case, where the nonzero inputs are complex, the transform decomposition (TD) method enables a significant reduction in the computational complexity. This letter proposes a modified TD (MTD) algorithm to further reduce the complexity when the nonzero input data are consecutive and real-valued. The analytical and numerical results confirm that the complexity of the MTD scheme is not only significantly lower than that of the original TD method, but also lower than that of the traditional split-radix fast Fourier transform (FFT) method when the length of the input sequence is short.
Index Terms-Discrete Fourier transform (DFT), fast Fourier transform (FFT), transform decomposition (TD).
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.