TY - GEN
T1 - Design of square generator with small look-up table
AU - Tsai, Wei Chang
AU - Shieh, Ming Der
AU - Lin, Wen Chin
AU - Wey, Chin Long
PY - 2008
Y1 - 2008
N2 - A table of squares for n-bit numbers can be used for LUT-based multiplication for n-bit numbers. This squares-based multiplication using look-up table simplifies the process as a simple addition/subtraction and table look-up, and, thus, speed-ups the operating speed. This study presents a low-cost, yet efficient square generator using a recursive scheme.
AB - A table of squares for n-bit numbers can be used for LUT-based multiplication for n-bit numbers. This squares-based multiplication using look-up table simplifies the process as a simple addition/subtraction and table look-up, and, thus, speed-ups the operating speed. This study presents a low-cost, yet efficient square generator using a recursive scheme.
UR - http://www.scopus.com/inward/record.url?scp=62949163754&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=62949163754&partnerID=8YFLogxK
U2 - 10.1109/APCCAS.2008.4745988
DO - 10.1109/APCCAS.2008.4745988
M3 - Conference contribution
AN - SCOPUS:62949163754
SN - 9781424423422
T3 - IEEE Asia-Pacific Conference on Circuits and Systems, Proceedings, APCCAS
SP - 172
EP - 175
BT - Proceedings of APCCAS 2008 - 2008 IEEE Asia Pacific Conference on Circuits and Systems
T2 - APCCAS 2008 - 2008 IEEE Asia Pacific Conference on Circuits and Systems
Y2 - 30 November 2008 through 3 December 2008
ER -