DocumentCode :
1759836
Title :
Comments on “Low-Latency Digit-Serial Systolic Double Basis Multiplier over GF(2^{m})
Author :
Reyhani-Masoleh, Arash
Author_Institution :
Dept. of Electr. & Comput. Eng., Western Univ., London, ON, Canada
Volume :
64
Issue :
4
fYear :
2015
fDate :
April 1 2015
Firstpage :
1215
Lastpage :
1216
Abstract :
The digit-serial systolic double basis multiplier architecture proposed in the above paper does not generate the correct multiplication results as it requires more latches to process digits of inputs in appropriate clock cycles. In this comment, we present the corrected architecture and obtain its time and area complexities. More importantly, we show that the claims made by the authors regarding having significantly lower time and area complexities than its counterpart are not valid.
Keywords :
Toeplitz matrices; computational complexity; multiplying circuits; area complexities; digit-serial systolic double basis multiplier architecture; low-latency digit-serial systolic double basis multiplier; subquadratic Toeplitz matrix-vector product approach; time complexities; Clocks; Complexity theory; Computer architecture; Latches; Logic gates; Polynomials; Propagation delay; Finite field; digit-serial; multiplier; systolic;
fLanguage :
English
Journal_Title :
Computers, IEEE Transactions on
Publisher :
ieee
ISSN :
0018-9340
Type :
jour
DOI :
10.1109/TC.2015.2401024
Filename :
7056575
بازگشت