{"title":"携带保存和二进制符号-数字表示转换","authors":"Guoping Wang","doi":"10.1109/EIT.2005.1626959","DOIUrl":null,"url":null,"abstract":"Computer arithmetic operations based on the binary sign-digit (BSD) numbers and carry-save addition (CSA) representation systems provide them with high-speed computations due to carry-propagation free features. However, in the previous researches, these two representations are treated respectively. In this paper, the algorithms and implementation structures are proposed for the conversion between them, thus, the arithmetic developed for one representation can be easily adapted to the other. The conversion overheads in the area and speed are also studied","PeriodicalId":358002,"journal":{"name":"2005 IEEE International Conference on Electro Information Technology","volume":"96 5","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2005-05-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Carry-save and binary sign-digit representations conversion\",\"authors\":\"Guoping Wang\",\"doi\":\"10.1109/EIT.2005.1626959\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Computer arithmetic operations based on the binary sign-digit (BSD) numbers and carry-save addition (CSA) representation systems provide them with high-speed computations due to carry-propagation free features. However, in the previous researches, these two representations are treated respectively. In this paper, the algorithms and implementation structures are proposed for the conversion between them, thus, the arithmetic developed for one representation can be easily adapted to the other. The conversion overheads in the area and speed are also studied\",\"PeriodicalId\":358002,\"journal\":{\"name\":\"2005 IEEE International Conference on Electro Information Technology\",\"volume\":\"96 5\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2005-05-22\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2005 IEEE International Conference on Electro Information Technology\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/EIT.2005.1626959\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2005 IEEE International Conference on Electro Information Technology","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/EIT.2005.1626959","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Carry-save and binary sign-digit representations conversion
Computer arithmetic operations based on the binary sign-digit (BSD) numbers and carry-save addition (CSA) representation systems provide them with high-speed computations due to carry-propagation free features. However, in the previous researches, these two representations are treated respectively. In this paper, the algorithms and implementation structures are proposed for the conversion between them, thus, the arithmetic developed for one representation can be easily adapted to the other. The conversion overheads in the area and speed are also studied
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
