Nibble
 | This article needs additional citations for verification. (April 2015) |
In computing, a nibble (often nybble or nyble to match the vowels of byte) is a four-bit aggregation,[1] or half an octet. It is also known as half-byte[2] or tetrade.[3] In a networking or telecommunication context, the nibble is often called a semi-octet,[4] quadbit,[5] or quartet.[6] A nibble has sixteen (24) possible values. A nibble can be represented by a single hexadecimal digit and called a hex digit.[7]
A full byte (octet) is represented by two hexadecimal digits; therefore, it is common to display a byte of information as two nibbles. Sometimes the set of all 256 byte values is represented as a table 16×16, which gives easily readable hexadecimal codes for each value.
Four-bit computer architectures use groups of four bits as their fundamental unit. Such architectures were used in early microprocessors and pocket calculators and continue to be used in some microcontrollers.
History
The term 'nibble' originates from its representing 'half a byte', with 'byte' a homophone of the English word 'bite'.[2]
In 2014, David B. Benson, a professor emeritus at Washington State University, remembered that he playfully used (and may have possibly coined) the term nibble as "half a byte" and unit of storage required to hold a binary-coded decimal (BCD) decimal digit around 1958, when talking to a programmer of Los Alamos Scientific Laboratory.[8]
The alternative spelling 'nybble' reflects the spelling of 'byte', as noted in editorials of Kilobaud and Byte in the early 1980s.
Another early recorded use of the term 'nybble' was in 1977 within the consumer-banking technology group at Citibank. It created a pre-ISO 8583 standard for transactional messages between cash machines and Citibank's data centres that used the basic informational unit 'NABBLE'.
The nibble is used to describe the amount of memory used to store a digit of a number stored in packed decimal format (BCD) within an IBM mainframe. This technique is used to make computations faster and debugging easier. An 8-bit byte is split in half and each nibble is used to store one decimal digit. The last (rightmost) nibble of the variable is reserved for the sign. Thus a variable which can store up to nine digits would be "packed" into 5 bytes. Ease of debugging resulted from the numbers being readable in a hex dump where two hex numbers are used to represent the value of a byte, as 16×16 = 28. For example, a five-byte BCD value of 31 41 59 26 5C represents a decimal value of +314159265.
Historically, there are cases where nybble was used for a group of bits greater than 4. In the Apple II microcomputer line, much of the disk drive control was implemented in software. Writing data to a disk was done by converting 256-byte pages into sets of 5-bit (later, 6-bit) nibbles and loading disk data required the reverse. Moreover, 1982 documentation for the Integrated Woz Machine refers consistently to an "8 bit nibble".[9]
Note that the term byte once had this ambiguity and meant a set of bits but not necessarily 8, hence the distinction of bytes and octets. Today, the terms 'byte' and 'nibble' almost always refer to 8-bit and 4-bit collections respectively and are very rarely used to express any other sizes.
The term 'semi-nibble' or 'nibblet' is used to refer to a 2-bit collection or half a nibble but rarely so.
Table of nibbles
The sixteen nibbles and their equivalents in other numeral systems:
| 0hex | = | 0dec | = | 0oct | 0 | 0 | 0 | 0 | |||
| 1hex | = | 1dec | = | 1oct | 0 | 0 | 0 | 1 | |||
| 2hex | = | 2dec | = | 2oct | 0 | 0 | 1 | 0 | |||
| 3hex | = | 3dec | = | 3oct | 0 | 0 | 1 | 1 | |||
| 4hex | = | 4dec | = | 4oct | 0 | 1 | 0 | 0 | |||
| 5hex | = | 5dec | = | 5oct | 0 | 1 | 0 | 1 | |||
| 6hex | = | 6dec | = | 6oct | 0 | 1 | 1 | 0 | |||
| 7hex | = | 7dec | = | 7oct | 0 | 1 | 1 | 1 | |||
| 8hex | = | 8dec | = | 10oct | 1 | 0 | 0 | 0 | |||
| 9hex | = | 9dec | = | 11oct | 1 | 0 | 0 | 1 | |||
| Ahex | = | 10dec | = | 12oct | 1 | 0 | 1 | 0 | |||
| Bhex | = | 11dec | = | 13oct | 1 | 0 | 1 | 1 | |||
| Chex | = | 12dec | = | 14oct | 1 | 1 | 0 | 0 | |||
| Dhex | = | 13dec | = | 15oct | 1 | 1 | 0 | 1 | |||
| Ehex | = | 14dec | = | 16oct | 1 | 1 | 1 | 0 | |||
| Fhex | = | 15dec | = | 17oct | 1 | 1 | 1 | 1 | |||
Low and high nibbles
The terms "low nibble" and "high nibble" are used to denote the nibbles containing, respectively, the less significant bits and the more significant bits within a byte. In graphical representations of bits within a byte, the leftmost bit could represent the most significant bit (MSB), corresponding to ordinary decimal notation in which the digit at the left of a number is the most significant. In such illustrations the four bits on the left end of the byte form the high nibble, and the remaining four bits form the low nibble.[10]
Examples
| 0000 0100 0010 = 042 |
|---|
| 0010 1010 1001 = 2A9 |
| 0010 0000 1001 = 209 |
| 1110 0100 1001 = E49 |
| 0011 1001 0110 = 396 |
| 0001 0000 0001 = 101 |
| 0011 0101 0100 = 354 |
| 0001 0110 0100 = 164 |
Extracting a nibble from a byte
In the C programming language:
#define HI_NIBBLE(b) (((b) >> 4) & 0x0F)
#define LO_NIBBLE(b) ((b) & 0x0F)
where b must be a variable or constant of an integral data type, and only the least-significant byte of b is used.
For example, HI_NIBBLE(0xAB)==0xA and LO_NIBBLE(0xAB)==0xB.
In Common Lisp:
(defun hi-nibble (b)
(ldb (byte 4 4) b))
(defun lo-nibble (b)
(ldb (byte 4 0) b))
See also
References
- ^ Hall, D. V. (1980). Microprocessors and Digital Systems. McGraw-Hill. ISBN 0-07-025571-7.
{{cite book}}: Cite has empty unknown parameter:|coauthors=(help) - ^ a b Raymond, Eric S. (1996). The New Hacker's Dictionary. MIT Press. p. 333. ISBN 9780262680929.
- ^ Carr, John W. Introduction to the use of digital computers: Notes from the Summer Conference Held at the Computation Center of the University of North Carolina, Chapel Hill, N.C., August 17-28, 1959. Frontier Research on Digital Computers. Vol. 1. University of North Carolina at Chapel Hill, Computation Center. p. 211.
Each of these letters corresponds to one of the integers from zero to fifteen, therefore requiring 4 bits (one "tetrade") in binary representation.
- ^ Puzman, Josef; Kubin, Boris (2012). Public Data Networks: From Separate PDNs to the ISDN. Springer. p. 113. ISBN 9781447117377.
- ^ Horak, Ray (2007). Webster's New World Telecom Dictionary. John Wiley & Sons. p. 402. ISBN 9780470225714.
- ^ Brewster, Ronald L. (1994). Data Communications and Networks, Vol. III. IEE telecommunications series. Vol. 31. Institution of Electrical Engineers. p. 155. ISBN 9780852968048.
A data symbol represents one quartet (4 bits) of binary data.
- ^ Heller, Steve (1997). Introduction to C++. Morgan Kaufmann. p. 27. ISBN 9780123390998.
Each hex digit (0–f) represents exactly 4 bits.
- ^ Comment by David B. Benson on Wikipedia discussion page Talk:Nibble, July 27, 2014.
- ^ http://www.brutaldeluxe.fr/documentation/iwm/apple2_IWM_Spec_Rev19_1982.pdf
- ^ "Binary arithmetic". Connected: An Internet Encyclopedia. Retrieved 2015-07-20.