{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,4]],"date-time":"2025-12-04T10:00:03Z","timestamp":1764842403450,"version":"3.41.0"},"reference-count":55,"publisher":"Association for Computing Machinery (ACM)","issue":"5","license":[{"start":{"date-parts":[[2020,9,30]],"date-time":"2020-09-30T00:00:00Z","timestamp":1601424000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"National Science Foundation","award":["CNS-1149285, CNS-1718033, and CCF-1909244"],"award-info":[{"award-number":["CNS-1149285, CNS-1718033, and CCF-1909244"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Embed. Comput. Syst."],"published-print":{"date-parts":[[2020,9,30]]},"abstract":"<jats:p>\n            In this article, we introduce a\n            <jats:bold>p<\/jats:bold>\n            arallelizing\n            <jats:bold>a<\/jats:bold>\n            pproximatio\n            <jats:bold>n<\/jats:bold>\n            -\n            <jats:bold>d<\/jats:bold>\n            isc\n            <jats:bold>o<\/jats:bold>\n            very f\n            <jats:bold>ra<\/jats:bold>\n            mework, PANDORA, for automatically discovering application- and architecture-specialized approximations of provided code. PANDORA complements existing compilers and runtime optimizers by generating approximations with a range of Pareto-optimal tradeoffs between performance and error, which enables adaptation to different inputs, different user preferences, and different runtime conditions (e.g., battery life). We demonstrate that PANDORA can create parallel approximations of inherently sequential code by discovering alternative implementations that eliminate loop-carried dependencies. For a variety of functions with loop-carried dependencies, PANDORA generates approximations that achieve speedups ranging from 2.3x to 81x, with acceptable error for many usage scenarios. We also demonstrate PANDORA\u2019s architecture-specialized approximations via FPGA experiments, and highlight PANDORA\u2019s discovery capabilities by removing loop-carried dependencies from a recurrence relation with no known closed-form solution.\n          <\/jats:p>","DOI":"10.1145\/3391899","type":"journal-article","created":{"date-parts":[[2020,7,7]],"date-time":"2020-07-07T12:39:02Z","timestamp":1594125542000},"page":"1-17","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":6,"title":["PANDORA"],"prefix":"10.1145","volume":"19","author":[{"given":"Greg","family":"Stitt","sequence":"first","affiliation":[{"name":"University of Florida, Gainesville, FL"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David","family":"Campbell","sequence":"additional","affiliation":[{"name":"University of Florida, Gainesville, FL"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2020,11,11]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2005.119"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.5555\/2190025.2190056"},{"key":"e_1_2_1_3_1","volume-title":"Proceedings of the 31st ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI\u201910)","author":"Baek Woongki","year":"1806","unstructured":"Woongki Baek and Trishul M. Chilimbi . 2010. Green: A framework for supporting energy-conscious programming using controlled approximation . In Proceedings of the 31st ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI\u201910) . ACM, New York, NY, 198--209. DOI:https:\/\/doi.org\/10.1145\/ 1806 596.1806620 10.1145\/1806596.1806620 Woongki Baek and Trishul M. Chilimbi. 2010. Green: A framework for supporting energy-conscious programming using controlled approximation. In Proceedings of the 31st ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI\u201910). ACM, New York, NY, 198--209. DOI:https:\/\/doi.org\/10.1145\/1806596.1806620"},{"key":"e_1_2_1_4_1","first-page":"1","article-title":"A 30 year retrospective on Dennard\u2019s MOSFET scaling paper. Solid-State Circuits","volume":"12","author":"Bohr M.","year":"2007","unstructured":"M. Bohr . 2007 . A 30 year retrospective on Dennard\u2019s MOSFET scaling paper. Solid-State Circuits Soc. Newsl., IEEE 12 , 1 (Winter 2007), 11--13. DOI:https:\/\/doi.org\/10.1109\/N-SSC.2007.4785534 10.1109\/N-SSC.2007.4785534 M. Bohr. 2007. A 30 year retrospective on Dennard\u2019s MOSFET scaling paper. Solid-State Circuits Soc. Newsl., IEEE 12, 1 (Winter 2007), 11--13. DOI:https:\/\/doi.org\/10.1109\/N-SSC.2007.4785534","journal-title":"Soc. Newsl., IEEE"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-8191(98)00020-9"},{"key":"e_1_2_1_6_1","volume-title":"Maximizing multiprocessor performance with the SUIF compiler. Comput. 29, 12","author":"Bugnion E.","year":"1996","unstructured":"E. Bugnion , Shih-Wei Liao , B. R. Murphy , S. P. Amarasinghe , J. M. Anderson , M. W. Hall , and M. S Lam . 1996. Maximizing multiprocessor performance with the SUIF compiler. Comput. 29, 12 ( 1996 ), 84,85,86,87,88,89. DOI:https:\/\/doi.org\/10.1109\/2.546613 10.1109\/2.546613 E. Bugnion, Shih-Wei Liao, B. R. Murphy, S. P. Amarasinghe, J. M. Anderson, M. W. Hall, and M. S Lam. 1996. Maximizing multiprocessor performance with the SUIF compiler. Comput. 29, 12 (1996), 84,85,86,87,88,89. DOI:https:\/\/doi.org\/10.1109\/2.546613"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.5555\/2665671.2665705"},{"volume-title":"Proceedings of the ACM SIGPLAN 2013 Workshop on Partial Evaluation and Program Manipulation (PEPM\u201913)","author":"Carbin Michael","key":"e_1_2_1_8_1","unstructured":"Michael Carbin , Deokhwan Kim , Sasa Misailovic , and Martin C. Rinard . 2013. Verified integrity properties for safe approximate program transformations . In Proceedings of the ACM SIGPLAN 2013 Workshop on Partial Evaluation and Program Manipulation (PEPM\u201913) . ACM, New York, NY, 63--66. DOI:https:\/\/doi.org\/10.1145\/2426890.2426901 10.1145\/2426890.2426901 Michael Carbin, Deokhwan Kim, Sasa Misailovic, and Martin C. Rinard. 2013. Verified integrity properties for safe approximate program transformations. In Proceedings of the ACM SIGPLAN 2013 Workshop on Partial Evaluation and Program Manipulation (PEPM\u201913). ACM, New York, NY, 63--66. DOI:https:\/\/doi.org\/10.1145\/2426890.2426901"},{"volume-title":"Proceedings of the 2013 ACM SIGPLAN International Conference on Object Oriented Programming Systems Languages 8 Applications (OOPSLA\u201913)","author":"Carbin Michael","key":"e_1_2_1_9_1","unstructured":"Michael Carbin , Sasa Misailovic , and Martin C. Rinard . 2013. Verifying quantitative reliability for programs that execute on unreliable hardware . In Proceedings of the 2013 ACM SIGPLAN International Conference on Object Oriented Programming Systems Languages 8 Applications (OOPSLA\u201913) . ACM, New York, NY, 33--52. DOI:https:\/\/doi.org\/10.1145\/2509136.2509546 10.1145\/2509136.2509546 Michael Carbin, Sasa Misailovic, and Martin C. Rinard. 2013. Verifying quantitative reliability for programs that execute on unreliable hardware. In Proceedings of the 2013 ACM SIGPLAN International Conference on Object Oriented Programming Systems Languages 8 Applications (OOPSLA\u201913). ACM, New York, NY, 33--52. DOI:https:\/\/doi.org\/10.1145\/2509136.2509546"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/DATE.2006.243978"},{"volume-title":"Proceedings of the 2008 International Conference on Compilers, Architectures and Synthesis for Embedded Systems (CASES\u201908)","author":"Chakrapani Lakshmi N. B.","key":"e_1_2_1_11_1","unstructured":"Lakshmi N. B. Chakrapani , Kirthi Krishna Muntimadugu , Avinash Lingamneni , Jason George , and Krishna V. Palem . 2008. Highly energy and performance efficient embedded computing through approximately correct arithmetic: A mathematical foundation and preliminary experimental validation . In Proceedings of the 2008 International Conference on Compilers, Architectures and Synthesis for Embedded Systems (CASES\u201908) . ACM, New York, NY, 187--196. DOI:https:\/\/doi.org\/10.1145\/1450095.1450124 10.1145\/1450095.1450124 Lakshmi N. B. Chakrapani, Kirthi Krishna Muntimadugu, Avinash Lingamneni, Jason George, and Krishna V. Palem. 2008. Highly energy and performance efficient embedded computing through approximately correct arithmetic: A mathematical foundation and preliminary experimental validation. In Proceedings of the 2008 International Conference on Compilers, Architectures and Synthesis for Embedded Systems (CASES\u201908). ACM, New York, NY, 187--196. DOI:https:\/\/doi.org\/10.1145\/1450095.1450124"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/2463209.2488873"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF00889887"},{"key":"e_1_2_1_14_1","volume-title":"MIPRO, 2010 Proceedings of the 33rd International Convention. 84--88","author":"de la Guia Solaz M.","year":"2010","unstructured":"M. de la Guia Solaz and Richard Conway . 2010 . Comparative study on wordlength reduction and truncation for low power multipliers . In MIPRO, 2010 Proceedings of the 33rd International Convention. 84--88 . M. de la Guia Solaz and Richard Conway. 2010. Comparative study on wordlength reduction and truncation for low power multipliers. In MIPRO, 2010 Proceedings of the 33rd International Convention. 84--88."},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/PACT.2005.33"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/2150976.2151008"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/MICRO.2012.48"},{"key":"e_1_2_1_18_1","volume-title":"Marc-Andr\u00e9 Gardner, Marc Parizeau, and Christian Gagn\u00e9.","author":"Fortin F\u00e9lix-Antoine","year":"2012","unstructured":"F\u00e9lix-Antoine Fortin , Fran\u00e7ois-Michel De Rainville , Marc-Andr\u00e9 Gardner, Marc Parizeau, and Christian Gagn\u00e9. 2012 . DEAP : Evolutionary algorithms made easy. J. Mach. Learn. Res . 13 (July 2012), 2171--2175. F\u00e9lix-Antoine Fortin, Fran\u00e7ois-Michel De Rainville, Marc-Andr\u00e9 Gardner, Marc Parizeau, and Christian Gagn\u00e9. 2012. DEAP: Evolutionary algorithms made easy. J. Mach. Learn. Res. 13 (July 2012), 2171--2175."},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/2145694.2145704"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/210184.210189"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISLPED.2011.5993675"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/ETS.2013.6569370"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/1143997.1144142"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.5555\/70405.70408"},{"key":"e_1_2_1_25_1","first-page":"4","article-title":"Moore\u2019s law is dying (and that could be good). Spectrum","volume":"52","author":"Huang A.","year":"2015","unstructured":"A. Huang . 2015 . Moore\u2019s law is dying (and that could be good). Spectrum , IEEE 52 , 4 (April 2015), 43--47. DOI:https:\/\/doi.org\/10.1109\/MSPEC.2015.7065418 10.1109\/MSPEC.2015.7065418 A. Huang. 2015. Moore\u2019s law is dying (and that could be good). Spectrum, IEEE 52, 4 (April 2015), 43--47. DOI:https:\/\/doi.org\/10.1109\/MSPEC.2015.7065418","journal-title":"IEEE"},{"volume-title":"Iterative Compilation","author":"Knijnenburg P. M. W.","key":"e_1_2_1_26_1","unstructured":"P. M. W. Knijnenburg , T. Kisuki , and M. F. P. O\u2019Boyle . 2002. Iterative Compilation . Springer-Verlag New York, Inc. , New York, NY , 171--187. P. M. W. Knijnenburg, T. Kisuki, and M. F. P. O\u2019Boyle. 2002. Iterative Compilation. Springer-Verlag New York, Inc., New York, NY, 171--187."},{"key":"e_1_2_1_27_1","volume-title":"Genetic Programming II: Automatic Discovery of Reusable Programs","author":"Koza John R.","year":"1994","unstructured":"John R. Koza . 1994 . Genetic Programming II: Automatic Discovery of Reusable Programs . MIT Press , Cambridge, MA . John R. Koza. 1994. Genetic Programming II: Automatic Discovery of Reusable Programs. MIT Press, Cambridge, MA."},{"key":"e_1_2_1_28_1","first-page":"5","article-title":"Is \u201cgood enough\u201d computing good enough?Commun","volume":"58","author":"Kugler Logan","year":"2015","unstructured":"Logan Kugler . 2015 . Is \u201cgood enough\u201d computing good enough?Commun . ACM 58 , 5 (April 2015), 12--14. DOI:https:\/\/doi.org\/10.1145\/2742482 10.1145\/2742482 Logan Kugler. 2015. Is \u201cgood enough\u201d computing good enough?Commun. ACM 58, 5 (April 2015), 12--14. DOI:https:\/\/doi.org\/10.1145\/2742482","journal-title":"ACM"},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/2384616.2384628"},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCSII.2006.873364"},{"key":"e_1_2_1_31_1","volume-title":"Proceedings of the 16th International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS XVI). ACM","author":"Liu Song","year":"1950","unstructured":"Song Liu , Karthik Pattabiraman , Thomas Moscibroda , and Benjamin G. Zorn . 2011. Flikker: Saving DRAM refresh-power through critical data partitioning . In Proceedings of the 16th International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS XVI). ACM , New York, NY, 213--224. DOI:https:\/\/doi.org\/10.1145\/ 1950 365.1950391 10.1145\/1950365.1950391 Song Liu, Karthik Pattabiraman, Thomas Moscibroda, and Benjamin G. Zorn. 2011. Flikker: Saving DRAM refresh-power through critical data partitioning. In Proceedings of the 16th International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS XVI). ACM, New York, NY, 213--224. DOI:https:\/\/doi.org\/10.1145\/1950365.1950391"},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/2330163.2330273"},{"volume-title":"Proceedings of the 2014 ACM International Conference on Object Oriented Programming Systems Languages 8 Applications (OOPSLA\u201914)","author":"Misailovic Sasa","key":"e_1_2_1_33_1","unstructured":"Sasa Misailovic , Michael Carbin , Sara Achour , Zichao Qi , and Martin C. Rinard . 2014. Chisel: Reliability- and accuracy-aware optimization of approximate computational kernels . In Proceedings of the 2014 ACM International Conference on Object Oriented Programming Systems Languages 8 Applications (OOPSLA\u201914) . ACM, New York, NY, 309--328. DOI:https:\/\/doi.org\/10.1145\/2660193.2660231 10.1145\/2660193.2660231 Sasa Misailovic, Michael Carbin, Sara Achour, Zichao Qi, and Martin C. Rinard. 2014. Chisel: Reliability- and accuracy-aware optimization of approximate computational kernels. In Proceedings of the 2014 ACM International Conference on Object Oriented Programming Systems Languages 8 Applications (OOPSLA\u201914). ACM, New York, NY, 309--328. DOI:https:\/\/doi.org\/10.1145\/2660193.2660231"},{"key":"e_1_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/2714064.2660231"},{"key":"e_1_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/2465787.2465790"},{"volume-title":"Proceedings of the 2012 ACM Workshop on Relaxing Synchronization for Multicore and Manycore Scalability (RACES\u201912)","author":"Misailovic Sasa","key":"e_1_2_1_36_1","unstructured":"Sasa Misailovic , Stelios Sidiroglou , and Martin C. Rinard . 2012. Dancing with uncertainty . In Proceedings of the 2012 ACM Workshop on Relaxing Synchronization for Multicore and Manycore Scalability (RACES\u201912) . ACM, New York, NY, 51--60. DOI:https:\/\/doi.org\/10.1145\/2414729.2414738 10.1145\/2414729.2414738 Sasa Misailovic, Stelios Sidiroglou, and Martin C. Rinard. 2012. Dancing with uncertainty. In Proceedings of the 2012 ACM Workshop on Relaxing Synchronization for Multicore and Manycore Scalability (RACES\u201912). ACM, New York, NY, 51--60. DOI:https:\/\/doi.org\/10.1145\/2414729.2414738"},{"key":"e_1_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1109\/DATE.2011.5763154"},{"key":"e_1_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1109\/HPCA.2015.7056066"},{"key":"e_1_2_1_39_1","volume-title":"Proceedings of the Conference on Design, Automation and Test in Europe (DATE\u201910)","author":"Narayanan Sriram","year":"1870","unstructured":"Sriram Narayanan , John Sartori , Rakesh Kumar , and Douglas L. Jones . 2010. Scalable stochastic processors . In Proceedings of the Conference on Design, Automation and Test in Europe (DATE\u201910) . European Design and Automation Association, 3001 Leuven, Belgium, Belgium, 335--338. http:\/\/dl.acm.org\/citation.cfm?id= 1870 926.1871008. Sriram Narayanan, John Sartori, Rakesh Kumar, and Douglas L. Jones. 2010. Scalable stochastic processors. In Proceedings of the Conference on Design, Automation and Test in Europe (DATE\u201910). European Design and Automation Association, 3001 Leuven, Belgium, Belgium, 335--338. http:\/\/dl.acm.org\/citation.cfm?id=1870926.1871008."},{"key":"e_1_2_1_40_1","first-page":"3","article-title":"Data memory organization and optimizations in application-specific systems","volume":"18","author":"Panda Preeti Ranjan","year":"2001","unstructured":"Preeti Ranjan Panda , Nikil D. Dutt , Alexandru Nicolau , Francky Catthoor , Arnout Vandecappelle , Erik Brockmeyer , Chidamber Kulkarni , and Eddy De Greef . 2001 . Data memory organization and optimizations in application-specific systems . IEEE Des. Test 18 , 3 (May 2001), 56--68. DOI:https:\/\/doi.org\/10.1109\/54.922803 10.1109\/54.922803 Preeti Ranjan Panda, Nikil D. Dutt, Alexandru Nicolau, Francky Catthoor, Arnout Vandecappelle, Erik Brockmeyer, Chidamber Kulkarni, and Eddy De Greef. 2001. Data memory organization and optimizations in application-specific systems. IEEE Des. Test 18, 3 (May 2001), 56--68. DOI:https:\/\/doi.org\/10.1109\/54.922803","journal-title":"IEEE Des. Test"},{"key":"e_1_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1162\/neco.1991.3.2.246"},{"key":"e_1_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1109\/TVLSI.2008.2003481"},{"key":"e_1_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.procs.2014.05.082"},{"key":"e_1_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1145\/2414729.2414737"},{"key":"e_1_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1145\/1993316.1993518"},{"key":"e_1_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1145\/2025113.2025133"},{"key":"e_1_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10586-012-0200-4"},{"key":"e_1_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1145\/3316482.3326345"},{"volume-title":"Advances in Neural Information Processing Systems 9","author":"Vapnik Vladimir","key":"e_1_2_1_49_1","unstructured":"Vladimir Vapnik , Steven E. Golowich , and Alex Smola . 1996. Support vector method for function approximation, regression estimation, and signal processing . In Advances in Neural Information Processing Systems 9 . MIT Press , 281--287. Vladimir Vapnik, Steven E. Golowich, and Alex Smola. 1996. Support vector method for function approximation, regression estimation, and signal processing. In Advances in Neural Information Processing Systems 9. MIT Press, 281--287."},{"key":"e_1_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1145\/2540708.2540710"},{"volume-title":"Proceedings of the 2012 49th ACM\/EDAC\/IEEE Design Automation Conference (DAC). 796--801","author":"Venkataramani S.","key":"e_1_2_1_51_1","unstructured":"S. Venkataramani , A. Sabne , V. Kozhikkottu , K. Roy , and A. Raghunathan . 2012. SALSA: Systematic logic synthesis of approximate circuits . In Proceedings of the 2012 49th ACM\/EDAC\/IEEE Design Automation Conference (DAC). 796--801 . S. Venkataramani, A. Sabne, V. Kozhikkottu, K. Roy, and A. Raghunathan. 2012. SALSA: Systematic logic synthesis of approximate circuits. In Proceedings of the 2012 49th ACM\/EDAC\/IEEE Design Automation Conference (DAC). 796--801."},{"key":"e_1_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.1145\/2145816.2145875"},{"key":"e_1_2_1_53_1","volume-title":"Proceedings of the Conference Record of the 34th Asilomar Conference on Signals, Systems and Computers, 2000","volume":"2","author":"Wires K. E.","year":"2000","unstructured":"K. E. Wires , M. J. Schulte , and J. E. Stine . 2000. Variable-correction truncated floating point multipliers . In Proceedings of the Conference Record of the 34th Asilomar Conference on Signals, Systems and Computers, 2000 , Vol. 2 . 1344--1348. DOI:https:\/\/doi.org\/10.1109\/ACSSC. 2000 .911211 10.1109\/ACSSC.2000.911211 K. E. Wires, M. J. Schulte, and J. E. Stine. 2000. Variable-correction truncated floating point multipliers. In Proceedings of the Conference Record of the 34th Asilomar Conference on Signals, Systems and Computers, 2000, Vol. 2. 1344--1348. DOI:https:\/\/doi.org\/10.1109\/ACSSC.2000.911211"},{"key":"e_1_2_1_54_1","doi-asserted-by":"crossref","first-page":"8","DOI":"10.1109\/TVLSI.2009.2020591","article-title":"Design of low-power high-speed truncation-error-tolerant adder and its application in digital signal processing","volume":"18","author":"Zhu Ning","year":"2010","unstructured":"Ning Zhu , Wang Ling Goh , Weija Zhang , Kiat Seng Yeo , and Zhi Hui Kong . 2010 . Design of low-power high-speed truncation-error-tolerant adder and its application in digital signal processing . IEEE Trans. Very Large Scale Integr. VLSI Syst. 18 , 8 (Aug. 2010), 1225--1229. DOI:https:\/\/doi.org\/10.1109\/TVLSI.2009.2020591 10.1109\/TVLSI.2009.2020591 Ning Zhu, Wang Ling Goh, Weija Zhang, Kiat Seng Yeo, and Zhi Hui Kong. 2010. Design of low-power high-speed truncation-error-tolerant adder and its application in digital signal processing. IEEE Trans. Very Large Scale Integr. VLSI Syst. 18, 8 (Aug. 2010), 1225--1229. DOI:https:\/\/doi.org\/10.1109\/TVLSI.2009.2020591","journal-title":"IEEE Trans. Very Large Scale Integr. VLSI Syst."},{"key":"e_1_2_1_55_1","doi-asserted-by":"publisher","DOI":"10.1145\/2103621.2103710"}],"container-title":["ACM Transactions on Embedded Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3391899","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3391899","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T22:41:42Z","timestamp":1750200102000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3391899"}},"subtitle":["An Architecture-Independent Parallelizing Approximation-Discovery Framework"],"short-title":[],"issued":{"date-parts":[[2020,9,30]]},"references-count":55,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2020,9,30]]}},"alternative-id":["10.1145\/3391899"],"URL":"https:\/\/doi.org\/10.1145\/3391899","relation":{},"ISSN":["1539-9087","1558-3465"],"issn-type":[{"type":"print","value":"1539-9087"},{"type":"electronic","value":"1558-3465"}],"subject":[],"published":{"date-parts":[[2020,9,30]]},"assertion":[{"value":"2019-11-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2020-03-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2020-11-11","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}