{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T18:48:37Z","timestamp":1743014917175,"version":"3.40.3"},"publisher-location":"New York, NY","reference-count":58,"publisher":"Springer New York","isbn-type":[{"type":"print","value":"9781461468585"},{"type":"electronic","value":"9781461468592"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-1-4614-6859-2_19","type":"book-chapter","created":{"date-parts":[[2013,6,19]],"date-time":"2013-06-19T16:35:53Z","timestamp":1371659753000},"page":"593-637","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Arithmetic"],"prefix":"10.1007","author":[{"given":"Oscar","family":"Gustafsson","sequence":"first","affiliation":[]},{"given":"Lars","family":"Wanhammar","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2013,5,10]]},"reference":[{"key":"19_CR1","doi-asserted-by":"publisher","first-page":"1045","DOI":"10.1109\/T-C.1973.223648","volume":"22","author":"C. R. Baugh","year":"1973","unstructured":"C. R. Baugh and B. A. Wooley, \u201cA two\u2019s complement parallel array multiplication algorithm,\u201d IEEE Trans. Comput., vol.\u00a022, pp.\u00a01045\u20131047, Dec. 1973.","journal-title":"IEEE Trans. Comput."},{"issue":"3","key":"19_CR2","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/BF02407084","volume":"9","author":"K. Bickerstaff","year":"1995","unstructured":"K.\u00a0Bickerstaff, M.\u00a0J.\u00a0Schulte, and E.\u00a0E. Swartzlander, Jr., \u201cParallel reduced area multipliers,\u201d J. VLSI Signal Processing, vol.\u00a09, no.\u00a03, pp.\u00a0181\u2013191, Nov. 1995.","journal-title":"J. VLSI Signal Processing"},{"key":"19_CR3","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1109\/TC.1982.1675982","volume":"31","author":"R. P. Brent","year":"1982","unstructured":"R.\u00a0P.\u00a0Brent and H.\u00a0T.\u00a0Kung, \u201cA regular layout for parallel adders,\u201d IEEE Trans. Comput., vol.\u00a031, pp.\u00a0260\u2013264, Mar. 1982.","journal-title":"IEEE Trans. Comput."},{"issue":"10","key":"19_CR4","doi-asserted-by":"publisher","first-page":"322","DOI":"10.1109\/LSP.2002.803408","volume":"9","author":"S. C. Chan","year":"2002","unstructured":"S.\u00a0C.\u00a0Chan and P.\u00a0M.\u00a0Yiu, \u201cAn efficient multiplierless approximation of the fast Fourier transform using sum-of-powers-of-two (SOPOT) coefficients,\u201d IEEE Signal Processing Lett., vol.\u00a09, no.\u00a010, pp.\u00a0322\u2013325, Oct. 2002.","journal-title":"IEEE Signal Processing Lett."},{"key":"19_CR5","doi-asserted-by":"crossref","unstructured":"T.\u00a0A.\u00a0C.\u00a0M.\u00a0Claasen, W.\u00a0F.\u00a0G.\u00a0Mecklenbr\u00e4uker, and J.\u00a0B.\u00a0H.\u00a0Peek, \u201cEffects of quantization and overflow in recursive digital filters,\u201d IEEE Trans. Acoust. Speech Signal Processing, vol.\u00a024, no.\u00a06, Dec. 1976.","DOI":"10.1109\/TASSP.1976.1162863"},{"key":"19_CR6","unstructured":"A.\u00a0Croisier, D.\u00a0J.\u00a0Esteban, M.\u00a0E.\u00a0Levilion, and V.\u00a0Rizo, \u201cDigital filter for PCM encoded signals,\u201d U.S. Patent 3 777 130, Dec. 4, 1973."},{"key":"19_CR7","first-page":"349","volume":"34","author":"L. Dadda","year":"1965","unstructured":"L.\u00a0Dadda, \u201cSome schemes for parallel multipliers,\u201d Alta Frequenza, vol.\u00a034, pp.\u00a0349\u2013356, May 1965.","journal-title":"Alta Frequenza"},{"issue":"3","key":"19_CR8","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1109\/TC.2005.54","volume":"54","author":"F. de Dinechin","year":"2005","unstructured":"F. de Dinechin and A. Tisserand, \u201cMultipartite table methods,\u201d IEEE Trans. Comput., vol.\u00a054, no.\u00a03, pp.\u00a0319\u2013330, Mar. 2005.","journal-title":"IEEE Trans. Comput."},{"key":"19_CR9","doi-asserted-by":"publisher","first-page":"895","DOI":"10.1109\/TC.1987.1676986","volume":"36","author":"M. D. Ercegovac","year":"1987","unstructured":"M.\u00a0D. Ercegovac and T. Lang, \u201cOn-the-fly conversion of redundant into conventional representation,\u201d IEEE Trans. Comput., vol.\u00a036, pp.\u00a0895\u2013897, July 1987.","journal-title":"IEEE Trans. Comput."},{"key":"19_CR10","unstructured":"M.\u00a0D. Ercegovac and T. Lang, Division and Square Root: Digit-Recurrence Algorithms and Implementations, Kluwer Academic Publishers, 1994."},{"key":"19_CR11","doi-asserted-by":"crossref","unstructured":"M.\u00a0D. Ercegovac and T. Lang, Digital Arithmetic, Morgan Kaufmann Publishers, 2004.","DOI":"10.1016\/B978-155860798-9\/50011-7"},{"key":"19_CR12","unstructured":"H.\u00a0Eriksson, P.\u00a0Larsson-Edefors, M.\u00a0Sheeran, M.\u00a0Sj\u00e4lander, D.\u00a0Johansson, and M.\u00a0Sch\u00f6lin, \u201cMultiplier reduction tree with logarithmic logic depth and regular connectivity,\u201d in Proc. IEEE Int. Symp. Circuits Syst., 2006."},{"key":"19_CR13","doi-asserted-by":"crossref","unstructured":"A.\u00a0Fettweis, and K.\u00a0Meerk\u00f6tter, \u201cOn parasitic oscillations in digital filters under looped conditions,\u201d IEEE Trans. Circuits Syst., vol.\u00a024, no.\u00a09, pp.\u00a0475\u2013481, Sept. 1977.","DOI":"10.1109\/TCS.1977.1084376"},{"key":"19_CR14","doi-asserted-by":"crossref","unstructured":"O. Gustafsson, \u201cA difference based adder graph heuristic for multiple constant multiplication problems,\u201d in Proc. IEEE Int. Symp. Circuits Syst., 2007.","DOI":"10.1109\/ISCAS.2007.378201"},{"key":"19_CR15","doi-asserted-by":"crossref","unstructured":"O. Gustafsson, \u201cLower bounds for constant multiplication problems,\u201d IEEE Trans. Circuits Syst. II, vol.\u00a054, no.\u00a011, pp.\u00a0974\u2013978, Nov. 2007.","DOI":"10.1109\/TCSII.2007.903212"},{"key":"19_CR16","doi-asserted-by":"crossref","unstructured":"O. Gustafsson and K. Johansson, \u201cAn empirical study on standard cell synthesis of elementary function look-up tables,\u201d in Proc. Asilomar Conf. Signals Syst. Comput., 2008.","DOI":"10.1109\/ACSSC.2008.5074739"},{"key":"19_CR17","doi-asserted-by":"crossref","unstructured":"O. Gustafsson and L. Wanhammar, \u201cLow-complexity and high-speed constant multiplications for digital filters using carry-save arithmetic\u201d in Digital Filters, Intech, 2011.","DOI":"10.5772\/16081"},{"key":"19_CR18","doi-asserted-by":"crossref","unstructured":"O. Gustafsson, A. G. Dempster, K. Johansson, M. D. Macleod, and L. Wanhammar, \u201cSimplified design of constant coefficient multipliers,\u201d Circuits, Syst. Signal Processing, vol.\u00a025, no.\u00a02, pp.\u00a0225\u2013251, Apr. 2006.","DOI":"10.1007\/s00034-005-2505-5"},{"key":"19_CR19","unstructured":"D. Harris, \u201cA taxonomy of parallel prefix networks\u201d, in Proc. Asilomar Conf. Signals Syst. Comput., 2003."},{"issue":"10","key":"19_CR20","doi-asserted-by":"publisher","first-page":"677","DOI":"10.1109\/82.539000","volume":"43","author":"R. I. Hartley","year":"1996","unstructured":"R.\u00a0I.\u00a0Hartley, \u201cSubexpression sharing in filters using canonic signed digit multipliers,\u201d IEEE Trans. Circuits Syst. II, vol.\u00a043, no.\u00a010, pp.\u00a0677\u2013688, Oct.\u00a01996.","journal-title":"IEEE Trans. Circuits Syst. II"},{"key":"19_CR21","unstructured":"IEEE 754-2008 Standard for Floating-Point Arithmetic"},{"key":"19_CR22","doi-asserted-by":"crossref","unstructured":"K.\u00a0Johansson, O.\u00a0Gustafsson, and L.\u00a0Wanhammar, \u201cPower estimation for ripple-carry adders with correlated input data,\u201d in Proc. Int. Workshop Power Timing Modeling Optimization Simulation, 2004.","DOI":"10.1007\/978-3-540-30205-6_68"},{"key":"19_CR23","unstructured":"S. Knowles, \u201cA family of adders,\u201d in Proc. Symp. Comput. Arithmetic, 1990, pp.\u00a030\u201334."},{"key":"19_CR24","doi-asserted-by":"crossref","unstructured":"P.\u00a0Kornerup and D.\u00a0W.\u00a0Matula, Finite Precision Number Systems and Arithmetic, Cambridge University Press, 2010.","DOI":"10.1017\/CBO9780511778568"},{"key":"19_CR25","doi-asserted-by":"publisher","first-page":"786","DOI":"10.1109\/TC.1973.5009159","volume":"22","author":"P. M. Kogge","year":"1973","unstructured":"P.\u00a0M.\u00a0Kogge and H.\u00a0S.\u00a0Stone, \u201cA parallel algorithm for the efficient solution of a general class of recurrence equations,\u201d IEEE Trans. Comput., vol.\u00a022, pp.\u00a0786\u2013793, 1973.","journal-title":"IEEE Trans. Comput."},{"key":"19_CR26","volume-title":"Computer Arithmetic Algorithms","author":"I. Koren","year":"2002","unstructured":"I. Koren, Computer Arithmetic Algorithms, 2nd edition, A. K. Peters, Natick, MA, 2002.","edition":"2"},{"key":"19_CR27","doi-asserted-by":"crossref","unstructured":"R.\u00a0E.\u00a0Ladner and M.\u00a0J.\u00a0Fischer, \u201cParallel prefix computation,\u201d J. ACM, vol\u00a027, pp.\u00a0831\u2013838. Oct. 1980.","DOI":"10.1145\/322217.322232"},{"issue":"12","key":"19_CR28","doi-asserted-by":"publisher","first-page":"3032","DOI":"10.1109\/78.969511","volume":"49","author":"J. Liang","year":"2001","unstructured":"J.\u00a0Liang and T.\u00a0D.\u00a0Tran, \u201cFast multiplierless approximations of the DCT with the lifting scheme,\u201d IEEE Trans. Signal Processing, vol.\u00a049, no.\u00a012, pp.\u00a03032\u20133044, Dec. 2001.","journal-title":"IEEE Trans. Signal Processing"},{"issue":"10","key":"19_CR29","doi-asserted-by":"publisher","first-page":"1333","DOI":"10.1109\/12.166611","volume":"41","author":"Y.-C. Lim","year":"1992","unstructured":"Y.-C. Lim, \u201cSingle-precision multiplier with reduced circuit complexity for signal processing applications,\u201d IEEE Trans. Comput., vol.\u00a041, no.\u00a010, pp.\u00a01333\u20131336, Oct. 1992.","journal-title":"IEEE Trans. Comput."},{"issue":"5","key":"19_CR30","doi-asserted-by":"publisher","first-page":"577","DOI":"10.1109\/82.769806","volume":"46","author":"Y.-C. Lim","year":"1999","unstructured":"Y.-C.\u00a0Lim, R.\u00a0Yang, D.\u00a0Li, and J.\u00a0Song, \u201cSigned power-of-two term allocation scheme for the design of digital filters,\u201d IEEE Trans. Circuits Syst. II, vol.\u00a046, no.\u00a05, pp.\u00a0577\u2013584, May 1999.","journal-title":"IEEE Trans. Circuits Syst. II"},{"key":"19_CR31","doi-asserted-by":"publisher","first-page":"670","DOI":"10.1109\/TCT.1971.1083365","volume":"18","author":"B. Liu","year":"1971","unstructured":"B.\u00a0Liu, \u201cEffect of finite word length on the accuracy of digital filters\u00a0\u2013 a review,\u201d IEEE Trans. Circuit Theory, vol.\u00a018, pp.\u00a0670\u2013677, Nov. 1971.","journal-title":"IEEE Trans. Circuit Theory"},{"key":"19_CR32","doi-asserted-by":"publisher","first-page":"1735","DOI":"10.1109\/PROC.1969.7388","volume":"57","author":"B. Liu","year":"1969","unstructured":"B.\u00a0Liu and T.\u00a0Kaneko, \u201cError analysis of digital filters realized with floating-point arithmetic,\u201d Proc. IEEE, vol.\u00a057, pp.\u00a01735\u20131747, Oct. 1969.","journal-title":"Proc. IEEE"},{"issue":"1","key":"19_CR33","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1109\/JRPROC.1961.287779","volume":"49","author":"O. L. MacSorley","year":"1961","unstructured":"O.\u00a0L.\u00a0MacSorley, \u201cHigh-speed arithmetic in binary computers,\u201d Proc. IRE, vol.\u00a049, no.\u00a01, pp.\u00a067\u201391, Jan. 1961.","journal-title":"Proc. IRE"},{"key":"19_CR34","doi-asserted-by":"crossref","unstructured":"P. K. Meher, J. Valls, T.-B. Juang, K. Sridharan, and K. Maharatna, \u201c50 years of CORDIC: Algorithms, architectures and applications,\u201d IEEE Trans. Circuits Syst. I, vol.\u00a056, no.\u00a09, pp.\u00a01893\u20131907, Sept. 2009.","DOI":"10.1109\/TCSI.2009.2025803"},{"key":"19_CR35","doi-asserted-by":"crossref","unstructured":"Z.-J. Mou and F. Jutand, \u201c\u2019Overturned-Stairs\u2019 adder trees and multiplier design,\u201d IEEE Trans. Comput., vol.\u00a041, no.\u00a08, pp.\u00a0940\u2013948, Aug. 1992.","DOI":"10.1109\/12.156536"},{"key":"19_CR36","unstructured":"J.-M. Muller, Elementary Functions: Algorithms and Implementation, 2nd Edition, Birkh\u00e4user Boston, 2006."},{"key":"19_CR37","doi-asserted-by":"crossref","unstructured":"J.-M. Muller, N. Brisebarre, F. de Dinechin, C.-P. Jeannerod, V. Lef\u00e9vre, G. Melquiond, N.\u00a0Revol, D. Stehl\u00e9, and S. Torres, Handbook of Floating-Point Arithmetic, Birkh\u00e4user Boston, 2010.","DOI":"10.1007\/978-0-8176-4705-6"},{"key":"19_CR38","doi-asserted-by":"crossref","unstructured":"V.\u00a0G. Oklobdzija, D.\u00a0Villeger, and S.\u00a0S. Liu, \u201cA method for speed optimized partial product reduction and generation of fast parallel multipliers using an algorithmic approach,\u201d IEEE Trans. Comput., vol.\u00a045, no.\u00a03, Mar. 1996.","DOI":"10.1109\/12.485568"},{"key":"19_CR39","doi-asserted-by":"crossref","unstructured":"A. Omondi and B. Premkumar, Residue Number Systems: Theory and Implementation, Imperial College Press, 2007.","DOI":"10.1142\/p523"},{"key":"19_CR40","doi-asserted-by":"crossref","unstructured":"S. T. Oskuii, P. G. Kjeldsberg, and O. Gustafsson, \u201cA method for power optimized partial product reduction in parallel multipliers,\u201d in Proc. IEEE Norchip Conf., 2007.","DOI":"10.1109\/NORCHP.2007.4481034"},{"key":"19_CR41","volume-title":"Computer Arithmetic: Algorithms and Hardware Designs","author":"B. Parhami","year":"2010","unstructured":"B. Parhami, Computer Arithmetic: Algorithms and Hardware Designs, 2nd edition, Oxford University Press, New York, 2010.","edition":"2"},{"key":"19_CR42","doi-asserted-by":"crossref","unstructured":"N. Petra, D. De Caro, V. Garofalo, E. Napoli, and A. G. M. Strollo, \u201cTruncated binary multipliers with variable correction and minimum mean square error,\u201d IEEE Trans. Circuits Syst. I, 2010.","DOI":"10.1109\/TCSI.2009.2033536"},{"issue":"2","key":"19_CR43","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1109\/43.486662","volume":"15","author":"M. Potkonjak","year":"1996","unstructured":"M.\u00a0Potkonjak, M.\u00a0B.\u00a0Srivastava, and A.\u00a0P.\u00a0Chandrakasan, \u201cMultiple constant multiplications: efficient and versatile framework and algorithms for exploring common subexpression elimination,\u201d IEEE Trans. Computer-Aided Design, vol.\u00a015, no.\u00a02, pp.\u00a0151\u2013165, Feb.\u00a01996.","journal-title":"IEEE Trans. Computer-Aided Design"},{"issue":"2","key":"19_CR44","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1109\/JPROC.2004.840306","volume":"93","author":"M. P\u00fcschel","year":"2005","unstructured":"M. P\u00fcschel, J. M. F. Moura, J. Johnson, D. Padua, M. Veloso, B. Singer, J. Xiong, F. Franchetti, A. Gacic, Y. Voronenko, K. Chen, R. W. Johnson, and N. Rizzolo, \u201cSPIRAL: Code generation for DSP transforms,\u201d Proc. IEEE, vol.\u00a093, no.\u00a02, pp.\u00a0232\u2013275, Feb.\u00a02005.","journal-title":"Proc. IEEE"},{"issue":"1","key":"19_CR45","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1109\/78.157184","volume":"40","author":"B. D. Rao","year":"1992","unstructured":"B.\u00a0D.\u00a0Rao, \u201cFloating point arithmetic and digital filters,\u201d IEEE Trans. Signal Processing, vol.\u00a040, no.\u00a01, pp.\u00a085\u201395, Jan. 1992.","journal-title":"IEEE Trans. Signal Processing"},{"issue":"10","key":"19_CR46","doi-asserted-by":"publisher","first-page":"709","DOI":"10.1109\/TCS.1983.1085294","volume":"30","author":"H. Samueli","year":"1983","unstructured":"H.\u00a0Samueli and A.\u00a0N.\u00a0Willson Jr., \u201cNonperiodic forced overflow oscillations in digital filters,\u201d IEEE Trans. Circuits Syst., vol.\u00a030, no.\u00a010, pp.\u00a0709\u2013722, Oct. 1983.","journal-title":"IEEE Trans. Circuits Syst."},{"key":"19_CR47","doi-asserted-by":"crossref","unstructured":"M. J. Schulte and J. E. Stine, \u201cApproximating elementary functions with symmetric bipartite tables,\u201d IEEE Trans. Comput., no.\u00a08, vol.\u00a048, pp.\u00a0842\u2013847, Aug. 1999.","DOI":"10.1109\/12.795125"},{"issue":"3","key":"19_CR48","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1007\/BF00929625","volume":"14","author":"P. F. Stelling","year":"1996","unstructured":"P. F. Stelling and V. G. Oklobdzija, \u201cDesign strategies for optimal hybrid final adders in a parallel multiplier,\u201d J. VLSI Signal Processing, vol.\u00a014, no.\u00a03, pp.\u00a0321\u2013331, Dec. 1996.","journal-title":"J. VLSI Signal Processing"},{"key":"19_CR49","doi-asserted-by":"crossref","unstructured":"D. Timmerman, H. Hahn, B. J. Hosticka, and B. Rix, \u201cA new addition scheme and fast scaling factor compensation methods for CORDIC algorithms,\u201d Integration, the VLSI Journal, vol.\u00a011, pp.\u00a085\u2013100, Nov. 1991.","DOI":"10.1016\/0167-9260(91)90008-9"},{"key":"19_CR50","doi-asserted-by":"publisher","first-page":"330","DOI":"10.1109\/TEC.1959.5222693","volume":"8","author":"J. E. Volder","year":"1959","unstructured":"J. E. Volder, \u201cThe CORDIC trigonometric computing technique,\u201d IRE Trans. Elec. Comput., vol.\u00a08, pp.\u00a0330\u2013334, 1959.","journal-title":"IRE Trans. Elec. Comput."},{"key":"19_CR51","doi-asserted-by":"crossref","unstructured":"J. E. Volder, \u201cThe birth of CORDIC,\u201d J. VLSI Signal Processing, vol.\u00a025, 2000.","DOI":"10.1023\/A:1008110704586"},{"key":"19_CR52","doi-asserted-by":"crossref","unstructured":"Y. Voronenko and M. P\u00fcschel, \u201cMultiplierless multiple constant multiplication,\u201d ACM Trans. Algorithms vol.\u00a03, no.\u00a02, May 2007.","DOI":"10.1145\/1240233.1240234"},{"issue":"1","key":"19_CR53","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1109\/PGEC.1964.263830","volume":"13","author":"C. Wallace","year":"1964","unstructured":"C.\u00a0Wallace, \u201cA suggestion for a fast multiplier,\u201d IEEE Trans. Electron. Comput., vol.\u00a013, no.\u00a01, pp.\u00a014\u201317, Feb. 1964.","journal-title":"IEEE Trans. Electron. Comput."},{"key":"19_CR54","first-page":"379","volume":"38","author":"J. S. Walther","year":"1971","unstructured":"J. S. Walther, \u201cA unified algorithm for elementary functions,\u201d Spring Joint Computer Conf. Proc., vol.\u00a038, pp.\u00a0379\u2013385, 1971.","journal-title":"Spring Joint Computer Conf. Proc."},{"key":"19_CR55","doi-asserted-by":"crossref","unstructured":"J. S. Walther, \u201cThe story of unified CORDIC,\u201d J. VLSI Signal Processing, vol.\u00a025, 2000.","DOI":"10.1023\/A:1008162721424"},{"key":"19_CR56","doi-asserted-by":"crossref","unstructured":"L. Wanhammar, DSP Integrated Circuits, Academic Press, 1999.","DOI":"10.1016\/B978-012734530-7\/50001-5"},{"issue":"6","key":"19_CR57","doi-asserted-by":"publisher","first-page":"590","DOI":"10.1109\/31.81854","volume":"38","author":"B. Zeng","year":"1991","unstructured":"B.\u00a0Zeng and Y.\u00a0Neuvo, \u201cAnalysis of floating point roundoff errors using dummy multiplier coefficient sensitivities,\u201d IEEE Trans. Circuits Syst., vol.\u00a038, no.\u00a06, pp.\u00a0590\u2013601, June 1991.","journal-title":"IEEE Trans. Circuits Syst."},{"key":"19_CR58","unstructured":"R. Zimmermann, Binary adder architectures for cell-based VLSI and their synthesis, Ph.D. Thesis, Swiss Federal Institute of Technology (ETH), Zurich, Hartung-Gorre Verlag, 1998."}],"container-title":["Handbook of Signal Processing Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-1-4614-6859-2_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,23]],"date-time":"2023-01-23T18:21:40Z","timestamp":1674498100000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-1-4614-6859-2_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9781461468585","9781461468592"],"references-count":58,"URL":"https:\/\/doi.org\/10.1007\/978-1-4614-6859-2_19","relation":{},"subject":[],"published":{"date-parts":[[2013]]},"assertion":[{"value":"10 May 2013","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}