scispace - formally typeset
Proceedings ArticleDOI

Decimal multiplier on FPGA using embedded binary multipliers

Reads0
Chats0
TLDR
This paper introduces a novel approach to the design of a decimal multiplier in FPGA using the embedded arithmetic blocks and a novel method for binary to BCD conversion and results indicate that the proposed binary toBCD converter is more efficient than the traditional shift and add-3 algorithm.
Abstract
Decimal arithmetic has become a major necessity in computer arithmetic operations associated with human-centric applications, like financial and commercial, because the results must match exactly those obtained by human calculations. The relevance of decimal arithmetic has become evident with the revision of the IEEE-754 standard to include decimal floating-point support. There are already a variety of IP cores available for implementing binary arithmetic accelerators in FPGAs. Thus far, however, little work has been done with regard to implementing cores that work with decimal arithmetic. In this paper, we introduce a novel approach to the design of a decimal multiplier in FPGA using the embedded arithmetic blocks and a novel method for binary to BCD conversion. The proposed circuits were implemented in a Xilinx Virtex 4sx35ff877-12 FPGA. The results indicate that the proposed binary to BCD converter is more efficient than the traditional shift and add-3 algorithm and that the proposed decimal multiplier is very competitive when compared to decimal multipliers implemented with direct manipulation of BCD numbers.

read more

Citations
More filters
Proceedings ArticleDOI

Parallel decimal multipliers using binary multipliers

TL;DR: This paper analyzes the tradeoffs involved in the design of a parallel decimal multiplier, for decimal operands with 8 and 16 digits, using existent coarse-grained embedded binary arithmetic blocks and indicates that the proposed parallel multipliers are very competitive when compared to decimal multipliers implemented with direct manipulation of BCD numbers.
Proceedings ArticleDOI

FPGA Implementations of BCD Multipliers

TL;DR: A variety of algorithms for basic one by one digit multiplication are proposed and FPGA implementations are presented, and time and area results for sequential and combinational implementations show better figures compared with previous published work.
Proceedings ArticleDOI

Iterative decimal multiplication using binary arithmetic

TL;DR: An iterative decimal multiplier for FPGA that uses binary arithmetic and the results indicate that the proposed iterative multipliers are very competitive when compared to decimal multipliers implemented with direct manipulation of BCD numbers.
Proceedings ArticleDOI

Revisiting the Newton-Raphson Iterative Method for Decimal Division

TL;DR: The results indicate that the proposed Divider uses the Newton-Raphson iterative method with an initial approximation calculated with a minimax polynomial and is better in terms of throughput when compared to decimal dividers based on digit-recurrence algorithms.
Book ChapterDOI

Design of high speed vedic multiplier for decimal number system

TL;DR: BCD implementation of Vedic multiplier ensures the stage reduction for decimal number, hence substantial reduction in propagation delay compared with earlier reported one, has been investigated and the best architecture reported so far has been achieved.
References
More filters
Proceedings ArticleDOI

Decimal floating-point: algorism for computers

TL;DR: This work introduces a new approach to decimal floating point which not only provides the strict results which are necessary for commercial applications but also meets the constraints and requirements of the IEEE 854 standard.
Proceedings ArticleDOI

Decimal multiplication via carry-save addition

TL;DR: Two novel designs for fixed-point decimal multiplication are presented that utilize decimal carry-save addition to reduce the critical path delay and can be extended to support decimal floating-point multiplication.
Proceedings ArticleDOI

A Radix-10 Combinational Multiplier

TL;DR: The results of the implementation show that the combinational decimal multiplier offers a good compromise between latency and area when compared to other decimal multiply units and to binary double-precision multipliers.
Proceedings ArticleDOI

A high-frequency decimal multiplier

TL;DR: An iterative decimal multiplier is presented, which operates at high clock frequencies and scales well to large operand sizes and uses a new decimal representation for intermediate products, which allows for a very fast two-stage iterative multiplier design.
Patent

Apparatus for decimal multiplication

TL;DR: In this article, an apparatus for decimal multiplication divides a multiplier of binary coded decimal into plural groups, generates plural partial products of which are multiplied a multiplicand of BCD and the plural groups of multiplier over successive cycles and adds them to an intermediate product which is a summation of the previously generated partial products.