{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T03:09:44Z","timestamp":1773284984679,"version":"3.50.1"},"reference-count":21,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Integration"],"published-print":{"date-parts":[[2026,7]]},"DOI":"10.1016\/j.vlsi.2026.102713","type":"journal-article","created":{"date-parts":[[2026,3,10]],"date-time":"2026-03-10T16:44:56Z","timestamp":1773161096000},"page":"102713","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Universal Triangular Matrices for Representation of any Radix-\n                    <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\" altimg=\"si5.svg\" display=\"inline\" id=\"d1e643\">\n                      <mml:msup>\n                        <mml:mrow>\n                          <mml:mi>R<\/mml:mi>\n                        <\/mml:mrow>\n                        <mml:mrow>\n                          <mml:mi>x<\/mml:mi>\n                        <\/mml:mrow>\n                      <\/mml:msup>\n                    <\/mml:math>\n                    FFT Algorithms"],"prefix":"10.1016","volume":"109","author":[{"given":"Vijay Moni","family":"Varghese","sequence":"first","affiliation":[]},{"given":"Kumaravel","family":"S.","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.vlsi.2026.102713_b1","first-page":"1","article-title":"Energy-efficient sparse FFT and compressed transpose memory for mmwave FMCW radar sensor system","volume":"73","author":"Singh","year":"2024","journal-title":"IEEE Trans. Instrum. Meas."},{"key":"10.1016\/j.vlsi.2026.102713_b2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1109\/TIM.2023.3301891","article-title":"An efficient implementation approach to FFT processor for spectral analysis","volume":"72","author":"Hazarika","year":"2023","journal-title":"IEEE Trans. Instrum. Meas."},{"issue":"8","key":"10.1016\/j.vlsi.2026.102713_b3","doi-asserted-by":"crossref","first-page":"3044","DOI":"10.1109\/TMI.2024.3383466","article-title":"SASAN: Spectrum-axial spatial approach networks for medical image segmentation","volume":"43","author":"Huang","year":"2024","journal-title":"IEEE Trans. Med. Imaging"},{"issue":"2","key":"10.1016\/j.vlsi.2026.102713_b4","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1109\/TVLSI.2022.3227346","article-title":"A 60-mode high-throughput parallel-processing FFT processor for 5G\/4G applications","volume":"31","author":"Guo","year":"2023","journal-title":"IEEE Trans. Very Large Scale Integr. (VLSI) Syst."},{"issue":"10","key":"10.1016\/j.vlsi.2026.102713_b5","doi-asserted-by":"crossref","first-page":"4004","DOI":"10.1109\/TCSI.2023.3298227","article-title":"Low-latency 64-parallel 4096-point memory-based FFT for 6G","volume":"70","author":"Kaya","year":"2023","journal-title":"IEEE Trans. Circuits Syst. I. Regul. Pap."},{"issue":"10","key":"10.1016\/j.vlsi.2026.102713_b6","doi-asserted-by":"crossref","first-page":"1737","DOI":"10.1109\/TCSI.2016.2587822","article-title":"A new representation of FFT algorithms using triangular matrices","volume":"63","author":"Garrido","year":"2016","journal-title":"IEEE Trans. Circuits Syst. I. Regul. Pap."},{"key":"10.1016\/j.vlsi.2026.102713_b7","series-title":"DSP for MATLAB\u2122 and LabVIEW\u2122","article-title":"The DFT","author":"Isen","year":"2008"},{"issue":"90","key":"10.1016\/j.vlsi.2026.102713_b8","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1090\/S0025-5718-1965-0178586-1","article-title":"An algorithm for the machine calculation of complex Fourier series","volume":"19","author":"Cooley","year":"1965","journal-title":"Math. Comp."},{"key":"10.1016\/j.vlsi.2026.102713_b9","series-title":"Digital Signal Processing: Principles, Algorithms, and Applications","author":"Proakis","year":"2007"},{"key":"10.1016\/j.vlsi.2026.102713_b10","series-title":"Discrete-Time Signal Processing","author":"Oppenheim","year":"1999"},{"issue":"1","key":"10.1016\/j.vlsi.2026.102713_b11","doi-asserted-by":"crossref","first-page":"322","DOI":"10.1109\/TCSI.2020.3031688","article-title":"The constant multiplier FFT","volume":"68","author":"Garrido","year":"2021","journal-title":"IEEE Trans. Circuits Syst. I. Regul. Pap."},{"issue":"1","key":"10.1016\/j.vlsi.2026.102713_b12","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1109\/TVLSI.2011.2178275","article-title":"Pipelined radix- 2k feedforward FFT architectures","volume":"21","author":"Garrido","year":"2013","journal-title":"IEEE Trans. Very Large Scale Integr. (VLSI) Syst."},{"key":"10.1016\/j.vlsi.2026.102713_b13","doi-asserted-by":"crossref","first-page":"81497","DOI":"10.1109\/ACCESS.2023.3298218","article-title":"Radix-2k MSC fft architectures","volume":"11","author":"Deng","year":"2023","journal-title":"IEEE Access"},{"issue":"4","key":"10.1016\/j.vlsi.2026.102713_b14","doi-asserted-by":"crossref","first-page":"889","DOI":"10.1109\/TCSI.2006.888764","article-title":"Balanced binary-tree decomposition for area-efficient pipelined FFT processing","volume":"54","author":"Lee","year":"2007","journal-title":"IEEE Trans. Circuits Syst. I. Regul. Pap."},{"key":"10.1016\/j.vlsi.2026.102713_b15","doi-asserted-by":"crossref","unstructured":"F. Qureshi, O. Gustafsson, Generation of all radix-2 fast Fourier transform algorithms using binary trees, in: 2011 20th European Conference on Circuit Theory and Design (ECCTD), Link\u00d6ping, Sweden, 2011, pp. 677\u2013680.","DOI":"10.1109\/ECCTD.2011.6043634"},{"key":"10.1016\/j.vlsi.2026.102713_b16","series-title":"VLSI Digital Signal Processing Systems: Design and Implementation","author":"Parhi","year":"2007"},{"issue":"7","key":"10.1016\/j.vlsi.2026.102713_b17","doi-asserted-by":"crossref","first-page":"2002","DOI":"10.1109\/TCSI.2014.2304664","article-title":"Low-complexity multiplierless constant rotators based on combined coefficient selection and shift-and-add implementation (CCSSI)","volume":"61","author":"Garrido","year":"2014","journal-title":"IEEE Trans. Circuits Syst. I. Regul. Pap."},{"issue":"5","key":"10.1016\/j.vlsi.2026.102713_b18","doi-asserted-by":"crossref","first-page":"1148","DOI":"10.1109\/TVLSI.2019.2892322","article-title":"Optimum circuits for bit-dimension permutations","volume":"27","author":"Garrido","year":"2019","journal-title":"IEEE Trans. Very Large Scale Integr. (VLSI) Syst."},{"key":"10.1016\/j.vlsi.2026.102713_b19","doi-asserted-by":"crossref","unstructured":"P.A. Milder, F. Franchetti, J.C. Hoe, M. P\u00fcschel, Formal datapath representation and manipulation for implementing DSP transforms, in: Design Automation Conf, 2008, pp. 385\u2013390.","DOI":"10.1145\/1391469.1391572"},{"key":"10.1016\/j.vlsi.2026.102713_b20","doi-asserted-by":"crossref","unstructured":"M. Garrido, M. Acevedo, A. Ehliar, O. Gustafsson, Challenging the limits of FFT performance on FPGAs, in: Proc. Int. Symp. Integrated Circuits, 2014, pp. 172\u2013175.","DOI":"10.1109\/ISICIR.2014.7029571"},{"key":"10.1016\/j.vlsi.2026.102713_b21","doi-asserted-by":"crossref","unstructured":"P. Paz, M. Garrido, A 5.2-GSps 8-parallel 1024-point MDC FFT, in: Proc. Conf. Design Circuits Integrated Syst., 2023, pp. 55\u201360.","DOI":"10.1109\/DCIS58620.2023.10335965"}],"container-title":["Integration"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167926026000684?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167926026000684?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T11:43:03Z","timestamp":1773229383000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0167926026000684"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,7]]},"references-count":21,"alternative-id":["S0167926026000684"],"URL":"https:\/\/doi.org\/10.1016\/j.vlsi.2026.102713","relation":{},"ISSN":["0167-9260"],"issn-type":[{"value":"0167-9260","type":"print"}],"subject":[],"published":{"date-parts":[[2026,7]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Universal Triangular Matrices for Representation of any Radix- FFT Algorithms","name":"articletitle","label":"Article Title"},{"value":"Integration","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.vlsi.2026.102713","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Elsevier B.V. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"102713"}}