Abstract: Systems, apparatus, articles, and methods are described including operations for size based transform unit context derivation.

Abstract: Provided is a method that de-multiplexes a bit stream to extract intra prediction mode information and residual signals, restores an intra prediction mode of a current prediction unit using the intra prediction information and intra prediction modes of prediction units adjacent to the current prediction unit, generates reference pixels using one or more available reference pixel if there exist unavailable reference pixels of the prediction unit, adaptively filters the reference pixels based on the restored intra prediction mode, generates a prediction block using the restored intra prediction mode and the reference pixels, decodes the residual signal to generating a residual block, and generates a reconstructed block using the prediction block and the residual block. Accordingly, additional bits resulted from increase of a number of intra prediction mode are effectively reduced. Also, an image compression ratio can be improved by generating a prediction block similar to an original block.

Abstract: Systems and methods relating generally to data storage, and more particularly to systems and methods for encoding to modify the size of an information set.

Abstract: Technologies for performing speculative decompression include a managed node to decode a variable size code at a present position in compressed data with a deterministic decoder and concurrently perform speculative decodes over a range of subsequent positions in the compressed data, determine the position of the next code, determine whether the position of the next code is within the range, and output, in response to a determination that the position of the next code is within the range, a symbol associated with the deterministically decoded code and another symbol associated with a speculatively decoded code at the position of the next code.

Abstract: Embodiments of methods, apparatuses, devices and/or systems for manipulating hierarchical sets of data are disclosed.

Abstract: A method of decoding a dynamic Huffman encoded data stream comprising receiving, by a processor, one or more input bits of encoded data from among an encoded data stream, searching, by the processor, a ternary content addressable memory (TCAM) for one or more codewords, accessing, by the processor, a plurality of random access memories (RAMs) that comprise the TCAM and have a maximum number of entries that is less than or equal to one half of two to a power of a maximum number of bits to be searched, reading a value from a first level RAM and using the value to index to a second level RAM, and outputting, by the processor, a codeword length and a decoded codeword value from either the first or second level RAM.

Abstract: An encoder stage, and corresponding encoded bitstream and decoder. The encoder stage comprises: a variable length encoder for encoding an input signal; and a counter configured to dynamically detect an observed frequency at which different symbols are found to occur within each of a plurality of predetermined portions of the input signal, prior to the symbols of each respective portion being encoded by the variable length encoder. The variable length encoder is configured to encode the symbols of each portion using variable length coding performed in dependence on the observed frequencies detected within the respective portion of the input signal, to generate an encoded bitstream comprising the encoded symbols along with an additional element indicating information regarding the observed frequencies detected for each portion, and to output the encoded bitstream to at least one of a storage medium and a transmission medium for supply to a decoder.

Abstract: An image coding method includes: generating a predicted block; calculating a residual block; calculating quantized coefficients by performing transform and quantization on the residual block; calculating a coded residual block by performing inverse quantization and inverse transform on the quantized coefficients; generating a temporary coded block; determining whether or not an offset process is required, to generate first flag information indicating a result of the determination; executing the offset process on the temporary coded block when it is determined that the offset process is required; and performing variable-length coding on the quantized coefficients and the first flag information.

Abstract: A method for decoding video includes receiving quantized coefficients representative of a block of video representative of a plurality of pixels. The quantized coefficients are dequantized based upon a function of a remainder. The dequantized coefficients are inverse transformed to determine a decoded residue.

Abstract: System, method and computer program products for probing a hash table by receiving a compressed input key, computing a hash value for the compressed input key and probing one or more buckets in a hash table for a match. Each bucket includes multiple chunks. For a bucket in the hash table, chunks are searched in that bucket by comparing in parallel the hash value with multiple slots in each chunk, such that if a value in a chunk equals the hash value of the compressed input key, then a match is declared and a vector is returned with a significant bit of a matching slot in the bucket set to a value. If a value stored in a chunk corresponds to an empty slot, then a mismatch is declared, and the vector is returned as the result with the significant bit of a matching empty slot set to the value.

Abstract: To decompress encoded data, a Huffman code tree stored in a data header may need to be decompressed and rebuilt. A bit length histogram table is used in a hardware design to more efficiently decompress the Huffman code tree. The bit length histogram table relates each bit length used by the Canonical Huffman Code (CHC) symbols to a corresponding number of symbols in the encoding that have that bit length. Performing decompression using bit length histogram table allows part of the Huffman tree decompression to be performed in a single pass.

Abstract: This disclosure relates to implementing an adaptive deadzone for one or more quantized coefficients in a quantized block. In particular, one or more candidate blocks with one or more coefficients and an end of block (EOB) indicator are generated. The one or more coefficients are a subset of the one or more quantized coefficients in the quantized block. A cost value for each of the one or more candidate blocks is calculated based at least in part on a rate value and a distortion value of the one or more coefficients in each of the one or more candidate blocks. Accordingly, a candidate block from the one or more candidate blocks with a lowest calculated cost value is selected as an output block.

Abstract: In one embodiment, for each particular multicast flow of a plurality of multicast flows of packets a particular consolidation encoding of a plurality of consolidation encodings is selected based on the sparseness of bit positions within a bit string corresponding to designated receiving packet switching devices of the particular multicast flow. The packet switching device sends one or more packets corresponding to said particular packet, with each of these one or more packets including designated receiving packet switching devices of the particular multicast flow in the header of said particular packet according to the particular consolidation encoding. In one embodiment, different consolidation encodings of the plurality of consolidation encodings are used for at least two different multicast flows of the plurality of multicast flows of packets. In one embodiment, each of said receiving packet switching devices is Bit Index Explicit Replication (BIER) Bit-Forwarding Router (BFR).

Abstract: A method for writing data, a memory storage device and a memory control circuit unit are provided. The method includes receiving a write command and first data corresponding to the write command, obtaining initial data transmission information of the first data and determining whether the initial data transmission information conforms to a predetermined condition, compressing the first data to second data and writing the second data into a rewritable non-violate memory module if the initial data transmission information conforms to the predetermined condition, and writing the uncompressed first data into the rewritable non-violate memory module if the initial data transmission information does not conform to the predetermined condition.

Abstract: An integrated circuit device is disclosed including core circuitry and interface circuitry. The core circuitry outputs in parallel a set of data bits, while the interface circuitry couples to the core circuitry. The interface circuitry receives in parallel a first number of data bits among the set of data bits from the core circuitry and outputs in parallel a second number of data bits. The ratio of the first number to the second number is a non-power-of-2 value.

Abstract: An apparatus comprising a codec configured to predict an intra mode for a considered pixel block based on a plurality of coded intra modes for a plurality of adjacent pixel blocks to the considered pixel block, wherein the predicted intra mode and the coded intra modes correspond to a set of intra-frame modes that comprise a plurality of directional intra modes and at least two non-directional intra modes and that are assigned a plurality of corresponding group numbers and group index numbers, and wherein the intra mode is predicted based on the group numbers and group index numbers of the coded intra modes.

Abstract: A white-box cryptographic system is presented wherein at least one of its internal values is represented using an input dependent encoding. The system comprises a network of a plurality of basic blocks arranged for collectively performing a cryptographic operation. An encoder is arranged for encoding output data of a first one of the plurality of basic blocks into an encoder-output according to a selected one of a plurality of encoding schemes, said selection depending on an input-message to the system. A compensator is arranged for recoding intermediate data to compensate for the effect of the encoding according to a selected one of a plurality of recoding schemes. Using variable encodings instead of fixed encodings complicates reverse engineering the white-box cryptographic system.

Abstract: An audio decoder includes an arithmetic decoder for providing decoded spectral values on the basis of an arithmetically-encoded representation of the spectral values and a frequency-domain-to-time-domain converter for providing a time-domain audio representation using the decoded spectral values. The arithmetic decoder selects a mapping rule describing a mapping of a code value onto a symbol code in dependence on a context state described by a numeric current context value, and determines the numeric current context value in dependence on a plurality of previously-decoded spectral values. The arithmetic decoder modifies a number representation of a numeric previous context value, describing a context state associated with one or more previously decoded spectral values, in dependence on a context subregion value, to acquire a number representation of a numeric current context value describing a context state associated with one or more spectral values to be decoded. An audio encoder uses a similar concept.

Abstract: A processing system is provided that includes a memory for storing an input bit stream and a processing logic, operatively coupled to the memory, to generate a first score based on: a first set of matching data related to a match between a first bit subsequence and a candidate bit subsequence within the input bit stream, and a first distance of the candidate bit subsequence from the first set of matching data. A second score is generated based on a second set of matching data related to a match between a second bit subsequence and the candidate bit subsequence, and a second distance of the candidate bit subsequence from the second set of matching data. A code to replace the first or second bit subsequence in an output bit stream is identified. Selection of the one of the bit subsequences to replace is based on a comparison of the scores.

Abstract: Apparatuses, systems, and computer program products that encode and/or decode information of a video stream, such as an MPEG-4 video stream, are disclosed. Some embodiments comprise an apparatus having a binarizer module to create a plurality of bins for a syntax element for information of the video stream, a context selection module to generate an index value and a most probable symbol (MPS) value for encoding the plurality of bins, and an arithmetic coding module to encode a first and a second bin of the plurality of bins based on a first probability value and a second probability value, respectively, wherein the first and second probability values are determined via the generated index value and MPS value. Examples of some embodiments are high definition personal video recorders, transcoders, computers, personal digital assistants, cellular telephones, portable video players, high definition digital versatile disc (HD-DVD) devices, and Blu-ray disc-read only memory (BD-ROM) devices.

Abstract: A computer-implemented method, computer program product, and computing system is provided for managing quality of experience for communication sessions. In an implementation, a method may include determining a change in an optimum video size for a streaming video. The method may also include determining one or more constraints of resizing associated with the change in the desired video size. The method may further include adaptively resizing the streaming video to a current desired video size when the one or more constraints of resizing exceed a threshold value.

Abstract: A computer-implemented method, computer program product, and computing system is provided for managing quality of experience for communication sessions. In an implementation, a method may include determining a change in an optimum video size for a streaming video. The method may also include determining one or more constraints of resizing associated with the change in the desired video size. The method may further include adaptively resizing the streaming video to a current desired video size when the one or more constraints of resizing exceed a threshold value.

Abstract: A computer-implemented method comprises receiving a data stream that includes a series of code words that encodes a respective series of pixel data according to a first entropy coding lookup table, and processing the data stream to determine if there is a match between a first code word and a consecutive second code word, and a code word entry in a second entropy coding lookup table. The method also includes, if there is a match, decoding the first code word and the second code word using the second entropy coding lookup table. Further, the method includes, if there is not a match, decoding the first code word using the first entropy coding lookup table.

Abstract: A system and method uses the capabilities of a geometry shader unit within the multi-threaded graphics processor to implement algorithms with variable input and output.

Abstract: Between a method in which an integer signal code is obtained by using an encoding method based on periodicity and a method in which an integer signal code is obtained using an encoding method which is not based on periodicity using an index indicating a degree of periodicity of a sample sequence in a frequency domain, processing of a first coder is executed only in a method for which the number of bits of the integer signal code is expected to be reduced, and a gain obtained through the processing of the first coder in the method for which the number of bits of the integer signal code is expected to be reduced is utilized in a method for which the number of bits of the integer signal code is not expected to be reduced.

Abstract: A method for decoding video includes receiving a frame of the video that includes at least one slice and at least one tile. Each of the at least one slice and the at least one tile are not all aligned with one another. Each of the at least one slice is characterized that it is decoded independently of the other the at least one slice. Each of the at least one tile is characterized that it is a rectangular region of the frame and having coding units for the decoding arranged in a raster scan order. The at least one tile of the frame are collectively arranged in a raster scan order of the frame.

Abstract: The amount of processing is reduced with high coding efficiency maintained. There is provided an arithmetic decoding device including syntax decoding means for decoding each of at least a first syntax element and a second syntax element indicating a transform coefficient using arithmetic decoding with a context or arithmetic decoding without a context. The syntax decoding means performs decoding that at least includes not decoding the first syntax element and decoding the second syntax element using the arithmetic decoding without a context, and decoding the first syntax element using the arithmetic decoding with a context and decoding the second syntax element using the arithmetic decoding without a context.

Abstract: A hardware data compressor for compressing an input block of characters. A first hardware engine that, for an initial fraction of the input block of characters produces character string replacement back pointers and indicates characters not replaced by the back pointers, and generates occurrence frequencies of symbols associated with the produced back pointers and the non-replaced characters. A second hardware engine constructs a Huffman code table using the frequencies generated for the initial fraction of the input block. The first hardware engine, for the remainder of the input block beyond the initial fraction, produces character string replacement back pointers and indicates characters not replaced by the back pointers. A third hardware engine, for the entire input block of characters, Huffman encodes the symbols associated with the back pointers and the non-replaced characters using the Huffman code table constructed using the frequencies generated for the initial fraction of the input block.

Abstract: A hardware data compressor for compressing a block of characters. A first hardware engine finds a match of a string of characters at a current location in the block with an earlier occurrence in the block of the string of characters, determines a first size that is a total number of bits into which the matched string would be Huffman encoded as literals using a Huffman code table, calculates a back pointer from the current location to the earlier occurrence of the string, and determines a second size that is a number of bits into which the back pointer would be Huffman encoded using the Huffman code table. A second hardware engine Huffman encodes the matched string if the first size is less than the second size and otherwise Huffman encodes the back pointer.

Abstract: A method including using a precoding code book for controlling transmissions from four antennas of a device, said code book including a plurality of entries, wherein said entries are such that a single layer is mapped to each selected antenna, said code book entries including different antenna pair combinations whereby one or two antenna pairs are selected for transmission.

Abstract: An image coding method includes: generating a predicted block; calculating a residual block; calculating quantized coefficients by performing transform and quantization on the residual block; calculating a coded residual block by performing inverse quantization and inverse transform on the quantized coefficients; generating a temporary coded block; determining whether or not an offset process is required, to generate first flag information indicating a result of the determination; executing the offset process on the temporary coded block when it is determined that the offset process is required; and performing variable-length coding on the quantized coefficients and the first flag information.

Abstract: A video coding device is configured to code coefficients of residual blocks of video data. When a coefficient of a transform unit of video data has a scan order value that is less than a threshold and when the coefficient is the last significant coefficient in a scan order in the transform unit, the video coding device may execute a function to determine a mapping between data for the coefficient and a codeword index value, and code the data for the coefficient using a codeword associated with the codeword index value. The video coding device may comprise a video encoder or a video decoder, in some examples.

Abstract: A method for wirelessly transmitting data using a plurality of transmission layers includes estimating a number of vector symbols to be allocated to transmission of user data codewords during a subframe and determining a number of bits in a plurality of user data codewords to be transmitted during the subframe. The method also includes calculating a number of control vector symbols to allocate to control information based at least in part on the estimated number of vector symbols and the determined number of bits. Additionally, the method includes mapping control codewords to the calculated number of control vector symbols and transmitting vector symbols carrying the user data codewords and the control codewords over the plurality of transmission layers during the subframe.

Abstract: In one embodiment, a processing system is provided. The processing system includes a memory for storing an input bit stream and a processing logic coupled to the memory. The processing logic to identify, within the input bit stream, a first bit subsequence of an input bit sequence and a second bit subsequence of the input bit sequence. A first score reflecting the length of the first bit subsequence and the distance between the input bit sequence and the first bit subsequence and a second score reflecting the length of the second bit subsequence, within the input bit stream, and the distance between the input bit sequence and the second bit subsequence is determined. In view of the first score and the second score, one of the first bit subsequence or the second bit subsequence is selected. A code representing a selected bit subsequence is appended to an output bit sequence.

Abstract: Embodiments of methods, apparatuses, devices and/or systems for manipulating hierarchical sets of data are disclosed.

Abstract: An image coding method includes: generating a predicted block; calculating a residual block; calculating quantized coefficients by performing transform and quantization on the residual block; calculating a coded residual block by performing inverse quantization and inverse transform on the quantized coefficients; generating a temporary coded block; determining whether or not an offset process is required, to generate first flag information indicating a result of the determination; executing the offset process on the temporary coded block when it is determined that the offset process is required; and performing variable-length coding on the quantized coefficients and the first flag information.

Abstract: A non-transitory computer-readable recording medium stores a compression program that causes a computer to execute a process. The process includes: detecting a matched data that matches a processing target data with a longest length among pieces of data, the pieces of data being extracted from a data sequence that is a compression target; acquiring an appearance frequency of a code corresponding to character data contained in the matched data when a data length of the matched data is smaller than a predetermined length; acquiring an appearance frequency of a code corresponding to the matched data when the data length of the match data is equal to or larger than the predetermined length; and compressing the data sequence using a compression code generated based on the acquired appearance frequency of the code.

Abstract: This disclosure describes techniques for adaptively coding video block header information based on previously encoded video blocks. A video encoder may adaptively select a coding table for use in encoding a syntax element of a current video block based on corresponding syntax elements of one or more previously encoded blocks. In one aspect, the video encoder may adaptively select the coding table for use in encoding a block type of the current block based on block types of one or more video blocks adjacent to the current video block, i.e., neighboring video blocks. The video encoder may also predict one or more other header syntax elements of the current block based on at least one of the previously encoded video blocks. If prediction is successful, the video encoder may encode a flag to indicate the success of prediction.

Abstract: A method and apparatus for interfacing integrated circuit chips is disclosed. In one embodiment, the interface includes a set of differential data lines over which a variable length register transaction can be conducted.

Abstract: A video decoder includes an entropy decoding device that generates entropy decoded (EDC) data from an encoded video signal. A multi-format video decoding device includes a plurality of vector processor units that generate a decoded video signal from the EDC data. The plurality of vector processing units are programmed via VPU instructions formatted to include a vector instruction portion, a scalar instruction portion, and a branching instruction portion.

Abstract: Embodiments provide methods and systems for encoding and decoding variable-length data, which may include methods for encoding and decoding search engine posting lists. Embodiments may include different encoding formats including group unary, packed unary, and/or packed binary formats. Some embodiments may utilize single instruction multiple data (SIMD) instructions that may perform a parallel shuffle operation on encoded data as part of the decoding processes. Some embodiments may utilize lookup tables to determine shuffle sequences and/or masks and/or shifts to be utilized in the decoding processes. Some embodiments may utilize hybrid formats.

Abstract: This disclosure describes techniques for coding transform coefficients for a block of video data. According to these techniques, a video coder (a video encoder or video decoder) stores a first VLC table array selection table in memory, and an indication of at least one difference between the first VLC table array selection table and a second VLC table array selection table. The video coder reconstructs at least one entry of the second VLC table array selection table based on the first VLC table array selection table using the stored indication of the difference between the first VLC table array selection table and a second VLC table array selection table. The video coder uses the reconstructed at least one entry of the second VLC table array selection table to code at least one block of video data.

Abstract: Video encoding and its corresponding decoding are disclosed. The video encoding incorporates: a predictor for predicting a pixel value of each pixel in a current block of the video to generate a predicted pixel value; a subtractor for calculating a difference between an original pixel value of the pixel in the current block and the predicted pixel value of the pixel in the current block to generate a residual signal; a transformer for transforming the residual signal into frequency coefficients; a quantizer for quantizing the transformed frequency coefficients; and an encoder for encoding the quantized frequency coefficients by using one of different variable length coding tables.

Abstract: The present disclosure provides a method and apparatus for transmitting the beamforming matrix. The method includes calculating the maximum value mv(k) of the real part and imaginary part of the elements in subcarrier's beamforming matrix; carrying out a M bits quantization to mv(k) and obtaining the quantization amplitude Mv(k), calculating the linear part Mvlin(k) of Mv(k); carrying out a respectively Nb bits quantization to the real part and imaginary part of every element in V(k) by Mvlin(k), and obtaining the quantized beamforming matrix Vq(k); Nb is positive integer; transmitting said quantization amplitude Mv(k) and said quantized beamforming matrix Vq(k).

Abstract: A tile of pixels is encoded by variable length encoding blocks of pixels constituting different subsets of the tile to form sequences of symbols as encoded representations of the pixel values. A respective size indication is determined for each set of at least block. A size indication is representative of a compression ratio of a combined sequence corresponding to the at least one sequence of symbols obtained for the at least one block of the set. The combined sequences are arranged in a pixel value buffer in a buffer memory. The size indication determined for a given set is also stored in the pixel value buffer in the buffer memory to precede, according to a reading order of the pixel value buffer, the combined sequence of the given set.

Abstract: A method of coding at least one image comprising the steps of splitting the image into a plurality of blocks, of grouping said blocks into a predetermined number of subsets of blocks, of coding each of said subsets of blocks in parallel, the blocks of a subset considered being coded according to a predetermined sequential order of traversal. The coding step comprises, for a current block of a subset considered, the sub-step of predictive coding of said current block with respect to at least one previously coded and decoded block, and the sub-step of entropy coding of said current block on the basis of at least one probability of appearance of a symbol.

Abstract: A Boolean entropy decoder including a decoding module, a buffer and an updating module is provided. The decoder sequentially generates a first boolean value, a second boolean value and a third boolean value. The first and second boolean values are generated during a same cycle. The decoding module requires a first bit amount while generating a first value corresponding to the first boolean value, and requires a second bit amount while generating a second value corresponding to the second boolean value. The buffer temporarily stores a bit segment in the bitstream to be provided to the decoding module. The updating module fetches a new bit segment according to the first bit amount and the second bit amount and updates the buffer. The decoding module selectively updates a value corresponding to the third boolean value after the buffer is updated.

Abstract: The present disclosure discloses a method, a user equipment and a base station for determining a PMI. The method includes: receiving a reference signal set sent by a base station; based on the reference signal set, selecting a precoding matrix from a codebook, the codebook at least including a non-constant modulus precoding matrix, the non-constant modulus precoding matrix at least including a non-constant modulus column vector, amplitude values of at least two elements of the non-constant modulus column vector forming a symmetrical sequence; and sending a PMI to the base station, the PMI corresponding to the selected precoding matrix. According to the method, the user equipment and the base station for determining PMI, because the non-constant modulus precoding matrix included in the adopted codebook can adjust the shape of a beam, antennas may focus power on a hotspot region, and thus a load balance may be effectively realized.

Abstract: A method and apparatus for symbol-space based compression of patterns are provided. The method comprises generating an output sequence responsive of an input sequence, the input sequence being of a first length and includes a plurality of symbols, by extraction of all common patterns, wherein a common pattern includes at least two symbols and the output sequence is of a second length that is shorter than the first length; and storing in a memory the output sequence as a data layer.

Abstract: In an approach for generating a compiler listing using Debugging With Attributed Record Format (DWARF) debugging data, a processor receives DWARF debugging data associated with source code of a programming language. A processor extracts information from the DWARF debugging data, wherein the information comprises at least source code lines, variable declaration lines, and variable reference lines. A processor generates a compiler listing based on the information extracted from the DWARF debugging data, wherein the compiler listing includes at least a symbol table, and cross-reference information.