{"title":"生成优化的多部表参数的软件工具","authors":"R. Muscedere, M. Mirhassani","doi":"10.1109/CCECE.2017.7946811","DOIUrl":null,"url":null,"abstract":"Multipartite table methods offer a high speed, low area implementation of commonly used functions for up to 24 bits of accuracy. Currently the parameters which dictate the configuration of these tables are chosen using a worst-case rounding approximation scheme which often generates sub-optimal results. This paper will show that it is possible to perform a full exhaustive search to find the minimum table size by efficiently coding the table generator and error calculation algorithms which can further reduce the previous published results by up to 25%.","PeriodicalId":238720,"journal":{"name":"2017 IEEE 30th Canadian Conference on Electrical and Computer Engineering (CCECE)","volume":"65 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A software tool for generating optimized multipartite table parameters\",\"authors\":\"R. Muscedere, M. Mirhassani\",\"doi\":\"10.1109/CCECE.2017.7946811\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Multipartite table methods offer a high speed, low area implementation of commonly used functions for up to 24 bits of accuracy. Currently the parameters which dictate the configuration of these tables are chosen using a worst-case rounding approximation scheme which often generates sub-optimal results. This paper will show that it is possible to perform a full exhaustive search to find the minimum table size by efficiently coding the table generator and error calculation algorithms which can further reduce the previous published results by up to 25%.\",\"PeriodicalId\":238720,\"journal\":{\"name\":\"2017 IEEE 30th Canadian Conference on Electrical and Computer Engineering (CCECE)\",\"volume\":\"65 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2017-04-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2017 IEEE 30th Canadian Conference on Electrical and Computer Engineering (CCECE)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CCECE.2017.7946811\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 IEEE 30th Canadian Conference on Electrical and Computer Engineering (CCECE)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CCECE.2017.7946811","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A software tool for generating optimized multipartite table parameters
Multipartite table methods offer a high speed, low area implementation of commonly used functions for up to 24 bits of accuracy. Currently the parameters which dictate the configuration of these tables are chosen using a worst-case rounding approximation scheme which often generates sub-optimal results. This paper will show that it is possible to perform a full exhaustive search to find the minimum table size by efficiently coding the table generator and error calculation algorithms which can further reduce the previous published results by up to 25%.