scispace - formally typeset
Journal ArticleDOI

Two's Complement Pipeline Multipliers

Richard F. Lyon
- 01 Apr 1976 - 
- Vol. 24, Iss: 4, pp 418-425
Reads0
Chats0
TLDR
This concise paper addresses the design of multipliers capable of accepting data in 2's complement notation, or both data and coefficients in 1's complement shorthand, and considers multiplier recoding techniques, such as the Booth algorithm.
Abstract
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 magnitude notation and producing serial products of the same length as the input data word have been known for some time. This concise paper addresses the design of multipliers capable of accepting data in 2's complement notation, or both data and coefficients in 2's complement notation. It also considers multiplier recoding techniques, such as the Booth algorithm. Specialized (fixed coefficient) multiplier designs are considered briefly. Finally, multiplier rounding and overflow characteristics are discussed, and a rough comparison is made between the complexity of the various designs.

read more

Citations
More filters
Journal ArticleDOI

Why systolic architectures

TL;DR: The basic principle of systolic architectures is reviewed and it is explained why they should result in cost-effective, highperformance special-purpose systems for a wide range of problems.
Journal ArticleDOI

Programmable active memories: reconfigurable systems come of age

TL;DR: This work exhibits a dozen applications where PAM technology proves superior, both in performance and cost, to every other existing technology, including supercomputers, massively parallel machines, and conventional custom hardware.
Journal ArticleDOI

Concurrent VLSI Architectures

TL;DR: This tutorial paper addresses some of the principles and provides examples of concurrent architectures and designs that have been inspired by VLSI technology.
Journal ArticleDOI

Systolic Multipliers for Finite Fields GF(2 m )

TL;DR: Two systolic architectures are developed for performing the product–sum computation AB + C in the finite field GF( 2m) of 2melements, where A, B, and C are arbitrary elements of GF(2m).
Journal ArticleDOI

Synthesis of control circuits in folded pipelined DSP architectures

TL;DR: The authors derive conditions for the validity of a specified folding set, and present approaches to generate the dedicated architecture using systematic folding of tasks to operators using the technique used to derive the control circuitry of the hardware architecture.