{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,19]],"date-time":"2026-07-19T01:54:42Z","timestamp":1784426082940,"version":"3.55.0"},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2022,9,11]],"date-time":"2022-09-11T00:00:00Z","timestamp":1662854400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,9,11]],"date-time":"2022-09-11T00:00:00Z","timestamp":1662854400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Wireless Pers Commun"],"published-print":{"date-parts":[[2023,2]]},"DOI":"10.1007\/s11277-022-10021-8","type":"journal-article","created":{"date-parts":[[2022,9,11]],"date-time":"2022-09-11T15:02:23Z","timestamp":1662908543000},"page":"1827-1838","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":18,"title":["A Novel Digital Logic for Bit Reversal and Address Generations in FFT Computations"],"prefix":"10.1007","volume":"128","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6887-1182","authenticated-orcid":false,"given":"Konguvel","family":"Elango","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Kannan","family":"Muniandi","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2022,9,11]]},"reference":[{"key":"10021_CR1","unstructured":"Kristensen F, Nilsson P and Olsson A (2003) \u2018Flexible baseband transmitter for OFDM\u2019. In: Proceedings of international conference on circuits signals systems, pp. 356\u2013361."},{"key":"10021_CR2","doi-asserted-by":"crossref","unstructured":"Zhang Z and Zhang X (1999) \u2018Cache-optimal methods for bit-reversals\u2019. In: Proceedings of the ACM\/IEEE conference on supercomputing, pp. 26\u201326.","DOI":"10.1145\/331532.331558"},{"key":"10021_CR3","doi-asserted-by":"crossref","unstructured":"Gatlin KS, and Carter L (1999) \u2018Memory hierarchy considerations for fast transpose and bit-reversals\u2019. In: Proceedings of IEEE symposium on high-performance computer architecture, pp. 33\u201342.","DOI":"10.1109\/HPCA.1999.744320"},{"issue":"10","key":"10021_CR4","doi-asserted-by":"publisher","first-page":"701","DOI":"10.1109\/82.329741","volume":"41","author":"D Sundararajan","year":"1994","unstructured":"Sundararajan, D., Ahmad, M. O., & Swamy, M. N. S. (1994). A fast FFT bit-reversal algorithm. IEEE Transactions on Circuits and Systems II: Analog and Digital Signal Processing, 41(10), 701\u2013703.","journal-title":"IEEE Transactions on Circuits and Systems II: Analog and Digital Signal Processing"},{"issue":"4","key":"10021_CR5","doi-asserted-by":"publisher","first-page":"991","DOI":"10.1109\/78.376852","volume":"43","author":"JM Rius","year":"1995","unstructured":"Rius, J. M., & Porrata, D. R. (1995). New FFT bit-reversal algorithm. IEEE Transactions on Signal Processing, 43(4), 991\u2013994.","journal-title":"IEEE Transactions on Signal Processing"},{"issue":"10","key":"10021_CR6","doi-asserted-by":"publisher","first-page":"2365","DOI":"10.1109\/78.91199","volume":"39","author":"AA Yong","year":"1991","unstructured":"Yong, A. A. (1991). A better FFT bit-reversal algorithm without tables. IEEE Transactions on Signal Processing, 39(10), 2365\u20132367.","journal-title":"IEEE Transactions on Signal Processing"},{"issue":"6","key":"10021_CR7","doi-asserted-by":"publisher","first-page":"780","DOI":"10.1109\/12.90256","volume":"40","author":"TC Choinski","year":"1991","unstructured":"Choinski, T. C., & Tylaska, T. T. (1991). Generation of digit reversed address sequences for fast fourier transforms. IEEE Transactions on Computers, 40(6), 780\u2013784.","journal-title":"IEEE Transactions on Computers"},{"key":"10021_CR8","first-page":"171","volume":"4","author":"WZ Shen","year":"1994","unstructured":"Shen, W. Z., Tao, Y. H., & Dung, L. R. (1994). On the reduction of reorder buffer size for discrete fourier transform processor design. Proceedings of IEEE International Symposium on Circuits and Systems, 4, 171\u2013174.","journal-title":"Proceedings of IEEE International Symposium on Circuits and Systems"},{"issue":"4","key":"10021_CR9","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1049\/ip-cdt:20041224","volume":"152","author":"YT Lin","year":"2005","unstructured":"Lin, Y. T., Tsai, P. Y., & Chiueh, T. D. (2005). Low-power variable-length fast Fourier transform processor. IEE Proceedings - Computers and Digital Techniques, 152(4), 499\u2013506.","journal-title":"IEE Proceedings - Computers and Digital Techniques"},{"key":"10021_CR10","first-page":"496","volume":"2","author":"SH Ok","year":"2007","unstructured":"Ok, S. H., & Moon, B. I. (2007). A digit reversal circuit for the variable-length radix-4 FFT. Proceedings of IEEE conference on Future Generation Communication and Networking, 2, 496\u2013500.","journal-title":"Proceedings of IEEE conference on Future Generation Communication and Networking"},{"issue":"12","key":"10021_CR11","first-page":"1234","volume":"55","author":"YN Chang","year":"2008","unstructured":"Chang, Y. N. (2008). An efficient VLSI architecture for normal I\/O order pipeline FFT design. IEEE Transactions on Circuits and Systems II: Express Briefs, 55(12), 1234\u20131238.","journal-title":"IEEE Transactions on Circuits and Systems II: Express Briefs"},{"key":"10021_CR12","doi-asserted-by":"crossref","unstructured":"Chakraborty TS and Chakrabarti S (2008) \u2018On output reorder buffer design of bit reversed pipelined continuous data FFT architecture\u2019. In: Proceedings of IEEE asia pacific conference on circuits and systems,\u00a0pp. 1132\u20131135.","DOI":"10.1109\/APCCAS.2008.4746224"},{"issue":"10","key":"10021_CR13","first-page":"657","volume":"58","author":"M Garrido","year":"2011","unstructured":"Garrido, M., Grajal, J., & Gustafsson, O. (2011). Optimum circuits for bit reversal. IEEE Transactions on Circuits and Systems II: Express Briefs, 58(10), 657\u2013661.","journal-title":"IEEE Transactions on Circuits and Systems II: Express Briefs"},{"issue":"4","key":"10021_CR14","doi-asserted-by":"publisher","first-page":"1146","DOI":"10.1109\/TCSI.2015.2402935","volume":"62","author":"S Richardson","year":"2015","unstructured":"Richardson, S., Markovi\u0107, D., Danowitz, A., Brunhaver, J., & Horowitz, M. (2015). Building conflict-free FFT schedules. IEEE Transactions on Circuits and Systems I: Regular Papers, 62(4), 1146\u20131155.","journal-title":"IEEE Transactions on Circuits and Systems I: Regular Papers"},{"key":"10021_CR15","doi-asserted-by":"crossref","unstructured":"Lee S and Park SC (2007) \u2018Modified SDF architecture for mixed DIF\/DIT FFT\u2019. In: Proceedings of IEEE international symposium on circuits and systems,\u00a0pp. 2590\u20132593.","DOI":"10.1109\/ISCAS.2007.377845"},{"key":"10021_CR16","first-page":"1","volume":"2","author":"YN Chang","year":"2012","unstructured":"Chang, Y. N. (2012). Design of an 8192-point sequential I\/O FFT chip. Proceedings of World Congress Engineering, Computer and Science, 2, 1\u20136.","journal-title":"Proceedings of World Congress Engineering, Computer and Science"},{"issue":"10","key":"10021_CR17","doi-asserted-by":"publisher","first-page":"4673","DOI":"10.1109\/TSP.2008.924637","volume":"56","author":"WH Chang","year":"2008","unstructured":"Chang, W. H., & Nguyen, T. Q. (2008). On the fixed-point accuracy analysis of FFT algorithms. IEEE Transactions on Signal Processing, 56(10), 4673\u20134682.","journal-title":"IEEE Transactions on Signal Processing"},{"issue":"4","key":"10021_CR18","doi-asserted-by":"publisher","first-page":"720","DOI":"10.1109\/TVLSI.2012.2194315","volume":"21","author":"KJ Yang","year":"2013","unstructured":"Yang, K. J., Tsai, S. H., & Chuang, G. C. (2013). MDC FFT\/IFFT processor with variable length for MIMO-OFDM systems. IEEE Transactions on Very Large Scale Integration Systems, 21(4), 720\u2013731.","journal-title":"IEEE Transactions on Very Large Scale Integration Systems"},{"issue":"10","key":"10021_CR19","doi-asserted-by":"publisher","first-page":"2869","DOI":"10.1109\/TCSI.2014.2327271","volume":"61","author":"SG Chen","year":"2014","unstructured":"Chen, S. G., Huang, S. J., Garrido, M., & Jou, S. J. (2014). Continuous-flow parallel bit-reversal circuit for MDF and MDC FFT architectures. IEEE Transactions on Circuits and Systems I: Regular Papers, 61(10), 2869\u20132877.","journal-title":"IEEE Transactions on Circuits and Systems I: Regular Papers"},{"issue":"6","key":"10021_CR20","doi-asserted-by":"publisher","first-page":"1068","DOI":"10.1109\/TVLSI.2011.2147338","volume":"20","author":"M Ayinala","year":"2012","unstructured":"Ayinala, M., Brown, M., & Parhi, K. K. (2012). Pipelined parallel FFT architectures via folding transformation. IEEE Transactions on Very Large Scale Integration Systems, 20(6), 1068\u20131081.","journal-title":"IEEE Transactions on Very Large Scale Integration Systems"},{"key":"10021_CR21","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1007\/s12243-019-00742-6","volume":"75","author":"K Elango","year":"2020","unstructured":"Elango, K., & Muniandi, K. (2020). VLSI implementation of an area and energy efficient FFT\/IFFT core for MIMO-OFDM applications. Annals of Telecommunications, 75, 215\u2013227.","journal-title":"Annals of Telecommunications"},{"key":"10021_CR22","doi-asserted-by":"crossref","unstructured":"Yoshizawa S, Orikasa A and Miyanaga Y (2011) \u2018An area and power efficient pipeline FFT processor for 8\u00d78 MIMO-OFDM systems\u2019. In: Proceedings of IEEE international symposium of circuits and systems, pp. 2705\u20132708.","DOI":"10.1109\/ISCAS.2011.5938163"},{"issue":"3","key":"10021_CR23","doi-asserted-by":"publisher","first-page":"1830001","DOI":"10.1142\/S0218126618300015","volume":"27","author":"E Konguvel","year":"2018","unstructured":"Konguvel, E., & Kannan, M. (2018). A Survey on FFT\/IFFT Processors for Next Generation Telecommunication systems. Journal of Circuits, Systems and Computers, 27(3), 1830001.","journal-title":"Journal of Circuits, Systems and Computers"},{"key":"10021_CR24","doi-asserted-by":"publisher","DOI":"10.1007\/s12633-022-01859-5","author":"B Ravi Kumar","year":"2022","unstructured":"Ravi Kumar, B., Aruna Devi, V., Sireesha, A. Kishore., Reddy, I., Hariharan, E. Konguvel., & Vignesh, N. A. (2022). Analysis and Design of Novel Doping Free Silicon Nanotube TFET with High-density Meshing Using ML for Sub Nanometre Technology Nodes. Silicon. https:\/\/doi.org\/10.1007\/s12633-022-01859-5","journal-title":"Silicon"},{"key":"10021_CR25","doi-asserted-by":"publisher","DOI":"10.1007\/s12633-021-01625-z","author":"S Kanithan","year":"2022","unstructured":"Kanithan, S., Arun Vignesh, N., Jana, S., Gokul Prasad, C., Konguvel, E., & Vimalnath, S. (2022). Negative Capacitance Ferroelectric FET Based on Short Channel Effect for Low Power Applications. Silicon. https:\/\/doi.org\/10.1007\/s12633-021-01625-z","journal-title":"Silicon"},{"key":"10021_CR26","unstructured":"Namrata S and Konguvel E (2022) \u201cAn Approach for Restaurant Management System during Covid-19\u201dIn: Proceedings of 2022 IEEE international conference on computer communication and informatics (ICCCI \u2013 2022), Coimbatore, India, pp. 1 \u2013 5, 25 \u2013 27"},{"key":"10021_CR27","unstructured":"Aradhana G and Konguvel E (2022) \u201cATM services on EMU8086 for the technologically impaired people\u201d. In: Proceedings of 2022 IEEE international conference on computer communication and informatics (ICCCI \u2013 2022), Coimbatore, India, pp. 1 \u2013 5, 25 \u2013 27."}],"container-title":["Wireless Personal Communications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11277-022-10021-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11277-022-10021-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11277-022-10021-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,30]],"date-time":"2023-01-30T16:34:07Z","timestamp":1675096447000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11277-022-10021-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,9,11]]},"references-count":27,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2023,2]]}},"alternative-id":["10021"],"URL":"https:\/\/doi.org\/10.1007\/s11277-022-10021-8","relation":{},"ISSN":["0929-6212","1572-834X"],"issn-type":[{"value":"0929-6212","type":"print"},{"value":"1572-834X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,9,11]]},"assertion":[{"value":"29 August 2022","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 September 2022","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declaration"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interest"}}]}}