{"title":"Approximating functions for embedded and ASIC applications","authors":"J. W. Hauser, Carla N. Purdy","doi":"10.1109/MWSCAS.2001.986215","DOIUrl":null,"url":null,"abstract":"Often embedded programmers and application specific integrated circuit (ASIC) designers are frustrated by the inability to realize near floating-point accuracy. in a fixed-point application. The problem is not limited to function approximation but also impacts FIR filter design. In this paper we examine the problem of approximating a known function on a closed interval and show that a genetic algorithm (GA) may be used to obtain results superior to those obtained by implementing floating-point algorithms, such as Taylor series and Chebyshev polynomials, in fixed-point directly.","PeriodicalId":403026,"journal":{"name":"Proceedings of the 44th IEEE 2001 Midwest Symposium on Circuits and Systems. MWSCAS 2001 (Cat. No.01CH37257)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2001-08-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"9","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 44th IEEE 2001 Midwest Symposium on Circuits and Systems. MWSCAS 2001 (Cat. No.01CH37257)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/MWSCAS.2001.986215","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 9
Abstract
Often embedded programmers and application specific integrated circuit (ASIC) designers are frustrated by the inability to realize near floating-point accuracy. in a fixed-point application. The problem is not limited to function approximation but also impacts FIR filter design. In this paper we examine the problem of approximating a known function on a closed interval and show that a genetic algorithm (GA) may be used to obtain results superior to those obtained by implementing floating-point algorithms, such as Taylor series and Chebyshev polynomials, in fixed-point directly.