Cellular two's complement serial—pipeline multipliers

KZ Pekmestzi, GD Papadopoulos - Radio and Electronic Engineer, 1979 - IET
Serial two's complement pipeline multipliers are the basic module in the serial arithmetic
implementation of digital signal processing algorithms. These multipliers accept the data …

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 …

Two's complement pipeline multipliers

R Lyon - IEEE Transactions on Communications, 1976 - ieeexplore.ieee.org
Digital filters and signal processors when realized in hardware often use serial transfer of
data. Multipliers which are capable of accepting variable coefficients and data in sign and …

Pipelined serial/parallel multiplier with contraflowing data streams

MB Tošić, MK Stojčev - Electronics Letters, 1991 - IET
An improved architecture of the Muller pipeline serialparallel multiplier is presented. The
proposed solution is based on the integration of two Muller cells into one. This modification …

[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 …

Evaluation of Booth's algorithm for implementation in parallel multipliers

P Bonatto, VG Oklobdzija - Conference Record of The Twenty …, 1995 - ieeexplore.ieee.org
The Booth (1951) encoding technique, used in parallel multipliers seems to be obsolete
because of the improvement of compression trees using 4: 2 compressors. This article …

Multiplexer-based array multipliers

KZ Pekmestzi - IEEE transactions on computers, 1999 - ieeexplore.ieee.org
A new algorithm for the multiplication of two n-bit numbers based on the synchronous
computation of the partial sums of the two operands is presented. The proposed algorithm …

Two's complement parallel multiplier

A Aggoun - Electronics Letters, 1998 - IET
A new two's complement parallel multiplier architecture is proposed. It is based on the
partitioning of one of the operands into four groups. Array multipliers without the final adder …

A high-speed, asynchronous, digital multiplier

DR Noaks, DP Burton - Radio and Electronic Engineer, 1968 - IET
The digital multiplication of two numbers of any sign by the successive addition of partial
products is critically examined for the purpose of reducing the time of computation. The …