Lecture

Information Representation: Binary Representations

Graph Chat

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Description

This lecture covers the representation of information in binary form, explaining how n bits can represent 2n distinct pieces of information. It delves into the efficiency of binary systems compared to unary systems, the use of bytes to compactly represent information, and the minimum alphabet size required to efficiently represent all integers. The lecture also explores the cognitive complexity of reading binary messages and the transition to more compact organizations like bytes. Additionally, it discusses the representation of integers, including positive and negative numbers, and decimal numbers, focusing on floating-point representation and controlled relative errors. The lecture concludes with an appendix on symbol representation, from alphabets to ideograms.

Official source

Related concepts (32)

Floating-point arithmetic

In computing, floating-point arithmetic (FP) is arithmetic that represents subsets of real numbers using an integer with a fixed precision, called the significand, scaled by an integer exponent of a fixed base. Numbers of this form are called floating-point numbers. For example, 12.345 is a floating-point number in base ten with five digits of precision: However, unlike 12.345, 12.3456 is not a floating-point number in base ten with five digits of precision—it needs six digits of precision; the nearest floating-point number with only five digits is 12.

Decimal floating point

Decimal floating-point (DFP) arithmetic refers to both a representation and operations on decimal floating-point numbers. Working directly with decimal (base-10) fractions can avoid the rounding errors that otherwise typically occur when converting between decimal fractions (common in human-entered data, such as measurements or financial information) and binary (base-2) fractions. The advantage of decimal floating-point representation over decimal fixed-point and integer representation is that it supports a much wider range of values.

Half-precision floating-point format

In computing, half precision (sometimes called FP16 or float16) is a binary floating-point computer number format that occupies 16 bits (two bytes in modern computers) in computer memory. It is intended for storage of floating-point values in applications where higher precision is not essential, in particular and neural networks. Almost all modern uses follow the IEEE 754-2008 standard, where the 16-bit base-2 format is referred to as binary16, and the exponent uses 5 bits.

Double-precision floating-point format

Double-precision floating-point format (sometimes called FP64 or float64) is a floating-point number format, usually occupying 64 bits in computer memory; it represents a wide dynamic range of numeric values by using a floating radix point. Floating point is used to represent fractional values, or when a wider range is needed than is provided by fixed point (of the same bit width), even if at the cost of precision. Double precision may be chosen when the range or precision of single precision would be insufficient.

Quadruple-precision floating-point format

In computing, quadruple precision (or quad precision) is a binary floating point–based computer number format that occupies 16 bytes (128 bits) with precision at least twice the 53-bit double precision. This 128-bit quadruple precision is designed not only for applications requiring results in higher than double precision, but also, as a primary function, to allow the computation of double precision results more reliably and accurately by minimising overflow and round-off errors in intermediate calculations and scratch variables.

Related lectures (34)

Number Systems: Fixed and Floating-Point Representations

Provides an overview of fixed-point and floating-point number representations in digital systems.

Nonlinear Equations: Representation of Real Numbers

Discusses the representation of real numbers in various bases and the implications of floating-point arithmetic.

Digital Systems: Fixed and Floating Point Arithmetic

Discusses fixed-point and floating-point arithmetic in digital systems, covering operations, representations, and the implications of rounding errors.

Binary Numbers: Representation and Complexity

Explores binary and decimal number representation complexity and conversion.

Computer Arithmetic: Floating Point Numbers