Abstract: Implementations described herein relate to methods, devices, and computer-readable media to transcode a video. In some implementations, a computer-implemented method includes obtaining a video that includes a plurality of tracks. The method further includes determining whether a partial transcoded file is available that corresponds to the video. The method further includes, if the partial transcoded file is available, obtaining a timestamp associated with the partial transcoded file, transcoding a portion of the video that begins at the timestamp associated with the partial transcoded file, and combining the partial transcoded file and the transcoded portion of the video to generate an output video. The method further includes, if the partial transcoded file is not available, transcoding the video from a start of the video using the transcoder to obtain a plurality of output tracks and combining the plurality of output tracks to obtain the output video.

Abstract: A channel encoding method in a communication or broadcasting system is provided. The channel encoding method includes reading a first sequence corresponding to a parity check matrix, converting the first sequence to a second sequence by applying a certain rule to a block size corresponding to a parity check matrix and the first sequence, and encoding information bits based on the second sequence. The block size has at least two different integer values.

Abstract: An image decoding method and apparatus according to an embodiment may extract, from a bitstream, a quantization coefficient generated through core transformation, secondary transformation, and quantization; generate an inverse-quantization coefficient by performing inverse quantization on the quantization coefficient; generate a secondary inverse-transformation coefficient by performing secondary inverse-transformation on a low frequency component of the inverse-quantization coefficient, the secondary inverse-transformation corresponding to the secondary transformation; and perform core inverse-transformation on the secondary inverse-transformation coefficient, the core inverse-transformation corresponding to the core transformation.

Abstract: The present invention relates to an entropy encoding method, an entropy decoding method and to an apparatus using same. The entropy decoding method includes: a step of decoding a bin of a syntax element; and a step of acquiring information on the syntax element based on the decoded bin. In the step of decoding the bin, context-based decoding or bypass decoding is performed for each bin of the syntax element.

Abstract: Systems, computer-implemented methods, and computer program products to facilitate approximating a range of sideband frequencies efficiently are provided. According to an embodiment, a system can comprise a processor that executes computer executable components stored in memory. The computer executable components comprise a wave division component that generates a plurality of waveform snippets using a definition of an intended waveform, wherein the plurality of waveform snippets can be phase shifted. The computer executable components further comprise rotation component that assigns a phase rotation to be applied to at least one waveform snippet of the plurality of waveform snippets, wherein the phase rotation is out of phase with a previous waveform snippet of the plurality of waveform snippets.

Abstract: A channel encoding method in a communication or broadcasting system is provided. The channel encoding method includes reading a first sequence corresponding to a parity check matrix, converting the first sequence to a second sequence by applying a certain rule to a block size corresponding to a parity check matrix and the first sequence, and encoding information bits based on the second sequence. The block size has at least two different integer values.

Abstract: An image decoding method and apparatus according to an embodiment may extract, from a bitstream, a quantization coefficient generated through core transformation, secondary transformation, and quantization; generate an inverse-quantization coefficient by performing inverse quantization on the quantization coefficient; generate a secondary inverse-transformation coefficient by performing secondary inverse-transformation on a low frequency component of the inverse-quantization coefficient, the secondary inverse-transformation corresponding to the secondary transformation; and perform core inverse-transformation on the secondary inverse-transformation coefficient, the core inverse-transformation corresponding to the core transformation.

Abstract: An entropy decoder is configured to, for horizontal and vertical components of motion vector differences, derive a truncated unary code from the data stream using context-adaptive binary entropy decoding with exactly one context per bin position of the truncated unary code, which is common for horizontal and vertical components of the motion vector differences, and an Exp-Golomb code using a constant equi-probability bypass mode to obtain the binarizations of the motion vector differences. A desymbolizer is configured to debinarize the binarizations of the motion vector difference syntax elements to obtain integer values of the horizontal and vertical components of the motion vector differences. A reconstructor is configured to reconstruct a video based on the integer values of the horizontal and vertical components of the motion vector differences.

Abstract: A decoder includes an entropy decoder configured to derive a number of bins of the binarizations from the data stream using binary entropy decoding by selecting a context among different contexts and updating probability states associated with the different contexts, dependent on previously decoded portions of the data stream; a desymbolizer configured to debinarize the binarizations of the syntax elements to obtain integer values of the syntax elements; a reconstructor configured to reconstruct the video based on the integer values of the syntax elements using a quantization parameter, wherein the entropy decoder is configured to distinguish between 126 probability states and to initialize the probability states associated with the different contexts according to a linear equation of the quantization parameter, wherein the entropy decoder is configured to, for each of the different contexts, derive a slope and an offset of the linear equation from first and second four bit parts of a respective 8 bit initial

Abstract: A method and apparatus for parallel context processing for example for high coding efficient entropy coding in HEVC. The method comprising retrieving syntax element relating to a block of an image, grouping at least two bins belonging to similar context based on the syntax element, and coding the grouped bins in parallel.

Abstract: Provided are a transmitter and a method for transmitting a data block in a wireless communication system. The method comprises the following steps: deciding the number of bits (s) and encoders (NES) to allocate to one axis of a signal constellation; encoding an information bit based on the s and the NES and generating a coded block; parsing the coded block based on the s and the NES and generating a plurality of frequency sub-blocks; and transmitting the plurality of frequency sub-blocks to a receiver.

Abstract: A video packaging and origination service can include one or more encoder components that receive content for encoding and transmitting to requesting entities. During the operation of the encoder components, individual encoders receive input signals for encoding and determine quality metric information related to the generation of an encoded segment. The encoder components exchange quality metric information and an encoder component is selected to transmit an encoded segment. The selection of an individual encoder component per segment can continue throughout the streaming process.

Abstract: A method for encoding a video sequence is provided that includes entropy encoding syntax elements representative of transform coefficients generated as the video sequence is processed, wherein entropy encoding syntax elements representative of a transform coefficient includes binarizing the syntax elements representative of the transform coefficient to generate a plurality of binary symbols (bins), coding a portion of the plurality of bins in context coding mode, and coding a remaining portion of the plurality of bins in bypass coding mode. The method further includes reducing the number of bins that are coded in context coding mode for each transform coefficient in a plurality of subsequent transform coefficients that are entropy encoded after a specified number of transform coefficients have been entropy encoded.

Abstract: The invention proposes a method and a device for arithmetic encoding of a current spectral coefficient using preceding spectral coefficients. The preceding spectral coefficients are already encoded, and both the preceding and current spectral coefficients are comprised in one or more quantized spectra resulting from quantizing a time-frequency-transform of video, audio or speech signal sample values.

Abstract: Techniques are described herein for video coding, including compression of bitstream indexes for neural network based video coding and/or parallel entropy coding. One example includes obtaining a sequence of video data, identifying positions in the sequence of video data associated with entry points for individually entropy codable parcels of a parallel entropy codable sequence of video data, and generating the parallel entropy codable sequence of video data. An index is then generated for the parallel entropy codable sequence of video data, the index identifying the individually entropy codable parcels within the parallel entropy codable sequence of video data.

Abstract: Methods and apparatus for compressing data streams. In an embodiment, a method includes calculating a probability distribution function (PDF) for scaler data, matching the PDF to PDF templates to determine a closest matching PDF template, and selecting an encoder corresponding to the closest matching PDF template wherein a corresponding encoder identifier is determined. The method also includes encoding the scaler data with the encoder to generate an encoded stream, and transmitting the encoded stream and the encoder identifier.

Abstract: A method for encoding a video sequence in a video encoder to generate a compressed video bit stream is provided that includes binarizing a plurality of syntax elements, wherein each binarized syntax element comprises a string of one or more binary symbols (bins), wherein a bin is one selected from a context-coded bin and bypass bin, encoding the context-coded bins of the binarized syntax elements using binary arithmetic encoding, and adding the bypass bins of the binarized syntax elements to the compressed video bit stream with no encoding.

Abstract: Methods and apparatuses for video coding and decoding are provided. The method of video encoding includes accessing a bin of a syntax element associated with a block in a picture of a video, determining a context for the bin of the syntax element associated with the syntax element and entropy encoding the bin of the syntax element based on the determined context wherein either the bin of the syntax element is based on the relevance of a prediction by a neural network of the syntax element or the probability associated to the context is determined by a neural network. A bitstream formatted to include encoded data, a computer-readable storage medium and a computer-readable program product are also described.

Abstract: Implementations described herein relate to methods, devices, and computer-readable media to transcode a video. In some implementations, a computer-implemented method includes obtaining a video that includes a plurality of tracks. The method further includes determining whether a partial transcoded file is available that corresponds to the video. The method further includes, if the partial transcoded file is available, obtaining a timestamp associated with the partial transcoded file, transcoding a portion of the video that begins at the timestamp associated with the partial transcoded file, and combining the partial transcoded file and the transcoded portion of the video to generate an output video. The method further includes, if the partial transcoded file is not available, transcoding the video from a start of the video using the transcoder to obtain a plurality of output tracks and combining the plurality of output tracks to obtain the output video.

Abstract: An example device for coding video data includes a memory configured to store video data; and one or more processors implemented in circuitry and configured to: code a first codeword representing a selected transform scheme of a set of transform candidates of a multiple transform selection (MTS) scheme for a current block of video data, the selected transform scheme being a secondary transform of a set of available secondary transforms to be applied in addition to a primary transform; code a second codeword representing the secondary transform from the set of available secondary transforms; and apply the primary transform and the secondary transform during coding of residual data for the current block. The second codeword may be a value for a low-frequency non-separable transform (LFNST) syntax element.

Abstract: A channel encoding method in a communication or broadcasting system is provided. The channel encoding method includes reading a first sequence corresponding to a parity check matrix, converting the first sequence to a second sequence by applying a certain rule to a block size corresponding to a parity check matrix and the first sequence, and encoding information bits based on the second sequence. The block size has at least two different integer values.

Abstract: According to one method, a method for decoding data using rate sorted entropy coding occurs at a video decoder implemented using at least one processor. The method comprises: receiving rate control information associated with a first bitstream; determining, using the rate control information, a maximum amount of bits available for a next symbol in the first bitstream; determining, using a symbol probability model and a first deterministic algorithm, an amount of bits for a least probable value of the next symbol; and determining that the next symbol is included in the first bitstream if the amount of bits for the least probable value of the next symbol is less than or equal to the maximum amount of bits available for the first bitstream.

Abstract: A method for image processing includes color correcting an image via a first color mapping process to obtain a color corrected image, and compressing the color corrected image via a second color mapping process to obtain a compressed image.

Abstract: Systems, apparatus and methods are provided for compressing data and decompressing compressed data. A method may comprise receiving an input data block to be compressed, generating a number of occurrences table and a cumulative occurrences table for distinct symbols in the input data block, for each symbol in the input data block, based on the number of occurrences table and the cumulative occurrences table, dynamically obtaining a number of shifts for right-shifting a current state “x” to encode a current symbol, outputting right-shifted bits to encoded data and obtaining a next state “x” and obtaining a final state “X” from a last state “x” generated in a final loop.

Abstract: An encoder is an encoder which encodes image information and includes memory and circuitry accessible to the memory. The circuitry derives, from the image information, a binary data string according to binarization for arithmetic encoding, and outputs a bit stream including the binary data string and application information indicating whether or not the binary data string has been arithmetic encoded. The circuitry outputs, as the bit stream, a string including as the binary data string, a data string which has not been arithmetic encoded; and, as the application information, information indicating that the binary data string has not been arithmetic encoded.

Abstract: A computer program product, an apparatus, a functionally safe programmable controller and a method for processing data, wherein an uncoded real number x is converted into a logarithmic number system (LNS) coded integer xLNS via a predetermined conversion rule for a logarithmic number system (LNS) in accordance with the relationship: xLNS=sgn(x)·2m+Id|x|·2n, where sgn(x) denotes a sign function of the uncoded real number x, Id|x| denotes a binary logarithm of the uncoded real number x, m denotes a first exponent and n denotes a second exponent, and the LNS-coded integer xLNS is coded into an arithmetically coded integer xc via arithmetic coding such that the required integer operations is reduced.

Abstract: A binary arithmetic device includes an LPS/MPS determining unit that determines, using a context variable, a range length, and an offset, whether a code is an inferior probability code or a superior probability code, a renormalization processing unit that performs renormalization processing on the range length and the offset, and a context-variable calculating unit that derives the binary data of the code using a determination result and updates the context variable according to the determination result. The renormalization processing unit 15 includes a first renormalizing unit and a second renormalizing unit and a selecting unit that selects, according to the determination result, an output of the first renormalizing unit or an output of the second renormalizing unit.

Abstract: To achieve a reduction in the amount of coding taken in the use of an asymmetric partition and to implement efficient encoding/decoding processes exploiting the characteristics of the asymmetric partition. An image decoding device includes a motion compensation parameter derivation unit configured to derive a motion compensation parameter indicating either a uni-prediction scheme or a bi-prediction scheme. In a case that a prediction unit has a size less than or equal to a predetermined value, the motion compensation parameter derivation unit is configured to derive the motion compensation parameter by switching between the prediction schemes.

Abstract: Wedgelet-based coding for coding blocks of varying size is rendered more efficient by the usage of a variable length coded syntax element having a prefix and a suffix, wherein the size of the suffix is dependent on the prefix and the size of the current coding block. By this measure, it is feasible to efficiently adapt the length of the variable-length coded syntax element which controls the bi-partitioning of the current coding block to the actual needs, namely the size, of the current coding block, and the variability of the bi-partitioning by varying the wedglet separation line, respectively. The greater the current coding block is, the longer the variable-length coded syntax element may be. This length dependency may even be sufficiently effective in terms of coding efficiency so that the variable length coded syntax element may be coded without context-adaptive entropy coding, but directly or using fixed-equal-probability binary entropy coding.

Abstract: To speed up decoding of a range code. A decompression circuit calculates a plurality of candidate bit values for each bit of the N-bit string based on a plurality of possible bit histories of a bit before a K-th bit in parallel for a plurality of bits, and repeatedly selects a correct bit value of the K-th bit from the plurality of candidate bit values based on a correct bit history of the bit before the K-th bit to decode the N-bit string.

Abstract: Systems, apparatus and methods are provided for decompressing compressed data. A method may include receiving encoded data to be decompressed, obtaining a “Stotal” of a total number of symbols, numbers of occurrences for distinct symbols in the encoded data, and a final state generated during an encoding process as a first state for decoding, building a decoding table containing a row of the distinct symbols, a row of substitutes for numbers of bits to be recovered and a row of substitutes for new states corresponding to encoding states, decoding using the decoding table including: obtaining a current symbol from the decoding table based on a current state X, dynamically determining a current number of bits to be recovered from the encoded data and a new state X based on corresponding substitutes and outputting symbols recovered. L may be a sum of the numbers of occurrences for the distinct symbols.

Abstract: Systems, apparatus and methods are provided for compressing data and decompressing compressed data. A method may include receiving encoded data to be decompressed, obtaining a size “Stotal” of a total number of symbols in the encoded data, numbers of occurrences for distinct symbols in the encoded data, a number L of sum of the numbers of occurrences for the distinct symbols, and a final state generated during an encoding process as a first state for decoding, building a decoding table containing the distinct symbols corresponding to L encoding states, decoding the encoded data using the decoding table including: obtaining a current symbol from the decoding table based on a current state X, dynamically determining a current number of bits to be recovered from the encoded data and a new state X, and outputting symbols recovered from the encoded data.

Abstract: A decoding method includes: predicting a current block in an image using a reference block, to generate a prediction block; and generating a reconstructed block using the prediction block, wherein the generating includes: filtering for a boundary between the reconstructed block and a decoded neighboring block, using a first filter strength set using first prediction information for prediction of the current block and second prediction information for prediction of the decoded neighboring block; filtering for the boundary using a second filter strength set without using the second prediction information of the current block and the decoded neighboring block; and switching whether to execute the second filtering, based on the boundary, wherein the first filtering is in-loop filtering in which a filtered reconstructed block is used as a reference block for another block, and the second filtering is post filtering outside the loop.

Abstract: A communication node processing a communication signal in a distributed antenna system includes a data appearance frequency monitor configured to receive a communication signal including a sign bit string, a count leading zero bit string, and an additional data bit string, and to monitor data appearance frequency in the count leading zero bit string included in the received communication signal, a Huffman encoder configured to encode the count leading zero bit string into a corresponding codeword according to a Huffman encoding algorithm based on the data appearance frequency in the count leading zero bit string and an additional bit allocator configured to allocate additional bits to the additional data bit string when the number of bits in the count leading zero bit string decreases during the encoding process.

Abstract: Techniques and apparatus are provided for efficiently generating multiple lifted low-density parity-check (LDPC) codes for a range of block lengths and having good performance. A method for wireless communications by a transmitting device generally includes selecting integer lifting values for a first lifting size value Z, selected from a range of lifting size values, wherein the selected integer lifting value is greater than a maximum lifting size value of the range of lifting size values; determining one or more integer lifting values for generating at least a second lifted LDPC code having a second lifting size value based on an operation involving the second lifting size value and the selected one or more integer lifting values for generating the first lifted LDPC code; encoding a set of information bits based on the second lifted LDPC to produce a code word; and transmitting the code word.

Abstract: A gaussian frequency shift keying (GFSK) detector comprising a multi-symbol detector; at least three Viterbi decoders, and a timing adjustment module. The multi-symbol detector receives a series of samples representing a received GFSK modulated signal which comprises at least three samples per symbol; and generates, for each set of samples representing an N-symbol sequence of the GFSK modulated signal, at least three sets of soft decisions values, each set of soft decision values indicating the probability that the N-symbol sequence of samples is each possible N-symbol pattern based on a different one of the at least three samples of a symbol being a centre sample of the symbol. Each Viterbi decoder generates, for each N-symbol sequence, a path metric for each possible N-symbol pattern from a different set of soft decision values according to a Viterbi decoding algorithm.

Abstract: An apparatus for decoding a current block in a scan order identifies a current entropy coded transform coefficient from the current block; determines, based on the scan order and using a scan order distance table, a first scan order distance, where the first scan order distance being a difference between a first scan order location corresponding to the current entropy coded transform coefficient and a second scan order location corresponding to a first context coefficient; identifies, using the first scan order distance, a first location into a context coefficient register; identifies, at the first location of the context coefficient register, a first context coefficient value; identifies a probability distribution using the first context coefficient value; entropy decodes the current entropy coded transform coefficient using the probability distribution to obtain an entropy decoded current transform coefficient; and includes the entropy decoded current transform coefficient in an output bitstream.

Abstract: Methods of encoding and decoding for video data are described for encoding or decoding multi-level significance maps. Distinct context sets may be used for encoding the significant-coefficient flags in different regions of the transform unit. In a fixed case, the regions are defined by coefficient group borders. In one example, the upper-left coefficient group is a first region and the other coefficient groups are a second region. In a dynamic case, the regions are defined by coefficient group borders, but the encoder and decoder dynamically determine in which region each coefficient group belongs. Coefficient groups may be assigned to one region or another based on, for example, whether their respective significant-coefficient-group flags were inferred or not.

Abstract: A decoder includes an entropy decoder configured to derive a number of bins of the binarizations from the data stream using binary entropy decoding by selecting a context among different contexts and updating probability states associated with the different contexts, dependent on previously decoded portions of the data stream; a desymbolizer configured to debinarize the binarizations of the syntax elements to obtain integer values of the syntax elements; a reconstructor configured to reconstruct the video based on the integer values of the syntax elements using a quantization parameter, wherein the entropy decoder is configured to distinguish between 126 probability states and to initialize the probability states associated with the different contexts according to a linear equation of the quantization parameter, wherein the entropy decoder is configured to, for each of the different contexts, derive a slope and an offset of the linear equation from first and second four bit parts of a respective 8 bit initial

Abstract: In certain aspects, a circuit for modulo-3 operation has an encoder stage coupled to a binary number, wherein the encoder stage includes one or more encoders, each one of the one or more encoders receives one or two binary bits of the binary number and generates a unary code of encoder. The circuit for modulo-3 operation further has one or more levels of reduction stage, wherein a first level of the one or more levels of reduction stage includes one or more mergers of first reduction, each one of the one or more mergers of first reduction receives two unary codes of encoder or a unary code of encoder and a bit from the binary number and generates a unary code of first reduction.

Abstract: An image decoding method and apparatus according to an embodiment may extract, from a bitstream, a quantization coefficient generated through core transformation, secondary transformation, and quantization; generate an inverse-quantization coefficient by performing inverse quantization on the quantization coefficient; generate a secondary inverse-transformation coefficient by performing secondary inverse-transformation on a low frequency component of the inverse-quantization coefficient, the secondary inverse-transformation corresponding to the secondary transformation; and perform core inverse-transformation on the secondary inverse-transformation coefficient, the core inverse-transformation corresponding to the core transformation.

Abstract: A method for compressing activation data of a neural network to be written to a storage is provided. The activation data is formed into a plurality of groups and a state indicator indicates whether there are any data elements within each group that have a non-zero value. A second state indicator indicates, for groups having a non-zero value, whether sub-groups within the group contain a data element having a non-zero value. A sub-group state indicator indicates, for each sub-group having a non-zero value, which data elements within that sub-group have a non-zero value. Non-zero values of data elements in the activation data are encoded and a compressed data set is formed comprising the first state indicators, any second state indicators, any sub-group state indicators and the encoded non-zero values.

Abstract: A device (100) for and a method of determining a length of a history of instances of a first type of data are provided. The device comprises a second data set unit (104), a first data set unit (102), a first conditional entropy unit (106), a threshold unit (108), and a length determining unit (114). The first data set unit, the second data set unit and the threshold unit obtain input data. The first conditional entropy unit determines a first conditional entropy for a second data set given a first data set. The determining unit searches for a length of the relevant history by determining a smallest length for sequences of a reduced first set of data for which a second conditional entropy for the second set of data, given the reduced first set of data, is within a maximum entropy increase threshold from the first conditional entropy.

Abstract: A channel encoding method in a communication or broadcasting system is provided. The channel encoding method includes reading a first sequence corresponding to a parity check matrix, converting the first sequence to a second sequence by applying a certain rule to a block size corresponding to a parity check matrix and the first sequence, and encoding information bits based on the second sequence. The block size has at least two different integer values.

Abstract: A method including encoding a video program into a plurality of video streams, each of the plurality of video streams being encoded at a corresponding one of a plurality of bitrates; providing, to a plurality of viewing clients, an option to select one of the plurality of video streams; determining a streaming capacity of each of the viewing clients; and determining an improved plurality of bitrates based on streaming capacities of the plurality of viewing clients.

Abstract: A device includes a memory configured to store image data and an image coding unit implemented in circuitry. The image coding unit is configured to store a first portion of a set of context information in memory of the image coding unit as an array representing a direct access table and store a second portion of the set of context information in a hash table. The image coding unit is further configured to determine whether a context value for context-based coding of a value of an instance of a syntax element for a block of image data is stored in the array or in the hash table, retrieve the context value from either the array or the hash table according to the determination, and context-based code the value of the instance of the syntax element using the context value.

Abstract: The invention proposes a method and a device for arithmetic encoding of a current spectral coefficient using preceding spectral coefficients. Said preceding spectral coefficients are already encoded and both, said preceding and current spectral coefficients, are comprised in one or more quantized spectra resulting from quantizing time-frequency-transform of video, audio or speech signal sample values.

Abstract: The present invention relates to an entropy encoding method, an entropy decoding method and to an apparatus using same. The entropy decoding method includes: a step of decoding a bin of a syntax element; and a step of acquiring information on the syntax element based on the decoded bin. In the step of decoding the bin, context-based decoding or bypass decoding is performed for each bin of the syntax element.

Abstract: A moving picture coding method includes (i) transforming, for each of one or more second processing units included in the first processing unit, a moving picture signal in a spatial domain into a frequency domain coefficient and quantizing the frequency domain coefficient, and (ii) performing arithmetic coding on a luminance CBF flag indicating whether or not a quantized coefficient is included in the second processing unit in which transform and quantization are performed, wherein, in the arithmetic coding, a probability table for use in arithmetic coding is determined according to whether or not the size of the first processing unit is identical to the size of the second processing unit and whether or not the second processing unit has a predetermined maximum size.

Abstract: Described herein are techniques where a transmitter for an entity of a wireless communication system, like a user equipment or a base station of a mobile communication network, is controlled by a codebook that has been established for a specific antenna array that is different from the transmitter's antenna array. The transmitter's antenna array may be an antenna array having an arbitrary configuration, e.g. the transmitter's antenna array may include a 1-, 2- or 3-dimensional antenna array of any array configuration. The specific codebook, e.g., a 2-dimensional discrete Fourier transform, 2D DFT, based codebook, is adapted to the actual or real antenna array of the transmitter by one or more characteristic matrices describing the configuration or nature of the transmitter's antenna array, thereby adapting the codebook, which has been established for the specific antenna array, for controlling the transmitter's antenna array so as to obtain a desired directional beam patterns.