High-Speed Computer Multiplication Using a Multiple-Bit Decoding Algorithm
IEEE Transactions on Computers
A Novel Technique for Computing Negabinary Squares
IEEE Transactions on Computers
On Binary Multiplication Using the Quarter Square Algorithm
IEEE Transactions on Computers
Integer squarers with overflow detection
Computers and Electrical Engineering
Floating-point division and square root using a Taylor-series expansion algorithm
Microelectronics Journal
Efficient architectures for modulo 2n-1 squarers
DSP'09 Proceedings of the 16th international conference on Digital Signal Processing
| Hi-index | 14.99 |
Using the formula A · B=[(A+ B)/2]2-[(A-B)/2]2, the binary multiplication problem is reducible to that of decomposing the square of P 0 · P1P2... Pkinto a sum of two or three quantities. For the eight-bit case, a study of the multiplication parallelogram suggests p2= R+ S+ T, where Pl and p8 appear only in R, and P2, P7 appear only