{"title":"进位二进制加法的四元逻辑","authors":"M. A. Manzoul, A. Bommireddy","doi":"10.1109/ISMVL.1988.5186","DOIUrl":null,"url":null,"abstract":"The role of the quaternary (four-valued) logic in speeding up the binary addition is discussed. An improved carry-lookahead adder circuit, which is completely realizable by binary gates, is presented. The speed of the proposed n-bit adder is compared to the traditional carry-lookahead n-bit adder in terms of gate delays and fan-in. Results show that the proposed adder is faster in certain ranges determined by n. For an 8-bit adder, the circuit can save 37.5% of the traditional circuit time (in gate delays).<<ETX>>","PeriodicalId":368020,"journal":{"name":"[1988] Proceedings. The Eighteenth International Symposium on Multiple-Valued Logic","volume":"69 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1988-05-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Quaternary logic for carry-lookahead binary addition\",\"authors\":\"M. A. Manzoul, A. Bommireddy\",\"doi\":\"10.1109/ISMVL.1988.5186\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The role of the quaternary (four-valued) logic in speeding up the binary addition is discussed. An improved carry-lookahead adder circuit, which is completely realizable by binary gates, is presented. The speed of the proposed n-bit adder is compared to the traditional carry-lookahead n-bit adder in terms of gate delays and fan-in. Results show that the proposed adder is faster in certain ranges determined by n. For an 8-bit adder, the circuit can save 37.5% of the traditional circuit time (in gate delays).<<ETX>>\",\"PeriodicalId\":368020,\"journal\":{\"name\":\"[1988] Proceedings. The Eighteenth International Symposium on Multiple-Valued Logic\",\"volume\":\"69 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1988-05-24\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"[1988] Proceedings. The Eighteenth International Symposium on Multiple-Valued Logic\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISMVL.1988.5186\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"[1988] Proceedings. The Eighteenth International Symposium on Multiple-Valued Logic","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISMVL.1988.5186","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Quaternary logic for carry-lookahead binary addition
The role of the quaternary (four-valued) logic in speeding up the binary addition is discussed. An improved carry-lookahead adder circuit, which is completely realizable by binary gates, is presented. The speed of the proposed n-bit adder is compared to the traditional carry-lookahead n-bit adder in terms of gate delays and fan-in. Results show that the proposed adder is faster in certain ranges determined by n. For an 8-bit adder, the circuit can save 37.5% of the traditional circuit time (in gate delays).<>