--- 1/draft-ietf-cellar-ffv1-07.txt 2019-08-13 07:24:33.873741794 -0700 +++ 2/draft-ietf-cellar-ffv1-08.txt 2019-08-13 07:24:34.101747560 -0700 @@ -1,20 +1,18 @@ cellar M. Niedermayer -Internet-Draft -Intended status: Informational D. Rice -Expires: August 10, 2019 - J. Martinez - February 6, 2019 +Internet-Draft D. Rice +Intended status: Informational J. Martinez +Expires: February 14, 2020 August 13, 2019 FFV1 Video Coding Format Version 0, 1, and 3 - draft-ietf-cellar-ffv1-07 + draft-ietf-cellar-ffv1-08 Abstract This document defines FFV1, a lossless intra-frame video encoding format. FFV1 is designed to efficiently compress video data in a variety of pixel formats. Compared to uncompressed video, FFV1 offers storage compression, frame fixity, and self-description, which makes FFV1 useful as a preservation or intermediate video format. Status of This Memo @@ -25,178 +23,181 @@ Internet-Drafts are working documents of the Internet Engineering Task Force (IETF). Note that other groups may also distribute working documents as Internet-Drafts. The list of current Internet- Drafts is at https://datatracker.ietf.org/drafts/current/. Internet-Drafts are draft documents valid for a maximum of six months and may be updated, replaced, or obsoleted by other documents at any time. It is inappropriate to use Internet-Drafts as reference material or to cite them other than as "work in progress." - This Internet-Draft will expire on August 10, 2019. + This Internet-Draft will expire on February 14, 2020. Copyright Notice Copyright (c) 2019 IETF Trust and the persons identified as the document authors. All rights reserved. This document is subject to BCP 78 and the IETF Trust's Legal - Provisions Relating to IETF Documents - (https://trustee.ietf.org/license-info) in effect on the date of - publication of this document. Please review these documents - carefully, as they describe your rights and restrictions with respect - to this document. Code Components extracted from this document must - include Simplified BSD License text as described in Section 4.e of - the Trust Legal Provisions and are provided without warranty as - described in the Simplified BSD License. + Provisions Relating to IETF Documents (https://trustee.ietf.org/ + license-info) in effect on the date of publication of this document. + Please review these documents carefully, as they describe your rights + and restrictions with respect to this document. Code Components + extracted from this document must include Simplified BSD License text + as described in Section 4.e of the Trust Legal Provisions and are + provided without warranty as described in the Simplified BSD License. Table of Contents 1. Introduction . . . . . . . . . . . . . . . . . . . . . . . . 4 2. Notation and Conventions . . . . . . . . . . . . . . . . . . 4 2.1. Definitions . . . . . . . . . . . . . . . . . . . . . . . 5 - 2.2. Conventions . . . . . . . . . . . . . . . . . . . . . . . 6 + 2.2. Conventions . . . . . . . . . . . . . . . . . . . . . . . 5 2.2.1. Pseudo-code . . . . . . . . . . . . . . . . . . . . . 6 2.2.2. Arithmetic Operators . . . . . . . . . . . . . . . . 6 2.2.3. Assignment Operators . . . . . . . . . . . . . . . . 6 2.2.4. Comparison Operators . . . . . . . . . . . . . . . . 7 2.2.5. Mathematical Functions . . . . . . . . . . . . . . . 7 2.2.6. Order of Operation Precedence . . . . . . . . . . . . 8 2.2.7. Range . . . . . . . . . . . . . . . . . . . . . . . . 8 2.2.8. NumBytes . . . . . . . . . . . . . . . . . . . . . . 8 2.2.9. Bitstream Functions . . . . . . . . . . . . . . . . . 8 3. Sample Coding . . . . . . . . . . . . . . . . . . . . . . . . 9 3.1. Border . . . . . . . . . . . . . . . . . . . . . . . . . 9 3.2. Samples . . . . . . . . . . . . . . . . . . . . . . . . . 10 3.3. Median Predictor . . . . . . . . . . . . . . . . . . . . 10 3.4. Context . . . . . . . . . . . . . . . . . . . . . . . . . 11 - 3.5. Quantization Table Sets . . . . . . . . . . . . . . . . . 11 + 3.5. Quantization Table Sets . . . . . . . . . . . . . . . . . 12 3.6. Quantization Table Set Indexes . . . . . . . . . . . . . 12 3.7. Color spaces . . . . . . . . . . . . . . . . . . . . . . 12 - 3.7.1. YCbCr . . . . . . . . . . . . . . . . . . . . . . . . 12 + 3.7.1. YCbCr . . . . . . . . . . . . . . . . . . . . . . . . 13 3.7.2. RGB . . . . . . . . . . . . . . . . . . . . . . . . . 13 - 3.8. Coding of the Sample Difference . . . . . . . . . . . . . 14 + 3.8. Coding of the Sample Difference . . . . . . . . . . . . . 15 3.8.1. Range Coding Mode . . . . . . . . . . . . . . . . . . 15 3.8.2. Golomb Rice Mode . . . . . . . . . . . . . . . . . . 19 - 4. Bitstream . . . . . . . . . . . . . . . . . . . . . . . . . . 24 - 4.1. Parameters . . . . . . . . . . . . . . . . . . . . . . . 24 - 4.1.1. version . . . . . . . . . . . . . . . . . . . . . . . 25 - 4.1.2. micro_version . . . . . . . . . . . . . . . . . . . . 26 - 4.1.3. coder_type . . . . . . . . . . . . . . . . . . . . . 26 - 4.1.4. state_transition_delta . . . . . . . . . . . . . . . 27 - 4.1.5. colorspace_type . . . . . . . . . . . . . . . . . . . 27 - 4.1.6. chroma_planes . . . . . . . . . . . . . . . . . . . . 27 - 4.1.7. bits_per_raw_sample . . . . . . . . . . . . . . . . . 28 - 4.1.8. log2_h_chroma_subsample . . . . . . . . . . . . . . . 28 - 4.1.9. log2_v_chroma_subsample . . . . . . . . . . . . . . . 28 - 4.1.10. extra_plane . . . . . . . . . . . . . . . . . . . . . 28 - 4.1.11. num_h_slices . . . . . . . . . . . . . . . . . . . . 28 - 4.1.12. num_v_slices . . . . . . . . . . . . . . . . . . . . 29 - 4.1.13. quant_table_set_count . . . . . . . . . . . . . . . . 29 - 4.1.14. states_coded . . . . . . . . . . . . . . . . . . . . 29 - 4.1.15. initial_state_delta . . . . . . . . . . . . . . . . . 29 - 4.1.16. ec . . . . . . . . . . . . . . . . . . . . . . . . . 29 - 4.1.17. intra . . . . . . . . . . . . . . . . . . . . . . . . 30 - 4.2. Configuration Record . . . . . . . . . . . . . . . . . . 30 - 4.2.1. reserved_for_future_use . . . . . . . . . . . . . . . 30 + 4. Bitstream . . . . . . . . . . . . . . . . . . . . . . . . . . 22 + 4.1. Parameters . . . . . . . . . . . . . . . . . . . . . . . 23 + 4.1.1. version . . . . . . . . . . . . . . . . . . . . . . . 24 + 4.1.2. micro_version . . . . . . . . . . . . . . . . . . . . 24 + 4.1.3. coder_type . . . . . . . . . . . . . . . . . . . . . 25 + 4.1.4. state_transition_delta . . . . . . . . . . . . . . . 25 + 4.1.5. colorspace_type . . . . . . . . . . . . . . . . . . . 25 + 4.1.6. chroma_planes . . . . . . . . . . . . . . . . . . . . 26 + 4.1.7. bits_per_raw_sample . . . . . . . . . . . . . . . . . 26 + 4.1.8. log2_h_chroma_subsample . . . . . . . . . . . . . . . 27 + 4.1.9. log2_v_chroma_subsample . . . . . . . . . . . . . . . 27 + 4.1.10. extra_plane . . . . . . . . . . . . . . . . . . . . . 27 + 4.1.11. num_h_slices . . . . . . . . . . . . . . . . . . . . 27 + 4.1.12. num_v_slices . . . . . . . . . . . . . . . . . . . . 28 + 4.1.13. quant_table_set_count . . . . . . . . . . . . . . . . 28 + 4.1.14. states_coded . . . . . . . . . . . . . . . . . . . . 28 + 4.1.15. initial_state_delta . . . . . . . . . . . . . . . . . 28 + 4.1.16. ec . . . . . . . . . . . . . . . . . . . . . . . . . 28 + 4.1.17. intra . . . . . . . . . . . . . . . . . . . . . . . . 29 + 4.2. Configuration Record . . . . . . . . . . . . . . . . . . 29 + 4.2.1. reserved_for_future_use . . . . . . . . . . . . . . . 29 4.2.2. configuration_record_crc_parity . . . . . . . . . . . 30 - 4.2.3. Mapping FFV1 into Containers . . . . . . . . . . . . 31 - 4.3. Frame . . . . . . . . . . . . . . . . . . . . . . . . . . 32 + 4.2.3. Mapping FFV1 into Containers . . . . . . . . . . . . 30 + 4.3. Frame . . . . . . . . . . . . . . . . . . . . . . . . . . 31 4.4. Slice . . . . . . . . . . . . . . . . . . . . . . . . . . 32 4.5. Slice Header . . . . . . . . . . . . . . . . . . . . . . 33 - 4.5.1. slice_x . . . . . . . . . . . . . . . . . . . . . . . 34 - 4.5.2. slice_y . . . . . . . . . . . . . . . . . . . . . . . 34 - 4.5.3. slice_width . . . . . . . . . . . . . . . . . . . . . 34 + 4.5.1. slice_x . . . . . . . . . . . . . . . . . . . . . . . 33 + 4.5.2. slice_y . . . . . . . . . . . . . . . . . . . . . . . 33 + 4.5.3. slice_width . . . . . . . . . . . . . . . . . . . . . 33 4.5.4. slice_height . . . . . . . . . . . . . . . . . . . . 34 4.5.5. quant_table_set_index_count . . . . . . . . . . . . . 34 4.5.6. quant_table_set_index . . . . . . . . . . . . . . . . 34 - 4.5.7. picture_structure . . . . . . . . . . . . . . . . . . 35 - 4.5.8. sar_num . . . . . . . . . . . . . . . . . . . . . . . 35 + 4.5.7. picture_structure . . . . . . . . . . . . . . . . . . 34 + 4.5.8. sar_num . . . . . . . . . . . . . . . . . . . . . . . 34 4.5.9. sar_den . . . . . . . . . . . . . . . . . . . . . . . 35 4.6. Slice Content . . . . . . . . . . . . . . . . . . . . . . 35 - 4.6.1. primary_color_count . . . . . . . . . . . . . . . . . 36 - 4.6.2. plane_pixel_height . . . . . . . . . . . . . . . . . 36 + 4.6.1. primary_color_count . . . . . . . . . . . . . . . . . 35 + 4.6.2. plane_pixel_height . . . . . . . . . . . . . . . . . 35 4.6.3. slice_pixel_height . . . . . . . . . . . . . . . . . 36 4.6.4. slice_pixel_y . . . . . . . . . . . . . . . . . . . . 36 4.7. Line . . . . . . . . . . . . . . . . . . . . . . . . . . 36 - 4.7.1. plane_pixel_width . . . . . . . . . . . . . . . . . . 37 - 4.7.2. slice_pixel_width . . . . . . . . . . . . . . . . . . 37 - 4.7.3. slice_pixel_x . . . . . . . . . . . . . . . . . . . . 37 + 4.7.1. plane_pixel_width . . . . . . . . . . . . . . . . . . 36 + 4.7.2. slice_pixel_width . . . . . . . . . . . . . . . . . . 36 + 4.7.3. slice_pixel_x . . . . . . . . . . . . . . . . . . . . 36 4.7.4. sample_difference . . . . . . . . . . . . . . . . . . 37 4.8. Slice Footer . . . . . . . . . . . . . . . . . . . . . . 37 - 4.8.1. slice_size . . . . . . . . . . . . . . . . . . . . . 38 - 4.8.2. error_status . . . . . . . . . . . . . . . . . . . . 38 - 4.8.3. slice_crc_parity . . . . . . . . . . . . . . . . . . 38 + 4.8.1. slice_size . . . . . . . . . . . . . . . . . . . . . 37 + 4.8.2. error_status . . . . . . . . . . . . . . . . . . . . 37 + 4.8.3. slice_crc_parity . . . . . . . . . . . . . . . . . . 37 4.9. Quantization Table Set . . . . . . . . . . . . . . . . . 38 - 4.9.1. quant_tables . . . . . . . . . . . . . . . . . . . . 39 - 4.9.2. context_count . . . . . . . . . . . . . . . . . . . . 40 - 5. Restrictions . . . . . . . . . . . . . . . . . . . . . . . . 40 - 6. Security Considerations . . . . . . . . . . . . . . . . . . . 40 - 7. Media Type Definition . . . . . . . . . . . . . . . . . . . . 41 - 8. IANA Considerations . . . . . . . . . . . . . . . . . . . . . 43 - 9. Appendixes . . . . . . . . . . . . . . . . . . . . . . . . . 43 - 9.1. Decoder implementation suggestions . . . . . . . . . . . 43 - 9.1.1. Multi-threading Support and Independence of Slices . 43 - 10. Changelog . . . . . . . . . . . . . . . . . . . . . . . . . . 43 - 11. References . . . . . . . . . . . . . . . . . . . . . . . . . 43 - 11.1. Normative References . . . . . . . . . . . . . . . . . . 43 - 11.2. Informative References . . . . . . . . . . . . . . . . . 44 - Authors' Addresses . . . . . . . . . . . . . . . . . . . . . . . 46 + 4.9.1. quant_tables . . . . . . . . . . . . . . . . . . . . 38 + 4.9.2. context_count . . . . . . . . . . . . . . . . . . . . 38 + 5. Restrictions . . . . . . . . . . . . . . . . . . . . . . . . 38 + 6. Security Considerations . . . . . . . . . . . . . . . . . . . 39 + 7. Media Type Definition . . . . . . . . . . . . . . . . . . . . 40 + 8. IANA Considerations . . . . . . . . . . . . . . . . . . . . . 41 + 9. Appendixes . . . . . . . . . . . . . . . . . . . . . . . . . 41 + 9.1. Decoder implementation suggestions . . . . . . . . . . . 41 + 9.1.1. Multi-threading Support and Independence of + Slices . . . . . . . . . . . . . . . . . . . . . . . 42 + 10. Changelog . . . . . . . . . . . . . . . . . . . . . . . . . . 42 + 11. Normative References . . . . . . . . . . . . . . . . . . . . 42 + 12. Informative References . . . . . . . . . . . . . . . . . . . 43 + Authors' Addresses . . . . . . . . . . . . . . . . . . . . . . . 44 1. Introduction This document describes FFV1, a lossless video encoding format. The design of FFV1 considers the storage of image characteristics, data fixity, and the optimized use of encoding time and storage requirements. FFV1 is designed to support a wide range of lossless video applications such as long-term audiovisual preservation, scientific imaging, screen recording, and other video encoding scenarios that seek to avoid the generational loss of lossy video encodings. This document defines version 0, 1 and 3 of FFV1. The distinctions of the versions are provided throughout the document, but in summary: - o Version 0 of FFV1 was the original implementation of FFV1 and has + * Version 0 of FFV1 was the original implementation of FFV1 and has been in non-experimental use since April 14, 2006 [FFV1_V0]. - o Version 1 of FFV1 adds support of more video bit depths and has + * Version 1 of FFV1 adds support of more video bit depths and has been in use since April 24, 2009 [FFV1_V1]. - o Version 2 of FFV1 only existed in experimental form and is not + * Version 2 of FFV1 only existed in experimental form and is not described by this document, but is available as a LyX file at - . + https://github.com/FFmpeg/FFV1/ + blob/8ad772b6d61c3dd8b0171979a2cd9f11924d5532/ffv1.lyx + (https://github.com/FFmpeg/FFV1/ + blob/8ad772b6d61c3dd8b0171979a2cd9f11924d5532/ffv1.lyx). - o Version 3 of FFV1 adds several features such as increased + * Version 3 of FFV1 adds several features such as increased description of the characteristics of the encoding images and embedded CRC data to support fixity verification of the encoding. Version 3 has been in non-experimental use since August 17, 2013 [FFV1_V3]. The latest version of this document is available at - + https://raw.github.com/FFmpeg/FFV1/master/ffv1.md + (https://raw.github.com/FFmpeg/FFV1/master/ffv1.md) This document assumes familiarity with mathematical and coding concepts such as Range coding [range-coding] and YCbCr color spaces [YCbCr]. 2. Notation and Conventions The key words "MUST", "MUST NOT", "REQUIRED", "SHALL", "SHALL NOT", "SHOULD", "SHOULD NOT", "RECOMMENDED", "MAY", and "OPTIONAL" in this document are to be interpreted as described in [RFC2119]. 2.1. Definitions - "Container": Format that encapsulates "Frames" (see Section 4.3) and - (when required) a "Configuration Record" into a bitstream. + "Container": Format that encapsulates "Frames" (see the section on + Frames (#frame)) and (when required) a "Configuration Record" into a + bitstream. "Sample": The smallest addressable representation of a color component or a luma component in a "Frame". Examples of "Sample" are Luma, Blue Chrominance, Red Chrominance, Transparency, Red, Green, and Blue. "Plane": A discrete component of a static image comprised of "Samples" that represent a specific quantification of "Samples" of that image. @@ -352,22 +353,23 @@ a = b, a += b, a -= b, a *= b 2.2.7. Range "a...b" means any value starting from a to b, inclusive. 2.2.8. NumBytes "NumBytes" is a non-negative integer that expresses the size in 8-bit octets of a particular FFV1 "Configuration Record" or "Frame". FFV1 - relies on its "Container" to store the "NumBytes" values, see - Section 4.2.3. + relies on its "Container" to store the "NumBytes" values, see the + section on the Mapping FFV1 into Containers (#mapping-ffv1-into- + containers). 2.2.9. Bitstream Functions 2.2.9.1. remaining_bits_in_bitstream "remaining_bits_in_bitstream( )" means the count of remaining bits after the pointer in that "Configuration Record" or "Frame". It is computed from the "NumBytes" value multiplied by 8 minus the count of bits of that "Configuration Record" or "Frame" already read by the bitstream parser. @@ -383,43 +385,45 @@ )" is a multiple of 8, otherwise false. 2.2.9.4. get_bits "get_bits( i )" is the action to read the next "i" bits in the bitstream, from most significant bit to least significant bit, and to return the corresponding value. The pointer is increased by "i". 3. Sample Coding - For each "Slice" (as described in Section 4.4) of a "Frame", the - "Planes", "Lines", and "Samples" are coded in an order determined by - the "Color Space" (see Section 3.7). Each "Sample" is predicted by - the median predictor as described in Section 3.3 from other "Samples" - within the same "Plane" and the difference is stored using the method - described in Section 3.8. + For each "Slice" (as described in the section on Slices (#slice)) of + a "Frame", the "Planes", "Lines", and "Samples" are coded in an order + determined by the "Color Space" (see the section on Color Space + (#color-spaces)). Each "Sample" is predicted by the median predictor + as described in the section of the Median Predictor (#median- + predictor) from other "Samples" within the same "Plane" and the + difference is stored using the method described in Coding of the + Sample Difference (#coding-of-the-sample-difference). 3.1. Border A border is assumed for each coded "Slice" for the purpose of the median predictor and context according to the following rules: - o one column of "Samples" to the left of the coded slice is assumed + * one column of "Samples" to the left of the coded slice is assumed as identical to the "Samples" of the leftmost column of the coded slice shifted down by one row. The value of the topmost "Sample" of the column of "Samples" to the left of the coded slice is assumed to be "0" - o one column of "Samples" to the right of the coded slice is assumed + * one column of "Samples" to the right of the coded slice is assumed as identical to the "Samples" of the rightmost column of the coded slice - o an additional column of "Samples" to the left of the coded slice + * an additional column of "Samples" to the left of the coded slice and two rows of "Samples" above the coded slice are assumed to be "0" The following table depicts a slice of 9 "Samples" "a,b,c,d,e,f,g,h,i" in a 3x3 arrangement along with its assumed border. +---+---+---+---+---+---+---+---+ | 0 | 0 | | 0 | 0 | 0 | | 0 | +---+---+---+---+---+---+---+---+ @@ -489,25 +493,25 @@ JPEG2000-RCT with Range Coder coder was implemented without this issue in one implementation and validated by one conformance checker. It is expected (to be confirmed) to remove this exception for the median predictor in the next version of the FFV1 bitstream. 3.4. Context Relative to any "Sample" "X", the Quantized Sample Differences "L-l", "l-tl", "tl-t", "T-t", and "t-tr" are used as context: - context = Q_{0}[l - tl] + - Q_{1}[tl - t] + - Q_{2}[t - tr] + - Q_{3}[L - l] + - Q_{4}[T - t] + context = Q_{0}[l − tl] + + Q_{1}[tl − t] + + Q_{2}[t − tr] + + Q_{3}[L − l] + + Q_{4}[T − t] If "context >= 0" then "context" is used and the difference between the "Sample" and its predicted value is encoded as is, else "-context" is used and the difference between the "Sample" and its predicted value is encoded with a flipped sign. 3.5. Quantization Table Sets The FFV1 bitstream contains 1 or more Quantization Table Sets. Each Quantization Table Set contains exactly 5 Quantization Tables with @@ -521,26 +525,25 @@ Q_{j}[k] = quant_tables[i][j][k&255] In this formula, "i" is the Quantization Table Set index, "j" is the Quantized Table index, "k" the Quantized Sample Difference. 3.6. Quantization Table Set Indexes For each "Plane" of each slice, a Quantization Table Set is selected from an index: - o For Y "Plane", "quant_table_set_index [ 0 ]" index is used + * For Y "Plane", "quant_table_set_index[ 0 ]" index is used - o For Cb and Cr "Planes", "quant_table_set_index [ 1 ]" index is - used + * For Cb and Cr "Planes", "quant_table_set_index[ 1 ]" index is used - o For extra "Plane", "quant_table_set_index [ (version <= 3 || + * For extra "Plane", "quant_table_set_index[ (version <= 3 || chroma_planes) ? 2 : 1 ]" index is used Background: in first implementations of FFV1 bitstream, the index for Cb and Cr "Planes" was stored even if it is not used (chroma_planes set to 0), this index is kept for version <= 3 in order to keep compatibility with FFV1 bitstreams in the wild. 3.7. Color spaces FFV1 supports several color spaces. The count of allowed coded @@ -550,44 +553,47 @@ The FFV1 bitstream interleaves data in an order determined by the color space. In YCbCr for each "Plane", each "Line" is coded from top to bottom and for each "Line", each "Sample" is coded from left to right. In JPEG2000-RCT for each "Line" from top to bottom, each "Plane" is coded and for each "Plane", each "Sample" is encoded from left to right. 3.7.1. YCbCr This color space allows 1 to 4 "Planes". + The Cb and Cr "Planes" are optional, but if used then MUST be used together. Omitting the Cb and Cr "Planes" codes the frames in grayscale without color data. + An optional transparency "Plane" can be used to code transparency data. An FFV1 "Frame" using YCbCr MUST use one of the following arrangements: - o Y + * Y - o Y, Transparency + * Y, Transparency - o Y, Cb, Cr + * Y, Cb, Cr - o Y, Cb, Cr, Transparency + * Y, Cb, Cr, Transparency The Y "Plane" MUST be coded first. If the Cb and Cr "Planes" are used then they MUST be coded after the Y "Plane". If a transparency "Plane" is used, then it MUST be coded last. 3.7.2. RGB This color space allows 3 or 4 "Planes". + An optional transparency "Plane" can be used to code transparency data. JPEG2000-RCT is a Reversible Color Transform that codes RGB (red, green, blue) "Planes" losslessly in a modified YCbCr color space [ISO.15444-1.2016]. Reversible Pixel transformations between YCbCr and RGB use the following formulae. Cb=b-g @@ -653,21 +659,21 @@ 3.8. Coding of the Sample Difference Instead of coding the n+1 bits of the Sample Difference with Huffman or Range coding (or n+2 bits, in the case of JPEG2000-RCT), only the n (or n+1, in the case of JPEG2000-RCT) least significant bits are used, since this is sufficient to recover the original "Sample". In the equation below, the term "bits" represents bits_per_raw_sample+1 for JPEG2000-RCT or bits_per_raw_sample otherwise: coder_input = - [(sample_difference + 2^(bits-1)) & (2^bits - 1)] - 2^(bits-1) + [(sample_difference + 2^(bits−1)) & (2^bits − 1)] − 2^(bits−1) 3.8.1. Range Coding Mode Early experimental versions of FFV1 used the CABAC Arithmetic coder from H.264 as defined in [ISO.14496-10.2014] but due to the uncertain patent/royalty situation, as well as its slightly worse performance, CABAC was replaced by a Range coder based on an algorithm defined by G. Nigel and N. Martin in 1979 [range-coding]. 3.8.1.1. Range Binary Values @@ -700,37 +705,38 @@ t_{i} < 2^8 R_{i+1} = t_{i} XOR L_{i+1} = l_{i} XOR j_{i+1} = j_{i} <== t_{i} >= 2^8 R_{0} = 65280 L_{0} = 2^8 * B_{0} + B_{1} + j_{0} = 2 3.8.1.1.1. Termination The range coder can be used in 3 modes. - o In "Open mode" when decoding, every symbol the reader attempts to + * In "Open mode" when decoding, every symbol the reader attempts to read is available. In this mode arbitrary data can have been appended without affecting the range coder output. This mode is not used in FFV1. - o In "Closed mode" the length in bytes of the bytestream is provided + * In "Closed mode" the length in bytes of the bytestream is provided to the range decoder. Bytes beyond the length are read as 0 by the range decoder. This is generally 1 byte shorter than the open mode. - o In "Sentinel mode" the exact length in bytes is not known and thus + * In "Sentinel mode" the exact length in bytes is not known and thus the range decoder MAY read into the data that follows the range coded bytestream by one byte. In "Sentinel mode", the end of the range coded bytestream is a binary symbol with state 129, which value SHALL be discarded. After reading this symbol, the range decoder will have read one byte beyond the end of the range coded bytestream. This way the byte position of the end can be determined. Bytestreams written in "Sentinel mode" can be read in "Closed mode" if the length can be determined, in this case the last (sentinel) symbol will be read non-corrupted and be of value 0. @@ -754,41 +760,21 @@ 255 contexts per 8-bit symbol that is not only a waste of memory but also requires more past data to reach a reasonably good estimate of the probabilities. Alternatively assuming a Laplacian distribution and only dealing with its variance and mean (as in Huffman coding) would also be possible, however, for maximum flexibility and simplicity, the chosen method uses a single symbol to encode if a number is 0, and if not, encodes the number using its exponent, mantissa and sign. The exact contexts used are best described by the following code, followed by some comments. - pseudo-code | type - --------------------------------------------------------------|----- - void put_symbol(RangeCoder *c, uint8_t *state, int v, int \ | - is_signed) { | - int i; | - put_rac(c, state+0, !v); | - if (v) { | - int a= abs(v); | - int e= log2(a); | - | - for (i=0; i=0; i--) | - put_rac(c, state+22+min(i,9), (a>>i)&1); //22..31 | - | - if (is_signed) | - put_rac(c, state+11 + min(e, 10), v < 0); //11..21| - } | - } | + pseudo-code | type --------------------------------------------------------------|----- void put_symbol(RangeCoder *c, uint8_t *state, int v, int \ | is_signed) { | int i; | put_rac(c, state+0, !v); | if (v) { | int a= abs(v); | int e= log2(a); | | for (i = 0; i < e; i++) { | put_rac(c, state+1+min(i,9), 1); //1..10 | } | | put_rac(c, state+1+min(i,9), 0); | for (i = e-1; i >= 0; i--) { | put_rac(c, state+22+min(i,9), (a>>i)&1); //22..31 | } | | if (is_signed) { | put_rac(c, state+11 + min(e, 10), v < 0); //11..21| } | } | } | 3.8.1.3. Initial Values for the Context Model At keyframes all Range coder state variables are set to their initial state. 3.8.1.4. State Transition Table one_state_{i} = default_state_transition_{i} + state_transition_delta_{i} @@ -825,25 +811,26 @@ 210,211,212,213,215,215,216,217,218,219,220,220,222,223,224,225, 226,227,227,229,229,230,231,232,234,234,235,236,237,238,239,240, 241,242,243,244,245,246,247,248,248, 0, 0, 0, 0, 0, 0, 0, 3.8.1.6. Alternative State Transition Table The alternative state transition table has been built using iterative minimization of frame sizes and generally performs better than the - default. To use it, the coder_type (see Section 4.1.3) MUST be set - to 2 and the difference to the default MUST be stored in the - "Parameters", see Section 4.1. The reference implementation of FFV1 - in FFmpeg uses this table by default at the time of this writing when - Range coding is used. + default. To use it, the coder_type (see the section on coder_type + (#codertype)) MUST be set to 2 and the difference to the default MUST + be stored in the "Parameters", see the section on Parameters + (#parameters). The reference implementation of FFV1 in FFmpeg uses + this table by default at the time of this writing when Range coding + is used. 0, 10, 10, 10, 10, 16, 16, 16, 28, 16, 16, 29, 42, 49, 20, 49, 59, 25, 26, 26, 27, 31, 33, 33, 33, 34, 34, 37, 67, 38, 39, 39, 40, 40, 41, 79, 43, 44, 45, 45, 48, 48, 64, 50, 51, 52, 88, 52, 53, 74, 55, 57, 58, 58, 74, 60,101, 61, 62, 84, 66, 66, 68, 69, 87, 82, 71, 97, 73, 73, 82, 75,111, 77, 94, 78, 87, 81, 83, 97, @@ -875,204 +862,151 @@ The end of the bitstream of the "Frame" is filled with 0-bits until that the bitstream contains a multiple of 8 bits. 3.8.2.1. Signed Golomb Rice Codes This coding mode uses Golomb Rice codes. The VLC is split into 2 parts, the prefix stores the most significant bits and the suffix stores the k least significant bits or stores the whole number in the ESC case. - pseudo-code | type - --------------------------------------------------------------|----- - int get_ur_golomb(k) { | - for (prefix = 0; prefix < 12; prefix++) { | - if ( get_bits(1) ) | - return get_bits(k) + (prefix << k) | - } | - return get_bits(bits) + 11 | - } | - | - int get_sr_golomb(k) { | - v = get_ur_golomb(k); | - if (v & 1) return - (v >> 1) - 1; | - else return (v >> 1); | - } + pseudo-code | type --------------------------------------------------------------|----- int get_ur_golomb(k) { | for (prefix = 0; prefix < 12; prefix++) { | if (get_bits(1)) { | return get_bits(k) + (prefix << k) | } | } | return get_bits(bits) + 11 | } | | int get_sr_golomb(k) { | v = get_ur_golomb(k); | if (v & 1) return - (v >> 1) - 1; | else return (v >> 1); | } 3.8.2.1.1. Prefix +----------------+-------+ | bits | value | - +----------------+-------+ + +================+=======+ | 1 | 0 | + +----------------+-------+ | 01 | 1 | + +----------------+-------+ | ... | ... | + +----------------+-------+ | 0000 0000 0001 | 11 | + +----------------+-------+ | 0000 0000 0000 | ESC | +----------------+-------+ + Table 1 + 3.8.2.1.2. Suffix - +-------+-----------------------------------------------------------+ - | non | the k least significant bits MSB first | - | ESC | | - | ESC | the value - 11, in MSB first order, ESC may only be used | - | | if the value cannot be coded as non ESC | - +-------+-----------------------------------------------------------+ + +---------+--------------------------------------------------+ + +=========+==================================================+ + | non ESC | the k least significant bits MSB first | + +---------+--------------------------------------------------+ + | ESC | the value - 11, in MSB first order, ESC may only | + | | be used if the value cannot be coded as non ESC | + +---------+--------------------------------------------------+ + + Table 2 3.8.2.1.3. Examples + +-----+-------------------------+-------+ | k | bits | value | - +-----+-------------------------+-------+ + +=====+=========================+=======+ | 0 | "1" | 0 | + +-----+-------------------------+-------+ | 0 | "001" | 2 | + +-----+-------------------------+-------+ | 2 | "1 00" | 0 | + +-----+-------------------------+-------+ | 2 | "1 10" | 2 | + +-----+-------------------------+-------+ | 2 | "01 01" | 5 | + +-----+-------------------------+-------+ | any | "000000000000 10000000" | 139 | +-----+-------------------------+-------+ + Table 3 + 3.8.2.2. Run Mode Run mode is entered when the context is 0 and left as soon as a non-0 difference is found. The level is identical to the predicted one. The run and the first different level are coded. 3.8.2.2.1. Run Length Coding The run value is encoded in 2 parts, the prefix part stores the more significant part of the run as well as adjusting the run_index that determines the number of bits in the less significant part of the run. The 2nd part of the value stores the less significant part of the run as it is. The run_index is reset for each "Plane" and slice to 0. - pseudo-code | type - --------------------------------------------------------------|----- - log2_run[41]={ | - 0, 0, 0, 0, 1, 1, 1, 1, | - 2, 2, 2, 2, 3, 3, 3, 3, | - 4, 4, 5, 5, 6, 6, 7, 7, | - 8, 9,10,11,12,13,14,15, | - 16,17,18,19,20,21,22,23, | - 24, | - }; | - | - if (run_count == 0 && run_mode == 1) { | - if (get_bits(1)) { | - run_count = 1 << log2_run[run_index]; | - if (x + run_count <= w) | - run_index++; | - } else { | - if (log2_run[run_index]) | - run_count = get_bits(log2_run[run_index]); | - else | - run_count = 0; | - if (run_index) | - run_index--; | - run_mode = 2; | - } | - } | + pseudo-code | type --------------------------------------------------------------|----- log2_run[41]={ | 0, 0, 0, 0, 1, 1, 1, 1, | 2, 2, 2, 2, 3, 3, 3, 3, | 4, 4, 5, 5, 6, 6, 7, 7, | 8, 9,10,11,12,13,14,15, | 16,17,18,19,20,21,22,23, | 24, | }; | | if (run_count == 0 && run_mode == 1) { | if (get_bits(1)) { | run_count = 1 << log2_run[run_index]; | if (x + run_count <= w) { | run_index++; | } | } else { | if (log2_run[run_index]) { | run_count = get_bits(log2_run[run_index]); | } else { | run_count = 0; | } | if (run_index) { | run_index--; | } | run_mode = 2; | } | } | The log2_run function is also used within [ISO.14495-1.1999]. 3.8.2.2.2. Level Coding Level coding is identical to the normal difference coding with the exception that the 0 value is removed as it cannot occur: - diff = get_vlc_symbol(context_state); - if (diff >= 0) - diff++; + diff = get_vlc_symbol(context_state); if (diff >= 0) { diff++; } Note, this is different from JPEG-LS, which doesn't use prediction in run mode and uses a different encoding and context model for the last difference On a small set of test "Samples" the use of prediction slightly improved the compression rate. 3.8.2.3. Scalar Mode Each difference is coded with the per context mean prediction removed and a per context value for k. - get_vlc_symbol(state) { - i = state->count; - k = 0; - while (i < state->error_sum) { - k++; - i += i; - } - - v = get_sr_golomb(k); - - if (2 * state->drift < -state->count) - v = - 1 - v; - - ret = sign_extend(v + state->bias, bits); - - state->error_sum += abs(v); - state->drift += v; - - if (state->count == 128) { - state->count >>= 1; - state->drift >>= 1; - state->error_sum >>= 1; - } - state->count++; - if (state->drift <= -state->count) { - state->bias = max(state->bias - 1, -128); - - state->drift = max(state->drift + state->count, - -state->count + 1); - } else if (state->drift > 0) { - state->bias = min(state->bias + 1, 127); - - state->drift = min(state->drift - state->count, 0); - } - - return ret; - } + get_vlc_symbol(state) { i = state->count; k = 0; while (i < state->error_sum) { k++; i += i; } v = get_sr_golomb(k); if (2 * state->drift < -state->count) { v = -1 - v; } ret = sign_extend(v + state->bias, bits); state->error_sum += abs(v); state->drift += v; if (state->count == 128) { state->count >>= 1; state->drift >>= 1; state->error_sum >>= 1; } state->count++; if (state->drift <= -state->count) { state->bias = max(state->bias - 1, -128); state->drift = max(state->drift + state->count, -state->count + 1); } else if (state->drift > 0) { state->bias = min(state->bias + 1, 127); state->drift = min(state->drift - state->count, 0); } return ret; } 3.8.2.4. Initial Values for the VLC context state At keyframes all coder state variables are set to their initial state. - drift = 0; - error_sum = 4; - bias = 0; - count = 1; + drift = 0; error_sum = 4; bias = 0; count = 1; 4. Bitstream An FFV1 bitstream is composed of a series of 1 or more "Frames" and (when required) a "Configuration Record". Within the following sub-sections, pseudo-code is used to explain the - structure of each FFV1 bitstream component, as described in - Section 2.2.1. The following table lists symbols used to annotate - that pseudo-code in order to define the storage of the data - referenced in that line of pseudo-code. + structure of each FFV1 bitstream component, as described in the + section on Pseudo-Code (#pseudocode). The following table lists + symbols used to annotate that pseudo-code in order to define the + storage of the data referenced in that line of pseudo-code. - +--------+----------------------------------------------------------+ + +--------+-------------------------------------------+ | Symbol | Definition | - +--------+----------------------------------------------------------+ + +========+===========================================+ | u(n) | unsigned big endian integer using n bits | - | sg | Golomb Rice coded signed scalar symbol coded with the | - | | method described in Section 3.8.2 | - | br | Range coded Boolean (1-bit) symbol with the method | - | | described in Section 3.8.1.1 | - | ur | Range coded unsigned scalar symbol coded with the method | - | | described in Section 3.8.1.2 | - | sr | Range coded signed scalar symbol coded with the method | - | | described in Section 3.8.1.2 | - +--------+----------------------------------------------------------+ + +--------+-------------------------------------------+ + | sg | Golomb Rice coded signed scalar symbol | + | | coded with the method described in Signed | + | | Golomb Rice Codes (#golomb-rice-mode) | + +--------+-------------------------------------------+ + | br | Range coded Boolean (1-bit) symbol with | + | | the method described in Range binary | + | | values (#range-binary-values) | + +--------+-------------------------------------------+ + | ur | Range coded unsigned scalar symbol coded | + | | with the method described in Range non | + | | binary values (#range-non-binary-values) | + +--------+-------------------------------------------+ + | sr | Range coded signed scalar symbol coded | + | | with the method described in Range non | + | | binary values (#range-non-binary-values) | + +--------+-------------------------------------------+ + + Table 4 The same context that is initialized to 128 is used for all fields in the header. The following MUST be provided by external means during initialization of the decoder: "frame_pixel_width" is defined as "Frame" width in "Pixels". "frame_pixel_height" is defined as "Frame" height in "Pixels". @@ -1083,84 +1017,59 @@ 4.1. Parameters The "Parameters" section contains significant characteristics about the decoding configuration used for all instances of "Frame" (in FFV1 version 0 and 1) or the whole FFV1 bitstream (other versions), including the stream version, color configuration, and quantization tables. The pseudo-code below describes the contents of the bitstream. - pseudo-code | type - --------------------------------------------------------------|----- - Parameters( ) { | - version | ur - if (version >= 3) | - micro_version | ur - coder_type | ur - if (coder_type > 1) | - for (i = 1; i < 256; i++) | - state_transition_delta[ i ] | sr - colorspace_type | ur - if (version >= 1) | - bits_per_raw_sample | ur - chroma_planes | br - log2_h_chroma_subsample | ur - log2_v_chroma_subsample | ur - extra_plane | br - if (version >= 3) { | - num_h_slices - 1 | ur - num_v_slices - 1 | ur - quant_table_set_count | ur - } | - for( i = 0; i < quant_table_set_count; i++ ) | - QuantizationTableSet( i ) | - if (version >= 3) { | - for( i = 0; i < quant_table_set_count; i++ ) { | - states_coded | br - if (states_coded) | - for( j = 0; j < context_count[ i ]; j++ ) | - for( k = 0; k < CONTEXT_SIZE; k++ ) | - initial_state_delta[ i ][ j ][ k ] | sr - } | - ec | ur - intra | ur - } | - } | + pseudo-code | type --------------------------------------------------------------|----- Parameters( ) { | version | ur if (version >= 3) { | micro_version | ur } | coder_type | ur if (coder_type > 1) { | for (i = 1; i < 256; i++) { | state_transition_delta[ i ] | sr } | } | colorspace_type | ur if (version >= 1) { | bits_per_raw_sample | ur } | chroma_planes | br log2_h_chroma_subsample | ur log2_v_chroma_subsample | ur extra_plane | br if (version >= 3) { | num_h_slices - 1 | ur num_v_slices - 1 | ur quant_table_set_count | ur } | for (i = 0; i < quant_table_set_count; i++) { | QuantizationTableSet( i ) | } | if (version >= 3) { | for (i = 0; i < quant_table_set_count; i++) { | states_coded | br if (states_coded) { | for (j = 0; j < context_count[ i ]; j++) { | for (k = 0; k < CONTEXT_SIZE; k++) { | initial_state_delta[ i ][ j ][ k ] | sr } | } | } | } | ec | ur intra | ur } | } | 4.1.1. version "version" specifies the version of the FFV1 bitstream. + Each version is incompatible with other versions: decoders SHOULD reject a file due to an unknown version. + Decoders SHOULD reject a file with version <= 1 && ConfigurationRecordIsPresent == 1. + Decoders SHOULD reject a file with version >= 3 && ConfigurationRecordIsPresent == 0. +-------+-------------------------+ | value | version | - +-------+-------------------------+ + +=======+=========================+ | 0 | FFV1 version 0 | + +-------+-------------------------+ | 1 | FFV1 version 1 | + +-------+-------------------------+ | 2 | reserved* | + +-------+-------------------------+ | 3 | FFV1 version 3 | + +-------+-------------------------+ | Other | reserved for future use | +-------+-------------------------+ + Table 5 + * Version 2 was never enabled in the encoder thus version 2 files SHOULD NOT exist, and this document does not describe them to keep the text simpler. 4.1.2. micro_version "micro_version" specifies the micro-version of the FFV1 bitstream. + After a version is considered stable (a micro-version value is assigned to be the first stable variant of a specific version), each new micro-version after this first stable variant is compatible with the previous micro-version: decoders SHOULD NOT reject a file due to an unknown micro-version equal or above the micro-version considered as stable. Meaning of micro_version for version 3: +-------+-------------------------+ @@ -1158,45 +1067,55 @@ assigned to be the first stable variant of a specific version), each new micro-version after this first stable variant is compatible with the previous micro-version: decoders SHOULD NOT reject a file due to an unknown micro-version equal or above the micro-version considered as stable. Meaning of micro_version for version 3: +-------+-------------------------+ | value | micro_version | - +-------+-------------------------+ + +=======+=========================+ | 0...3 | reserved* | + +-------+-------------------------+ | 4 | first stable variant | + +-------+-------------------------+ | Other | reserved for future use | +-------+-------------------------+ + Table 6 + * development versions may be incompatible with the stable variants. 4.1.3. coder_type "coder_type" specifies the coder used. +-------+-------------------------------------------------+ | value | coder used | - +-------+-------------------------------------------------+ + +=======+=================================================+ | 0 | Golomb Rice | + +-------+-------------------------------------------------+ | 1 | Range Coder with default state transition table | + +-------+-------------------------------------------------+ | 2 | Range Coder with custom state transition table | + +-------+-------------------------------------------------+ | Other | reserved for future use | +-------+-------------------------------------------------+ + Table 7 + 4.1.4. state_transition_delta "state_transition_delta" specifies the Range coder custom state transition table. + If state_transition_delta is not present in the FFV1 bitstream, all Range coder custom state transition table elements are assumed to be 0. 4.1.5. colorspace_type "colorspace_type" specifies the color space encoded, the pixel transformation used by the encoder, the extra plane content, as well as interleave method. @@ -1193,36 +1112,41 @@ If state_transition_delta is not present in the FFV1 bitstream, all Range coder custom state transition table elements are assumed to be 0. 4.1.5. colorspace_type "colorspace_type" specifies the color space encoded, the pixel transformation used by the encoder, the extra plane content, as well as interleave method. - +-------+-----------+----------------+---------------+--------------+ - | value | color | pixel | extra plane | interleave | - | | space | transformation | content | method | - | | encoded | | | | - +-------+-----------+----------------+---------------+--------------+ - | 0 | YCbCr | None | Transparency | "Plane" then | + +-------+-------------+----------------+--------------+-------------+ + | value | color space | pixel | extra plane | interleave | + | | encoded | transformation | content | method | + +=======+=============+================+==============+=============+ + | 0 | YCbCr | None | Transparency | "Plane" | + | | | | | then | | | | | | "Line" | - | 1 | RGB | JPEG2000-RCT | Transparency | "Line" then | + +-------+-------------+----------------+--------------+-------------+ + | 1 | RGB | JPEG2000-RCT | Transparency | "Line" | + | | | | | then | | | | | | "Plane" | - | Other | reserved | reserved for | reserved for | reserved for | - | | for | future use | future use | future use | - | | future | | | | - | | use | | | | - +-------+-----------+----------------+---------------+--------------+ + +-------+-------------+----------------+--------------+-------------+ + | Other | reserved | reserved for | reserved for | reserved | + | | for future | future use | future use | for future | + | | use | | | use | + +-------+-------------+----------------+--------------+-------------+ + + Table 8 Restrictions: + If "colorspace_type" is 1, then "chroma_planes" MUST be 1, "log2_h_chroma_subsample" MUST be 0, and "log2_v_chroma_subsample" MUST be 0. 4.1.6. chroma_planes "chroma_planes" indicates if chroma (color) "Planes" are present. +-------+---------------------------------+ | value | presence | @@ -1219,37 +1143,43 @@ If "colorspace_type" is 1, then "chroma_planes" MUST be 1, "log2_h_chroma_subsample" MUST be 0, and "log2_v_chroma_subsample" MUST be 0. 4.1.6. chroma_planes "chroma_planes" indicates if chroma (color) "Planes" are present. +-------+---------------------------------+ | value | presence | - +-------+---------------------------------+ + +=======+=================================+ | 0 | chroma "Planes" are not present | + +-------+---------------------------------+ | 1 | chroma "Planes" are present | +-------+---------------------------------+ + Table 9 + 4.1.7. bits_per_raw_sample "bits_per_raw_sample" indicates the number of bits for each "Sample". Inferred to be 8 if not present. +-------+-----------------------------------+ | value | bits for each sample | - +-------+-----------------------------------+ + +=======+===================================+ | 0 | reserved* | + +-------+-----------------------------------+ | Other | the actual bits for each "Sample" | +-------+-----------------------------------+ + Table 10 + * Encoders MUST NOT store bits_per_raw_sample = 0 Decoders SHOULD accept and interpret bits_per_raw_sample = 0 as 8. 4.1.8. log2_h_chroma_subsample "log2_h_chroma_subsample" indicates the subsample factor, stored in powers to which the number 2 must be raised, between luma and chroma width ("chroma_width = 2^(-log2_h_chroma_subsample) * luma_width"). 4.1.9. log2_v_chroma_subsample @@ -1257,126 +1187,143 @@ "log2_v_chroma_subsample" indicates the subsample factor, stored in powers to which the number 2 must be raised, between luma and chroma height ("chroma_height=2^(-log2_v_chroma_subsample) * luma_height"). 4.1.10. extra_plane "extra_plane" indicates if an extra "Plane" is present. +-------+------------------------------+ | value | presence | - +-------+------------------------------+ + +=======+==============================+ | 0 | extra "Plane" is not present | + +-------+------------------------------+ | 1 | extra "Plane" is present | +-------+------------------------------+ + Table 11 + 4.1.11. num_h_slices "num_h_slices" indicates the number of horizontal elements of the slice raster. + Inferred to be 1 if not present. 4.1.12. num_v_slices "num_v_slices" indicates the number of vertical elements of the slice raster. + Inferred to be 1 if not present. 4.1.13. quant_table_set_count "quant_table_set_count" indicates the number of Quantization Table Sets. + Inferred to be 1 if not present. + MUST NOT be 0. 4.1.14. states_coded "states_coded" indicates if the respective Quantization Table Set has the initial states coded. + Inferred to be 0 if not present. - +-------+-----------------------------------------------------------+ + +-------+--------------------------------+ | value | initial states | - +-------+-----------------------------------------------------------+ - | 0 | initial states are not present and are assumed to be all | - | | 128 | + +=======+================================+ + | 0 | initial states are not present | + | | and are assumed to be all 128 | + +-------+--------------------------------+ | 1 | initial states are present | - +-------+-----------------------------------------------------------+ + +-------+--------------------------------+ + + Table 12 4.1.15. initial_state_delta "initial_state_delta[ i ][ j ][ k ]" indicates the initial Range coder state, it is encoded using "k" as context index and pred = j ? initial_states[ i ][j - 1][ k ] : 128 initial_state[ i ][ j ][ k ] = ( pred + initial_state_delta[ i ][ j ][ k ] ) & 255 4.1.16. ec "ec" indicates the error detection/correction type. +-------+--------------------------------------------+ | value | error detection/correction type | - +-------+--------------------------------------------+ + +=======+============================================+ | 0 | 32-bit CRC on the global header | + +-------+--------------------------------------------+ | 1 | 32-bit CRC per slice and the global header | + +-------+--------------------------------------------+ | Other | reserved for future use | +-------+--------------------------------------------+ + Table 13 + 4.1.17. intra "intra" indicates the relationship between the instances of "Frame". + Inferred to be 0 if not present. - +-------+-----------------------------------------------------------+ + +-------+-------------------------------------+ | value | relationship | - +-------+-----------------------------------------------------------+ - | 0 | Frames are independent or dependent (keyframes and non | - | | keyframes) | - | 1 | Frames are independent (keyframes only) | + +=======+=====================================+ + | 0 | Frames are independent or dependent | + | | (keyframes and non keyframes) | + +-------+-------------------------------------+ + | 1 | Frames are independent (keyframes | + | | only) | + +-------+-------------------------------------+ | Other | reserved for future use | - +-------+-----------------------------------------------------------+ + +-------+-------------------------------------+ + + Table 14 4.2. Configuration Record In the case of a FFV1 bitstream with "version >= 3", a "Configuration Record" is stored in the underlying "Container", at the track header level. It contains the "Parameters" used for all instances of "Frame". The size of the "Configuration Record", "NumBytes", is supplied by the underlying "Container". -pseudo-code | type ---------------------------------------------------------------|----- -ConfigurationRecord( NumBytes ) { | - ConfigurationRecordIsPresent = 1 | - Parameters( ) | - while( remaining_symbols_in_syntax( NumBytes - 4 ) ) | - reserved_for_future_use | br/ur/sr - configuration_record_crc_parity | u(32) -} | + pseudo-code | type --------------------------------------------------------------|----- ConfigurationRecord( NumBytes ) { | ConfigurationRecordIsPresent = 1 | Parameters( ) | while (remaining_symbols_in_syntax(NumBytes - 4)) { | reserved_for_future_use | br/ur/sr } | configuration_record_crc_parity | u(32) } | 4.2.1. reserved_for_future_use "reserved_for_future_use" has semantics that are reserved for future use. + Encoders conforming to this version of this specification SHALL NOT write this value. + Decoders conforming to this version of this specification SHALL ignore its value. 4.2.2. configuration_record_crc_parity "configuration_record_crc_parity" 32 bits that are chosen so that the "Configuration Record" as a whole has a crc remainder of 0. + This is equivalent to storing the crc remainder in the 32-bit parity. + The CRC generator polynomial used is the standard IEEE CRC polynomial (0x104C11DB7) with initial value 0. 4.2.3. Mapping FFV1 into Containers This "Configuration Record" can be placed in any file format supporting "Configuration Records", fitting as much as possible with how the file format uses to store "Configuration Records". The "Configuration Record" storage place and "NumBytes" are currently defined and supported by this version of this specification for the @@ -1425,85 +1373,80 @@ 4.3. Frame A "Frame" is an encoded representation of a complete static image. The whole "Frame" is provided by the underlaying container. A "Frame" consists of the keyframe field, "Parameters" (if version <=1), and a sequence of independent slices. The pseudo-code below describes the contents of a "Frame". - pseudo-code | type - --------------------------------------------------------------|----- - Frame( NumBytes ) { | - keyframe | br - if (keyframe && !ConfigurationRecordIsPresent | - Parameters( ) | - while ( remaining_bits_in_bitstream( NumBytes ) ) | - Slice( ) | - } | + pseudo-code | type --------------------------------------------------------------|----- Frame( NumBytes ) { | keyframe | br if (keyframe && !ConfigurationRecordIsPresent { | Parameters( ) | } | while (remaining_bits_in_bitstream( NumBytes )) { | Slice( ) | } | } | Architecture overview of slices in a "Frame": +-----------------------------------------------------------------+ + +=================================================================+ | first slice header | + +-----------------------------------------------------------------+ | first slice content | + +-----------------------------------------------------------------+ | first slice footer | + +-----------------------------------------------------------------+ | --------------------------------------------------------------- | + +-----------------------------------------------------------------+ | second slice header | + +-----------------------------------------------------------------+ | second slice content | + +-----------------------------------------------------------------+ | second slice footer | + +-----------------------------------------------------------------+ | --------------------------------------------------------------- | + +-----------------------------------------------------------------+ | ... | + +-----------------------------------------------------------------+ | --------------------------------------------------------------- | + +-----------------------------------------------------------------+ | last slice header | + +-----------------------------------------------------------------+ | last slice content | + +-----------------------------------------------------------------+ | last slice footer | +-----------------------------------------------------------------+ + Table 15 + 4.4. Slice A "Slice" is an independent spatial sub-section of a "Frame" that is encoded separately from an other region of the same "Frame". The use of more than one "Slice" per "Frame" can be useful for taking advantage of the opportunities of multithreaded encoding and decoding. A "Slice" consists of a "Slice Header" (when relevant), a "Slice Content", and a "Slice Footer" (when relevant). The pseudo-code below describes the contents of a "Slice". - pseudo-code | type - --------------------------------------------------------------|----- - Slice( ) { | - if (version >= 3) | - SliceHeader( ) | - SliceContent( ) | - if (coder_type == 0) | - while (!byte_aligned()) | - padding | u(1) - if (version <= 1) { | - while (remaining_bits_in_bitstream( NumBytes ) != 0 ) | - reserved | u(1) - } | - if (version >= 3) | - SliceFooter( ) | - } | + pseudo-code | type --------------------------------------------------------------|----- Slice( ) { | if (version >= 3) { | SliceHeader( ) | } | SliceContent( ) | if (coder_type == 0) { | while (!byte_aligned()) { | padding | u(1) } | } | if (version <= 1) { | while (remaining_bits_in_bitstream( NumBytes ) != 0) {| reserved | u(1) } | } | if (version >= 3) { | SliceFooter( ) | } | } | "padding" specifies a bit without any significance and used only for byte alignment. MUST be 0. "reserved" specifies a bit without any significance in this revision of the specification and may have a significance in a later revision of this specification. + Encoders SHOULD NOT fill these bits. + Decoders SHOULD ignore these bits. + Note in case these bits are used in a later revision of this specification: any revision of this specification SHOULD care about avoiding to add 40 bits of content after "SliceContent" for version 0 and 1 of the bitstream. Background: due to some non conforming encoders, some bitstreams where found with 40 extra bits corresponding to "error_status" and "slice_crc_parity", a decoder conforming to the revised specification could not do the difference between a revised bitstream and a buggy bitstream. 4.5. Slice Header @@ -1506,62 +1449,54 @@ conforming to the revised specification could not do the difference between a revised bitstream and a buggy bitstream. 4.5. Slice Header A "Slice Header" provides information about the decoding configuration of the "Slice", such as its spatial position, size, and aspect ratio. The pseudo-code below describes the contents of the "Slice Header". - pseudo-code | type - --------------------------------------------------------------|----- - SliceHeader( ) { | - slice_x | ur - slice_y | ur - slice_width - 1 | ur - slice_height - 1 | ur - for( i = 0; i < quant_table_set_index_count; i++ ) | - quant_table_set_index [ i ] | ur - picture_structure | ur - sar_num | ur - sar_den | ur - } | + pseudo-code | type --------------------------------------------------------------|----- SliceHeader( ) { | slice_x | ur slice_y | ur slice_width - 1 | ur slice_height - 1 | ur for (i = 0; i < quant_table_set_index_count; i++) { | quant_table_set_index[ i ] | ur } | picture_structure | ur sar_num | ur sar_den | ur } | 4.5.1. slice_x "slice_x" indicates the x position on the slice raster formed by num_h_slices. + Inferred to be 0 if not present. 4.5.2. slice_y "slice_y" indicates the y position on the slice raster formed by num_v_slices. + Inferred to be 0 if not present. 4.5.3. slice_width "slice_width" indicates the width on the slice raster formed by num_h_slices. + Inferred to be 1 if not present. 4.5.4. slice_height "slice_height" indicates the height on the slice raster formed by num_v_slices. + Inferred to be 1 if not present. 4.5.5. quant_table_set_index_count "quant_table_set_index_count" is defined as "1 + ( ( chroma_planes || - version \<= 3 ) ? 1 : 0 ) + ( extra_plane ? 1 : 0 )". + version <= 3 ) ? 1 : 0 ) + ( extra_plane ? 1 : 0 )". 4.5.6. quant_table_set_index "quant_table_set_index" indicates the Quantization Table Set index to select the Quantization Table Set and the initial states for the slice. Inferred to be 0 if not present. 4.5.7. picture_structure @@ -1561,47 +1496,62 @@ "quant_table_set_index" indicates the Quantization Table Set index to select the Quantization Table Set and the initial states for the slice. Inferred to be 0 if not present. 4.5.7. picture_structure "picture_structure" specifies the temporal and spatial relationship of each "Line" of the "Frame". + Inferred to be 0 if not present. +-------+-------------------------+ | value | picture structure used | - +-------+-------------------------+ + +=======+=========================+ | 0 | unknown | + +-------+-------------------------+ | 1 | top field first | + +-------+-------------------------+ | 2 | bottom field first | + +-------+-------------------------+ | 3 | progressive | + +-------+-------------------------+ | Other | reserved for future use | +-------+-------------------------+ + Table 16 + 4.5.8. sar_num "sar_num" specifies the "Sample" aspect ratio numerator. + Inferred to be 0 if not present. + A value of 0 means that aspect ratio is unknown. + Encoders MUST write 0 if "Sample" aspect ratio is unknown. + If "sar_den" is 0, decoders SHOULD ignore the encoded value and consider that "sar_num" is 0. 4.5.9. sar_den "sar_den" specifies the "Sample" aspect ratio denominator. + Inferred to be 0 if not present. + A value of 0 means that aspect ratio is unknown. + Encoders MUST write 0 if "Sample" aspect ratio is unknown. + If "sar_num" is 0, decoders SHOULD ignore the encoded value and consider that "sar_den" is 0. 4.6. Slice Content A "Slice Content" contains all "Line" elements part of the "Slice". Depending on the configuration, "Line" elements are ordered by "Plane" then by row (YCbCr) or by row then by "Plane" (RGB). @@ -1598,33 +1548,21 @@ If "sar_num" is 0, decoders SHOULD ignore the encoded value and consider that "sar_den" is 0. 4.6. Slice Content A "Slice Content" contains all "Line" elements part of the "Slice". Depending on the configuration, "Line" elements are ordered by "Plane" then by row (YCbCr) or by row then by "Plane" (RGB). - pseudo-code | type - --------------------------------------------------------------|----- - SliceContent( ) { | - if (colorspace_type == 0) { | - for( p = 0; p < primary_color_count; p++ ) | - for( y = 0; y < plane_pixel_height[ p ]; y++ ) | - Line( p, y ) | - } else if (colorspace_type == 1) { | - for( y = 0; y < slice_pixel_height; y++ ) | - for( p = 0; p < primary_color_count; p++ ) | - Line( p, y ) | - } | - } | + pseudo-code | type --------------------------------------------------------------|----- SliceContent( ) { | if (colorspace_type == 0) { | for (p = 0; p < primary_color_count; p++) { | for (y = 0; y < plane_pixel_height[ p ]; y++) { | Line( p, y ) | } | } | } else if (colorspace_type == 1) { | for (y = 0; y < slice_pixel_height; y++) { | for (p = 0; p < primary_color_count; p++) { | Line( p, y ) | } | } | } | } | 4.6.1. primary_color_count "primary_color_count" is defined as "1 + ( chroma_planes ? 2 : 0 ) + ( extra_plane ? 1 : 0 )". 4.6.2. plane_pixel_height "plane_pixel_height[ p ]" is the height in pixels of plane p of the slice. @@ -1621,104 +1559,95 @@ 4.6.1. primary_color_count "primary_color_count" is defined as "1 + ( chroma_planes ? 2 : 0 ) + ( extra_plane ? 1 : 0 )". 4.6.2. plane_pixel_height "plane_pixel_height[ p ]" is the height in pixels of plane p of the slice. + "plane_pixel_height[ 0 ]" and "plane_pixel_height[ 1 + ( chroma_planes ? 2 : 0 ) ]" value is "slice_pixel_height". + If "chroma_planes" is set to 1, "plane_pixel_height[ 1 ]" and "plane_pixel_height[ 2 ]" value is "ceil(slice_pixel_height / log2_v_chroma_subsample)". 4.6.3. slice_pixel_height "slice_pixel_height" is the height in pixels of the slice. + Its value is "floor(( slice_y + slice_height ) * slice_pixel_height / num_v_slices) - slice_pixel_y". 4.6.4. slice_pixel_y "slice_pixel_y" is the slice vertical position in pixels. + Its value is "floor(slice_y * frame_pixel_height / num_v_slices)". 4.7. Line A "Line" is a list of the sample differences (relative to the predictor) of primary color components. The pseudo-code below describes the contents of the "Line". - pseudo-code | type - --------------------------------------------------------------|----- - Line( p, y ) { | - if (colorspace_type == 0) { | - for( x = 0; x < plane_pixel_width[ p ]; x++ ) | - sample_difference[ p ][ y ][ x ] | - } else if (colorspace_type == 1) { | - for( x = 0; x < slice_pixel_width; x++ ) | - sample_difference[ p ][ y ][ x ] | - } | - } | + pseudo-code | type --------------------------------------------------------------|----- Line( p, y ) { | if (colorspace_type == 0) { | for (x = 0; x < plane_pixel_width[ p ]; x++) { | sample_difference[ p ][ y ][ x ] | } | } else if (colorspace_type == 1) { | for (x = 0; x < slice_pixel_width; x++) { | sample_difference[ p ][ y ][ x ] | } | } | } | 4.7.1. plane_pixel_width "plane_pixel_width[ p ]" is the width in "Pixels" of "Plane" p of the slice. + "plane_pixel_width[ 0 ]" and "plane_pixel_width[ 1 + ( chroma_planes ? 2 : 0 ) ]" value is "slice_pixel_width". + If "chroma_planes" is set to 1, "plane_pixel_width[ 1 ]" and "plane_pixel_width[ 2 ]" value is "ceil(slice_pixel_width / (1 << log2_h_chroma_subsample))". 4.7.2. slice_pixel_width "slice_pixel_width" is the width in "Pixels" of the slice. + Its value is "floor(( slice_x + slice_width ) * slice_pixel_width / num_h_slices) - slice_pixel_x". 4.7.3. slice_pixel_x "slice_pixel_x" is the slice horizontal position in "Pixels". + Its value is "floor(slice_x * frame_pixel_width / num_h_slices)". 4.7.4. sample_difference "sample_difference[ p ][ y ][ x ]" is the sample difference for "Sample" at "Plane" "p", y position "y", and x position "x". The "Sample" value is computed based on median predictor and context - described in Section 3.2. + described in the section on Samples (#samples). 4.8. Slice Footer A "Slice Footer" provides information about slice size and (optionally) parity. The pseudo-code below describes the contents of - the "Slice Header". + the "Slice Footer". Note: "Slice Footer" is always byte aligned. - pseudo-code | type - --------------------------------------------------------------|----- - SliceFooter( ) { | - slice_size | u(24) - if (ec) { | - error_status | u(8) - slice_crc_parity | u(32) - } | - } | + pseudo-code | type --------------------------------------------------------------|----- SliceFooter( ) { | slice_size | u(24) if (ec) { | error_status | u(8) slice_crc_parity | u(32) } | } | 4.8.1. slice_size "slice_size" indicates the size of the slice in bytes. + Note: this allows finding the start of slices before previous slices have been fully decoded, and allows parallel decoding as well as error resilience. 4.8.2. error_status "error_status" specifies the error status. +-------+--------------------------------------+ | value | error status | @@ -1715,152 +1644,132 @@ Note: this allows finding the start of slices before previous slices have been fully decoded, and allows parallel decoding as well as error resilience. 4.8.2. error_status "error_status" specifies the error status. +-------+--------------------------------------+ | value | error status | - +-------+--------------------------------------+ + +=======+======================================+ | 0 | no error | + +-------+--------------------------------------+ | 1 | slice contains a correctable error | + +-------+--------------------------------------+ | 2 | slice contains a uncorrectable error | + +-------+--------------------------------------+ | Other | reserved for future use | +-------+--------------------------------------+ + Table 17 + 4.8.3. slice_crc_parity "slice_crc_parity" 32 bits that are chosen so that the slice as a whole has a crc remainder of 0. + This is equivalent to storing the crc remainder in the 32-bit parity. + The CRC generator polynomial used is the standard IEEE CRC polynomial (0x104C11DB7) with initial value 0. 4.9. Quantization Table Set The Quantization Table Sets are stored by storing the number of equal entries -1 of the first half of the table (represented as "len - 1" - in the pseudo-code below) using the method described in - Section 3.8.1.2. The second half doesn't need to be stored as it is - identical to the first with flipped sign. "scale" and "len_count[ i - ][ j ]" are temporary values used for the computing of - "context_count[ i ]" and are not used outside Quantization Table Set - pseudo-code. + in the pseudo-code below) using the method described in Range Non + Binary Values (#range-non-binary-values). The second half doesn't + need to be stored as it is identical to the first with flipped sign. + "scale" and "len_count[ i ][ j ]" are temporary values used for the + computing of "context_count[ i ]" and are not used outside + Quantization Table Set pseudo-code. - example: + Example: Table: 0 0 1 1 1 1 2 2 -2 -2 -2 -1 -1 -1 -1 0 Stored values: 1, 3, 1 - pseudo-code | type - --------------------------------------------------------------|----- - QuantizationTableSet( i ) { | - scale = 1 | - for( j = 0; j < MAX_CONTEXT_INPUTS; j++ ) { | - QuantizationTable( i, j, scale ) | - scale *= 2 * len_count[ i ][ j ] - 1 | - } | - context_count[ i ] = ceil ( scale / 2 ) | - } | + pseudo-code | type --------------------------------------------------------------|----- QuantizationTableSet( i ) { | scale = 1 | for (j = 0; j < MAX_CONTEXT_INPUTS; j++) { | QuantizationTable( i, j, scale ) | scale *= 2 * len_count[ i ][ j ] - 1 | } | context_count[ i ] = ceil( scale / 2 ) | } | MAX_CONTEXT_INPUTS is 5. - pseudo-code | type - --------------------------------------------------------------|----- - QuantizationTable(i, j, scale) { | - v = 0 | - for( k = 0; k < 128; ) { | - len - 1 | ur - for( a = 0; a < len; a++ ) { | - quant_tables[ i ][ j ][ k ] = scale* v | - k++ | - } | - v++ | - } | - for( k = 1; k < 128; k++ ) { | - quant_tables[ i ][ j ][ 256 - k ] = \ | - -quant_tables[ i ][ j ][ k ] | - } | - quant_tables[ i ][ j ][ 128 ] = \ | - -quant_tables[ i ][ j ][ 127 ] | - len_count[ i ][ j ] = v | - } | + pseudo-code | type --------------------------------------------------------------|----- QuantizationTable(i, j, scale) { | v = 0 | for (k = 0; k < 128;) { | len - 1 | ur for (a = 0; a < len; a++) { | quant_tables[ i ][ j ][ k ] = scale * v | k++ | } | v++ | } | for (k = 1; k < 128; k++) { | quant_tables[ i ][ j ][ 256 - k ] = \ | -quant_tables[ i ][ j ][ k ] | } | quant_tables[ i ][ j ][ 128 ] = \ | -quant_tables[ i ][ j ][ 127 ] | len_count[ i ][ j ] = v | } | 4.9.1. quant_tables "quant_tables[ i ][ j ][ k ]" indicates the quantification table value of the Quantized Sample Difference "k" of the Quantization Table "j" of the Set Quantization Table Set "i". 4.9.2. context_count "context_count[ i ]" indicates the count of contexts for Quantization Table Set "i". 5. Restrictions - To ensure that fast multithreaded decoding is possible, starting - version 3 and if frame_pixel_width * frame_pixel_height is more than - 101376, slice_width * slice_height MUST be less or equal to - num_h_slices * num_v_slices / 4. Note: 101376 is the frame size in + To ensure that fast multithreaded decoding is possible, starting with + version 3 and if "frame_pixel_width * frame_pixel_height" is more + than 101376, "slice_width * slice_height" MUST be less or equal to + "num_h_slices * num_v_slices / 4". Note: 101376 is the frame size in "Pixels" of a 352x288 frame also known as CIF ("Common Intermediate Format") frame size format. For each "Frame", each position in the slice raster MUST be filled by one and only one slice of the "Frame" (no missing slice position, no slice overlapping). For each "Frame" with keyframe value of 0, each slice MUST have the - same value of slice_x, slice_y, slice_width, slice_height as a slice - in the previous "Frame". + same value of "slice_x, slice_y, slice_width, slice_height" as a + slice in the previous "Frame". 6. Security Considerations Like any other codec, (such as [RFC6716]), FFV1 should not be used with insecure ciphers or cipher-modes that are vulnerable to known plaintext attacks. Some of the header bits as well as the padding are easily predictable. Implementations of the FFV1 codec need to take appropriate security considerations into account, as outlined in [RFC4732]. It is extremely important for the decoder to be robust against malicious payloads. Malicious payloads must not cause the decoder to overrun its allocated memory or to take an excessive amount of resources to - decode. Although problems in encoders are typically rarer, the same - applies to the encoder. Malicious video streams must not cause the - encoder to misbehave because this would allow an attacker to attack - transcoding gateways. A frequent security problem in image and video - codecs is also to not check for integer overflows in "Pixel" count - computations, that is to allocate width * height without considering - that the multiplication result may have overflowed the arithmetic - types range. The range coder could, if implemented naively, read one - byte over the end. The implementation must ensure that no read - outside allocated and initialized memory occurs. + decode. The same applies to the encoder, even though problems in + encoders are typically rarer. Malicious video streams must not cause + the encoder to misbehave because this would allow an attacker to + attack transcoding gateways. A frequent security problem in image + and video codecs is also to not check for integer overflows in + "Pixel" count computations, that is to allocate width * height + without considering that the multiplication result may have + overflowed the arithmetic types range. The range coder could, if + implemented naively, read one byte over the end. The implementation + must ensure that no read outside allocated and initialized memory + occurs. The reference implementation [REFIMPL] contains no known buffer overflow or cases where a specially crafted packet or video segment could cause a significant increase in CPU load. The reference implementation [REFIMPL] was validated in the following conditions: - o Sending the decoder valid packets generated by the reference + * Sending the decoder valid packets generated by the reference encoder and verifying that the decoder's output matches the encoder's input. - o Sending the decoder packets generated by the reference encoder and + * Sending the decoder packets generated by the reference encoder and then subjected to random corruption. - o Sending the decoder random packets that are not FFV1. + * Sending the decoder random packets that are not FFV1. In all of the conditions above, the decoder and encoder was run inside the [VALGRIND] memory debugger as well as clangs address sanitizer [Address-Sanitizer], which track reads and writes to invalid memory regions as well as the use of uninitialized memory. There were no errors reported on any of the tested conditions. 7. Media Type Definition This registration is done using the template defined in [RFC6838] and @@ -1871,47 +1780,49 @@ Subtype name: FFV1 Required parameters: None. Optional parameters: This parameter is used to signal the capabilities of a receiver implementation. This parameter MUST NOT be used for any other purpose. - version: The version of the FFV1 encoding as defined by - Section 4.1.1. + version: The version of the FFV1 encoding as defined by the section + on version (#version). micro_version: The micro_version of the FFV1 encoding as defined by - Section 4.1.2. + the section on micro_version (#micro-version). - coder_type: The coder_type of the FFV1 encoding as defined by - Section 4.1.3. + coder_type: The coder_type of the FFV1 encoding as defined by the + section on coder_type (#coder-type). colorspace_type: The colorspace_type of the FFV1 encoding as defined - by Section 4.1.5. + by the section on colorspace_type (#colorspace-type). - bits_per_raw_sample: The version of the FFV1 encoding as defined by - Section 4.1.7. + bits_per_raw_sample: The bits_per_raw_sample of the FFV1 encoding as + defined by the section on bits_per_raw_sample (#bits-per-raw-sample). max-slices: The value of max-slices is an integer indicating the maximum count of slices with a frames of the FFV1 encoding. Encoding considerations: This media type is defined for encapsulation in several audiovisual - container formats and contains binary data; see Section 4.2.3. This + container formats and contains binary data; see the section on + "Mapping FFV1 into Containers" (#mapping-ffv1-into-containers). This media type is framed binary data Section 4.8 of [RFC6838]. Security considerations: - See Section 6 of this document. + See the "Security Considerations" section (#security-considerations) + of this document. Interoperability considerations: None. Published specification: [I-D.ietf-cellar-ffv1] and RFC XXXX. [RFC Editor: Upon publication as an RFC, please replace "XXXX" with the number assigned to this document and remove this note.] @@ -1919,40 +1830,40 @@ Any application that requires the transport of lossless video can use this media type. Some examples are, but not limited to screen recording, scientific imaging, and digital video preservation. Fragment identifier considerations: N/A. Additional information: None. Person & email address to contact for further information: Michael - Niedermayer + Niedermayer michael@niedermayer.cc (mailto:michael@niedermayer.cc) Intended usage: COMMON Restrictions on usage: None. - Author: Dave Rice + Author: Dave Rice dave@dericed.com (mailto:dave@dericed.com) Change controller: IETF cellar working group delegated from the IESG. 8. IANA Considerations The IANA is requested to register the following values: - o Media type registration as described in Section 7. + * Media type registration as described in Media Type Definition + (#media-type-definition). 9. Appendixes 9.1. Decoder implementation suggestions - 9.1.1. Multi-threading Support and Independence of Slices The FFV1 bitstream is parsable in two ways: in sequential order as described in this document or with the pre-analysis of the footer of each slice. Each slice footer contains a slice_size field so the boundary of each slice is computable without having to parse the slice content. That allows multi-threading as well as independence of slice content (a bitstream error in a slice header or slice content has no impact on the decoding of the other slices). @@ -1955,43 +1866,45 @@ slice content. That allows multi-threading as well as independence of slice content (a bitstream error in a slice header or slice content has no impact on the decoding of the other slices). After having checked keyframe field, a decoder SHOULD parse slice_size fields, from slice_size of the last slice at the end of the "Frame" up to slice_size of the first slice at the beginning of the "Frame", before parsing slices, in order to have slices boundaries. A decoder MAY fallback on sequential order e.g. in case of a corrupted "Frame" (frame size unknown, slice_size of slices not - coherent...) or if there is no possibility of seek into the stream. + coherent...) or if there is no possibility of seeking into the + stream. 10. Changelog - See - -11. References + See https://github.com/FFmpeg/FFV1/commits/master + (https://github.com/FFmpeg/FFV1/commits/master) -11.1. Normative References +11. Normative References [I-D.ietf-cellar-ffv1] Niedermayer, M., Rice, D., and J. Martinez, "FFV1 Video Coding Format Version 0, 1, and 3", draft-ietf-cellar- - ffv1-06 (work in progress), October 2018. + ffv1-07 (work in progress), February 6, 2019, + . [ISO.15444-1.2016] International Organization for Standardization, "Information technology -- JPEG 2000 image coding system: Core coding system", October 2016. [ISO.9899.1990] International Organization for Standardization, - "Programming languages - C", ISO Standard 9899, 1990. + "Programming languages - C", 1990. [RFC2119] Bradner, S., "Key words for use in RFCs to Indicate Requirement Levels", BCP 14, RFC 2119, DOI 10.17487/RFC2119, March 1997, . [RFC4732] Handley, M., Ed., Rescorla, E., Ed., and IAB, "Internet Denial-of-Service Considerations", RFC 4732, DOI 10.17487/RFC4732, December 2006, . @@ -2002,43 +1915,44 @@ [RFC6716] Valin, JM., Vos, K., and T. Terriberry, "Definition of the Opus Audio Codec", RFC 6716, DOI 10.17487/RFC6716, September 2012, . [RFC6838] Freed, N., Klensin, J., and T. Hansen, "Media Type Specifications and Registration Procedures", BCP 13, RFC 6838, DOI 10.17487/RFC6838, January 2013, . -11.2. Informative References +12. Informative References [Address-Sanitizer] - The Clang Team, "ASAN AddressSanitizer website", undated, - . + The Clang Team, "ASAN AddressSanitizer website", August + 2019, . - [AVI] Microsoft, "AVI RIFF File Reference", undated, + [AVI] Microsoft, "AVI RIFF File Reference", August 2019, . [FFV1_V0] Niedermayer, M., "Commit to mark FFV1 version 0 as non- - experimental", April 2006, . + experimental", April 2006, + . [FFV1_V1] Niedermayer, M., "Commit to release FFV1 version 1", April - 2009, . + 2009, + . [FFV1_V3] Niedermayer, M., "Commit to mark FFV1 version 3 as non- - experimental", August 2013, . + experimental", August 2013, + . [HuffYUV] Rudiak-Gould, B., "HuffYUV", December 2003, . [ISO.14495-1.1999] International Organization for Standardization, "Information technology -- Lossless and near-lossless compression of continuous-tone still images: Baseline", December 1999. @@ -2046,42 +1960,38 @@ [ISO.14496-10.2014] International Organization for Standardization, "Information technology -- Coding of audio-visual objects -- Part 10: Advanced Video Coding", September 2014. [ISO.14496-12.2015] International Organization for Standardization, "Information technology -- Coding of audio-visual objects -- Part 12: ISO base media file format", December 2015. - [Matroska] - IETF, "Matroska", 2016, . + [Matroska] IETF, "Matroska", 2016, + . [NUT] Niedermayer, M., "NUT Open Container Format", December 2013, . [range-coding] Nigel, G. and N. Martin, "Range encoding: an algorithm for - removing redundancy from a digitised message.", Proc. - Institution of Electronic and Radio Engineers - International Conference on Video and Data Recording , - July 1979. + removing redundancy from a digitised message.", July 1979. [REFIMPL] Niedermayer, M., "The reference FFV1 implementation / the - FFV1 codec in FFmpeg", undated, . + FFV1 codec in FFmpeg", August 2019, . - [VALGRIND] - Valgrind Developers, "Valgrind website", undated, + [VALGRIND] Valgrind Developers, "Valgrind website", August 2019, . - [YCbCr] Wikipedia, "YCbCr", undated, + [YCbCr] Wikipedia, "YCbCr", August 2019, . Authors' Addresses Michael Niedermayer Email: michael@niedermayer.cc Dave Rice