Misplaced Pages

Word size: Difference between revisions

Article snapshot taken from Wikipedia with creative commons attribution-sharealike license. Give it a read and then ask your questions in the chat. We can research this topic together.
Browse history interactively← Previous editNext edit →Content deleted Content addedVisualWikitext
Revision as of 02:21, 17 May 2005 editWtshymanski (talk | contribs)Extended confirmed users76,122 edits Link to 46-bit words← Previous edit Revision as of 03:16, 27 May 2005 edit undoR. S. Shaw (talk | contribs)Extended confirmed users, Pending changes reviewers, Rollbackers11,667 edits merge and redirect to Word (computer science)Next edit →
Line 1: Line 1:
#redirect]
In ] terminology, '''word size''' ('''word length''') is the number of ]s that a ] can process at one time (the ]). Processors with many different word sizes have existed, where the word size was selected as a trade off between precision and range of numeric results and the cost of the processing hardware. A 12-bit data word was used by some ]s such as the ] ] and is still used on special-purpose ]s such as ]s and ]s. Some early ] systems used 35, ], 40, 44 or 45-bit words, or words that contained between 6 and 16 decimal digits. Word lengths in powers of two (8, 16, 32, 64) have predominated for many years, roughly since the introducionn of the ] System 360. See ], ], ], ], ].

A processor's word size for arithmetic is often equal to the width of its external ] though sometimes the bus is made narrower than the CPU (often half as many bits) to economise on packaging and ] costs, space, and power consumption. For machines of the ] type, a word size equal or greater than the logical address size is convenient, though the physical address range of a processor may be greater or less than the word size for arithmetic.

A word ''n'' bits long can hold 2<sup>''n''</sup> distinct values. If these values represent integers, by far the most common ranges are &minus;2<sup>''n''&minus;1</sup> to 2<sup>''n''&minus;1</sup>&minus;1 inclusive, or 0 to 2<sup>''n''</sup>&minus;1 inclusive.

{{FOLDOC}}

]
]

==Reference==
Anthony Ralston and Edwin D. Reilly, ''Encyclopedia of Computer Science Third Edition'', Van Nostrand Reinhold, New York, 1993 ISBN 0442276795

]
]

Revision as of 03:16, 27 May 2005

Redirect to: