{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,10,23]],"date-time":"2023-10-23T13:41:31Z","timestamp":1698068491286},"reference-count":19,"publisher":"Wiley","issue":"3","license":[{"start":{"date-parts":[[2006,12,13]],"date-time":"2006-12-13T00:00:00Z","timestamp":1165968000000},"content-version":"vor","delay-in-days":5705,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Circuit Theory &amp; Apps"],"published-print":{"date-parts":[[1991,5]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>This paper presents new linear programming techniques for the design of optimal 1D IIR digital filters. the first method is based on a linear minimax criterion and leads to a linear programming approximation problem whose optimal solution is attained by a new fast algorithm. Next, the linear minimax approximation problem is extended and formulated as two linear integer programming problems which permit the design of 1D IIR digital filters with coefficients of finite word length. the first of these methods is formulated as a 0\u20101 integer linear programming problem and its optimal solution is attained rapidly by a new algorithm. This method appears to be suitable for the design of high\u2010order digital filters. the second method is more general and is formulated as a mixed integer linear programming problem. to solve the design problem efficiently, a new integer tree search algorithm is introduced. the feasibility of the proposed algorithms is illustrated with detailed solutions or numerical examples.<\/jats:p>","DOI":"10.1002\/cta.4490190302","type":"journal-article","created":{"date-parts":[[2007,7,2]],"date-time":"2007-07-02T00:46:32Z","timestamp":1183337192000},"page":"217-227","source":"Crossref","is-referenced-by-count":1,"title":["On the design of 1D IIR digital filters with coefficients of finite word length"],"prefix":"10.1002","volume":"19","author":[{"given":"N.","family":"Papamarkos","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"G.","family":"Vachtsevanos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","published-online":{"date-parts":[[2006,12,13]]},"reference":[{"key":"e_1_2_1_2_2","unstructured":"T. J.Ternell Introduction to Digital Filters London 1984."},{"key":"e_1_2_1_3_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-3262-0"},{"key":"e_1_2_1_4_2","doi-asserted-by":"publisher","DOI":"10.1109\/TCS.1982.1085123"},{"key":"e_1_2_1_5_2","doi-asserted-by":"crossref","first-page":"443","DOI":"10.1109\/TASSP.1974.1162621","article-title":"Recursive filter design using differential correction","volume":"22","author":"Dudgeon D. E.","year":"1984","journal-title":"IEEE Trans. Acoust., Speech, Signal Process."},{"key":"e_1_2_1_6_2","doi-asserted-by":"publisher","DOI":"10.1002\/cta.4490180402"},{"key":"e_1_2_1_7_2","doi-asserted-by":"publisher","DOI":"10.1109\/TASSP.1983.1164197"},{"key":"e_1_2_1_8_2","doi-asserted-by":"publisher","DOI":"10.1109\/TASSP.1984.1164460"},{"key":"e_1_2_1_9_2","volume-title":"Optimization Theory and Applications","author":"Rao S. S.","year":"1984"},{"key":"e_1_2_1_10_2","volume-title":"Mathematical Programming in Statistics","author":"Arthanari T. S.","year":"1981"},{"key":"e_1_2_1_11_2","doi-asserted-by":"publisher","DOI":"10.1080\/02331938808843397"},{"key":"e_1_2_1_12_2","doi-asserted-by":"publisher","DOI":"10.1016\/0141-1195(89)90050-8"},{"key":"e_1_2_1_13_2","doi-asserted-by":"publisher","DOI":"10.1109\/TCS.1985.1085813"},{"key":"e_1_2_1_14_2","doi-asserted-by":"publisher","DOI":"10.1109\/TAU.1972.1162376"},{"key":"e_1_2_1_15_2","unstructured":"K.IwasakiandR.Ishii A design of a transfer function with finite word length coefficients by linear programming' Proc. ISCAS 85 Kyoto Japan 1985 pp.275\u2013278."},{"key":"e_1_2_1_16_2","doi-asserted-by":"publisher","DOI":"10.1109\/TASSP.1979.1163190"},{"key":"e_1_2_1_17_2","doi-asserted-by":"publisher","DOI":"10.1016\/0010-4485(75)90003-2"},{"key":"e_1_2_1_18_2","doi-asserted-by":"publisher","DOI":"10.1109\/TASSP.1974.1162615"},{"key":"e_1_2_1_19_2","volume-title":"Integer Programming","author":"Salkin H. M.","year":"1974"},{"key":"e_1_2_1_20_2","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/8.3.250"}],"container-title":["International Journal of Circuit Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fcta.4490190302","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/cta.4490190302","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,23]],"date-time":"2023-10-23T00:26:28Z","timestamp":1698020788000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/cta.4490190302"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,5]]},"references-count":19,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1991,5]]}},"alternative-id":["10.1002\/cta.4490190302"],"URL":"https:\/\/doi.org\/10.1002\/cta.4490190302","archive":["Portico"],"relation":{},"ISSN":["0098-9886","1097-007X"],"issn-type":[{"value":"0098-9886","type":"print"},{"value":"1097-007X","type":"electronic"}],"subject":[],"published":{"date-parts":[[1991,5]]}}}