Efficient hardware implementations of binary-to-BCD conversion schemes for decimal multiplication

Osama Al-Khaleel, Zakaria Al-Qudah, Mohammad Al-Khaleel, Raed Bani-Hani, Christos Papachristou, Francis Wolff

Research output: Contribution to journalArticlepeer-review

3 Scopus citations


This paper proposes two high performance binary-to-binary coded decimal (BCD) conversion algorithms for use in BCD multiplication. These algorithms are based on splitting the 7-bit binary partial product of two BCD digits into two groups, computing the contribution of each group to the equivalent BCD partial product, and adding these contributions to compute the final BCD partial product. Designs for the proposed architectures and their implementations targeting both ASIC and FPGA are compared with others. Implementations of BCD array multipliers using both our conversion circuits and existing conversion circuits have been performed. The synthesis results for both ASIC and FPGA show that the proposed designs are faster and occupying less area than the state-of-the-art conversion circuits. Furthermore, the results obtained from comparing BCD multipliers of various sizes show that the enhancement in the area of the conversion circuit grows into a sizable area improvement in the multiplier circuit.

Original languageBritish English
Article number1550019
JournalJournal of Circuits, Systems and Computers
Issue number2
StatePublished - 1 Feb 2015


  • ASIC
  • BCD
  • conversion
  • decimal multiplication
  • FPGA
  • partial products


Dive into the research topics of 'Efficient hardware implementations of binary-to-BCD conversion schemes for decimal multiplication'. Together they form a unique fingerprint.

Cite this