Ringed bit-parallel systolic multipliers over a class of fields GF(2 )
Authors:
- 1 April 2005
- journal article
- Published by Elsevier in Integration
- Vol. 38 (4) , 571-578
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- Low complexity bit-parallel systolic architecture for computing C+AB2 over a class of GF(2 )Integration, 2004
- Bit-parallel systolic multipliers for GF(2/sup m/) fields defined by all-one and equally spaced polynomialsIEEE Transactions on Computers, 2001
- New low-complexity bit-parallel finite field multipliers using weakly dual basesIEEE Transactions on Computers, 1998
- Low-complexity bit-parallel canonical and normal basis multipliers for a class of finite fieldsIEEE Transactions on Computers, 1998
- Modular construction of low complexity parallel multipliers for a class of finite fields GF(2/sup m/)IEEE Transactions on Computers, 1992
- Structure of parallel multipliers for a class of fields GF(2m)Information and Computation, 1989