Bit-level pipelined digit serial GF(2m) multiplier
A low latency digit serial multiplier for GF(2m) that can be pipelined to the bit-level is presented in this paper. Unlike existing structures, the new multiplier does not put any restriction on the type of generator polynomial used or the digit size. Furthermore, the latency of the new multiplier i...
Saved in:
| Main Author: | |
|---|---|
| Other Authors: | , |
| Format: | article |
| Published: |
2001
|
| Subjects: | |
| Online Access: | https://eprints.kfupm.edu.sa/id/eprint/14133/1/14133_1.pdf https://eprints.kfupm.edu.sa/id/eprint/14133/2/14133_2.doc |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | A low latency digit serial multiplier for GF(2m) that can be pipelined to the bit-level is presented in this paper. Unlike existing structures, the new multiplier does not put any restriction on the type of generator polynomial used or the digit size. Furthermore, the latency of the new multiplier is significantly less than the latency of the existing bit-level pipelined digit-serial multiplier |
|---|