[PDF][PDF] A high speed and very compact two's complement serial/parallel multipliers using Xilinx's FPGAs

AK Oudjida - … Conference on Signal Processing Applications & …, 1996 - researchgate.net
Applications & Technology Page 1 International Conference On Signal Processing
Applications & Technology TIT Page 2 High Speed and Very Compact Two's Complement …

The fully-serial pipelined multiplier

AG Shafer, LR Parker… - 2011 Conference Record …, 2011 - ieeexplore.ieee.org
This paper presents a new multiplier design which is fully-serial and requires only 1.5 N
cycles to return a product. This design has been implemented for both unsigned and two's …

Constant number serial pipeline multipliers

KZ Pekmestzi, P Kalivas - Journal of VLSI signal processing systems for …, 2000 - Springer
The pipeline form of the serial/parallel multiplier for constant numbers, which operates
without insertion of zero words between successive data, is presented. The constant number …

Efficient realization of large size two's complement multipliers using embedded blocks in FPGAs

S Gao, D Al-Khalili, N Chabini - Circuits, Systems & Signal Processing, 2008 - Springer
This paper presents an optimized design approach for two's complement large size
multipliers using smaller size embedded multiplier blocks available as resources in field …

[PDF][PDF] 16-Bit High Speed Modified Booth Multiplier for Signed and Unsigned Numbers‖

TVS Reddy, JN Bai - International Journal of New Trends in Electronics and … - academia.edu
This paper presents the design and implementation of signed-unsigned Modified Booth
multiplier. The present MBE multiplier and Baugh-wooley multi-pliers performs multiplication …

A versatile signed array multiplier suitable for VLSI implementation

Q Wang, YR Shayan - … a Caring and Humane Technology (Cat …, 2003 - ieeexplore.ieee.org
The basic building block of DSP-based implementation is multipliers. There are many
multiplier structures suitable for VLSI implementation. In this paper, a new structure is …

Two's-complement fast serial-parallel multiplier

S Sunder, F El-Guibaly, A Antoniou - IEE Proceedings-Circuits, Devices and …, 1995 - IET
A fast serial-parallel multiplier based on the Baugh-Wooley algorithm is proposed. It is
shown that sign extension of the sum or carry bit, produced during the addition of the bit …

Interlaced partition multiplier

C Fritz, AT Fam - IEEE Transactions on Computers, 2015 - ieeexplore.ieee.org
A new apparatus for fast multiplication of two numbers is introduced. Inputs are split into
partitions, and one number is replaced by two with zeros interlaced in every other partition …

Most-significant-bit-first serial/parallel multipliers

P Larsson-Edefors, WP Marnane - IEE Proceedings-Circuits, Devices and …, 1998 - IET
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 …

Serial-parallel multiplier for two's complement numbers

SM Moh, SH Yoon - Electronics Letters, 1995 - IET
A serial-parallel multiplier for two's complement numbers is proposed. Based on an efficient
two's complement multiplication algorithm, the proposed multiplier is composed of …