{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,10]],"date-time":"2026-01-10T07:37:24Z","timestamp":1768030644462,"version":"3.49.0"},"publisher-location":"Cham","reference-count":36,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031321795","type":"print"},{"value":"9783031321801","type":"electronic"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-32180-1_1","type":"book-chapter","created":{"date-parts":[[2023,5,11]],"date-time":"2023-05-11T12:02:53Z","timestamp":1683806573000},"page":"1-18","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Lossless FFTs Using Posit Arithmetic"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8241-6277","authenticated-orcid":false,"given":"Siew Hoon","family":"Leong","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2957-1304","authenticated-orcid":false,"given":"John L.","family":"Gustafson","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,5,12]]},"reference":[{"issue":"20","key":"1_CR1","doi-asserted-by":"publisher","first-page":"1550","DOI":"10.1109\/LPT.2011.2164059","volume":"23","author":"R Bouziane","year":"2011","unstructured":"Bouziane, R., et al.: Optimizing FFT precision in optical OFDM transceivers. IEEE Photonics Technol. Lett. 23(20), 1550\u20131552 (2011). https:\/\/doi.org\/10.1109\/LPT.2011.2164059","journal-title":"IEEE Photonics Technol. Lett."},{"key":"1_CR2","unstructured":"Buddhiram, C.R., et al.: Parameterized posit arithmetic generator (2018). Submitted to ICCD 2018"},{"issue":"10","key":"1_CR3","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.: On the fixed-point accuracy analysis of FFT algorithms. IEEE Trans. Signal Process. 56(10), 4673\u20134682 (2008). https:\/\/doi.org\/10.1109\/TSP.2008.924637","journal-title":"IEEE Trans. Signal Process."},{"issue":"10","key":"1_CR4","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.: On the fixed-point accuracy analysis of FFT algorithms. IEEE Trans. Signal Process. 56(10), 4673\u20134682 (2008)","journal-title":"IEEE Trans. Signal Process."},{"key":"1_CR5","doi-asserted-by":"crossref","unstructured":"Chen, J., Al-Ars, Z., Hofstee, H.P.: A matrix-multiply unit for posits in reconfigurable logic using (Open) CAPI. ACM (2018)","DOI":"10.1145\/3190339.3190340"},{"key":"1_CR6","doi-asserted-by":"crossref","unstructured":"Chung, S.Y.: Provably correct posit arithmetic with fixed-point big integer. ACM (2018)","DOI":"10.1145\/3190339.3190341"},{"issue":"10","key":"1_CR7","doi-asserted-by":"publisher","first-page":"1664","DOI":"10.1109\/PROC.1967.5957","volume":"55","author":"WT Cochran","year":"1967","unstructured":"Cochran, W.T., et al.: What is the fast Fourier transform? Proc. IEEE 55(10), 1664\u20131674 (1967). https:\/\/doi.org\/10.1109\/PROC.1967.5957","journal-title":"Proc. IEEE"},{"key":"1_CR8","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1090\/S0025-5718-1965-0178586-1","volume":"19","author":"JW Cooley","year":"1965","unstructured":"Cooley, J.W., Tukey, J.W.: An algorithm for the machine calculation of complex Fourier series. Math. Comput. 19, 297\u2013301 (1965)","journal-title":"Math. Comput."},{"issue":"1","key":"1_CR9","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1049\/el:19840012","volume":"20","author":"P Duhamel","year":"1984","unstructured":"Duhamel, P., Hollmann, H.: \u2018Split radix\u2019 FFT algorithm. Electron. Lett. 20(1), 14\u201316 (1984). https:\/\/doi.org\/10.1049\/el:19840012","journal-title":"Electron. Lett."},{"key":"1_CR10","unstructured":"Goldberg, D.: What every computer scientist should know about floating-point arithmetic"},{"key":"1_CR11","doi-asserted-by":"crossref","unstructured":"Good, I.: The interaction algorithm and practical Fourier analysis. J. Roy. Stat. Soc. Ser. B (Methodol.) 361\u2013372 (1958)","DOI":"10.1111\/j.2517-6161.1958.tb00300.x"},{"key":"1_CR12","doi-asserted-by":"crossref","unstructured":"Good, I.: The interaction algorithm and practical Fourier analysis: an addendum. J. Roy. Stat. Soc. Ser. B (Methodol.) 372\u2013375 (1960)","DOI":"10.1111\/j.2517-6161.1960.tb00384.x"},{"key":"1_CR13","unstructured":"Gustafson, J.L.: The End of Error: Unum Computing. Chapman & Hall\/CRC Computational Science, CRC Press (2015)"},{"key":"1_CR14","unstructured":"Gustafson, J.L.: Posit arithmetic (2017). Mathematica notebook"},{"key":"1_CR15","doi-asserted-by":"publisher","unstructured":"Gustafson, J.L., Yonemoto, I.: Beating floating point at its own game: posit arithmetic. Supercomput. Front. Innov. 4(2) (2017). https:\/\/doi.org\/10.14529\/jsfi170206","DOI":"10.14529\/jsfi170206"},{"key":"1_CR16","unstructured":"Gustafson, J.L., Yonemoto, I.: Beyond floating point: next generation computer arithmetic (2017). https:\/\/www.youtube.com\/watch?v=aP0Y1uAA-2Y"},{"key":"1_CR17","unstructured":"Hauser, J.R.: Berkeley SoftFloat (2018). http:\/\/www.jhauser.us\/arithmetic\/SoftFloat.html"},{"issue":"1","key":"1_CR18","first-page":"15","volume":"4","author":"J Hutter","year":"2014","unstructured":"Hutter, J., Iannuzzi, M., Schiffmann, F., VandeVondele, J.: CP2K: atomistic simulations of condensed matter systems. Wiley Interdisc. Rev.: Comput. Mol. Sci. 4(1), 15\u201325 (2014)","journal-title":"Wiley Interdisc. Rev.: Comput. Mol. Sci."},{"issue":"94720\u20131776","key":"1_CR19","first-page":"11","volume":"754","author":"W Kahan","year":"1996","unstructured":"Kahan, W.: IEEE standard 754 for binary floating-point arithmetic. Lect. Notes Status EEE 754(94720\u20131776), 11 (1996)","journal-title":"Lect. Notes Status EEE"},{"issue":"2","key":"1_CR20","doi-asserted-by":"publisher","first-page":"390","DOI":"10.1046\/j.1365-246X.2002.01653.x","volume":"149","author":"D Komatitsch","year":"2002","unstructured":"Komatitsch, D., Tromp, J.: Spectral-element simulations of global seismic wave propagation-I. Validation. Geophys. J. Int. 149(2), 390\u2013412 (2002). https:\/\/doi.org\/10.1046\/j.1365-246X.2002.01653.x","journal-title":"Geophys. J. Int."},{"key":"1_CR21","doi-asserted-by":"crossref","unstructured":"Komatitsch, D., Tromp, J.: Spectral-element simulations of global seismic wave propagation\u2013II. Three-dimensional models, oceans, rotation and self-gravitation. Geophys. J. Int. 150(1), 303\u2013318 (2002)","DOI":"10.1046\/j.1365-246X.2002.01716.x"},{"key":"1_CR22","doi-asserted-by":"publisher","unstructured":"Kulisch, U.W., Miranker, W.L.: The arithmetic of the digital computer: a new approach. SIAM Rev. 28(1), 1\u201340 (1986). https:\/\/doi.org\/10.1137\/1028001, http:\/\/dx.doi.org\/10.1137\/1028001","DOI":"10.1137\/1028001"},{"key":"1_CR23","unstructured":"Langroudi, S.H.F., Pandit, T.N., Kudithipudi, D.: Deep learning inference on embedded devices: fixed-point vs posit. In: Energy Efficiency Machine Learning and Cognitive Computing for Embedded Applications (EMC$$^{2}$$) (2018). https:\/\/sites.google.com\/view\/asplos-emc2\/program"},{"key":"1_CR24","doi-asserted-by":"crossref","unstructured":"Lehoczky, Z., Szabo, A., Farkas, B.: High-level.NET software implementations of unum type I and posit with simultaneous FPGA implementation using Hastlayer. ACM (2018)","DOI":"10.1145\/3190339.3190343"},{"key":"1_CR25","doi-asserted-by":"publisher","unstructured":"Li, M., et al.: Evaluation of variable precision computing with variable precision FFT implementation on FPGA. In: 2016 International Conference on Field-Programmable Technology (FPT), pp. 299\u2013300 (2016). https:\/\/doi.org\/10.1109\/FPT.2016.7929560","DOI":"10.1109\/FPT.2016.7929560"},{"key":"1_CR26","doi-asserted-by":"crossref","unstructured":"Lindstrom, P., Lloyd, S., Hittinger, J.: Universal coding of the reals: alternatives to IEEE floating point. In: Conference for Next Generation Arithmetic. ACM (2018)","DOI":"10.1145\/3190339.3190344"},{"issue":"3","key":"1_CR27","doi-asserted-by":"publisher","first-page":"1241","DOI":"10.1109\/TETC.2022.3187199","volume":"10","author":"D Mallas\u00e9n","year":"2022","unstructured":"Mallas\u00e9n, D., Murillo, R., Barrio, A.A.D., Botella, G., Pi\u00f1uel, L., Prieto-Matias, M.: Percival: open-source posit RISC-V core with quire capability. IEEE Trans. Emerg. Top. Comput. 10(3), 1241\u20131252 (2022). https:\/\/doi.org\/10.1109\/TETC.2022.3187199","journal-title":"IEEE Trans. Emerg. Top. Comput."},{"key":"1_CR28","unstructured":"Oppenheim, A.V., Schafer, R.W.: Discrete-Time Signal Processing, Second Edition. Prentice-Hall (1998)"},{"key":"1_CR29","unstructured":"Podobas, A.: Accelerating POSIT-based computations using FPGAs and OpenCL (2018). https:\/\/posithub.org\/conga\/2018\/techprogramme#invitedtalk2"},{"issue":"3","key":"1_CR30","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1109\/TASSP.1976.1162805","volume":"24","author":"C Rader","year":"1976","unstructured":"Rader, C., Brenner, N.: A new principle for fast Fourier transformation. IEEE Trans. Acoust. Speech Signal Process. 24(3), 264\u2013266 (1976). https:\/\/doi.org\/10.1109\/TASSP.1976.1162805","journal-title":"IEEE Trans. Acoust. Speech Signal Process."},{"key":"1_CR31","unstructured":"Skamarock, W.C., Klemp, J.B., Dudhia, J.: Prototypes for the WRF (weather research and forecasting) model. In: Preprints, Ninth Conf. Mesoscale Processes, J11\u2013J15, American Meteorological Society, Fort Lauderdale, FL (2001)"},{"key":"1_CR32","unstructured":"Soni, M., Kunthe, P.: A General comparison of FFT algorithms (2011). http:\/\/pioneerjournal.in\/conferences\/tech-knowledge\/9th-national-conference\/3471-a-general-comparison-of-fft-algorithms.html"},{"key":"1_CR33","first-page":"44","volume":"458","author":"L Thomas","year":"1963","unstructured":"Thomas, L.: Using a computer to solve problems in physics. Appl. Digit. Comput. 458, 44\u201345 (1963)","journal-title":"Appl. Digit. Comput."},{"key":"1_CR34","doi-asserted-by":"crossref","unstructured":"Weinstein, C.J.: Quantization effects in digital filters. Technical report, MIT Lexington Lincoln Lab (1969)","DOI":"10.21236\/AD0706862"},{"issue":"141","key":"1_CR35","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1090\/S0025-5718-1978-0468306-4","volume":"32","author":"S Winograd","year":"1978","unstructured":"Winograd, S.: On computing the discrete Fourier transform. Math. Comput. 32(141), 175\u2013199 (1978)","journal-title":"Math. Comput."},{"key":"1_CR36","doi-asserted-by":"publisher","unstructured":"Winograd, S.: On the multiplicative complexity of the discrete Fourier transform. Adv. Math. 32(2), 83\u2013117 (1979). https:\/\/doi.org\/10.1016\/0001-8708(79)90037-9, http:\/\/www.sciencedirect.com\/science\/article\/pii\/0001870879900379","DOI":"10.1016\/0001-8708(79)90037-9"}],"container-title":["Lecture Notes in Computer Science","Next Generation Arithmetic"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-32180-1_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,11]],"date-time":"2023-05-11T12:03:11Z","timestamp":1683806591000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-32180-1_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031321795","9783031321801"],"references-count":36,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-32180-1_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"12 May 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CoNGA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Conference on Next Generation Arithmetic","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Singapore","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Singapore","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 March 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 March 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"conga2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.sc-asia.org\/conga\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Easy Chair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"16","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"11","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"69% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}