Abstract: An improved method for encoding and decoding data, such as in a base64 system, uses multiple look-up tables to perform the encoding function and to eliminate or reduce bit-shifting and the bit masks in encoding systems through use of pre-populated look-up tables. One example application is converting between media data that is typically quickly viewable on a media device and ASCII or similar data useful in data transfers, such as email. In specific embodiments, a series of pre-fetch encode and decode tables are constructed and indexed to fetch pre-calculated values to, for example, rapidly encode and decode any number of bit representations into any other bit representations.

Abstract: Targeted compression of strings is provided for XML and other documents using local tables whose scope need not align with syntactically well-formed document regions. The local table's scope is fixed (not sliding), and may be nested within other local table scopes. A string is nominated for inclusion, and record(s) are inserted in a document encoding to effect the nomination. The nominated string is placed in the local table in correspondence with a token identifier. During compression, reference(s) to the string's token identifier are included in the document encoding; during decompression the references are replaced by the string. The local table is deleted at the end of its scope. Tables may have multiple channels, with nominated strings placed in a channel based on frequency of references to the strings. The document encoding may include the local table(s), static table(s), and dynamic table(s) in a flat token value space.

Abstract: A compression engine starts compressing data by a preset first compression rule, compresses the following data by a second compression rule when the characteristics of the data satisfy a predetermined switching condition, and returns to the first compression rule when the characteristics of the data do not satisfy the switching condition to compress the data and the following data. A decompression engine starts decompressing compressed data by a first decompression rule corresponding to the first compression rule, decompresses the following compressed data by a second decompression rule corresponding to the second compression rule when the characteristics of the data after decompression satisfy the switching condition, and returns to the first decompression rule when the characteristics of the data after decompression do not satisfy the switching condition to decompress the data and the following compressed data.

Abstract: A method for encoding an input file into an output file that is compressed so that the number of bits required to represent the output file is less than the number of bits of the input file. The encoding method includes the parsing of the input file into a series of data items, the data items having an order and collectively corresponding to the input file. The encoding method compares the series of data items against a static dictionary having at least mappings between terminal sequence pointers and representations of data items.

Abstract: A codebook, a codebook creating method, and an uplink transmission method and equipment based on the codebook are provided. A new codebook is put forward in the method. The codebook includes one or any combination of the following elements: 1 2 ? [ 1 0 1 / 2 ? 0 - ? / 2 0 1 ? / 2 0 ? - ?? / 2 ] , ? 1 2 ? [ 1 0 1 / 2 0 1 ? ? 2 ? 0 - ? / 2 0 ? - ?? / 2 ] , ? and ? ? 1 2 ? [ 1 0 1 / 2 0 1 ? / 2 0 ? - ?? / 2 ? 0 - ? / 2 ] , where |?|=1,|?|=1,|?|=1.

Abstract: The present disclosure includes apparatus, systems and techniques relating to pipelined processing. In some implementations, a method performed by a data processing device includes storing data in a memory module. The method includes processing the stored data in accordance with a compression algorithm to produce processed data. Processing the stored data includes pipelined processing of a defined number of symbols of the stored data in parallel, and discarding results of the pipelined processing that are rendered invalid by other results of the pipelined processing. Additionally, the method includes outputting the processed data.

Abstract: In a compression/decompression apparatus that compresses or decompresses a plurality of sub-block data elements, a compressing unit compresses the plurality of sub-block data elements in parallel by a plurality of compressors. A combining unit combines compressed data by the plurality of compressors to generate a transfer data such that the transfer data has a transfer data amount corresponding to a plurality of transferring cycles, each transfer data amount per one transferring cycle is divided into a plurality of segmented regions in same number as number of the sub-block data elements, and allocating each compressed data of the plurality of sub-block data elements is allocated to a corresponding segmented region of the plurality of segmented regions, and outputs the transfer data to the external memory. A decompressing unit decompresses the transfer data read from the external memory in parallel by using a plurality of decompressors. An arranging unit performs address conversion.

Abstract: Disclosed are a Multiple User Multiple Input Multiple Output (MU-MIMO) codebook design method, and a communication device using the codebook. A MU-MIMO codebook design method includes analyzing beam patterns of candidate vectors included in a predetermined candidate codebook, and eliminating at least one of the candidate vectors based on the beam patterns of the candidate vectors to generate the MU-MIMO codebook for a MU-MIMO system being comprised of the remaining vectors.

Abstract: A variable length decoder that decodes a variable length code to output data including a run and a level, the variable length decoder includes a memory that stores an output format of a run and a level according to a prefix for specifying an area which is generated by dividing a run-level plane based on the run; a extraction circuit that extracts the prefix, run computation data, and level computation data from the variable length code; and an output circuit that accesses the memory based on the prefix and outputs the data based on the run computation data and the level computation data.

Abstract: An object of the present invention is to provide a binary arithmetic coding device that allows real-time processing with a higher image quality. At a timing at which a ternary data string for a target bit is outputted, an updated coding range width and an updated range width of less probability are outputted. For that reason, while a binary conversion unit (32) and an f value retention processor (33) convert the ternary data string into a binary data string to output a coded bit, a binary arithmetic re-normalization unit (31) is allowed to perform a processing of binary arithmetic coding for the next bit.

Abstract: A decoding method includes: inputting control information including first and second codec identifiers identifying first and second codecs corresponding to first and second material data, respectively, and first and second time information representing start times of decoding of the first and second material data, respectively; loading corresponding to the first codec identifier the first codec into the first decode processing unit; starting in the first decode processing unit corresponding to the first time information decoding of the first material data; and loading corresponding to the second codec identifier the second codec into the second decode processing unit.

Abstract: A method of processing a signal is disclosed. The present invention includes receiving a maximum number of band and a code value of at least one section length, calculating a bit number corresponding to the code value of the at least one section length using the maximum number of the band, and obtaining the section length information by decoding the code value of the section length based on the bit number. A method of processing a signal is disclosed. The present invention includes receiving factor information of a current frame, receiving flag information indicating whether a coding mode of the factor information is an absolute value mode or a relative value mode, and obtaining factor data of the current frame using factor data of a previous frame and the received factor information based on the flag information.

Abstract: Disclosed are a Multiple User Multiple Input Multiple Output (MU-MIMO) codebook design method, and a communication device using the codebook. A MU-MIMO codebook design method includes analyzing beam patterns of candidate vectors included in a predetermined candidate codebook, and eliminating at least one of the candidate vectors based on the beam patterns of the candidate vectors to generate the MU-MIMO codebook for a MU-MIMO system being comprised of the remaining vectors.

Abstract: In a bit stream syntax containing compressed video slice data for compressed video data of a slice structure, a slice header for compressed video slice data has attached thereto a slice start code, a register reset flag indicating whether a register value, which designates a status of a codeword occurring in an arithmetic coding process, should be reset in the next transmission unit, an initial register value which indicates a register value to be used to start arithmetic coding/decoding to build/decompose the next transmission unit, only when the register reset flag indicates that the register should not be reset.

Abstract: To provide a code amount estimating device which can perform, at high speed and with high precision, estimation of code amount obtained after arithmetic coding. The code amount estimating device includes a context index calculation unit which calculates a context index of a binary symbol included in binary data, and an estimate code amount calculation unit which calculates an estimate code amount for the binary data based on symbol occurrence probability information stored in association with the calculated context index and on a held probability interval range. The estimate code amount calculation unit estimates the code amount for the binary data according to code amount information indicating an association between (i) a combination of a binary symbol string including one or more binary symbols, symbol occurrence probability information, and a probability interval range and (ii) an estimate code amount for the binary symbol string.

Abstract: It provides a method for encoding a set of elements by using components defining the structure of each of the set of elements, wherein each element comprises data structure information and at least one data value. The method comprises the steps of: selecting a current element for encoding; determining whether the current element has the same data structure information as a previously encoded element; in the negative, encoding the data structure information of the current element and the at least one data value of the current element; and in the affirmative, encoding the at least one data value of the current element and providing an indication value associated with the current element indicating the current element has the same data structure information as said previously encoded element. The method is used to reduce the encoding redundancy of the structure information.

Abstract: An apparatus and a method of lossless coding and decoding are provided. The apparatus to perform lossless coding may selectively perform an arithmetic coding scheme or a Huffman coding scheme with respect to a symbol. The apparatus to perform lossless coding may generate a bitstream including a first coding bit, generated according to the Huffman coding scheme. Such bitstream may include a reserved bit for the arithmetic coding scheme.

Abstract: A network optimization device may receive a stream of data and generate a signature for a plurality of fixed length overlapping windows of the stream of data. The device may select a predetermined number of the generated signatures for each Ln-byte segment of the data stream, wherein Ln is greater than a length of each of the windows. The network device may store the selected signatures in a bucketed hash table that includes a linked-list of entries for each bucket.

Abstract: An image coding apparatus provides a run-length encoding unit RLE1 that subjects quantized coefficients which are obtained by quantizing frequency components of an image signal to a variable length coding process by using a run value Run that indicates the number of successive zero coefficients and a level value Lev that indicates a value of a non-zero coefficient following the zero coefficients. The run-length encoding unit RLE1 includes a reordering unit Lreodr for reordering level values Lev; a variable length coder LVLC for coding reordered level values ROLev by using a code table that is selected according to the value of a quantization parameter QP; a reordering unit Rreodr for reordering run values Run from high frequency component of the quantized coefficients to low frequency component; and a variable length coder RVLC for coding reordered run values RORun by using a code table that is selected according to the number of already-processed run values.

Abstract: Disclosed herein is an arithmetic decoding apparatus including an instruction decoder configured to decode an arithmetically encoded data decoding instruction to be executed for carrying out an arithmetic-decoding process of arithmetically decoding arithmetically encoded data into a binary signal; an execution condition code holding section configured to hold the binary signal obtained as a result of an immediately preceding arithmetic-decoding process as an execution condition code; and an arithmetic decoding execution section configured to determine whether a context number specified by the arithmetically encoded data decoding instruction is to be used as a context index as it is or the specified context number incremented by 1 is to be used as the context index in accordance with the execution condition code, and carry out the arithmetic decoding process by making use of the determined context index.

Abstract: Systems and methods for the encoding of data in a dataset, comprising the storage of the data in an i-th temporary code list (TCL(i)); generating an i-th folder (folder(i)) from the i-th temporary code list (TCL(i)) by replacing each value by an index that refers to the same value in a reference database; generating new temporary codes, using a predetermined formula F that always combines at least two values from the i-th folder (folder(i)), and placing thereof in an (i+1)-th temporary code list (TCL(i+1)); and the recursive repetition of actions b) and c) for subsequent values of i, so long as the (i+1)-th temporary code list (TCL(i+1)) or the (i+1)-th folder (Folder(i+1)) contains one or more values more than once.

Abstract: A method and a computer program product for precoding are provided.

Abstract: A system and method is provided for handling the collation of linguistic symbols of different languages that may have various types of compressions (e.g., from 2-to-1 to 8-to-1). A symbol table of the symbols identified as Unicode code points is generated, with each symbol tagged with a highest compression type of that symbol by sorting the compression tables of the various languages. During a sorting operation with respect to a given string, the tag of a symbol in the string is checked to identify the highest compression type of compressions beginning with that symbol, and the compression tables for the language with compression types equal or lower than the highest compression type of the symbol are searched using a binary search method to find a matching compression for the symbols in the string. A common search module is used to perform binary searches through compression tables of different compression types.

Abstract: An entropy decoding device offers all nodes on a decoding tree, and a most probable symbol for each node, and predicts presumptive information of a next node. The entropy decoding device decodes an encoded bit stream, and output a decoded content that includes real information of the next node. The entropy decoding device further generates a flush instruction to the table look-up module, when the prediction misses, and updates the most probable symbol.

Abstract: A data compressor for compressing a data signal and a corresponding data decompressor are disclosed. The data compressor comprises: compression circuitry for compressing said data signal using a plurality of variable length compression codes; a digital code select signal generator for generating a digital code select signal from an indicator signal indicative of a preferred compression distribution, a frequency of said digital code select signal being higher than a frequency of said indicator signal and an average value of said digital code select signal corresponding to an average value of said indicator signal; said compression circuitry being responsive to said digital code select signal to select between one of said plurality of compression codes in dependence upon a current value of said digital code select signal and to compress said data signal using said selected compression code.

Abstract: A method, a codebook, and a Base Station (BS) for precoding are provided. The precoding method includes: obtaining a total uplink power of a User Equipment (UE); if the total uplink power is greater than ¾ of a rated total transmit power of antennas, selecting a codeword from a first codebook with imbalanced power between layers; otherwise, selecting a codeword from the first codebook and a second codebook with balanced power between layers, so as for precoding data to be transmitted according to the selected codeword. Thus, a loss of an antenna performance at a high signal-to-noise ratio is reduced, and the loss of the power amplification of the antenna is reduced if the transmit power of the antenna is restricted.

Abstract: A microprocessor control unit (MCU) is mounted on a printed circuit board. The MCU includes first and second clocked serial interface (CSI) circuits. The first CSI circuit is configured to serially transmit a first xCP packet to a first encoder circuit, which in turn is configured to generate an encoded first xCP packet as a function of the first xCP packet and a first clock signal. A first low voltage differential signal (LVDS) circuit is coupled to the first encoder circuit and configured to serially receive the encoded first xCP packet therefrom. The first LVDS circuit is configured to generate a first differential signal as a function of the encoded first xCP packet.

Abstract: In a bit stream syntax containing compressed video slice data for compressed video data of a slice structure, a slice header for compressed video slice data has attached thereto a slice start code, a register reset flag indicating whether a register value, which designates a status of a codeword occurring in an arithmetic coding process, should be reset in the next transmission unit, an initial register value which indicates a register value to be used to start arithmetic coding/decoding to build/decompose the next transmission unit, only when the register reset flag indicates that the register should not be reset.

Abstract: A high-speed lookup table is designed using Rapid Single Flux Quantum (RSFQ) logic elements and fabricated using superconducting integrated circuits. The lookup table is composed of an address decoder and a programmable read-only memory array (PROM). The memory array has rapid parallel pipelined readout and slower serial reprogramming of memory contents. The memory cells are constructed using standard non-destructive reset-set flip-flops (RSN cells) and data flip-flops (DFF cells). An n-bit address decoder is implemented in the same technology and closely integrated with the memory array to achieve high-speed operation as a lookup table. The circuit architecture is scalable to large two-dimensional data arrays.

Abstract: A decoding method comprising the following steps is provided. The mth lookup index for a new lookup table is obtained according to the number of leading 1's in the bit stream. The nth base Huffman code in a simplified Huffman table is obtained according to the mth lookup index. The (n+1) most significant bits (MSB) are obtained from the bit stream according to the nth base Huffman code. A difference is generated according to the (n+1) MSBs in the bit stream and the nth base Huffman code. Whether the difference is less than 0 is checked. If yes, a symbol index is generated according to the difference and the nth base symbol index, and a symbol is obtained according to the symbol index. If no, n is decreased or increased by 1 according to the method being used, and the data in the simplified Huffman table is compared continually.

Abstract: A method and apparatus for generating and transmitting codewords is provided. The method includes receiving information bits with a variable length, selecting vectors by the length of the information bits from a generator matrix, and generating a codeword based on the information bits and the generator matrix. Codewords with a certain length providing a coding performance with respect to received variable information bits can be obtained.

Abstract: A method for compressing a data stream based on a 3 byte sequence is used. Each three byte sequence is assigned a code word including a location and a length of the data associated with the code word. When a 6 byte sequence is located, a binary tree of 6 byte sequences sharing the same first three bytes is built, associating each 6 byte sequence with a position in the stream where the 6 byte sequence is found. When the length of a code word is changed, a byte sequence is emitted that identifies the code word to be changed and updating the length of the code word, so that when a match is found, a byte sequence is emitted that identifies the code word associated with the matched data. The method finds particular application in data streams that are sent to printers, and which contain large blocks of identical data.

Abstract: A high-speed, space-efficient, scalable and easily updateable data boundary hash-based structure is generated and used. The proposed boundary hash-based data structure provides minimal perfect hashing functionality while intrinsically supporting low-cost set-membership queries. In other words, in some embodiments, it provides at most one match candidate in a set of known arbitrary-length bit strings that is used to match the query.

Abstract: Embodiments of the invention include a dictionary based data compression method, apparatus and system that is not based on either the LZ77 compression algorithm or the LZ78 compression algorithm, but includes many features of the LZW compression algorithm. The data compression method includes creating a mapping table of the messages in the alphabet of messages to a corresponding plurality of codewords, maintaining a dictionary including a mapping table of a first codeword and a second codeword to a new codeword, reading an input ensemble including a plurality of messages, converting the messages to an input codeword using the mapping table, and outputting the converted codewords as an output ensemble of compressed data. Unlike conventional data compression methods, the dictionary is generated from the output ensemble only, and is not based on any input messages. Therefore, the dictionary more quickly builds to define longer sequences of messages compared to conventional data compression methods.

Abstract: In a bit stream syntax containing compressed video slice data for compressed video data of a slice structure, a slice header for compressed video slice data has attached thereto a slice start code, a register reset flag indicating whether a register value, which designates a status of a codeword occurring in an arithmetic coding process, should be reset in the next transmission unit, an initial register value which indicates a register value to be used to start arithmetic coding/decoding to build/decompose the next transmission unit, only when the register reset flag indicates that the register should not be reset.

Abstract: A method for encoding data packets includes providing an encoding scheme for coding source data units into encoded data units; establishing a first look-ahead table for the source data units; providing a data packet including a first source data unit and a second source data unit; encoding the first source data unit to generate a first encoded data unit; indexing the first look-ahead table using the first source data unit to determine a balancing capability of the first encoded data unit for balancing a running disparity; and encoding the second source data unit to generate a second encoded data unit using the balancing capability of the first encoded data unit.

Abstract: Aspects of the invention provide a method and system for coding information in a communication channel. More particularly, aspects of the invention provide an method and system for synchronous running encryption and/or encoding and corresponding decryption and decoding in a communication channel or link. Aspects of the method may include encoding and/or encrypting a first data using a first or second encoding table and/or a first or second encryption table. The method may indicate which one of the first or second encoding tables or which one of the first or second encryption tables were utilized for encoding and/or encrypting the said first data. The encoded and/or encrypted first data may subsequently be transferred downstream and decoded by synchronous decoder/decryptor using a corresponding decoding and/or decryption table.

Abstract: Techniques for hashing and decompression of data are disclosed. Hashing and decompression of compressed data can be integrated in order to effectively hash and decompress the compressed data at the same time. The integrated hashing and decompression techniques of the invention are useful for any computing environment and/or system where compressed data is hashed and decompressed. The invention is especially useful for safe computing environment and/or system (e.g., a Trusted Computing (TC) computing environment) where hashing decompression of compressed data can be routinely performed. The Integrity of a computing environment and/or system can be protected by integrating the decompressing and hashing of the compressed data or effectively hashing and decompressing the compressed data at the same time. A combined hashing and decompression function can be provided based on conventional hashing and compression functions by integrating their similar components and in an efficient manner.

Abstract: An audio encoder performs entropy encoding of audio data. For example, an audio encoder determines whether a first code table in a group of plural code tables contains a code representing a first vector. If it does, the code is used, and otherwise the escape code from the first code table is used and the first vector is encoded using, at least in part, a second code table. An audio decoder performs corresponding entropy decoding.

Abstract: Techniques for optimizing the Context-based Adaptive Binary Arithmetic Coding (CABAC) bitstream decoding are disclosed. In one configuration, a device has a first processing circuit operative to decode a Context-based Adaptive Binary Arithmetic Coding (CABAC) bitstream into an intermediate signal having a CABAC decoded standard format and a decoded order. A second processing circuit decodes the intermediate signal using a non-CABAC decoding standard. A buffer is provided between the first and second processing circuits to improve processing speeds.

Abstract: A block encode circuit (800) including a scanner (820) operable to scan a block having data values spaced apart in the block by run-lengths to produce a succession of pairs of values of Level and Run representing each data value and run-length, and wherein the Level values include one or more AC values succeeded by a DC value in the succession, and a Run-Level encoder (830) responsive to said scanner (820) to encode the values of Level and Run in a same AC to DC order as in the succession of pairs of values from said scanner (820) to deliver an encoded output. Other encoders, decoders, codecs and systems and processes for their operation and manufacture are disclosed.

Abstract: A CABAC-type encoding device for encoding an initial flow of binary digital information for generating an output flow for forming video images after decoding, includes: elements for analyzing successive sequences of bits of the initial binary flow, bit-by-bit, and for deducing, for each bit, an interval representing the occurrence probability associated with the bit, the interval being defined by the size thereof and the lower boundary thereof; elements for analyzing the interval and ensuring a renormalization thereof. The elements for ensuring the renormalization include: a reference table containing, for each possible value of the lower boundary and the size, sequences of bits to be inserted into the output flow, and the number of unknown bits waiting to be inserted for this specific renormalization step; and elements for determining the address of the data, in this reference table.

Abstract: A data redundancy elimination system. In particular implementations, a method includes accessing a data block; dividing the data block into a plurality of data chunks; computing chunk signatures for the plurality of data chunks; identifying a plurality of anchor chunks in the plurality of data chunks; accessing a second memory to identify one or more matching chunk signatures; reading one or more signature blocks corresponding to the matching chunk signatures from a first memory into the signature block search space of the second memory; and matching one or more computed chunk signatures to chunk signatures of the one or more signature blocks in the signature block search space.

Abstract: An improved method for encoding and decoding data, such as in a base64 system, uses multiple look-up tables to perform the encoding function.

Abstract: A method and apparatus for encoding a set of integers is described. The largest power of two integer is determined based on a size of the set of integers with an integer encoder. A code table is constructed using the largest power of two integer. A uniform coding is constructed with values from the code table. A string “1” is prepended to each code from the code table. The string “1” is appended to a string “0” from the code table.

Abstract: A scalable audio data arithmetic decoding method, medium, and apparatus, and a method, medium, and apparatus truncating an audio data bitstream. The arithmetic decoding method of decoding a scalable arithmetic coded symbol may include arithmetic decoding of a symbol by using the symbol and a probability value for the symbol desired to be decoded, and determining whether or not to continue decoding by checking an ambiguity indicating whether or not decoding of the symbol to be decoded is completed. According to a method, medium, and apparatus of the present invention, data to which scalability is applied when arithmetic coding is performed in MPEG-4 scalable lossless audio coding can be efficiently decoded. Even when a bitstream is truncated, a decoding termination point can be known such that additional decoding of the truncated part can be performed.

Abstract: A system stores compressed literal symbols in a first data block and encoded literal symbols in a second data block. The compressed literal symbols correspond to a first group of literal symbols and the encoded literal symbols correspond to a second group of literal symbols. Each of the second group of literal symbols occurs subsequently in a symbol stream to a literal symbol with the same value in the first group of literal symbols.

Abstract: A data stream of a code string is divided into a series of a group of blocks. The first block of the group of blocks is compressed by a sliding dictionary method with codes of the first block as a reference dictionary. Blocks subsequent to the first block are recognized in succession as a target block to be compressed. Each time the target block is recognized, the target block is compressed by the sliding dictionary method with codes of the target block and results of compression of a group of blocks prior to the target block as a reference dictionary, and a result of compression of the target block is arranged at an end of the results of compression of the group of prior blocks.

Abstract: An apparatus for processing variable length coded data includes a coefficient buffer unit and several lookup tables. The coefficient buffer unit includes a coefficient memory and an index register for storing an indication of a non-zero nature of coefficients stored in the coefficient memory. Advantageously, the lookup tables may be altered to adapt the apparatus for processing variable length coded data to handle encoding or decoding video adhering to a specific standard. Furthermore, the lookup tables may be adapted to accelerate the determination of the presence of escape codes and the subsequent handling of the escape codes.

Abstract: A method and system are provided for encoding a plurality of integers with variable-length code tables constructed by combining a plurality of structured code tables. Each code table has an associated set of integer values; the sets are disjoint and exhaustive, so that every integer appears in exactly one set. An integer is encoded using the codebook associated with the set in which the integer appears.