2009•Computer Engineering and Applications JournalRequires access
Efficient partial parallel multiplier for a kind of finite fields
Huafeng Chen
Open publisher page 0 citations
Abstract
A new high regular structure of partial parallel multiplier for irreducible trinomial generated finite field is proposed. Through the analysis of multiplication over finite field GF(2m),generated by irreducible trinomial,the basic computation format is deduced.The novel multiplier structure is designed based on the basic computation format.According to the complexity analysis, the multiplier has the same complexity with the optimal designs up to date.Meanwhile,it can be configured according to specific demands of all kinds of applications.