Abstract: The embodiments described herein relate to managing compressed data to optimize file compression. A compression is performed on a first set of data to create a first set of compressed data partitions in a compression group. A partition table is constructed, and partition entries for the first data block are added to the table in conjunction with the first set. A current size of the compression group is assessed. In response to a compression ratio being greater than a target compression ratio and internal fragmentation of the compression group being smaller than a threshold, the compression group is dynamically completed. The dynamic completion decides a size for the compression group. The partition table is added to the compression group by assigning space within the first compression group for the table. The compression group is written to persistent storage.

Abstract: In a video decoding device, a quantization step size decoding unit calculates a quantization step size that controls a granularity of the inverse quantization by, based on an image prediction, selectively using a mean value of at least a quantization step size assigned to a leftwardly adjacent neighboring image block already decoded and a quantization step size assigned to a upwardly adjacent neighboring image block already decoded or a quantization step size assigned to an image block decoded immediately before.

Abstract: A highly programmable data processing unit includes multiple processing units for processing streams of information, such as network packets or storage packets. The data processing unit includes one or more specialized hardware accelerators configured to perform acceleration for various data-processing functions. The data processing unit is configured to retrieve speculative probability values for range coding a plurality of bits with a single read instruction to an on-chip memory that stores a table of probability values. The data processing unit is configured to store state information used for context-coding packets of a data stream so that the state information is available after switching between data streams.

Abstract: An arithmetic decoding method is a method in which a context variable specifying a probability of a possible value of each of elements included in a binary string corresponding to a value of a given variable is initialized and arithmetic decoding is performed, using the context variable. The method includes: determining, from among a plurality of initialization methods as a method of initializing the context variable, an initialization method corresponding to the given variable or a group which includes the given variable; and initializing the context variable using the determined initialization method.

Abstract: Methods and systems for improving coding decoding efficiency of video by providing a syntax modeler, a buffer, and a decoder. The syntax modeler may associate a first sequence of symbols with syntax elements. The buffer may store tables, each represented by a symbol in the first sequence, and each used to associate a respective symbol in a second sequence of symbols with encoded data. The decoder decodes the data into a bitstream using the second sequence retrieved from a table.

Abstract: A Gaussian frequency shift keying (GFSK) detector for decoding a GFSK signal. The detector includes: a multi-symbol detector and a Viterbi decoder. The multi-symbol detector is configured to: receive a series of samples representing a received GFSK modulated signal; and generate, for each set of samples representing an N-symbol sequence of the GFSK modulated signal, a plurality of soft decision values that indicate the probability that the N-symbol sequence is each possible N-symbol pattern, wherein N is an integer greater than or equal to two. The Viterbi decoder is configured to estimate each N-symbol sequence using a Viterbi decoding algorithm wherein the soft decision values for the N-symbol sequence are used as branch metrics in the Viterbi decoding algorithm.

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: Methods and apparatus are provided for adaptive residual updating of template matching prediction for video encoding and decoding. In one embodiment, an apparatus and method encodes picture data for at least a block in a picture using template matching prediction, wherein the template matching prediction involves selecting from among a plurality of residual updating schemes for use in encoding the block. In another embodiment, an apparatus and method encodes a block in a picture using template matching prediction, wherein the template matching prediction involves partitioning the block into a plurality of sub-blocks, and applying a transform to a residual of a particular sub-block from among the plurality of sub-blocks subsequent to searching for a prediction for the particular sub-block block and prior to completion of processing of the block with respect to the template matching prediction.

Abstract: A self-organizing list machine is provided for reordering items of a list in a manner that achieves both a constant and minimum time complexity. The self-organizing list machine comprises an array of symbol index generators, wherein (i) each symbol index generator has a unique location in the array between zero and N?1 inclusive, and (ii) N is the total number of unique symbols in a symbol alphabet.

Abstract: It is presented a method for encoding haptic data for a plurality of channels. The method comprises the steps of: determining an order of the plurality of channels in a first list based on a respective previous codeword data item for each of the plurality of channels, each previous codeword data item being either a no-change data item, or a change data item, wherein the order is such that all no-change previous codeword data items are arranged at one end of the first list; arranging current codewords in a second list accordance with the channel order of the first list; grouping the current codewords in consecutive groups; generating a group index indicating whether each group contains only no-change codewords or at least one change codeword; and outputting the group index along with current codewords, wherein current codewords are only output for groups containing at least one change codeword.

Abstract: A processing device includes compression circuitry to encode an input stream with an encoding that translates multiple symbols of fixed length into multiple codes of variable length between one and a maximum length, to generate a compressed stream. The compression circuitry is to: determine at least a first symbol of the multiple symbols having a first code that exceeds the maximum length; identify a short code of the multiple codes that is to be lengthened to provide an increased encoding capacity for the at least the first symbol; generate multiple code-length converted values including to increase the length of the short code to the maximum length and decrease, to the maximum length, a length of the first code of the at least the first symbol; and generate, with use of the set of code-length converted values, the compressed stream at the output terminal.

Abstract: A decoding system for an iterative decoding of a parity check code comprises a first loop circuit adapted to store log-likelihood ratio values corresponding to a plurality of received data symbols in a memory unit; a second loop circuit adapted to compute a difference between a check-to-variable log-likelihood message at a second iteration step, and a check-to-variable log-likelihood message at a first iteration step, when the first iteration step precedes the second iteration step; and an adder unit adapted to update a log-likelihood ratio value stored on the first loop circuit by adding the difference computed in the second loop circuit; wherein the first loop circuit and the second loop circuit are synchronized such that the adder unit forwards the updated log-likelihood ratio value synchronously both to the first loop circuit and to the second loop circuit.

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 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 sub-ranging analog-to-digital converter (ADC) converts an analog input signal to a digital output signal. The sub-ranging ADC includes a coarse ADC, a fine ADC, and an error correction circuit (ECC). The fine ADC includes at least three digital-to-analog converters (DACs) that are connected in a pipeline architecture. The coarse and fine ADCs receive the analog input signal in a first half cycle of a clock signal. The coarse ADC converts the analog input signal to a first digital signal in a second half cycle of the clock signal. At least one of the first through third DACs converts the analog input signal to a second digital signal in a full cycle of the clock signal. The ECC receives the first and second digital signals and generates the digital output signal.

Abstract: A storage infrastructure, method and encoder device for implementing low complexity encoding, The described encoder includes: a preprocessing system that assigns a code length to each unique symbol based on the frequency without performing a sort operation and determines maximum and minimum occurrence frequencies of symbols of each given code length, and the maximum and minimum code length among all the symbols; and a post processing system that cycles through each code length, determines if a maximum occurrence frequency of a current code length, associated with a first symbol, is greater than a minimum occurrence frequency of an adjacent code length, associated with a second symbol, and if greater, swaps code lengths of the first and second symbols.

Abstract: In accordance with disclosed embodiments, there is described a depth camera calibration system which includes: a depth camera to be calibrated; a calibration application to execute upon a mobile device, the calibration application to: (i) determine a precise image size of a calibration image to be displayed to a screen of the mobile device based on a screen size of the mobile device, the calibration image having embedded therein a plurality of objects of a known size, (ii) encode the known size of the objects into an optical machine-readable data representation, and (iii) display the encoded optical machine-readable data representation to the mobile device; in which the depth camera is to read the optical machine-readable data representation displayed by the mobile device to determine the known size of the objects of the calibration image; in which the calibration application is to display the calibration image to the mobile device; and in which an imager of the depth camera is to capture the objects of the c

Abstract: Systems and methods for encoding a plurality of alternative streams of video content using multiple encoders in accordance with embodiments of the invention are disclosed. An encoding system includes multiple encoders. Each of the encoders receives a source stream of video content that is divided into portions. Each of the encoders generates portions of the plurality of alternative streams from the portions of the source stream. The portions of the alternative streams generated by a particular encoder are stored in a container for the particular encoder. Each encoder also generates index information for the portion of the alternative stream generated by the encoder that is stored in a manifest for the encoder.

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 for treating a heart valve of a patient includes inserting into a heart and in contact with a valve surface, an implant including an elongate element and a locking mechanism coupled to the elongate element. The locking mechanism has a resting position that provides a locked state preventing movement of the elongate element with respect to the locking mechanism. The heart valve is treated by facilitating movement of the elongate element with respect to the locking mechanism by maintaining application of a force to the locking mechanism using a tool, and thereby maintaining the locking mechanism in an unlocked state during the facilitating of the movement of the elongate element with respect to the locking mechanism. Subsequently, the locking mechanism is transitioned to the resting position by decoupling the tool from the locking mechanism.

Abstract: Methods and devices are disclosed for receiving and detecting sparse data sequences using a message passing algorithm (MPA) with early propagation of belief messages. Such data sequences may be used in wireless communications systems supporting multiple access, such as sparse code multiple access (SCMA) systems. The determination and passing of one or more messages for an edge between a function node and a variable node in a factor graph representation of the system may be performed in serial with determined values available early for subsequent computations. The serial computations may be scheduled based on various factors.

Abstract: A transmitting apparatus is provided. The transmitting apparatus includes: an encoder configured to generate a low-density parity check (LDPC) codeword by LDPC encoding based on a parity check matrix; an interleaver configured to interleave the LDPC codeword; and a modulator configured to map the interleaved LDPC codeword onto a modulation symbol, wherein the modulator is further configured to map a bit included in a predetermined bit group from among a plurality of bit groups constituting the LDPC codeword onto a predetermined bit of the modulation symbol.

Abstract: A method of compression is disclosed in which an input sequence of bits is divided into a plurality of portions. Each portion is sub-divided into a plurality of sub-divisions. Frequency analysis is performed to determine the number of occurrences of each sub-division permutation and a processed sequence of bits is generated based on the frequency analysis. The processed sequence of bits includes extraction information for use in reconstructing said input sequence of bits from said processed sequence of bits. The extraction information comprises sub-division order information identifying an ordered sequence comprising each possible sub-division permutation arranged in order of how many times, within said input sequence of bits, a portion comprises a sub-division having bits arranged in that possible sub-division permutation.

Abstract: Improved methods for coding an ensemble of pulse vectors utilize statistical models (i.e., probability models) for the ensemble of pulse vectors, to more efficiently code each pulse vector of the ensemble. At least one pulse parameter describing the non-zero pulses of a given pulse vector is coded using the statistical models and the number of non-zero pulse positions for the given pulse vector. In some embodiments, the number of non-zero pulse positions are coded using range coding. The total number of unit magnitude pulses may be coded using conditional (state driven) bitwise arithmetic coding. The non-zero pulse position locations may be coded using adaptive arithmetic coding. The non-zero pulse position magnitudes may be coded using probability-based combinatorial coding, and the corresponding sign information may be coded using bitwise arithmetic coding. Such methods are well suited to coding non-independent-identically-distributed signals, such as coding video information.

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: A highly programmable data processing unit includes multiple processing units for processing streams of information, such as network packets or storage packets. The data processing unit includes one or more specialized hardware accelerators configured to perform acceleration for various data-processing functions. The data processing unit is configured to retrieve speculative probability values for range coding a plurality of bits with a single read instruction to an on-chip memory that stores a table of probability values. The data processing unit is configured to store state information used for context-coding packets of a data stream so that the state information is available after switching between data streams.

Abstract: An array of capacitors includes a first array of k capacitors coupled to a first node and having capacitances which are binary weighted multiples of a unit capacitance value, a second array of m capacitors coupled to a second node and having capacitances which are binary weighted multiples of the unit capacitance value, a coupling capacitor disposed between the first node and the second node, and a trimmable grounded capacitor coupled between the first node and a ground potential.

Abstract: Systems and methods for image processing for increasing resolution of a multi-spectral image. Accept a multi-spectral image including a set of images of a scene. A memory to store a set of dictionaries trained for different channels, and a set of filters trained for the different channels. A hardware processor is to process the set of images of the different channels with the set of filters, and to fuse, for each channel, the set of structures, to produce a set of fused structures. Wherein a fused structure of the channel is fused as a weighted combination of the set of structures using weights corresponding to the channel, such that the fused structures of different channels are combined with different weights. To process the set of fused structures with corresponding dictionaries from the set of dictionaries, to produce a super-resolution multi-spectral image. An output interface to render the super-resolution multi-spectral image.

Abstract: Methods of encoding and decoding for video data are describe in which significance maps are encoded and decoded using non-spatially-uniform partitioning of the map into parts, wherein the bit positions within each part are associated with a given context. Example partition sets and processes for selecting from amongst predetermined partition sets and communicating the selection to the decoder are described.

Abstract: Various additional and alternative aspects are described herein. In some aspects, the present disclosure provides a method of communicating data between an electronic unit (EU) of a system-on-chip (SoC) and a dynamic random access memory (DRAM). The method includes encoding data at the EU. The method includes generating control data for decoding the encoded data at the EU. The method includes directing storage of the encoded data in the DRAM. The method includes directing storage of the control data in an on-chip memory separate from the DRAM, wherein the on-chip memory is on a same chip as the EU.

Abstract: The image decoding method includes: determining a context for use in a current block to be processed, from among a plurality of contexts; and performing arithmetic decoding on a bit sequence corresponding to the current block, using the determined context, wherein in the determining: the context is determined under a condition that control parameters of neighboring blocks of the current block are used, when the signal type is a first type, the neighboring blocks being a left block and an upper block of the current block; and the context is determined under a condition that the control parameter of the upper block is not used, when the signal type is a second type, and the second type is one of “cbf_luma”, “cbf_cb”, and “cbf_cr”.

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: Systems and methods for converting reserve estimates in a reservoir model to a standard format for dynamic comparison by storing them with a sealed triangulated mesh and a thickness grid as a printable string in one or more Processing History fields.

Abstract: A probably update method used in context-based adaptive binary arithmetic coding (CABAC) is disclosed. The probably update method for binary arithmetic decoding obtains an autocorrelation value of each bin by using values of received bins, determines at least one scaling factor used to update a probability of a binary value based on the autocorrelation value, and updates a probability used in context-based adaptive binary arithmetic decoding by using the determined at least one scaling factor.

Abstract: A video coder may include a current picture and a reference picture in a reference picture list. The video coder may determine a co-located block of the reference picture. The co-located block is co-located with a current block of the current picture. Furthermore, the video coder derives a temporal motion vector predictor from the co-located block and may determine the temporal motion vector predictor has sub-pixel precision. The video coder may right-shift the temporal motion vector predictor determined to have sub-pixel precision. In addition, the video coder may determine, based on the right-shifted temporal motion vector predictor, a predictive block within the current picture.

Abstract: A video coder may perform a simplified depth coding (SDC) mode, including simplified residual coding, to code a depth block according to any of a variety of, e.g., at least three, depth intra prediction modes. For example, the video coder may perform the SDC mode for coding a depth block according to depth modeling mode (DMM) 3, DMM 4, or a region boundary chain coding mode. In such examples, the video coder may partition the depth block, and code respective DC residual values for each partition. In some examples, the video coder may perform the SDC mode for coding a depth block according to an intra prediction mode, e.g., an HEVC base specification intra prediction mode, such as a DC intra prediction mode or one of the directional intra prediction modes. In such examples, the video coder may code a single DC residual value for the depth block.

Abstract: Methods and systems for improving coding decoding efficiency of video by providing a syntax modeler, a buffer, and a decoder. The syntax modeler may associate a first sequence of symbols with syntax elements. The buffer may store tables, each represented by a symbol in the first sequence, and each used to associate a respective symbol in a second sequence of symbols with encoded data. The decoder decodes the data into a bitstream using the second sequence retrieved from a table.

Abstract: A data processing method includes acquiring first encoded data and second encoded data when receiving a request for data processing, the first encoded data being encoded in accordance with a first encoding rule, the second encoded data being encoded in accordance with a second encoding rule, specifying a first code relating to a second code in accordance with the first encoding rule and the second encoding rule without decoding the first encoded data and the second coded data, the first code being included in the first encoded data, the second code being included in the second encoded data and generating third encoded data in which the first code and the second code are stored in association with each other.

Abstract: A transmitting apparatus is provided. The transmitting apparatus includes: an encoder configured to perform a low-density parity check (LDPC) encoding on input bits using a parity check matrix to generate an LDPC codeword comprising information word bits and parity bits; an interleaver configured to interleave the LDPC codeword; and a modulator configured to map the interleaved LDPC codeword onto a modulation symbol, wherein the modulator is further configured to map a bit included in a predetermined bit group from among a plurality of bit groups constituting the LDPC codeword onto a predetermined bit of the modulation symbol.

Abstract: In various implementations, techniques are described herein to resolve issues related to the location of an EOB NAL unit in an ISO base media file. In various implementations, these techniques include relaxing the requirement that a file include only one EOB NAL unit. These techniques further include providing the EOB NAL unit from the highest layer when reconstructing the bitstream. This EOB NAL unit can be added to a last access unit in the reconstructed bitstream. When the EOB NAL unit from the highest layer is not present, an EOB NAL unit from a lower layer can be provided instead.

Abstract: An encoder for encoding input data to generate corresponding encoded data is provided. The encoder (10) is operable to process a sequence of elements in the input data from a first element thereof to a last element thereof. The elements have corresponding symbols. The encoder is operable to compute probabilities of symbols present in the sequence, wherein the probabilities of the symbols are computed while disregarding those elements of the sequence that have already been encoded into the encoded data. Moreover, the probabilities of the symbols are adaptively changed as the sequence of elements is progressively encoded into the encoded data. Furthermore, information describing the probabilities is delivered; optionally, the probabilities of the symbols are accompanied with additional information indicating how the probabilities are adaptively changing. There is also provided a decoder for performing an inverse of encoding performed by the encoder.

Abstract: Systems, apparatuses, and methods for efficiently moving data for storage and processing. A compression unit within a processor includes multiple hardware lanes, selects two or more input words to compress, and for assigns them to two or more of the multiple hardware lanes. As each assigned input word is processed, each word is compared to an entry of a plurality of entries of a table. If it is determined that each of the assigned input words indexes the same entry of the table, the hardware lane with the oldest input word generates a single read request for the table entry and the hardware lane with the youngest input word generates a single write request for updating the table entry upon completing compression. Each hardware lane generates a compressed packet based on its assigned input word.

Abstract: A first vulnerability that is associated with one or more nodes of a network graph that represent one or more assets of a network infrastructure may be identified. Furthermore, a second vulnerability that is associated with one or more nodes of the network graph may be identified. A determination may be made as to whether the first vulnerability or the second vulnerability contributes more to a probability of a security breach associated with the network infrastructure. A notification may be provided to mitigate the vulnerability that contributes more to the probability of the security breach associated with the network infrastructure.

Abstract: Field error correction coding is particularly suitable for applications in non-volatile flash memories. We describe a method for error correction encoding of data to be stored in a memory device, a corresponding method for decoding a codeword matrix resulting from the encoding method, a coding device, and a computer program for performing the methods on the coding device, using a new construction for high-rate generalized concatenated (GC) codes. The codes, which are well suited for error correction in flash memories for high reliability data storage, are constructed from inner nested binary Bose-Chaudhuri-Hocquenghem (BCH) codes and outer codes, preferably Reed-Solomon (RS) codes. For the inner codes extended BCH codes are used, where only single parity-check codes are applied in the first level of the GC code. This enables high-rate codes.

Abstract: A graphic data compression device includes a processing unit for processing graphic data and a mixed-type compression unit for compressing the data processed by the processing unit. The mixed-type compression unit includes a lossless compression module and a nearly-lossless compression module. The lossless compression module performs a compression on processed data by a lossless compression algorithm. The nearly-lossless compression module includes an adjustment module and a compression module. The adjustment module performs an adjustment on the processed data to reduce a size of the processed data. The compression module performs, by the lossless compression algorithm, a compression on the data adjusted by the adjustment module. A graphic data compression method of the graphic data compression device is also provided. The graphic data compression device and method of the present invention reduce bandwidth load and memory occupancy, thereby effectively improving the usage of memory capacity.

Abstract: An video decoding apparatus including a parser which obtains bit strings corresponding to current transformation coefficient level information by arithmetic decoding a bitstream based on a context model; a parameter determiner which determines a current binarization parameter by updating or maintaining a previous binarization parameter based on a comparison of a threshold and a size of a previous transformation coefficient; a syntax element restorer which obtains the current transformation coefficient level information by performing de-binarization of the bit strings using the determined current binarization parameter and generates a size of a current transformation coefficient using the current transformation coefficient level information, wherein the current binarization parameter has a value equal to or smaller than a predetermined value.

Abstract: Systems and methods for improving decoding of encoded image data using parallel multi-bin decoding are provided. In one embodiment, multiple context bins per cycle are decoded for a set of syntax elements, by decoupling and/or retiming particular syntax parsing and/or arithmetic decoding tasks of the decoding process.

Abstract: Wedgelet-based coding in conjunction with the usage of 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: An encoder includes processing circuitry, a block memory, and a frame memory. The processing circuitry defines at least one parameter for each of plural types of segment_ids, splits an image into blocks, assigns, to each of the blocks, segment_id according to a type of the block, among the plural types of segment_ids, and sequentially encodes the blocks. In encoding the blocks, the processing circuitry identifies segment_id of a current block to be encoded, and encodes the current block using the at least one parameter defined for identified segment_id. The at least one parameter includes seg_context_idx for identifying probability information associated with context used in context-based adaptive binary arithmetic coding (CABAC).

Abstract: Techniques and apparatus for parallel decompression are described. In one embodiment, for example, an apparatus to provide parallel decompression may include at least one memory and logic for a decompression component, at least a portion of the logic comprised in hardware coupled to the at least one memory, the logic to determine decompression information of a compressed data unit, annotate the compressed data unit with at least a portion of the decompression information to generate an annotated data unit, parallel-decode the annotated data unit to generate a plurality of intermediate elements, and decode and merge the plurality of intermediate elements to generate a decompressed data unit. Other embodiments are described and claimed.