- Radix economy
Various proposals have been made to quantify the relative costs between using different radices in representing numbers.
Definition
The radix economy "E"("b","N") for any particular number "N" in a given base "b" is equal to the number of digits needed to express it in that base, multiplied by the radix:cite journal | title = Third Base | author = Brian Hayes | work =
American Scientist | volume = 89 | issue = 6 | year = 2001 | pages = 490 | doi = 10.1511/2001.40.3268] :
::
For example, 100 indecimal has three digits, so its radix economy is 10x3 = 30; its binary respresentation has seven digits (11001002) so it has radix economy 2x7 = 14 in base 2; inbase 3 its representation has five digits (102013) with a radix economy of 3x5 = 15; in base 36 (2S36) its radix economy is 36x2 = 72.The radix economy of bases "b"1 and "b"2 may be compared for a large fixed value of "N":
:
Since the function
:
has a minimum value when "x" = "e", the base with the lowest average radix economy is theoretically base "e". The integral base with the lowest average radix economy is base 3 (because 3 is the nearest integer to "e") followed by binary and
base 4 .For example, the average radix economy of the integers from 1 to 100 in various bases is:
:
Radix times required digits
The classic 1950 reference "High-Speed Computing Devices" describes a particular situation using contemporary technology. Each digit of a number would be stored as the state of a
ring counter composed of severaltriode s. Whethervacuum tube s orthyratron s, the triodes were the most expensive part of a counter. For small radices "r" less than about 7, a single digit required "r" triodes. [Engineering Research Associates pp.20-23: 3-6. The "r"-triode Counter, Modulo "r"] (Larger radices required 2"r" triodes arranged as "r"flip-flop s, as inENIAC 's decimal counters.) [Engineering Research Associates pp.23-25: 3-7. The 2"r"-triode Counter, Modulo "r"]So the number of triodes in a numerical register with "n" digits was "rn". In order to represent numbers up to 106, the following numbers of tubes were needed:
:
The authors conclude,
A similar analysis suggests that the optimum design of a large telephone menu system to minimise the number of menu choices that a customer must listen to (i.e. the product of the number of choices per menu and the number of menu levels) is to have three choices per menu.
Other criteria
In another application, the authors of "High-Speed Computing Devices" consider the speed with which an encoded number may be sent as a series of high-frequency voltage pulses. For this application the compactness of the representation is more important than in the above storage example. They conclude, "A saving of 58 per cent can be gained in going from a binary to a ternary system. A smaller percentage gain is realized in going from a radix 3 to a radix 4 system." [Engineering Research Associates pp.419-521: 16-2. New Techniques]
ee also
*
Ternary computer References
*cite book |author=Engineering Research Associates Staff |title=High-Speed Computing Devices |publisher=McGraw-Hill |year=1950 |url=http://www.archive.org/details/HighSpeedComputingDevices |accessdate=2008-08-27
Further reading
*S.L. Hurst, "Multiple-Valued Logic-Its Status and its Future", "IEEE trans. computers", Vol. C-33, No 12, pp. 1160–1179, DEC 1984.
*J. T. Butler, "Multiple-Valued Logic in VLSI Design, ” IEEE Computer Society Press Technology Series, 1991.
*C.M. Allen, D.D. Givone “The Allen-Givone Implementation Oriented Algebra", in "Computer Science and Multiple-Valued Logic: Theory and Applications", D.C. Rine, second edition, D.C. Rine, ed., The Elsevier North-Holland, New York, N.Y., 1984. pp. 268–288.
*G. Abraham, "Multiple-Valued Negative Resistance Integrated Circuits", in "Computer Science and Multiple-Valued Logic: Theory and Applications", D.C. Rine, second edition, D.C. Rine, ed., The Elsevier North-Holland, New York, N.Y., 1984. pp. 394–446.External links
* [http://gtode.tripod.com/Optimum.htm The Optimum Radix In Multiple-Valued Logic Systems]
Wikimedia Foundation. 2010.