{"title":"四元固定极性算术展开的高效算法","authors":"B. Falkowski, C. C. Lozano, T. Luba","doi":"10.1109/ISMVL.2007.16","DOIUrl":null,"url":null,"abstract":"A recursive algorithm for efficient calculation of quaternary fixed polarity arithmetic expansions (QFPAEs) spectra is presented in this paper. It derives either all QFPAE spectra or a QFPAE coefficient vector in nonzero polarity for the input function from the functions' QFPAE in polarity zero. Fast flow graphs and computational costs for the new algorithm are given. The number of additions/subtractions and multiplications required by the algorithm for n <7 are also listed and compared with the fast transform method. The comparison shows that the new algorithm has lower computational cost for generating the complete polarity matrix than other algorithms.","PeriodicalId":368339,"journal":{"name":"37th International Symposium on Multiple-Valued Logic (ISMVL'07)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-05-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Efficient Algorithm for Calculation of Quaternardy Fixed Polarity Arithmetic Expansions\",\"authors\":\"B. Falkowski, C. C. Lozano, T. Luba\",\"doi\":\"10.1109/ISMVL.2007.16\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A recursive algorithm for efficient calculation of quaternary fixed polarity arithmetic expansions (QFPAEs) spectra is presented in this paper. It derives either all QFPAE spectra or a QFPAE coefficient vector in nonzero polarity for the input function from the functions' QFPAE in polarity zero. Fast flow graphs and computational costs for the new algorithm are given. The number of additions/subtractions and multiplications required by the algorithm for n <7 are also listed and compared with the fast transform method. The comparison shows that the new algorithm has lower computational cost for generating the complete polarity matrix than other algorithms.\",\"PeriodicalId\":368339,\"journal\":{\"name\":\"37th International Symposium on Multiple-Valued Logic (ISMVL'07)\",\"volume\":\"5 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2007-05-13\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"37th International Symposium on Multiple-Valued Logic (ISMVL'07)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISMVL.2007.16\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"37th International Symposium on Multiple-Valued Logic (ISMVL'07)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISMVL.2007.16","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Efficient Algorithm for Calculation of Quaternardy Fixed Polarity Arithmetic Expansions
A recursive algorithm for efficient calculation of quaternary fixed polarity arithmetic expansions (QFPAEs) spectra is presented in this paper. It derives either all QFPAE spectra or a QFPAE coefficient vector in nonzero polarity for the input function from the functions' QFPAE in polarity zero. Fast flow graphs and computational costs for the new algorithm are given. The number of additions/subtractions and multiplications required by the algorithm for n <7 are also listed and compared with the fast transform method. The comparison shows that the new algorithm has lower computational cost for generating the complete polarity matrix than other algorithms.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
