Circuits Syst Signal Process DOI 10.1007/s00034-015-9990-y Triple-Matrix Product-Based 2D Systolic Implementation of Discrete Fourier Transform I. Mamatha · T. S. B. Sudarshan · Shikha Tripathi · Nikhil Bhattar Received: 11 April 2014 / Revised: 24 January 2015 / Accepted: 26 January 2015 © Springer Science+Business Media New York 2015 Abstract Realization of N -point discrete Fourier transform (DFT) using one- dimensional or two-dimensional systolic array structures has been developed for power of two DFT sizes. DFT algorithm, which can be represented as a triple-matrix product, can be realized by decomposing N into smaller lengths. Triple-matrix product form of representation enables to map the N -point DFT on a 2D systolic array. In this work, an algorithm is developed and is mapped to a two-dimensional systolic structure where DFT size can be non-power of two. The proposed work gives flexibility to choose N for an application where N is a composite number. The total time required to com- pute N -point DFT is 2( N 1 − 1) + N 2 + N for any N = N 1 N 2 . The array can be used for matrix–matrix multiplication and also to compute the diagonal elements of triple-matrix multiplication for other applications. The proposed architecture produces in-order stream of DFT sequence at the output avoiding need for reordering buffer. Large sized DFT can be computed by repeatedly using the proposed systolic array architecture. I. Mamatha (B ) · T. S. B. Sudarshan · S. Tripathi School of Engineering, Amrita Vishwa Vidyapeetham (University), Bangalore Campus, Bangalore 560035, India e-mail: mamraj78@gmail.com T. S. B. Sudarshan e-mail: sudarshan.tsb@gmail.com S. Tripathi e-mail: shikha.eee@gmail.com N. Bhattar Engineer Staff-II, IC Design, Broadcom India Research Pvt. Ltd, Bangalore, India e-mail: nikhil_bhattar@yahoo.com