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: In some aspects, the techniques described herein relate to a method including: obtaining data to be compressed; determining a distance between the data to be compressed and each codeword of a plurality of codewords; selecting a predetermined number of codewords of the plurality of codewords based on the distance between the data to be compressed and each of the predetermined number of codewords; and generating compressed data, where the compressed data includes an indication of the predetermined number of codewords of the plurality of codewords.

Abstract: A context-based adaptive binary arithmetic coding (CABAC) decoder includes a bin decode circuit and a context update circuit. The bin decode circuit supports decoding of multiple bins in one cycle. The multiple bins include a first bin and a second bin. The bin decode circuit generates a bin value of the first bin according to a first set of multiple contexts, a first range and a first offset, and generates one bin value of the second bin according to a second set of multiple contexts, a second range and a second offset. The context update circuit updates the first set of multiple contexts in response to the bin value of the first bin, to generate a first set of multiple updated contexts, and updates the second set of multiple contexts in response to said one bin value of the second bin, to generate a second set of multiple updated contexts.

Abstract: A memory device includes a memory; and at least one processor configured to: obtain a symbol stream including a plurality of symbols; determine a Huffman tree corresponding to the symbol stream, wherein each symbol of the plurality of symbols is assigned a corresponding prefix code from among a plurality of prefix codes based on the Huffman tree; generate a prefix length table based on the Huffman tree, wherein the prefix length table indicates a length of the corresponding prefix code for each symbol; generate a logarithm frequency table based on the prefix length table, wherein the logarithm frequency table indicates a logarithm of a frequency count for each symbol, generate a cumulative frequency table which indicates a cumulative frequency count corresponding to each symbol; generate a compressed bitstream by iteratively applying an encoding function to the plurality of symbols based on the logarithm frequency table and the cumulative frequency table; and store the compressed bitstream in the memory.

Abstract: A method is provided for decompressing wide word data compressed in parallel. The method includes creating an instance of memory structure for a wide word in the wide word data, where the instance of memory structure is an inverse of a compression dictionary for the wide word; retrieving multiple compressed codes iteratively from a gap-free compressed output stream of the wide word data using the instance of memory structure, where each compressed code includes at least one character code and a reverse-pointer, and where at least one compressed code includes a multi-symbol string having a multiple character codes; forming an intermediate decompressed output stream by iteratively following the reverse-pointers for the multiple compressed codes, respectively; and forming decompressed output stream by reversing an order of the character codes in the multi-symbol string of the at least one compressed code.

Abstract: Systems and methods for detection of domain generated algorithms (DGA) and their command and control (C&C) servers are disclosed. In one embodiment, such an approach includes examining DNS queries for DNS resolution failures, and monitoring certain set of parameters such as number of levels, length of domain name, lexical complexity, and the like for each failed domain. These parameters may then be compared against certain thresholds to determine if the domain name is likely to be part of a DGA malware. Domain names identified as being part of a DGA malware may then be grouped together. Once a DGA domain name has been identified, activity from that domain name can be monitored to detect successful resolutions from the same source to see if any of the successful domain resolutions match these parameters. If they match specific thresholds, then the domain is determined to be a C&C server of the DGA malware and may be identified as such.

Abstract: A sequence of integer values is encoded and decoded with a number of bits of a decimal value substantially assigned per sample or/and with a smaller memory amount or calculation processing amount than in the prior art. The encoder receives the sequence of integer values as input and outputs an integer code corresponding to the sequence of integer values. An integer transformer (11) obtains one integer value (transformed integer) through algebraically-representable bijective transformation for each of a plurality of sets of integer values included in the inputted sequence of integer values. An integer encoder (12) encodes the transformed integer to thereby obtain an integer code.

Abstract: Provided is a technique for converting an integer value sequence for encoding/decoding which allows an integer value sequence having a distribution including small values other than a zero value and greatly biased to small values to be encoded with a small average bit number. Provided are: a unary coding unit which subjects an input sequence of non-negative integer values to unary coding to obtain a unary code sequence; a bit reversing unit which replaces a bit value ‘0’ with a bit value ‘1’ and a bit value ‘1’ with a bit value ‘0’ in the bits in the unary code sequence to obtain a replaced code sequence; and a unary decoding unit which subjects the replaced code sequence to unary decoding to obtain a sequence of non-negative integer values.

Abstract: A method for decoding a video performed by a decoding device according to the present document is characterized by comprising: a step for acquiring video information including prediction mode information and residual information through a bitstream; a step for deriving a prediction mode of a current block on the basis of the prediction mode information; a step for deriving a prediction sample on the basis of the prediction mode; a step for deriving a current residual coefficient on the basis of residual syntax elements for the current residual coefficient in the current block; a step for deriving a residual sample on the basis of the current residual coefficient; and a step for deriving a reconstructed sample of the current block on the basis of the prediction sample and the residual sample.

Abstract: Interpolation between explicitly signaled CPB (or HRD) parameters at selected bit rates is used to achieve a good compromise between CPB parameter transmission capacity and CPB parametrization effectiveness and may be, particularly, made in an effective manner.

Abstract: Embodiments of the present disclosure include techniques for compressing data using a tree encoded bit mask that may result in higher compression ratios. In one embodiment, an input vector having a plurality of values is received by a first plurality of switch circuits. Selection of the input values is controlled by sets of bits from the bit mask. The sets of bits specify locations of portions of the input vector where particular value of interest reside. The switch circuits output multiple values of the input vector, which include the particular value of interest. A second stage of switch circuits is controlled by logic circuit that detects values on the outputs of the first stage of switch circuits and outputs the values of interest. In some embodiments, the values of interest may be non-zero values of a sparse input vector, and the switch circuits may be multiplexers.

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: A system includes a memory and a processor, where the processor is in communication with the memory. The processor is configured to receive a request to compress a schema. The schema is analyzed to determine whether to apply a first type of compression or a second type of compression, where analyzing the schema includes determining whether the schema exceeds a threshold level. Upon determining that the schema exceed the threshold level, a compressed schema is generated by performing the second type of compression. Next, the processor responds to the request with the compressed schema.

Abstract: Systems and methods in accordance with various embodiments of the invention perform lossless source coding. Nested code structures are utilized to perform Random Access Source Coding (RASC), where the number of active encoders is initially unknown. Decoders can attempt to source decode using a number of Slepian-Wolf decoders corresponding to an estimated number of sources. Multiple source encoders are configured to receive start messages and transmit portions of codewords, selected by source encoding data from sources to remove redundancy, until an end of epoch message is received.

Abstract: A method for processing data overflow in a decompression process, includes: decompressing an original text, and detecting whether a data overflow event occurs in the decompression process; in response to detecting the data overflow event, storing first data obtained by decompression in a host cache into a target memory, and closing a data read-in port of a decoding engine; decompressing data which is being decompressed in the decoding engine to obtain second data, and storing the second data into a cache of the decoding engine; calculating a position of the decompressed data in the original text; obtaining, on the basis of the position, data which is not decompressed in the original text, re-decompressing the data which is not decompressed to obtain third data, and storing the second data into the target memory; and splicing the first data, the second data, and the third data to obtain complete decompressed data.

Abstract: Systems and methods for stream-based compression are described. One example is an encoder of a first device that receives an input stream of bytes including a first byte preceded by one or more second bytes. The encoder may determine to identify a prefix code for the first byte. The encoder may select a prefix code table using the one or more second bytes. The encoder may identify, from the selected prefix code table, the prefix code of the first byte. The encoder may generate an output stream of bytes by replacing the first byte in the input stream with the prefix code of the first byte. The encoder may transmit the output stream from the encoder of the first device to a decoder of a second device. The output stream may have a fewer number of bits than the input stream.

Abstract: Embodiments disclose an encoding method and a communications device. The method includes: obtaining and encoding a to-be-encoded information bit sequence based on a binary vector P1 of a first code, to obtain and output an encoded bit sequence, where P1 is determined based on a binary vector P2 of a second code and a binary vector P3 of a third code, P1, P2, and P3 indicate an information bit and a frozen bit of the first code, the second code and the third code respectively, a code length of the first code, the second code and the third code is n1, n2 and n3 respectively, a quantity of information bits of the first code, the second code and the third code is k1, k2 and k3 respectively, n1=n2*n3, and k1=k2*k3. Therefore, parallel decoding can be performed, helping reduce a decoding delay.

Abstract: In described examples, a voltage regulator includes a processor. A register bank is coupled to the processor. A logic block is coupled to the processor and to the register bank. The logic block receives frames. The processor programs the logic block and the register bank based on at least one of the frames.

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: Disclosed are various approaches for a controller that can generate and use non-stationary polar codes for encoding and decoding information. In one example, a method includes performing, by an encoder of the controller, a linear operation on at least one vector of information to be stored in a memory. The linear operation includes generating a polar encoded representation from the at least one vector of information. The linear operation also includes generating an output using at least one permutation that is based on a statistical characterization analysis of channels of the memory and a channel dependent permutation that is applied to the polar encoded representation. In some aspects, the statistical characterization analysis includes a respective reliability level of each one of the plurality of channels, and the channel dependent permutation includes an ordered permutation that orders the channels according to their respective reliability level.

Abstract: A one-shot state transition decoder receives a codeword having N-bits. The decoder reads a first D-bits of the codeword to determine a stitching location d within the codeword. The stitching location identifies a start bit of unencoded data in the codeword. The codeword is decoded into an output buffer for user data of L bits, where N>L. Parameters of the decoder are set before the decoding, including setting a length of the codeword to N?L+d and a number of expected decoded bits to d. The decoding including decoding the d bits based on a set of state transition probabilities and copying decoded bits into the output buffer, the unencoded data being copied to the end of the output buffer.

Abstract: A signal processing device includes a distributing unit and a plurality of correcting units with different processing performance, the distributing unit distributes a bit sequence having a first number of bits to the first correcting unit, and a bit sequence having a second number of bits less than the first number of bits to the second correcting unit having lower processing performance than the first correcting unit, the first correcting unit applies error correction processing to the bit sequence having the first number of bits distributed to the first correcting unit, and the second correcting unit applies error correction processing to the bit sequence having the second number of bits distributed to the second correcting unit.

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: 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.