Dismiss
InnovationQ will be updated on Sunday, Jan. 21, from 9am - 11am ET. You may experience brief service interruptions during that time.
Browse Prior Art Database

# Improved High Speed Binary-To-Decimal Conversion Algorithm

IP.com Disclosure Number: IPCOM000035328D
Original Publication Date: 1989-Jul-01
Included in the Prior Art Database: 2005-Jan-28
Document File: 2 page(s) / 39K

IBM

## Related People

Liu, JM: AUTHOR [+2]

## Abstract

Recently, a high speed binary-to-decimal conversion algorithm was introduced that repeatedly isolates bit segments (four bits) and uses the numeric value of each segment isolated as an index to one of the tables with pre-computed decimal values. The result is the sum of all decimal values extracted from the tables.

This text was extracted from a PDF file.
At least one non-text object (such as an image or picture) has been suppressed.
This is the abbreviated version, containing approximately 88% of the total text.

Page 1 of 2

Improved High Speed Binary-To-Decimal Conversion Algorithm

Recently, a high speed binary-to-decimal conversion algorithm was introduced that repeatedly isolates bit segments (four bits) and uses the numeric value of each segment isolated as an index to one of the tables with pre- computed decimal values. The result is the sum of all decimal values extracted from the tables.

This article describes an improved version of that algorithm by using the fact that decimal numbers '0' to '7' are stored in the same formats as binary numbers '000'B to '111'B. The algorithm can be improved by loading the least significant three bits into a decimal accumulator initially without referencing a table. This improved algorithm not only reduces the size of the look-up tables but is faster than the previous one for most input binary numbers.

The prior algorithm initializes the accumulator to zero and processes the binary number starting from the least significant bit. If it is considered that decimal numbers '0' to '7' are stored in the same formats as binary numbers '000'B to '111'B, their algorithm can be improved by loading the least significant three bits into an accumulator, instead of resetting the accumulator initially, without referencing a pre-computed table. After loading the initial value, their conversion algorithm is applied starting from the fourth least significant bit by every four-bit segment.

The figure illustrates this improved binary-to-decimal conversion algorit...