{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,14]],"date-time":"2026-03-14T19:01:29Z","timestamp":1773514889355,"version":"3.50.1"},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2022,1,24]],"date-time":"2022-01-24T00:00:00Z","timestamp":1642982400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,24]],"date-time":"2022-01-24T00:00:00Z","timestamp":1642982400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Circuits Syst Signal Process"],"published-print":{"date-parts":[[2022,5]]},"DOI":"10.1007\/s00034-021-01917-0","type":"journal-article","created":{"date-parts":[[2022,1,24]],"date-time":"2022-01-24T00:05:01Z","timestamp":1642982701000},"page":"2871-2897","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["A 28-Gbps Radix-16, 512-Point FFT Processor-Based Continuous Streaming OFDM for WiGig"],"prefix":"10.1007","volume":"41","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5747-4851","authenticated-orcid":false,"given":"Sumit","family":"Agarwal","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shaik Rafi","family":"Ahamed","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anup","family":"Gogoi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gaurav","family":"Trivedi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,1,24]]},"reference":[{"issue":"10","key":"1917_CR1","doi-asserted-by":"publisher","first-page":"2869","DOI":"10.1109\/TCSI.2014.2327271","volume":"61","author":"S-G Chen","year":"2014","unstructured":"S.-G. Chen, S.-J. Huang, M. Garrido, S.-J. Jou, Continuous-flow parallel bit-reversal circuit for MDF and MDC FFT architectures. IEEE Trans. Circuits Syst. I Regul. Pap. 61(10), 2869\u20132877 (2014)","journal-title":"IEEE Trans. Circuits Syst. I Regul. Pap."},{"issue":"5","key":"1917_CR2","doi-asserted-by":"publisher","first-page":"1260","DOI":"10.1109\/JSSC.2008.920320","volume":"43","author":"Y Chen","year":"2008","unstructured":"Y. Chen, Y. Lin, Y. Tsao, C. Lee, A 2.4-Gsample\/s DVFS FFT processor for MIMO OFDM communication systems. IEEE J. Solid State Circuits 43(5), 1260\u20131273 (2008)","journal-title":"IEEE J. Solid State Circuits"},{"key":"1917_CR3","doi-asserted-by":"crossref","unstructured":"T. Cho, H. Lee, J. Park, C. Park, A high-speed low-complexity modified radix-$$2^5$$ FFT processor for gigabit WPAN applications. In: IEEE International Symposium on Circuits and Systems (ISCAS), pp. 1259\u20131262 (2011)","DOI":"10.1109\/ISCAS.2011.5937799"},{"key":"1917_CR4","doi-asserted-by":"crossref","unstructured":"H.L. Davila, C.\u00a0Liu, W.\u00a0Liu, S.\u00a0Huang, S.\u00a0Jou, S.\u00a0Chen, A 802.15.3c\/802.11ad compliant 24 Gb\/s FFT processor for 60 GHz communication systems. In $$28^{th}$$ IEEE International System-on-Chip Conference (SOCC), pp. 44\u201348 (2015)","DOI":"10.1109\/SOCC.2015.7406907"},{"issue":"1","key":"1917_CR5","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1109\/TCSII.2009.2037262","volume":"57","author":"C Hsiao","year":"2010","unstructured":"C. Hsiao, Y. Chen, C. Lee, A generalized mixed-radix algorithm for memory-based FFT processors. IEEE Trans. Circuits Syst. II Express Briefs 57(1), 26\u201330 (2010)","journal-title":"IEEE Trans. Circuits Syst. II Express Briefs"},{"key":"1917_CR6","doi-asserted-by":"crossref","unstructured":"S.-C. Hsu, S.-J. Huang, S.-G. Chen, S.-C. Lin, M.\u00a0Garrido, A 128-point multi-path SC FFT architecture. In: 2020 IEEE International Symposium on Circuits and Systems (ISCAS), pp. 1\u20135 (2020)","DOI":"10.1109\/ISCAS45731.2020.9180883"},{"issue":"8","key":"1917_CR7","doi-asserted-by":"publisher","first-page":"1752","DOI":"10.1109\/TCSI.2011.2180430","volume":"59","author":"S-J Huang","year":"2012","unstructured":"S.-J. Huang, S.-G. Chen, A high-throughput radix-16 FFT processor with parallel and normal input\/output ordering for IEEE 802.15.3c systems. IEEE Trans. Circuits Syst. I Regul. Pap. 59(8), 1752\u20131765 (2012)","journal-title":"IEEE Trans. Circuits Syst. I Regul. Pap."},{"key":"1917_CR8","doi-asserted-by":"crossref","unstructured":"S.H.S. Jatana, N.M. Desai, SCL 180nm CMOS foundry: high reliability ASIC design for aerospace applications. In: 19th International Symposium on VLSI Design and Test, pp. 1\u20132 (2015)","DOI":"10.1109\/ISVDAT.2015.7208163"},{"issue":"5","key":"1917_CR9","doi-asserted-by":"publisher","first-page":"911","DOI":"10.1109\/TCSI.2005.846667","volume":"52","author":"B Jo","year":"2005","unstructured":"B. Jo, M. Sunwoo, New continuous-flow mixed-radix (CFMR) FFT processor using novel in-place strategy. IEEE Trans. Circuits Syst. I Regul. Pap. 52(5), 911\u2013919 (2005)","journal-title":"IEEE Trans. Circuits Syst. I Regul. Pap."},{"key":"1917_CR10","doi-asserted-by":"crossref","unstructured":"E.J. Kim, M.H. Sunwoo, High speed eight-parallel mixed-radix FFT processor for OFDM systems. In: IEEE International Symposium of Circuits and Systems (ISCAS) pp. 1684\u20131687 (2011)","DOI":"10.1109\/ISCAS.2011.5937905"},{"issue":"10","key":"1917_CR11","doi-asserted-by":"publisher","first-page":"3291","DOI":"10.1109\/TCSI.2018.2831007","volume":"65","author":"N Le Ba","year":"2018","unstructured":"N. Le Ba, T.T.-H. Kim, An area efficient 1024-point low power radix-$$2^2$$ FFT processor with feed-forward multiple delay commutators. IEEE Trans. Circuits Syst. I Regul. Pap. 65(10), 3291\u20133299 (2018)","journal-title":"IEEE Trans. Circuits Syst. I Regul. Pap."},{"key":"1917_CR12","doi-asserted-by":"crossref","unstructured":"H. Lee, M. Shin, A high-speed low-complexity two-parallel radix-$$2^4$$ FFT\/IFFT processor for UWB applications. In: IEEE Asian Solid-State Circuits Conference, pp. 284\u2013287 (2007)","DOI":"10.1109\/ASSCC.2007.4425686"},{"key":"1917_CR13","doi-asserted-by":"crossref","unstructured":"S.\u00a0Liu, D.\u00a0Liu, A high-flexible low-latency memory-based FFT processor for 4G, WLAN, and future 5G. IEEE Trans. Very Large Scale Integr. Syst. 27(3), 511\u2013523 (2018)","DOI":"10.1109\/TVLSI.2018.2879675"},{"issue":"1","key":"1917_CR14","doi-asserted-by":"publisher","first-page":"101","DOI":"10.5573\/JSTS.2017.17.1.101","volume":"17","author":"TTB Nguyen","year":"2017","unstructured":"T.T.B. Nguyen, H. Lee, High-throughput low-complexity mixed-radix FFT processor using a dual-path shared complex constant multiplier. J. Semicond. Technol. Sci. 17(1), 101\u2013109 (2017)","journal-title":"J. Semicond. Technol. Sci."},{"key":"1917_CR15","volume-title":"VLSI Digital Signal Processing Systems: Design and Implementation","author":"K Parhi","year":"2007","unstructured":"K. Parhi, VLSI Digital Signal Processing Systems: Design and Implementation (Wiley, New York, 2007)"},{"key":"1917_CR16","doi-asserted-by":"crossref","unstructured":"R. Radhouane, P. Liu, C. Modlin, Minimizing the memory requirement for continuous flow FFT implementation: continuous flow mixed mode FFT (CFMM-FFT). In: IEEE International Symposium on Circuits and Systems (ISCAS), pp. 116\u2013119 (2000)","DOI":"10.1109\/ISCAS.2000.857040"},{"key":"1917_CR17","doi-asserted-by":"crossref","unstructured":"S.\u00a0Tang, J.\u00a0Tsai, T.\u00a0Chang, A 2.4-GS\/s FFT processor for OFDM-based WPAN applications. IEEE Trans. Circuits Syst. II Express Briefs 57(6), 451\u2013455 (2010)","DOI":"10.1109\/TCSII.2010.2048373"},{"key":"1917_CR18","doi-asserted-by":"crossref","unstructured":"Y.\u00a0Tian, Y.\u00a0Hei, Z.\u00a0Liu, Z.\u00a0Di, et\u00a0al. A memory-based FFT processor using modified signal flow graph with novel conflict-free address schemes. J-STAGE IEICE Electron. Express 14(15), 20178005 (2017)","DOI":"10.1587\/elex.14.20170660"},{"issue":"1","key":"1917_CR19","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1109\/TCSII.2018.2828648","volume":"66","author":"Y Tian","year":"2019","unstructured":"Y. Tian, Y. Hei, Z. Liu, Q. Shen, Z. Di, T. Chen, A modified signal flow graph and corresponding conflict-free strategy for memory-based FFT processor design. IEEE Trans. Circuits Syst. II Express Briefs 66(1), 106\u2013110 (2019)","journal-title":"IEEE Trans. Circuits Syst. II Express Briefs"},{"key":"1917_CR20","doi-asserted-by":"crossref","unstructured":"P.-Y. Tsai, C.-Y. Lin, A generalized conflict-free memory addressing scheme for continuous-flow parallel-processing FFT processors with rescheduling. IEEE Trans. Very Large Scale Integr. Syst. 19(12), 2290\u20132302 (2011)","DOI":"10.1109\/TVLSI.2010.2077314"},{"key":"1917_CR21","unstructured":"C.\u00a0Wang, Y.\u00a0Yan, X.\u00a0Fu, A high-throughput low-complexity radix - $$2^{4}$$ - $$2^{2}$$ - $$2^{3}$$ FFT\/IFFT processor with parallel and normal Input\/Output order for IEEE 802.11ad systems. IEEE Trans. Very Large Scale Integr. Syst. (2014)"},{"key":"1917_CR22","doi-asserted-by":"crossref","unstructured":"K.\u00a0Xia, B.\u00a0Wu, T.\u00a0Xiong, T.\u00a0Ye, A memory-based FFT processor design with generalized efficient conflict-free address schemes. IEEE Trans. Very Large Scale Integr. Syst. 25(6), 1919\u20131929 (2017)","DOI":"10.1109\/TVLSI.2017.2666820"},{"key":"1917_CR23","doi-asserted-by":"crossref","unstructured":"H.E. Yantir, W.\u00a0Guo, A.\u00a0M. Eltawil, F.J. Kurdahi, K.N. Salama, An ultra-area-efficient 1024-point in-memory FFT processor. Micromachines 10(8), 509 (2019)","DOI":"10.3390\/mi10080509"},{"key":"1917_CR24","doi-asserted-by":"crossref","unstructured":"L.\u00a0Yu Wei, L.\u00a0Hsuan Yu, L.\u00a0Chen Yi, A 1-GS\/s FFT\/IFFT processor for UWB applications. IEEE J. Solid State Circuits 40(8), 1726\u20131735 (2005)","DOI":"10.1109\/JSSC.2005.852007"}],"container-title":["Circuits, Systems, and Signal Processing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00034-021-01917-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00034-021-01917-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00034-021-01917-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,16]],"date-time":"2024-09-16T19:24:37Z","timestamp":1726514677000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00034-021-01917-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,1,24]]},"references-count":24,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2022,5]]}},"alternative-id":["1917"],"URL":"https:\/\/doi.org\/10.1007\/s00034-021-01917-0","relation":{},"ISSN":["0278-081X","1531-5878"],"issn-type":[{"value":"0278-081X","type":"print"},{"value":"1531-5878","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,1,24]]},"assertion":[{"value":"23 December 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 November 2021","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 November 2021","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 January 2022","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"Not applicable.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethics Approval"}},{"value":"Not applicable.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent to Participate"}},{"value":"Not applicable.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent for Publication"}},{"value":"Code can be made available on request.","order":5,"name":"Ethics","group":{"name":"EthicsHeading","label":"Code Availability"}}]}}