{"title":"高速数字滤波器的低复杂度常数乘法免携带算法","authors":"O. Gustafsson, L. Wanhammar","doi":"10.1109/ISPA.2007.4383692","DOIUrl":null,"url":null,"abstract":"In this work we discuss the realization of constant multiplication using a minimum number of carry-save adders. We consider both non-redundant and carry-save representation for the input data. For both cases we present all possible interconnection topologies, using up to six and five adders, respectively. These are sufficient to realize constant multiplications for all coefficients with a wordlength up to 19 bits.","PeriodicalId":112420,"journal":{"name":"2007 5th International Symposium on Image and Signal Processing and Analysis","volume":"15 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-11-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"11","resultStr":"{\"title\":\"Low-Complexity Constant Multiplication Using Carry-Save Arithmetic for High-Speed Digital Filters\",\"authors\":\"O. Gustafsson, L. Wanhammar\",\"doi\":\"10.1109/ISPA.2007.4383692\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this work we discuss the realization of constant multiplication using a minimum number of carry-save adders. We consider both non-redundant and carry-save representation for the input data. For both cases we present all possible interconnection topologies, using up to six and five adders, respectively. These are sufficient to realize constant multiplications for all coefficients with a wordlength up to 19 bits.\",\"PeriodicalId\":112420,\"journal\":{\"name\":\"2007 5th International Symposium on Image and Signal Processing and Analysis\",\"volume\":\"15 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2007-11-19\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"11\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2007 5th International Symposium on Image and Signal Processing and Analysis\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISPA.2007.4383692\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2007 5th International Symposium on Image and Signal Processing and Analysis","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISPA.2007.4383692","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Low-Complexity Constant Multiplication Using Carry-Save Arithmetic for High-Speed Digital Filters
In this work we discuss the realization of constant multiplication using a minimum number of carry-save adders. We consider both non-redundant and carry-save representation for the input data. For both cases we present all possible interconnection topologies, using up to six and five adders, respectively. These are sufficient to realize constant multiplications for all coefficients with a wordlength up to 19 bits.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
