{"_id":"16853","title":"Jump Search: A Fast Technique for the Synthesis of Approximate Circuits","department":[{"_id":"78"}],"user_id":"49051","citation":{"mla":"Witschen, Linus Matthias, et al. “Jump Search: A Fast Technique for the Synthesis of Approximate Circuits.” <i>Fourth Workshop on Approximate Computing (AxC 2019)</i>.","ama":"Witschen LM, Ghasemzadeh Mohammadi H, Artmann M, Platzner M. Jump Search: A Fast Technique for the Synthesis of Approximate Circuits. <i>Fourth Workshop on Approximate Computing (AxC 2019)</i>.","ieee":"L. M. Witschen, H. Ghasemzadeh Mohammadi, M. Artmann, and M. Platzner, “Jump Search: A Fast Technique for the Synthesis of Approximate Circuits,” <i>Fourth Workshop on Approximate Computing (AxC 2019)</i>. .","apa":"Witschen, L. M., Ghasemzadeh Mohammadi, H., Artmann, M., &#38; Platzner, M. (n.d.). Jump Search: A Fast Technique for the Synthesis of Approximate Circuits. <i>Fourth Workshop on Approximate Computing (AxC 2019)</i>.","bibtex":"@article{Witschen_Ghasemzadeh Mohammadi_Artmann_Platzner, title={Jump Search: A Fast Technique for the Synthesis of Approximate Circuits}, journal={Fourth Workshop on Approximate Computing (AxC 2019)}, author={Witschen, Linus Matthias and Ghasemzadeh Mohammadi, Hassan and Artmann, Matthias and Platzner, Marco} }","chicago":"Witschen, Linus Matthias, Hassan Ghasemzadeh Mohammadi, Matthias Artmann, and Marco Platzner. “Jump Search: A Fast Technique for the Synthesis of Approximate Circuits.” <i>Fourth Workshop on Approximate Computing (AxC 2019)</i>, n.d.","short":"L.M. Witschen, H. Ghasemzadeh Mohammadi, M. Artmann, M. Platzner, Fourth Workshop on Approximate Computing (AxC 2019) (n.d.)."},"status":"public","year":"2019","author":[{"first_name":"Linus Matthias","full_name":"Witschen, Linus Matthias","id":"49051","last_name":"Witschen"},{"first_name":"Hassan","last_name":"Ghasemzadeh Mohammadi","id":"61186","full_name":"Ghasemzadeh Mohammadi, Hassan"},{"first_name":"Matthias","full_name":"Artmann, Matthias","last_name":"Artmann"},{"full_name":"Platzner, Marco","last_name":"Platzner","id":"398","first_name":"Marco"}],"date_updated":"2022-01-06T06:52:57Z","type":"preprint","publication":"Fourth Workshop on Approximate Computing (AxC 2019)","language":[{"iso":"eng"}],"keyword":["Approximate computing","parameter selection","search space exploration","verification","circuit synthesis"],"file_date_updated":"2020-04-25T08:00:35Z","date_created":"2020-04-25T08:02:07Z","has_accepted_license":"1","project":[{"_id":"52","name":"Computing Resources Provided by the Paderborn Center for Parallel Computing"}],"abstract":[{"lang":"eng","text":"State-of-the-art frameworks for generating approximate circuits usually rely on information gained through circuit synthesis and/or verification to explore the search space and to find an optimal solution. Throughout the process, a large number of circuits may be subject to processing, leading to considerable runtimes. In this work, we propose a search which takes error bounds and pre-computed impact factors into account to reduce the number of invoked synthesis and verification processes. In our experimental results, we achieved speed-ups of up to 76x while area savings remain comparable to the reference search method, simulated annealing."}],"page":"2","file":[{"file_id":"16854","file_name":"AxC19_paper_3.pdf","success":1,"date_updated":"2020-04-25T08:00:35Z","date_created":"2020-04-25T08:00:35Z","creator":"witschen","file_size":152806,"access_level":"closed","content_type":"application/pdf","relation":"main_file"}],"ddc":["006"],"publication_status":"accepted"}