{"title":"GF分聚(2/sup m/)","authors":"Musaab Hasan","doi":"10.1109/CCECE.1995.528117","DOIUrl":null,"url":null,"abstract":"The Galois field division is a complex arithmetic operation. The corresponding division-and-accumulation (DAA) is not only complex but also time consuming operation. The DAA operation over GF(2/sup m/) is considered, and its algorithms and architectures are presented. The algorithms can be modified not to require any division at all. The architectures can support pipeline and multi-level DAAs resulting in an increased throughput without a proportional increase in the hardware.","PeriodicalId":158581,"journal":{"name":"Proceedings 1995 Canadian Conference on Electrical and Computer Engineering","volume":"113 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1995-09-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Division-and-accumulation in GF(2/sup m/)\",\"authors\":\"Musaab Hasan\",\"doi\":\"10.1109/CCECE.1995.528117\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The Galois field division is a complex arithmetic operation. The corresponding division-and-accumulation (DAA) is not only complex but also time consuming operation. The DAA operation over GF(2/sup m/) is considered, and its algorithms and architectures are presented. The algorithms can be modified not to require any division at all. The architectures can support pipeline and multi-level DAAs resulting in an increased throughput without a proportional increase in the hardware.\",\"PeriodicalId\":158581,\"journal\":{\"name\":\"Proceedings 1995 Canadian Conference on Electrical and Computer Engineering\",\"volume\":\"113 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1995-09-05\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings 1995 Canadian Conference on Electrical and Computer Engineering\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CCECE.1995.528117\",\"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 1995 Canadian Conference on Electrical and Computer Engineering","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CCECE.1995.528117","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
The Galois field division is a complex arithmetic operation. The corresponding division-and-accumulation (DAA) is not only complex but also time consuming operation. The DAA operation over GF(2/sup m/) is considered, and its algorithms and architectures are presented. The algorithms can be modified not to require any division at all. The architectures can support pipeline and multi-level DAAs resulting in an increased throughput without a proportional increase in the hardware.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
