{"title":"用于整型中文余数的收缩数组","authors":"Ç. Koç, P. Cappello","doi":"10.1109/ARITH.1989.72829","DOIUrl":null,"url":null,"abstract":"The authors present several time-optimal and space-time-optimal systolic arrays for computing a process dependence graph corresponding to the mixed-radix conversion algorithm. The arrays are particularly suitable for software implementations of algorithms from the applications of residue number systems on a programmable systolic/wavefront array. Examples of such applications are the exact solution of linear systems and matrix problems over integral domains. The authors also describe a decomposition strategy for treating a mixed-radix conversion problem whose size exceeds the array size. >","PeriodicalId":6526,"journal":{"name":"2015 IEEE 22nd Symposium on Computer Arithmetic","volume":"1 1","pages":"216-223"},"PeriodicalIF":0.0000,"publicationDate":"1989-09-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"Systolic arrays for integer Chinese remaindering\",\"authors\":\"Ç. Koç, P. Cappello\",\"doi\":\"10.1109/ARITH.1989.72829\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The authors present several time-optimal and space-time-optimal systolic arrays for computing a process dependence graph corresponding to the mixed-radix conversion algorithm. The arrays are particularly suitable for software implementations of algorithms from the applications of residue number systems on a programmable systolic/wavefront array. Examples of such applications are the exact solution of linear systems and matrix problems over integral domains. The authors also describe a decomposition strategy for treating a mixed-radix conversion problem whose size exceeds the array size. >\",\"PeriodicalId\":6526,\"journal\":{\"name\":\"2015 IEEE 22nd Symposium on Computer Arithmetic\",\"volume\":\"1 1\",\"pages\":\"216-223\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1989-09-06\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2015 IEEE 22nd Symposium on Computer Arithmetic\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ARITH.1989.72829\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 IEEE 22nd Symposium on Computer Arithmetic","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ARITH.1989.72829","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
The authors present several time-optimal and space-time-optimal systolic arrays for computing a process dependence graph corresponding to the mixed-radix conversion algorithm. The arrays are particularly suitable for software implementations of algorithms from the applications of residue number systems on a programmable systolic/wavefront array. Examples of such applications are the exact solution of linear systems and matrix problems over integral domains. The authors also describe a decomposition strategy for treating a mixed-radix conversion problem whose size exceeds the array size. >