Symmetric Discrete Fourier Tansform

A matrix formulation a the DFT of complex even and complex odd sequences will be presented and, respectively, for each one of the two type of sequences a cosine and a sine based matrix will be used. Recursive expressions for the two matrices will be obtained and it will be shown that the recursive terms involves only both the same cosine and sine matrices, of halved dimension. The structure of the algorithm is suitable for parallel hardware implementation.