Nibble - wikipedia Nibble This article is about the information storage unit. For other uses, see Nibble ( disambiguation ). This article needs additional citations for verification. Please help improve this article by adding citations to reliable sources. Unsourced material may be challenged and removed. ( April 2015 ) An octet code page 866 font table ordered by nibbles. In computing, a nibble ( occasionally nybble or nyble to match the spelling of byte ) is a four - bit aggregation, or half an octet. It is also known as half - byte or tetrade. In a networking or telecommunication context, the nibble is often called a semi-octet, quadbit, or quartet. A nibble has sixteen ( 2 ) possible values. A nibble can be represented by a single hexadecimal digit and called a hex digit. 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 16 × 16 table, 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, pocket calculators and pocket computers. They continue to be used in some microcontrollers. Contents 1 History 2 Table of nibbles 3 Low and high nibbles 4 Extracting a nibble from a byte 5 See also 6 References 7 External links History The term ' nibble ' originates from its representing ' half a byte ', with ' byte ' a homophone of the English word ' bite '. 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. 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 centers 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 = 2. 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 and group - coded recording 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 ''. The term byte once had the same ambiguity and meant a set of bits but not necessarily 8, hence the distinction of bytes and octets or of nibbles and quartets ( or quadbits ). 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 terms ' semi-nibble ' or ' nibblet ' have occasionally been used to refer to half a nibble, but the usage of dibit for two bits is more common. Table of nibbles The sixteen nibbles and their equivalents in other numeral systems : Examples Binary Hexadecimal 0000 0100 0010 0 4 2 0010 1010 1001 2 A 9 0010 0000 1001 2 0 9 1110 0100 1001 E 4 9 0011 1001 0110 3 9 6 0001 0000 0001 1 0 1 0011 0101 0100 3 5 4 0001 0110 0100 1 6 4 0 = 0 = 0 0 0 0 0 = = 0 0 0 = = 0 0 0 = = 0 0 = = 0 0 0 5 = 5 = 5 0 0 6 = 6 = 6 0 0 7 = 7 = 7 0 8 = 8 = 10 0 0 0 9 = 9 = 11 0 0 = 10 = 12 0 0 = 11 = 13 0 = 12 = 14 0 0 = 13 = 15 0 = 14 = 16 0 = 15 = 17 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. For example, ninety - seven = 97 = ( 0110 0001 ) the high nibble is 0110 ( 6 ), and the low nibble is 0001 ( 1 ). The total value is high - nibble × 16 + low - nibble ( 6 × 16 + 1 = 97 ). 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 Binary numeral system Syllable ( computing ) Word References Jump up ^ Hall, Douglas V. ( 1980 ). Microprocessors and Digital Systems. McGraw - Hill. ISBN 0 - 07 - 025571 - 7. Jump up ^ Warren Jr., Henry S. ( 2013 ) ( 2002 ). Hacker 's Delight ( 2 ed. ). Addison Wesley - Pearson Education, Inc. ISBN 978 - 0 - 321 - 84268 - 8. 0 - 321 - 84268 - 5. ^ Jump up to : Raymond, Eric S. ( 1996 ). The New Hacker 's Dictionary. MIT Press. p. 333. ISBN 978 - 0 - 262 - 68092 - 9. Jump up ^ 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. 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. Jump up ^ Speiser, Ambrosius Paul ( 1965 ) ( 1961 ). Digitale Rechenanlagen - Grundlagen / Schaltungstechnik / Arbeitsweise / Betriebssicherheit ( Digital computers - Basics / Circuits / Operation / Reliability ) ( in German ) ( 2 ed. ). ETH Zürich, Zürich, Switzerland : Springer - Verlag / IBM. pp. 6, 34, 165, 183, 208, 213, 215. LCCN 65 - 14624. 0978. Jump up ^ Puzman, Josef ; Kubin, Boris ( 2012 ). Public Data Networks : From Separate PDNs to the ISDN. Springer Science + Business Media. p. 113. ISBN 978 - 1 - 4471 - 1737 - 7. ^ Jump up to : Horak, Ray ( 2007 ). Webster 's New World Telecom Dictionary. John Wiley & Sons. p. 402. ISBN 978 - 0 - 470 - 22571 - 4. Jump up ^ Brewster, Ronald L. ( 1994 ). Data Communications and Networks, Vol. III. IEE telecommunications series. 31. Institution of Electrical Engineers. p. 155. ISBN 978 - 0 - 85296 - 804 - 8. A data symbol represents one quartet ( 4 bits ) of binary data. Jump up ^ Courbis, Paul ; Lalande, Sébastien ( 2006 - 06 - 27 ) ( 1989 ). Voyage au centre de la HP28c / s ( in French ) ( 2 ed. ). Paris, France : Editions de la Règle à Calcul. OCLC 636072913. Archived from the original on 2016 - 08 - 06. Retrieved 2015 - 09 - 06. ( 1 ) ( 2 ) ( 3 ) ( 4 ) ( 5 ) ( 6 ) Jump up ^ Heller, Steve ( 1997 ). Introduction to C++. Morgan Kaufmann. p. 27. ISBN 978 - 0 - 12 - 339099 - 8. Each hex digit ( 0 -- f ) represents exactly 4 bits. Jump up ^ Worth, Don D. ; Lechner, Pieter M. ( May 1982 ) ( 1981 ). Beneath Apple DOS ( 4th printing ed. ). Reseda, CA, USA : Quality Software. Retrieved 2017 - 03 - 21. ( 7 ) ( 8 ) ( 9 ) Jump up ^ Worth, Don D. ; Lechner, Pieter M. ( March 1985 ) ( 1984 ). Beneath Apple ProDOS - For Users of Apple II Plus, Apple IIe and Apple IIc Computers ( PDF ) ( 2nd printing ed. ). Chatsworth, CA, USA : Quality Software. ISBN 0 - 912985 - 05 - 4. LCCN 84 - 61383. Archived ( PDF ) from the original on 2017 - 03 - 21. Retrieved 2017 - 03 - 21. ( 10 ) Jump up ^ Copy II Plus Version 9 - ProDOS / DOS Utilities - Data Recovery, File Management, Protected Software Backup ( PDF ). 9.0. Central Point Software, Inc. 1989 - 10 - 31 ( 1982 ). Archived ( PDF ) from the original on 2016 - 03 - 13. Retrieved 2017 - 03 - 21. Jump up ^ Apple Computer, Inc. ( February 1982 ) ( 1978 ). Integrated Woz Machine ( IWM ) Specification ( PDF ) ( 19 ed. ). DigiBam Computer Museum. Archived ( PDF ) from the original on 2016 - 08 - 06. Retrieved 2016 - 08 - 06. Jump up ^ Steinbuch, Karl W. ; Wagner, Siegfried W., eds. ( 1967 ) ( 1962 ). Taschenbuch der Nachrichtenverarbeitung ( in German ) ( 2 ed. ). Berlin, Germany : Springer - Verlag OHG. pp. 835 -- 836. LCCN 67 - 21079. Title No. 1036. Jump up ^ Steinbuch, Karl W. ; Weber, Wolfgang ; Heinemann, Traute, eds. ( 1974 ) ( 1967 ). Taschenbuch der Informatik - Band III - Anwendungen und spezielle Systeme der Nachrichtenverarbeitung. Taschenbuch der Nachrichtenverarbeitung ( in German ). 3 ( 3 ed. ). Berlin, Germany : Springer Verlag. pp. 357 -- 358. ISBN 3 - 540 - 06242 - 4. LCCN 73 - 80607. Jump up ^ Bertram, H. Neal ( 1994 ). Theory of magnetic recording ( 1 ed. ). Cambridge University Press. ISBN 0 - 521 - 44973 - 1. 9 - 780521 - 449731. Jump up ^ Baccala, Brent ( April 1997 ). `` Binary arithmetic ''. Connected : An Internet Encyclopedia ( 3rd ed. ). Archived from the original on 2016 - 08 - 06. Retrieved 2015 - 07 - 20. External links Computer Math Forum Apple Assembly Line, May 1981, Volume 1, Number 8 Units of information Base unit bit Platform - dependent units nibble byte syllable parcel word Platform - independent units unibit ( 1 ) dibit ( 2 ) tribit ( 3 ) quadbit ( 4 ) quartet ( 4 ) sextet ( 6 ) octet ( 8 ) hextet ( 16 ) declet ( 10 ) doublet ( 16 ) quadlet ( 32 ) octlet ( 64 ) hexlet ( 128 ) triad ( 3 ) tetrad ( 4 ) pentad ( 5 ) hexad ( 6 ) heptad ( 7 ) octad ( 8 ) slab ( 12 ) catena ( 24 ) Traditional bit units kilobit megabit gigabit terabit petabit exabit zettabit yottabit Traditional byte units kilobyte megabyte gigabyte terabyte petabyte exabyte zettabyte yottabyte IEC bit units kibibit mebibit gibibit tebibit pebibit exbibit zebibit yobibit IEC byte units kibibyte mebibyte gibibyte tebibyte pebibyte exbibyte zebibyte yobibyte Retrieved from `` https://en.wikipedia.org/w/index.php?title=Nibble&oldid=831375534 '' Categories : Computing terminology Data unit Units of information Hidden categories : CS1 German - language sources ( de ) CS1 French - language sources ( fr ) Articles needing additional references from April 2015 All articles needing additional references All articles with unsourced statements Articles with unsourced statements from March 2017 Talk Contents About Wikipedia Беларуская ( тарашкевіца ) ‎ Català Čeština Dansk Deutsch Eesti Ελληνικά Español فارسی Français 한국어 Interlingua Italiano ಕನ್ನಡ Latviešu Magyar Mirandés Nederlands 日本 語 Norsk ਪੰਜਾਬੀ Polski Português Русский Slovenčina Српски / srpski Svenska Українська 20 more Edit links This page was last edited on 20 March 2018, at 07 : 52. Text is available under the Creative Commons Attribution - ShareAlike License ; additional terms may apply. By using this site, you agree to the Terms of Use and Privacy Policy. Wikipedia ® is a registered trademark of the Wikimedia Foundation, Inc., a non-profit organization. About Wikipedia

Question: what is a group of 4 bits called
Answer: a nibble