{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,17]],"date-time":"2025-04-17T14:29:01Z","timestamp":1744900141845},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"10","license":[{"start":{"date-parts":[[2015,2,17]],"date-time":"2015-02-17T00:00:00Z","timestamp":1424131200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Circuits Syst Signal Process"],"published-print":{"date-parts":[[2015,10]]},"DOI":"10.1007\/s00034-015-9990-y","type":"journal-article","created":{"date-parts":[[2015,2,17]],"date-time":"2015-02-17T09:25:12Z","timestamp":1424165112000},"page":"3221-3239","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Triple-Matrix Product-Based 2D Systolic Implementation of Discrete Fourier Transform"],"prefix":"10.1007","volume":"34","author":[{"given":"I.","family":"Mamatha","sequence":"first","affiliation":[]},{"given":"T. S. B.","family":"Sudarshan","sequence":"additional","affiliation":[]},{"given":"Shikha","family":"Tripathi","sequence":"additional","affiliation":[]},{"given":"Nikhil","family":"Bhattar","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,2,17]]},"reference":[{"issue":"1","key":"9990_CR1","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1109\/31.1708","volume":"35","author":"JL Aravena","year":"1988","unstructured":"J.L. Aravena, Triple matrix product architecture for fast signal processing. IEEE Trans. Circuits Syst. 35(1), 119\u2013122 (1988)","journal-title":"IEEE Trans. Circuits Syst."},{"issue":"41","key":"9990_CR2","doi-asserted-by":"crossref","first-page":"278","DOI":"10.1109\/82.285710","volume":"II","author":"V Boriakoff","year":"1994","unstructured":"V. Boriakoff, FFT computation with systolic arrays a new architecture. IEEE Trans. Circuits Syst. II(41), 278\u2013284 (1994)","journal-title":"IEEE Trans. Circuits Syst."},{"issue":"11","key":"9990_CR3","doi-asserted-by":"crossref","first-page":"3206","DOI":"10.1109\/78.875476","volume":"48","author":"CH Chang","year":"2000","unstructured":"C.H. Chang, C.L. Wang, Y.T. Chang, Efficient VLSI architectures for fast computation of the discrete Fourier transform and its inverse. IEEE Trans. Signal Proc. 48(11), 3206\u20133216 (2000)","journal-title":"IEEE Trans. Signal Proc."},{"issue":"10","key":"9990_CR4","first-page":"1665","volume":"36","author":"LW Chang","year":"1998","unstructured":"L.W. Chang, M.Y. Chen, A new systolic array for discrete Fourier transform. IEEE Trans. Acoust. Speech Signal Process. 36(10), 1665\u20131666 (1998)","journal-title":"IEEE Trans. Acoust. Speech Signal Process."},{"issue":"4","key":"9990_CR5","doi-asserted-by":"crossref","first-page":"236","DOI":"10.1109\/82.136573","volume":"39","author":"J Choi","year":"1992","unstructured":"J. Choi, V. Boriakoff, A new linear systolic array for FFT computation. IEEE Trans. Circuits Syst. II 39(4), 236\u2013239 (1992)","journal-title":"IEEE Trans. Circuits Syst. II"},{"key":"9990_CR6","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1090\/S0025-5718-1965-0178586-1","volume":"19","author":"JW Cooley","year":"1965","unstructured":"J.W. Cooley, J.W. Tukey, An algorithm for the machine computation of complex Fourier series. Math. Comput. 19, 297\u2013301 (1965)","journal-title":"Math. Comput."},{"key":"9990_CR7","unstructured":"S. He, M. Torkelson, A systolic array implementation of common factor algorithm to compute DFT, in Proceedings International Symposium Parallel Architectures, Algorithms and Networks (1994), pp. 374\u2013381"},{"key":"9990_CR8","doi-asserted-by":"crossref","unstructured":"S. He, M. Torkelson, A new expandable 2D systolic array for DFT computation based on symbiosis of 1D arrays, in Proceedings IEEE International Conference Algorithms and Architectures for parallel Processing, vol. 1 (1995), pp. 12\u201319","DOI":"10.1109\/ICAPP.1995.472165"},{"key":"9990_CR9","unstructured":"S. He, M. Torkelson, Design and implementation of a 1024-point pipeline FFT processor, in Proceedings IEEE Custom Integrated Circuits Conference (1998), pp. 131\u2013134"},{"key":"9990_CR10","unstructured":"S.F. Hsiao, W.R. Shiue, Low-cost unified architectures for the computation of discrete trigonometric transforms, in Proceedings IEEE International Conference Acoustics, Speech Signal Processing, vol. 6 (2000), pp. 3299\u20133302"},{"key":"9990_CR11","first-page":"74","volume":"241","author":"HT Kung","year":"1980","unstructured":"H.T. Kung, Special-purpose device for signal and image processing: an opportunity in very large scale integration (VLSI). Proc. SPIE Int. Soc. Opt. Eng. 241, 74\u201384 (1980)","journal-title":"Proc. SPIE Int. Soc. Opt. Eng."},{"issue":"1","key":"9990_CR12","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1109\/MC.1982.1653825","volume":"15","author":"HT Kung","year":"1982","unstructured":"H.T. Kung, Why systolic architectures? IEEE Comput. 15(1), 37\u201346 (1982)","journal-title":"IEEE Comput."},{"issue":"9","key":"9990_CR13","doi-asserted-by":"crossref","first-page":"711","DOI":"10.1109\/TCSII.2010.2056413","volume":"57","author":"S-C Lai","year":"2010","unstructured":"S.-C. Lai, S.-F. Lei, W.-H. Juang, C.-H. Luo, A low-cost, low-complexity, and memory-free architecture of novel recursive DFT and IDFT algorithms for DTMF application. IEEE Trans. Circuits Syst. II 57(9), 711\u2013715 (2010)","journal-title":"IEEE Trans. Circuits Syst. II"},{"issue":"5","key":"9990_CR14","doi-asserted-by":"crossref","first-page":"1359","DOI":"10.1109\/78.757223","volume":"47","author":"H Lim","year":"1999","unstructured":"H. Lim, E.E. Swartzlander, Multidimensional systolic arrays for the implementation of discrete Fourier transforms. IEEE Trans. Signal Proc. 47(5), 1359\u20131370 (1999)","journal-title":"IEEE Trans. Signal Proc."},{"key":"9990_CR15","unstructured":"N. Ling, M.A. Bayoumi, The design and implementation of multidimensional systolic arrays for DSP applications, in Proceedings International Conference Acoustics, Speech, Signal Processing, vol. 2 (1989), pp. 1142\u20131145"},{"issue":"1","key":"9990_CR16","doi-asserted-by":"crossref","first-page":"76","DOI":"10.1631\/jzus.C1000234","volume":"12","author":"X Liu","year":"2011","unstructured":"X. Liu, F. Yu, Z.-K. Wang, A pipelined architecture for normal I\/O order FFT. J. Zhejang University-Science 12(1), 76\u201382 (2011)","journal-title":"J. Zhejang University-Science"},{"issue":"3","key":"9990_CR17","first-page":"18","volume":"26","author":"V Mahendra","year":"2011","unstructured":"V. Mahendra, R. Arvind, Design and FPGA implementation of systolic array architecture for matrix multiplication. Int. J. Comput. Appl. 26(3), 18\u201322 (2011)","journal-title":"Int. J. Comput. Appl."},{"key":"9990_CR18","doi-asserted-by":"crossref","unstructured":"A. Mankar, N. Prasad, S. Meher, FPGA implementation of discrete Fourier transform core using NEDA, in International Conference Communication Systems and Network Technologies (2013), pp. 711\u2013715","DOI":"10.1109\/CSNT.2013.152"},{"issue":"4","key":"9990_CR19","first-page":"295","volume":"137","author":"W Marwood","year":"1990","unstructured":"W. Marwood, A.P. Clarke, Matrix product machine and the Fourier transform. Proc. Inst. Elect. Eng. G 137(4), 295\u2013301 (1990)","journal-title":"Proc. Inst. Elect. Eng. G"},{"issue":"8","key":"9990_CR20","doi-asserted-by":"crossref","first-page":"481","DOI":"10.1109\/LSP.2006.873149","volume":"13","author":"PK Meher","year":"2006","unstructured":"P.K. Meher, Highly concurrent reduced complexity 2-D systolic array for discrete Fourier transform. IEEE Signal Proc. Lett. 13(8), 481\u2013484 (2006a)","journal-title":"IEEE Signal Proc. Lett."},{"issue":"8","key":"9990_CR21","doi-asserted-by":"crossref","first-page":"702","DOI":"10.1109\/TCSII.2006.875379","volume":"53","author":"PK Meher","year":"2006","unstructured":"P.K. Meher, Efficient systolic implementation of DFT using a low-complexity convolution-like formulation. IEEE Trans. Circuits Syst. II 53(8), 702\u2013706 (2006b)","journal-title":"IEEE Trans. Circuits Syst. II"},{"issue":"1","key":"9990_CR22","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s11265-008-0328-x","volume":"60","author":"PK Meher","year":"2010","unstructured":"P.K. Meher, J.C. Patra, A.P. Vinod, Efficient systolic designs for 1 and 2-dimensional DFT of general transform-lengths for high speed wireless communication applications. J. Signal Proc. Syst. 60(1), 1\u201314 (2010)","journal-title":"J. Signal Proc. Syst."},{"issue":"4","key":"9990_CR23","doi-asserted-by":"crossref","first-page":"988","DOI":"10.1109\/78.285671","volume":"42","author":"NR Murthy","year":"1994","unstructured":"N.R. Murthy, M.N.S. Swamy, On the real time computation of DFT and DCT through systolic architectures. IEEE Trans. Signal Proc. 42(4), 988\u2013991 (1994)","journal-title":"IEEE Trans. Signal Proc."},{"issue":"12","key":"9990_CR24","doi-asserted-by":"crossref","first-page":"4640","DOI":"10.1109\/TSP.2005.859216","volume":"53","author":"JG Nash","year":"2005","unstructured":"J.G. Nash, Computationally efficient systolic architecture for computing the discrete Fourier transform. IEEE Tran. Signal Proc. 53(12), 4640\u20134651 (2005)","journal-title":"IEEE Tran. Signal Proc."},{"key":"9990_CR25","doi-asserted-by":"crossref","unstructured":"C.V. Niras, V. Thomas, Systolic variable length architecture for discrete Fourier transform in long-term evolution, in 2012 International Symposium Electronic System Design (2012), pp. 52\u201355","DOI":"10.1109\/ISED.2012.47"},{"issue":"1","key":"9990_CR26","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1109\/11.992857","volume":"48","author":"Z-X Yang","year":"2002","unstructured":"Z.-X. Yang, Y.-P. Hu, C.-Y. Pan, L. Yang, Design of a 3780-point IFFT processor for TDS-OFDM. IEEE Trans. Broadcast. 48(1), 57\u201361 (2002)","journal-title":"IEEE Trans. Broadcast."},{"issue":"3","key":"9990_CR27","doi-asserted-by":"crossref","first-page":"864","DOI":"10.1109\/TSP.2002.806904","volume":"51","author":"WC Yeh","year":"2003","unstructured":"W.C. Yeh, C.-W. Jen, High-speed and low power split-radix FFT. IEEE Trans. Signal Proc. 51(3), 864\u2013874 (2003)","journal-title":"IEEE Trans. Signal Proc."},{"key":"9990_CR28","unstructured":"X. Zhang, N. Jindapetch, An efficient VLSI architecture for the radar algorithm based DFT prime-factor, in International Conference Electrical Engineering\/Electronics Computer Telecommunications and Information Technology (ECTI-CON) (2010), pp. 941\u2013944"}],"container-title":["Circuits, Systems, and Signal Processing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00034-015-9990-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00034-015-9990-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00034-015-9990-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,22]],"date-time":"2019-05-22T15:01:49Z","timestamp":1558537309000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00034-015-9990-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,2,17]]},"references-count":28,"journal-issue":{"issue":"10","published-print":{"date-parts":[[2015,10]]}},"alternative-id":["9990"],"URL":"https:\/\/doi.org\/10.1007\/s00034-015-9990-y","relation":{},"ISSN":["0278-081X","1531-5878"],"issn-type":[{"value":"0278-081X","type":"print"},{"value":"1531-5878","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,2,17]]}}}