{"id":"https://openalex.org/W1606211422","doi":"https://doi.org/10.1109/iscas.2006.1693111","title":"Algorithmic Truncation of MiniMax Polynomial Coefficients","display_name":"Algorithmic Truncation of MiniMax Polynomial Coefficients","publication_year":2006,"publication_date":"2006-09-22","ids":{"openalex":"https://openalex.org/W1606211422","doi":"https://doi.org/10.1109/iscas.2006.1693111","mag":"1606211422"},"language":"en","primary_location":{"id":"doi:10.1109/iscas.2006.1693111","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iscas.2006.1693111","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2006 IEEE International Symposium on Circuits and Systems","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5018178807","display_name":"Sara Tawfik","orcid":"https://orcid.org/0009-0000-7169-4714"},"institutions":[{"id":"https://openalex.org/I145487455","display_name":"Cairo University","ror":"https://ror.org/03q21mh05","country_code":"EG","type":"education","lineage":["https://openalex.org/I145487455"]},{"id":"https://openalex.org/I135310074","display_name":"University of Wisconsin\u2013Madison","ror":"https://ror.org/01y2jtd41","country_code":"US","type":"education","lineage":["https://openalex.org/I135310074"]}],"countries":["EG","US"],"is_corresponding":true,"raw_author_name":"S.A. Tawfik","raw_affiliation_strings":["ECE Department, University of Wisconsin, Madison, USA","Electronics and Communications Department, Faculty of Engineering, Cairo University, Giza, Egypt"],"affiliations":[{"raw_affiliation_string":"ECE Department, University of Wisconsin, Madison, USA","institution_ids":["https://openalex.org/I135310074"]},{"raw_affiliation_string":"Electronics and Communications Department, Faculty of Engineering, Cairo University, Giza, Egypt","institution_ids":["https://openalex.org/I145487455"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5103437949","display_name":"Hossam A. H. Fahmy","orcid":null},"institutions":[{"id":"https://openalex.org/I172675005","display_name":"Nanyang Technological University","ror":"https://ror.org/02e7b5302","country_code":"SG","type":"education","lineage":["https://openalex.org/I172675005"]},{"id":"https://openalex.org/I145487455","display_name":"Cairo University","ror":"https://ror.org/03q21mh05","country_code":"EG","type":"education","lineage":["https://openalex.org/I145487455"]}],"countries":["EG","SG"],"is_corresponding":false,"raw_author_name":"H.A.H. Fahmy","raw_affiliation_strings":["Electronics and Communications Department, Faculty of Engineering, Cairo University, Giza, Egypt","School of Computer Engineering, Nanyang Technological University, Singapore"],"affiliations":[{"raw_affiliation_string":"Electronics and Communications Department, Faculty of Engineering, Cairo University, Giza, Egypt","institution_ids":["https://openalex.org/I145487455"]},{"raw_affiliation_string":"School of Computer Engineering, Nanyang Technological University, Singapore","institution_ids":["https://openalex.org/I172675005"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5018178807"],"corresponding_institution_ids":["https://openalex.org/I135310074","https://openalex.org/I145487455"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.06299359,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"5","issue":null,"first_page":"2421","last_page":"2424"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11697","display_name":"Numerical Methods and Algorithms","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11697","display_name":"Numerical Methods and Algorithms","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11034","display_name":"Digital Filter Design and Implementation","score":0.9965000152587891,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10363","display_name":"Low-power high-performance VLSI design","score":0.9922999739646912,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/minimax","display_name":"Minimax","score":0.8147275447845459},{"id":"https://openalex.org/keywords/minimax-approximation-algorithm","display_name":"Minimax approximation algorithm","score":0.7656737565994263},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5876438617706299},{"id":"https://openalex.org/keywords/chebyshev-polynomials","display_name":"Chebyshev polynomials","score":0.5827044248580933},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.5825420618057251},{"id":"https://openalex.org/keywords/approximation-theory","display_name":"Approximation theory","score":0.5392395853996277},{"id":"https://openalex.org/keywords/chebyshev-nodes","display_name":"Chebyshev nodes","score":0.528424084186554},{"id":"https://openalex.org/keywords/equioscillation-theorem","display_name":"Equioscillation theorem","score":0.499316930770874},{"id":"https://openalex.org/keywords/rounding","display_name":"Rounding","score":0.49904966354370117},{"id":"https://openalex.org/keywords/truncation","display_name":"Truncation (statistics)","score":0.47881728410720825},{"id":"https://openalex.org/keywords/applied-mathematics","display_name":"Applied mathematics","score":0.4622281491756439},{"id":"https://openalex.org/keywords/truncation-error","display_name":"Truncation error","score":0.45310893654823303},{"id":"https://openalex.org/keywords/approximation-error","display_name":"Approximation error","score":0.4331228733062744},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4143986403942108},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.40912744402885437},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.29123613238334656},{"id":"https://openalex.org/keywords/orthogonal-polynomials","display_name":"Orthogonal polynomials","score":0.220327228307724},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.20798581838607788},{"id":"https://openalex.org/keywords/gegenbauer-polynomials","display_name":"Gegenbauer polynomials","score":0.16319963335990906},{"id":"https://openalex.org/keywords/classical-orthogonal-polynomials","display_name":"Classical orthogonal polynomials","score":0.1309329867362976},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.097564697265625}],"concepts":[{"id":"https://openalex.org/C149728462","wikidata":"https://www.wikidata.org/wiki/Q751319","display_name":"Minimax","level":2,"score":0.8147275447845459},{"id":"https://openalex.org/C117148685","wikidata":"https://www.wikidata.org/wiki/Q6865376","display_name":"Minimax approximation algorithm","level":2,"score":0.7656737565994263},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5876438617706299},{"id":"https://openalex.org/C129785596","wikidata":"https://www.wikidata.org/wiki/Q619511","display_name":"Chebyshev polynomials","level":2,"score":0.5827044248580933},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.5825420618057251},{"id":"https://openalex.org/C145242015","wikidata":"https://www.wikidata.org/wiki/Q774123","display_name":"Approximation theory","level":2,"score":0.5392395853996277},{"id":"https://openalex.org/C171326582","wikidata":"https://www.wikidata.org/wiki/Q1052508","display_name":"Chebyshev nodes","level":3,"score":0.528424084186554},{"id":"https://openalex.org/C9353750","wikidata":"https://www.wikidata.org/wiki/Q5384549","display_name":"Equioscillation theorem","level":5,"score":0.499316930770874},{"id":"https://openalex.org/C136625980","wikidata":"https://www.wikidata.org/wiki/Q663208","display_name":"Rounding","level":2,"score":0.49904966354370117},{"id":"https://openalex.org/C106195933","wikidata":"https://www.wikidata.org/wiki/Q7847935","display_name":"Truncation (statistics)","level":2,"score":0.47881728410720825},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.4622281491756439},{"id":"https://openalex.org/C104942944","wikidata":"https://www.wikidata.org/wiki/Q3434686","display_name":"Truncation error","level":2,"score":0.45310893654823303},{"id":"https://openalex.org/C122383733","wikidata":"https://www.wikidata.org/wiki/Q865920","display_name":"Approximation error","level":2,"score":0.4331228733062744},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4143986403942108},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.40912744402885437},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.29123613238334656},{"id":"https://openalex.org/C10628310","wikidata":"https://www.wikidata.org/wiki/Q619458","display_name":"Orthogonal polynomials","level":2,"score":0.220327228307724},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.20798581838607788},{"id":"https://openalex.org/C78540521","wikidata":"https://www.wikidata.org/wiki/Q1498246","display_name":"Gegenbauer polynomials","level":4,"score":0.16319963335990906},{"id":"https://openalex.org/C21736991","wikidata":"https://www.wikidata.org/wiki/Q17006917","display_name":"Classical orthogonal polynomials","level":3,"score":0.1309329867362976},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.097564697265625},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/iscas.2006.1693111","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iscas.2006.1693111","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2006 IEEE International Symposium on Circuits and Systems","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":21,"referenced_works":["https://openalex.org/W135879513","https://openalex.org/W1480749645","https://openalex.org/W1505109187","https://openalex.org/W1545238850","https://openalex.org/W1649344707","https://openalex.org/W1844620123","https://openalex.org/W1910331302","https://openalex.org/W1985956780","https://openalex.org/W2046412182","https://openalex.org/W2099585600","https://openalex.org/W2111730172","https://openalex.org/W2115452265","https://openalex.org/W2118495140","https://openalex.org/W2119441456","https://openalex.org/W2134331608","https://openalex.org/W2141576550","https://openalex.org/W2143943882","https://openalex.org/W2148763589","https://openalex.org/W2152992659","https://openalex.org/W2970485905","https://openalex.org/W6632793299"],"related_works":["https://openalex.org/W3004125503","https://openalex.org/W1866822838","https://openalex.org/W2606851844","https://openalex.org/W2405994222","https://openalex.org/W3196370734","https://openalex.org/W2169507316","https://openalex.org/W2374235543","https://openalex.org/W2025555457","https://openalex.org/W3084112352","https://openalex.org/W3187699626"],"abstract_inverted_index":{"Elementary":[0],"and":[1,75],"high-level":[2],"functions":[3],"can":[4],"be":[5],"computed":[6],"in":[7,17,38],"hardware":[8],"using":[9,67],"polynomial":[10,37],"approximation":[11],"techniques.":[12],"There":[13],"are":[14],"many":[15],"techniques":[16],"the":[18,22,35,39,45,57,60,81,88,97],"literature":[19],"to":[20],"calculate":[21],"coefficients":[23,58],"of":[24,59,73,78],"such":[25],"polynomials.":[26],"Remez":[27,65],"algorithm":[28,54,66,93,106],"as":[29],"presented":[30],"by":[31],"Veidinger":[32],"(1960)":[33],"provides":[34],"optimal":[36],"Chebyshev":[40],"sense":[41],"that":[42,107],"is":[43,84,94,108],"minimizing":[44],"maximum":[46],"error":[47],"(minimax":[48],"approximation).":[49],"This":[50,102],"paper":[51,103],"presents":[52,104],"an":[53,68,105],"for":[55,96,110],"truncating":[56],"minimax":[61],"polynomials":[62,100],"obtained":[63],"from":[64],"algorithmic":[69],"method.":[70],"A":[71],"gain":[72],"3":[74],"4":[76],"bits":[77],"accuracy":[79],"over":[80],"direct":[82],"rounding":[83],"reported.":[85],"Muller":[86],"addressed":[87],"same":[89],"problem":[90],"but":[91],"his":[92],"applicable":[95,109],"second":[98],"order":[99,112],"only.":[101],"any":[111]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":3},{"year":2019,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}