Khronos Data Format Specification License Information
Copyright (C) 20142019 The Khronos Group Inc. All Rights Reserved.
This specification is protected by copyright laws and contains material proprietary to the Khronos Group, Inc. It or any components may not be reproduced, republished, distributed, transmitted, displayed, broadcast, or otherwise exploited in any manner without the express prior written permission of Khronos Group. You may use this specification for implementing the functionality therein, without altering or removing any trademark, copyright or other notice from the specification, but the receipt or possession of this specification does not convey any rights to reproduce, disclose, or distribute its contents, or to manufacture, use, or sell anything that it may describe, in whole or in part.
This version of the Data Format Specification is published and copyrighted by Khronos, but is not a Khronos ratified specification. Accordingly, it does not fall within the scope of the Khronos IP policy, except to the extent that sections of it are normatively referenced in ratified Khronos specifications. Such references incorporate the referenced sections into the ratified specifications, and bring those sections into the scope of the policy for those specifications.
Khronos Group grants express permission to any current Promoter, Contributor or Adopter member of Khronos to copy and redistribute UNMODIFIED versions of this specification in any fashion, provided that NO CHARGE is made for the specification and the latest available update of the specification for any version of the API is used whenever possible. Such distributed specification may be reformatted AS LONG AS the contents of the specification are not changed in any way. The specification may be incorporated into a product that is sold as long as such product includes significant independent work developed by the seller. A link to the current version of this specification on the Khronos Group website should be included whenever possible with specification distributions.
Khronos Group makes no, and expressly disclaims any, representations or warranties, express or implied, regarding this specification, including, without limitation, any implied warranties of merchantability or fitness for a particular purpose or noninfringement of any intellectual property. Khronos Group makes no, and expressly disclaims any, warranties, express or implied, regarding the correctness, accuracy, completeness, timeliness, and reliability of the specification. Under no circumstances will the Khronos Group, or any of its Promoters, Contributors or Members or their respective partners, officers, directors, employees, agents, or representatives be liable for any damages, whether direct, indirect, special or consequential damages for lost revenues, lost profits, or otherwise, arising from or in connection with these materials.
Khronos, SYCL, SPIR, WebGL, EGL, COLLADA, StreamInput, OpenVX, OpenKCam, glTF, OpenKODE, OpenVG, OpenWF, OpenSL ES, OpenMAX, OpenMAX AL, OpenMAX IL and OpenMAX DL are trademarks and WebCL is a certification mark of the Khronos Group Inc. OpenCL is a trademark of Apple Inc. and OpenGL and OpenML are registered trademarks and the OpenGL ES and OpenGL SC logos are trademarks of Silicon Graphics International used under license by Khronos. All other product names, trademarks, and/or company names are used solely for identification and belong to their respective owners.
Revision History  

Revision 0.1  Jan 2015  AG 
Initial sharing  
Revision 0.2  Feb 2015  AG 
Added clarification, tables, examples  
Revision 0.3  Feb 2015  AG 
Further cleanup  
Revision 0.4  Apr 2015  AG 
Channel ordering standardized  
Revision 0.5  Apr 2015  AG 
Typos and clarification  
Revision 1.0  May 2015  AG 
Submission for 1.0 release  
Revision 1.0 rev 2  Jun 2015  AG 
Clarifications for 1.0 release  
Revision 1.0 rev 3  Jul 2015  AG 
Added KHR_DF_SAMPLE_DATATYPE_LINEAR  
Revision 1.0 rev 4  Jul 2015  AG 
Clarified KHR_DF_SAMPLE_DATATYPE_LINEAR  
Revision 1.0 rev 5  Mar 2019  AG 
Clarification and typography  
Revision 1.1  Nov 2015  AG 
Added definitions of compressed texture formats  
Revision 1.1 rev 2  Jan 2016  AG 
Added definitions of floating point formats  
Revision 1.1 rev 3  Feb 2016  AG 
Fixed typo in sRGB conversion (thank you, Tom Grim!)  
Revision 1.1 rev 4  Mar 2016  AG 
Fixed typo/clarified sRGB in ASTC, typographical improvements  
Revision 1.1 rev 5  Mar 2016  AG 
Switch to official Khronos logo, removed scripts, restored title  
Revision 1.1 rev 6  Jun 2016  AG 
ASTC "block footprint" note, fixed credits/changelog/contents  
Revision 1.1 rev 7  Sep 2016  AG 
ASTC multipoint "part" and quint decode typo fixes  
Revision 1.1 rev 8  Jun 2017  AG 
ETC2 legibility and table typo fix  
Revision 1.1 rev 9  Mar 2019  AG 
Typo fixes and much reformatting  
Revision 1.2 rev 0  Sep 2017  AG 
Added color conversion formulae and extra options  
Revision 1.2 rev 1  Mar 2019  AG 
Typo fixes and much reformatting 
Table of Contents
Abstract
This document describes a data format specification for nonopaque (uservisible) representations of user data to be used by, and shared between, Khronos standards. The intent of this specification is to avoid replication of incompatible format descriptions between standards and to provide a definitive mechanism for describing data that avoids excluding useful information that may be ignored by other standards. Other APIs are expected to map internal formats to this standard scheme, allowing formats to be shared and compared. This document also acts as a reference for the memory layout of a number of common compressed texture formats, and describes conversion between a number of common color spaces.
Many APIs operate on bulk data — buffers, images, volumes, etc. — each composed of many elements with a fixed and often simple representation. Frequently, multiple alternative representations of data are supported: vertices can be represented with different numbers of dimensions, textures may have different bit depths and channel orders, and so on. Sometimes the representation of the data is highly specific to the application, but there are many types of data that are common to multiple APIs — and these can reasonably be described in a portable manner. In this standard, the term data format describes the representation of data.
It is typical for each API to define its own enumeration of the data formats on which it can operate. This causes a problem when multiple APIs are in use: the representations are likely to be incompatible, even where the capabilities intersect. When additional formatspecific capabilities are added to an API which was designed without them, the description of the data representation often becomes inconsistent and disjoint. Concepts that are unimportant to the core design of an API may be represented simplistically or inaccurately, which can be a problem as the API is enhanced or when data is shared.
Some APIs do not have a strict definition of how to interpret their data. For example, a rendering API may treat all color channels of a texture identically, leaving the interpretation of each channel to the user’s choice of convention. This may be true even if color channels are given names that are associated with actual colors — in some APIs, nothing stops the user from storing the blue quantity in the red channel and the red quantity in the blue channel. Without enforcing a single data interpretation on such APIs, it is nonetheless often useful to offer a clear definition of the color interpretation convention that is in force, both for code maintenance and for communication with external APIs which do have a defined interpretation. Should the user wish to use an unconventional interpretation of the data, an appropriate descriptor can be defined that is specific to this choice, in order to simplify automated interpretation of the chosen representation and to provide concise documentation.
Where multiple APIs are in use, relying on an APIspecific representation as an intermediary can cause loss of important information. For example, a camera API may associate color space information with a captured image, and a printer API may be able to operate with that color space, but if the data is passed through an intermediate compute API for processing and that API has no concept of a color space, the useful information may be discarded.
The intent of this standard is to provide a common, consistent, machinereadable way to describe those data formats which are amenable to nonproprietary representation. This standard provides a portable means of storing the most common descriptive information associated with data formats, and an extension mechanism that can be used when this common functionality must be supplemented.
While this standard is intended to support the description of many kinds of data, the most common class of bulk data used in Khronos standards represents color information. For this reason, the range of standard color representations used in Khronos standards is diverse, and a significant portion of this specification is devoted to color formats.
Later sections provide a description of the memory layout of a number of common texture compression formats, and describe some of the common color space conversions.
This document describes a standard layout for a data structure that can be used to define the representation of simple, portable, bulk data. Using such a data structure has the following benefits:
The “bulk data” may be, for example:
The layout of proprietary data structures is beyond the remit of this specification, but the large number of ways to describe colors, vertices and other repeated data makes standardization useful.
The data structure in this specification describes the elements in the bulk data in memory, not the layout of the whole. For example, it may describe the size, location and interpretation of color channels within a pixel, but is not responsible for determining the mapping between spatial coordinates and the location of pixels in memory. That is, two textures which share the same pixel layout can share the same descriptor as defined in this specification, but may have different sizes, line strides, tiling or dimensionality. An example pixel format is described in Figure 1: a single 5:6:5bit pixel with blue in the low 5 bits, green in the next 6 bits, and red in the top 5 bits of a 16bit word as laid out in memory on a littleendian machine (see Table 28).
In some cases, the elements of bulk texture data may not correspond to a conventional texel. For example, in a compressed texture it is common for the atomic element of the buffer to represent a rectangular block of texels. Alternatively the representation of the output of a camera may have a repeating pattern according to a Bayer or other layout, as shown in Figure 2. It is this repeating and selfcontained atomic unit, termed a texel block, that is described by this standard.
The sampling or reconstruction of texel data is not a function of the data format. That is, a texture has the same format whether it is point sampled or a bicubic filter is used, and the manner of reconstructing full color data from a camera sensor is not defined. Where information making up the data format has a spatial aspect, this is part of the descriptor: it is part of the descriptor to define the spatial configuration of color samples in a Bayer sensor or whether the chroma difference channels in a Y′C_{B}C_{R} format are considered to be centered or cosited, but not how this information must be used to generate coordinatealigned full color values.
The data structure defined in this specification is termed a data format descriptor. This is an extensible block of contiguous memory, with a defined layout. The size of the data format descriptor depends on its content, but is also stored in a field at the start of the descriptor, making it possible to copy the data structure without needing to interpret all possible contents.
The data format descriptor is divided into one or more descriptor blocks, each also consisting of contiguous data, as shown in Table 1. These descriptor blocks may, themselves, be of different sizes, depending on the data contained within. The size of a descriptor block is stored as part of its data structure, allowing applications to process a data format descriptor while skipping contained descriptor blocks that it does not need to understand. The data format descriptor mechanism is extensible by the addition of new descriptor blocks.
Table 1. Data format descriptor and descriptor blocks
Data format descriptor

The diversity of possible data makes a concise description that can support every possible format impractical. This document describes one type of descriptor block, a basic descriptor block, that is expected to be the first descriptor block inside the data format descriptor where present, and which is sufficient for a large number of common formats, particularly for pixels. Formats which cannot be described within this scheme can use additional descriptor blocks of other types as necessary.
Later sections of this specification provide a description of the inmemory representation of a number of common compressed texture formats, and describe several common color spaces.
Data format: The interpretation of individual elements in bulk data. Examples include the channel ordering and bit positions in pixel data or the configuration of samples in a Bayer image. The format describes the elements, not the bulk data itself: an image’s size, stride, tiling, dimensionality, border control modes, and image reconstruction filter are not part of the format and are the responsibility of the application.
Data format descriptor: A contiguous block of memory containing information about how data is represented, in accordance with this specification. A data format descriptor is a container, within which can be found one or more descriptor blocks. This specification does not define where or how the the data format descriptor should be stored, only its content. For example, the descriptor may be directly prepended to the bulk data, perhaps as part of a file format header, or the descriptor may be stored in a CPU memory while the bulk data that it describes resides within GPU memory; this choice is applicationspecific.
(Data format) descriptor block: A contiguous block of memory with a defined layout, held within a data format descriptor. Each descriptor block has a common header that allows applications to identify and skip descriptor blocks that it does not understand, while continuing to process any other descriptor blocks that may be held in the data format descriptor.
Basic (data format) descriptor block: The initial form of descriptor block as described in this standard. Where present, it must be the first descriptor block held in the data format descriptor. This descriptor block can describe a large number of common formats and may be the only type of descriptor block that many portable applications will need to support.
Texel block: The units described by the Basic Data Format Descriptor: a repeating element within bulk data. In simple texture formats, a texel block may describe a single pixel. In formats with subsampled channels, the texel block may describe several pixels. In a blockbased compressed texture, the texel block typically describes the compression block unit. The basic descriptor block supports texel blocks of up to four dimensions.
Sample: In this standard, texel blocks are considered to be composed of contiguous bit patterns with a single channel or component type and a single spatial location. A typical ARGB pixel has four samples, one for each channel, held at the same coordinate. A texel block from a Bayer sensor might have a different location for different channels, and may have multiple samples representing the same channel at multiple locations. A Y′C_{B}C_{R} buffer with downsampled chroma may have more luma samples than chroma, each at different locations.
Plane: In some formats, a texel block is not contiguous in memory. In a twodimensional texture, the texel block may be spread across multiple scan lines, or channels may be stored independently. The basic format descriptor block defines a texel block as being made of a number of concatenated bits which may come from different regions of memory, where each region is considered a separate plane. For common formats, it is sufficient to require that the contribution from each plane is an integer number of bytes. This specification places no requirements on the ordering of planes in memory — the plane locations are described outside the format. This allows support for multiplanar formats which have proprietary padding requirements that are hard to accommodate in a more terse representation.
In many existing APIs, planes may be “downsampled” differently. For example, in these APIs, a Y′C_{B}C_{R} (colloquially YUV) 4:2:0 buffer as in Table 2 (with byte offsets shown for each channel/location) would typically be represented with three planes (Table 3), one for each channel, with the luma (Y′) plane containing four times as many pixels as the chroma (C_{B} and C_{R}) planes, and with two horizontal lines of the luma held within the same plane for each horizontal line of the chroma planes.
Table 2. Possible memory representation of a 4×4 Y′C_{B}C_{R} 4:2:0 buffer
Y′ channel  
 
C_{B} channel  
 
C_{R} channel  

Table 3. Plane descriptors for the above Y′C_{B}C_{R}format buffer in a conventional API
Y′ plane  offset 0  byte stride 4  downsample 1×1 
C_{B} plane  offset 16  byte stride 2  downsample 2×2 
C_{R} plane  offset 20  byte stride 2  downsample 2×2 
This approach does not extend logically to more complex formats such as a Bayer grid. Therefore in this specification, we would instead define the luma channel as in Table 4, using two planes, vertically interleaved (in a linear mapping between addresses and samples) by the selection of a suitable offset and line stride, with each line of luma samples contiguous in memory. Only one plane is used for each of the chroma channels (or one plane collectively if the chroma samples are stored adjacently).
Table 4. Plane descriptors for the above Y′C_{B}C_{R}format buffer using this standard
Y′ plane 1  offset 0  byte stride 8  plane bytes 2 
Y′ plane 2  offset 4  byte stride 8  plane bytes 2 
C_{B} plane  offset 16  byte stride 2  plane bytes 1 
C_{R} plane  offset 20  byte stride 2  plane bytes 1 
The same approach can be used to represent a static interlaced image, with a texel block consisting of two planes, one per field. This mechanism is all that is required to represent a static image without downsampled channels; however correct reconstruction of interlaced, downsampled color difference formats (such as Y′C_{B}C_{R}), which typically involves interpolation of the nearest chroma samples in a given field rather than the whole frame, is beyond the remit of this specification. There are many proprietary and often heuristic approaches to sample reconstruction, particularly for Bayerlike formats and for multiframe images, and it is not practical to document them here.
There is no expectation that the internal format used by an API that wishes to make use of the Khronos Data Format Specification must use this specification’s representation internally: reconstructing downsampling information from this standard’s representation in order to revert to the more conventional representation should be trivial if required.
There is no requirement that the number of bytes occupied by the texel block be the same in each plane. The descriptor defines the number of bytes that the texel block occupies in each plane, which for most formats is sufficient to allow access to consecutive elements. For a twodimensional data structure, it is up to the controlling interface to resolve byte stride between consecutive lines. For a threedimensional structure, the controlling API may need to add a level stride. Since these strides are determined by the data size and architecture alignment requirements, they are not considered to be part of the format.
This specification encodes how atomic data should be interpreted in a manner which is independent of the layout and dimensionality of the collective data. Collections of data may have a “compatible format” in that their format descriptor may be identical, yet be different sizes. Some additional information is therefore expected to be recorded alongside the “format description”.
The API which controls the bulk data is responsible for controlling which memory location corresponds to the indexing mechanism chosen. A texel block has the concept of a coordinate offset within the block, which implies that if the data is accessed in terms of spatial coordinates, a texel block has spatial locality as well as referring to contiguous memory (per plane). For texel blocks which represent only a single spatial location, this is irrelevant; for blockbased compression, for formats with downsampled channels, or for Bayerlike formats, the texel block represents a finite extent in up to four dimensions. However, the mapping from coordinate system to the memory location containing a texel block is beyond the control of this API.
The minimum requirements for accessing a linearlyaddressed buffer is to store the start address and a stride (typically in bytes) between texels in each dimension of the buffer, for each plane contributing to the texel block. For the first dimension, the memory stride between texels may simply be the byte size of texel block in that plane — this implies that there are no gaps between texel blocks. For other dimensions, the stride is a function of the size of the data structure being represented — for example, in a compact representation of a twodimensional buffer, the texel block at coordinate (x,y+1) might be found at the address of coordinate (x,y) plus the buffer width multiplied by the texel size in bytes. Similarly in a threedimensional buffer, the address of the pixel at (x,y,z+1) may be at the address of (x,y,z) plus the byte size of a twodimensional slice of the texture. In practice, even linear layouts may have padding, and often more complex relationships between coordinates and memory location are used to encourage locality of reference. The details of all of these data structures are beyond the remit of this specification.
Most simple formats contain a single plane of data. Those formats which require additional planes compared with a conventional representation are typically downsampled Y′C_{B}C_{R} formats, which already have the concept of separate storage for different color channels. While this specification uses multiple planes to describe texel blocks that span multiple scan lines if the data is disjoint, there is no expectation that the API using the data formats needs to maintain this representation — interleaved planes should be easy to identify and coalesce if the API requires a more conventional representation of downsampled formats.
Some image representations are composed of tiles of texels which are held contiguously in memory, with the texels within the tile stored in some order that improves locality of reference for multidimensional access. This is a common approach to improve memory efficiency when texturing. While it is possible to represent such a tile as a large texel block (up to the maximum representable texel block size in this specification), this is unlikely to be an efficient approach, since a large number of samples will be needed and the layout of a tile usually has a very limited number of possibilities. In most cases, the layout of texels within the tile should be described by whatever interface is aware of imagespecific information such as size and stride, and only the format of the texels should be described by a format descriptor.
The complication to this is where texel blocks larger than a single pixel are themselves encoded using proprietary tiling. The spatial layout of samples within a texel block is required to be fixed in the basic format descriptor — for example, if the texel block size is 2×2 pixels, the top left pixel might always be expected to be in the first byte in that texel block. In some proprietary memory tiling formats, such as ones that store small rectangular blocks in raster order in consecutive bytes or in Morton order, this relationship may be preserved, and the only proprietary operation is finding the start of the texel block. In other proprietary layouts such as Hilbert curve order, or when the texel block size does not divide the tiling size, a direct representation of memory may be impossible. In these cases, it is likely that this data format standard would be used to describe the data as it would be seen in a linear format, and the mapping from coordinates to memory would have to be hidden in proprietary translation. As a logical format description, this is unlikely to be critical, since any software which accesses such a layout will necessarily need proprietary knowledge anyway.
The data format container described here is too unwieldy to be expected to be used directly in most APIs. The expectation is that APIs and users will define data descriptors in memory, but have APIspecific names for the formats that the API supports. If these names are enumeration values, a mapping can be provided by having an array of pointers to the data descriptors, indexed by the enumeration. It may commonly be necessary to provide APIspecific supplementary information in the same array structure, particularly where the API natively associates concepts with the data which is not uniquely associated with the content.
In this approach, it is likely that an API would predefine a number of common data formats which are natively supported. If there is a desire to support dynamic creation of data formats, this array could be made extensible with a manager returning handles.
Even where an API supports only a fixed set of formats, it is flexible to provide a comparison with userprovided format descriptors in order to establish whether a format is compatible.
The layout of the data structures described here are assumed to be littleendian for the purposes of data transfer, but may be implemented in the natural endianness of the platform for internal use.
The data format descriptor consists of a contiguous area of memory, as shown in Table 5, divided into one or more descriptor blocks, which are tagged by the type of descriptor that they contain. The size of the data format descriptor varies according to its content.
Table 5. Data Format Descriptor layout
 totalSize 
Descriptor block  First descriptor 
Descriptor block  Second descriptor (optional) etc. 
The totalSize field, measured in bytes, allows the full format descriptor
to be copied without need for details of the descriptor to be interpreted.
totalSize includes its own uint32_t
, not just the following
descriptor blocks.
For example, we will see below that a foursample Khronos Basic
Data Format Descriptor Block occupies 88 bytes; if there are no
other descriptor blocks in the data format descriptor, the totalSize
field would then indicate 88 + 4 bytes (for the totalSize field
itself) for a final value of 92.
Each Descriptor Block has the same prefix, shown in Table 6.
Table 6. Descriptor Block layout
 vendorId  (descriptorType << 16) 
 versionNumber  (descriptorBlockSize << 16) 
Formatspecific data 
The vendorId is a 16bit value uniquely assigned to organisations, allocated by Khronos; ID 0 is used to identify Khronos itself. The ID 0xFFFF is reserved for internal use which is guaranteed not to clash with thirdparty implementations; this ID should not be shipped in libraries to avoid conflicts with development code.
The descriptorType is a unique identifier defined by the vendor to distinguish between potential data representations.
The versionNumber is vendordefined, and is intended to allow for backwardscompatible updates to existing descriptor blocks.
The descriptorBlockSize indicates the size in bytes of this Descriptor Block, remembering that there may be multiple Descriptor Blocks within one container, as shown in Table 7. The descriptorBlockSize therefore gives the offset between the start of the current Descriptor Block and the start of the next — so the size includes the vendorId, descriptorType, versionNumber and descriptorBlockSize fields, which collectively contribute 8 bytes.
Having an explicit descriptorBlockSize allows implementations to skip a descriptor block whose format is unknown, allowing known data to be interpreted and unknown information to be ignored. Some descriptor block types may not be of a uniform size, and may vary according to the content within.
This specification initially describes only one type of descriptor block. Future revisions may define additional descriptor block types for additional applications — for example, to describe data with a large number of channels or pixels described in an arbitrary color space. Vendors can also implement proprietary descriptor blocks to hold vendorspecific information within the standard Descriptor.
Table 7. Data format descriptor header and descriptor block headers
totalSize  
 

One basic descriptor block, shown in Table 8 is intended to cover a large amount of metadata that is typically associated with common bulk data — most notably image or texture data. While this descriptor contains more information about the data interpretation than is needed by many applications, having a relatively comprehensive descriptor reduces the risk that metadata needed by different APIs will be lost in translation.
The format is described in terms of a repeating axisaligned texel block composed of samples. Each sample contains a single channel of information with a single spatial offset within the texel block, and consists of an amount of contiguous data. This descriptor block consists of information about the interpretation of the texel block as a whole, supplemented by a description of a number of samples taken from one or more planes of contiguous memory. For example, a 24bit red/green/blue format may be described as a 1×1 pixel region, containing three samples, one of each color, in one plane. A Y′C_{B}C_{R} 4:2:0 format may consist of a repeating 2×2 region consisting of four Y′ samples and one sample each of C_{B} and C_{R}.
Table 8. Basic Data Format Descriptor layout
Byte 0 (LSB)  Byte 1  Byte 2  Byte 3 (MSB) 

0 (vendorId)  0 (descriptorType)  
1 (versionNumber)  24 + 16 × #samples (descriptorBlockSize)  
colorModel  colorPrimaries  transferFunction  flags 
texelBlockDimension0  texelBlockDimension1  texelBlockDimension2  texelBlockDimension3 
bytesPlane0  bytesPlane1  bytesPlane2  bytesPlane3 
bytesPlane4  bytesPlane5  bytesPlane6  bytesPlane7 
Sample information for the first sample  
Sample information for the second sample (optional), etc. 
The fields of the Basic Data Format Descriptor Block are described in the following sections.
The vendorId for the Basic Data Format Descriptor Block is 0,
defined as KHR_DF_VENDORID_KHRONOS
in the enum khr_df_vendorid_e
.
The descriptorType for the Basic Data Format Descriptor Block is 0,
a value reserved in the enum of Khronosspecific descriptor types,
khr_df_khr_descriptortype_e
, as KHR_DF_KHR_DESCRIPTORTYPE_BASICFORMAT
.
The versionNumber relating to the Basic Data Format Descriptor Block as described in this specification is 1.
The size of the Basic Data Format Descriptor Block depends on the number of samples contained within it. The memory requirements for this format are 24 bytes of shared data plus 16 bytes per sample. The descriptorBlockSize is measured in bytes.
The colorModel determines the set of color (or other data) channels which may be encoded within the data, though there is no requirement that all of the possible channels from the colorModel be present. Most data fits into a small number of common color models, but compressed texture formats each have their own color model enumeration. Note that the data need not actually represent a color — this is just the most common type of content using this descriptor. Some standards use color container for this concept.
The available color models are described in the khr_df_model_e
enumeration,
and are represented as an unsigned 8bit value.
Note that the numbering of the component channels is chosen such that those channel types which are common across multiple color models have the same enumeration value. That is, alpha is always encoded as channel ID 15, depth is always encoded as channel ID 14, and stencil is always encoded as channel ID 13. Luma/Luminance is always in channel ID 0. This numbering convention is intended to simplify code which can process a range of color models. Note that there is no guarantee that models which do not support these channels will not use this channel ID. Particularly, RGB formats do not have luma in channel 0, and a 16channel undefined format is not obligated to represent alpha in any way in channel number 15.
The value of each enumerant is shown in parentheses following the enumerant name.
When the data format is unknown or does not fall into a predefined category, utilities which perform automatic conversion based on an interpretation of the data cannot operate on it. This format should be used when there is no expectation of portable interpretation of the data using only the basic descriptor block.
For portability reasons, it is recommended that pixellike formats
with up to sixteen channels, but which cannot have those channels
described in the basic block, be represented with a basic descriptor
block with the appropriate number of samples from UNSPECIFIED
channels,
and then for the channel description to be stored in an extension block.
This allows software which understands only the basic descriptor to
be able to perform operations that depend only on channel location,
not channel interpretation (such as image cropping). For example, a
camera may store a raw format taken with a modified Bayer sensor,
with RGBW (red, green, blue and white) sensor sites, or RGBE
(red, green, blue and “emerald”). Rather than trying to encode the
exact color coordinates of each sample in the basic descriptor,
these formats could be represented by a fourchannel UNSPECIFIED
model, with an extension block describing the interpretation of
each channel.
This color model represents additive colors of three channels, nominally red, green and blue, supplemented by channels for alpha, depth and stencil, as shown in Table 9. Note that in many formats, depth and stencil are stored in a completely independent buffer, but there are formats for which integrating depth and stencil with color data makes sense.
Table 9. Basic Data Format RGBSDA channels
Channel number  Name  Description  

0   Red  
1   Green  
2   Blue  
13   Stencil  
14   Depth  
15   Alpha (opacity) 
Portable representation of additive colors with more than three primaries requires an extension to describe the full color space of the channels present. There is no practical way to do this portably without taking significantly more space.
This color model represents color differences with three channels, nominally luma (Y′) and two colordifference chroma channels, U (C_{B}) and V (C_{R}), supplemented by channels for alpha, depth and stencil, as shown in Table 10. These formats are distinguished by C_{B} and C_{R} being a delta between the Y′ channel and the blue and red channels respectively, rather than requiring a full color matrix. The conversion between Y′C_{B}C_{R} and RGB color spaces is defined in this case by the choice of value in the colorPrimaries field as described in Section 15.1.
Most singlechannel luma/luminance monochrome data formats should
select 
Table 10. Basic Data Format YUVSDA channels
Channel number  Name  Description  

0   Y/Y′ (luma/luminance)  
1   C_{B} (alias for U)  
1   U (alias for C_{B})  
2   C_{R} (alias for V)  
2   V (alias for C_{R})  
13   Stencil  
14   Depth  
15   Alpha (opacity) 
Terminology for this color model is often abused. This model is based on the idea of creating a representation of monochrome light intensity as a weighted average of color channels, then calculating color differences by subtracting two of the color channels from this monochrome value. Proper names vary for each variant of the ensuing numbers, but YUV is colloquially used for all of them. In the television standards from which this terminology is derived, Y′C_{B}C_{R} is more formally used to describe the representation of these color differences. See Section 15.1 for more detail. 
This color model represents color differences with three channels, nominally luma (Y) and two colordifference chroma channels, I and Q, supplemented by channels for alpha, depth and stencil, as shown in Table 11. This format is distinguished by I and Q each requiring all three additive channels to evaluate. I and Q are derived from C_{B} and C_{R} by a 33degree rotation.
Table 11. Basic Data Format YIQSDA channels
Channel number  Name  Description  

0   Y (luma)  
1   I (inphase)  
2   Q (quadrature)  
13   Stencil  
14   Depth  
15   Alpha (opacity) 
This color model represents the ICC perceptuallyuniform L*a*b* color space, combined with the option of an alpha channel, as shown in Table 12.
Table 12. Basic Data Format LABSDA channels
Channel number  Name  Description  

0   L* (luma)  
1   a*  
2   b*  
13   Stencil  
14   Depth  
15   Alpha (opacity) 
This color model represents secondary (subtractive) colors and the combined key (black) channel, along with alpha, as shown in Table 13.
Table 13. Basic Data Format CMYKA channels
Channel number  Name  Description  

0   Cyan  
1   Magenta  
2   Yellow  
3   Key/Black  
15   Alpha (opacity) 
This “color model” represents channel data used for coordinate values, as shown in Table 14 — for example, as a representation of the surface normal in a bump map. Additional channels for higherdimensional coordinates can be used by extending the channel number within the 4bit limit of the channelType field.
Table 14. Basic Data Format XYZW channels
Channel number  Name  Description  

0   X  
1   Y  
2   Z  
3   W 
This color model represents color differences with three channels, value (luminance or luma), saturation (distance from monochrome) and hue (dominant wavelength), supplemented by an alpha channel, as shown in Table 15. In this model, the hue relates to the angular offset on a color wheel.
Table 15. Basic Data Format angular HSVA channels
Channel number  Name  Description  

0   V (value)  
1   S (saturation)  
2   H (hue)  
15   Alpha (opacity) 
This color model represents color differences with three channels, lightness (maximum intensity), saturation (distance from monochrome) and hue (dominant wavelength), supplemented by an alpha channel, as shown in Table 16. In this model, the hue relates to the angular offset on a color wheel.
Table 16. Basic Data Format angular HSLA channels
Channel number  Name  Description  

0   L (lightness)  
1   S (saturation)  
2   H (hue)  
15   Alpha (opacity) 
This color model represents color differences with three channels, value (luminance or luma), saturation (distance from monochrome) and hue (dominant wavelength), supplemented by an alpha channel, as shown in Table 17. In this model, the hue is generated by interpolation between extremes on a color hexagon.
Table 17. Basic Data Format hexagonal HSVA channels
Channel number  Name  Description  

0   V (value)  
1   S (saturation)  
2   H (hue)  
15   Alpha (opacity) 
This color model represents color differences with three channels, lightness (maximum intensity), saturation (distance from monochrome) and hue (dominant wavelength), supplemented by an alpha channel, as shown in Table 18. In this model, the hue is generated by interpolation between extremes on a color hexagon.
Table 18. Basic Data Format hexagonal HSLA channels
Channel number  Name  Description  

0   L (lightness)  
1   S (saturation)  
2   H (hue)  
15   Alpha (opacity) 
This color model represents lowcost approximate color differences with three channels, nominally luma (Y) and two colordifference chroma channels, Cg (green/purple color difference) and Co (orange/cyan color difference), supplemented by a channel for alpha, as shown in Table 19.
Table 19. Basic Data Format YCoCgA channels
Channel number  Name  Description  

0   Y  
1   Cg  
2   Co  
15   Alpha (opacity) 
This color model represents the “Constant luminance” $Y'_CC'_\mathit{BC}C'_\mathit{RC}$ color model defined as an optional representation in ITUT BT.2020 and described in Section 15.2.
Table 20. Basic Data Format Y′_{C}C′_{BC}C′_{RC} channels
Channel number  Name  Description  

0   $Y'_C$ (luminance)  
1   $C'_\mathit{BC}$  
2   $C'_\mathit{RC}$  
13   Stencil  
14   Depth  
15   Alpha (opacity) 
This color model represents the “Constant intensity IC_{T}C_{P} color model” defined as an optional representation in ITUT BT.2100 and described in Section 15.3.
Table 21. Basic Data Format IC_{T}C_{P} channels
Channel number  Name  Description  

0   I (intensity)  
1   C_{T}  
2   C_{P}  
13   Stencil  
14   Depth  
15   Alpha (opacity) 
This color model represents channel data used to describe color coordinates in the CIE 1931 XYZ coordinate space, as shown in Table 22.
Table 22. Basic Data Format CIE XYZ channels
Channel number  Name  Description  

0   X  
1   Y  
2   Z 
This color model represents channel data used to describe chromaticity coordinates in the CIE 1931 xyY coordinate space, as shown in Table 23.
Table 23. Basic Data Format CIE xyY channels
Channel number  Name  Description  

0   x  
1   y  
2   Y 
A number of compressed formats are supported as part of khr_df_model_e
.
In general, these formats will have the texel block dimensions of the
compression block size. Most contain a single sample of channel type 0
at offset 0,0 — where further samples are required, they should also
be sited at 0,0. By convention, models which have multiple channels that
are disjoint in memory have these channel locations described accurately.
The ASTC family of formats have a number of possible channels, and are distinguished by samples which reference some set of these channels. The texelBlockDimension fields determine the compression ratio for ASTC.
Floatingpoint compressed formats have lower and upper limits specified
in floating point format. Integer compressed formats with a lower and
upper of 0 and UINT32_MAX
(for unsigned formats) or INT32_MIN
and INT32_MAX
(for signed formats) are assumed to map the full
representable range to 0..1 or 1..1 respectively.
This model represents the DXT1 or BC1 format. Channel 0 indicates color. If a second sample is present it should use channel 1 to indicate that the “special value” of the format should represent transparency — otherwise the “special value” represents opaque black.
This model represents the DXT2/3 format, also described as BC2. The alpha premultiplication state (the distinction between DXT2 and DXT3) is recorded separately in the descriptor. This model has two channels: ID 0 contains the color information and ID 15 contains the alpha information. The alpha channel is 64 bits and at offset 0; the color channel is 64 bits and at offset 64. No attempt is made to describe the 16 alpha samples for this position independently, since understanding the other channels for any pixel requires the whole texel block.
This model represents the DXT4/5 format, also described as BC3. The alpha premultiplication state (the distinction between DXT4 and DXT5) is recorded separately in the descriptor. This model has two channels: ID 0 contains the color information and ID 15 contains the alpha information. The alpha channel is 64 bits and at offset 0; the color channel is 64 bits and at offset 64.
This model represents the Direct3D BC4 format for singlechannel interpolated 8bit data. The model has a single channel of id 0 with offset 0 and length 64 bits.
This model represents the Direct3D BC5 format for dualchannel interpolated 8bit data. The model has two channels, 0 (red) and 1 (green), which should have their bit depths and offsets independently described: the red channel has offset 0 and length 64 bits and the green channel has offset 64 and length 64 bits.
This model represents the Direct3D BC6H format for RGB floatingpoint data. The model has a single channel 0, representing all three channels, and occupying 128 bits.
This model represents the Direct3D BC7 format for RGBA data. This model has a single channel 0 of 128 bits.
This model represents the original Ericsson Texture Compression format, with a guarantee that the format does not rely on ETC2 extensions. It contains a single channel of RGB data.
This model represents the updated Ericsson Texture Compression format, ETC2, and also the related R11 EAC and RG11 EAC formats. Channel ID 0 represents red, and is used for the R11 EAC format. Channel ID 1 represents green, and both red and green should be present for the RG11 EAC format. Channel ID 2 represents RGB combined content, for ETC2. Channel 15 indicates the presence of alpha. If the texel block size is 8 bytes and the RGB and alpha channels are cosited, “punch through” alpha is supported. If the texel block size is 16 bytes and the alpha channel appears in the first 8 bytes, followed by 8 bytes for the RGB channel, 8bit separate alpha is supported.
This model represents Adaptive Scalable Texture Compression as a single
channel in a texel block of 16 bytes. ASTC HDR (high dynamic range) and
LDR (low dynamic range) modes are distinguished by the channelId containing
the flag KHR_DF_SAMPLE_DATATYPE_FLOAT
: an ASTC texture that is guaranteed by
the user to contain only LDRencoded blocks should have the channelId
KHR_DF_SAMPLE_DATATYPE_FLOAT
bit clear, and an ASTC texture that may include
HDRencoded blocks should have the channelId KHR_DF_SAMPLE_DATATYPE_FLOAT
bit set to 1. ASTC supports a number of compression ratios defined by different
texel block sizes; these are selected by changing the texel block size fields
in the data format. The single sample has a size of 128 bits.
ASTC encoding is described in Section 23.
It is not sufficient to define a buffer as containing, for example,
additive primaries. Additional information is required to define
what “red” is provided by the “red” channel. A full definition of
primaries requires an extension which provides the full color space
of the data, but a subset of common primary spaces can be identified
by the khr_df_primaries_e
enumeration, represented as an unsigned 8bit
integer value.
More information about color primaries is provided in Section 14.
This “set of primaries” identifies a data representation whose color representation is unknown or which does not fit into this list of common primaries. Having an “unspecified” value here precludes users of this data format from being able to perform automatic color conversion unless the primaries are defined in another way. Formats which require a proprietary color space — for example, raw data from a Bayer sensor that records the direct response of each filtered sample — can still indicate that samples represent “red”, “green” and “blue”, but should mark the primaries here as “unspecified” and provide a detailed description in an extension block.
This value represents the Color Primaries defined by the ITUR BT.709 specification and described in Section 14.1, which are also shared by sRGB.
RGB data is distinguished between BT.709 and sRGB by the Transfer Function. Conversion to and from BT.709 Y′C_{B}C_{R} (YUV) representation uses the color conversion matrix defined in the BT.709 specification, and described in Section 15.1.1, except in the case of sYCC (which can be distinguished by the use of the sRGB transfer function), in which case conversion to and from BT.709 Y′C_{B}C_{R} representation uses the color conversion matrix defined in the BT.601 specification, and described in Section 15.1.2. This is the preferred set of color primaries used by HDTV and sRGB, and likely a sensible default set of color primaries for common rendering operations.
KHR_DF_PRIMARIES_SRGB
is provided as a synonym for KHR_DF_PRIMARIES_BT709
.
This value represents the Color Primaries defined in the ITUR BT.601 specification for standarddefinition television, particularly for 625line signals, and described in Section 14.2. Conversion to and from BT.601 Y′C_{B}C_{R} (YUV) typically uses the color conversion matrix defined in the BT.601 specification and described in Section 15.1.2.
This value represents the Color Primaries defined in the ITUR BT.601 specification for standarddefinition television, particularly for 525line signals, and described in Section 14.3. Conversion to and from BT.601 Y′C_{B}C_{R} (YUV) typically uses the color conversion matrix defined in the BT.601 specification and described in Section 15.1.2.
This value represents the Color Primaries defined in the ITUR BT.2020 specification for ultrahighdefinition television and described in Section 14.4. Conversion to and from BT.2020 Y′C_{B}C_{R} (YUV uses the color conversion matrix defined in the BT.2020 specification and described in Section 15.1.3.
This value represents the theoretical Color Primaries defined by the International Color Consortium for the ICC XYZ linear color space.
This value represents the Color Primaries defined for the Academy Color Encoding System and described in Section 14.7.
This value represents the Color Primaries defined for the Academy Color Encoding System compositor and described in Section 14.8.
This value represents the Color Primaries defined for the NTSC 1953 color television transmission standard and described in Section 14.5.
This value represents the Color Primaries defined for 525line PAL signals, described in Section 14.6.
This value represents the Color Primaries defined for the Display P3 color space, described in Section 14.9.
This value represents the Color Primaries defined in Adobe RGB (1998), described in Section 14.10.
Many color representations contain a nonlinear transfer function
which maps between a linear (intensitybased) representation and
a more perceptuallyuniform encoding.
Common transfer functions are represented as an unsigned 8bit integer
and encoded in the enumeration khr_df_transfer_e
.
A fullyflexible transfer function requires an extension with a full
color space definition.
Where the transfer function can be described as a simple power curve,
applying the function is commonly known as “gamma correction”.
The transfer function is applied to a sample only when the sample’s
KHR_DF_SAMPLE_DATATYPE_LINEAR
bit is 0; if this bit is 1, the
sample is represented linearly irrespective of the transferFunction.
When a color model contains more than one channel in a sample and
the transfer function should be applied only to a subset of those
channels, the convention of that model should be used when applying
the transfer function. For example, ASTC stores both alpha and RGB
data but is represented by a single sample; in ASTC, any sRGB transfer
function is not applied to the alpha channel of the ASTC texture.
In this case, the KHR_DF_SAMPLE_DATATYPE_LINEAR
bit being zero means that
the transfer function is “applied” to the ASTC sample in a way that only
affects the RGB channels. This is not a concern for most color models,
which explicitly store different channels in each sample.
If all the samples are linear, KHR_DF_TRANSFER_LINEAR
should be used.
In this case, no sample should have the KHR_DF_SAMPLE_DATATYPE_LINEAR
bit set.
The enumerant value for each of the following transfer functions is shown in parentheses alongside the title.
This value should be used when the transfer function is unknown, or specified only in an extension block, precluding conversion of color spaces and correct filtering of the data values using only the information in the basic descriptor block.
This value represents a linear transfer function: for color data, there is a linear relationship between numerical pixel values and the intensity of additive colors. This transfer function allows for blending and filtering operations to be applied directly to the data values.
This value represents the nonlinear transfer function defined in the sRGB specification for mapping between numerical pixel values and intensity. This is described in Section 13.3.
This value represents the nonlinear transfer function defined by the ITU and used in the BT.601, BT.709 and BT.2020 specifications. This is described in Section 13.2.
This value represents the nonlinear transfer function defined by the original NTSC television broadcast specification. This is described in Section 13.8.
More recent formulations of this transfer functions, such as that defined in SMPTE 170M2004, use it ITU formulation described above. 
This value represents a nonlinear Transfer Function used by some Sony video cameras to represent an increased dynamic range, and is described in Section 13.13.
This value represents a nonlinear Transfer Function used by some Sony video cameras to represent a further increased dynamic range, and is described in Section 13.14.
This value represents the nonlinear OETF defined in BT.1886 and described in Section 13.4.
This value represents the Hybrid Log Gamma OETF defined by the ITU in BT.2100 for high dynamic range television, and described in Section 13.5.
This value represents the Hybrid Log Gamma OETF defined by the ITU in BT.2100 for high dynamic range television, and described in Section 13.5.
This value represents the Perceptual Quantization EOTF defined by the ITU in BT.2100 for high dynamic range television, and described in Section 13.6.
This value represents the Perceptual Quantization EOTF defined by the ITU in BT.2100 for high dynamic range television, and described in Section 13.6.
This value represents the transfer function defined in DCI P3 and described in Section 13.7.
This value represents the OETF for legacy PAL systems described in Section 13.9.
This value represents the EOTF for legacy 625line PAL systems described in Section 13.10.
This value represents the transfer function associated with the legacy ST240 (SMPTE240M) standard, described in Section 13.11.
This value represents the nonlinear Transfer Function used in the ACEScc Academy Color Encoding System logarithmic encoding system for use within Color Grading Systems, S2014003, defined in [aces]. This is described in Section 13.15.
This value represents the nonlinear Transfer Function used in the ACEScc Academy Color Encoding System quasilogarithmic encoding system for use within Color Grading Systems, S2016001, defined in [aces]. This is described in Section 13.16.
This value represents the transfer function defined in the Adobe RGB (1998) specification and described in Section 13.12.
The format supports some configuration options in the form of
boolean flags; these are described in the enumeration
khr_df_flags_e
and represented in an unsigned 8bit integer value.
If the KHR_DF_FLAG_ALPHA_PREMULTIPLIED
bit is set, any color
information in the data should be interpreted as having been
previously scaled by the alpha channel when performing blending
operations.
The value KHR_DF_FLAG_ALPHA_STRAIGHT
(= 0) is provided
to represent this flag not being set, which indicates that the color
values in the data should be interpreted as needing to be scaled
by the alpha channel when performing blending operations. This flag
has no effect if there is no alpha channel in the format.
The texelBlockDimension fields define an integer bound on the range of coordinates covered by the repeating block described by the samples. Four separate values, represented as unsigned 8bit integers, are supported, corresponding to successive dimensions. The Basic Data Format Descriptor Block supports up to four dimensions of encoding within a texel block, supporting, for example, a texture with three spatial dimensions and one temporal dimension. Nothing stops the data structure as a whole from having higher dimensionality: for example, a twodimensional texel block can be used as an element in a sixdimensional lookup table.
The value held in each of these fields is one fewer than the size of the block in that dimension — that is, a value of 0 represents a size of 1, a value of 1 represents a size of 2, etc. A texel block which covers fewer than four dimensions should have a size of 1 in each dimension that it lacks, and therefore the corresponding fields in the representation should be 0.
For example, a Y′C_{B}C_{R} 4:2:0 representation may use a Texel Block of 2×2 pixels in the nominal coordinate space, corresponding to the four Y′ samples, as shown in Table 24. The texel block dimensions in this case would be 2×2×1×1 (in the X, Y, Z and T dimensions, if the fourth dimension is interpreted as T). The texelBlockDimension[0..3] values would therefore be:
Table 24. Example Basic Data Format texelBlockDimension values for Y′C_{B}C_{R} 4:2:0
texelBlockDimension0  1 
texelBlockDimension1  1 
texelBlockDimension2  0 
texelBlockDimension3  0 
The Basic Data Format Descriptor divides the image into a number of planes, each consisting of an integer number of consecutive bytes. The requirement that planes consist of consecutive data means that formats with distinct subsampled channels — such as Y′C_{B}C_{R} 4:2:0 — may require multiple planes to describe a channel. A typical Y′C_{B}C_{R} 4:2:0 image has two planes for the Y′ channel in this representation, offset by one line vertically.
The use of byte granularity to define planes is a choice to allow large texels (of up to 255 bytes). A consequence of this is that formats which are not bytealigned on each addressable unit, such as 1bitperpixel formats, need to represent a texel block of multiple samples, covering multiple texels.
A maximum of eight independent planes is supported in the Basic Data Format Descriptor. Formats which require more than eight planes — which are rare — require an extension.
The bytesPlane[0..7] fields each contain an unsigned 8bit integer which represents the number of bytes which that plane contributes to the format. The first field which contains the value 0 indicates that only a subset of the 8 possible planes are present; that is, planes which are not present should be given the bytesPlane value of 0, and any bytesPlane values after the first 0 are ignored. If no bytesPlane value is zero, 8 planes are considered to exist.
As an exception, if bytesPlane0 has the value 0, the first plane is considered to hold indices into a color palette, which is described by one or more additional planes and samples in the normal way. The first sample in this case should describe a 1×1×1×1 texel holding an unsigned integer value. The number of bits used by the index should be encoded in this sample, with a maximum value of the largest palette entry held in sampleUpper. Subsequent samples describe the entries in the palette, starting at an offset of bit 0. Note that the texel block in the index plane is not required to be bytealigned in this case, and will not be for paletted formats which have small palettes. The channel type for the index is irrelevant.
For example, consider a 5color paletted texture which describes each of these colors using 8 bits of red, green, blue and alpha. The color model would be RGBSDA, and the format would be described with two planes. bytesPlane0 would be 0, indicating the special case of a palette, and bytesPlane1 would be 4, representing the size of the palette entry. The first sample would then have a number of bits corresponding to the number of bits for the palette — in this case, three bits, corresponding to the requirements of a 5color palette. The sampleUpper value for this sample is 4, indicating only 5 palette entries. Four subsequent samples represent the red, green, blue and alpha channels, starting from bit 0 as though the index value were not present, and describe the contents of the palette. The full data format descriptor for this example is provided in Table 33 as one of the example format descriptors.
The layout and position of the information within each plane is determined by a number of samples, each consisting of a single channel of data and with a single corresponding position within the texel block, as shown in Table 25.
The bytes from the plane data contributing to the format are treated as though they have been concatenated into a bit stream, with the first byte of the lowestnumbered plane providing the lowest bits of the result. Each sample consists of a number of consecutive bits from this bit stream.
If the content for a channel cannot be represented in a single sample, for example because the data for a channel is nonconsecutive within this bit stream, additional samples with the same coordinate position and channel number should follow from the first, in order increasing from the least significant bits from the channel data.
Note that some native bigendian formats may need to be supported with multiple samples in a channel, since the constituent bits may not be consecutive in a littleendian interpretation. There is an example, Table 35, in the list of format descriptors provided. In this case, the sampleLower and sampleUpper fields for the combined sample are taken from the first sample to belong uniquely to this channel/position pair.
By convention, to avoid aliases for formats, samples should be listed in order starting with channels at the lowest bits of this bit stream. Ties should be broken by increasing channel type id, as shown in Table 40.
The number of samples present in the format is determined by the descriptorBlockSize field. There is no limit on the number of samples which may be present, other than the maximum size of the Data Format Descriptor Block. There is no requirement that samples should access unique parts of the bitstream: formats such as combined intensity and alpha, or shared exponent formats, require that bits be reused. Nor is there a requirement that all the bits in a plane be used (a format may contain padding).
Table 25. Basic Data Format Descriptor Sample Information
Byte 0 (LSB)  Byte 1  Byte 2  Byte 3 (MSB) 

bitOffset  bitLength  channelType  
samplePosition0  samplePosition1  samplePosition2  samplePosition3 
sampleLower  
sampleUpper 
The bitOffset field describes the offset of the least significant bit of this sample from the least significant bit of the least significant byte of the concatenated bit stream for the format. Typically the bitOffset of the first sample is therefore 0; a sample which begins at an offset of one byte relative to the data format would have a bitOffset of 8. The bitOffset is an unsigned 16bit integer quantity.
The bitLength field describes the number of consecutive bits from the concatenated bit stream that contribute to the sample. This field is an unsigned 8bit integer quantity, and stores the number of bits contributed minus 1; thus a singlebyte channel should have a bitLength field value of 7. If a bitLength of more than 256 is required, further samples should be added; the value for the sample is composed in increasing order from least to most significant bit as subsequent samples are processed.
The channelType field is an unsigned 8bit quantity.
The bottom four bits of the channelType indicates which channel is being described by this sample. The list of available channels is determined by the colorModel field of the Basic Data Format Descriptor Block, and the channelType field contains the number of the required channel within this list — see the colorModel field for the list of channels for each model.
The top four bits of the channelType are described by the
khr_df_sample_datatype_qualifiers_e
enumeration:
If the KHR_DF_SAMPLE_DATATYPE_LINEAR
bit is not set, the sample value is
modified by the transfer function defined in the format’s transferFunction
field; if this bit is set, the sample is considered to contain a
linearlyencoded value irrespective of the format’s transferFunction.
If the KHR_DF_SAMPLE_DATATYPE_EXPONENT
bit is set, this sample holds an
exponent (in integer form) for this channel. For example, this would be
used to describe the shared exponent location in shared exponent formats
(with the exponent bits listed separately under each channel). An exponent
is applied to any integer sample of the same type. If this bit is not set,
the sample is considered to contain mantissa information. If the
KHR_DF_SAMPLE_DATATYPE_SIGNED
bit is also set, the exponent is considered
to be two’s complement — otherwise it is treated as unsigned. The bias of
the exponent can be determined by the exponent’s sampleLower value. The
presence or absence of an implicit leading digit in the mantissa of a format
with an exponent can be determined by the sampleUpper value of the
mantissa.
If the KHR_DF_SAMPLE_DATATYPE_SIGNED
bit is set, the sample holds a signed
value in two’s complement form. If this bit is not set, the sample holds
an unsigned value. It is possible to represent a sign/magnitude integer
value by having a sample of unsigned integer type with the same channel
and sample location as a 1bit signed sample.
If the KHR_DF_SAMPLE_DATATYPE_FLOAT
bit is set, the sample holds floating
point data in a conventional format of 10, 11 or 16 bits, as described in
Section 10, or of 32, or 64 bits as described in [IEEE 754]. Unless
a genuine unsigned format is intended, KHR_DF_SAMPLE_DATATYPE_SIGNED
should
be set. Less common floating point representations can be generated with
multiple samples and a combination of signed integer, unsigned integer and
exponent fields, as described above and in Section 10.4.
The sample has an associated location within the 4dimensional space of the texel block. Each sample has an offset relative to the 0,0 position of the texel block, determined in units of half a coordinate. This allows the common situation of downsampled channels to have samples conceptually sited at the midpoint between full resolution samples. Support for offsets other than multiples of a half coordinates require an extension. The direction of the sample offsets is determined by the coordinate addressing scheme used by the API. There is no limit on the dimensionality of the data, but if more than four dimensions need to be contained within a single texel block, an extension will be required.
Each samplePosition is an 8bit unsigned integer quantity. samplePosition0 is the X offset of the sample, samplePosition1 is the Y offset of the sample, etc. Formats which use an offset larger than 127.5 in any dimension require an extension.
It is legal, but unusual, to use the same bits to represent multiple samples at different coordinate locations.
sampleLower, combined with sampleUpper, is used to represent the mapping between the numerical value stored in the format and the conceptual numerical interpretation. For unsigned formats, sampleLower typically represents the value which should be interpreted as zero (the black point). For signed formats, sampleLower typically represents “1”. For color difference models such as Y′C_{B}C_{R}, sampleLower represents the lower extent of the color difference range (which corresponds to an encoding of 0.5 in numerical terms).
If the channel encoding is an integer format, the sampleLower value is represented as a 32bit integer — signed or unsigned according to whether the channel encoding is signed. Signed negative values should be signextended if the channel has fewer than 32 bits, such that the value encoded in sampleLower is itself negative. If the channel encoding is a floating point value, the sampleLower value is also floating point. If the number of bits in the sample is greater than 32, the lowest representable value for sampleLower is interpreted as the smallest value representable in the channel format.
If the channel consists of multiple cosited integer samples, for example because the channel bits are noncontiguous, there are two possible behaviors. If the total number of bits in the channel is less than or equal to 32, the sampleLower values in the samples corresponding to the leastsignificant bits of the sample are ignored, and only the sampleLower from the mostsignificant sample is considered. If the number of bits in the channel exceeds 32, the sampleLower values from the sample corresponding to the mostsignificant bits within any 32bit subset of the total number are concatenated to generate the final sampleLower value. For example, a 48bit signed integer may be encoded in three 16bit samples. The first sample, corresponding to the leastsignificant 16 bits, will have its sampleLower value ignored. The next sample of 16 bits takes the total to 32, and so the sampleLower value of this sample should represent the lowest 32 bits of the desired 48bit virtual sampleLower value. Finally, the third sample indicates the top 16 bits of the 48bit channel, and its sampleLower contains the top 16 bits of the 48bit virtual sampleLower value.
The sampleLower value for an exponent should represent the exponent bias — the value that should be subtracted from the encoded exponent to indicate that the mantissa’s sampleUpper value will represent 1.0. See Section 10.4 for more detail on this.
For example, the BT.709 television broadcast standard dictates that the Y′ value stored in an 8bit encoding should fall between the range 16 and 235. In this case, sampleLower should contain the value 16.
In OpenGL terminology, a “normalized” channel contains an integer value which is mapped to the range 0..1.0. A channel which is not normalized contains an integer value which is mapped to a floating point equivalent of the integer value. Similarly an “snorm” channel is a signed normalized value mapping from 1.0 to 1.0. Setting sampleLower to the minimum signed integer value representable in the channel is equivalent to defining an “snorm” texture.
sampleUpper, combined with sampleLower, is used to represent the mapping between the numerical value stored in the format and the conceptual numerical interpretation. sampleUpper typically represents the value which should be interpreted as “1.0” (the “white point”). For color difference models such as Y′C_{B}C_{R}, sampleUpper represents the upper extent of the color difference range (which corresponds to an encoding of 0.5 in numerical terms).
If the channel encoding is an integer format, the sampleUpper value is represented as a 32bit integer — signed or unsigned according to whether the channel encoding is signed. If the channel encoding is a floating point value, the sampleUpper value is also floating point. If the number of bits in the sample is greater than 32, the highest representable value for sampleUpper is interpreted as the largest value representable in the channel format. If the channel encoding is the mantissa of a custom floating point format (that is, the encoding is integer but the same sample location and channel is shared by a sample that encodes an exponent), the presence of an implicit “1” digit can be represented by setting the sampleUpper value to a value one larger than can be encoded in the available bits for the mantissa, as described in Section 10.4.
The sampleUpper value for an exponent should represent the largest conventional legal exponent value. If the encoded exponent exceeds this value, the encoded floating point value encodes either an infinity or a NaN value, depending on the mantissa. See Section 10.4 for more detail on this.
If the channel consists of multiple cosited integer samples, for example because the channel bits are noncontiguous, there are two possible behaviors. If the total number of bits in the channel is less than or equal to 32, the sampleUpper values in the samples corresponding to the leastsignificant bits of the sample are ignored, and only the sampleUpper from the mostsignificant sample is considered. If the number of bits in the channel exceeds 32, the sampleUpper values from the sample corresponding to the mostsignificant bits within any 32bit subset of the total number are concatenated to generate the final sampleUpper value. For example, a 48bit signed integer may be encoded in three 16bit samples. The first sample, corresponding to the leastsignificant 16 bits, will have its sampleUpper value ignored. The next sample of 16 bits takes the total to 32, and so the sampleUpper value of this sample should represent the lowest 32 bits of the desired 48bit virtual sampleUpper value. Finally, the third sample indicates the top 16 bits of the 48bit channel, and its sampleUpper contains the top 16 bits of the 48bit virtual sampleUpper value.
For example, the BT.709 television broadcast standard dictates that the Y′ value stored in an 8bit encoding should fall between the range 16 and 235. In this case, sampleUpper should contain the value 235.
In OpenGL terminology, a “normalized” channel contains an integer value which is mapped to the range 0..1.0. A channel which is not normalized contains an integer value which is mapped to a floating point equivalent of the integer value. Similarly an “snorm” channel is a signed normalized value mapping from 1.0 to 1.0. Setting sampleUpper to the maximum signed integer value representable in the channel for a signed channel type is equivalent to defining an “snorm” texture. Setting sampleUpper to the maximum unsigned value representable in the channel for an unsigned channel type is equivalent to defining a “normalized” texture. Setting sampleUpper to “1” is equivalent to defining an “unnormalized” texture.
Sensor data from a camera typically does not cover the full range of the bit depth used to represent it. sampleUpper can be used to specify an upper limit on sensor brightness — or to specify the value which should map to white on the display, which may be less than the full dynamic range of the captured image.
There is no guarantee or expectation that image data be guaranteed to fall between sampleLower and sampleUpper unless the users of a format agree that convention.
Some formats will require more channels than can be described in the Basic Format Descriptor, or may have more specific color requirements. For example, it is expected than an extension will be available which places an ICC color profile block into the descriptor block, allowing more color channels to be specified in more precise ways. This will significantly enlarge the space required for the descriptor, and is not expected to be needed for most common uses. A vendor may also use an extension block to associate metadata with the descriptor — for example, information required as part of hardware rendering. So long as software which uses the data format descriptor always uses the totalSize field to determine the size of the descriptor, this should be transparent to user code.
The extension mechanism is the preferred way to support even simple extensions such as additional color spaces transfer functions that can be supported by an additional enumeration. This approach improves compatibility with code which is unaware of the additional values. Simple extensions of this form that have crossvendor support have a good chance of being incorporated more directly into future revisions of the specification, allowing application code to distinguish them by the versionId field.
As an example, consider a singlechannel 32bit depth buffer, as shown in Table 26. A tiled renderer may wish to indicate that this buffer is “virtual”: it will be allocated real memory only if needed, and will otherwise exist only a subset at a time in an onchip representation. Someone developing such a renderer may choose to add a vendorspecific extension (with ID 0xFFFF to indicate development work and avoid the need for a vendor ID) which uses a boolean to establish whether this depth buffer exists only in virtual form. Note that the mere presence or absence of this extension within the data format descriptor itself forms a boolean, but for this example we will assume that an extension block is always present, and that a boolean is stored within. We will give the enumeration 32 bits, in order to simplify the possible addition of further extensions.
In this example (which should not be taken as an implementation suggestion), the data descriptor would first contain a descriptor block describing the depth buffer format as conventionally described, followed by a second descriptor block that contains only the enumeration. The descriptor itself has a totalSize that includes both of these descriptor blocks.
Table 26. Example of a depth buffer with an extension to indicate a virtual allocation
56 (totalSize: total size of the two blocks plus one 32bit value)

It is possible for a vendor to use the extension block to store peripheral information required to access the image — plane base addresses, stride, etc. Since different implementations have different kinds of nonlinear ordering and proprietary alignment requirements, this is not described as part of the standard. By many conventional definitions, this information is not part of the “format”, and particularly it ensures that an identical copy of the image will have a different descriptor block (because the addresses will have changed) and so a simple bitwise comparison of two descriptor blocks will disagree even though the “format” matches. Additionally, many APIs will use the format descriptor only for external communication, and have an internal representation that is more concise and less flexible. In this case, it is likely that address information will need to be represented separately from the format anyway. For these reasons, it is an implementation choice whether to store this information in an extension block, and how to do so, rather than being specified in this standard..
While it is not expected that every new container will have a unique data descriptor or that analysis of the data format descriptor will be on a critical path in an application, it is still expected that comparison between formats may be timesensitive. The data format descriptor is designed to allow relatively efficient queries for subsets of properties, to allow a large number of format descriptors to be stored, and to be amenable to hardware interpretation or processing in shaders. These goals preclude a textbased representation such as an XML schema.
Formats in FourCC.org do not describe in detail sufficient information for many APIs, and are sometimes inconsistent.
Enumerations are fast and easy to process, but are limited in that any software can only be aware of the enumeration values in place when it was defined. Software often behaves differently according to properties of a format, and must perform a lookup on the enumeration — if it knows what it is — in order to change behaviors. A descriptive format allows for more flexible software which can support a wide range of formats without needing each to be listed, and simplifies the programming of conditional behavior based on format properties.
Khronos supports multiple standards that have a range of internal data representations. There is no requirement that this standard be used specifically with other Khronos standards, but it is hoped that multiple Khronos standards may use this specification as part of a consistent approach to interstandard operation.
While a library may not use all the data provided in the data format descriptor that is described within this standard, it is common for users of data — particularly pixellike data — to have additional requirements. Capturing these requirements portably reduces the need for additional metadata to be associated with a proprietary descriptor. It is also common for additional functionality to be added retrospectively to existing libraries — for example, Y′C_{B}C_{R} support is often an afterthought in rendering APIs. Having a consistent and flexible representation in place from the start can reduce the pain of retrofitting this functionality.
Note that there is no expectation that the format descriptor from this standard be used directly, although it can be. The impact of providing a mapping between internal formats and format descriptors is expected to be low, but offers the opportunity both for simplified access from software outside the proprietary library and for reducing the effort needed to provide a complete, unambiguous and accurate description of a format in humanreadable terms.
There is a tradeoff between size and decoding effort. It is assumed that data which occupies the same 32bit word may need to be tested concurrently, reducing the cost of comparisons. When transferring data formats, the packing reduces the overhead. Within these constraints, it is intended that most data can be extracted with lowcost operations, typically being bytealigned (other than sample flags) and with the natural alignment applied to multibyte quantities.
For simple ASCII content, there is no reason that plain text could not be described in some way, and this may be useful for image formats that contain comment sections. However, since many multilingual text representations do not have a fixed character size, this use is not seen as an obvious match for this standard.
Some common floatingpoint numeric representations are defined in [IEEE 754]. Additional floating point formats are defined in this section.
A 16bit floatingpoint number has a 1bit sign (S), a 5bit exponent (E), and a 10bit mantissa (M). The value V of a 16bit floatingpoint number is determined by the following:
If the floatingpoint number is interpreted as an unsigned 16bit integer N, then
An unsigned 11bit floatingpoint number has no sign bit, a 5bit exponent (E), and a 6bit mantissa (M). The value V of an unsigned 11bit floatingpoint number is determined by the following:
If the floatingpoint number is interpreted as an unsigned 11bit integer N, then
An unsigned 10bit floatingpoint number has no sign bit, a 5bit exponent (E), and a 5bit mantissa (M). The value V of an unsigned 10bit floatingpoint number is determined by the following:
If the floatingpoint number is interpreted as an unsigned 10bit integer N, then
Rather than attempting to enumerate every possible floatingpoint
format variation in this specification, the data format descriptor
can be used to describe the components of arbitrary floatingpoint
data, as follows. Note that nonstandard floating point formats do
not use the KHR_DF_SAMPLE_DATATYPE_FLOAT
bit.
An example of use of the 16bit floating point format described in Section 10.1 but described in terms of a custom floating point format is provided in Table 42. Note that this is provided for example only, and this particular format would be better described using the standard 16bit floating point format as documented in Table 43.
The mantissa of a custom floating point format should be represented
as an integer channelType. If the mantissa represents a signed
quantity encoded in two’s complement, the KHR_DF_SAMPLE_DATATYPE_SIGNED
bit should be set. To encode a signed mantissa represented in
signmagnitude format, the main part of the mantissa should be
represented as an unsigned integer quantity (with
KHR_DF_SAMPLE_DATATYPE_SIGNED
not set), and an additional onebit
sample with KHR_DF_SAMPLE_DATATYPE_SIGNED
set should be used
to identify the sign bit. By convention, a sign bit should be encoded
in a later sample than the corresponding mantissa.
The sampleUpper and sampleLower values for the mantissa should be set to indicate the representation of 1.0 and 0.0 (for unsigned formats) or 1.0 (for signed formats) respectively when the exponent is in a 0 position after any bias has been corrected. If there is an implicit “1” bit, these values for the mantissa will exceed what can be represented in the number of available mantissa bits.
For example, the shared exponent formats shown in Table 36 does not have an implicit “1” bit, and therefore the sampleUpper values for the 9bit mantissas are 256 — this being the mantissa value for 1.0 when the exponent is set to 0.
For the 16bit signed floating point format described in Section 10.1, sampleUpper should be set to 1024, indicating the implicit “1” bit which is above the 10 bits representable in the mantissa. sampleLower should be 0 in this case, since the mantissa uses a signmagnitude representation.
By convention, the sampleUpper and sampleLower values for a sign bit are 0 and 1 respectively.
The KHR_DF_SAMPLE_DATATYPE_EXPONENT
bit should be set in a sample
which contains the exponent of a custom floating point format.
The sampleLower for the exponent should indicate the exponent bias. That is, the mantissa should be scaled by two raised to the power of the stored exponent minus this sampleLower value.
The sampleUpper for the exponent indicates the maximum legal exponent value. Values above this are used to encode infinities and notanumber (NaN) values. sampleUpper can therefore be used to indicate whether or not the format supports these encodings.
Floating point values encoded with an exponent of 0 (before bias) and a mantissa of 0 are used to represent the value 0. An explicit sign bit can distinguish between +0 and 0.
Floating point values encoded with an exponent of 0 (before bias) and a nonzero mantissa are assumed to indicate a denormalized number, if the format has an implicit “1” bit. That is, when the exponent is 0, the “1” bit becomes explicit and the exponent is considered to be the negative sample bias minus one.
Floating point values encoded with an exponent larger than the exponent’s sampleUpper value and with a mantissa of 0 are interpreted as representing +/ infinity, depending on the value of an explicit sign bit. Note that in some formats, no exponent above sampleUpper is possible — for example, Table 36.
Floating point values encoded with an exponent larger than the exponent’s sampleUpper value and with a mantissa of non0 are interpreted as representing notanumber (NaN).
Note that these interpretations are compatible with the corresponding numerical representations in [IEEE 754].
Given an optional sign bit S, a mantissa value of M and an exponent value of E, a format with an implicit “1” bit can be converted from its representation to a real value as follows:
If there is no implicit “1” bit (that is, the sampleUpper value of the mantissa is representable in the number of bits assigned to the mantissa), the value can be converted to a real value as follows:
A descriptor block for a format without an implicit “1” (and with the added complication of having the same exponent bits shared across multiple channels, which is why an implicit “1” bit does not make sense) is shown in Table 36. In the case of this particular example, the above equations simplify to:
Where:
Note that in general conversion from a real number to any representation may require rounding, truncation and special value management rules which are beyond the scope of a data format specification and may be documented in APIs which generate these formats.
Table 27. Four cosited 8bit sRGB channels, assuming premultiplied alpha
Byte 0 (LSB)  Byte 1  Byte 2  Byte 3 (MSB) 

92 (totalSize)  
0 (vendorId)  0 (descriptorType)  
1 (versionNumber)  88 (descriptorBlockSize)  




0 (texelBlockDimension0)  0 (texelBlockDimension1)  0 (texelBlockDimension2)  0 (texelBlockDimension3) 
4 (bytesPlane0)  0 (bytesPlane1)  0 (bytesPlane2)  0 (bytesPlane3) 
0 (bytesPlane4)  0 (bytesPlane5)  0 (bytesPlane6)  0 (bytesPlane7) 
_{Sample information for the first sample}  
0 (bitOffset)  7 (= “8”) (bitLength)  0 (channelType) (  
0 (samplePosition0)  0 (samplePosition1)  0 (samplePosition2)  0 (samplePosition3) 
0 (sampleLower)  
255 (sampleUpper)  
_{Sample information for the second sample}  
8 (bitOffset)  7 (= “8”) (bitLength)  1 (channelType) (  
0 (samplePosition0)  0 (samplePosition1)  0 (samplePosition2)  0 (samplePosition3) 
0 (sampleLower)  
255 (sampleUpper)  
_{Sample information for the third sample}  
16 (bitOffset)  7 (= “8”) (bitLength)  2 (channelType) (  
0 (samplePosition0)  0 (samplePosition1)  0 (samplePosition2)  0 (samplePosition3) 
0 (sampleLower)  
255 (sampleUpper)  
_{Sample information for the fourth sample}  
24 (bitOffset)  7 (= “8”) (bitLength)  31 (channelType) (  
0 (samplePosition0)  0 (samplePosition1)  0 (samplePosition2)  0 (samplePosition3) 
0 (sampleLower)  
255 (sampleUpper) 
Table 28. 565 RGB packed 16bit format as written to memory by a littleendian architecture
Byte 0 (LSB)  Byte 1  Byte 2  Byte 3 (MSB) 

76 (totalSize)  
0 (vendorId)  0 (descriptorType)  
1 (versionNumber)  72 (descriptorBlockSize)  




0 (texelBlockDimension0)  0 (texelBlockDimension1)  0 (texelBlockDimension2)  0 (texelBlockDimension3) 
2 (bytesPlane0)  0 (bytesPlane1)  0 (bytesPlane2)  0 (bytesPlane3) 
0 (bytesPlane4)  0 (bytesPlane5)  0 (bytesPlane6)  0 (bytesPlane7) 
_{Sample information for the first sample: 5 bits of blue}  
0 (bitOffset)  4 (= “5”) (bitLength)  2 (channelType) (  
0 (samplePosition0)  0 (samplePosition1)  0 (samplePosition2)  0 (samplePosition3) 
0 (sampleLower)  
31 (sampleUpper)  
_{Sample information for the second sample: 6 bits of green}  
5 (bitOffset)  5 (= “6”) (bitLength)  1 (channelType) (  
0 (samplePosition0)  0 (samplePosition1)  0 (samplePosition2)  0 (samplePosition3) 
0 (sampleLower)  
63 (sampleUpper)  
_{Sample information for the third sample: 5 bits of red}  
11 (bitOffset)  4 (= “5”) (bitLength)  0 (channelType) (  
0 (samplePosition0)  0 (samplePosition1)  0 (samplePosition2)  0 (samplePosition3) 
0 (sampleLower)  
31 (sampleUpper) 
Table 29. A single 8bit monochrome channel
Byte 0 (LSB)  Byte 1  Byte 2  Byte 3 (MSB) 

44 (totalSize)  
0 (vendorId)  0 (descriptorType)  
1 (versionNumber)  40 (descriptorBlockSize)  




0 (texelBlockDimension0)  0 (texelBlockDimension1)  0 (texelBlockDimension2)  0 (texelBlockDimension3) 
4 (bytesPlane0)  0 (bytesPlane1)  0 (bytesPlane2)  0 (bytesPlane3) 
0 (bytesPlane4)  0 (bytesPlane5)  0 (bytesPlane6)  0 (bytesPlane7) 
_{Sample information for the first sample}  
0 (bitOffset)  7 (= “8”) (bitLength)  0 (channelType) (  
0 (samplePosition0)  0 (samplePosition1)  0 (samplePosition2)  0 (samplePosition3) 
0 (sampleLower)  
255 (sampleUpper) 
Table 30. A single 1bit monochrome channel, as an 8×1 texel block to allow bytealignment, part 1 of 2
Byte 0 (LSB)  Byte 1  Byte 2  Byte 3 (MSB) 

156 (totalSize)  
0 (vendorId)  0 (descriptorType)  
1 (versionNumber)  152 (descriptorBlockSize)  




7 (texelBlockDimension0)  0 (texelBlockDimension1)  0 (texelBlockDimension2)  0 (texelBlockDimension3) 
1 (bytesPlane0)  0 (bytesPlane1)  0 (bytesPlane2)  0 (bytesPlane3) 
0 (bytesPlane4)  0 (bytesPlane5)  0 (bytesPlane6)  0 (bytesPlane7) 
_{Sample information for the first sample}  
0 (bitOffset)  0 (= “1”) (bitLength)  0 (channelType) (  
0 (samplePosition0)  0 (samplePosition1)  0 (samplePosition2)  0 (samplePosition3) 
0 (sampleLower)  
1 (sampleUpper)  
_{Sample information for the second sample}  
1 (bitOffset)  0 (= “1”) (bitLength)  0 (channelType) (  
2 (samplePosition0)  0 (samplePosition1)  0 (samplePosition2)  0 (samplePosition3) 
0 (sampleLower)  
1 (sampleUpper)  
_{Sample information for the third sample}  
2 (bitOffset)  0 (= “1”) (bitLength)  0 (channelType) (  
4 (samplePosition0)  0 (samplePosition1)  0 (samplePosition2)  0 (samplePosition3) 
0 (sampleLower)  
1 (sampleUpper) 
Table 31. A single 1bit monochrome channel, as an 8×1 texel block to allow bytealignment, part 2 of 2
Byte 0 (LSB)  Byte 1  Byte 2  Byte 3 (MSB) 

_{Sample information for the fourth sample}  
3 (bitOffset)  0 (= “1”) (bitLength)  0 (channelType) (  
6 (samplePosition0)  0 (samplePosition1)  0 (samplePosition2)  0 (samplePosition3) 
0 (sampleLower)  
1 (sampleUpper)  
_{Sample information for the fifth sample}  
4 (bitOffset)  0 (= “1”) (bitLength)  0 (channelType) (  
8 (samplePosition0)  0 (samplePosition1)  0 (samplePosition2)  0 (samplePosition3) 
0 (sampleLower)  
1 (sampleUpper)  
_{Sample information for the sixth sample}  
5 (bitOffset)  0 (= “1”) (bitLength)  0 (channelType) (  
10 (samplePosition0)  0 (samplePosition1)  0 (samplePosition2)  0 (samplePosition3) 
0 (sampleLower)  
1 (sampleUpper)  
_{Sample information for the seventh sample}  
6 (bitOffset)  0 (= “1”) (bitLength)  0 (channelType) (  
12 (samplePosition0)  0 (samplePosition1)  0 (samplePosition2)  0 (samplePosition3) 
0 (sampleLower)  
1 (sampleUpper)  
_{Sample information for the eighth sample}  
7 (bitOffset)  0 (= “1”) (bitLength)  0 (channelType) (  
14 (samplePosition0)  0 (samplePosition1)  0 (samplePosition2)  0 (samplePosition3) 
0 (sampleLower)  
1 (sampleUpper) 
Table 32. 2×2 Bayer pattern: four 8bit distributed sRGB channels, spread across two lines (as two planes)
Byte 0 (LSB)  Byte 1  Byte 2  Byte 3 (MSB) 

92 (totalSize)  
0 (vendorId)  0 (descriptorType)  
1 (versionNumber)  88 (descriptorBlockSize)  




1 (texelBlockDimension0)  1 (texelBlockDimension1)  0 (texelBlockDimension2)  0 (texelBlockDimension3) 
2 (bytesPlane0)  2 (bytesPlane1)  0 (bytesPlane2)  0 (bytesPlane3) 
0 (bytesPlane4)  0 (bytesPlane5)  0 (bytesPlane6)  0 (bytesPlane7) 
_{Sample information for the first sample}  
0 (bitOffset)  7 (= “8”) (bitLength)  0 (channelType) (  
0 (samplePosition0)  0 (samplePosition1)  0 (samplePosition2)  0 (samplePosition3) 
0 (sampleLower)  
255 (sampleUpper)  
_{Sample information for the second sample}  
8 (bitOffset)  7 (= “8”) (bitLength)  1 (channelType) (  
2 (samplePosition0)  0 (samplePosition1)  0 (samplePosition2)  0 (samplePosition3) 
0 (sampleLower)  
255 (sampleUpper)  
_{Sample information for the third sample}  
16 (bitOffset)  7 (= “8”) (bitLength)  1 (channelType) (  
0 (samplePosition0)  2 (samplePosition1)  0 (samplePosition2)  0 (samplePosition3) 
0 (sampleLower)  
255 (sampleUpper)  
_{Sample information for the fourth sample}  
24 (bitOffset)  7 (= “8”) (bitLength)  2 (channelType) (  
2 (samplePosition0)  2 (samplePosition1)  0 (samplePosition2)  0 (samplePosition3) 
0 (sampleLower)  
255 (sampleUpper) 
Table 33. Four cosited 8bit channels in the sRGB color space described by an 5entry, 3bit palette
Byte 0 (LSB)  Byte 1  Byte 2  Byte 3 (MSB) 

108 (totalSize)  
0 (vendorId)  0 (descriptorType)  
1 (versionNumber)  104 (descriptorBlockSize)  




0 (texelBlockDimension0)  0 (texelBlockDimension1)  0 (texelBlockDimension2)  0 (texelBlockDimension3) 
0 (bytesPlane0)  4 (bytesPlane1)  0 (bytesPlane2)  0 (bytesPlane3) 
0 (bytesPlane4)  0 (bytesPlane5)  0 (bytesPlane6)  0 (bytesPlane7) 
_{Sample information for the palette index}  
0 (bitOffset)  2 (= “3”) (bitLength)  0 (channelType) (irrelevant)  
0 (samplePosition0)  0 (samplePosition1)  0 (samplePosition2)  0 (samplePosition3) 
0 (sampleLower)  
4 (sampleUpper) — this specifies that there are 5 palette entries  
_{Sample information for the first sample}  
0 (bitOffset)  7 (= “8”) (bitLength)  0 (channelType) (  
0 (samplePosition0)  0 (samplePosition1)  0 (samplePosition2)  0 (samplePosition3) 
0 (sampleLower)  
255 (sampleUpper)  
_{Sample information for the second sample}  
8 (bitOffset)  7 (= “8”) (bitLength)  1 (channelType) (  
0 (samplePosition0)  0 (samplePosition1)  0 (samplePosition2)  0 (samplePosition3) 
0 (sampleLower)  
255 (sampleUpper)  
_{Sample information for the third sample}  
16 (bitOffset)  7 (= “8”) (bitLength)  2 (channelType) (  
0 (samplePosition0)  0 (samplePosition1)  0 (samplePosition2)  0 (samplePosition3) 
0 (sampleLower)  
255 (sampleUpper)  
_{Sample information for the fourth sample}  
24 (bitOffset)  7 (= “8”) (bitLength)  31 (channelType) (  
0 (samplePosition0)  0 (samplePosition1)  0 (samplePosition2)  0 (samplePosition3) 
0 (sampleLower)  
255 (sampleUpper) 
Table 34. Y′C_{B}C_{R} 4:2:0: BT.709 reducedrange data, with C_{B} and C_{R} aligned to the midpoint of the Y samples
Byte 0 (LSB)  Byte 1  Byte 2  Byte 3 (MSB) 

124 (totalSize)  
0 (vendorId)  0 (descriptorType)  
1 (versionNumber)  120 (descriptorBlockSize)  




1 (texelBlockDimension0)  1 (texelBlockDimension1)  0 (texelBlockDimension2)  0 (texelBlockDimension3) 
2 (bytesPlane0)  2 (bytesPlane1)  1 (bytesPlane2)  1 (bytesPlane3) 
0 (bytesPlane4)  0 (bytesPlane5)  0 (bytesPlane6)  0 (bytesPlane7) 
_{Sample information for the first Y sample}  
0 (bitOffset)  7 (= “8”) (bitLength)  0 (channelType) (  
0 (samplePosition0)  0 (samplePosition1)  0 (samplePosition2)  0 (samplePosition3) 
16 (sampleLower)  
235 (sampleUpper)  
_{Sample information for the second Y sample}  
8 (bitOffset)  7 (= “8”) (bitLength)  0 (channelType) (  
2 (samplePosition0)  0 (samplePosition1)  0 (samplePosition2)  0 (samplePosition3) 
16 (sampleLower)  
235 (sampleUpper)  
_{Sample information for the third Y sample}  
16 (bitOffset)  7 (= “8”) (bitLength)  0 (channelType) (  
0 (samplePosition0)  2 (samplePosition1)  0 (samplePosition2)  0 (samplePosition3) 
16 (sampleLower)  
235 (sampleUpper)  
_{Sample information for the fourth Y sample}  
24 (bitOffset)  7 (= “8”) (bitLength)  0 (channelType) (  
2 (samplePosition0)  2 (samplePosition1)  0 (samplePosition2)  0 (samplePosition3) 
16 (sampleLower)  
235 (sampleUpper)  
_{Sample information for the U sample}  
32 (bitOffset)  7 (= “8”) (bitLength)  1 (channelType) (  
1 (samplePosition0)  1 (samplePosition1)  0 (samplePosition2)  0 (samplePosition3) 
16 (sampleLower)  
240 (sampleUpper)  
_{Sample information for the V sample}  
36 (bitOffset)  7 (= “8”) (bitLength)  2 (channelType) (  
1 (samplePosition0)  1 (samplePosition1)  0 (samplePosition2)  0 (samplePosition3) 
16 (sampleLower)  
240 (sampleUpper) 
Table 35. 565 RGB packed 16bit format as written to memory by a bigendian architecture
Byte 0 (LSB)  Byte 1  Byte 2  Byte 3 (MSB) 

92 (totalSize)  
0 (vendorId)  0 (descriptorType)  
1 (versionNumber)  88 (descriptorBlockSize)  




0 (texelBlockDimension0)  0 (texelBlockDimension1)  0 (texelBlockDimension2)  0 (texelBlockDimension3) 
2 (bytesPlane0)  0 (bytesPlane1)  0 (bytesPlane2)  0 (bytesPlane3) 
0 (bytesPlane4)  0 (bytesPlane5)  0 (bytesPlane6)  0 (bytesPlane7) 
_{Sample information for the first sample: bit 0 belongs to green, bits 0..2 of channel in 13..15}  
13 (bitOffset)  2 (= “3”) (bitLength)  1 (channelType) (  
0 (samplePosition0)  0 (samplePosition1)  0 (samplePosition2)  0 (samplePosition3) 
0 (sampleLower)  
63 (sampleUpper)  
_{Sample information for the second sample: bits 3..5 of green in 0..2}  
0 (bitOffset)  2 (= “3”) (bitLength)  1 (channelType) (  
0 (samplePosition0)  0 (samplePosition1)  0 (samplePosition2)  0 (samplePosition3) 
0 (sampleLower) — ignored, taken from first sample  
0 (sampleUpper) — ignored, taken from first sample  
_{Sample information for the third sample}  
3 (bitOffset)  4 (= “5”) (bitLength)  2 (channelType) (  
0 (samplePosition0)  0 (samplePosition1)  0 (samplePosition2)  0 (samplePosition3) 
0 (sampleLower)  
31 (sampleUpper)  
_{Sample information for the fourth sample}  
8 (bitOffset)  4 (= “5”) (bitLength)  1 (channelType) (  
0 (samplePosition0)  0 (samplePosition1)  0 (samplePosition2)  0 (samplePosition3) 
0 (sampleLower)  
31 (sampleUpper) 
Table 36. R9G9B9E5 sharedexponent format
Byte 0 (LSB)  Byte 1  Byte 2  Byte 3 (MSB) 

124 (totalSize)  
0 (vendorId)  0 (descriptorType)  
1 (versionNumber)  120 (descriptorBlockSize)  




0 (texelBlockDimension0)  0 (texelBlockDimension1)  0 (texelBlockDimension2)  0 (texelBlockDimension3) 
4 (bytesPlane0)  0 (bytesPlane1)  0 (bytesPlane2)  0 (bytesPlane3) 
0 (bytesPlane4)  0 (bytesPlane5)  0 (bytesPlane6)  0 (bytesPlane7) 
_{Sample information for the R mantissa}  
0 (bitOffset)  8 (= “9”) (bitLength)  0 (channelType) (  
0 (samplePosition0)  0 (samplePosition1)  0 (samplePosition2)  0 (samplePosition3) 
0 (sampleLower)  
256 (sampleUpper) — mantissa at 1.0  
_{Sample information for the R exponent}  
27 (bitOffset)  4 (= “5”) (bitLength)  32 (channelType) (  
0 (samplePosition0)  0 (samplePosition1)  0 (samplePosition2)  0 (samplePosition3) 
0 (sampleLower)  
15 (sampleUpper) — exponent bias  
_{Sample information for the G mantissa}  
9 (bitOffset)  8 (= “9”) (bitLength)  1 (channelType) (  
0 (samplePosition0)  0 (samplePosition1)  0 (samplePosition2)  0 (samplePosition3) 
0 (sampleLower)  
256 (sampleUpper) — mantissa at 1.0  
_{Sample information for the G exponent}  
27 (bitOffset)  4 (= “5”) (bitLength)  33 (channelType) (  
0 (samplePosition0)  0 (samplePosition1)  0 (samplePosition2)  0 (samplePosition3) 
0 (sampleLower)  
15 (sampleUpper) — exponent bias  
_{Sample information for the B mantissa}  
18 (bitOffset)  8 (= “9”) (bitLength)  2 (channelType) (  
0 (samplePosition0)  0 (samplePosition1)  0 (samplePosition2)  0 (samplePosition3) 
0 (sampleLower)  
256 (sampleUpper) — mantissa at 1.0  
_{Sample information for the B exponent}  
27 (bitOffset)  4 (= “5”) (bitLength)  34 (channelType) (  
0 (samplePosition0)  0 (samplePosition1)  0 (samplePosition2)  0 (samplePosition3) 
0 (sampleLower)  
15 (sampleUpper) — exponent bias 
Table 37. Acorn 256color format (2 bits each independent RGB, 2 bits shared “tint”)
Byte 0 (LSB)  Byte 1  Byte 2  Byte 3 (MSB) 

108 (totalSize)  
0 (vendorId)  0 (descriptorType)  
1 (versionNumber)  120 (descriptorBlockSize)  




0 (texelBlockDimension0)  0 (texelBlockDimension1)  0 (texelBlockDimension2)  0 (texelBlockDimension3) 
1 (bytesPlane0)  0 (bytesPlane1)  0 (bytesPlane2)  0 (bytesPlane3) 
0 (bytesPlane4)  0 (bytesPlane5)  0 (bytesPlane6)  0 (bytesPlane7) 
_{Sample information for the R value and tint (shared low bits)}  
0 (bitOffset)  3 (= “4”) (bitLength)  0 (channelType) (  
0 (samplePosition0)  0 (samplePosition1)  0 (samplePosition2)  0 (samplePosition3) 
0 (sampleLower)  
15 (sampleUpper) — unique R upper value  
_{Sample information for the G tint (shared low bits)}  
0 (bitOffset)  1 (= “2”) (bitLength)  1 (channelType) (  
0 (samplePosition0)  0 (samplePosition1)  0 (samplePosition2)  0 (samplePosition3) 
0 (sampleLower)  
0 (sampleUpper) — ignored, not unique  
_{Sample information for the G unique (high) bits}  
4 (bitOffset)  1 (= “2”) (bitLength)  1 (channelType) (  
0 (samplePosition0)  0 (samplePosition1)  0 (samplePosition2)  0 (samplePosition3) 
0 (sampleLower)  
15 (sampleUpper) — unique G upper value  
_{Sample information for the B tint (shared low bits)}  
0 (bitOffset)  1 (= “2”) (bitLength)  2 (channelType) (  
0 (samplePosition0)  0 (samplePosition1)  0 (samplePosition2)  0 (samplePosition3) 
0 (sampleLower)  
0 (sampleUpper) — ignored, not unique  
_{Sample information for the B unique (high) bits}  
6 (bitOffset)  1 (= “2”) (bitLength)  2 (channelType) (  
0 (samplePosition0)  0 (samplePosition1)  0 (samplePosition2)  0 (samplePosition3) 
0 (sampleLower)  
15 (sampleUpper) — unique B upper value 
Table 38. V210 format (fullrange Y′C_{B}C_{R}) part 1 of 2
Byte 0 (LSB)  Byte 1  Byte 2  Byte 3 (MSB) 

220 (totalSize)  
0 (vendorId)  0 (descriptorType)  
1 (versionNumber)  216 (descriptorBlockSize) — 12 samples  




5 (dimension0)  0 (dimension1)  0 (dimension2)  0 (dimension3) 
16 (bytesPlane0)  0 (bytesPlane1)  0 (bytesPlane2)  0 (bytesPlane3) 
0 (bytesPlane4)  0 (bytesPlane5)  0 (bytesPlane6)  0 (bytesPlane7) 
_{Sample information for the shared U0/U1 value}  
0 (bitOffset)  9 (= “10”) (bitLength)  1 (channelType) (  
1 (assume midsited)  0  0  0 
0 (sampleLower)  
1023 (sampleUpper)  
_{Sample information for the Y′0 value}  
10 (bitOffset)  9 (= “10”) (bitLength)  0 (channelType) (  
0  0  0  0 
0 (sampleLower)  
1023 (sampleUpper)  
_{Sample information for the shared V0/V1 value}  
20 (bitOffset)  9 (= “10”) (bitLength)  2 (channelType) (  
1 (assume midsited)  0  0  0 
0 (sampleLower)  
1023 (sampleUpper)  
_{Sample information for the Y′1 value}  
32 (bitOffset)  9 (= “10”) (bitLength)  0 (channelType) (  
2  0  0  0 
0 (sampleLower)  
1023 (sampleUpper)  
_{Sample information for the shared U2/U3 value}  
42 (bitOffset)  9 (= “10”) (bitLength)  1 (channelType) (  
5 (assume midsited)  0  0  0 
0 (sampleLower)  
1023 (sampleUpper)  
_{Sample information for the Y′2 value}  
52 (bitOffset)  9 (= “10”) (bitLength)  0 (channelType) (  
4  0  0  0 
0 (sampleLower)  
1023 (sampleUpper) 
Table 39. V210 format (fullrange Y′C_{B}C_{R}) part 2 of 2
Byte 0 (LSB)  Byte 1  Byte 2  Byte 3 (MSB) 

_{Sample information for the shared V2/V3 value}  
64 (bitOffset)  9 (= “10”) (bitLength)  2 (channelType) (  
5 (assume midsited)  0  0  0 
0 (sampleLower)  
1023 (sampleUpper)  
_{Sample information for the Y′3 value}  
74 (bitOffset)  9 (= “10”) (bitLength)  0 (channelType) (  
6  0  0  0 
0 (sampleLower)  
1023 (sampleUpper)  
_{Sample information for the shared U4/U5 value}  
84 (bitOffset)  9 (= “10”) (bitLength)  1 (channelType) (  
9 (assume midsited)  0  0  0 
0 (sampleLower)  
1023 (sampleUpper)  
_{Sample information for the Y′4 value}  
96 (bitOffset)  9 (= “10”) (bitLength)  0 (channelType) (  
8  0  0  0 
0 (sampleLower)  
1023 (sampleUpper)  
_{Sample information for the shared V4/V5 value}  
106 (bitOffset)  9 (= “10”) (bitLength)  2 (channelType) (  
9 (assume midsited)  0  0  0 
0 (sampleLower)  
1023 (sampleUpper)  
_{Sample information for the Y′4 value}  
116 (bitOffset)  9 (= “10”) (bitLength)  0 (channelType) (  
10  0  0  0 
0 (sampleLower)  
1023 (sampleUpper) 
Table 40. Intensityalpha format showing aliased samples
Byte 0 (LSB)  Byte 1  Byte 2  Byte 3 (MSB) 

92 (totalSize)  
0 (vendorId)  0 (descriptorType)  
1 (versionNumber)  88 (descriptorBlockSize)  




0 (texelBlockDimension0)  0 (texelBlockDimension1)  0 (texelBlockDimension2)  0 (texelBlockDimension3) 
1 (bytesPlane0)  0 (bytesPlane1)  0 (bytesPlane2)  0 (bytesPlane3) 
0 (bytesPlane4)  0 (bytesPlane5)  0 (bytesPlane6)  0 (bytesPlane7) 
_{Sample information for the first sample}  
0 (bitOffset)  7 (= “8”) (bitLength)  0 (channelType) (  
0 (samplePosition0)  0 (samplePosition1)  0 (samplePosition2)  0 (samplePosition3) 
0 (sampleLower)  
255 (sampleUpper)  
_{Sample information for the second sample}  
0 (bitOffset)  7 (= “8”) (bitLength)  1 (channelType) (  
0 (samplePosition0)  0 (samplePosition1)  0 (samplePosition2)  0 (samplePosition3) 
0 (sampleLower)  
255 (sampleUpper)  
_{Sample information for the third sample}  
0 (bitOffset)  7 (= “8”) (bitLength)  2 (channelType) (  
0 (samplePosition0)  0 (samplePosition1)  0 (samplePosition2)  0 (samplePosition3) 
0 (sampleLower)  
255 (sampleUpper)  
_{Sample information for the fourth sample}  
0 (bitOffset)  7 (= “8”) (bitLength)  31 (channelType) (  
0 (samplePosition0)  0 (samplePosition1)  0 (samplePosition2)  0 (samplePosition3) 
0 (sampleLower)  
255 (sampleUpper) 
Table 41. A 48bit signed middleendian red channel: three cosited 16bit littleendian words, high word first
Byte 0 (LSB)  Byte 1  Byte 2  Byte 3 (MSB) 

76 (totalSize)  
0 (vendorId)  0 (descriptorType)  
1 (versionNumber)  72 (descriptorBlockSize)  




0 (texelBlockDimension0)  0 (texelBlockDimension1)  0 (texelBlockDimension2)  0 (texelBlockDimension3) 
6 (bytesPlane0)  0 (bytesPlane1)  0 (bytesPlane2)  0 (bytesPlane3) 
0 (bytesPlane4)  0 (bytesPlane5)  0 (bytesPlane6)  0 (bytesPlane7) 
_{Sample information for the first sample}  
32 (bitOffset)  15 (= “16”) (bitLength)  64 (channelType) (  
0 (samplePosition0)  0 (samplePosition1)  0 (samplePosition2)  0 (samplePosition3) 
0 (sampleLower) — ignored, overridden by second sample  
0 (sampleUpper) — ignored, overridden by second sample  
_{Sample information for the second sample}  
16 (bitOffset)  15 (= “16”) (bitLength)  64 (channelType) (  
0 (samplePosition0)  0 (samplePosition1)  0 (samplePosition2)  0 (samplePosition3) 
0x00000000 (sampleLower) — bottom 32 bits of sampleLower  
0xFFFFFFFF (sampleUpper) — bottom 32 bits of sampleUpper  
_{Sample information for the third sample}  
0 (bitOffset)  15 (= “16”) (bitLength)  64 (channelType) (  
0 (samplePosition0)  0 (samplePosition1)  0 (samplePosition2)  0 (samplePosition3) 
0xFFFF8000 (sampleLower) — top 16 bits of sampleLower, signextended  
0x7FFF (sampleUpper) — top 16 bits of sampleUpper 
Table 42. A single 16bit floatingpoint red value, described explicitly (example only!)
Byte 0 (LSB)  Byte 1  Byte 2  Byte 3 (MSB) 

76 (totalSize)  
0 (vendorId)  0 (descriptorType)  
1 (versionNumber)  72 (descriptorBlockSize)  




0 (texelBlockDimension0)  0 (texelBlockDimension1)  0 (texelBlockDimension2)  0 (texelBlockDimension3) 
2 (bytesPlane0)  0 (bytesPlane1)  0 (bytesPlane2)  0 (bytesPlane3) 
0 (bytesPlane4)  0 (bytesPlane5)  0 (bytesPlane6)  0 (bytesPlane7) 
_{Sample information for the first sample (mantissa)}  
0 (bitOffset)  9 (= “10”) (bitLength)  0 (channelType) (  
0 (samplePosition0)  0 (samplePosition1)  0 (samplePosition2)  0 (samplePosition3) 
0 (sampleLower)  
1024 (sampleUpper) — implicit 1  
_{Sample information for the second sample (sign bit)}  
15 (bitOffset)  0 (= “1”) (bitLength)  64 (channelType) (  
0 (samplePosition0)  0 (samplePosition1)  0 (samplePosition2)  0 (samplePosition3) 
0xFFFFFFFF (sampleLower)  
0x0 (sampleUpper)  
_{Sample information for the third sample (exponent)}  
10 (bitOffset)  4 (= “5”) (bitLength)  32 (channelType) (  
0 (samplePosition0)  0 (samplePosition1)  0 (samplePosition2)  0 (samplePosition3) 
15 (sampleLower) — bias  
30 (sampleUpper) — support for infinities (because 31 can be encoded) 
Table 43. A single 16bit floatingpoint red value, described normally
Byte 0 (LSB)  Byte 1  Byte 2  Byte 3 (MSB) 

44 (totalSize)  
0 (vendorId)  0 (descriptorType)  
1 (versionNumber)  40 (descriptorBlockSize)  




0 (texelBlockDimension0)  0 (texelBlockDimension1)  0 (texelBlockDimension2)  0 (texelBlockDimension3) 
2 (bytesPlane0)  0 (bytesPlane1)  0 (bytesPlane2)  0 (bytesPlane3) 
0 (bytesPlane4)  0 (bytesPlane5)  0 (bytesPlane6)  0 (bytesPlane7) 
_{Sample information}  
0 (bitOffset)  15 (= “16”) (bitLength)  192 (channelType) (  
0 (samplePosition0)  0 (samplePosition1)  0 (samplePosition2)  0 (samplePosition3) 
0xbf80000 (sampleLower) = 1.0  
0x3f80000 (sampleUpper) = 1.0 
A “color space” determines the meaning of decoded numerical color values: that is, it is distinct from the bit patterns, compression schemes and locations in memory used to store the data.
A color space consists of three basic components:
Transfer functions define the relationships between linear intensity and linear numbers in the encoding scheme. Since the human eye’s sensitivity to changes in intensity is nonlinear, a nonlinear encoding scheme typically allows improved visual quality at reduced storage cost.
Color primaries define the spectral response of a “pure color” in an additive color model  typically, what is meant by “red”, “green” and “blue” for a given system, and (allowing for the relative intensity of the primaries) consequently define the system’s white balance.
Color models describe the distinction between a color representation and additive colors. Since the human visual system treats differences in absolute intensity differently from differences in the spectrum composing a color, many formats benefit from transforming the color representation into one which can separate these aspects of color. Color models are frequently “named” by listing their component color channels.
Conversion between color representations may require a number of separate conversion operations:
Details of these conversion operations are described in the following chapters.
As described in the License Information at the start of this document, the Khronos Data Format Specification does not convey a right to implement the operations it describes. This is particularly true of the conversion formulae in the following sections, whose inclusion is purely informative. Please refer to the originating documents and the bodies responsible for the standards containing these formulae for the legal framework required for implementation. 
Common cases such as converting a Y′C_{B}C_{R} image encoded for 625line BT.601 to a Y′C_{B}C_{R} image encoded for BT.709 can involve multiple costly operations. An example is shown in the following diagram, which represents sampling from a Y′C_{B}C_{R} texture in one color space, and the operations needed to generate a different set of Y′C_{B}C_{R} values representing the color of the sample position in a different color space:
In this diagram, nonlinear luma Y′ channels are shown in black and white, color difference C_{B}/C_{R} channels are shown with the colors at the extremes of their range, and color primary channels are shown as the primary color and black. Linear representations are shown diagonally divided by a straight line; nonlinear representations are shown with a gamma curve. The luma and color difference representation is discussed in Section 15.1. The interpretation of color primaries is discussed in Section 14. Nonlinear transfer functions are described in Section 13. As described below, the diagram shows a 2×3 grid of input chroma texel values, corresponding to a 4×6 grid of luma texel values, since the chroma channels are stored at half the horizontal and half the vertical resolution of the luma channel (i.e. in “4:2:0” representation). Grayedout texel values do not contribute to the final output, and are shown only to indicate relative alignment of the coordinates.
The stages numbered in the above diagram show the following operations:
Range expansion to the correct range for the values in the color model (handled differently, for example, for “full” and “narrow” ranges); in this example, the result is to increase the effective dynamic range of the encoding: contrast and saturation are increased.
In this example, operations 1 and 2 can be combined into a single sparse matrix multiplication of the input channels, although actual implementations may wish to take advantage of the sparseness.
Application of a transfer function to convert from nonlinear R′G′B′ to linear RGB, using the color primaries of the input representation. In this case, the conversion might be the EOTF^{ 1} described in Section 13.2.
The separation of stages 4 and 5 is specific to the Y′C_{B}C_{R} to R′G′B′ color model conversion. Other representations such as Y′_{C}C′_{BC}C′_{RC} and IC_{T}C_{P} have more complex interactions between the color model conversion and the transfer function.
If the output is to be written to a frame buffer with reducedresolution chroma channels, chroma values for multiple samples need to be combined. Note that it is easy to introduce inadvertent chroma blurring in this operation if the source space chroma values are generated by interpolation.
In this example, generating the four linear RGB values required for linear interpolation at the magenta cross position requires six chroma samples. In the example shown, all four Y′ values fall between the same two chroma sample centers on the horizontal axis, and therefore recreation of these samples by linear blending on the horizontal axis only requires two horizontallyadjacent samples. However, the upper pair of Y′ values are sited above the sample position of the middle row of chroma sample centers, and therefore reconstruction of the corresponding chroma values requires interpolation between the upper four source chroma values. The lower pair of Y′ values are sited below the sample position of the middle row of chroma sample centers, and therefore reconstruction of the corresponding chroma values requires interpolation between the lower four source chroma values. In general, reconstructing four chroma values by interpolation may require four, six or nine source chroma values, depending on which samples are required. The worst case is reduced if chroma samples are aligned (“cosited”) with the luma values, or if chroma channel reconstruction uses replication (nearestneighbor filtering) rather than interpolation.
An approximation to the above conversion is depicted in the following diagram:
A performanceoptimized approximation to our example conversion may use the following steps:
Since stages 1 and 2 represent an affine matrix transform, linear interpolation of input values may equivalently be performed before these operations. This observation allows stages 1..4 to be combined into a single matrix transformation. 
Large areas of constant color will be correctly converted by this approximation. However, there are two sources of errors near color boundaries:
This approximation produces identical results to the more explicit sequence of operations in two cases:
As another example, the conversion from BT.709encoded Y′C_{B}C_{R} to sRGB R′G′B′ may be considered to be a simple model conversion (to BT.709 R′G′B′ nonlinear primaries using the “ITU” OETF), since sRGB shares the BT.709 color primaries and is defined as a complementary EOTF intended to be combined with BT.709’s OETF. This interpretation imposes a $\gamma \approx$ 1.1 OOTF. Matching the OOTF of a BT.709BT.1886 system, for which $\gamma \approx$ 1.2, implies using the BT.1886 EOTF to convert to linear light, then the sRGB EOTF^{ 1} to convert back to sRGB nonlinear space. Encoding linear scene light with linear OOTF means applying the BT.709 OETF^{ 1}; if the sRGB R′G′B′ target is itself intended to represent a linear OOTF, then the {R′_{sRGB}, G′_{sRGB}, B′_{sRGB}} should be calculated as:
The transfer function describes the mapping between a linear numerical representation and a nonlinear encoding. The eye is more sensitive to relative light levels than absolute light levels. That is, if one image region is twice as bright as another, this will be more visible than if one region is 10% brighter than another, even if the absolute difference in brightness is the same in both cases. To make use of the eye’s nonlinear response to light to provide better image quality with a limited number of quantization steps, it is common for color encodings to work with a nonlinear representation which dedicates a disproportionate number of bits to darker colors compared with lighter colors. The typical effect of this encoding is that midtones are stored with a larger (nearertowhite) numerical value than their actual brightness would suggest, and that midvalues in the nonlinear encoding typically represent darker intensities than their fraction of the representation of white would suggest.
The behavior has historically been approximated by a power function with an exponent conventionally called $\gamma$ : {R,G,B}_{nonlinear} = {R,G,B}_{linear}^{ $\gamma$ }. Hence this conversion is colloquially known as gamma correction.
Many practical transfer functions incorporate a small linear segment near 0, instead of being a pure power function. This linearity reduces the required resolution for representing the conversion, especially where results must be reversible, and also reduces the noise sensitivity of the function in an analog context. When combined with a linear segment, the power function has a different exponent from the pure power function that best approximates the resulting curve. 
A consequence of this nonlinear encoding is that many image processing operations should not be applied directly to the raw nonlinearlyencoded numbers, but require conversion back to a linear representation. For example, linear color gradients will appear distorted unless the encoding is adjusted to compensate for the encoding; CGI lighting calculations need linear intensity values for operation, and filtering operations require texel intensities converted to linear form.
In the following example, the checker patterns are filtered in the rightmost square of each row by averaging the checker colors, emulating a view of the pattern from a distance at which the individual squares are no longer distinct. The intended effect can be seen by viewing the diagram from a distance, or deliberately out of focus. The output is interpreted using the sRGB EOTF, approximating the behavior of a CRT with uncorrected signals. The background represents 50% gray.
Incorrectlyapplied transfer functions can also introduce color shifts, as demonstrated by the saturation change in the following examples:
A standard for image representation typically defines one or both of two types of transfer functions:
Some color models derive chroma (color difference) channels wholly or partly from nonlinear intensities. It is common for image representations which use these color models to use a reducedresolution representation of the chroma channels, since the human eye is less sensitive to high resolution chroma errors than to errors in brightness. Despite the color shift introduced by interpolating nonlinear values, these chroma channels are typically resampled directly in their native, nonlinear representation. 
The optooptical transfer function (OOTF) of a system is the relationship between linear input light intensity and displayed output light intensity: OOTF(input) = EOTF(OETF(input)). It is common for the OOTF to be nonlinear. For example, a brightlylit scene rendered on a display that is viewed in a dimlylit room will typically appear washedout and lacking contrast, despite mapping the full range of scene brightness to the full range supported by the display. A nonlinear OOTF can compensate for this by reducing the intensity of midtones, which is why television standards typically assume a nonlinear OOTF: logical scene light intensity is not proportional to logical display intensity.
In the following diagram, the upper pair of images are identical, as are the lower pair of images (which have midtones darkened but the same maximum brightness). Adaptation to the surround means that the top left and lower right images look similar.
In the context of a nonlinear OOTF, an application should be aware of whether operations on the image are intended to reflect the representation of colors in the scene or whether the intent is to represent the output color accurately, at least when it comes to the transfer function applied. For example, an application could choose to convert lighting calculations from a linear to nonlinear representation using the OETF (to match the appearance of lighting in the scene), but to perform image scaling operations using the EOTF in order to avoid introducing intensity shifts due to filtering. Working solely with the EOTF or OETF results in ignoring the intended OOTF of the system.
In practice, the OOTF is usually near enough to linear that this distinction is subtle and rarely worth making for computer graphics, especially since computergenerated images may be designed to be viewed in brighter conditions which would merit a linear OOTF, and since a lot of graphical content is inherently not photorealistic (or of limited realism, so that the transfer functions are not the most important factor in suspending disbelief). For video and photographic content viewed in darker conditions, the nonlinearity of the OOTF is significant. The effect of a nonlinear OOTF is usually secondary to the benefits of using nonlinear encoding to reduce quantization.
By convention, nonlinearlyencoded values are distinguished from linearlyencoded values by the addition of a prime (′) symbol. For example, (R,G,B) may represent a linear set of red, green and blue components; (R′,G′,B′) would represent the nonlinear encoding of each value. Typically the nonlinear encoding is applied to additive primary colors; derived color differences may or may not retain the prime symbol.
Charles Poynton provides a further discussion on “Gamma” in http://www.poynton.com/PDFs/TIDV/Gamma.pdf.
“ITU” is used in this context as a shorthand for the OETF shared by the current BT.601, BT.709 and BT.2020 family of standard dynamic range digital television production standards. The same OETF is shared by SMPTE 170M. The ITU does define other transfer functions, for example the PQ and HLG transfer functions described below (originating in BT.2100) and the list of EOTFs listed in BT.4706. 
The ITUT BT.601, BT.709 and BT.2020 specifications (for standard definition television, HDTV and UHDTV respectively), and SMPTE 170M, which defines NTSC broadcasts, define an optoelectrical transfer function. The (OETF) conversion from linear (R,G,B) encoding to nonlinear (R′,G′,B′) encoding is:
Where α = 1.0993 and β = 0.0181 for 12bit encoding in the BT.2020 specification, and $\alpha = 1.099$ and $\beta = 0.018$ otherwise.
From this the inverse (OETF^{ 1}) transformation can be deduced:
δ can be deduced from α × β^{0.45}  (α  1) ≈ 0.0812. Note that this is subtly different from 4.5 × β due to rounding. See the following section for the derivation of these values.
SMPTE 170M2004, which defines the behavior of NTSC televisions, defines the EOTF of the “reference reproducer” as the OETF^{ 1} function above, with δ explicitly written as 0.0812. Therefore the SMPTE 170M2004 EOTF^{ 1} equals the OETF given above. The “reference camera” of SMTPE 170M2004 has an OETF function matching that of the ITU specifications. That is, the OOTF of the system described in SMPTE 170M2004 provides a linear mapping of captured scene intensity to display intensity: the SMPTE 170M2004 OETF is described as being chosen to result in a linear OOTF on a typical display. This is distinct from the current ITU specifications, which assume a nonlinear OOTF. SMPTE 170M2004 also represents a change from the “assumed gamma” of 2.2 associated with most NTSC display devices as described in ITUT BT.4706 and BT.2043, although these standards also define a linear OOTF.
This “ITU” OETF is closely approximated by a simple power function with an exponent of 0.5 (and therefore the OETF^{ 1} is quite closely approximated by a simple power function with an exponent of 2.0); the linear segment and offset mean that the best match is not the exponent of 0.45 that forms part of the exact equation. ITU standards deliberately chose a different transfer curve from that of a typical CRT in order to introduce a nonlinear OOTF, as a means to compensate for the typically dim conditions in which a television is viewed. ITU BT.2087 refers to the approximation of the OETF with a square root $\left(\gamma = {1\over{2}}\right)$ function.
The following graph shows the close relationship between the ITU OETF (shown in red) and a pure power function with $\gamma={1\over{2}}$ (in blue). The difference between the curves is shown in black. The largest difference between the curve values at the same point when quantized to 8 bits is 15, mostly due to the sharp vertical gradient near 0.
SMPTE 170M2004 contains a note that the OETF is a more “technically correct” definition of the transfer function, and compares it to a “transfer gradient (gamma exponent) of 2.2” in previous specifications, and that the OETF in older documents is described as “1/2.2 (0.455…)”. While both versions define a linear OOTF, there is no explicit mention that curve has substantially changed; this might be due to conflation of the 0.455 exponent in older specifications with the 0.45 exponent in the new formulae. The ITU OETF is actually a closer match to a gamma exponent of $1\over{2.0}$ , as shown above; it is a relatively poor match to a gamma exponent of $1\over{2.2}$ ; the following graph shows the difference between the ITU OETF (shown in red) and a pure power function with $\gamma={1\over{2.2}}$ (in blue). The difference between the curves is shown in black. 
Using the 12bit encoding values for α and β from Rec.2020, there is an overlap around a nonlinear value of 0.08145. In other cases, the conversion from linear to nonlinear representation with encoding introduces a discontinuity between (0.018 × 4.500) = 0.081 and (1.099 × 0.018^{0.45}  0.099) ≈ 0.0812, corresponding to roughly a single level in a 12bit range. SMPTE 170M2004 provides formulae for both transformations and uses 0.0812 as a case selector for the nonlineartolinear transformation.
The values of α and β in the ITU function were apparently chosen such that the linear segment and power segment meet at the same value and with the same derivative (that is, the linear segment meets the power segment at a tangent). The α and β values can be derived as follows:
At {R,G,B} = β, the linear and nonlinear segments of the curve must calculate the same value:
Additionally, the derivatives of the linear and nonlinear segments of the curve must match:
The derivative can be rearranged to give the equation:
Substituting this into the original equation results in the following:
This simplifies to:
This can be solved numerically (for example by NewtonRaphson iteration), and results in values of:
The sRGB specification defines an electrooptical transfer function. The EOTF conversion from nonlinear $(R', G', B')$ encoding to linear $(R, G, B)$ encoding is:
The corresponding sRGB EOTF^{ 1} conversion from linear $(R, G, B)$ encoding to nonlinear $(R', G', B')$ encoding is:
The sRGB EOTF approximates a simple power function with an exponent of 2.2, which is intended to be consistent with legacy CRT content, particularly for NTSC devices, and to approximate the expected EOTF for BT.709 content, given the implicit OOTF used in production video content. sRGB is distinct from ITUT BT.1886, which offers a (different) reference EOTF for flat panels used for HDTV and is also intended to complement BT.709; in addition to the change in EOTF, sRGB specifies a reference display maximum luminance of 80cd/m^{2}, compared with 100cd/m^{2} for BT.1886. sRGB is also distinct from SMPTE 170M, which defines its EOTF as the inverse of its (and BT.709’s) OETF.
The following graph compares the sRGB EOTF (in red) and a pure power function with $\gamma=2.2$ (in blue); the area between the two curves is shown in black. The largest nonlinear difference at the same linear value when quantized to 8 bits is 3.
The sRGB standard assumes a quantization scheme in which 0.0 is represented by the value 0 and 1.0 is represented by 255. Despite the goal of complementing ITUT Rec. BT.709, this is different from the ITU “fullrange” encoding scheme defined in ITUT Rec. BT.2100, which represents 1.0 as a power of two (not $2^n1$ ) and therefore cannot exactly represent 1.0. 
The following graph shows the relationship between the sRGB EOTF (shown in red) and the ITU OETF (shown in blue). The result of applying the two functions in turn, resulting in the OOTF of a combined ITUsRGB system, is shown in black. Since the sRGB EOTF approximates a power function with $\gamma=2.2$ and the ITU OETF approximates a power function with $\gamma=2.0$ , also shown in green is the resulting OOTF corresponding to a power function with $\gamma={2.2\over{2.0}}=1.1$ .
The original sRGB specification was defined only in terms of positive values between 0 and 1. Subsequent standards, such as scRGB annex B, use the same transfer function but expand the range to incorporate values less than 0 and greater than 1.0. In these cases, when the input channel to the conversion is negative, the output should be the negative version of the conversion applied to the absolute value of the input. That is:
scRGB annex B changes the behavior of the $\{R,G,B\} = 0.0031308$ case compared with the sRGB specification. Since both calculations agree to seven decimal places, this is unlikely to be significant in most applications. scRGB annex B does not define the EOTF^{ 1}, so the formulae below are derived by extending the sRGB formulae. 
sYCC includes a hint that a 1cd/m^{2} level of flare should be assumed for the reference 80cd/m^{2} output, and that the black level should therefore be assumed to be ${1\over 80} = 0.0125$ . It notes that the nonlinear sRGB { $R',G',B'$ } values can be corrected as follows: \begin{align*}
E_{sYCC} &= \begin{cases}
0.0125  \left({10.0125\over 1.055^{2.4}}\right)
\times (0.055  E'_{sRGB})^{2.4},
& E'_{sRGB} \leq 0.04045\ [\textrm{sic}]\\
0.0125 + {10.0125\over 12.92} \times
E'_{sRGB},
& 0.04045 \leq E'_{sRGB} \leq 0.04045 \\
0.0125 + \left({10.0125\over 1.055^{2.4}}\right)
\times (0.055 + E'_{sRGB})^{2.4},
& E'_{sRGB} > 0.04045
\end{cases}\\
E_{sYCC} &= (\textrm{linear}) \{R_{sYCC},G_{sYCC},B_{sYCC}\} \\
E'_{sRGB} &= (\textrm{nonlinear}) \{R'_{sRGB},G'_{sRGB},B'_{sRGB}\}
\end{align*} This is equivalent to applying $E_{sYCC} = 0.0125 + {1\over 10.0125} \times E_{sRGB}$ to linear $\{R,G,B\}$ values. The resulting linear $E_{sYCC}$ values then need to be nonlinearly encoded with the EOTF. 
Similar to the ITU transfer function, the EOTF^{ 1} of the sRGB function can be written as:
Like the ITU transfer function above, the values of $\alpha$ and $\beta$ in the sRGB function appear to have been chosen such that the linear segment and power segment meet at the same value and with the same derivative (that is, the linear segment meets the power segment at a tangent). The $\alpha$ and $\beta$ values can be derived as follows:
At $\{R',G',B'\} = \beta$ , the linear and nonlinear segments of the function must calculate the same value:
Additionally, the derivatives of the linear and nonlinear segments of the function must match:
This formula can be rearranged to give $\alpha$ in terms of $\beta$ :
Substituting this into the formula for $\{R,G,B\}$ :
This equation simplifies to:
This can be further simplified to:
The value of $\beta$ can be found numerically (for example by NewtonRaphson iteration, with a derivative of $1.41.4\beta^{{1\over{2.4}}}$ ), and results in values of:
Where $\delta$ is the value of the EOTF^{ 1} at $\{R',G',B'\} = \beta$ .
These deduced values are appreciably different from those in the sRGB specification, which does not state the origin of its constants. The intersection point of the sRGB EOTF has less numerical stability (and more nearby local minima in curves being optimized) that the corresponding ITU function  it is sensitive to the start value used for numerical approximations. This may explain how different values were reached for the sRGB specification. However, the errors both in value and derivative at the point of selection between the linear and exponent segments are small in practice. 
The EOTF can be written with these derived values as:
Apple describes the Display P3 color space as using the sRGB transfer function. The profile viewer in Apple’s ColorSync utility reports that the EOTF is of the following form: $$f(x) = \begin{cases}
cx, & x < d \\
(ax+b)^\gamma, & x \geq d
\end{cases}$$ The reported figures for $\gamma=2.4,\ a=0.948,\ b=0.52$ and $c=0.077$ correspond to the equivalent values in the sRGB specification: \begin{align*}
{1\over{\alpha}} &\approx 0.948 = a\\
{{\alpha1}\over\alpha} &\approx 0.52 = b\\
{1\over{12.92}} &\approx 0.077 = c
\end{align*} These values are correct to the reported precision both for the value $\alpha = 1.055$ in the sRGB specification and for the more precise $\alpha \approx 1.055010718947587$ derived above.
However, where the sRGB specification states that $\delta = 0.04045$ , the profile viewer reports a corresponding d = 0.039. The disparity can be explained if the profile values have been derived as described in this section: $$\delta \approx 0.039293370676848\approx 0.039 = d$$ Note that this value assumes a correspondingly corrected version of $\alpha$ rather than $a = 1.055$ .
The extra precision may be needed over the constants in the sRGB specification due to the use of additional bits of accuracy in the Display P3 representation, which may expose a discontinuity due to rounding with the original numbers, particularly in the gradient of the curve. However, this distinction is subtle: when calculated over a [0..1] range, the derived EOTF and EOTF^{ 1} agree with the official sRGB formulae to greater than 16bit precision. 
Without allowing for adjusting the $\alpha = 1.055$ constant in the sRGB formula, the power function cannot be made to intersect perfectly at a tangent to the linear segment with gradient of 12.92. However, the intersection point $\beta$ can be found by solving:
This equation can give us a slightly more precise pair of values for the original sRGB equation:
In practice this makes no measurable difference, but does suggest that the values of $\beta = 0.0031308$ in the sRGB specification may have been incorrectly rounded.
The BT.1886 standard for the “Reference electrooptical transfer function for flat panel displays used in HDTV studio production” is intended to represent a typical OETF for CRTs and to document this to ensure consistency between other display technologies:
L = screen luminance in cd/m^{2} 
V = input signal normalized to [0..1] 
a = user gain (legacy “contrast”) 
b = black level lift (legacy “brightness”) 
$\gamma$ = 2.4 
If L_{W} is the screen luminance of maximum white and L_{B} is the screen luminance of minimum black:
ITU BT.2087 proposes the use of a simple power function with a $\gamma = 2.4$ as an approximation to this EOTF for the purposes of color conversion, effectively assuming b = 0 and L_{B} is pure black. The reference display described in BT.1886 has a maximum luminance level of 100cd/m^{2} (brighter than the equivalent sRGB reference display).
The following graph shows the relationship between the BT.1886 EOTF (shown in red) and the ITU OETF such as used for BT.709 (shown in blue). The result of applying the two functions in turn, resulting in the OOTF of a combined BT.709BT.1886 system, is shown in black. Since the ITU OETF approximates a power function with $\gamma=2.0$ , also shown in green is the resulting OOTF corresponding to a power function with $\gamma={2.4\over{2.0}}=1.2$ .
BT.1886 also offers an alternative EOTF which may provide a better match to CRT measured luminance than the standard formula listed above: \begin{align*}
L &= \begin{cases}
k(V_C+b)^{(\alpha_1\alpha_2)}(V+b)^{\alpha_2}, & V < V_C \\
k(V+b)^{\alpha_1}, & V_C \leq V
\end{cases}
\end{align*}

HLG (and PQ, below) are intended to allow a better encoding of highdynamicrange content compared with the standard ITU OETF.
The BT.21001 Hybrid Log Gamma description defines the following OETF for linear scene light:
$E$ = the $R_S$ , $G_S$ or $B_S$ color component of linear scene light, normalized to [0..1] 
$E'$ = the resulting nonlinear $R_S'$ , $G_S'$ or $B_S'$ nonlinear scene light value in in the range [0..1] 
a = 0.17883277 
b = $1  4\times a = 0.28466892$ 
c = $0.5  a\times ln(4\times a) \approx 0.55991073$ 
BT.21000, in note 5b, defines these formulae equivalently, but slightly differently: $$E'_\mathit{norm} = \textrm{OETF}(E) = \begin{cases}
\sqrt{3E}, & 0 \leq E \leq {1\over{12}} \\
a \times \textrm{ln}(E  b_0) + c_0, & {1\over{12}} < E \leq 1
\end{cases}$$ This formulation in BT.21000 uses different constants for b and c (a is unmodified), as follows:
These variations can be derived from the BT.21001 numbers as: \begin{align*}
a \times \textrm{ln}((12 \times E)  b_1)+ c_1 & = a \times \textrm{ln}\left(12\times\left(E  {b_1\over{12}}\right)\right) + c_1\\
& = a \times \textrm{ln}\left(E  {{b_1}\over{12}}\right) + a\times\textrm{ln}(12) + c_1 \\
{{b_1}\over{12}} = {{0.28466892}\over{12}} &= 0.023772241 = b_0 \\
a\times\textrm{ln}(12) + c_1 = 0.17883277\times\textrm{ln}(12) + 0.55991073 &= 1.00429347 = c_0
\end{align*} 
The OETF^{ 1} of normalized HLG is:
a, b and c are defined as for the normalized HLG OETF. BT.21000 again defines an equivalent formula without the $1\over{12}$ scale factor in the ${1\over 2}$ < $E' \leq 1$ term, using the modified b_{0} and c_{0} constants described in the note in the HLG OETF above.
BT.21001 (the current version at the time of writing) includes an apparent typographical error in its definition of the OETF^{ 1}, providing both the equation with E normalized to the range [0..1] and the (legacy) equation with E normalized to the range [0..12], without explanation. 
BT.21000 describes the HLG OETF formulae with E “normalized” to the range [0..12], with the variant with the range normalized to [0..1] as an alternative. Only the variant normalized to the range [0..1] is described in the updated version of the specification, BT.21001.
$E'$ = the $R_S$ , $G_S$ or $B_S$ color component of linear scene light, normalized to [0..12] 
$E_S'$ = the resulting nonlinear $R_S'$ , $G_S'$ or $B_S'$ value in in the range [0..1] 
a = 0.17883277 
b = 0.28466892 
c = 0.55991073 
Note that these constants are the same as those used in the BT.21001 version of the normalized formulae.
The OETF^{ 1} of “unnormalized” HLG (producing E in the range [0..12]) is:
a, b and c are defined as for the unnormalized HLG OETF.
BT.21000 describes this “unnormalized” version of the formulae, with the variant with the E normalized to [0..1] as an alternative. Only the variant with E normalized to [0..1] is described in the updated version, BT.21001.
HLG constants appear to have chosen a, b and c to meet the following constraints, which are easiest to express in terms of the unnormalized OETF^{ 1}:
The derivative of the $0 \leq E' \leq {1\over 2}$ term of the unnormalized EOTF^{ 1} has the same value as the derivative of the ${1\over 2}$ < $E' \leq 1$ term of the unnormalized EOTF^{ 1} at $E' = {1\over 2}$ :
The $0 \leq E' \leq {1\over 2}$ term of the unnormalized EOTF^{ 1} has the same value as the ${1\over 2}$ < $E'\leq 1$ term of the unnormalized EOTF^{ 1} at $E' = {1\over 2}$ :
At E' = 1, the ${1\over 2}$ < $E'$ term of the unnormalized EOTF^{ 1} = 12:
This last equation can be solved numerically to find:
With this precision, more accurate values of the other constants are:
The b = 0.28466892 official figure assumes the rounded a = 0.17883277 value as an input to the b = $1  4\times a$ relation.
No explanation for the choice of [0..12] range in the official version of the formula is explicitly offered in BT.21000 (it does not, for example, appear to relate to the BT.1886 OOTF $\gamma = 1.2$ combined with the $10\times$ ratio between the 1000cd/m^{2} of a standard HLG HDR TV and the 100cd/m^{2} of a standard dynamic range set). However, allowing for the difference in the maximum display brightness of HDR and SDR systems there is deliberate (scaled) compatibility between the HLG OETF and the BT.2020 OETF (which itself approximates a square root function) over much of the encodable dynamic range of a BT.2020 system. Since HDR content is intended to support accurate highlights more than to maintain a higher persistent screen brightness (many HDR displays can only support maximum brightness in a small area or over a small period without overheating), agreement over a significant chunk of the tone curve allows a simple adaptation between HDR and SDR devices: fed HLGencoded content, an SDR display may represent darker tones accurately and simply underrepresent highlights. The origins of both HLG and PQ are discussed in ITUR BT.2390.
As graphed in ITUR BT.2390, the “unnormalized” HLG OETF (red) is a good approximation to the standard dynamic range ITU transfer function (blue, output scaled by 0.5) up to $E \approx 1$ and $\textrm{OETF}(E) = E' \approx 0.5$ , with a smooth curve up to the maximum HLG representable scene light value of “12”: 
The OOTF of HLG is described as:
where R_{D}, G_{D} and B_{D} describe the luminance of the displayed linear component in cd/m^{2} and R_{S}, G_{S} and B_{S} describe each color component in scene linear light, scaled by camera exposure and normalized to the representable range.
BT.2100 notes that some legacy displays apply the $\gamma$ function to each channel separately, rather than to the luminance component. That is, $\{R_D,G_D,B_D\}=\alpha\times\{R_S,G_S,B_S\}^\gamma+\beta$ . This is an approximation to the official OOTF. 
Y_{S} is the normalized scene luminance, defined as:
$\beta$ represents the black level (display “brightness”):
$\alpha$ represents the black level (display “contrast”):
Scene light normalized to [0..1]  Scene light normalized to [0..12]  

$\alpha$  ${L_W  L_B}$  ${{L_W  L_B}\over{\left(12\right)^\gamma}}$ 
L_{W} is the nominal peak luminance of the display in cd/m^{2}, and L_{B} is the display luminance of black in cd/m^{2}.
BT.21001 (the current version at the time of writing) includes an apparent typographical error in its definition of the OOTF, providing both the equation with scene light normalized to the range [0..1] and the (legacy) equation with scene light normalized to the range [0..12], without explanation. 
$\gamma = 1.2$ for a nominal peak display luminance of 1000cd/m^{2}. For displays with higher peak luminance or if peak luminance is reduced through a contrast control, $\gamma = 1.2 + 0.42\times \textrm{log}_{10}\left({L_W\over 1000}\right)$ .
For the purposes of general conversion, L_{W} can be assumed to be 1000cd/m^{2}, and L_{B} can be approximated as 0, removing the constant offset from the above equations and meaning $\gamma=1.2$ .
The EOTF of BT.2100 HLG is defined in terms of the OETF and OOTF defined above:
Using the formula from the OOTF leads to the following relationship between Y_{D} and Y_{S}:
From this, the following relations can be derived:
For processing without knowledge of the display, $\alpha$ can be treated as 1.0cd/m^{2} and $\beta$ can be considered to be 0.0cd/m^{2}. This simplifies the equations as follows:
Unlike BT.2100 HLG and other ITU broadcast standards, PQ is defined in terms of an EOTF (mapping from the encoded values to the display output), not an OETF (mapping from captured scene content to the encoded values). 
The BT.2100 Perceptual Quantization description defines the following EOTF:
$E'$ is a nonlinear color channel $\{R',G',B'\}$ or $\{L',M',S'\}$ encoded as PQ in the range [0..1]. $F_D$ is the luminance of the displayed component in cd/m^{2} (where the luminance of an $\{R_D,G_D,B_D\}$ or $Y_D$ or $I_D$ component is considered to be the luminance of the color with all channels set to the same value as the component). When $R'=G'=B'$ the displayed pixel is monochromatic. $Y$ is a linear color value normalized to [0..1].
The corresponding EOTF^{ 1} is:
The OOTF of PQ matches that of BT.1886's EOTF combined with BT.709's OETF:
where E is one of $\{R_S,G_S,B_S,Y_S,I_S\}$ , the linear representation of scene light scaled by camera exposure and in the range [0..1], G_{1886} is the EOTF described in BT.1886, and G_{709} is the OETF described in BT.709 with a scale factor of 59.5208 applied to E:
ITUR BT.2390 explains the derivation of the scale factor:
PQ can encode 100 times the display brightness of a standard dynamic range (“SDR”) encoding (10000cd/m^{2} compared with the 100cd/m^{2} SDR reference display described in BT.1886). High dynamic range (HDR) displays are intended to represent the majority of scene content within a “standard” dynamic range, and exposure of a normalized SDR signal is chosen to provide suitable exposure. HDR displays offer extra capability for representation of small or transient highlights (few HDR displays can actually reach the maximum 10000cd/m^{2} encodable brightness, and few HDR displays can maintain their maximum intensity over a large area for an extended period without overheating). Therefore the behavior of HDR displays is intended to approximate a conventional standard dynamic range display for most of the image, while retaining the ability to encode extreme values.
As described in BT.2390, the OOTF of SDR is roughly $\gamma = 1.2$ (deviating from this curve more near a 0 value), so the maximum scene light intensity that can be represented is roughly $100^{1\over 1.2} \approx 46.42$ times that of a SDR encoding.
Using exact equations from BT.709 and BT.1886 to create the OOTF, rather than the $\gamma = 1.2$ approximation, the maximum representable scene brightness, if 1.0 is the maximum normalized SDR brightness is: \begin{align*}
\left({100^{1\over 2.4} + 0.099\over 1.099}\right)^{1\over 0.45} &\approx 59.5208
\end{align*} The other constants in the G_{709} formula are derived as follows: \begin{align*}
{0.018\over 59.5208} &\approx 0.0003024 \\
4.5\times 59.5208 &\approx 267.84
\end{align*} Note that these constants differ slightly if the more accurate $\alpha = 1.0993$ figure from BT.2020 is used instead of 1.099. 
The OETF of PQ is described in terms of the above OOTF:
The PQ OOTF^{ 1} is:
where F_{D}, display intensity, is one of $\{R_D,G_D,B_D,Y_D,I_D\}$ , and E is the corresponding normalized scene intensity.
DCI P3 defines a simple power function with an exponent of 2.6 (applied to scaled CIE XYZ values).
That is:
This power function is applied directly to scaled CIE XYZ color coordinates: the “primaries” in DCI define the bounds of the gamut, but the actual color encoding uses XYZ coordinates. DCI scales the resulting nonlinear values to the range [0..4095] prior to quantization, rounding to nearest.
“Display P3” uses the sRGB transfer function, modified in some implementations to have more accurate constants (see the section on the derivation of the sRGB constants). 
ITUR BT.4706, which has now been deprecated, lists a number of regional TV standard variants; an updated list of variant codes used by country is defined in ITUR BT.2043. This standard, along with eCFR title 47 section 73.682, documents a simple EOTF power function with $\gamma = 2.2$ for NTSC display devices.
This value of $\gamma$ is also used for N/PAL signals in the Eastern Republic of Uruguay, and was also adopted by ST240.
Combined with the reference in SMPTE 170M to a $\gamma = 2.2$ being used in “older documents”, this suggests a linear design OOTF for NTSC systems.
ITUR BT.1700, which partly replaced BT.470, also describes an “assumed gamma of display device” of 2.2 for PAL and SECAM systems; this is distinct from the $\gamma = 2.8$ value listed in ITUR BT.4706. Combined with the ITU OETF which approximates $\gamma = {1\over{2.0}}$ , the PAL OOTF retains a $\gamma \approx 1.1$ when this value of $\gamma = 2.2$ is used for the EOTF, similar to the figure described under the legacy PAL EOTF.
In contrast, ITUR BT.1700 also includes SMPTE 170m, which defines the assumed EOTF of the display device as being the inverse of the current ITU OETF. Hence the new NTSC formulation also assumes a linear OOTF.
ITUR BT.472, “Videofrequency characteristics of a television system to be used for the international exchange of programmes between countries that have adopted 625line colour or monochrome systems”, defines that the “gamma of the picture signal” should be “approximately 0.4”. The reciprocal of this value is 2.5.
That is, this standard defines an approximate OETF and OETF^{ 1} for PAL content:
ITUR BT.4706, which has now been deprecated in favor of BT.1700, lists a number of regional TV standard variants; an updated list of variant codes used by country is defined in ITUR BT.2043.
This specification describes a simple EOTF power function with $\gamma_{\textrm{EOTF}} = 2.8$ for most PAL and SECAM display devices:
Poynton describes a $\gamma$ of 2.8 as being “unrealistically high” for actual CRT devices. 
Combined with the corresponding legacy EOTF with $\gamma_{\textrm{EOTF}} = 0.4$ , the described system OOTF is:
Or $\gamma_{\textrm{OOTF}} \approx 1.12$ .
The value of $\gamma_{\textrm{EOTF}} = 2.8$ is described in BT.4706 as being chosen for “an overall system gamma” (OOTF power function exponent) of “approximately 1.2”; this suggests that the “approximately 0.4” exponent in BT.4726 should be interpreted as nearer to ${1.2\over{2.8}} \approx 0.43$ , or at least that there was enough variation in early devices for precise formulae to be considered irrelevant.
The EOTF power function of $\gamma_{\textrm{EOTF}} = 2.2$ described in BT.1700 combines with the ITU OETF described in BT.601 (which approximates $\gamma_{\textrm{OETF}} \approx 0.5$ ) to give a similar system $\gamma_{\textrm{OOTF}} \approx 1.1$ . As described above, the ITU OETF combined with the BT.1886 EOTF results in a more strongly nonlinear $\gamma_{\textrm{OOTF}} \approx {2.4\over{2.0}} = 1.2$ . 
The ST240, formerly SMPTE240M, interim standard for HDTV defines the following OETF:
Like SMPTE170m, ST240 defines a linear OOTF. Therefore the above relationship also holds for the EOTF^{ 1}.
The EOTF, and also OETF^{ 1}, is:
The Adobe RGB (1998) specification defines the following transfer function (notable for not including a linear component):
2.19921875 is obtained from $2{51\over{256}}$ or hexadecimal 2.33. Therefore the inverse transfer function is:
The Sony SLog OETF is defined for each color channel as:
Linear camera input scaled by exposure t ranges from 0 to 10.0; y is the nonlinear encoded value.
The OETF^{ 1} is:
The encoded nonlinear value t ranges from 0 to 1.09; Y is the linear scene light.
SLog2 defines the following OETF:
x is the IRE in scenelinear space. y is the IRE in SLog2 space.
The OETF^{ 1} is:
x is the IRE in SLog2 space. y is the IRE in scenelinear space.
A reflection is calculated by multiplying an IRE by 0.9.
ACES is scenereferred; therefore ACEScc defines an OETF.
For each linear color channel lin_{AP1} transformed to the ACEScc primaries, the ACEScc nonlinear encoding is:
ACES is scenereferred; therefore ACEScct defines an OETF.
For each linear color channel lin_{AP1} transformed to the ACEScc primaries, the ACEScct nonlinear encoding is:
Color primaries define the interpretation of each color channel of the color model, particularly with respect to the RGB color model. In the context of a typical display, color primaries describe the color of the red, green and blue phosphors or filters.
Primaries are typically defined using the CIE 1931 XYZ color space, which is a color space which preserves the linearity of light intensity. Consequently, the transform from linearintensity (R, G, B) to (X, Y, Z) is a simple matrix multiplication. Conversion between two sets of (R, G, B) color primaries can be performed by converting to the (X, Y, Z) space and back.
The (X, Y, Z) space describes absolute intensity. Since most standards do not make a requirement about the absolute intensity of the display, color primaries are typically defined using the x and y components of the xyY color space, in which the Y channel represents linear luminance. xyY is related to XYZ via the following formulae:
This is relevant because, although the brightness of the display in a color space definition is typically undefined, the white point is known: the x and y coordinates in xyY color space which corresponds to equal amounts of R, G and B. This makes it possible to determine the relative intensities of these color primaries.
Many color standards use the CIE D65 standard illuminant as a white point. D65 is intended to represent average daylight, and has a color temperature of approximately 6500K. In CIE 1931 terms, this white point is defined in ITU standards as $x=0.3127,\ y=0.3290$ , but elsewhere given as $x=0.312713,\ y=0.329016$ . Different coordinates will affect the conversion matrices given below. The definition of the D65 white point is complicated by the constants in Planck’s Law (which is a component in calculating the white point from the color temperature) having been revised since D65 was standardized, such that the standard formula for calculating CIE coordinates from the color temperature do not agree with the D65 standard. The actual color temperature of D65 is nearer to $6500\times {1.4388\over 1.438} \approx 6503.6\textrm{K}$ . 
Assuming an arbitrary white luminance (Y value) of 1.0, it is possible to express the following identity for the X, Y and Z coordinates of each color channel R, G and B, and of the white point W:
The identities $X = Y{x\over{y}}$ and $Z = Y{{(1xy)}\over{y}}$ can be used to reexpress the above terms in the xyY space:
This equation for W_{Z} can be simplified to:
Since $R_Y + G_Y + B_Y = W_Y = 1$ , this further simplifies to:
The $R_Y+G_Y+B_Y$ term for W_{Y} can be multiplied by $R_x\over{R_y}$ and subtracted from the equation for W_{X}:
Similarly, the $R_Y+G_Y+B_Y$ term can be multiplied by $1R_x\over{R_y}$ and subtracted from the simplified W_{Z} line:
Finally, the G_{Y} term can be eliminated by multiplying the former of these two equations by ${1G_x\over{G_y}}{1R_x\over{R_y}}$ and subtracting it from the latter multiplied by ${G_x\over{G_y}}{R_x\over{R_y}}$ , giving:
Thus:
This allows G_{Y} to be calculated by rearranging an earlier equation:
And finally:
These relative magnitudes allow the definition of vectors representing the color primaries in the XYZ space, which in turn provides a transformation between colors specified in terms of the color primaries and the XYZ space. Without an absolute magnitude the transformation to XYZ is incomplete, but sufficient to allow transformation to another set of color primaries.
The transform from the defined color primaries to XYZ space is:
The transform from XYZ space to the defined color primaries is therefore:
These transforms assume that the black point for the color space is at $(X, Y, Z) = (0, 0, 0)$ . If the black point is nonzero, these transforms require a translational component. In some color spaces the black point has the same color as the white point, in which case it is also possible to adjust the $(R, G, B)$ values outside the matrix. 
ITUT BT.709 (HDTV) defines the following chromaticity coordinates:
These chromaticity coordinates are also shared by sRGB and scRGB.
Therefore to convert from linear color values defined in terms of BT.709 color primaries to XYZ space the formulae in Section 14 result in the following matrix:
The inverse transformation, from the XYZ space to a color defined in terms of BT.709 color primaries, is:
sYCC lists a slightly different version of this matrix, possibly due to rounding errors. 
ITUT Rec.601 defines different color primaries for 625line systems (as used in most PAL systems) and for 525line systems (as used in the SMPTE 170M2004 standard for NTSC).
The following chromaticity coordinates are defined for 625line “EBU” systems:
BT.4706, which also describes these constants in a legacy context, approximates D65 as $x = 0.313,\ y = 0.329$ . 
Therefore to convert from linear color values defined in terms of BT.601 color primaries for 625line systems to XYZ space the formulae in Section 14 result in the following matrix:
The inverse transformation, from the XYZ space to a color defined in terms of BT.601 “EBU” 625line color primaries, is:
ITUT Rec.601 defines different color primaries for 625line systems (as used in most PAL systems) and for 525line systems (as used in the SMPTE 170M2004 standard for NTSC).
The following chromaticity coordinates are defined in BT.601 for 525line digital systems and in SMPTE170M:
Therefore to convert from linear color values defined in terms of BT.601 color primaries for 525line systems to XYZ space the formulae in Section 14 result in the following matrix:
The inverse transformation, from the XYZ space to a color defined in terms of BT.601 525line color primaries, is:
Analog 525line PAL systems used a different white point, and therefore have a different conversion matrix. 
The following chromaticity coordinates are defined in BT.2020 for ultrahighdefinition television:
The same primaries are used for BT.2100 for HDR TV.
Therefore to convert from linear color values defined in terms of BT.2020 color primaries to XYZ space the formulae in Section 14 result in the following matrix:
The inverse transformation, from the XYZ space to a color defined in terms of BT.2020 color primaries, is:
The following chromaticity coordinates are defined in ITUR BT.4706 and SMPTE 170m as a reference to the legacy NTSC standard:
These primaries apply to the 1953 revision of the NTSC standard. Modern NTSC systems, which reflect displays that are optimized for brightness over saturation, use the color primaries as described in Section 14.3. The white point used in the original NTSC 1953 specification is CIE Standard Illuminant C, 6774K, as distinct from the CIE Illuminant D65 white point used by most modern standards. BT.4706 notes that SECAM systems may use these NTSC primaries and white point. Japanese legacy NTSC systems used the same primaries but with the white point set to Dwhite at 9300K. 
Therefore to convert from linear color values defined in terms of NTSC 1953 color primaries to XYZ space the formulae in Section 14 result in the following matrix:
The inverse transformation, from the XYZ space to a color defined in terms of NTSC 1953 color primaries, is:
ITUR BT.1700 defines the following chromaticity coordinates for legacy 525line PAL systems:
This matches the color primaries from SMPTE170m analog NTSC and BT.601 525line encoding, but the white point used is CIE Standard Illuminant C, 6774K, as distinct from the CIE Illuminant D65 white point used by most modern standards. 
Therefore to convert from linear color values defined in terms of PAL 525line color primaries to XYZ space the formulae in Section 14 result in the following matrix:
The inverse transformation, from the XYZ space to a color defined in terms of PAL 525line 1953 color primaries, is:
The following chromaticity coordinates are defined in SMPTE ST 20651
Therefore to convert from linear color values defined in terms of ACES color primaries to XYZ space the formulae in Section 14 result in the following matrix:
The inverse transformation, from the XYZ space to a color defined in terms of ACES color primaries, is:
The following chromaticity coordinates are defined in Academy S2016001 (ACEScct) and S2014003 (ACEScc), which share the same primaries:
Therefore to convert from linear color values defined in terms of ACEScc/ACEScct color primaries to XYZ space the formulae in Section 14 result in the following matrix:
The inverse transformation, from the XYZ space to a color defined in terms of ACEScc/ACEScct color primaries, is:
The following chromaticity coordinates are defined in Display P3:
The DCI P3 color space defines the bounds of its gamut using these primaries, but actual color data in DCI P3 is encoded using CIE XYZ coordinates. Display P3, on the other hand, uses these values as primaries in an RGB color space, with a D65 white point. 
Therefore to convert from linear color values defined in terms of Display P3 color primaries to XYZ space the formulae in Section 14 result in the following matrix:
The inverse transformation, from the XYZ space to a color defined in terms of DisplayP3 color primaries, is:
$$\left(\begin{array}{c} R_{\textrm{DisplayP3}} \\ G_{\textrm{DisplayP3}} \\ B_{\textrm{DisplayP3}}\end{array}\right) \approx \left(\begin{array}{ccc} 2.4934969119, & 0.9313836179, & 0.4027107845 \\ 0.8294889696, & 1.7626640603, & 0.0236246858 \\ 0.0358458302, & 0.0761723893, & 0.9568845240\end{array}\right) \left(\begin{array}{c}X \\ Y \\ Z\end{array}\right) $$These matrices differ from those given in SMPTE EG 4321 due to the choice of a D65 white point in Display P3. The matrices in 4321 can be reproduced by applying a white point of $W_x = 0.314,\ W_y = 0.351$ to the above primaries. 
The following chromaticity coordinates are defined in Adobe RGB (1998):
Therefore to convert from linear color values defined in terms of Adobe RGB (1998) color primaries to XYZ space the formulae in Section 14 result in the following matrix:
The inverse transformation, from the XYZ space to a color defined in terms of Adobe RGB (1998) color primaries, is:
Adobe RGB (1998) defines a reference display white brightness of 160cd/m^{2} and a black point 0.34731% of this brightness, or 0.5557cd/m^{2}, for a contrast ratio of 287.9. The black point has the same color temperature as the white point, and this does not affect the above matrices.
Conversion from BT.709 to BT.601 625line primaries can be performed using the matrices in Section 14.1 and Section 14.2 as follows:
Conversion from BT.601 625line to BT.709 primaries can be performed using these matrices:
Conversion from BT.709 to BT.2020 primaries can be performed using the matrices in Section 14.4 and Section 14.1 as follows:
Conversion from BT.2020 primaries to BT.709 primaries can be performed with the following matrices:
The human eye is more sensitive to highfrequency changes in intensity (absolute quantity of light) than to highfrequency changes in the dominant wavelength and saturation of a color. Additionally the eye does not exhibit equal sensitivity to all wavelengths. Many image representations take advantage of these facts to distribute the number of bits used to represent a texel in a more perceptuallyuniform manner than is achieved by representing the color primaries independently  for example by encoding the chroma information at a reduced spatial resolution.
Color models based on color differences are often referred to with incorrect or ambiguous terminology, the most common of which is YUV.
In the broadcast standards which define these models:
Color differences are calculated from the nonlinear Y′ and color components as:
Note that, for R′, G′, B′ in the range [0..1]:
Using this terminology, the following conversion formulae can be derived:
For the inverse conversion:
The formula for G′ can be derived by substituting the formulae for R′ and B′ into the derivation of Y′:
The values chosen for K_{R} and K_{B} vary between standards.
The required color model conversion between $Y'C_BC_R$ and $R'G'B'$ can typically be deduced from other color space parameters: 
ITU Rec.709 defines K_{R} = 0.2126 and K_{B} = 0.0722.
That is, for conversion between (R′, G′, B′) defined in BT.709 color primaries and using the ITU transfer function:
Alternatively:
For the inverse conversion:
ITU Rec.601 defines K_{R} = 0.299 and K_{B} = 0.114.
That is, for conversion between (R′, G′, B′) defined in BT.601 EBU color primaries or BT.601 SMPTE color primaries, and using the ITU transfer function:
Alternatively:
For the inverse conversion:
ITU Rec.2020 and ITU Rec.2100 define K_{R} = 0.2627 and K_{B} = 0.0593.
That is, for conversion between (R′, G′, B′) defined in BT.2020 color primaries and using the ITU transfer function:
Alternatively:
For the inverse conversion:
ST240, formerly SMPTE 240M, defines K_{R} = 0.212 and K_{B} = 0.087.
That is, for conversion using the ST240 transfer function:
Alternatively:
For the inverse conversion:
ITUT Rec. BT.2020 introduced a “constant luminance” color representation as an alternative representation to Y′C_{B}C_{R}:
This terminology follow’s BT.2020’s convention of describing the continuous values as $Y'_C$ , $C'_\mathit{BC}$ and $C'_\mathit{RC}$ ; BT.2020 uses $\mathit{DY}'_C$ , $\mathit{DC}'_\mathit{BC}$ and $\mathit{DC}'_\mathit{RC}$ to represent the quantized integer representations of the same values.
$Y'_C$ is derived from applying a nonlinear transfer function to a combination of linear $\mathit{RGB}$ components and applying a nonlinear transfer function to the result, but the $C'_\mathit{BC}$ and $C'_\mathit{RC}$ color differences still encode differences between nonlinear values. 
The inverse transformation can be derived from the above:
Performing these calculations requires conversion between a linear representation and a nonlinear transfer function during the transformation. This is distinct from the nonconstantluminance case, which is a simple matrix transform. 
ITUT Rec. BT.2100 introduced a “constant intensity” color representation as an alternative representation to Y′C_{B}C_{R}:
Note that the suffix _{D} indicates that PQ encoding is displayreferred and the suffix _{S} indicates that HLG encoding is scenereferred — that is, they refer to display and scene light respectively.
To invert this, it can be observed that:
The formulae in the previous sections are described in terms of operations on continuous values. These values are typically represented by quantized integers. There are standard encodings for representing some color models within a given bit depth range.
ITU broadcast standards typically reserve values at the ends of the representable integer range for rounding errors and for signal control data. The nominal range of representable values between these limits is represented by the following encodings, for bit depth n = {8, 10, 12}:
The dequantization formulae are therefore:
For consistency with $Y'_CC'_\mathit{BC}C'_\mathit{RC}$ , these formulae use the BT.2020 and BT.2100 terminology of prefixing a D to represent the digital quantized encoding of a numerical value.
That is, in “narrow range” encoding:
Value  Continuous encoding value  Quantized encoding 

Black  {R′, G′, B′, Y′, $Y'_C$ , I} = 0.0  {DR′, DG′, DB′, DY′, $\mathit{DY}'_C$ , DI} = $16 \times 2^{n8}$ 
Peak brightness  {R′, G′, B′, Y′, $Y'_C$ , I} = 1.0  {DR′, DG′, DB′, DY′, $\mathit{DY}'_C$ , DI} = $235 \times 2^{n8}$ 
Minimum color difference value  { $C'_B$ , $C'_R$ , $C'_\mathit{BC}$ , $C'_\mathit{RC}$ , C_{T}, C_{P}} = 0.5  { $\mathit{DC}'_B$ , $\mathit{DC}'_R$ , $\mathit{DC}'_\mathit{BC}$ , $\mathit{DC}'_\mathit{CR}$ , DC_{T}, DC_{P}} = $16 \times 2^{n8}$ 
Maximum color difference value  { $C'_B$ , $C'_R$ , $C'_\mathit{BC}$ , $C'_\mathit{RC}$ , C_{T}, C_{P}} = 0.5  { $\mathit{DC}'_B$ , $\mathit{DC}'_R$ , $\mathit{DC}'_\mathit{BC}$ , $\mathit{DC}'_\mathit{CR}$ , DC_{T}, DC_{P}} = $240 \times 2^{n8}$ 
Achromatic colors  R′ = G′ = B′ { $C'_B$ , $C'_R$ , $C'_\mathit{BC}$ , $C'_\mathit{RC}$ , C_{T}, C_{P}} = 0.0  { $\mathit{DC}'_B$ , $\mathit{DC}'_R$ , $\mathit{DC}'_\mathit{BC}$ , $\mathit{DC}'_\mathit{CR}$ , DC_{T}, DC_{P}} = $128 \times 2^{n8}$ 
If, instead of the quantized values, the input is interpreted as fixedpoint values in the range 0.0..1.0, as might be the case if the values were treated as unsigned normalized quantities in a computer graphics API, the following conversions can be applied instead:
ITUT Rec. BT.21001 and the current Rec. T.871 JFIF specification define the following quantization scheme that does not incorporate any reserved headroom or footroom, which is optional and described as “full range” in BT.2100, and integral to Rec. T.871.
Both these specifications modify a definition used in previous versions of their specifications, which is described below. 
For bit depth n = {8 (JFIF),10,12 (Rec.2100)}:
BT.21001 defines Round() as:
Note that a chroma channel value of exactly 0.5 corresponds to a quantized encoding of $2^n$ , and must therefore be clamped to the nominal peak value of $2^n1$ . Narrowrange encoding does not have this problem. A chroma channel value of 0.5 corresponds to a quantized encoding of 1, which is the nominal minimum peak value.
In Rec. T.871 (which defines only n = 8), the corresponding formula is:
Allowing for the clamping at a chroma value of 0.5, these formulae are equivalent across the expected 0.5..0.5 range for chroma and 0.0..1.0 range for luma values.
The dequantization formulae are therefore:
That is, in “full range” encoding:
Value  Continuous encoding value  Quantized encoding 

Black  {R′, G′, B′, Y′, $Y'_C$ , I} = 0.0  {DR′, DG′, DB′, DY′, $\mathit{DY}'_C$ , DI} = 0 
Peak brightness  {R′, G′, B′, Y′, $Y'_C$ , I} = 1.0  {DR′, DG′, DB′, DY′, $\mathit{DY}'_C$ , DI} = 2^{n}  1 
Minimum color difference value  { $C'_B$ , $C'_R$ , $C'_\mathit{BC}$ , $C'_\mathit{RC}$ , C_{T}, C_{P}} = 0.5  { $\mathit{DC}'_B$ , $\mathit{DC}'_R$ , $\mathit{DC}'_\mathit{BC}$ , $\mathit{DC}'_\mathit{CR}$ , DC_{T}, DC_{P}} = 1 
Maximum color difference value  { $C'_B$ , $C'_R$ , $C'_\mathit{BC}$ , $C'_\mathit{RC}$ , C_{T}, C_{P}} = 0.5  { $\mathit{DC}'_B$ , $\mathit{DC}'_R$ , $\mathit{DC}'_\mathit{BC}$ , $\mathit{DC}'_\mathit{CR}$ , DC_{T}, DC_{P}} = $2^n  1$ (clamped) 
Achromatic colors  R′ = G′ = B′ { $C'_B$ , $C'_R$ , $C'_\mathit{BC}$ , $C'_\mathit{RC}$ , C_{T}, C_{P}} = 0.0  { $\mathit{DC}'_B$ , $\mathit{DC}'_R$ , $\mathit{DC}'_\mathit{BC}$ , $\mathit{DC}'_\mathit{CR}$ , DC_{T}, DC_{P}} = 2^{n1} 
If, instead of the quantized values, the input is interpreted as fixedpoint values in the range 0.0..1.0, as might be the case if the values were treated as unsigned normalized quantities in a computer graphics API, the following conversions can be applied instead:
ITUT Rec. BT.21000 formalized an optional encoding scheme that does not incorporate any reserved headroom or footroom. The legacy JFIF specification similarly used the full range of 8bit channels to represent $Y'C_BC_R$ color. For bit depth n = {8 (JFIF),10,12 (Rec.2100)}:
The dequantization formulae are therefore:
These formulae map luma values of 1.0 and chroma values of 0.5 to $2^n$ , for bit depth $n$ . This has the effect that the maximum value (e.g. pure white) cannot be represented directly. Outofbounds values must be clamped to the largest representable value. 
ITUR BT.21000 dictates that in 12bit coding, the largest values encoded should be 4092 (“for consistency” with 10bit encoding, with a maximum value of 1023). This slightly reduces the maximum intensity which can be expressed, and slightly reduces the saturation range. The achromatic color point is still 2048 in the 12bit case, so no offset is applied in the transformation to compensate for this range reduction. 
If, instead of the quantized values, the input is interpreted as fixedpoint values in the range 0.0..1.0, as might be the case if the values were treated as unsigned normalized quantities in a computer graphics API, the following conversions can be applied instead:
That is, to match the behavior described in these specifications, the inputs to color model conversion should be expanded such that the maximum representable value is that defined by the quantization of these encodings $\left({255\over 256},\ {1023\over 1024}\ \textrm{or}\ {4095\over 4096}\right)$ , and the inverse operation should be applied to the result of the model conversion.
For example, a legacy shaderbased JPEG decoder may read values in a normalized 0..1 range, where the inmemory value 0 represents 0.0 and the inmemory value 1 represents 1.0. The decoder should scale the Y′ value by a factor of $255\over 256$ to match the encoding in the JFIF3 document, and $C'_B$ and C_{R} should be scaled by $255\over 256$ and offset by 0.5. After the model conversion matrix has been applied, the R′, G′ and B′ values should be scaled by $256\over 255$ , restoring the ability to represent pure white.
For computer graphics, a number of texture compression schemes exist, which both reduce the overall texture memory footprint and reduce the bandwidth requirements of using the textures. In this context, “texture compression” is distinct from “image compression” in that texture compression schemes are designed to allow efficient random access as part of texture sampling. “Image compression” can further reduce image redundancy by considering the image as a whole, but doing so is impractical for efficient texture access operations.
The common compression schemes are “blockbased”, and rely on similarities between nearby texel regions to describe “blocks” of nearby texels in a unit:
As can be seen above, the compression schemes have a number of features in common — particularly in having a number of endpoints described encoded in some of the bits of the texel block. For consistency and to make the terms more concise, the following descriptions use some slightly unusual terminology:
The value X_{n}^{m} refers to bit m (starting at 0) of the n^{th} X value. For example, R_{1}^{3} would refer to bit 3 of red value 1 — R, G, B and A (capitalized and italicized) are generally used to refer to color channels. Similarly, R_{1}^{2..3} refers to bits 2..3 of red value 1.
Although unusual, this terminology should be unambiguous (e.g. none of the formats require exponentiation of arguments).
This description is derived from the EXT_texture_compression_s3tc extension.
Compressed texture images stored using the S3TC compressed image formats are represented as a collection of 4×4 texel blocks, where each block contains 64 or 128 bits of texel data. The image is encoded as a normal 2D raster image in which each 4×4 block is treated as a single pixel. If an S3TC image has a width or height that is not a multiple of four, the data corresponding to texels outside the image are irrelevant and undefined.
When an S3TC image with a width of w, height of h, and block size of blocksize (8 or 16 bytes) is decoded, the corresponding image size (in bytes) is:
When decoding an S3TC image, the block containing the texel at offset (x, y) begins at an offset (in bytes) relative to the base of the image of:
The data corresponding to a specific texel (x, y) are extracted from a 4×4 texel block using a relative (x, y) value of
There are four distinct S3TC image formats:
Each 4×4 block of texels consists of 64 bits of RGB image data.
Each RGB image data block is encoded as a sequence of 8 bytes, called (in order of increasing address):
The 8 bytes of the block are decoded into three quantities:
color_{0} and color_{1} are 16bit unsigned integers that are unpacked to RGB colors RGB_{0} and RGB_{1} as though they were 16bit unsigned packed pixels with the R channel in the high 5 bits, G in the next 6 bits and B in the low 5 bits:
bits is a 32bit unsigned integer, from which a twobit control code is extracted for a texel at location (x, y) in the block using:
where bits[31] is the most significant and bits[0] is the least significant bit.
The RGB color for a texel at location (x, y) in the block is given in Table 44.
Table 44. Block decoding for BC1
Texel value  Condition 

RGB_{0}  color_{0} > color_{1} and code(x, y) = 0 
RGB_{1}  color_{0} > color_{1} and code(x, y) = 1 
$(2\times \mathit{RGB}_0 + \mathit{RGB}_1)\over 3$  color_{0} > color_{1} and code(x, y) = 2 
$(\mathit{RGB}_0 + 2\times RGB_1)\over 3$  color_{0} > color_{1} and code(x, y) = 3 
RGB_{0}  color_{0} ≤ color_{1} and code(x, y) = 0 
RGB_{1}  color_{0} ≤ color_{1} and code(x, y) = 1 
$(\mathit{RGB}_0+\mathit{RGB}_1)\over 2$  color_{0} ≤ color_{1} and code(x, y) = 2 
BLACK  color_{0} ≤ color_{1} and code(x, y) = 3 
Arithmetic operations are done per component, and BLACK refers to an RGB color where red, green, and blue are all zero.
Since this image has an RGB format, there is no alpha component and the image is considered fully opaque.
Each 4×4 block of texels consists of 64 bits of RGB image data and minimal alpha information. The RGB components of a texel are extracted in the same way as BC1 with no alpha.
The alpha component for a texel at location (x, y) in the block is given by Table 45.
Table 45. BC1 with alpha
Alpha value  Condition 

0.0  color_{0} ≤ color_{1} and code(x, y) = 3 
1.0  otherwise 
The red, green, and blue components of any texels with a final alpha of 0 should be encoded as zero (black).
Figure 17 shows an example BC1 texel block: color_{0}, encoded as $\left({{29}\over{31}}, {{60}\over{63}}, {{1}\over{31}}\right)$ , and color_{1}, encoded as $\left({{20}\over{31}}, {{2}\over{63}}, {{30}\over{31}}\right)$ , are shown as circles. The interpolated values are shown as small diamonds. Since 29 > 20, there are two interpolated values, accessed when code(x, y) = 2 and code(x, y) = 3. Figure 18 shows the example BC1 texel block with the colors swapped: color_{0}, encoded as $\left({{20}\over{31}}, {{2}\over{63}}, {{30}\over{31}}\right)$ , and color_{1}, encoded as $\left({{29}\over{31}}, {{60}\over{63}}, {{1}\over{31}}\right)$ , are shown as circles. The interpolated value is shown as a small diamonds. Since 20 ≤ 29, there is one interpolated value for code(x, y) = 2, and code(x, y) = 3 represents (R, G, B) = (0, 0, 0). If the format is BC1 with alpha, code(x, y) = 3 is transparent (alpha = 0). If the format is BC1 with no alpha, code(x, y) = 3 represents opaque black. 
Each 4×4 block of texels consists of 64 bits of uncompressed alpha image data followed by 64 bits of RGB image data.
Each RGB image data block is encoded according to the BC1 formats, with the exception that the two code bits always use the nontransparent encodings. In other words, they are treated as though color_{0} > color_{1}, regardless of the actual values of color_{0} and color_{1}.
Each alpha image data block is encoded as a sequence of 8 bytes, called (in order of increasing address):
The 8 bytes of the block are decoded into one 64bit integer:
alpha is a 64bit unsigned integer, from which a fourbit alpha value is extracted for a texel at location (x, y) in the block using:
where bits[63] is the most significant and bits[0] is the least significant bit.
The alpha component for a texel at location (x, y) in the block is given by $\mathit{alpha}(x,y)\over 15$ .
Each 4×4 block of texels consists of 64 bits of compressed alpha image data followed by 64 bits of RGB image data.
Each RGB image data block is encoded according to the BC1 formats, with the exception that the two code bits always use the nontransparent encodings. In other words, they are treated as though color_{0} > color_{1}, regardless of the actual values of color_{0} and color_{1}.
Each alpha image data block is encoded as a sequence of 8 bytes, called (in order of increasing address):
The alpha_{0} and alpha_{1} are 8bit unsigned bytes converted to alpha components by multiplying by $1\over 255$ .
The 6 bits bytes of the block are decoded into one 48bit integer:
bits is a 48bit unsigned integer, from which a threebit control code is extracted for a texel at location (x, y) in the block using:
where bits[47] is the mostsignificant and bits[0] is the leastsignificant bit.
The alpha component for a texel at location (x, y) in the block is given by Table 46.
Table 46. Alpha encoding for BC3 blocks
Alpha value  Condition 

alpha_{0}  code(x, y) = 0 
alpha_{1}  code(x, y) = 1 
$(6\times\mathit{alpha}_0 + 1\times\mathit{alpha}_1)\over 7$  alpha_{0} > alpha_{1} and code(x, y) = 2 
$(5\times\mathit{alpha}_0 + 2\times\mathit{alpha}_1)\over 7$  alpha_{0} > alpha_{1} and code(x, y) = 3 
$(4\times\mathit{alpha}_0 + 3\times\mathit{alpha}_1)\over 7$  alpha_{0} > alpha_{1} and code(x, y) = 4 
$(3\times\mathit{alpha}_0 + 4\times\mathit{alpha}_1)\over 7$  alpha_{0} > alpha_{1} and code(x, y) = 5 
$(2\times\mathit{alpha}_0 + 5\times\mathit{alpha}_1)\over 7$  alpha_{0} > alpha_{1} and code(x, y) = 6 
$(1\times\mathit{alpha}_0 + 6\times\mathit{alpha}_1)\over 7$  alpha_{0} > alpha_{1} and code(x, y) = 7 
$(4\times\mathit{alpha}_0 + 1\times\mathit{alpha}_1)\over 5$  alpha_{0} ≤ alpha_{1} and code(x, y) = 2 
$(3\times\mathit{alpha}_0 + 2\times\mathit{alpha}_1)\over 5$  alpha_{0} ≤ alpha_{1} and code(x, y) = 3 
$(2\times\mathit{alpha}_0 + 3\times\mathit{alpha}_1)\over 5$  alpha_{0} ≤ alpha_{1} and code(x, y) = 4 
$(1\times\mathit{alpha}_0 + 4\times\mathit{alpha}_1)\over 5$  alpha_{0} ≤ alpha_{1} and code(x, y) = 5 
0.0  alpha_{0} ≤ alpha_{1} and code(x, y) = 6 
1.0  alpha_{0} ≤ alpha_{1} and code(x, y) = 7 
This description is derived from the “RGTC Compressed Texture Image Formats” section of the OpenGL 4.5 specification.
Compressed texture images stored using the RGTC compressed image encodings are represented as a collection of 4×4 texel blocks, where each block contains 64 or 128 bits of texel data. The image is encoded as a normal 2D raster image in which each 4×4 block is treated as a single pixel. If an RGTC image has a width or height that is not a multiple of four, the data corresponding to texels outside the image are irrelevant and undefined.
When an RGTC image with a width of w, height of h, and block size of blocksize (8 or 16 bytes) is decoded, the corresponding image size (in bytes) is:
When decoding an RGTC image, the block containing the texel at offset $(x,y)$ begins at an offset (in bytes) relative to the base of the image of:
The data corresponding to a specific texel (x, y) are extracted from a 4×4 texel block using a relative (x, y) value of
There are four distinct RGTC image formats described in the following sections.
Each 4×4 block of texels consists of 64 bits of unsigned red image data.
Each red image data block is encoded as a sequence of 8 bytes, called (in order of increasing address):
The 6 bits_{{0..5}} bytes of the block are decoded into a 48bit bit vector:
red_{0} and red_{1} are 8bit unsigned integers that are unpacked to red values RED_{0} and RED_{1} by multiplying by $1\over 255$ .
bits is a 48bit unsigned integer, from which a threebit control code is extracted for a texel at location (x, y) in the block using:
where bits[47] is the mostsignificant and bits[0] is the leastsignificant bit.
The red value R for a texel at location (x, y) in the block is given by Table 47.
Table 47. Block decoding for BC4
R value  Condition 

RED_{0}  red_{0} > red_{1}, code(x, y) = 0 
RED_{1}  red_{0} > red_{1}, code(x, y) = 1 
${ 6 \times \mathit{RED}_0 + \mathit{RED}_1 } \over 7$  red_{0} > red_{1}, code(x, y) = 2 
${ 5 \times \mathit{RED}_0 + 2 \times \mathit{RED}_1 } \over 7$  red_{0} > red_{1}, code(x, y) = 3 
${ 4 \times \mathit{RED}_0 + 3 \times \mathit{RED}_1 } \over 7$  red_{0} > red_{1}, code(x, y) = 4 
${ 3 \times \mathit{RED}_0 + 4 \times \mathit{RED}_1 } \over 7$  red_{0} > red_{1}, code(x, y) = 5 
${ 2 \times \mathit{RED}_0 + 5 \times \mathit{RED}_1 } \over 7$  red_{0} > red_{1}, code(x, y) = 6 
${ \mathit{RED}_0 + 6 \times \mathit{RED}_1 } \over 7$  red_{0} > red_{1}, code(x, y) = 7 
RED_{0}  red_{0} ≤ red_{1}, code(x, y) = 0 
RED_{1}  red_{0} ≤ red_{1}, code(x, y) = 1 
${ 4 \times \mathit{RED}_0 + \mathit{RED}_1 } \over 5$  red_{0} ≤ red_{1}, code(x, y) = 2 
${ 3 \times \mathit{RED}_0 + 2 \times \mathit{RED}_1 } \over 5$  red_{0} ≤ red_{1}, code(x, y) = 3 
${ 2 \times \mathit{RED}_0 + 3 \times \mathit{RED}_1 } \over 5$  red_{0} ≤ red_{1}, code(x, y) = 4 
${ \mathit{RED}_0 + 4 \times \mathit{RED}_1 } \over 5$  red_{0} ≤ red_{1}, code(x, y) = 5 
RED_{min}  red_{0} ≤ red_{1}, code(x, y) = 6 
RED_{max}  red_{0} ≤ red_{1}, code(x, y) = 7 
RED_{min} and RED_{max} are 0.0 and 1.0 respectively.
Since the decoded texel has a red format, the resulting RGBA value for the texel is (R, 0, 0, 1).
Each 4×4 block of texels consists of 64 bits of signed red image data. The red values of a texel are extracted in the same way as BC4 unsigned except red_{0}, red_{1}, RED_{0}, RED_{1}, RED_{min}, and RED_{max} are signed values defined as follows:
red_{0} and red_{1} are 8bit signed (two’s complement) integers.
CAVEAT: For signed red_{0} and red_{1} values: the expressions red_{0} > red_{1} and red_{0} ≤ red_{1} above are considered undefined (read: may vary by implementation) when red_{0} = 127 and red_{1} = 128. This is because if red_{0} were remapped to 127 prior to the comparison to reduce the latency of a hardware decompressor, the expressions would reverse their logic. Encoders for the signed redgreen formats should avoid encoding blocks where red_{0} = 127 and red_{1} = 128.
Each 4×4 block of texels consists of 64 bits of compressed unsigned red image data followed by 64 bits of compressed unsigned green image data.
The first 64 bits of compressed red are decoded exactly like BC4 unsigned above. The second 64 bits of compressed green are decoded exactly like BC4 unsigned above except the decoded value R for this second block is considered the resulting green value G.
Since the decoded texel has a redgreen format, the resulting RGBA value for the texel is (R, G, 0, 1).
Each 4×4 block of texels consists of 64 bits of compressed signed red image data followed by 64 bits of compressed signed green image data.
The first 64 bits of compressed red are decoded exactly like BC4 signed above. The second 64 bits of compressed green are decoded exactly like BC4 signed above except the decoded value R for this second block is considered the resulting green value G.
Since this image has a redgreen format, the resulting RGBA value is (R, G, 0, 1).
This description is derived from the “BPTC Compressed Texture Image Formats” section of the OpenGL 4.5 specification. More information on BC7, BC7 modes and BC6h can be found in Microsoft’s online documentation.
Compressed texture images stored using the BPTC compressed image formats are represented as a collection of 4×4 texel blocks, each of which contains 128 bits of texel data stored in littleendian order. The image is encoded as a normal 2D raster image in which each 4×4 block is treated as a single pixel. If a BPTC image has a width or height that is not a multiple of four, the data corresponding to texels outside the image are irrelevant and undefined. When a BPTC image with width w, height h, and block size blocksize (16 bytes) is decoded, the corresponding image size (in bytes) is:
When decoding a BPTC image, the block containing the texel at offset (x, y) begins at an offset (in bytes) relative to the base of the image of:
The data corresponding to a specific texel (x, y) are extracted from a 4×4 texel block using a relative (x, y) value of:
There are two distinct BPTC image formats each of which has two variants. BC7 with or without an sRGB transform function used in the encoding of the RGB channels compresses 8bit unsigned, normalized fixedpoint data. BC6H in signed or unsigned form compresses high dynamic range floatingpoint values. The formats are similar, so the description of the BC6H format will reference significant sections of the BC7 description.
Each 4×4 block of texels consists of 128 bits of RGBA image data, of which the RGB channels may be encoded linearly or with the sRGB transfer function.
Each block contains enough information to select and decode a number of colors called endpoints, pairs of which forms subsets, then to interpolate between those endpoints in a variety of ways, and finally to remap the result into the final output by indexing into these interpolated values according to a partition layout which maps each relative coordinate to a subset.
Each block can contain data in one of eight modes. The mode is identified by the lowest bits of the lowest byte. It is encoded as zero or more zeros followed by a one. For example, using ‘x’ to indicate a bit not included in the mode number, mode 0 is encoded as xxxxxxx1 in the low byte in binary, mode 5 is xx100000, and mode 7 is 10000000. Encoding the low byte as zero is reserved and should not be used when encoding a BPTC texture; hardware decoders processing a texel block with a low byte of 0 should return 0 for all channels of all texels.
All further decoding is driven by the values derived from the mode listed in Table 48 and Table 49. The fields in the block are always in the same order for all modes. In increasing bit order after the mode, these fields are: partition pattern selection, rotation, index selection, color, alpha, perendpoint Pbit, shared Pbit, primary indices, and secondary indices. The number of bits to be read in each field is determined directly from these tables, as shown in Table 50.
Per texel block, CB = 3(each of R, G, B)×2(endpoints)×NS(#subsets)×CB(bits/channel/endpoint). AB = 2(endpoints)×NS(#subsets)×AB(bits/endpoint). {IB,IB_{2}} = 16(texels)×{IB,IB_{2}}(#index bits/texel)  NS(1bit/subset). 
Table 48. Modedependent BPTC parameters
Mode  NS  PB  RB  ISB  CB  AB  EPB  SPB  IB  IB_{2}  M  CB  AB  EPB  SPB  IB  IB_{2}  
Bits per…  …texel block  …channel/endpoint  …endpoint  …subset  …texel  Bits per texel block (total)  
0  3  4  0  0  4  0  1  0  3  0  1  72  0  6  0  45  0  
1  2  6  0  0  6  0  0  1  3  0  2  72  0  0  2  46  0  
2  3  6  0  0  5  0  0  0  2  0  3  90  0  0  0  29  0  
3  2  6  0  0  7  0  1  0  2  0  4  84  0  4  0  30  0  
4  1  0  2  1  5  6  0  0  2  3  5  30  12  0  0  31  47  
5  1  0  2  0  7  8  0  0  2  2  6  42  16  0  0  31  31  
6  1  0  0  0  7  7  1  0  4  0  7  42  14  2  0  63  0  
7  2  6  0  0  5  5  1  0  2  0  8  60  20  4  0  30  0 
Table 49. Full descriptions of the BPTC mode columns
M  Mode identifier bits 
NS  Number of subsets 
PB  Partition selection bits 
RB  Rotation bits 
ISB  Index selection bit 
CB  Color bits 
AB  Alpha bits 
EPB  Endpoint Pbits (all channels) 
SPB  Shared Pbits 
IB  Index bits 
IB_{2}  Secondary index bits 
Each block can be divided into between 1 and 3 groups of pixels called subsets, which have different endpoints. There are two endpoint colors per subset, grouped first by endpoint, then by subset, then by channel. For example, mode 1, with two subsets and six color bits, would have six bits of red for endpoint 0 of the first subset, then six bits of red for endpoint 1, then the two ends of the second subset, then green and blue stored similarly. If a block has any alpha bits, the alpha data follows the color data with the same organization. If not, alpha is overridden to 255. These bits are treated as the high bits of a fixedpoint value in a byte for each color channel of the endpoints: {E_{R}^{7..0}, E_{G}^{7..0}, E_{B}^{7..0}, E_{A}^{7..0}} per endpoint. If the mode has shared Pbits, there are two endpoint bits, the lower of which applies to both endpoints of subset 0 and the upper of which applies to both endpoints of subset 1. If the mode has perendpoint Pbits, then there are 2 × subsets Pbits stored in the same order as color and alpha. Both kinds of Pbits are added as a bit below the color data stored in the byte. So, for mode 1 with six red bits, the Pbit ends up in bit 1. For final scaling, the top bits of the value are replicated into any remaining bits in the byte. For the example of mode 1, bit 7 (which originated as bit 5 of the 6bit encoded channel) would be replicated to bit 0. Table 51 and Table 52 show the origin of each endpoint color bit for each mode.
Table 50. Bit layout for BC7 modes (LSB..MSB)
Mode 0  _{0:} M^{0} = 1  _{1..4:} PB^{0..3}  
_{5..8:} R_{0}^{0..3}  _{9..12:} R_{1}^{0..3}  _{13..16:} R_{2}^{0..3}  _{17..20:} R_{3}^{0..3}  _{21..24:} R_{4}^{0..3}  _{25..28:} R_{5}^{0..3}  
_{29..32:} G_{0}^{0..3}  _{33..36:} G_{1}^{0..3}  _{37..40:} G_{2}^{0..3}  _{41..44:} G_{3}^{0..3}  _{45..48:} G_{4}^{0..3}  _{49..52:} G_{5}^{0..3}  
_{53..56:} B_{0}^{0..3}  _{57..60:} B_{1}^{0..3}  _{61..64:} B_{2}^{0..3}  _{65..68:} B_{3}^{0..3}  _{69..72:} B_{4}^{0..3}  _{73..76:} B_{5}^{0..3}  
_{77:} EPB_{0}^{0}  _{78:} EPB_{1}^{0}  _{79:} EPB_{2}^{0}  _{80:} EPB_{3}^{0}  _{81:} EPB_{4}^{0}  _{82:} EPB_{5}^{0}  
_{83..127:} IB^{0..44}  
Mode 1  _{0..1:} M^{0..1} = 01  _{2..7:} PB^{0..5}  
_{8..13:} R_{0}^{0..5}  _{14..19:} R_{1}^{0..5}  _{20..25:} R_{2}^{0..5}  _{26..31:} R_{3}^{0..5}  
_{32..37:} G_{0}^{0..5}  _{38..43:} G_{1}^{0..5}  _{44..49:} G_{2}^{0..5}  _{50..55:} G_{3}^{0..5}  
_{56..61:} B_{0}^{0..5}  _{62..67:} B_{1}^{0..5}  _{68..73:} B_{2}^{0..5}  _{74..79:} B_{3}^{0..5}  
_{80:} SPB_{0}^{0}  _{81:} SPB_{1}^{0}  _{82..127:} IB^{0..45}  
Mode 2  _{0..2:} M^{0..2} = 001  _{3..8:} PB^{0..5}  
_{9..13:} R_{0}^{0..4}  _{14..18:} R_{1}^{0..4}  _{19..23:} R_{2}^{0..4}  _{24..28:} R_{4}^{0..4}  _{29..33:} R_{4}^{0..4}  _{34..38:} R_{5}^{0..4}  
_{39..43:} G_{0}^{0..4}  _{44..48:} G_{1}^{0..4}  _{49..53:} G_{2}^{0..4}  _{54..58:} G_{4}^{0..4}  _{59..63:} G_{4}^{0..4}  _{64..68:} G_{5}^{0..4}  
_{69..73:} B_{0}^{0..4}  _{74..78:} B_{1}^{0..4}  _{79..83:} B_{2}^{0..4}  _{84..88:} B_{4}^{0..4}  _{89..93:} B_{4}^{0..4}  _{94..98:} B_{5}^{0..4}  
_{99..127:} IB^{0..28}  
Mode 3  _{0..3:} M^{0..3} = 0001  _{4..9:} PB^{0..5}  
_{10..16:} R_{0}^{0..6}  _{17..23:} R_{1}^{0..6}  _{24..30:} R_{2}^{0..6}  _{31..37:} R_{3}^{0..6}  
_{38..44:} G_{0}^{0..6}  _{45..51:} G_{1}^{0..6}  _{52..58:} G_{2}^{0..6}  _{59..65:} G_{3}^{0..6}  
_{66..72:} B_{0}^{0..6}  _{73..79:} B_{1}^{0..6}  _{80..86:} B_{2}^{0..6}  _{87..93:} B_{3}^{0..6}  
_{94:} EPB_{0}^{0}  _{95:} EPB_{1}^{0}  _{96:} EPB_{2}^{0}  _{97:} EPB_{3}^{0}  _{98..127:} IB^{0..29}  
Mode 4  _{0..4:} M^{0..4} = 00001  _{5..6:} RB^{0..1}  _{7:} ISB^{0}  
_{8..12:} R_{0}^{0..4}  _{13..17:} R_{1}^{0..4}  _{18..22:} G_{0}^{0..4}  _{23..27:} G_{1}^{0..4}  _{28..32:} B_{0}^{0..4}  _{33..37:} B_{1}^{0..4}  
_{38..43:} A_{0}^{0..5}  _{44..49:} A_{1}^{0..5}  _{50..80:} IB^{0..30}  _{81..127:} IB_{2}^{0..46}  
Mode 5  _{0..5:} M^{0..5} = 000001  _{6..7:} RB^{0..1}  
_{8..14:} R_{0}^{0..6}  _{15..21:} R_{1}^{0..6}  _{22..28:} G_{0}^{0..6}  _{29..34:} G_{1}^{0..6}  _{35..41:} B_{0}^{0..6}  _{42..49:} B_{1}^{0..6}  
_{50..57:} A_{0}^{0..7}  _{58..65:} A_{1}^{0..7}  _{66..96:} IB^{0..30}  _{97..127:} IB_{2}^{0..30}  
Mode 6  _{0..6:} M^{0..6} = 0000001  
_{7..13:} R_{0}^{0..6}  _{14..20:} R_{1}^{0..6}  _{21..27:} G_{0}^{0..6}  _{28..34:} G_{1}^{0..6}  _{35..41:} B_{0}^{0..6}  _{42..48:} B_{1}^{0..6}  
_{49..55:} A_{0}^{0..6}  _{56..62:} A_{1}^{0..6}  _{63:} EPB_{0}^{0}  _{64:} EPB_{1}^{0}  _{65..127:} IB^{0..62}  
Mode 7  _{0..7:} M^{0..7} = 00000001  _{8..13:} PB^{0..5}  
_{14..18:} R_{0}^{0..4}  _{19..23:} R_{1}^{0..4}  _{24..28:} R_{2}^{0..4}  _{29..33:} R_{3}^{0..4}  
_{34..38:} G_{0}^{0..4}  _{39..43:} G_{1}^{0..4}  _{44..48:} G_{2}^{0..4}  _{49..53:} G_{3}^{0..4}  
_{54..58:} B_{0}^{0..4}  _{59..63:} B_{1}^{0..4}  _{64..68:} B_{2}^{0..4}  _{69..73:} B_{3}^{0..4}  
_{74..78:} A_{0}^{0..4}  _{79..83:} A_{1}^{0..4}  _{84..88:} A_{2}^{0..4}  _{89..93:} A_{3}^{0..4}  
_{94:} EPB_{0}^{0}  _{95:} EPB_{1}^{0}  _{96:} EPB_{2}^{0}  _{97:} EPB_{3}^{0}  _{98..127:} IB^{0..29} 
Table 51. Bit sources for BC7 endpoints (modes 0..2, MSB..LSB per channel)
Mode 0  
E_{R0}^{7..0}  E_{G0}^{7..0}  E_{B0}^{7..0}  E_{A0}^{7..0}  
8  7  6  5  77  8  7  6  32  31  30  29  77  32  31  30  56  55  54  53  77  56  55  54  255  
E_{R1}^{7..0}  E_{G1}^{7..0}  E_{B1}^{7..0}  E_{A1}^{7..0}  
12  11  10  9  78  12  11  10  36  35  34  33  78  36  35  34  60  59  58  57  78  60  59  58  255  
E_{R2}^{7..0}  E_{G2}^{7..0}  E_{B2}^{7..0}  E_{A2}^{7..0}  
16  15  14  13  79  16  15  14  40  39  38  37  79  40  39  38  64  63  62  61  79  64  63  62  255  
E_{R3}^{7..0}  E_{G3}^{7..0}  E_{B3}^{7..0}  E_{A3}^{7..0}  
20  19  18  17  80  20  19  18  44  43  42  41  80  44  43  42  68  67  66  65  80  68  67  66  255  
E_{R4}^{7..0}  E_{G4}^{7..0}  E_{B4}^{7..0}  E_{A4}^{7..0}  
24  23  22  21  81  24  23  22  48  47  46  45  81  48  47  46  72  71  70  69  81  72  71  70  255  
E_{R5}^{7..0}  E_{G5}^{7..0}  E_{B5}^{7..0}  E_{A5}^{7..0}  
28  27  26  25  82  28  27  26  52  51  50  49  82  52  51  50  76  75  74  73  82  76  75  74  255  
Mode 1  
E_{R0}^{7..0}  E_{G0}^{7..0}  E_{B0}^{7..0}  E_{A0}^{7..0}  
13  12  11  10  9  8  80  13  37  36  35  34  33  32  80  37  61  60  59  58  57  56  80  61  255  
E_{R1}^{7..0}  E_{G1}^{7..0}  E_{B1}^{7..0}  E_{A1}^{7..0}  
19  18  17  16  15  14  80  19  43  42  41  40  39  38  80  43  67  66  65  64  63  62  80  67  255  
E_{R2}^{7..0}  E_{G2}^{7..0}  E_{B2}^{7..0}  E_{A2}^{7..0}  
25  24  23  22  21  20  81  25  49  48  47  46  45  44  81  49  73  72  71  70  69  68  81  73  255  
E_{R3}^{7..0}  E_{G3}^{7..0}  E_{B3}^{7..0}  E_{A3}^{7..0}  
31  30  29  28  27  26  81  31  55  54  53  52  51  50  81  55  79  78  77  76  75  74  81  79  255  
Mode 2  
E_{R0}^{7..0}  E_{G0}^{7..0}  E_{B0}^{7..0}  E_{A0}^{7..0}  
13  12  11  10  9  13  12  11  43  42  41  40  39  43  42  41  73  72  71  70  69  73  72  71  255  
E_{R1}^{7..0}  E_{G1}^{7..0}  E_{B1}^{7..0}  E_{A1}^{7..0}  
18  17  16  15  14  18  17  16  48  47  46  45  44  48  47  46  78  77  76  75  74  78  77  76  255  
E_{R2}^{7..0}  E_{G2}^{7..0}  E_{B2}^{7..0}  E_{A2}^{7..0}  
23  22  21  20  19  23  22  21  53  52  51  50  49  53  52  51  83  82  81  80  79  83  82  81  255  
E_{R3}^{7..0}  E_{G3}^{7..0}  E_{B3}^{7..0}  E_{A3}^{7..0}  
28  27  26  25  24  28  27  26  58  57  56  55  54  58  57  56  88  87  86  85  84  88  87  86  255  
E_{R4}^{7..0}  E_{G4}^{7..0}  E_{B4}^{7..0}  E_{A4}^{7..0}  
33  32  31  30  29  33  32  31  63  62  61  60  59  63  62  61  93  92  91  90  89  93  92  91  255  
E_{R5}^{7..0}  E_{G5}^{7..0}  E_{B5}^{7..0}  E_{A5}^{7..0}  
38  37  36  35  34  38  37  36  68  67  66  65  64  68  67  66  98  97  96  95  94  98  97  96  255 
Table 52. Bit sources for BC7 endpoints (modes 3..7, MSB..LSB per channel)
Mode 3  
E_{R0}^{7..0}  E_{G0}^{7..0}  E_{B0}^{7..0}  E_{A0}^{7..0}  
16  15  14  13  12  11  10  94  44  43  42  41  40  39  38  94  72  71  70  69  68  67  66  94  255  
E_{R1}^{7..0}  E_{G1}^{7..0}  E_{B1}^{7..0}  E_{A1}^{7..0}  
23  22  21  20  19  18  17  95  51  50  49  48  47  46  45  95  79  78  77  76  75  74  73  95  255  
E_{R2}^{7..0}  E_{G2}^{7..0}  E_{B2}^{7..0}  E_{A2}^{7..0}  
30  29  28  27  26  25  24  96  58  57  56  55  54  53  52  96  86  85  84  83  82  81  80  96  255  
E_{R3}^{7..0}  E_{G3}^{7..0}  E_{B3}^{7..0}  E_{A3}^{7..0}  
37  36  35  34  33  32  31  97  65  64  63  62  61  60  59  97  93  92  91  90  89  88  87  97  255  
Mode 4  
E_{R0}^{7..0}  E_{G0}^{7..0}  E_{B0}^{7..0}  E_{A0}^{7..0}  
12  11  10  9  8  12  11  10  22  21  20  19  18  22  21  20  32  31  30  29  28  32  31  30  43  42  41  40  39  38  43  42 
E_{R1}^{7..0}  E_{G1}^{7..0}  E_{B1}^{7..0}  E_{A1}^{7..0}  
17  16  15  14  13  17  16  15  27  26  25  24  23  27  26  25  37  36  35  34  33  37  36  35  49  48  47  46  45  44  49  48 
Mode 5  
E_{R0}^{7..0}  E_{G0}^{7..0}  E_{B0}^{7..0}  E_{A0}^{7..0}  
14  13  12  11  10  9  8  14  28  27  26  25  24  23  22  28  42  41  40  39  38  37  36  42  57  56  55  54  53  52  51  50 
E_{R1}^{7..0}  E_{G1}^{7..0}  E_{B1}^{7..0}  E_{A1}^{7..0}  
21  20  19  18  17  16  15  21  35  34  33  32  31  30  29  35  49  48  47  46  45  44  43  49  65  64  63  62  61  60  59  58 
Mode 6  
E_{R0}^{7..0}  E_{G0}^{7..0}  E_{B0}^{7..0}  E_{A0}^{7..0}  
13  12  11  10  9  8  7  63  27  26  25  24  23  22  21  63  41  40  39  38  37  36  35  63  55  54  53  52  51  50  49  63 
E_{R1}^{7..0}  E_{G1}^{7..0}  E_{B1}^{7..0}  E_{A1}^{7..0}  
20  19  18  17  16  15  14  64  34  33  32  31  30  29  28  64  48  47  46  45  44  43  42  64  62  61  60  59  58  57  56  64 
Mode 7  
E_{R0}^{7..0}  E_{G0}^{7..0}  E_{B0}^{7..0}  E_{A0}^{7..0}  
18  17  16  15  14  94  18  17  38  37  36  35  34  94  38  37  58  57  56  55  54  94  58  57  78  77  76  75  74  94  78  77 
E_{R1}^{7..0}  E_{G1}^{7..0}  E_{B1}^{7..0}  E_{A1}^{7..0}  
23  22  21  20  19  95  23  22  43  42  41  40  39  95  43  42  63  62  61  60  59  95  63  62  83  82  81  80  79  95  83  82 
E_{R2}^{7..0}  E_{G2}^{7..0}  E_{B2}^{7..0}  E_{A2}^{7..0}  
28  27  26  25  24  96  28  27  48  47  46  45  44  96  48  47  68  67  66  65  64  96  68  67  88  87  86  85  84  96  88  87 
E_{R3}^{7..0}  E_{G3}^{7..0}  E_{B3}^{7..0}  E_{A3}^{7..0}  
33  32  31  30  29  97  33  32  53  52  51  50  49  97  53  52  73  72  71  70  69  97  73  72  93  92  91  90  89  97  93  92 
A texel in a block with one subset is always considered to be in subset zero. Otherwise, a number encoded in the partition bits is used to look up a partition pattern in Table 53 or Table 54 for 2 subsets and 3 subsets respectively. This partition pattern is accessed by the relative x and y offsets within the block to determine the subset which defines the pixel at these coordinates.
The endpoint colors are interpolated using index values stored in the block. The index bits are stored in ymajor order. That is, the bits for the index value corresponding to a relative (x, y) position of (0, 0) are stored in increasing order in the lowest index bits of the block (but see the next paragraph about anchor indices), the next bits of the block in increasing order store the index bits of (1, 0), followed by (2, 0) and (3, 0), then (0, 1) etc.
Each index has the number of bits indicated by the mode except for one special index per subset called the anchor index. Since the interpolation scheme between endpoints is symmetrical, we can save one bit on one index per subset by ordering the endpoints such that the highest bit for that index is guaranteed to be zero — and not storing that bit.
Each anchor index corresponds to an index in the corresponding partition number in Table 53 or Table 54, and are indicated in bold italics in those tables. In partition zero, the anchor index is always index zero — that is, at a relative position of (0,0) (as can be seen in Table 53 and Table 54, index 0 always corresponds to partition zero). In other partitions, the anchor index is specified by Table 55, Table 56, and Table 57.
In summary, the bit offset for index data with relative x,y coordinates within the texel block is: \begin{align*}
\textrm{index offset}_{x,y} &= \begin{cases}
0, & x = y = 0 \\
\textrm{IB} \times (x + 4\times y)  1, & \textrm{NS} = 1,\ 0 < x + 4\times y \\
\textrm{IB} \times (x + 4\times y)  1, & \textrm{NS} = 2,\ 0 < x + 4\times y \leq \textrm{anchor}_2[\mathit{part}] \\
\textrm{IB} \times (x + 4\times y)  2, & \textrm{NS} = 2,\ \textrm{anchor}_2[\mathit{part}] < x + 4\times y \\
\textrm{IB} \times (x + 4\times y)  1, & \textrm{NS} = 3,\ 0 < x + 4\times y \leq \textrm{anchor}_{3,2}[\mathit{part}],\ x + 4\times y \leq \textrm{anchor}_{3,2}[\mathit{part}]\\
\textrm{IB} \times (x + 4\times y)  3, & \textrm{NS} = 3,\ x + 4\times y > \textrm{anchor}_{3,2}[\mathit{part}],\ x + 4\times y > \textrm{anchor}_{3,3}[\mathit{part}] \\
\textrm{IB} \times (x + 4\times y)  2, & \textrm{NS} = 3,\ \textrm{otherwise} \\
\end{cases} \\
\end{align*} where anchor_{2} is Table 55, anchor_{3,2} is Table 56, anchor_{3,3} is Table 57, and part is encoded in the partition selection bits PB. 
If secondary index bits are present, they follow the primary index bits and are read in the same manner. The anchor index information is only used to determine the number of bits each index has when read from the block data.
The endpoint color and alpha values used for final interpolation are the decoded values corresponding to the applicable subset as selected above. The index value for interpolating color comes from the secondary index bits for the texel if the mode has an index selection bit and its value is one, and from the primary index bits otherwise. The alpha index comes from the secondary index bits if the block has a secondary index and the block either doesn’t have an index selection bit or that bit is zero, and from the primary index bits otherwise.
As an example of the texel decode process, consider a block encoded with mode 2 — that is, M^{0} = 0, M^{1} = 0, M^{2} = 1. This mode has three subsets, so Table 54 is used to determine which subset applies to each texel. Let us assume that this block has partition pattern 6 encoded in the partition selection bits, and that we wish to decode the texel at relative (x, y) offset (1, 2) — that is, index 9 in ymajor order. We can see from Table 54 that this texel is partitioned into subset 1 (the second of three), and therefore by endpoints 2 and 3. Mode 2 stores two index bits per texel, except for index 0 (which is the anchor index for subset 0), index 15 (for subset 1, as indicated in Table 56) and index 3 (for subset 2, as indicated in Table 57). Index 9 is therefore stored in two bits starting at index bits offset 14 (for indices 1..2 and 4..8) plus 2 (for indices 0 and 3) — a total of 16 bit offset into the index bits or, as seen in Table 50, bits 115 and 116 of the block. These two bits are used to interpolate between endpoints 2 and 3 using Equation 1 with weights from the twobit index row of Table 58, as described below. 
Table 53. Partition table for 2subset BPTC, with the 4×4 block of values for each partition number
_{0}  _{1}  _{2}  _{3}  _{4}  _{5}  _{6}  _{7}  
0  0  1  1  0  0  0  1  0  1  1  1  0  0  0  1  0  0  0  0  0  0  1  1  0  0  0  1  0  0  0  0  
0  0  1  1  0  0  0  1  0  1  1  1  0  0  1  1  0  0  0  1  0  1  1  1  0  0  1  1  0  0  0  1  
0  0  1  1  0  0  0  1  0  1  1  1  0  0  1  1  0  0  0  1  0  1  1  1  0  1  1  1  0  0  1  1  
0  0  1  1  0  0  0  1  0  1  1  1  0  1  1  1  0  0  1  1  1  1  1  1  1  1  1  1  0  1  1  1  
_{8}  _{9}  _{10}  _{11}  _{12}  _{13}  _{14}  _{15}  
0  0  0  0  0  0  1  1  0  0  0  0  0  0  0  0  0  0  0  1  0  0  0  0  0  0  0  0  0  0  0  0  
0  0  0  0  0  1  1  1  0  0  0  1  0  0  0  0  0  1  1  1  0  0  0  0  1  1  1  1  0  0  0  0  
0  0  0  1  1  1  1  1  0  1  1  1  0  0  0  1  1  1  1  1  1  1  1  1  1  1  1  1  0  0 