{"title":"具有借用并行计数器的可重构低功耗高性能矩阵乘法器结构","authors":"R. Lin","doi":"10.1109/IPDPS.2003.1213336","DOIUrl":null,"url":null,"abstract":"A novel run-time reconfigurable matrix processor and its prototype implementation with new circuits, called borrow parallel counters, achieving low power, high speed, simple inter-connections and extra compact design, are presented. For typical graphics and image applications, the multiplier can produce in parallel the products of four 4/spl times/4 matrix pairs of 8-bit data, or two matrices X(4/spl times/4) and Y(4/spl times/4) of 16-bit data, or two matrices X(4/spl times/4) and Y(4/spl times/4) of 32-bit data, or two 64-b numbers. The proposed parallel counters utilize 4-bit 1-hot integer encoding and borrow bits, i.e. input bits of weight 2, effectively merging type-conversions and additions through using a unique embedded full adder circuit.","PeriodicalId":177848,"journal":{"name":"Proceedings International Parallel and Distributed Processing Symposium","volume":"224 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2003-04-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"A reconfigurable low-power high-performance matrix multiplier architecture with borrow parallel counters\",\"authors\":\"R. Lin\",\"doi\":\"10.1109/IPDPS.2003.1213336\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A novel run-time reconfigurable matrix processor and its prototype implementation with new circuits, called borrow parallel counters, achieving low power, high speed, simple inter-connections and extra compact design, are presented. For typical graphics and image applications, the multiplier can produce in parallel the products of four 4/spl times/4 matrix pairs of 8-bit data, or two matrices X(4/spl times/4) and Y(4/spl times/4) of 16-bit data, or two matrices X(4/spl times/4) and Y(4/spl times/4) of 32-bit data, or two 64-b numbers. The proposed parallel counters utilize 4-bit 1-hot integer encoding and borrow bits, i.e. input bits of weight 2, effectively merging type-conversions and additions through using a unique embedded full adder circuit.\",\"PeriodicalId\":177848,\"journal\":{\"name\":\"Proceedings International Parallel and Distributed Processing Symposium\",\"volume\":\"224 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2003-04-22\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings International Parallel and Distributed Processing Symposium\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/IPDPS.2003.1213336\",\"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 International Parallel and Distributed Processing Symposium","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IPDPS.2003.1213336","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A reconfigurable low-power high-performance matrix multiplier architecture with borrow parallel counters
A novel run-time reconfigurable matrix processor and its prototype implementation with new circuits, called borrow parallel counters, achieving low power, high speed, simple inter-connections and extra compact design, are presented. For typical graphics and image applications, the multiplier can produce in parallel the products of four 4/spl times/4 matrix pairs of 8-bit data, or two matrices X(4/spl times/4) and Y(4/spl times/4) of 16-bit data, or two matrices X(4/spl times/4) and Y(4/spl times/4) of 32-bit data, or two 64-b numbers. The proposed parallel counters utilize 4-bit 1-hot integer encoding and borrow bits, i.e. input bits of weight 2, effectively merging type-conversions and additions through using a unique embedded full adder circuit.