Peer-Reviewed Journal Details
Mandatory Fields
Larsson-Edefors P., Marnane W.P.
1998
August
IEE Proceedings-Circuits Devices and Systems
Most-significant-bit-first serial/parallel multipliers
Validated
()
Optional Fields
serial/parallel multipliers MSB-first multiplication SERIAL
145
4
278
284
Three serial/parallel multipliers are introduced, which both receive the serial input data and produce the serial product in a most-significant-bit-first (MSB-first) fashion. Advantages of using MSB-first multiplication over conventional least-significant-bit-first multiplication include efficient calculation of MSB-first data from analogue/digital conversion; efficient interfacing with MSB-first algorithms such as square root and division; and simple truncation of the product. The approach does not utilise any special number system, but multiplier architectures both for unsigned and two's complement number representation (both for the direct and the Baugh-Wooley algorithms) are provided.
UK
1350-2409
10.1049/ip-cds:19982122
Grant Details