{"title":"The least complex parallel Massey-Omura multiplier and its LCA and VLSI designs","authors":"Y. Shayan, T. Le-Ngoc","doi":"10.1049/IP-G-2.1989.0057","DOIUrl":null,"url":null,"abstract":"After reviewing the Massey-Omura multiplier, as an illustrative example it is shown that there are three polynomials which generate GF(2/sup 5/) in normal basis representation. The three multipliers based on these polynomials are considered and the polynomial which results in the least complex multiplier design is found. Then, based on this polynomial and the resultant design, LCA and VLSI implementation of the GF(2s/sup 5/) multiplier is considered and compared.<<ETX>>","PeriodicalId":256287,"journal":{"name":"Conference Proceeding IEEE Pacific Rim Conference on Communications, Computers and Signal Processing","volume":"35 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1989-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Conference Proceeding IEEE Pacific Rim Conference on Communications, Computers and Signal Processing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1049/IP-G-2.1989.0057","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 6
Abstract
After reviewing the Massey-Omura multiplier, as an illustrative example it is shown that there are three polynomials which generate GF(2/sup 5/) in normal basis representation. The three multipliers based on these polynomials are considered and the polynomial which results in the least complex multiplier design is found. Then, based on this polynomial and the resultant design, LCA and VLSI implementation of the GF(2s/sup 5/) multiplier is considered and compared.<>
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
