Design and Analysis of Approximate Redundant Binary Multipliers

Liu, Weiqiang; Cao, Tian; Yin, Peipei; Zhu, Yuying; Wang, Chenghua; Swartzlander, Earl E.; Lombardi, Fabrizio

doi:10.1109/tc.2018.2890222

Cited by 80 publications

(30 citation statements)

References 36 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The K-map for the radix-4 approximate modified Booth encoder [1], here 0(circled) denotes the modification on which 1 is made 0 and 1 denotes that a circled 0 is replaced by 1.So that here 6 of the values are modifies to make the Booth encoder simple with making it approximate. The truth table is symmetrical is the main principle which brought the approximate design.…”

Section: A Review Of Approximate Radix-4 Booth Encoding Methodsmentioning

confidence: 99%

“…In general the redundant binary multiplier consists of two approximate Booth encoders and two 4:2 approximate compressors with a 16 bit Redundant Binary to Normal Binary convertor which gives the normal binary form as product [1]. To meet different accuracy requirements in redundant binary multipliers, the approximate and exact partial product arrays are used.…”

Section: Existing Techniquesmentioning

confidence: 99%

“…The conventional modified booth encoder when implemented in gate level consists of four 2-input XNOR gates, one 2-input XOR gate, one 3-input OR gate, one 2-input OR gate and one 2-input NAND gate while the above one [1] requires only one 2-input XOR gate with one 2-input AND gate and one 2-input OR gate. Fig.3 The gate-level circuit.…”

Section: Table1 K-map For Approximate Radix-4 Bementioning

confidence: 99%

“…Digital multipliers, in many instances foist a speed limit on the whole design due to the critical paths. [1] Many architectures and numerous high performance algorithms have been proposed to achieve the process of multiplication more aptly [4]. In the first step generation of partial products takes place.…”

Section: Introductionmentioning

confidence: 99%

“…Hence, the multipliers with high speed, low power and area [8] [9] in VLSI design has always been and is still a research subject. One of the signed digit representations, for fast parallel arithmetic, redundant binary (RB) [1] representation is used. The specifications high modularity and addition without carry, made the usage of the representation in redundant binary in the design of high-speed multipliers [2].…”

Section: Introductionmentioning

confidence: 99%

See 4 more Smart Citations

Design and Analysis of Multipliers using Radix-8 Booth Encoding Technique for Low Power and Area Consumption

Sowmini*,

Lavanya,

Sai

et al. 2019

IJITEE

View full text Add to dashboard Cite

As innovation scaling is arriving at its points of confinement, new methodologies have been proposed for computational efficiency. Different techniques have been proposed with advancements in technology to model high-speed along with low power consumption and smaller area multipliers. For the radix-4 booth propagation algorithm for low-power and low complexity applications, an efficient approximate 8 bit redundant multiplier is used. To minimize the complication present in modified booth encoder, approximate Booth RB encoders have been introduced by modifying the truth table with incorrect bits, which resulted in a reduction of the power delay product. Approximate computing is a relevant technique for low power and high performance circuits as used in error-tolerant applications. Approximate or inexact computing is an attractive design methodology for low power design but accomplished by loosening up the necessity of precision. It becomes critical to maintain full accuracy to attain reduced power utilization. In this paper, the design of approximate redundant binary (RB) multipliers is studied and modified to build less complex multiplier with Radix-8 modified booth encoding technique to reduce area and complexities of architectures.

show abstract

Section: A Review Of Approximate Radix-4 Booth Encoding Methodsmentioning

confidence: 99%

Section: Existing Techniquesmentioning

confidence: 99%

Section: Table1 K-map For Approximate Radix-4 Bementioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%