{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,7]],"date-time":"2026-03-07T01:01:45Z","timestamp":1772845305837,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":31,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642327698","type":"print"},{"value":"9783642327704","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-32770-4_5","type":"book-chapter","created":{"date-parts":[[2012,9,26]],"date-time":"2012-09-26T00:28:20Z","timestamp":1348619300000},"page":"73-93","source":"Crossref","is-referenced-by-count":13,"title":["Multiplierless Design of Linear DSP Transforms"],"prefix":"10.1007","author":[{"given":"Levent","family":"Aksoy","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eduardo","family":"da Costa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Paulo","family":"Flores","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jos\u00e9","family":"Monteiro","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"5_CR1","doi-asserted-by":"crossref","unstructured":"Quereshi, F., Gustafsson, O.: Low-Complexity Reconfigurable Complex Constant Multiplication for FFTs. In: Proc. of IEEE International Symposium on Circuits and Systems, pp. 24\u201327 (2009)","DOI":"10.1109\/ISCAS.2009.5117961"},{"key":"5_CR2","doi-asserted-by":"crossref","unstructured":"Thong, J., Nicolici, N.: A Novel Optimal Single Constant Multiplication Algorithm. In: Proc. of Design Automation Conference, pp. 613\u2013616 (2010)","DOI":"10.1145\/1837274.1837424"},{"issue":"8","key":"5_CR3","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 Trans. on Circuits and Systems II: Analog and Digital Signal Processing\u00a048(8), 770\u2013777 (2001)","journal-title":"IEEE Trans. on Circuits and Systems II: Analog and Digital Signal Processing"},{"issue":"10","key":"5_CR4","doi-asserted-by":"publisher","first-page":"677","DOI":"10.1109\/82.539000","volume":"43","author":"R. Hartley","year":"1996","unstructured":"Hartley, R.: Subexpression Sharing in Filters Using Canonic Signed Digit Multipliers. IEEE Trans. on Circuits and Systems II\u00a043(10), 677\u2013688 (1996)","journal-title":"IEEE Trans. on Circuits and Systems II"},{"issue":"10","key":"5_CR5","doi-asserted-by":"publisher","first-page":"1271","DOI":"10.1109\/TC.2005.168","volume":"54","author":"N. Boullis","year":"2005","unstructured":"Boullis, N., Tisserand, A.: Some Optimizations of Hardware Multiplication by Constant Matrices. IEEE Trans. on Computers\u00a054(10), 1271\u20131282 (2005)","journal-title":"IEEE Trans. on Computers"},{"issue":"1","key":"5_CR6","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1109\/PGEC.1964.263830","volume":"13","author":"C. Wallace","year":"1964","unstructured":"Wallace, C.: A Suggestion for a Fast Multiplier. IEEE Trans. on Electronic Computers\u00a013(1), 14\u201317 (1964)","journal-title":"IEEE Trans. on Electronic Computers"},{"key":"5_CR7","doi-asserted-by":"crossref","unstructured":"Gallagher, W., Swartzlander, E.: High Radix Booth Multipliers Using Reduced Area Adder Trees. In: Proc. of Asilomar Conference on Signals, Systems and Computers, pp. 545\u2013549 (1994)","DOI":"10.1109\/ACSSC.1994.471512"},{"issue":"4","key":"5_CR8","doi-asserted-by":"publisher","first-page":"419","DOI":"10.1109\/92.863621","volume":"8","author":"H. Nguyen","year":"2000","unstructured":"Nguyen, H., Chatterjee, A.: Number-Splitting With Shift-and-Add Decomposition for Power and Hardware Optimization in Linear DSP Synthesis. IEEE Trans. on VLSI\u00a08(4), 419\u2013424 (2000)","journal-title":"IEEE Trans. on VLSI"},{"issue":"2","key":"5_CR9","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1109\/43.486662","volume":"15","author":"M. Potkonjak","year":"1996","unstructured":"Potkonjak, M., Srivastava, M., Chandrakasan, A.: Multiple Constant Multiplications: Efficient and Versatile Framework and Algorithms for Exploring Common Subexpression Elimination. IEEE Trans. on Computer-Aided Design of Integrated Circuits\u00a015(2), 151\u2013165 (1996)","journal-title":"IEEE Trans. on Computer-Aided Design of Integrated Circuits"},{"issue":"6","key":"5_CR10","doi-asserted-by":"publisher","first-page":"1013","DOI":"10.1109\/TCAD.2008.923242","volume":"27","author":"L. Aksoy","year":"2008","unstructured":"Aksoy, L., Costa, E., Flores, P., Monteiro, J.: Exact and Approximate Algorithms for the Optimization of Area and Delay in Multiple Constant Multiplications. IEEE Trans. on Computer-Aided Design of Integrated Circuits\u00a027(6), 1013\u20131026 (2008)","journal-title":"IEEE Trans. on Computer-Aided Design of Integrated Circuits"},{"issue":"3","key":"5_CR11","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1023\/A:1008125221674","volume":"22","author":"A. Yurdakul","year":"1999","unstructured":"Yurdakul, A., D\u00fcndar, G.: Multiplierless Realization of Linear DSP Transforms by Using Common Two-Term Expressions. The Journal of VLSI Signal Processing\u00a022(3), 163\u2013172 (1999)","journal-title":"The Journal of VLSI Signal Processing"},{"key":"5_CR12","doi-asserted-by":"crossref","unstructured":"Hosangadi, A., Fallah, F., Kastner, R.: Reducing Hardware Complexity of Linear DSP Systems by Iteratively Eliminating Two-Term Common Subexpressions. In: Proc. of Asia and South Pacific Design Automation Conference, pp. 523\u2013528 (2005)","DOI":"10.1145\/1120725.1120953"},{"issue":"1","key":"5_CR13","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1145\/2071356.2071359","volume":"17","author":"L. Aksoy","year":"2012","unstructured":"Aksoy, L., Costa, E., Flores, P., Monteiro, J.: Optimization Algorithms for the Multiplierless Realization of Linear Transforms. ACM Trans. on Design Automation of Electronic Systems\u00a017(1), Article 3 (2012)","journal-title":"ACM Trans. on Design Automation of Electronic Systems"},{"issue":"3","key":"5_CR14","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1049\/ip-g-2.1991.0066","volume":"138","author":"D. Bull","year":"1991","unstructured":"Bull, D., Horrocks, D.: Primitive Operator Digital Filters. IEE Proc. G: Circuits, Devices and Systems\u00a0138(3), 401\u2013412 (1991)","journal-title":"IEE Proc. G: Circuits, Devices and Systems"},{"issue":"9","key":"5_CR15","doi-asserted-by":"publisher","first-page":"569","DOI":"10.1109\/82.466647","volume":"42","author":"A. Dempster","year":"1995","unstructured":"Dempster, A., Macleod, M.: Use of Minimum-Adder Multiplier Blocks in FIR Digital Filters. IEEE Trans. on Circuits and Systems II\u00a042(9), 569\u2013577 (1995)","journal-title":"IEEE Trans. on Circuits and Systems II"},{"key":"5_CR16","doi-asserted-by":"crossref","unstructured":"Gustafsson, O., Wanhammar, L.: A Novel Approach to Multiple Constant Multiplication Using Minimum Spanning Trees. In: Proc. of IEEE Midwest Symposium on Circuits and Systems, pp. 652\u2013655 (2002)","DOI":"10.1109\/MWSCAS.2002.1187124"},{"key":"5_CR17","doi-asserted-by":"crossref","unstructured":"Voronenko, Y., P\u00fcschel, M.: Multiplierless Multiple Constant Multiplication. ACM Trans. on Algorithms\u00a03(2) (2007)","DOI":"10.1145\/1240233.1240234"},{"issue":"5","key":"5_CR18","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1016\/j.micpro.2009.10.001","volume":"34","author":"L. Aksoy","year":"2010","unstructured":"Aksoy, L., Gunes, E., Flores, P.: Search Algorithms for the Multiple Constant Multiplications Problem: Exact and Approximate. Elsevier Journal on Microprocessors and Microsystems\u00a034(5), 151\u2013162 (2010)","journal-title":"Elsevier Journal on Microprocessors and Microsystems"},{"key":"5_CR19","unstructured":"Dempster, A., Gustafsson, O., Coleman, J.: Towards an Algorithm for Matrix Multiplier Blocks. In: Proc. of IEEE European Conference on Circuit Theory and Design, pp. 1\u20134 (2003)"},{"key":"5_CR20","unstructured":"Gustafsson, O., Ohlsson, H., Wanhammar, L.: Low-Complexity Constant Coefficient Matrix Multiplication Using a Minimum Spanning Tree. In: Proc. of Nordic Signal Processing Symposium, pp. 141\u2013144 (2004)"},{"key":"5_CR21","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1109\/TEC.1961.5219227","volume":"EC-10","author":"A. Avizienis","year":"1961","unstructured":"Avizienis, A.: Signed-digit Number Representation for Fast Parallel Arithmetic. IRE Trans. on Electronic Computers\u00a0EC-10, 389\u2013400 (1961)","journal-title":"IRE Trans. on Electronic Computers"},{"key":"5_CR22","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1016\/S0065-2458(08)60420-9","volume":"6","author":"H. Garner","year":"1965","unstructured":"Garner, H.: Number Systems and Arithmetic. Advances in Computers\u00a06, 131\u2013194 (1965)","journal-title":"Advances in Computers"},{"key":"5_CR23","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1016\/S0065-2458(08)60610-5","volume":"1","author":"G. Reitwiesner","year":"1960","unstructured":"Reitwiesner, G.: Binary Arithmetic. Advances in Computers\u00a01, 261\u2013265 (1960)","journal-title":"Advances in Computers"},{"issue":"5","key":"5_CR24","doi-asserted-by":"publisher","first-page":"1037","DOI":"10.1109\/TASSP.1984.1164433","volume":"32","author":"P. Cappello","year":"1984","unstructured":"Cappello, P., Steiglitz, K.: Some Complexity Issues in Digital Signal Processing. IEEE Trans. on Acoustics, Speech, and Signal Processing\u00a032(5), 1037\u20131041 (1984)","journal-title":"IEEE Trans. on Acoustics, Speech, and Signal Processing"},{"key":"5_CR25","doi-asserted-by":"crossref","unstructured":"Ercegovac, M., Lang, T.: Digital Arithmetic. Morgan Kaufmann (2003)","DOI":"10.1016\/B978-155860798-9\/50011-7"},{"issue":"11","key":"5_CR26","doi-asserted-by":"publisher","first-page":"974","DOI":"10.1109\/TCSII.2007.903212","volume":"54","author":"O. Gustafsson","year":"2007","unstructured":"Gustafsson, O.: Lower Bounds for Constant Multiplication Problems. IEEE Trans. on Circuits and Systems II\u00a054(11), 974\u2013978 (2007)","journal-title":"IEEE Trans. on Circuits and Systems II"},{"key":"5_CR27","unstructured":"Hosangadi, A., Fallah, F., Kastner, R.: Simultaneous Optimization of Delay and Number of Operations in Multiplierless Implementation of Linear Systems. In: Proc. of International Workshop on Logic Synthesis (2005)"},{"key":"5_CR28","doi-asserted-by":"crossref","unstructured":"Arfaee, A., Irturk, A., Laptev, N., Fallah, F., Kastner, R.: Xquasher: A Tool for Efficient Computation of Multiple Linear Expressions. In: Proc. of Design Automation Conference, pp. 254\u2013257 (2009)","DOI":"10.1145\/1629911.1629980"},{"key":"5_CR29","unstructured":"Lefevre, V.: Multiplication by an Integer Constant. Technical report, Institut National de Recherche en Informatique et en Automatique (2001)"},{"issue":"8","key":"5_CR30","doi-asserted-by":"publisher","first-page":"729","DOI":"10.1016\/j.micpro.2011.08.009","volume":"35","author":"L. Aksoy","year":"2011","unstructured":"Aksoy, L., Costa, E., Flores, P., Monteiro, J.: Finding the Optimal Tradeoff Between Area and Delay in Multiple Constant Multiplications. Elsevier Journal on Microprocessors and Microsystems\u00a035(8), 729\u2013741 (2011)","journal-title":"Elsevier Journal on Microprocessors and Microsystems"},{"key":"5_CR31","unstructured":"Nangate website, http:\/\/www.nangate.com\/"}],"container-title":["IFIP Advances in Information and Communication Technology","VLSI-SoC: Advanced Research for Systems on Chip"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-32770-4_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,9]],"date-time":"2025-04-09T13:13:03Z","timestamp":1744204383000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-32770-4_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642327698","9783642327704"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-32770-4_5","relation":{},"ISSN":["1868-4238","1861-2288"],"issn-type":[{"value":"1868-4238","type":"print"},{"value":"1861-2288","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012]]}}}