hash stringlengths 32 32 | doc_id stringlengths 7 13 | section stringlengths 3 121 | content stringlengths 0 2.2M |
|---|---|---|---|
b9577ffd31d53882333a2ffba47a2f9e | 104 053-1 | 6.1.2 Notation | The symbol β denotes the bytewise addition modulo two (exclusive or); i.e. msb of byte x is added to msb of byte y, ...., lsb of byte x to lsb of byte y. x (i)1 x(i)2 x(i)1 β x(i)2 0 0 1 1 0 1 0 1 0 1 1 0 x(i) is bit i of byte x y(i) is bit i of byte y i = 0..., 7 |
b9577ffd31d53882333a2ffba47a2f9e | 104 053-1 | 6.1.3 Output Register | The output register is denoted by R0, R1..., R6, and R7, and functions as an 8-bit wide shift register. The output bytes of sections R0 up to R5 are also used as input for the other functional components of TEA2. The output of R7 is added to the outputs of the other functional components and returned to the first secti... |
b9577ffd31d53882333a2ffba47a2f9e | 104 053-1 | 6.1.4 Cipher Key Register | The Cipher key (CK) register, denoted by K0, K1, ....., K8, and K9, is a ten section 8-bit wide shift register. The bytes of a CK are loaded into the CK register as shown in Figure 8 and before the Initialization Vector is loaded into the Output Register. During initialization and the generation of Cipher bytes the Cip... |
b9577ffd31d53882333a2ffba47a2f9e | 104 053-1 | 6.1.5 Byte Permutation Function | The CK byte permutation function P is an arbitrary permutation on 256 bytes. The look-up table for this permutation is given in Figure 9. The input to the function is two 4-bit nibbles, one higher nibble and one lower nibble. In the output, the left 4-bit nibble is the higher one, e.g. P (37) = A1. |
b9577ffd31d53882333a2ffba47a2f9e | 104 053-1 | 6.1.6 Expander E | The expander function converts a two-byte input to a 32-bit word, i.e. eight 4-bit nibbles for the non-linear function Ζ1 and Ζ2. The structure of expander E and functions Ζ1 and Ζ2 is shown in Figure 10. In this figure, bits 1-8 are the bits of R1, respectively R4. Bits 9-16 are the bits of R0, respectively R3. Bits 1... |
b9577ffd31d53882333a2ffba47a2f9e | 104 053-1 | 6.1.8 8-bit Permutation BP | The permutation BP is a so-called wire crossing, i.e. only one permutation with a fixed pattern. If the eight bits of R5 are numbered 12345678, the order of the bits after BP becomes 48572136. The left bit in both bytes is the most significant and the right bit is the least significant. ETSI ETSI TS 104 053-1 V1.2.1 (2... |
b9577ffd31d53882333a2ffba47a2f9e | 104 053-1 | 6.1.9 Feedback of output register | The results of the functional components BP, Ζ1, Ζ2 and CK byte permutation P are added in the feedback path of the output register and affect the operation (i.e. operation after loading the CK and Initialization vector) as follows: β’ with R'i denoting the next byte value (i.e. after one step) of the output register se... |
b9577ffd31d53882333a2ffba47a2f9e | 104 053-1 | 6.2 Key Stream Generation | |
b9577ffd31d53882333a2ffba47a2f9e | 104 053-1 | 6.2.1 Summary | The algorithm consists of four main phases: the CK loading, the IV loading, the run-up and the key byte generation proper. During the CK loading, the initial state of the Cipher key register is determined. Next, the initial state of the output register is determined by loading of the Initialization Vector as described ... |
b9577ffd31d53882333a2ffba47a2f9e | 104 053-1 | 6.2.2 CK loading | The CK loading depends solely on the 80-bit Cipher Key. The CK bytes are loaded as depicted in the Load Map shown in Figure 8. The CK bytes C1, C2, ....., C10 are shifted into the register from K0 to K9. |
b9577ffd31d53882333a2ffba47a2f9e | 104 053-1 | 6.2.3 IV loading | The output register is first loaded with a 29-bit Initialization Vector. This IV is converted to a 32-bit word by taking the three most significant bits as zeroes, and the remaining 29 bits as the given IV. For instance, if the IV is the binary value: 11010 00011010 11100010 00000110 the 32-bit word becomes: 00011010 0... |
b9577ffd31d53882333a2ffba47a2f9e | 104 053-1 | 6.2.4 Run-up | After the IV load into the output register all functional components of TEA2 become operational and 50 initializing steps are performed to bring the algorithm in the CK and IV dependent starting point from which the generation of key bytes can start. For run-up and key byte generation a step is defined as applying the ... |
b9577ffd31d53882333a2ffba47a2f9e | 104 053-1 | 6.2.5 Key byte generation | After the run-up cycle one step is made to produce the first key byte. Successive key bytes are generated each 19 steps. More precisely, the keystream generator, being byte orientated, generates 8 output bits at a time. Keystream bytes are generated by stepping the algorithm 19 times and then taking the value held in t... |
b9577ffd31d53882333a2ffba47a2f9e | 104 053-1 | 6.3 Figures of TEA2 Algorithm | R0....R7 Output Register (eight 8-bit wide registers) K0....K9 Cipher Key load register (ten 8-bit wide registers) E Expansion from 16 to 32 bits Ζ1, Ζ2 Non-linear function: each eight functions of 4 bits BP Permutation of 8 bits (wire crossing) P Permutation on 28 elements (byte substitution) Figure 7: Functional comp... |
b9577ffd31d53882333a2ffba47a2f9e | 104 053-1 | 7 TEA3 ALGORITHM DESCRIPTION | |
b9577ffd31d53882333a2ffba47a2f9e | 104 053-1 | 7.1 TEA3 Functional Components | |
b9577ffd31d53882333a2ffba47a2f9e | 104 053-1 | 7.1.1 Summary of Components | The cryptographic algorithm TEA3 consists of the following functional components as depicted in Figure 13: β’ An Output Register comprising a set of eight 8-bit wide shift register stages (clause 7.1.3). β’ A Cipher Key Register comprising a set of ten 8-bit wide shift register stages (clause 7.1.4). β’ A byte permutation... |
b9577ffd31d53882333a2ffba47a2f9e | 104 053-1 | 7.1.2 Notation | The symbol β denotes the bytewise addition modulo two (exclusive or); i.e. msb of byte x is added to msb of byte y, ...., lsb of byte x to lsb of byte y. x (i)1 x(i)2 x(i)1 β x(i)2 0 0 0 0 1 1 1 0 1 1 1 0 x(i) is bit i of byte x y(i) is bit i of byte y i=0β¦..,7 |
b9577ffd31d53882333a2ffba47a2f9e | 104 053-1 | 7.1.3 Output Register | The Output Register comprises eight stages denoted by bytes R0 .....R7 and functions as an eight stage 8-bit wide shift register. Stages R1 and R2, and R4, R5 and R6 are also used as input for the other functional components of TEA3. Stage R7 is added to the outputs of the other functional components and returned to th... |
b9577ffd31d53882333a2ffba47a2f9e | 104 053-1 | 7.1.4 Cipher Key Register | The Cipher Key Register comprises ten stages denoted by bytes K0 ......K9 and functions as a ten stage 8-bit wide shift register. Stages K2 and K7 are also used as input for the other functional components of TEA3. Stage K9 is added to the outputs of the other functional components and returned to the first stage K0 as... |
b9577ffd31d53882333a2ffba47a2f9e | 104 053-1 | 7.1.5 Byte Permutation Function P | The byte permutation function P is a fixed random-like permutation on 256 bytes. The look-up table for this permutation is given in Figure 15. The input to the function is two 4-bit nibbles, one higher nibble and one lower nibble. In the output, the left 4-bit nibble is the higher one, e.g. P (27) = 5B. In this example... |
b9577ffd31d53882333a2ffba47a2f9e | 104 053-1 | 7.1.6 Expander E | The expander function converts a two-byte input to a 32-bit word. The 32-bits are subdivided into eight 4-bit nibbles for the nonlinear functions Ζ1 and Ζ2. The structure of expander E and functions Ζ1 and Ζ2 is shown in Figure 16. In this figure, bits 1-8 are the bits of R6 (R2). Bits 9-16 are the bits of R5 (R1). Bit... |
b9577ffd31d53882333a2ffba47a2f9e | 104 053-1 | 7.1.8 8-bit Permutation BP | The permutation BP is a simple wire-crossing, i.e. a reordering of the bits within the byte. If the eight bits of R4 are numbered 12345678, the order of the bits after BP becomes 38467215. The left bit (bit 1) in both bytes is the most significant and the right bit (bit 8) is the least significant. |
b9577ffd31d53882333a2ffba47a2f9e | 104 053-1 | 7.2 Keystream Generation | |
b9577ffd31d53882333a2ffba47a2f9e | 104 053-1 | 7.2.1 Summary | The algorithm consists of three main phases: the CK and the IV loading, the run-up and the keystream generation proper. ETSI ETSI TS 104 053-1 V1.2.1 (2025-02) 24 During the loading phase the Cipher Key is used to set the initial state of the Cipher Key Register (clause 7.2.2), and the Initialization Vector is used to ... |
b9577ffd31d53882333a2ffba47a2f9e | 104 053-1 | 7.2.2 CK loading | The 80-bit Cipher Key is used to initialize the ten stage Cipher Key Register as depicted in the Load Map shown in Figure 14. The CK bytes C1, C2β¦, 10, starting with the most significant byte (C1), are shifted into the Cipher Key Register Ki, entering through stage K0. Note that the feedback function is not enabled at ... |
b9577ffd31d53882333a2ffba47a2f9e | 104 053-1 | 7.2.3 IV loading | The 29-bit IV is converted to a 32-bit word (four bytes) by adding three '0' bits to the most significant end. For instance, if the IV is the binary value: 11010 00011010 11100010 00000110 the 32-bit word becomes: 00011010 00011010 11100010 00000110. The resultant 32-bit IV is used to initialize the Output Register R. ... |
b9577ffd31d53882333a2ffba47a2f9e | 104 053-1 | 7.2.4 Run-up | After the CV and IV have been loaded into their respective registers all functional components of the TEA3 become operational and 32 steps are performed to bring the algorithm to a state where the generation of keystream can start. For run-up and keystream generation a step is defined as applying the formulae in clause... |
b9577ffd31d53882333a2ffba47a2f9e | 104 053-1 | 7.2.5 Key byte generation | The keystream generator, being byte orientated, generates 8 output bits at a time. Keystream bytes are generated by stepping the algorithm 19 times and then taking the value held in the Output Register stage R7. The 8 bits in this register are then used, most-significant bit first, as the next 8 bits of the keystream. |
b9577ffd31d53882333a2ffba47a2f9e | 104 053-1 | 7.3 Figures of TEA3 Algorithm | Figure 13: Functional components of TEA3 ETSI ETSI TS 104 053-1 V1.2.1 (2025-02) 26 Figure 14: Cipher Key Load Map Figure 15: Byte permutation lookup table ETSI ETSI TS 104 053-1 V1.2.1 (2025-02) 27 Figure 16: Structure of expander and functions Ζ1 and Ζ2 Figure 17: Truth table of Ζ1 Figure 18: Truth table of Ζ2 ETSI E... |
b9577ffd31d53882333a2ffba47a2f9e | 104 053-1 | 8 TEA4 ALGORITHM DESCRIPTION | |
b9577ffd31d53882333a2ffba47a2f9e | 104 053-1 | 8.1 TEA4 Functional Components | |
b9577ffd31d53882333a2ffba47a2f9e | 104 053-1 | 8.1.1 Summary of Components | The cryptographic algorithm TEA4 consists of the following functional components as depicted in Figure 19: β’ An Output Register comprising a set of eight 8-bit wide shift register stages (clause 8.1.3). β’ A Cipher Key Register comprising a set of seven 8-bit wide shift register stages (clause 8.1.4). β’ A byte permutati... |
b9577ffd31d53882333a2ffba47a2f9e | 104 053-1 | 8.1.2 Notation | The symbol β denotes the bytewise addition modulo two (exclusive or); i.e. msb of byte x is added to msb of byte y, ...., lsb of byte x to lsb of byte y. x (i)1 x(i)2 x(i)1 β x(i)2 0 0 0 0 1 1 1 0 1 1 1 0 x(i) is bit i of byte x y(i) is bit i of byte y i=0β¦..,7 |
b9577ffd31d53882333a2ffba47a2f9e | 104 053-1 | 8.1.3 Output Register | The Output Register comprises eight stages denoted by bytes R0 .....R7 and functions as an eight stage 8-bit wide shift register. Stages R1 and R2, and R4, R5 and R6 are also used as input for the other functional components of TEA4. Stage R7 is added to the outputs of the other functional components and returned to th... |
b9577ffd31d53882333a2ffba47a2f9e | 104 053-1 | 8.1.4 Cipher Key Register | The Cipher Key Register comprises seven stages denoted by bytes Koβ¦.K6 and function as a seven stage 8-bit wide shift register. Stages K1 and K5 are also used as input for the other functional components of TEA4. Stage K6 is added to the outputs of the other functional components and returned to the first stage Ko as d... |
b9577ffd31d53882333a2ffba47a2f9e | 104 053-1 | 8.1.5 Byte Permutation Function P | The byte permutation function P is a fixed random-like permutation on 256 bytes. The look up table for this permutation is given in Figure 21. The inputs to the function are two 4-bit nibbles, one higher nibble and one lower nibble. In the output, the left 4-bit nibble is the higher one, e.g. P (28) = D4. In this examp... |
b9577ffd31d53882333a2ffba47a2f9e | 104 053-1 | 8.1.6 Expander E | The expander function conve1ts a two-byte input to a 32-bit word. The 32-bits are subdivided into eight 4-bit nibbles for the nonlinear function Ζ1 and Ζ2. The structure of expander E and functions Ζ1 and Ζ2 is shown in Figure 22. In Figure 22, bits 1-8 are the bits of R5 (R1). Bits 9-16 are the bits of R4 (R0). Bits 1... |
b9577ffd31d53882333a2ffba47a2f9e | 104 053-1 | 8.1.8 8-bit Permutation BP | The permutation BP is a simple wire-crossing, i.e. a reordering of the bits within the byte. If the eight bits of R4 are numbered 12345678, the order of the bits after BP becomes 74638152. The left bit (bit 1) in both bytes is the most significant and the right bit (bit 8) is the least significant. |
b9577ffd31d53882333a2ffba47a2f9e | 104 053-1 | 8.2 KEYSTREAM GENERATION | |
b9577ffd31d53882333a2ffba47a2f9e | 104 053-1 | 8.2.1 Summary | The algorithm consists of three main phases: the CK and the IV loading, the run-up and the keystream generation proper. During the loading phase the Cipher Key is used to set the initial state of the Cipher Key Register (clause 8.2.2), and the Initialization Vector is used to set the initial state of the Output Registe... |
b9577ffd31d53882333a2ffba47a2f9e | 104 053-1 | 8.2.2 CK loading | The 80-bit Cipher Key is used to initialize the seven stage Cipher Key Register as defined below and as depicted in Figure 20. All stages of the Cipher Key Register K are initially set to 0, and then the Cipher Key bytes are mixed into the register starting with the most significant byte of the key (C1). The feedback d... |
b9577ffd31d53882333a2ffba47a2f9e | 104 053-1 | 8.2.3 IV loading | The 29-bit IV is converted to a 32-bit word (four bytes) by adding three '0' bits to the most significant end. For instance, if the IV is the binary value: 11010 00011010 11100010 00000110 the 32-bit word becomes: 00011010 00011010 11100010 00000110. The resultant 32-bit IV is used to initialize the Output Register R. ... |
b9577ffd31d53882333a2ffba47a2f9e | 104 053-1 | 8.2.4 Run-up | After the CV and IV have been loaded into their respective registers all functional components of TEA4 become operational and 35 steps are performed to bring the algorithm to a state where the generation of keystream can start. For run-up and keystream generation a step is defined as applying the formulae in clause 8.1... |
b9577ffd31d53882333a2ffba47a2f9e | 104 053-1 | 8.2.5 Keystream generation | The keystream generator, being byte orientated, generates 8 output bits at a time. Keystream bytes are generated by stepping the algorithm 19 times and then taking the value held in the Output Register stage R7. The 8 bits in this register are then used, most-significant bit first, as the next 8 bits of the keystream. ... |
b9577ffd31d53882333a2ffba47a2f9e | 104 053-1 | 8.3 Figures of TEA4 Algorithm | Figure 19: Functional components of TEA4 Figure 20: Cipher Key Load Map ETSI ETSI TS 104 053-1 V1.2.1 (2025-02) 33 Figure 21: Byte permutation lookup table Figure 22: Structure of expander and functions Ζ1 and Ζ2 ETSI ETSI TS 104 053-1 V1.2.1 (2025-02) 34 Figure 23: Truth table of Ζ1 Figure 24: Truth table of f2 ETSI E... |
4b5f77d85580decea5022e899016dcb5 | 104 002 | 1 Scope | The present document specifies DASH-IF Forensic A/B Watermarking. |
4b5f77d85580decea5022e899016dcb5 | 104 002 | 2 References | |
4b5f77d85580decea5022e899016dcb5 | 104 002 | 2.1 Normative references | References are either specific (identified by date of publication and/or edition number or version number) or non-specific. For specific references, only the cited version applies. For non-specific references, the latest version of the referenced document (including any amendments) applies. Referenced documents which a... |
4b5f77d85580decea5022e899016dcb5 | 104 002 | 2.2 Informative references | References are either specific (identified by date of publication and/or edition number or version number) or non-specific. For specific references, only the cited version applies. For non-specific references, the latest version of the referenced document (including any amendments) applies. NOTE: While any hyperlinks i... |
4b5f77d85580decea5022e899016dcb5 | 104 002 | 3 Definition of terms, symbols and abbreviations | |
4b5f77d85580decea5022e899016dcb5 | 104 002 | 3.1 Terms | For the purposes of the present document, the following terms apply: client-driven watermarking: action of watermarking content when the user device is performing some actions allowing it to make unique requests for content NOTE: The user device embeds a watermarking agent that is integrated with the application. clien... |
4b5f77d85580decea5022e899016dcb5 | 104 002 | 3.2 Symbols | Void. |
4b5f77d85580decea5022e899016dcb5 | 104 002 | 3.3 Abbreviations | For the purposes of the present document, the following abbreviations apply: ABR Adaptive Bit Rate AES Advanced Encryption Standard AF Adaptation Field API Application Programming Interface AVC Advanced Video Codec CBOR Concise Binary Object Representation CDDL Concise Data Definition Language CDN Content Delivery Netw... |
4b5f77d85580decea5022e899016dcb5 | 104 002 | 4 OTT Watermarking Using Variants | The objective of forensic watermarking is to deliver a unique version of a media asset to the different users consuming the asset. This is somewhat in opposition with media delivery mechanisms that aim at delivering the same asset to all users for efficiency purposes. As a result, in the broadcast era, a typical approa... |
4b5f77d85580decea5022e899016dcb5 | 104 002 | 5 Server-Driven Architecture and Workflows | |
4b5f77d85580decea5022e899016dcb5 | 104 002 | 5.1 Introduction | In the server-driven architecture, the device is unaware that content it consumes is watermarked. The device only exchanges a token with servers allowing these servers, usually CDN edges, to make the decision on which A or B Variant it delivers to the device. In the present document, an end-to-end system is presented. ... |
4b5f77d85580decea5022e899016dcb5 | 104 002 | 5.2 Functional Architecture | Figure 2 shows the simplified high-level functional architecture and the different interaction between the components that are involved in the flows when a device consumes watermarked content. Note that this also shows that content is encrypted, as watermarking will likely be added for premium content that is also encr... |
4b5f77d85580decea5022e899016dcb5 | 104 002 | 5.3 System Configuration | Enabling or disabling the edge sequencing logic is set through the configuration to the edge. As an example, this can be useful for a service of live sporting events where only premium events require watermarking enforcement. Other moments of the day do not require it. In this case, content is still watermarked but the... |
4b5f77d85580decea5022e899016dcb5 | 104 002 | 5.4 WM Token | A WM token provides a WM pattern which is unique (for example per streaming session or per user). This pattern allows the sequencing of A/B Variants. Two tokenization schemes are defined in the present document. The first, named direct, embeds the WM pattern in the token and can be opened and interpreted by an edge irr... |
4b5f77d85580decea5022e899016dcb5 | 104 002 | 5.5 WMPaceInfo | |
4b5f77d85580decea5022e899016dcb5 | 104 002 | 5.5.1 Introduction | When a device requests a segment, the edge sequencing logic needs to know which bit in the unique WM pattern to consider for retrieving either A or B Variant of the requested segment before delivering it to the device. WMPaceInfo contains this mapping in addition to some data needed for content preparation. It is trans... |
4b5f77d85580decea5022e899016dcb5 | 104 002 | 5.5.2 WMPaceInfo Data | WMPaceInfo is as shown in Table 2. Table 2: WMPaceInfo data Attribute Producer Consumers Purpose variant Encoder Edge Integration, debugging position Encoder Edge Bit position in the WM pattern firstpart Encoder Packager, Origin Egress packaging lastpart Encoder Packager, Origin Egress packaging Where - variant gives t... |
4b5f77d85580decea5022e899016dcb5 | 104 002 | 5.5.3 Conveying WMPaceInfo | |
4b5f77d85580decea5022e899016dcb5 | 104 002 | 5.5.3.1 Introduction | WMPaceInfo is delivered from the encoder to other servers. There is no unique mechanism for this. The present document does not recommend one preferred option applicable for all protocols, Table 3 only presents some possible options for conveying WMPaceInfo with a preferred option for some protocols (in bold in the tab... |
4b5f77d85580decea5022e899016dcb5 | 104 002 | 5.5.3.2 Sidecar File | When segments (discrete files or byteranges) are delivered with a file transfer protocol, it may be convenient to have WMPaceInfo data in a sidecar file. For efficiency, the WMPaceInfo data is not copied directly as some would be included multiple times. The sidecar file is of the following format (using CDDL represent... |
4b5f77d85580decea5022e899016dcb5 | 104 002 | 5.5.3.3 HTTP Header | When content is pushed, in the request header, under the WMPaceInfoIngest HTTP header field, the following JSON object is added: WMPaceInfoIngest : { "version": version, "variant": variant, "position": position, "firstpart": firstpart, "lastpart": lastpart } Where - version is set to 1 for WMPaceInfoIngest compliant to... |
4b5f77d85580decea5022e899016dcb5 | 104 002 | 5.5.3.4 ISOBMFF Box | The format of WMPaceInfo class shall be: class WMPaceInfo { unsigned int(8) version; unsigned int(8) variant; unsigned int(1) emulation_1; unsigned int(15) position; unsigned int(1) emulation_2; unsigned int(1) firstpart; unsigned int(1) lastpart; unsigned int(5) reserved; } Where - version is set to 1 for WMPaceInfo c... |
4b5f77d85580decea5022e899016dcb5 | 104 002 | 5.5.3.5 SEI Message | SEI messages are inserted in the stream with a specific syntax depending on the codec. [8] provides the syntax for AVC, HEVC and AV1 video codecs in Annex B. In these messages: - The UUID shall be equal to 0xbec4f824-170d-47cf-a826-ce008083e355. - The watermarking metadata is the WMPaceInfo data with the format defined... |
4b5f77d85580decea5022e899016dcb5 | 104 002 | 5.5.3.6 TS Adaptation Field | Following clause U of [2], the format of the private adaptation field descriptor carrying the WMPaceInfo data is defined in Table 4. Table 4: WMPaceInfo descriptor Syntax No. of bits Mnemonic temi_WMPaceInfo_descriptor { af_descr_tag af_descr_length WMPaceInfo() } 8 8 40 uimsbf uimsbf uimsbf Where - af_descr_tag is an ... |
4b5f77d85580decea5022e899016dcb5 | 104 002 | 5.6 Content Preparation | |
4b5f77d85580decea5022e899016dcb5 | 104 002 | 5.6.1 Introduction | Content preparation means the generation of A/B Variants of the segments followed by the push of content on the origin. It is under a workflow manager responsibility in case of VOD and fully automated for Live content. The encoder generates the different Variants of the adaptive content. The encrypted segments, the DAS... |
4b5f77d85580decea5022e899016dcb5 | 104 002 | 5.6.2 Encoding Recommendations | This clause contains recommendation when encoding content. The goal is to facilitate the creation and management of A and B Variants in the delivery chain. When segments are requested as byteranges in a file or when chunks are requested as byteranges in a segment, the segments and chunks in A and B Variants shall have ... |
4b5f77d85580decea5022e899016dcb5 | 104 002 | 5.6.4 Segment Ingress Path Structure on the Origin | |
4b5f77d85580decea5022e899016dcb5 | 104 002 | 5.6.4.1 Introduction | The DASH manifest [1] and HLS playlist [3] served to the devices are "neutral", meaning that: - The same playlist or manifest is served to all devices of all end-users. - It does not expose different names for A and B Variants of a given segment. |
4b5f77d85580decea5022e899016dcb5 | 104 002 | 5.6.4.2 Locating the Variants | Egress DASH manifests and HLS playlists shall be neutral, but ingest DASH manifests and HLS playlists include information about the A and B Variants being ingested, this is: - The ingest path. - Some signalling elements to describe if a DASH Adaptation Set includes the A or B Variants, or if an HLS media playlist inclu... |
4b5f77d85580decea5022e899016dcb5 | 104 002 | 5.6.4.3 Locating the Sidecar File | The sidecar file is part of the ingest with the DASH manifest or HLS playlist, the link to this file is added in different places depending on the format. DASH ingest manifests shall include an EssentialProperty element at the Representation level with a @schemeIdUri attribute equal to http://dashif.org/guidelines/wate... |
4b5f77d85580decea5022e899016dcb5 | 104 002 | 5.6.5 Packaging Recommendations | This clause contains requirements where packaged content is served to devices. The goal is to facilitate the creation and management of A and B Variants in the delivery chain. These requirements apply even if no re-packaging process exists. NOTE: This implies that an encoder working against a completely passive receive... |
4b5f77d85580decea5022e899016dcb5 | 104 002 | 5.7 Content Playback | |
4b5f77d85580decea5022e899016dcb5 | 104 002 | 5.7.1 Introduction | The flow for content playback is shown in the following clauses. The origin received content as explained in clause 5.5. It has access to the A/B Variants and the WMPaceInfo data. This clause describes only the case where the WM token is used in direct mode and does not consider the value of wmsegduration (hence using ... |
4b5f77d85580decea5022e899016dcb5 | 104 002 | 5.7.2 Dynamic Ad Insertion | In case of Dynamic Ad Insertion (DAI), the break may happen at any time. As every segment carries watermarking information allowing to perform the detection, there shall not be segments carrying conflicting data. While some techniques may recover from this mix of data, it will, in all cases, impact the length of conten... |
4b5f77d85580decea5022e899016dcb5 | 104 002 | 5.7.3 WM Token, DASH Manifest and HLS Playlists Acquisition | The device acquires the WM token in an implementation specific manner. It may be retrieved directly from a WM token server, or it may be provided in a response from another server as part of other data required for playing back content. The WM token may be added as part of the virtual path of the requested object, as a... |
4b5f77d85580decea5022e899016dcb5 | 104 002 | 5.7.4 Initialization Segment Acquisition | When content is delivered as byteranges, as the initialization segment is within the file, the token shall be added in the request as the requested file has a name that matches the pattern for watermarked content. The edge will then apply the exact same logic it applies for a media segment, it retrieves the sidecar fil... |
4b5f77d85580decea5022e899016dcb5 | 104 002 | 5.7.5 Media Segments and WMPaceInfo Acquisition | |
4b5f77d85580decea5022e899016dcb5 | 104 002 | 5.7.5.1 General Requirements | For the media segments, a token shall be attached to the HTTP requests. If not present, the edge shall reject the request and shall not deliver the segment. The edge shall validate the WM token (that can include checking signed data or decrypting some claims) which is attached to the requests and extracts the WM patter... |
4b5f77d85580decea5022e899016dcb5 | 104 002 | 5.7.5.2 WMPaceInfo Acquisition | For each device request for /pathname/filename, the edge shall retrieve from the origin egress WMPaceInfo data associated to this object. The origin presents this information differently whether segments are discrete or byteranges: - For byterange segment, the origin shall have a dedicated endpoint for delivering WMPac... |
4b5f77d85580decea5022e899016dcb5 | 104 002 | 5.7.5.3 Discrete Files | For the media segments delivered as discrete files, the flow is shown in Figure 6. The edge sequences the A or B Variant of a segment based on the WM pattern contained in the token. It has two options to know the position of the segment within the WM pattern: - First make a request to the origin to retrieve the WMPaceI... |
4b5f77d85580decea5022e899016dcb5 | 104 002 | 5.7.5.4 Byterange | For the media segments delivered as byteranges, the flow is shown in Figure 7. The edge delivers the A or B Variant of a segment based on the WM pattern contained in the token. To know which position in the WM pattern it has to consider, it needs to retrieve the sidecar file associated to this track. It first makes a H... |
4b5f77d85580decea5022e899016dcb5 | 104 002 | 5.8 Monitoring and Watermark Detection | If content is found, a detection of a WM pattern can be performed. A video acquisition that includes valuable content (no commercial breaks for example) is performed. As the unique ID is obtained by extracting information from segments (0 or 1 in every segment), the acquired content shall be of several minutes (the lon... |
3c44d6b4e93165c24c893e9e439c2e16 | 104 043 | 1 Scope | The present document defines O-RAN OAM interface functions and protocols for the O-RAN O1 interface. The present document studies the functions conveyed over the interface, including management functions, procedures, operations, and corresponding solutions, and identifies existing standards and industry work that can s... |
3c44d6b4e93165c24c893e9e439c2e16 | 104 043 | 2 References | |
3c44d6b4e93165c24c893e9e439c2e16 | 104 043 | 2.1 Normative references | References are either specific (identified by date of publication and/or edition number or version number) or non-specific. For specific references, only the cited version applies. For non-specific references, the latest version of the referenced document (including any amendments) applies. Referenced documents which a... |
3c44d6b4e93165c24c893e9e439c2e16 | 104 043 | 2.2 Informative references | References are either specific (identified by date of publication and/or edition number or version number) or non specific. For specific references, only the cited version applies. For non-specific references, the latest version of the referenced document (including any amendments) applies. Referenced documents which a... |
3c44d6b4e93165c24c893e9e439c2e16 | 104 043 | 3 Definition of terms, symbols and abbreviations | |
3c44d6b4e93165c24c893e9e439c2e16 | 104 043 | 3.1 Terms | For the purposes of the present document, the terms given in 3GPP TR 21.905 [i.1] apply. NOTE: A term defined in the present document takes precedence over the definition of the same term, if any, in 3GPP TR 21.905 [i.1]. |
3c44d6b4e93165c24c893e9e439c2e16 | 104 043 | 3.2 Symbols | For the purposes of the present document, the symbols given in 3GPP TR 21.905 [i.1] apply. NOTE: A symbol defined in the present document takes precedence over the definition of the same symbol, if any, in 3GPP TR 21.905 [i.1]. |
3c44d6b4e93165c24c893e9e439c2e16 | 104 043 | 3.3 Abbreviations | For the purposes of the present document, the abbreviations given in 3GPP TR 21.905 [i.1] and the following apply: NOTE: An abbreviation defined in the present document takes precedence over the definition of the same abbreviation, if any, in 3GPP TR 21.905 [i.1]. 3GPP 3rd Generation Partnership Project ETSI ETSI TS 10... |
3c44d6b4e93165c24c893e9e439c2e16 | 104 043 | 4 General Requirements | |
3c44d6b4e93165c24c893e9e439c2e16 | 104 043 | 4.1 Service Management and Orchestration (SMO) | REQ-SMO-FUN-1: O-RAN compliant SMOs shall support the O1 interfaces as defined in the present document. |
3c44d6b4e93165c24c893e9e439c2e16 | 104 043 | 4.2 Transport Layer Security (TLS) | TLS requirements specified in O-RAN Security Protocol Specifications [16] clauses 4.2, 4.3 and 4.4 shall apply. |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.