Abstract

A new systolic algorithm for computing the discrete Fourier transform (DFT) is presented. The algorithm exhibits the minimum required time O(Nt/sub a/) and the computational complexity O(2N/sup 2/), which are much better than the time O(Nt/sub a/+Nt/sub m/) and the complexity O(4N/sup 2/) in existing systolic algorithms, where t/sub a/ and t/sub m/ are the computation time for a complex addition and a complex multiplication, respectively, and N is the DFT length. By exerting the benefits of the algorithm and adopting the scheme of tag control, a systolic array and a two-level pipelined systolic array are designed. The resulting arrays have outstanding performance on computing speeds, hardware cost, and the number of input/output (I/O) channels. >

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.