The reviewed record of science sign in
Pith

arxiv: 2203.09665 · v1 · pith:5IAJQX2I · submitted 2022-03-18 · cs.AR

A Cost-Efficient Look-Up Table Based Binary Coded Decimal Adder Design

Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:5IAJQX2Irecord.jsonopen to challenge →

classification cs.AR
keywords adderbinarycodeddecimaldesignlook-uptableaccurate
0
0 comments X
read the original abstract

The BCD (Binary Coded Decimal) being the more accurate and human-readable representation with ease of conversion, is prevailing in the computing and electronic communication.In this paper, a tree-structured parallel BCD addition algorithm is proposed with the reduced time complexity. BCD adder is more effective with a LUT (Look-Up Table)-based design, due to FPGA (Field Programmable Gate Array) technology's enumerable benefits and applications. A size-minimal and depth-minimal LUT-based BCD adder circuit construction is the main contribution of this paper.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.