Abstract: A method for accelerating codeset conversion in a computing environment is provided. The method may include, among other things, receiving one or more requests for codeset conversion. The one or more requests may be received, for example, from a client over a communications network. A change in the one or more requests for codeset conversion may be detected. In response to detecting the change, a subset of codeset converters may be selected from among a library of codeset converters to be included in a codeset conversion accelerator. The codeset conversion accelerator may be, among other things, reprogrammed with selected subset of codeset converters. The one or more received requests may be subsequently rerouted to the reprogrammed codeset conversion accelerator.

Abstract: Methods, apparatus, and other embodiments associated with doubly distributing erasure encoded data in a data storage system are described. One example apparatus includes a set of data storage devices and a set of logics that includes an encoding logic that generates an erasure encoded object that includes code-words, and chunks the code-words into code-word chunks, and a distribution logic that interleaves members of the set of code-word chunks into a plurality of records, and distributes the records across the data storage devices and within individual data storage devices. Example apparatus may include a read logic that reads the plurality of stored records from the data storage devices, and ignores read errors, and a repair logic that monitors the set of data storage devices, replaces or repairs failing data storage devices, generates replacement records, and stores the replacement records on a replacement data storage device.

Abstract: Methods, systems, and computer program products for compressing a row are described. A common prefix may be obtained and data in the row matching the common prefix may be identified. A column number of a column corresponding to a breakpoint of the common prefix may be determined and data matching the common prefix may be deleted from the row. An identifier of the common prefix may be inserted into the row and a breakpoint field in the row may be set to the determined column number.

Abstract: An information processing apparatus receives a compressed file in which character string data with a first character code is compressed by a unit of character string including a single character or a plurality of characters. The information processing apparatus converts compression information included in the compressed file into converted compression information, the compression information mapping each of compressed character string data in the compressed file to each of corresponding unit of character string with the first character code, thereby the converted compression information mapping each of the compressed character string data in the compressed file to each of the corresponding unit of character string with a second character code. The information processing apparatus generates a converted compression file from the converted compression information and each of the compressed character string data.

Abstract: A system for data decompression may include a processor coupled to a remote memory having a remote dictionary stored thereon and coupled to a decompression logic having a local memory with a local dictionary. The processor may decompress data during execution by accessing the local dictionary, and if necessary, the remote dictionary.

Abstract: Data values can be entropy encoded, as part of a data compression process, according to a predetermined variable-length entropy coding scheme (e.g. based on exponential Golomb coding) such that they have ?1 prefix bits and ?0 suffix bits. A corresponding entropy decoding process can be performed, whereby the prefix bits are analysed to determine bit-boundaries between the received entropy encoded data values. The suffix bits and the determined bit-boundaries are used to decode the entropy encoded data values. In this way, multiple bit-boundaries can be found during the same clock cycle, e.g. by analysing the prefix bits in parallel decode units, thereby allowing for multiple entropy encoded data values (encoded using a variable-length coding scheme) to be decoded in the same clock cycle.

Abstract: A technique and apparatus to allow a determination of an MSAG-valid address by use of normalized house numbers included in address entries in an MSAG Address data store, to facilitate the simple match of an input civic/postal address against entries in a MSAG data store based on the use of a normalization of the house numbers. The house number normalization allows for an easy lexicographical determination as to whether or not the input civic/postal house number falls with the range of house numbers in the MSAG data store. The inventive process and apparatus pre-stores normalized house number fields in an MSAG address data store, and then normalizes house numbers in a civic/postal address associated with an emergency call. The normalized numbers in the input civic/postal address associated with the emergency call are then lexicographically matched with normalized entries in an MSAG address data store.

Abstract: The disclosed embodiments relate to a data storage system that facilitates efficiently recovering from storage device failures. Upon receiving a request to retrieve a data block from the data storage system, the system uses a hash that identifies the data block to look up a bucket and an associated cell containing the data block. Note that the bucket aggregates a large number of data blocks and is located in the associated cell that comprises a set of object storage devices (OSDs). Within the cell, the system uses the bucket to look up an OSD that contains the bucket in a local bucket database (BDB) for the cell. Within the OSD, the system uses the bucket and the hash to look up an offset and a length for the data block in a write-ahead log that stores data blocks for the bucket. Finally, the system returns the data block from the determined offset.

Abstract: In an example, aspects of this disclosure relate to a method of coding data that includes coding a sequence of bins according to a context adaptive entropy coding process. A current coding cycle used to code at least one bin of the sequence of bins includes determining a context for the bin; selecting a probability model based on the context, wherein the probability model is updated based on a value of a previous bin coded with the context and coded at least two coding cycles prior to the current coding cycle; applying the probability model to code the bin; and updating the probability model based on a value of the bin.

Abstract: A hardware accelerator receives a request to decompress a data stream that includes multiple deflate blocks and multiple deflate elements compressed according to block-specific compression configuration information. The hardware accelerator identifies a commit point that is based upon an interruption of a first decompression session of the data stream and corresponds to one of the deflate blocks. As such, the hardware accelerator configures a decompression engine based upon the corresponding deflate block's configuration information and, in turn, recommences decompression of the data stream at an input bit location corresponding to the commit point.

Abstract: A method for transmitting and receiving a signal and an apparatus for transmitting and receiving a signal are disclosed. The method includes receiving the signal from a first frequency band in a single frame including at least one frequency band, demodulating the received signal by an orthogonal frequency division multiplexing (OFDM) method and parsing the signal frame, acquiring a symbol stream of a service stream from the at least one frequency band included in the parsed signal frame, demapping symbols included in the symbol stream and outputting the demapped symbols to sub streams, multiplexing the output sub streams and outputting one bit stream, and deinterleaving and error-correction-decoding the output bit stream.

Abstract: According to embodiments of the present invention, machines, systems, methods and computer program products for hierarchical compression of data are presented comprising creating a compression hierarchy of compression nodes, wherein each compression node is associated with a compression operation to produce compressed data. An output of any of the compression nodes may be compressed by another compression node or the same compression node. A path of one or more compression nodes is determined through said compression hierarchy based upon compression statistics to compress data, and the data is compressed by the compression nodes of the path. Various computational techniques are presented herein for manipulating the compression hierarchy to defer or reduce computation during query evaluation.

Abstract: A multi-component control technique includes a first component and a second component. The first component is supplemental code or evaluation engine as specified by a modification to a set of received originally compiled executable code. The modification to the original executable code ensures that, upon execution, the supplemental code (such as an evaluation engine) as specified by the modification is executed upon initial instantiation or use of the application. The second component is a retrievable and executable policy such as a set of rules fetched and used by the supplemental code to control the functionality supported by the originally compiled executable code of the corresponding application. An application administrator can produce the retrievable policy to control functionality of the originally compiled executable code.

Abstract: The present invention relates to a method for discovering neighbor cells (NC) in a radio cellular network (NTW) comprising cells, each served by a controller (eNB), the method comprising, with respect to a controller (eNB) serving a cell (C): (a): selecting a frequency (f) in a frequency list, each frequency being associated with a priority (Prio), a target value (TV) and a counter (Count), and wherein said frequency (f) is selected in the frequency list according to its priority (Prio); (b): selecting a terminal (UE) located in the cell (C) and connected with the controller (eNB); (c): sending a control message to the selected terminal (UE), said control message comprising a request to perform radio measurements relating to neighbor cells (NC) of the cell (C), for the selected frequency (f); (d): incrementing the counter (Count) associated with the frequency (f); (e): if the counter (Count) is equal to the target value (TV) for the selected frequency (f), then deleting the selected frequency (f) from the fre

Abstract: Data compression systems, methods, and computer program products are disclosed. For each successive input word of an input stream, it is determined whether the input word matches an entry in a lookback table. The lookback table is updated in response to the input word. Input words may be of a number of data types, including zero runs and full or partial matches with an entry in the lookback table. A codeword is generated by entropy encoding a data type corresponding to the input word. The lookback table may be indexed by the position of the input word in the input stream.

Abstract: A social networking system may provide user metrics for unknown dimensions to an external system using received hash codes from user devices performing actions on the external system. Embodiments of the invention receive hash codes generated by external systems that are embedded in redirect Uniform Resource Locators (URLs) that are executed by user devices. The social networking system may match the received hash codes to identifying information about users, e.g., user identifiers. The user profile information may be reported to external systems based on hash codes in an aggregated format without disclosing identifying information about users. In one embodiment, a hash code may include identifying information of an administrator of an external system to enable the administrator to merge information about users of the social networking system with other unknown dimensions of information about the users that is known by the external system.

Abstract: Embodiments include systems and methods for applying a controllable early/late offset to an at-rate clock data recovery (CDR) system. Some embodiments operate in context of a CDR circuit of a serializer/deserializer (SERDES). For example, slope asymmetry around the first precursor of the channel pulse response for the SERDES can tend to skew at-rate CDR determinations of whether to advance or retard clocking. Accordingly, embodiments use asymmetric voting thresholds for generating each of the advance and retard signals in an attempt to de-skew the voting results and effectively tune the CDR to a position either earlier or later than the first precursor zero crossing (i.e., h(?1)=0) position. This can improve link margin and data recovery, particularly for long data channels and/or at higher data rates.

Abstract: Disclosed is an integrated circuit including a memory device including a first portion and a second portion. The first portion is a first type of content addressable memory (CAM) with a first set of cells and the second portion is a second type of CAM with a second set of cells. The first set of cells is smaller than the second set of cells. The integrated circuit further includes a decompression accelerator coupled to the memory device, the decompression accelerator to generate a plurality of length codes. Each of the plurality of length codes include at least one bit. The plurality of length codes are generated using a symbol received from an encoded data stream that includes a plurality of symbols. The decompression accelerator further to store the plurality of length codes in the first portion of the memory device in an order according to their respective number of bits.

Abstract: A dictionary-based compression method is disclosed and includes the following steps receiving digital data which include a plurality of data blocks; compressing the digital data according to a multilayer dictionary-based compression algorithm which includes a first, a second and a third dictionary-based compression algorithms. The first, second and third dictionary-based compression algorithms execute compression by a unit range of N data blocks, a unit range of M data blocks and a unit range of L data block(s) respectively, in which N, M, L are integers not greater than the number of the total data blocks. N is greater than M, and M is greater than L.

Abstract: Methods and apparatuses relating to an instruction to decode encoded information of a compression scheme are described. In one embodiment, a processor includes a decode unit to decode an instruction, and an execution unit to execute the instruction, the execution unit including a state machine and content addressable memory (CAM) circuitry, the state machine to receive a pointer to a stream of encoded information of a compression scheme, fetch a section of the encoded information, and apply the section of the encoded information to the CAM circuitry to obtain decoded information.

Abstract: Disclosed is an integrated circuit having a decompression block. The decompression block is configured as a pipeline that may include a length module and a distance module. The length module evaluates a length for each symbol. The distance module may resolve distances in an at least one length-distance pair. The length module may include a shifter stage configured to store two consecutive words, and control a sliding window of symbols, in order to extract literals or distances. The length module may include a mapper stage configured to map the literals or distances to positions in the output stream. The distance module may include a pointer replacement stage and a resolution stage. The pointer replacement stage configured to replace distances, represented as pointers within an output word, with either literals or other pointers to prior words. The resolution stage configured to replace the other pointers with literals, and output the literals.

Abstract: A method for protecting a volatile memory against a virus, wherein: rights of writing, reading, or execution are assigned to certain areas of the memory; and a first list of opcodes for which the access to the areas is authorized or forbidden is associated with each of these areas.

Abstract: Embodiments of the present invention provide systems, methods, and computer storage media directed to hosting a plurality of copies of a digital content. A common component and one or more individual components from one or more copies of the digital content are generated. As such, the common component and the one or more individual components are stored, such that each individual component in conjunction with the common component represents a separate copy of the digital content. In some implementations, a compression ratio may be customized for determining the sizing of the common component and individual component.

Abstract: A network node is provided, including a device, in particular, an error detection logic, which is deactivated if it is detected that a signal according to a first protocol or a first version of a first protocol is received, and which is not deactivated if it is detected that a signal according to a second, different protocol or a second, different version of the first protocol is received.

Abstract: A method and system are disclosed for managing cache memory in a dual-pipelined CABAC encoder. A request for a context model is received from both encoder pipelines. If the requested context model is not stored in cache, the requested context model is retrieved from a context table. At least one context model stored in cache is written to the context table. The retrieved context model is updated and written to the cache. If the requested context model is stored in cache, and if the requested context model was updated in the previous clock cycle, the requested context model is retrieved from the pipeline, updated, and written to cache. If the requested context model is not stored in cache, and if the requested contest model was not updated in the previous clock cycle, the requested context model retrieved from cache, updated, and written back to cache.

Abstract: A run length limit encoder includes a subdivided threshold lookup table to encode data using multi-level enumeration.

Abstract: A data processing apparatus that is capable of reducing the garbling of characters caused by the difference among the character codes when setting data are transferred to another apparatus by the import-export function. A storage unit stores setting data for the data processing apparatus. A receiving unit receives an instruction for exporting the setting data stored in the storage unit. A converting unit converts Unicode data included in the setting data into character code data of language, which is set to the data processing apparatus. An export unit exports the character code data converted by the converting unit and the Unicode data.

Abstract: Data compression using a combination of content independent data compression and content dependent data compression. In one aspect, a system for compressing data comprises: a processor, and a plurality of data compression encoders wherein at least one data encoder utilizes asymmetric data compression. The processor is configured to determine one or more parameters, attributes, or values of the data within at least a portion of a data block containing either video or audio data, to select one or more data compression encoders from the plurality of data compression encoders based upon the determined one or more parameters, attributes, or values of the data and a throughput of a communications channel, and to perform data compression with the selected one or more data compression encoders on at least the portion of the data block.

Abstract: Techniques for a precoding scheme for wireless communications are described. A method and apparatus may comprise a first device for a communications system to determine a beamforming structure for a closed loop transmit beamforming scheme using channel information, one or more scaling factors and one or more integers to represent a complex vector. The beamforming structure may include a codeword, a codebook and a codeword index. Other embodiments are described and claimed.

Abstract: A wireless communication system includes at least one transmit node having at least two transmit antenna ports, and at least one receive node having at least one receive antenna port. User information is transmitted between the at least two transmit antenna ports and the at least one receive antenna port on a radio propagation channel. A reconstructed channel state information (R-CSI) for a reconstructed radio propagation channel is computed. The reconstructed radio propagation channel is obtained as an estimated radio propagation channel compensated by a function of an estimated signal power imbalance between the at least two transmit antenna ports. And an indicative of the estimated signal power imbalance and the R-CSI is sent to the at least one transmit node.

Abstract: A wireless device, including: an antenna configured to receive a reception signal, a processor configured to convert the reception signal into a first signal that includes a product of an upper triangular matrix and a transmission signal, to detect a first region, to which the first signal belongs, on an IQ plane, a memory configured to store a symbol ranking table that stores symbol candidates in an order of shorter distance from a region center, up to an order that is equal to a rank upper limit value that is set to be lower than a modulation multi-level number of the transmission signal, wherein the processor is further configured to select a first symbol candidate based on the first region and the symbol ranking table.

Abstract: Provided is a method for compressing and decompressing I/Q sample data in a cloud radio access network (CRAN) that uses a fixed compression ratio and also determines a bit to be removed according a magnitude of an absolute value of the I/Q sample data when the I/Q sample data transmitted and received between a digital unit (DU) and an radio unit (RU) in the CRAN is compressed and decompressed. A method for compressing I/Q sample data in the CRAN includes: calculating absolute values of all sample data in each unit block, the unit block being a basic unit of compression; determining an SMAX, the SMAX being sample data having a maximum of the absolute values; extracting sample data by a predetermined number of bits; coding information about the number of bits removed from high-order or low-order bits; and adding a sign bit before or after coding the information.

Abstract: According to one embodiment, method for decoding encoded data comprises a hardware module including circuitry to process a data stream. The data stream includes one or more encoded symbols each including a code assigned to a corresponding symbol. A set of least frequently occurring symbols are assigned a common code to encode those symbols within the data stream. Data blocks are generated each containing a data stream portion. One or more encoded symbols within each data block are identified by comparing data block portions to maximum code values for corresponding code lengths to determine a code length for each data block portion. A starting location for the identified encoded symbols within each data block is determined based on the determined code lengths.

Abstract: A multilevel amplitude modulation device for generating, from digital data, a multilevel amplitude modulation signal having four or more signal levels and outputting the generated signal, including: an average level calculator that selects one of a plurality of preliminarily prepared different candidates for a code word building method such that average level of a symbol array, obtained by adding a symbol for a code word of digital data to be transmitted to one or more already outputted symbols included in a multilevel amplitude modulation signal already outputted, is most approximate to voltage center of the four or more signal levels, and outputs a selection signal indicating the selected method; a signal converter that forms a codeword of the digital data in accordance with the method indicated by the selection signal; and a multilevel modulator that generates a multilevel amplitude modulation signal using the codeword and outputs the generated signal.

Abstract: A system, method and computer program product having optimal matching to a known or measured probability distribution encodes data without the use of an excessively large lookup table. An encoder constructed according to the present invention uses two or more different encoding methods in combination. In one embodiment, Huffman coding by table lookup is combined with computational generation, such as by using an exponential Golomb equation. The most commonly occurring elements are looked up in a small Huffman table, while the remaining elements are coded with the equation. In another embodiment, data is encoded using two or more equations. In yet another embodiment, data is encoded using multiple tables in conjunction with one or more equations.

Abstract: An image coding apparatus provides a run-length encoding unit RLE1 that subjects quantized coefficients 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 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 selected according to the number of already-processed run values.

Abstract: A method for compressing information by a computerized system, the method may include receiving a mixture of DNA data and additional information; and compressing the DNA data to provide compressed DNA data, wherein the compressing comprises encoding the DNA data by using a predefined codeword dictionary that was constructed based upon reference DNA data.

Abstract: Embodiments relate to data compression using dictionary encoding. An aspect includes subdividing a table of uncompressed data into a first block and a second block of complete rows. Another aspect includes determining information about a frequency of occurrence of different values for each column of the first block. Another aspect includes selecting a row of the first block to be removed out of the first block using frequency of occurrence-information. Another aspect includes removing the a row out of the first block to form an updated first block and determining information about a frequency of occurrence of different values for each column of the updated first block. Another aspect includes deriving a dictionary containing code-words for encoding the values of the updated first block. Another aspect includes encoding the values of the updated first block based on the code-words. Another aspect includes adding the removed row to the second block.

Abstract: Speech recognition of even a speaker who uses a speech recognition system is enabled by using an extended recognition dictionary suited to the speaker without requiring any previous learning using an utterance label corresponding to the speech of the speaker.

Abstract: The present invention concerns a method and device for coding a structured document comprising events to be coded having values. A particular, non-exclusive, application of the present invention is the coding of the XML document as a file of the EXI type. The method comprises the following steps: running through the document in order to process events; forming channels of values containing values of events according to at least one criterion; coding the channels of values thus formed by coding the event values of each of these channels of values by means of at least one coding dictionary; method wherein the formation device comprises, for each event to be coded and run through having a value, the association of this value to be coded with one of said channels by reference, in said channel, to an entry in the coding dictionary.

Abstract: Method, apparatus, and systems employing novel delayed dictionary update schemes for dictionary-based high-bandwidth lossless compression. A pair of dictionaries having entries that are synchronized and encoded to support compression and decompression operations are implemented via logic at a compressor and decompressor. The compressor/decompressor logic operatives in a cooperative manner, including implementing the same dictionary update schemes, resulting in the data in the respective dictionaries being synchronized. The dictionaries are also configured with replaceable entries, and replacement policies are implemented based on matching bytes of data within sets of data being transferred over the link. Various schemes are disclosed for entry replacement, as well as a delayed dictionary update technique. The techniques support line-speed compression and decompression using parallel operations resulting in substantially no latency overhead.

Abstract: A compression method applies a selection rule to input symbols and generates a reduced partial set of symbols. The partial set is checked against a dictionary-index for a match. A match identifies a range of matching symbols in a dictionary. The length of the matching range is iteratively increased by checking previous and next symbols in the input data and the dictionary until a matching range length meets a threshold limit or the length of the matching range cannot be increased further. Compressed data corresponding to the input symbols is provided where input symbols are copied over and symbols in a matched range of data are replaced with a representation of their corresponding start location and length in the dictionary.

Abstract: A system and method for compressing and decompressing multiple types of character data. The system and method employ multiple encoding tables, each designed for encoding a subset of character data, such as numeric data, uppercase letters, lowercase letters, Latin, or UNICODE data, to perform compressions and decompression of character data, and. The compression solution also provides for the creation of new encoding tables on the fly, and accommodates the compression of lengthy character streams using multiple different general compression algorithms, automatically choosing a suitable general compression algorithm for specific input data.

Abstract: A method for compressing information by a computerized system, the method may include receiving a mixture of DNA data and additional information; and compressing the DNA data to provide compressed DNA data, wherein the compressing comprises encoding the DNA data by using a predefined codeword dictionary that was constructed based upon reference DNA data.

Abstract: A transmitter may map, using a selected modulation constellation, each of C? bit sequences to a respective one of C? symbols, where C? is a number greater than one. The transmitter may process the C? symbols to generate C? inter-carrier correlated virtual subcarrier values. The transmitter may decimate the C? virtual subcarrier values down to C physical subcarrier values, C being a number less than C?. The transmitter may transmit the C physical subcarrier values on C orthogonal frequency division multiplexed (OFDM) subcarriers. The modulation constellation may be an N-QAM constellation, where N is an integer. The processing may comprise filtering the C? symbols using an array of C? filter tap coefficients. The filtering may comprise cyclic filtering. The filtering may comprise multiplication by a circulant matrix populated with the C? filter tap coefficients.

Abstract: A system and method combine an entropy coding algorithm like Huffman or arithmetic coding with a fixed length coding scheme and can improve the compression performance in a fixed rate compression scheme. The fixed length code assigns codes with a fixed length to symbols that have the highest probability of occurrence. Therefore, fixed length coding is used if all symbols in the sequence are from the set of symbols that have the highest probability values. Otherwise an entropy coding algorithm (e.g. Huffman coding) is used to encode quantized symbols.

Abstract: An entropy decoding apparatus may include a data structure stored in memory. The data structure may include a decoding engine vector or context engine vector. The decoding engine vector many have a first set of bits representing a value corresponding to a state of a coding engine, a second set of bits representing an offset value, and a third set of bits representing the contents of an input stream buffer. The context vector may have a first set of bits representing an addresses of a context most probable state, a second set of bits representing a plurality of possible values corresponding to a least probable symbol state of a coding engine, a third set of bits representing an addresses of a context least probable state, a fourth set of bits representing a binary most probable symbol value, and a fifth set of bits representing a binary least probable symbol value.

Abstract: A format converter includes a first input buffer for storing input data, an output buffer for storing output data, a converter connected between the first input buffer and the output buffer, and a register that the converter refers to. The register allows plural kinds of conversion patterns to be defined in conformity with a desired data format conversion. The converter generates the output data based on the input data, in accordance with the conversion pattern defined in the register.

Abstract: A decoding method for unary/kth order exponential Golomb (UEGk) codes is provided. The first step is a receiving step: receiving N bits from an input stream and updating a bit count. If the N bits are all one, the receiving step is re-performed. If the N bits includes zero, a searching step is performed to find a first value based on the bit count. Subsequently, according to the bit count and a threshold value, a remaining bit number M is calculated. A second value is generated based on M remaining bits received from the input stream. Then, the first value and the second value are added, so as to generate an index.

Abstract: System and method for encoding, transmitting and decoding audio data. Audio bit steam syntax is re-organized to allow system optimizations that work well with memory latency and memory burst operations. Multiple small entropy coding tables are stored in RAM and loaded to on-chip memory as needed. Audio prediction is pipelined in the bitstream syntax. Intra frames, independent of other frames in the bitstream, are included in the bitstream for error recovery and channel change. New algorithms are implemented in legacy syntax by including the new information in the user data space of the audio frame. The new decoder can use projection to determine where the new information is and read ahead in the stream. Audio prediction from the immediately previous frame is restricted. Audio prediction is performed across channels within a single audio frame. A variable re-order function comprises storing channels of data to DRAM in the order they are decoded and reading them out in presentation order.