{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,26]],"date-time":"2025-02-26T05:34:36Z","timestamp":1740548076707,"version":"3.38.0"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540290131"},{"type":"electronic","value":"9783540320807"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11556930_16","type":"book-chapter","created":{"date-parts":[[2010,9,29]],"date-time":"2010-09-29T01:18:41Z","timestamp":1285723121000},"page":"146-155","source":"Crossref","is-referenced-by-count":0,"title":["A High Level Constant Coefficient Multiplier Power Model for Power Estimation on High Levels of Abstraction"],"prefix":"10.1007","author":[{"given":"Arne","family":"Schulz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andreas","family":"Schallenberg","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Domenik","family":"Helms","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Milan","family":"Schulte","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Axel","family":"Reimer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wolfgang","family":"Nebel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"2","key":"16_CR1","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1093\/qjmam\/4.2.236","volume":"IV","author":"D. Booth","year":"1951","unstructured":"Booth, D.: A signed binary multiplication technique. Quart. J. Mech. App. Math.\u00a0IV(2), 236\u2013240 (1951)","journal-title":"Quart. J. Mech. App. Math."},{"key":"16_CR2","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1016\/S0065-2458(08)60610-5","volume":"1","author":"G.W. Reitwiesner","year":"1960","unstructured":"Reitwiesner, G.W.: \u2018\u201cBinary Arithmetic\u2019\u201d. Advances in Computers\u00a01, 231\u2013308 (1960)","journal-title":"Advances in Computers"},{"key":"16_CR3","doi-asserted-by":"publisher","first-page":"677","DOI":"10.1109\/82.539000","volume":"43","author":"R.I. Hartley","year":"1996","unstructured":"Hartley, R.I.: Subexpression Sharing in Filters Using Canonical Signed Digit Multipliers. IEEE Transactions on Circuits and Systems-II: Analog and Digital Signal Processing\u00a043, 677\u2013688 (1996)","journal-title":"IEEE Transactions on Circuits and Systems-II: Analog and Digital Signal Processing"},{"key":"16_CR4","doi-asserted-by":"crossref","unstructured":"Stammermann, A., Helms, D., Schulte, M., Schulz, A., Nebel, W.: Binding, Allocation and Floorplanning in Low Power High-Level Synthesis. In: International Conference on Computer Aided Design, ICCAD (2003)","DOI":"10.1109\/ICCAD.2003.159736"},{"key":"16_CR5","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1109\/43.486662","volume":"15","author":"M. Potkonjak","year":"1996","unstructured":"Potkonjak, M., Srivastava, M.B., Chandrakasan, A.P.: Multiple constant multiplications: efficient and versatile framework and algorithms for exploring common subexpression elemination. IEEE Transactions CAD\u00a015, 151\u2013165 (1996)","journal-title":"IEEE Transactions CAD"},{"key":"16_CR6","doi-asserted-by":"crossref","first-page":"58","DOI":"10.1109\/43.739059","volume":"18","author":"R. Pa\u0161ko","year":"1999","unstructured":"Pa\u0161ko, R., Schaumont, P., Derudder, V., Vernalde, S., \u010eurackov\u00e1, D.: A new algorithm for elimination of common subexpressions. IEEE Transactions CAD\u00a018, 58\u201368 (1999)","journal-title":"IEEE Transactions CAD"},{"key":"16_CR7","doi-asserted-by":"publisher","first-page":"196","DOI":"10.1109\/TCSII.2002.1013866","volume":"49","author":"M. Mart\u00ednez-Peir\u00f3","year":"2002","unstructured":"Mart\u00ednez-Peir\u00f3, M., Boemo, E.I., Wahammar, L.: Design of highspeed multiplierless filters using a nonrecursive signed common subexpression algorithm. IEEE Transactions on Circuits and Systems-II\u00a049, 196\u2013203 (2002)","journal-title":"IEEE Transactions on Circuits and Systems-II"},{"key":"16_CR8","doi-asserted-by":"crossref","unstructured":"Bull, D.R., Horrcks, D.H.: Primitive operator digital filter. In: Proceedings Inst. Elect. Eng. Circuits Devices Syst., vol.\u00a0138, pp. 401\u2013412 (1991)","DOI":"10.1049\/ip-g-2.1991.0066"},{"key":"16_CR9","doi-asserted-by":"publisher","first-page":"569","DOI":"10.1109\/82.466647","volume":"42","author":"G. Dempster","year":"1995","unstructured":"Dempster, G., Macleod, M.D.: Use of minimum adder multiplier blocks in FIR digital filters. IEEE Transactions on Circuits and Systems-II\u00a042, 569\u2013577 (1995)","journal-title":"IEEE Transactions on Circuits and Systems-II"},{"key":"16_CR10","doi-asserted-by":"publisher","first-page":"770","DOI":"10.1109\/82.959867","volume":"48","author":"H.-J. Kang","year":"2001","unstructured":"Kang, H.-J., Park, I.-C.: FIR filter synthesis algorithms for minimizing the delay and the number of adders. IEEE Transactions on Circuits and Systems-II\u00a048, 770\u2013777 (2001)","journal-title":"IEEE Transactions on Circuits and Systems-II"},{"key":"16_CR11","doi-asserted-by":"crossref","unstructured":"Dempster, G., Dimirsoy, S.S., Kale, I.: Designing multiplier blocks with low logic design. In: Proceedings IEEE Int. Symp. Circuits and Systems, vol.\u00a05, pp. 773\u2013776 (2002)","DOI":"10.1109\/ISCAS.2002.1010818"},{"key":"16_CR12","doi-asserted-by":"publisher","first-page":"2215","DOI":"10.1109\/TCSI.2004.836853","volume":"51","author":"C.-Y. Yao","year":"2004","unstructured":"Yao, C.-Y., Chen, H.-H., Lin, T.-F., Chien, C.-J., Hsu, C.-T.: A novel commonsubexpression- elmination method for synthesizing fixed-point FIR filters. IEEE Transactions on Circuits and Systems-I\u00a051, 2215\u20132221 (2004)","journal-title":"IEEE Transactions on Circuits and Systems-I"},{"key":"16_CR13","series-title":"Lecture Notes in Computer Science","first-page":"24","volume-title":"Integrated Circuit Design: Power and Timing Modeling, Optimization and Simulation","author":"G. C\u00f6lln (Jochens) von","year":"2000","unstructured":"von C\u00f6lln (Jochens), G., Kruse, L., Schmidt, E., Stammermann, A., Nebel, W.: Power macro-modelling for firm-macros. In: Soudris, D.J., Pirsch, P., Barke, E. (eds.) PATMOS 2000. LNCS, vol.\u00a01918, pp. 24\u201335. Springer, Heidelberg (2000)"},{"key":"16_CR14","unstructured":"Schmidt, E., Schulz, A., Kruse, L., von C\u00f6lln (Jochens), G., Nebel, W.: Automatic Generation of Complexity Functions for High Level Power Analysis. In: Proceedings of PATMOS 2001, pp. 26\u201335 (2001)"},{"key":"16_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1007\/3-540-45716-X_2","volume-title":"Integrated Circuit Design. Power and Timing Modeling, Optimization and Simulation","author":"D. Helms","year":"2002","unstructured":"Helms, D., Schmidt, E., Schulz, A.: An Improved Power Macro-Model for Arithmetic Datapath Components. In: Hochet, B., Acosta, A.J., Bellido, M.J. (eds.) PATMOS 2002. LNCS, vol.\u00a02451, pp. 16\u201324. Springer, Heidelberg (2002)"}],"container-title":["Lecture Notes in Computer Science","Integrated Circuit and System Design. Power and Timing Modeling, Optimization and Simulation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11556930_16.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,26]],"date-time":"2025-02-26T03:34:48Z","timestamp":1740540888000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11556930_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540290131","9783540320807"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/11556930_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}