{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T08:04:32Z","timestamp":1761897872795,"version":"3.40.3"},"publisher-location":"Cham","reference-count":13,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031321795"},{"type":"electronic","value":"9783031321801"}],"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_7","type":"book-chapter","created":{"date-parts":[[2023,5,11]],"date-time":"2023-05-11T12:02:53Z","timestamp":1683806573000},"page":"101-113","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Fused Three-Input SORN Arithmetic"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8214-7636","authenticated-orcid":false,"given":"Moritz","family":"B\u00e4rthel","sequence":"first","affiliation":[]},{"given":"Chen","family":"Yuxing","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9590-4579","authenticated-orcid":false,"given":"Nils","family":"H\u00fclsmeier","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1345-076X","authenticated-orcid":false,"given":"Jochen","family":"Rust","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3392-0471","authenticated-orcid":false,"given":"Steffen","family":"Paul","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,5,12]]},"reference":[{"key":"7_CR1","doi-asserted-by":"publisher","unstructured":"B\u00e4rthel, M., Rust, J., Paul, S.: Application-specific analysis of different SORN datatypes for unum type-2-based arithmetic. In: 2020 IEEE International Symposium on Circuits and Systems (ISCAS), pp. 1\u20135 (2020). https:\/\/doi.org\/10.1109\/ISCAS45731.2020.9181182","DOI":"10.1109\/ISCAS45731.2020.9181182"},{"key":"7_CR2","doi-asserted-by":"publisher","unstructured":"B\u00e4rthel, M., H\u00fclsmeier, N., Rust, J., Paul, S.: On the implementation of edge detection algorithms with SORN arithmetic. In: Conference on Next Generation Arithmetic, pp. 1\u201313. Springer (2022). https:\/\/doi.org\/10.1007\/978-3-031-09779-9_1","DOI":"10.1007\/978-3-031-09779-9_1"},{"key":"7_CR3","doi-asserted-by":"publisher","first-page":"91387","DOI":"10.1109\/ACCESS.2021.3091778","volume":"9","author":"M B\u00e4rthel","year":"2021","unstructured":"B\u00e4rthel, M., Knobbe, S., Rust, J., Paul, S.: Hardware implementation of a latency-reduced sphere decoder with SORN preprocessing. IEEE Access 9, 91387\u201391401 (2021). https:\/\/doi.org\/10.1109\/ACCESS.2021.3091778","journal-title":"IEEE Access"},{"key":"7_CR4","doi-asserted-by":"publisher","unstructured":"B\u00e4rthel, M., Rust, J., Gustafson, J., Paul, S.: Improving the precision of SORN arithmetic by introducing fused operations. In: 2022 IEEE International Symposium on Circuits and Systems (ISCAS), pp. 258\u2013262 (2022). https:\/\/doi.org\/10.1109\/ISCAS48785.2022.9937595","DOI":"10.1109\/ISCAS48785.2022.9937595"},{"issue":"1","key":"7_CR5","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1145\/103162.103163","volume":"23","author":"D Goldberg","year":"1991","unstructured":"Goldberg, D.: What every computer scientist should know about floating-point arithmetic. ACM Comput. Surveys (CSUR) 23(1), 5\u201348 (1991)","journal-title":"ACM Comput. Surveys (CSUR)"},{"issue":"2","key":"7_CR6","doi-asserted-by":"publisher","first-page":"38","DOI":"10.14529\/jsfi160203","volume":"3","author":"JL Gustafson","year":"2016","unstructured":"Gustafson, J.L.: A radical approach to computation with real numbers. Supercomput. Front. Innovations 3(2), 38\u201353 (2016). https:\/\/doi.org\/10.14529\/jsfi160203","journal-title":"Supercomput. Front. Innovations"},{"key":"7_CR7","volume-title":"The End of Error: Unum Computing","author":"JL Gustafson","year":"2015","unstructured":"Gustafson, J.L.: The End of Error: Unum Computing. CRC Press, Boca Raton (2015)"},{"key":"7_CR8","doi-asserted-by":"publisher","unstructured":"H\u00fclsmeier, N., B\u00e4rthel, M., Karsthof, L., Rust, J., Paul, S.: Hybrid SORN implementation of k-nearest neighbor algorithm on FPGA. In: 2022 20th IEEE Interregional NEWCAS Conference (NEWCAS), pp. 163\u2013167 (2022). https:\/\/doi.org\/10.1109\/NEWCAS52662.2022.9841985","DOI":"10.1109\/NEWCAS52662.2022.9841985"},{"key":"7_CR9","doi-asserted-by":"publisher","unstructured":"Johnson, J.: Rethinking floating point for deep learning (2018). https:\/\/doi.org\/10.48550\/ARXIV.1811.01721","DOI":"10.48550\/ARXIV.1811.01721"},{"issue":"3","key":"7_CR10","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1007\/s11155-006-7220-9","volume":"12","author":"R Kirchner","year":"2006","unstructured":"Kirchner, R., Kulisch, U.W.: Hardware support for interval arithmetic. Reliable Comput. 12(3), 225\u2013237 (2006). https:\/\/doi.org\/10.1007\/s11155-006-7220-9","journal-title":"Reliable Comput."},{"key":"7_CR11","doi-asserted-by":"publisher","unstructured":"Microprocessor Standards Committee of the IEEE Computer Society: IEEE standard for floating-point arithmetic. IEEE Std 754\u20132008, 1\u201370 (2008). https:\/\/doi.org\/10.1109\/IEEESTD.2008.4610935","DOI":"10.1109\/IEEESTD.2008.4610935"},{"key":"7_CR12","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1145\/1837934.1837937","volume":"19","author":"SM Rump","year":"2010","unstructured":"Rump, S.M.: Verification methods: rigorous results using floating-point arithmetic. Acta Numer 19, 287\u2013449 (2010). https:\/\/doi.org\/10.1145\/1837934.1837937","journal-title":"Acta Numer"},{"key":"7_CR13","doi-asserted-by":"publisher","unstructured":"Zolfagharinejad, M., Kamal, M., Afzali-Khusha, A., Pedram, M.: Posit process element for using in energy-efficient DNN accelerators. IEEE Trans. Very Large Scale Integr. (VLSI) Syst. 30(6), 844\u2013848 (2022). https:\/\/doi.org\/10.1109\/TVLSI.2022.3165510","DOI":"10.1109\/TVLSI.2022.3165510"}],"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_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,11]],"date-time":"2023-05-11T12:03:56Z","timestamp":1683806636000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-32180-1_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031321795","9783031321801"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-32180-1_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"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)"}}]}}