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.
['Wei-chang Tsai', 'Ming-Der Shieh', 'Wen-Ching Lin', 'Chin-Long Wey']
Design of square generator with small look-up table