{"id":"https://openalex.org/W4319870573","doi":"https://doi.org/10.1145/3543622.3573181","title":"Approximate Hybrid Binary-Unary Computing with Applications in BERT Language Model and Image Processing","display_name":"Approximate Hybrid Binary-Unary Computing with Applications in BERT Language Model and Image Processing","publication_year":2023,"publication_date":"2023-02-10","ids":{"openalex":"https://openalex.org/W4319870573","doi":"https://doi.org/10.1145/3543622.3573181"},"language":"en","primary_location":{"id":"doi:10.1145/3543622.3573181","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3543622.3573181","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3543622.3573181","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2023 ACM/SIGDA International Symposium on Field Programmable Gate Arrays","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3543622.3573181","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5065614453","display_name":"Alireza Khataei","orcid":"https://orcid.org/0000-0002-9146-5684"},"institutions":[{"id":"https://openalex.org/I130238516","display_name":"University of Minnesota","ror":"https://ror.org/017zqws13","country_code":"US","type":"education","lineage":["https://openalex.org/I130238516"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Alireza Khataei","raw_affiliation_strings":["University of Minnesota, Minneapolis, MN, USA"],"raw_orcid":"https://orcid.org/0000-0002-9146-5684","affiliations":[{"raw_affiliation_string":"University of Minnesota, Minneapolis, MN, USA","institution_ids":["https://openalex.org/I130238516"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5102933509","display_name":"Gaurav Singh","orcid":"https://orcid.org/0000-0001-5232-8145"},"institutions":[{"id":"https://openalex.org/I130238516","display_name":"University of Minnesota","ror":"https://ror.org/017zqws13","country_code":"US","type":"education","lineage":["https://openalex.org/I130238516"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Gaurav Singh","raw_affiliation_strings":["University of Minnesota, Minneapolis, MN, USA"],"raw_orcid":"https://orcid.org/0000-0001-5232-8145","affiliations":[{"raw_affiliation_string":"University of Minnesota, Minneapolis, MN, USA","institution_ids":["https://openalex.org/I130238516"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5013257804","display_name":"Kia Bazargan","orcid":"https://orcid.org/0000-0003-3624-7366"},"institutions":[{"id":"https://openalex.org/I130238516","display_name":"University of Minnesota","ror":"https://ror.org/017zqws13","country_code":"US","type":"education","lineage":["https://openalex.org/I130238516"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Kia Bazargan","raw_affiliation_strings":["University of Minnesota, Minneapolis, MN, USA"],"raw_orcid":"https://orcid.org/0000-0003-3624-7366","affiliations":[{"raw_affiliation_string":"University of Minnesota, Minneapolis, MN, USA","institution_ids":["https://openalex.org/I130238516"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I130238516"],"apc_list":null,"apc_paid":null,"fwci":5.6405,"has_fulltext":true,"cited_by_count":11,"citation_normalized_percentile":{"value":0.97283101,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":96,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"165","last_page":"175"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10363","display_name":"Low-power high-performance VLSI design","score":0.9991000294685364,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10363","display_name":"Low-power high-performance VLSI design","score":0.9991000294685364,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11321","display_name":"Error Correcting Code Techniques","score":0.9965999722480774,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11697","display_name":"Numerical Methods and Algorithms","score":0.9961000084877014,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/unary-operation","display_name":"Unary operation","score":0.9110585451126099},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.6494079828262329},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6187145113945007},{"id":"https://openalex.org/keywords/stochastic-computing","display_name":"Stochastic computing","score":0.5898499488830566},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5724020600318909},{"id":"https://openalex.org/keywords/image-processing","display_name":"Image processing","score":0.4187317490577698},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3786289393901825},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.3688087463378906},{"id":"https://openalex.org/keywords/image","display_name":"Image (mathematics)","score":0.29758119583129883},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.2798457741737366},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.24565169215202332},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.17598500847816467}],"concepts":[{"id":"https://openalex.org/C78023250","wikidata":"https://www.wikidata.org/wiki/Q657596","display_name":"Unary operation","level":2,"score":0.9110585451126099},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.6494079828262329},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6187145113945007},{"id":"https://openalex.org/C2780971903","wikidata":"https://www.wikidata.org/wiki/Q2933705","display_name":"Stochastic computing","level":3,"score":0.5898499488830566},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5724020600318909},{"id":"https://openalex.org/C9417928","wikidata":"https://www.wikidata.org/wiki/Q1070689","display_name":"Image processing","level":3,"score":0.4187317490577698},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3786289393901825},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.3688087463378906},{"id":"https://openalex.org/C115961682","wikidata":"https://www.wikidata.org/wiki/Q860623","display_name":"Image (mathematics)","level":2,"score":0.29758119583129883},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.2798457741737366},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.24565169215202332},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.17598500847816467},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3543622.3573181","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3543622.3573181","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3543622.3573181","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2023 ACM/SIGDA International Symposium on Field Programmable Gate Arrays","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.1145/3543622.3573181","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3543622.3573181","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3543622.3573181","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2023 ACM/SIGDA International Symposium on Field Programmable Gate Arrays","raw_type":"proceedings-article"},"sustainable_development_goals":[{"display_name":"Quality Education","id":"https://metadata.un.org/sdg/4","score":0.5199999809265137}],"awards":[{"id":"https://openalex.org/G6725241808","display_name":"PFI-TT: Harnessing the power of uncompressed number representation for modern computations","funder_award_id":"2016390","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320307791","display_name":"Cisco Systems","ror":"https://ror.org/03yt1ez60"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4319870573.pdf","grobid_xml":"https://content.openalex.org/works/W4319870573.grobid-xml"},"referenced_works_count":22,"referenced_works":["https://openalex.org/W1989100100","https://openalex.org/W2030898836","https://openalex.org/W2099690171","https://openalex.org/W2101765144","https://openalex.org/W2113310226","https://openalex.org/W2198739892","https://openalex.org/W2533474659","https://openalex.org/W2615589464","https://openalex.org/W2770265919","https://openalex.org/W2790846081","https://openalex.org/W2798084934","https://openalex.org/W2802559652","https://openalex.org/W2900009113","https://openalex.org/W2914968962","https://openalex.org/W2942157346","https://openalex.org/W3005260158","https://openalex.org/W3005946836","https://openalex.org/W3097425375","https://openalex.org/W3101493857","https://openalex.org/W4299513189","https://openalex.org/W4300985142","https://openalex.org/W6746019973"],"related_works":["https://openalex.org/W2888918612","https://openalex.org/W2166285859","https://openalex.org/W3148597776","https://openalex.org/W1538206641","https://openalex.org/W2025370853","https://openalex.org/W3211656382","https://openalex.org/W2060412688","https://openalex.org/W2035521462","https://openalex.org/W4396915211","https://openalex.org/W4319870573"],"abstract_inverted_index":{"We":[0,112,205],"propose":[1],"a":[2,74,77],"novel":[3],"method":[4,56,101,115,141,159,196,208],"for":[5,197],"approximate":[6],"hardware":[7,16,148],"implementation":[8],"of":[9,23,79,92,147,174,194,217],"univariate":[10],"math":[11],"functions":[12,25,47,106,129],"with":[13],"significantly":[14],"fewer":[15],"resources":[17],"compared":[18,176],"to":[19,95,107,116,177,209],"previous":[20,59,120,143],"approaches.":[21],"Examples":[22],"such":[24,48,81],"include":[26,230],"exp(x)":[27],"and":[28,45,53,88,123,133,171,183,201,221],"the":[29,90,93,110,117,161,178,191,223],"activation":[30],"function":[31,75],"GELU(x),":[32],"both":[33],"used":[34,41],"in":[35,42,67,105,145,213],"transformer":[36],"networks,":[37],"gamma(x),":[38],"which":[39],"is":[40,70],"image":[43,202],"processing,":[44],"other":[46],"as":[49],"tanh(x),":[50],"cosh(x),":[51],"sq(x),":[52],"sqrt(x).":[54],"The":[55,65],"builds":[57],"on":[58,61,127,166],"works":[60,144],"hybrid":[62,124,184],"binary-unary":[63,125,185],"computing.":[64],"novelty":[66],"our":[68,114,140,158,195,207],"approach":[69],"that":[71,82],"we":[72,189],"break":[73],"into":[76],"number":[78],"sub-functions":[80,94],"implementing":[83],"each":[84],"sub-function":[85],"becomes":[86,97],"cheap,":[87],"converting":[89],"output":[91],"binary":[96],"almost":[98],"trivial.":[99],"Our":[100],"also":[102,222],"uses":[103],"self-similarity":[104],"further":[108],"reduce":[109],"cost.":[111],"compare":[113],"conventional":[118,179],"binary,":[119,180],"stochastic":[121,181],"computing,":[122,182],"methods":[126],"several":[128],"at":[130],"8-,":[131],"12-,":[132],"16-bit":[134],"resolutions.":[135],"While":[136],"preserving":[137],"high":[138],"accuracy,":[139],"outperforms":[142],"terms":[146],"cost,":[149],"e.g.,":[150],"tolerating":[151],"less":[152],"than":[153],"0.01":[154],"mean":[155],"absolute":[156],"error,":[157],"reduces":[160],"(area":[162],"x":[163],"latency)":[164],"cost":[165],"average":[167],"by":[168],"5,":[169],"7,":[170],"2":[172],"orders":[173],"magnitude,":[175],"methods,":[186],"respectively.":[187],"Ultimately,":[188],"demonstrate":[190],"potential":[192],"benefits":[193],"natural":[198],"language":[199,219],"processing":[200,203],"applications.":[204],"deploy":[206],"implement":[210],"major":[211],"blocks":[212],"an":[214],"encoding":[215],"layer":[216],"BERT":[218],"model,":[220],"Roberts":[224],"Cross":[225],"edge":[226],"detection":[227],"algorithm.":[228],"Both":[229],"non-linear":[231],"functions.":[232]},"counts_by_year":[{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":5}],"updated_date":"2026-08-21T09:56:20.448147","created_date":"2025-10-10T00:00:00"}