Abstract: A data processing system comprises encoding circuitry operable to encode arrays of data elements, decoding circuitry operable to decode encoded versions of arrays of data elements, and consumer circuitry operable to use arrays of data elements. Data indicative of a resolution that is to be used by the consumer circuitry for at least one region of the array of data elements is provided to the encoding circuitry, and the encoding circuitry uses the data indicative of the resolution that is to be used by the consumer circuitry to control the generation of the representation for representing at least one block that the array of data elements is divided into.

Abstract: A memory system includes a storage device and a memory controller. The memory controller includes an encoder and a decoder. The encoder includes a first code table updating section configured to update the encoding code table and an encoding flow controlling section configured to control input to the first code table updating section by using a first data amount indicating a data amount of the input symbol. The first data amount is calculated based on the input symbol. The decoder includes a second code table updating section configured to update the decoding code table and a decoding flow controlling section configured to control input to the second code table updating section by using a second data amount indicating a data amount of the output symbol. The second data amount is calculated based on the output symbol in the same way as the calculation of the first data amount.

Abstract: Embodiments of the application provide a method for rate matching in a wireless communication network. A device obtains K information bits and a target code length M of a polar code, determines, according to a minimum value of a set of values, a mother code length N1, polar encodes the K information bits to obtain an encoded sequence of N1 bits, obtains a target sequence of M bits from the N1 bit encoded sequence, and outputs the M-bit target sequence. When the mother code length N1 is larger than the target code length M, (N1?M) bits of the encoded sequence are punctured or shortened from the N1 bit encoded sequence.

Abstract: Provided is an encoding/decoding technique according to which it is possible to perform encoding with a small average bit count, even for a series of integer values with a distribution that is significantly biased to a small value, including small values that are not zero values. The present invention includes an integer encoding unit that, for an input series of non-negative values xn, n?{1, 2, . . . , N} (hereinafter referred to as “integer series”), obtains a one-bit code with a bit value of “x” as a code corresponding to L consecutive integer values 0 included in the integer series, L being an integer that is 2 or more, and obtains a K×xn-bit or a K×xn+1-bit code that includes at least one bit value “x” and at least one bit value “y” in the first bit to the K-th bit and in which the bit values of the K×(xn?1) bits from the end are “y”, as a code corresponding to a set composed of 0 to L?1 consecutive integer values 0 included in the integer series and one integer value xn other than 0.

Abstract: An electronic device includes a decoding subsystem having a symbol decoder and a second symbol resolver with a plurality of local symbol decoders and a symbol selector. The symbol decoder outputs a first symbol decoded from an initial code for which a symbol is available in a block of the compressed data. The second symbol resolver decodes, in each local symbol decoder, substantially in parallel with decoding the first symbol in the symbol decoder, a respective symbol from a subsequent initial code for which a symbol is available in a respective sub-block of the block of the compressed data. The second symbol resolver outputs, by the symbol selector, as a second symbol, one of the respective symbols from the local symbol decoders selected by the symbol selector based on the initial code.

Abstract: In various embodiments, an encoded sequence (e.g., a compressed sequence for uncompressed data) that includes variable-length codes is decoded in an iterative fashion to generate a decoded sequence of symbols. During each iteration, a group of threads decode in parallel the codes in the encoded sequence to generate symbols. The group of threads then compute offsets based on the sizes of the symbols. Subsequently, the group of threads generates in parallel a contiguous portion of the decoded sequence based on the symbols, an output address, and the offsets.

Abstract: A data compression method, comprising: obtaining a plurality of values of a parameter and an occurrence probability of each of the plurality of values (S101) comparing the occurrence probability with a predetermined threshold, wherein values with the occurrence probability less than the predetermined threshold are first set of values, and values with the occurrence probability greater than or equal to the predetermined threshold are second set of values (S102), performing pretreatment on the first set of values (S103), and encoding the second set of values and the pretreated first set of values (S104). By means of the data compression method, the maximum codeword length can be effectively reduced, so as to reduce the requirements of a code table to the storage space.

Abstract: An encoder which encodes a current block to be encoded in an image includes: a transformer which performs a primary transform from residuals of the current block to primary coefficients, determines whether to apply a secondary transform to the current block, and performs the secondary transform from the primary coefficients to secondary coefficients when the secondary transform is applied; a quantizer which calculates quantized primary coefficients by performing a first quantization on the primary coefficients when a secondary transform is not applied, and calculates quantized secondary coefficients by performing a second quantization different from the first quantization on the secondary coefficients when the secondary transform is applied; and an entropy encoder which generates an encoded bitstream by encoding either quantized primary coefficients or quantized secondary coefficients.

Abstract: The present disclosure provides a decoding method and apparatus. The decoding method mainly includes: extracting pre-indexed information, storing the pre-indexed information in another file associated with a to-be-decoded file or a tail end of the to-be-decoded file, then reading the pre-indexed information before decoding is performed, and performing parallel decoding on multiple data segments in the to-be-decoded file according to the pre-indexed information. Using the foregoing storage method for the pre-indexed information may effectively reduce an I/O operation when the pre-indexed information is read, so as to avoid, to some extent, a system frame freezing phenomenon that may be caused when decoding is performed.

Abstract: A method of decoding video data includes receiving encoded data for a current block of the video data, the current block comprising one or more escape mode encoded samples and decoding, from the encoded data, a value indicating that the current block includes the one or more escape mode encoded samples. The method further includes, in response to determining that the value indicates that the current block includes the one or more escape mode encoded samples and that a current tree type for the current block is not dual tree chroma, decoding an absolute value for a luma delta quantization parameter for the current block and a sign for the luma delta quantization parameter. The method further includes reconstructing the current block based on the absolute value for the luma delta quantization parameter for the current block and the sign for the luma delta quantization parameter.

Abstract: Computer processor hardware receives a first set of adjustment values. The first set of adjustment values specify adjustments to be made to a predicted rendition of a signal generated at a first level of quality to reconstruct a rendition of the signal at the first level of quality. The computer processor hardware processes the first set of adjustment values and derives a second set of adjustment values based on the first set of adjustment values and a rendition of the signal at a second level of quality. The second level of quality is lower than the first level of quality.

Abstract: A method for encoding an image includes determining an intra-prediction mode of a current block; generating a prediction block of the current block according to the intra-prediction mode; generating a residual block by calculating a difference between the current block and the prediction block; transforming the residual block to generate a transform block; quantizing the transform block to generate a quantized block; and entropy-coding coefficients of the quantized block.

Abstract: A method for encoding an image includes determining an intra prediction mode of a current block; generating a prediction block of the current block according to the intra-prediction mode; generating a residual block by calculating a difference between the current block and the prediction block; transforming the residual block to generate a transform block; quantizing the transform block to generate a quantized block; and entropy-coding coefficients of the quantized block.

Abstract: A method for encoding an image includes determining an intra prediction mode of a current block; generating a prediction block of the current block according to the intra prediction mode; generating a residual block by calculating a difference between the current block and the prediction block; transforming the residual block to generate a transform block; quantizing the transform block to generate a quantized block; and entropy-coding coefficients of the quantized block.

Abstract: A method for encoding an image includes determining an intra prediction mode of a current block; generating a prediction block of the current block according to the intra-prediction mode; generating a residual block by calculating a difference between the current block and the prediction block; transforming the residual block to generate a transform block; quantizing the transform block to generate a quantized block; and entropy-coding coefficients of the quantized block.

Abstract: A method for encoding an image includes determining an intra prediction mode of a current block; generating a prediction block of the current block according to the intra-prediction mode; generating a residual block by calculating a difference between the current block and the prediction block; transforming the residual block to generate a transform block; quantizing the transform block to generate a quantized block; and entropy-coding coefficients of the quantized block.

Abstract: Many computing systems process data organized in a matrix format. For example, artificial neural networks (ANNs) perform numerous computations on data organized into matrices using conventional matrix arithmetic operations. One such operation, which is commonly performed, is the transpose operation. Additionally, many such systems need to process many matrices and/or matrices that are large in size. For sparse matrices that hold few significant values and many values that can be ignored, transmitting and processing all the values in such matrices is wasteful. Thus, techniques are introduced for storing a sparse matrix in a compressed format that allows for a matrix transpose operation to be performed on the compressed matrix without having to first decompress the compressed matrix. By utilizing the introduced techniques, more matrix operations can be performed than conventional systems.

Abstract: A plurality of entries associated with a media management operation for a plurality of transfer units are stored. A respective destination location for each of the respective transfer units are determined in connection with the garbage procedure such that a subset of the plurality of transfer units aligns with a codeword boundary on the memory page. A plurality of write commands in connection with the media management operation are issued based at least in part on the determining.

Abstract: According to the invention, there are provided sets of contexts specifically adapted to encode special coefficients of a prediction error matrix, on the basis of previously encoded values of level k. Furthermore, the number of values of levels other than 0 is explicitly encoded and numbers of appropriate contexts are selected on the basis of the number of spectral coefficients other than 0.

Abstract: According to the invention, there are provided sets of contexts specifically adapted to encode special coefficients of a prediction error matrix, on the basis of previously encoded values of level k. Furthermore, the number of values of levels other than 0 is explicitly encoded and numbers of appropriate contexts are selected on the basis of the number of spectral coefficients other than 0.

Abstract: Apparatus, system, methods, and articles of manufacture are disclosed to identify media using hash keys. An example system includes a hybrid hash key analyzer to access a metered hash key of an exposure record obtained from a meter, access reference records representative of respective portions of a plurality of media, and determine reference confirmation data candidates from respective ones of the reference records that include hash keys matching the metered hash key. The example system includes an impression logger to, when first confirmation data associated with the exposure record matches one of the reference confirmation data candidates, store an impression record that associates the media identification data associated with the matching one of the reference confirmation data candidates with a meter identifier of the exposure record. The impression logger also is to credit at least a portion of the media corresponding to the media identification data with an exposure credit.

Abstract: Techniques for improving the ability of FPGAs to process packets by implementing at least portions of the logic of packet parsers traditionally performed using the FPGA fabric as hardened resources, such as an Integrated Circuit (IC) block. The IC block receives bits of an incoming packet, carries these bits as a pipeline, and modifies a range of the bits through stages of aligners. The aligners extract header sections (or “windows”) of each packet header according to a shift amount, and the header sections are output to the FPGA fabric. The FPGA fabric includes extract and decision logic that maps the information included in the extracted header sections to a lookup vector, driving tables, and/or application logic. The FPGA provides shift amounts to subsequent aligners to cause the aligners to shift the packet bus such that previous header sections are removed.

Abstract: A method for generating codewords, the method may include obtaining an input tree, converting the input tree to a modified tree in which each symbol score is a power of two, wherein the conversion is responsive to a relationship between the aggregate count of symbols of the input tree and to a certain power to two that is a smallest power of two that exceeds the aggregate count of symbols; and assigning a codeword to each symbol based at least on the symbol counts associated with the leaves of the modified tree.

Abstract: Residual vectors are compressed in a lossless compression scheme suitable for cloud DVR video content applications. Thus, a cloud DVR service provider can take many copies of the same file stored in the cloud and save storage space by compressing those copies while still maintaining their status as distinct copies, one per user. Vector quantization is used for compressing already-compressed video streams (e.g., MPEG streams). As vector quantization is a lossy compression scheme, the residual vector has to be stored to regenerate the original video stream at the decoding (playback) node. Entropy coding schemes like Arithmetic or Huffman coding can be used to compress the residual vectors. Additional strategies can be implemented to further optimize this residual compression. In some embodiments, the techniques operate to provide a 25-50% improvement in compression. Storage space is thus more efficiently used and video transmission may be faster in some cases.

Abstract: Disclosed is a multi-channel image processing method including the steps of: storing a multi-channel image in one or several 2D texture units each formed of a pack of four tiles in a server; taking a selection of one or several channels of the multi-channel image into account; taking transformation and projection parameters (real-time user input) for the selected channels into account; applying the transformation on the selected channels, according to received parameters, all pixels of the selected channels being processed at the same time; projecting the selected channels into an RGB color space, according to the received parameters, all pixels of the selected channels being processed at the same time.

Abstract: Concepts for a link interface of a communication protocol are presented. Where the communication protocol provides for Idle Flits of first and second sizes for maintaining link continuity, the first size being smaller than the second size, such concepts are configured to remove Idle flits of the first size.

Abstract: Embodiments of the application provide a method for rate matching in a wireless communication network. A device obtains K information bits and a target code length M of a polar code, determines, according to a minimum value of a set of values, a mother code length N1, polar encodes the K information bits to obtain an encoded sequence of N1 bits, obtains a target sequence of M bits from the N1 bit encoded sequence, and outputs the M-bit target sequence. When the mother code length N1 is larger than the target code length M, (N1?M) bits of the encoded sequence are punctured or shortened from the N1 bit encoded sequence.

Abstract: An electronic device for decompressing compressed data includes a decoding subsystem having a symbol decoder and a second symbol resolver with a number of local symbol decoders and a symbol selector. The symbol decoder decodes a first symbol from a first code for which a symbol is available in a block of the compressed data and communicates a length of the code to the second symbol resolver. Each local symbol decoder, substantially in parallel with the decoding of the first symbol in the symbol decoder, decodes a respective symbol from a first code for which a symbol is available in a respective sub-block of the block of the compressed data. The second symbol resolver selects, as a second symbol, based on the length received from the symbol decoder, one of the respective symbols from the local symbol decoders. The decoding subsystem then provides the first and second symbols.

Abstract: The disclosure is directed to transforming signals from one signal format to another signal format. For example, the format of a digital signal can change from storing video information in 12 bits of data to storing the video information in 32 bits of data. Other storage values and combinations can also be used. Since the number of bits available to store a portion of the video information can change when changing formats, a process is needed to translate or transform the video information appropriately. A transfer function utilizing a lookup table is used for the transforming. The lookup table utilizes a variable step size segmentation scheme that decreases the amount of lookup table storage space required and also decreases the number of estimation errors, i.e., interpolation errors. Estimation errors can occur when looking up a value not stored in the lookup table, and using neighboring values that are stored to estimate the value requested.

Abstract: A decoding method, a memory controlling circuit unit, and a memory storage device are provided. The method includes: reading a first physical programming unit by using a first read voltage to obtain first data; determining whether a first ratio of a first quantity of a first bit value and a second quantity of a second bit value in the first data is greater than a threshold; when the first ratio is not greater than the threshold, performing a decoding operation according to the first data to generate first decoded data and outputting the first decoded data; and when the first ratio is greater than the threshold, not performing the decoding operation according to the first data.

Abstract: An information processing method is provided to reduce an amount of data to be monitored in an onboard system of a vehicle. In the method, detection results that indicate whether an abnormality is included in communication data on an onboard network are obtained, and a first log transmission instruction is generated to cause periodic transmission of a first log from the onboard system to a server device. The first log is a log of the communication data. A second log transmission instruction is generated to cause transmission of a second log from the onboard system to the server device in a case of the detection results indicating the abnormality is included in the communication data. The second log is a log of the communication data and includes an amount of data generated per unit time that is greater than the first log.

Abstract: An encoding/decoding technique is provided with which encoding can be performed using a small average number of bits even for a sequence of integer values including small non-zero values and having a distribution heavily biased toward small values. The present invention includes an integer encoding part 110 that, with respect to an inputted sequence of non-negative integer values x_n, n?{1, 2, . . . , N} (hereinafter referred to as an “integer sequence”), obtains a 1-bit code as a code corresponding to a run of integer values 0 of length L, a predetermined number which satisfies 2?L?2K?1, which is included in the integer sequence and obtains a (K×x_n)-bit or (K×x_n+1)-bit code as a code corresponding to a set of a run of integer values 0 of length from 0 to L?1 and one non-zero integer value x_n included in the integer sequence, where K is assumed to be an integer equal to or larger than 2.

Abstract: Intra prediction is used in state-of-the-art video coding standards such as AVC. The intra prediction modes are coded into the bitstream. Luma and chroma components could potentially have different prediction modes. For chroma components, there are 5 different modes defined in AVC: vertical, horizontal, DC, diagonal down right, and “same as luma”. Statistics show that the “same as luma” mode is frequent used, but in AVC, this mode is encoded using more bits than other modes during entropy coding, therefore the coding efficiency is decreased. Accordingly, a modified binarization/codeword assignment for chroma intra mode signaling is able to be utilized for high efficiency video coding (HEVC), the next generation video coding standard.

Abstract: Data protection with meta chunks increases capacity use efficiency without verification and data copying. In one aspect, a meta chunk is a data protection unit, which combines two or more source chunks that are determined to have a reduced sets of data fragments. The meta chunk can be encoded to generate a set of coding fragments, which can be stored and utilized to recover data fragments of any of the two or more source chunks. Further, the source chunks can be linked to the meta chunk. Furthermore, the sets of coding fragments, that were previously generated by individually encoding each source chunk, can be deleted.

Abstract: Techniques for computing a memory health metric are disclosed. A system computes a memory health metric as a function of estimated entropy in a data set. The system may determine the memory health metric based on compressed and uncompressed sizes of the data set, quantities of values in the data set, and/or patterns of structural relationships within the data set. The system determines whether the memory health metric crosses a threshold value. If the memory health metric crosses the threshold value, the system presents a warning indicating that utilization of the memory is unhealthy.

Abstract: A data transmitting apparatus, a data receiving apparatus and methods thereof are provided. The data transmitting apparatus includes an encoding module, an encoding table, a first encoding parameter, a second encoding parameter and a transmitting module. The encoding module reads and encodes data content containing at least one data unit. The encoding table records a variety of information of multiple data units, and the variety of information contain a unit content, a number of times encoded and a recorded position of each of the data units. The first encoding parameter provides first information of the data unit, and the first information relate to an existing state of the unit content of the data unit in the encoding table. The second encoding parameter provides second information, and the second information relate to an amount of data units currently recorded in the encoding table. The transmitting module transmits an encoded data.

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

Abstract: Intra prediction is used in state-of-the-art video coding standards such as AVC. The intra prediction modes are coded into the bitstream. Luma and chroma components could potentially have different prediction modes. For chroma components, there are 5 different modes defined in AVC: vertical, horizontal, DC, diagonal down right, and “same as luma”. Statistics show that the “same as luma” mode is frequent used, but in AVC, this mode is encoded using more bits than other modes during entropy coding, therefore the coding efficiency is decreased. Accordingly, a modified binarization/codeword assignment for chroma intra mode signaling is able to be utilized for high efficiency video coding (HEVC), the next generation video coding standard.

Abstract: Embodiments of the application provide a method for rate matching in a wireless communication network. A device obtains K information bits and a target code length M of a polar code, determines, according to a minimum value of a set of values, a mother code length N1, polar encodes the K information bits to obtain an encoded sequence of N1 bits, obtains a target sequence of M bits from the N1 bit encoded sequence, and outputs the M-bit target sequence. When the mother code length N1 is larger than the target code length M, (N1?M) bits of the encoded sequence are punctured or shortened from the N1 bit encoded sequence.

Abstract: According to one or more embodiments, multiple related data streams are compressed jointly, such that substantive similarities between the multiple related streams are leveraged to reduce the overall size of the resulting compressed data. Specifically, given the compressed version of a primary data stream, a secondary data stream may be highly compressed by utilizing portions of the compressed version of the primary data stream to represent similar portions of the secondary data stream. A compression application is configured to receive (either concurrently or separately) information identifying multiple related input streams. For each input stream provided to the compression application, the application outputs one output stream. The computing system writes the output streams of the compression application to storage. Embodiments allow the size of the compressed version of a secondary data stream to be greatly reduced compared to the size of the stream compressed without reference to a primary data stream.

Abstract: A method is disclosed for the decoding and encoding of a block-based video bit-stream such as MPEG2, H.264-AVC, VC1, or VP6 using a system containing one or more high speed sequential processors, a homogenous array of software configurable general purpose parallel processors, and a high speed memory system to transfer data between processors or processor sets. This disclosure includes a method for load balancing between the two sets of processors.

Abstract: Disclosed are systems, methods, and non-transitory computer-readable media for a high efficiency data decoder. The high efficiency data decoder accesses an encoded data input from an input device and determines that the encoded data input does not map to any predetermined data outputs from a set of predetermined data outputs. The high efficiency data decoder selects, based on a ranking of modifications for the input device, a modification to perform on the encoded data input. The high efficiency data decoder performs the first modification on the encoded data input, yielding a modified encoded data input. If the modified encoded data input maps to a first data output from the set of predetermined data outputs, the high efficiency data decoder decodes the encoded data input into the first data output.

Abstract: A picture prediction method includes: determining two pixel samples in a current picture block, and determining a candidate motion information unit set corresponding to each of the two pixel samples; determining a merged motion information unit set i including two motion information units; and predicting a pixel value of the current picture block by using an affine motion model and the merged motion information unit set i.

Abstract: Provided is, for example, an arithmetic coding device capable of coding, at high speed, a symbol sequence including a context symbol and a bypass symbol. The arithmetic coding device updates an occurrence probability of a context symbol for a symbol sequence including the context symbol and a bypass symbol; updates a numerical range for the symbol sequence based on the updated occurrence probability; updates the updated numerical range based on a predetermined probability, the numerical range being a basis of an arithmetic code, the numerical range being updated in accordance with the occurrence probability of the context symbol and the predetermined probability for the bypass symbol; and generates an arithmetic code of the symbol sequence based on the updated numerical range in accordance with a procedure of generating the arithmetic code.

Abstract: One embodiment provides a method comprising receiving a plurality of encoded and compressed data blocks, decoding the data blocks, and decompressing the data blocks utilizing a plurality of processor sets. Each processor set is assigned a data block to decompress. The processor sets decompress in parallel to exploit inter-block parallelism. Each processor set comprises one or more processors that collaborate in decompressing an assigned data block to exploit intra-block parallelism. The method further comprises generating a final uncompressed output sequence based on uncompressed data blocks resulting from the decompressing.

Abstract: Techniques for duplicating deduplicated data include identifying a connection between a source deduplicated data storage and a target deduplicated data storage. A location of a block of data is determined that is located on the source deduplicated data storage for copying to the target deduplicated data storage. A first reference on the target deduplicated data storage is created to the location of the block of data on the source deduplicated data storage. A second reference is created on the source deduplicated data storage to the location of the block of data on the source deduplicated data storage.

Abstract: Methods of encoding and decoding data in which some data symbols are entropy coded and some data symbols are bypass coded. The encoder separates the coded symbols into an entropy coded stream and a bypass coded stream. The streams are packaged in a data unit that has a payload structured to contain one of the streams in forward order and the other stream in reverse order, with the reverse order stream aligned with the end of the data unit. In this manner, at the decoder, the decoder may begin decoding the forward order stream from its beginning and may also begin decoding the reverse order stream from its beginning at the end of the data unit by extracting symbols in reverse order. The data unit does not need to signal the length of the streams. The decoder determines the length of the data unit from explicit or implicit signaling.

Abstract: A transmitting system includes a variable-length packet multiplexing apparatus and a transmission slotting apparatus. The variable-length packet multiplexing apparatus generates a variable-length packet. The transmission slotting apparatus stores the variable-length packet in slots forming transmission main signals. The transmission slotting apparatus includes a capacity calculator, an extractor, a remainder calculator, a selector, and a slot information multiplexer. The capacity calculator calculates a data capacity of the transmission main signals for one frame. The extractor extracts a byte number of the variable-length packet. The remainder calculator calculates a remaining capacity of the transmission main signals. The selector stores a predetermined data sequence in a region left in the slots, and outputs the slots storing the data sequence. The slot information multiplexer multiplexes slot information and the slots output by the selector.

Abstract: An image capturing apparatus including a pixel region in which a plurality of pixels are arranged in a matrix, an A/D converter configured to convert a plurality of signals output from the plurality of pixels into a plurality of corresponding digital data, and a signal processing unit configured to generate an error-correcting code for the plurality of digital data, wherein, in the generating the error-correcting code, the signal processing unit performs grouping the plurality of digital data output from the A/D converter into a plurality of groups, and wherein the signal processing unit performs the grouping so that, in each of the plurality of groups, a total data length of the digital data forming corresponding one of the plurality of groups is not shorter than a length of the error-correcting code.

Abstract: A system and method, including determining, by a processor, a data type for each column of a database table; determining, by the processor and based on the determined data type for each column of the database table, an indication of a size of the database table; calculating, by the processor and based on the determined indication of the size of the database table, a start nbit size for a nbit compression process to be used on the database table; specifying, by the processor, the calculated start nbit size for the nbit compression process; and compressing the database table by executing the nbit data compression process using the specified start nbit size.