{"title":"GF(2/sup m/)迭代除法的新算法及其半收缩VLSI实现","authors":"C. Hu, Chien Ming Wu, Ming-Der Shieh, Y. Hwang","doi":"10.1109/MWSCAS.2000.951643","DOIUrl":null,"url":null,"abstract":"Extends the binary algorithm invented by J. Stein [1967] and proposes two iterative division algorithms in finite field GF(2/sup m/). Algorithm EBg exhibits faster convergence while algorithm EBd has reduced complexity in each iteration. A (semi-)systolic array is designed for algorithm EBd, resulting in an area-time complexity better than the best result known to date based on the extended Euclid algorithm.","PeriodicalId":437349,"journal":{"name":"Proceedings of the 43rd IEEE Midwest Symposium on Circuits and Systems (Cat.No.CH37144)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2000-08-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Novel iterative division algorithm over GF(2/sup m/) and its semi-systolic VLSI realization\",\"authors\":\"C. Hu, Chien Ming Wu, Ming-Der Shieh, Y. Hwang\",\"doi\":\"10.1109/MWSCAS.2000.951643\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Extends the binary algorithm invented by J. Stein [1967] and proposes two iterative division algorithms in finite field GF(2/sup m/). Algorithm EBg exhibits faster convergence while algorithm EBd has reduced complexity in each iteration. A (semi-)systolic array is designed for algorithm EBd, resulting in an area-time complexity better than the best result known to date based on the extended Euclid algorithm.\",\"PeriodicalId\":437349,\"journal\":{\"name\":\"Proceedings of the 43rd IEEE Midwest Symposium on Circuits and Systems (Cat.No.CH37144)\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2000-08-08\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the 43rd IEEE Midwest Symposium on Circuits and Systems (Cat.No.CH37144)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/MWSCAS.2000.951643\",\"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 the 43rd IEEE Midwest Symposium on Circuits and Systems (Cat.No.CH37144)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/MWSCAS.2000.951643","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Novel iterative division algorithm over GF(2/sup m/) and its semi-systolic VLSI realization
Extends the binary algorithm invented by J. Stein [1967] and proposes two iterative division algorithms in finite field GF(2/sup m/). Algorithm EBg exhibits faster convergence while algorithm EBd has reduced complexity in each iteration. A (semi-)systolic array is designed for algorithm EBd, resulting in an area-time complexity better than the best result known to date based on the extended Euclid algorithm.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
