Review this prior art and click on the thumbs up (or down) to indicate whether this submission should be forwarded to IP Australia.
If you login then you can add an annotation by typing in the box at the bottom of the screen to comment on the relevance of the prior art to the claims of the patent application.
| Summary / Description | identical algorithm |
| Type of Prior Art | Online Publication |
| URL | http://dx.doi.org/10.1049/ip-cd... |
| Author/Creator | M. Cowlishaw |
| Title | IBM UK Ltd., UK |
| Publication Date | April 30, 2001 |
| Publisher | Institution of Engineering and Technology |
| Directions to Document Location | |
| Additional Information | |
| Notes | |
Excerpt Chen–Ho encoding is a lossless compression of three binary coded decimal digits into 10 bits using an algorithm which can be applied or reversed using only simple Boolean operations. An improvement tothe encoding which has the same advantages but is not limited to multiples of three digits is described. The new encoding allows arbitrary-length decimal numbers to be coded efficiently while keeping decimal digit boundaries accessible. This in turn permits efficient decimal arithmetic and makes the best use of available resources such as storage or hardware registers. |
A method of converting a number to a binary representation, the method comprising the step of:
converting a predetermined size segment of a number to a binary representation, the predetermined size segment based on a processor word size.
| Relevance | identical algorithm |
The method of claim 1, wherein the predetermined size segment is one or more digits and the number of digits equal to the maximum number of digits storable in one word of the processor word size wherein each digit is able to be all of the range of number system numbers.
| Relevance | identical algorithm |
The method of claim 1, further comprising the step of:
setting the segment size to the number of digits of the largest number having a given number of digits, if the largest number having a given number of digits is greater than a largest storable number in the processor word size.
| Relevance | identical algorithm |
The method of claim 1, further comprising the step of:
setting the segment size to one less than the number of digits of the largest number having a given number of digits, if the largest number having a given number of digits is less than or equal to a largest storable number in the processor word size.
| Relevance | identical algorithm |
The method of claim 1, wherein the number in binary form is larger than a single processor word.
| Relevance | identical algorithm |
A method of converting a number represented in binary form and comprised of more than one segment to a decimal representation, the method comprising the steps of:
combining a first decimal segment resulting from converting a segment of the more than one binary segments to decimal form with a second decimal segment resulting from converting another segment of the more than one binary segment to decimal form, wherein the segment size is determined based on processor word size.
| Relevance | identical algorithm |
A method of converting a number having one or more digits to a binary representation, comprising the steps of:
determining a maximum number of digits storable in one word of a processor having a predetermined word size; and
converting the determined maximum storable number of digits of the number to a binary representation in a first word.
| Relevance | identical algorithm |
The method of claim 7, further comprising the step of:
repeating the converting step for a determined maximum storable number of digits of the number less all previously converted digits to a binary representation in an additional word.
| Relevance | identical algorithm |
A computer-readable medium for representing a number in binary form based on processor word size comprising:
more than one segment, wherein the segment size is determined based on processor word size, representing more than one digit of a number in binary form.
| Relevance | identical algorithm |
The medium of claim 9, wherein the segment size is the number of digits equal to the maximum number of digits storable in one word of the processor word size wherein each digit is able to be all of the range of number system numbers.
| Relevance | identical algorithm |
United States