Numeral systems | Binary prefixes | Units of information

Binary prefix

A binary prefix is a unit prefix for multiples of units. It is most often used in data processing, data transmission, and digital information, principally in association with the bit and the byte, to indicate multiplication by a power of 2. As shown in the table to the right there are two sets of symbols for binary prefixes, one set established by International Electrotechnical Commission (IEC) and several other standards and trade organizations using two-letter symbols, e.g. Mi indicating 1048576 with a second set established by semiconductor industry convention using one-letter symbols, e.g., M also indicating 1048576. In most contexts, industry uses the multipliers kilo (k), mega (M), giga (G), etc., in a manner consistent with their meaning in the International System of Units (SI), namely as powers of 1000. For example, a 500-gigabyte hard disk holds 500000000000 bytes, and a 1 Gbit/s (gigabit per second) Ethernet connection transfers data at nominal speed of 1000000000 bit/s. In contrast with the binary prefix usage, this use is described as a decimal prefix, as 1000 is a power of 10 (103). The computer industry has historically in citations of main memory (RAM) capacity used the units kilobyte, megabyte, and gigabyte, and the corresponding symbols KB, MB, and GB, in a binary sense: gigabyte customarily means 1073741824 bytes. As this is a power of 1024, and 1024 is a power of two (210), this usage is referred to as a binary measurement. The use of the same unit prefixes with two different meanings has caused confusion. Starting around 1998, the IEC and several other standards and trade organizations attempted to address the ambiguity by publishing standards and recommendations for a set of binary prefixes that refer exclusively to powers of 1024. Accordingly, the US National Institute of Standards and Technology (NIST) requires that SI prefixes be used only in the decimal sense: kilobyte and megabyte denote one thousand bytes and one million bytes respectively (consistent with SI), while new terms such as kibibyte, mebibyte, and gibibyte, having the symbols KiB, MiB, and GiB, denote 1024 bytes, 1048576 bytes, and 1073741824 bytes, respectively. In 2008, the IEC prefixes were incorporated into the ISO/IEC 80000 standard alongside the decimal prefixes of the international standard system of units. In response to litigation over the use of metric prefixes, the United States District Court for the Northern District of California includes a judicial notice that "the U.S. Congress has deemed the decimal definition of gigabyte to be the 'preferred' one for the purposes of 'U.S. trade and commerce.'" (Wikipedia).

Binary prefix
Video thumbnail

1. Unsigned Binary Numbers - How to Convert From Unsigned Binary Numbers to Whole Numbers

This tutorial shows how to convert from an unsigned binary number to a whole number. Join this channel to get access to perks: https://www.youtube.com/channel/UCn2SbZWi4yTkmPUj5wnbfoA/join :)

From playlist Binary Numbers

Video thumbnail

How To Add and Subtract Binary Numbers

This video explains how to add and subtract binary numbers. The full version of this video contains extra examples of subtracting, multiplying, and dividing binary numbers. Full 43 Minute Video: https://www.youtube.com/watch?v=eAdWDu3s8xM

From playlist Number Systems

Video thumbnail

Numbers as bits (2 of 2)

How we represent numbers in computers. Part of a larger series teaching programming. Visit codeschool.org Twitter: @brianwill

From playlist Numbers as bits

Video thumbnail

Binary 2 - Two's Complement Representation of Negative Numbers

This is the second in a series of computer science videos about the binary number system which is fundamental to the operation of a digital electronic computer. It covers the two's complement system of representing positive and negative integers in binary. It demonstrates how two's comple

From playlist Binary

Video thumbnail

Binary 4 – Floating Point Binary Fractions 1

This is the fourth in a series of videos about the binary number system which is fundamental to the operation of a digital electronic computer. In particular, this video covers the representation of real numbers using floating point binary notation. It begins with a description of standard

From playlist Binary

Video thumbnail

Binary 3 – Fixed Point Binary Fractions

This is the third in a series of videos about the binary number system which is fundamental to the operation of a digital electronic computer. It covers the representation of real numbers in binary using a fixed size, fixed point, register. It explains with examples how to convert both po

From playlist Binary

Video thumbnail

Binary 1 - Converting to and from Denary

This is the first in a series of computer science videos about the binary number system which is fundamental to the operation of a digital electronic computer. It covers the need for binary and details of how to convert positive whole numbers in base 10 into 8 bit binary, and vice versa.

From playlist GCSE Computer Science

Video thumbnail

Binary 7 – Floating Point Binary Addition

This is the seventh in a series of videos about the binary number system which is fundamental to the operation of a digital electronic computer. In particular, this video covers adding together floating point binary numbers for a given sized mantissa and exponent, both in two’s complement.

From playlist Binary

Video thumbnail

Binary Numbers | Lecture 1 | Numerical Methods for Engineers

What are binary numbers? Why are some numbers inexact when represented on a computer? Join me on Coursera: https://www.coursera.org/learn/numerical-methods-engineers Lecture notes at http://www.math.ust.hk/~machas/numerical-methods-for-engineers.pdf Subscribe to my channel: http://www.y

From playlist Numerical Methods for Engineers

Video thumbnail

(IC 5.4) Why the interval needs to be completely contained

To ensure unique decodeability, it's necessary that the interval [a,b) contain the whole interval corresponding to the encoded binary sequence, rather than just containing the number corresponding to the binary sequence. A playlist of these videos is available at: http://www.youtube.com/

From playlist Information theory and Coding

Video thumbnail

Lec 2 | MIT 6.450 Principles of Digital Communications I, Fall 2006

Lecture 2: Discrete source encoding View the complete course at: http://ocw.mit.edu/6-450F06 Instructors: Prof. Lizhong Zheng, Prof. Robert Gallager License: Creative Commons BY-NC-SA More information at http://ocw.mit.edu/terms More courses at http://ocw.mit.edu

From playlist MIT 6.450 Principles of Digital Communications, I Fall 2006

Video thumbnail

(IC 2.10) Kraft-McMillan - examples for (b)

For a given set of lengths, the Kraft-McMillan inequality is a necessary condition for the existence of a uniquely decodable code, and a sufficient condition for the existence of a prefix code. A playlist of these videos is available at: http://www.youtube.com/playlist?list=PLE125425EC83

From playlist Information theory and Coding

Video thumbnail

(IC 2.11) Kraft-McMillan - proof sketch for (b)

For a given set of lengths, the Kraft-McMillan inequality is a necessary condition for the existence of a uniquely decodable code, and a sufficient condition for the existence of a prefix code. A playlist of these videos is available at: http://www.youtube.com/playlist?list=PLE125425EC83

From playlist Information theory and Coding

Video thumbnail

Fenwick Tree range queries

Related Videos: Fenwick tree range queries: https://www.youtube.com/watch?v=RgITNht_f4Q Fenwick tree point updates: https://www.youtube.com/watch?v=B-BkW9ZpKKM Fenwick tree construction: https://www.youtube.com/watch?v=BHPez138yX8 Fenwick tree source code: https://www.youtube.com/watch?v=e

From playlist Data structures playlist

Video thumbnail

Lecture 9c - Decision Trees

Lecture 9b - Decision Trees

From playlist Graph Theory

Video thumbnail

Prove that the Set of Binary Palindrome Strings Is Uncountable

We use two methods to prove that the set of binary palindrome strings is uncountable. Cantor's Diagonal Argument, and Proof through a surjective function to a known uncountable set. Diagonalization is a famous proof technique first by Cantor. See wiki here: Cantor's diagonal argument

From playlist All Things Recursive - with Math and CS Perspective

Video thumbnail

(IC 4.7) Optimality of Huffman codes (part 2) - weak siblings

We prove that Huffman codes are optimal. In part 2, we show that there exists an optimal prefix code with a pair of "weak siblings". A playlist of these videos is available at: http://www.youtube.com/playlist?list=PLE125425EC837021F

From playlist Information theory and Coding

Video thumbnail

Lecture 20

Chemistry 1B Professor Eric Potma Department of Chemistry University of California, Irvine

From playlist Chem 1P: Studio Version

Video thumbnail

Binary Tree 1. Constructing a tree (algorithm and pseudocode)

This is the first in a series of videos about binary trees. It is an explanation of the dynamic data structure known as the Binary Tree. It describes the way in which a binary tree is constructed, and how it can be represented numerically using a system of left and right pointers. This v

From playlist Data Structures

Video thumbnail

Covalent Bonding 3 - Naming Molecules, Acids, and Oxyacids

Craig Beals shares his set of "Rules" and "Flow Chart" for Naming Molecules (Binary Molecules), Naming Acids and Oxyacids in Chemistry. This is part 4 in a series of videos outlining the basic information needed to understand Chemical Bonding, Drawing Lewis Dot Structures, Naming Binary Mo

From playlist Chemistry Help

Related pages

Power of 10 | Binary number | Megabyte | Exponentiation | Octet (computing) | SI prefix | HP 3000 | Metric prefix | IEEE 1541-2002 | Kilobyte | Power of two | Hertz | Byte | Bit | Nibble | WinSCP | Billion | JEDEC memory standards