[{"ddc":["006"],"user_id":"49051","_id":"16853","page":"2","has_accepted_license":"1","status":"public","project":[{"_id":"52","name":"Computing Resources Provided by the Paderborn Center for Parallel Computing"}],"citation":{"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} }","short":"L.M. Witschen, H. Ghasemzadeh Mohammadi, M. Artmann, M. Platzner, Fourth Workshop on Approximate Computing (AxC 2019) (n.d.).","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>.","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.","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>.","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>."},"file_date_updated":"2020-04-25T08:00:35Z","language":[{"iso":"eng"}],"date_updated":"2022-01-06T06:52:57Z","publication_status":"accepted","author":[{"full_name":"Witschen, Linus Matthias","last_name":"Witschen","first_name":"Linus Matthias","id":"49051"},{"first_name":"Hassan","last_name":"Ghasemzadeh Mohammadi","full_name":"Ghasemzadeh Mohammadi, Hassan","id":"61186"},{"full_name":"Artmann, Matthias","first_name":"Matthias","last_name":"Artmann"},{"last_name":"Platzner","first_name":"Marco","full_name":"Platzner, Marco","id":"398"}],"title":"Jump Search: A Fast Technique for the Synthesis of Approximate Circuits","year":"2019","department":[{"_id":"78"}],"type":"preprint","keyword":["Approximate computing","parameter selection","search space exploration","verification","circuit synthesis"],"date_created":"2020-04-25T08:02:07Z","file":[{"date_created":"2020-04-25T08:00:35Z","creator":"witschen","content_type":"application/pdf","success":1,"file_id":"16854","file_size":152806,"access_level":"closed","file_name":"AxC19_paper_3.pdf","date_updated":"2020-04-25T08:00:35Z","relation":"main_file"}],"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."}],"publication":"Fourth Workshop on Approximate Computing (AxC 2019)"}]