On-Line Error Detection for Bit-Serial Multipliers in GF(2m)
Authors:
- 1 August 1998
- journal article
- Published by Springer Nature in Journal of Electronic Testing
- Vol. 13 (1) , 29-40
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Bit-serial multiplication in GF(2m) using irreducible all-one polynomialsIEE Proceedings - Computers and Digital Techniques, 1997
- A parity-preserving multi-input signature analyzer and its application for concurrent checking and BISTJournal of Electronic Testing, 1996
- GF(2/sup m/) multiplication and division over the dual basisIEEE Transactions on Computers, 1996
- A modified Massey-Omura parallel multiplier for a class of finite fieldsIEEE Transactions on Computers, 1993
- Modular construction of low complexity parallel multipliers for a class of finite fields GF(2/sup m/)IEEE Transactions on Computers, 1992
- Can concurrent checkers help BIST?1992
- Bit Serial Multiplication in Finite FieldsSIAM Journal on Discrete Mathematics, 1990
- Structure of parallel multipliers for a class of fields GF(2m)Information and Computation, 1989
- Efficient bit-serial multiplication and the discrete-time Wiener-Hopf equation over finite fieldsIEEE Transactions on Information Theory, 1989
- Bit-serial Reed - Solomon encodersIEEE Transactions on Information Theory, 1982