{"title":"采用0.35 /spl mu/m CMOS技术实现200 mhz 16/spl倍/16左至右无载乘子的VLSI实现下一代dsp","authors":"R. Kolagotla, H. Srinivas, G. Burns","doi":"10.1109/CICC.1997.606669","DOIUrl":null,"url":null,"abstract":"We describe the VLSI implementation of a 16/spl times/16 left-to-right carry-free multiplier. Left-to-right multipliers are significantly faster than conventional right-to-left multipliers because they do not require a carry-propagate adder to complete the multiplication process. The key to the high speed of left-to-right multiplication is the fact that the most significant partial product digits are available in carry-save form earlier than they are in conventional right-to-left multipliers. Two conversion schemes for converting the most significant half of the partial products from carry-save to binary form are described. The first scheme uses a variation of the Ercegovac-Lang converter, and the second scheme uses a conventional carry-select adder. Experimental measurements are presented to show the feasibility of 200-MHz operation.","PeriodicalId":111737,"journal":{"name":"Proceedings of CICC 97 - Custom Integrated Circuits Conference","volume":"15 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1997-05-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"22","resultStr":"{\"title\":\"VLSI implementation of a 200-MHz 16/spl times/16 left-to-right carry-free multiplier in 0.35 /spl mu/m CMOS technology for next-generation DSPs\",\"authors\":\"R. Kolagotla, H. Srinivas, G. Burns\",\"doi\":\"10.1109/CICC.1997.606669\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We describe the VLSI implementation of a 16/spl times/16 left-to-right carry-free multiplier. Left-to-right multipliers are significantly faster than conventional right-to-left multipliers because they do not require a carry-propagate adder to complete the multiplication process. The key to the high speed of left-to-right multiplication is the fact that the most significant partial product digits are available in carry-save form earlier than they are in conventional right-to-left multipliers. Two conversion schemes for converting the most significant half of the partial products from carry-save to binary form are described. The first scheme uses a variation of the Ercegovac-Lang converter, and the second scheme uses a conventional carry-select adder. Experimental measurements are presented to show the feasibility of 200-MHz operation.\",\"PeriodicalId\":111737,\"journal\":{\"name\":\"Proceedings of CICC 97 - Custom Integrated Circuits Conference\",\"volume\":\"15 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1997-05-05\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"22\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of CICC 97 - Custom Integrated Circuits Conference\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CICC.1997.606669\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of CICC 97 - Custom Integrated Circuits Conference","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CICC.1997.606669","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
VLSI implementation of a 200-MHz 16/spl times/16 left-to-right carry-free multiplier in 0.35 /spl mu/m CMOS technology for next-generation DSPs
We describe the VLSI implementation of a 16/spl times/16 left-to-right carry-free multiplier. Left-to-right multipliers are significantly faster than conventional right-to-left multipliers because they do not require a carry-propagate adder to complete the multiplication process. The key to the high speed of left-to-right multiplication is the fact that the most significant partial product digits are available in carry-save form earlier than they are in conventional right-to-left multipliers. Two conversion schemes for converting the most significant half of the partial products from carry-save to binary form are described. The first scheme uses a variation of the Ercegovac-Lang converter, and the second scheme uses a conventional carry-select adder. Experimental measurements are presented to show the feasibility of 200-MHz operation.