In this paper we firstly define two new formulations, the symmetric sine structure (SSS) and the symmetric cosine structure (SCS). Then we propose a simple algorithm to realize one-dimensional SCS and SSS with sequence lengths equal to 2m. We show that a 2m-length discrete Hartley transform can be realized through a 2m-1-length SCS and a 2m-1-length SSS, which achieves the same multiplicative complexity as the minimum number of multiplications reported in the literature. However, our approach gives the advantage of requiring less additions compared with conventional approaches. Furthermore, this approach can also be applied to realize a 2m-length real-valued discrete Fourier transform, which requires the lowest number of multiplications compared with conventional real-valued algorithms and needs no complex number operations as found in other real-valued algorithms.
ASJC Scopus subject areas
- Electrical and Electronic Engineering
- Signal Processing