Abstract: A digital information encoder including a divider configured to divide a block of information into a plurality of sub-parts, an initial bit allocator configured to perform an initial allocation of bits to a KTH sub-part of said plurality of sub-parts, a processor configured to compute an estimated number of bits for encoding said KTH sub-part, and a bit allocation adjuster configured to obtain an adjusted bit allocation for said KTH sub-part by adjusting said initial allocation of bits to said KTH sub-part based, at least in part, on said estimated number of bits, wherein the encoder encodes said KTH sub-part using said adjusted bit allocation for said KTH sub-part.

Abstract: System, computer program product, and computer-implemented method to improve a running disparity of an encoded bit stream in a distributed network switch, the distributed network switch comprising a plurality of switch modules including a first switch module, by receiving, at the first switch module, a raw data stream comprising a plurality of bits, receiving a bit sequence, encoding at least a first bit of the raw data stream using a corresponding at least a first bit of the bit sequence, transmitting the encoded first bit, inverting the first bit of the bit sequence, and encoding a second bit of the raw data stream using the inverted first bit.

Abstract: A turbo encoder apparatus includes: a first element encoder for receiving an input of a bitstream of the data, encoding the input of the bitstream of the data, and generating a first output bitstream in an unit of plural bits; an internal interleaver for generating an interleaved input bitstream from the bitstream of the data; a second element encoder for receiving an input of the interleaved input bitstream in the unit of plural bits, encoding the input of the interleaved input bitstream, and generating a second output bitstream in an unit of plural bits; a trellis-termination-encoder for generating bits for trellis terminations of the first element encoder and the second element encoder; and a bitstream assembler for receiving the first output bitstream, the second output bitstream, and the bits for the trellis terminations and generating an input bitstream for a rate matching.

Abstract: Methods and devices are provided for data compression. Data compression can include receiving a plurality of data chunks, sampling at least some of the plurality of data chunks extracting a common portion from a number of the plurality of data chunks based on the sampling, and storing a remainder of the plurality of data chunks in memory.

Abstract: A coding method, a decoding method, a coder, and a decoder are disclosed herein. A coding method includes: obtaining the pulse distribution, on a track, of the pulses to be encoded on the track; determining a distribution identifier for identifying the pulse distribution according to the pulse distribution; and generating a coding index that includes the distribution identifier. A decoding method includes: receiving a coding index; obtaining a distribution identifier from the coding index, wherein the distribution identifier is configured to identify the pulse distribution, on a track, of the pulses to be encoded on the track; determining the pulse distribution, on a track, of all the pulses to be encoded on the track according to the distribution identifier; and reconstructing the pulse order on the track according to the pulse distribution.

Abstract: A method for managing information includes receiving bits of data, determining phasors for bits at only one frequency of a transmission spectrum, combining the phasors of bits that form a phasor having a spectral energy that lies within a predetermined range, and forming a codeword from the bits of the combined phasors.

Abstract: A binary allocation in a hierarchical coding/decoding comprising a coding/decoding of a digital signal enhancement layer. The signal comprises a succession of L samples, each sample being represented by a mantissa and an exponent. The method comprises the allocation of a predetermined number Nb of enhancement bits to a part at least of the L samples of highest exponent values. In particular, the method comprises the steps: a) enumerating the exponents of the L samples each having a given value, b) calculating at least one aggregate of enumerations of exponents by decreasing values of exponent until the predetermined number Nb is approximated from above, for c) determining a threshold value of largest exponent iexp0 of sample for which no more enhancement bit is available, and allocating the Nb enhancement bits, according to chosen rules, to the samples whose exponent is greater than the aforesaid threshold value iexpo.

Abstract: Example systems and methods concern a sub-block parser that is configured with a variable sized window whose size varies as a function of the actual or expected entropy of data to be parsed by the sub-block parser. Example systems and methods also concern a sub-block parser configured to compress a data sequence to be parsed before parsing the data sequence. One example method facilitates either actually changing the window size or effectively changing the window size by manipulating the data before it is parsed. The example method includes selectively reconfiguring a data set to be parsed by a data-dependent parser based, at least in part, on the entropy level of the data set, selectively reconfiguring the data-dependent parser, based, at least in part, on the entropy level of the data set, and parsing the data set.

Abstract: Electronic logic gates that operate using N logic state levels, where N is greater than 2, and methods of operating such gates. The electronic logic gates operate according to truth tables. At least two input signals each having a logic state that can range over more than two logic states are provided to the logic gates. The logic gates each provide an output signal that can have one of N logic states. Examples of gates described include NAND/NAND gates having two inputs A and B and NAND/NAND gates having three inputs A, B, and C, where A, B and C can take any of four logic states. Systems using such gates are described, and their operation illustrated. Optical logic gates that operate using N logic state levels are also described.

Abstract: Methods and devices for encoding and decoding that involve sorting bins according to their respective estimated probabilities to form subsequences, each subsequence having an associated estimated probability. Subsequences are encoded to form codewords. Ordered sets of phrases of known length are then formed from the codewords. Each first of the phrases in a set contains at least part of one codeword. The first phrase has an associated estimated probability and the probability estimates associated with each of the other phrases in the set are determined based upon the probability estimate associated with the first phrase, which permits the phrases to be decoded in parallel.

Abstract: A semiconductor memory device includes a plurality of detecting code generators configured to generate a plurality of detecting codes to detect errors in a plurality of data items, respectively, a plurality of first correcting code generators configured to generate a plurality of first correcting codes to correct errors in a plurality of first data blocks, respectively, each of the first data blocks containing one of the data items and a corresponding detecting code, a second correcting code generators configured to generate a second correcting code to correct errors in a second data block, the second data block containing the first data blocks, and a semiconductor memory configured to nonvolatilely store the second data block, the first correcting codes, and the second correcting code.

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: A data predicted value generating unit generates a predicted value (data predicted value) for original data intended to be encoded, based on a history of original data which is floating-point data. A data predicted value modifying unit adjusts a mantissa value of the data predicted value by aligning an exponent value of the data predicted value with an exponent value of the original data. A first residual generating unit generates a residual (first residual) between new original data and the data predicted value after being adjusted. A first residual predicted value generating unit generates a predicted value for the first residual (first residual predicted value), based on a history of first residuals. A second residual generating unit generates a residual (second residual) between the first residual and the first residual predicted value. A residual encoding unit generates encoded data by encoding the second residual.

Abstract: A system comprising an encoder for receiving a binary string of a data, the encoder adapted to partition the binary string into one or more binary substrings and assign a color to each one or more substring corresponding to a color model, a frequency controller for converting the color into electrical pulses corresponding to a predetermined frequency, and at least one antenna for emitting the electrical pulses as pulses as frequencies through a communication channel. The system may further comprise a parallel decoder. The system further comprises at least a processor, memory, and a data compression component for compressing data to output a compressed binary string of data to be transmitted by the encoder or decoder or both.

Abstract: Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for encoding and decoding information. In one aspect, methods of encoding information in an encoder include receiving a signal representing information using a collection of discrete digits, converting, by an encoder, the received signal into a time-based code, and outputting the time-based code. The time-based code is divided into time intervals. Each of the time intervals of the time-based code corresponds to a digit in the received signal. Each digit of a first state of the received signal is expressed as an event occurring at a first time within the corresponding time interval of the time-based code. Each digit of a second state of the received signal is expressed as an event occurring at a second time within the corresponding time intervals of the time-based code, the first time is distinguishable from the second time.

Abstract: Provided are a computer program product, system, method, and data structure for using variable length code tables to compress an input data stream to a compressed output data stream. If a number of consecutive data units in the input data stream match the number of consecutive data units in a history buffer of previously received data units in the input data stream, a copy pointer symbol is generated indicating the copy pointer symbol referencing previously received data units in the history buffer and indicating a location of a start of the consecutive data units in the history buffer. A determination is made of an encoding of the number. Indication is made in the generated copy pointer symbol the determined encoding of the number and the copy pointer symbol is outputted in the compressed output data stream.

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: This disclosure relates to synchronizing dictionaries of acceleration nodes in a computer network. For example, dictionaries of a plurality of acceleration nodes of a client-server network can be synchronized to each include one or more identical data items and data identifier pairs. Synchronization can include transmitting a particular data item, or a combination of a data item and an associated data identifier, to another acceleration node which includes it in its dictionary. A particular acceleration node can, instead of transmitting a data item, transmit an associated data identifier to another acceleration node. As all (or a subset) of the acceleration nodes can have an identical dictionary when employing the methods described herein, the particular acceleration node can use the same dictionary to communicate with all (or the subset of) other acceleration nodes of the computer network.

Abstract: A representation of a codeword is decoded by applying a first decoder of the codeword to the representation of the codeword. If applying the first decoder fails to decode the representation of the codeword then a second decoder of the codeword is applied to the representation of the codeword. Preferably, applying the first decoder consumes less power and is faster than applying the second decoder. Data are ported by encoding the data as a codeword, exporting the codeword to a corrupting medium, importing a representation of the codeword, and applying a first decoder to the representation of the codeword. If applying the first decoder fails to decode the representation of the codeword then a second decoder of the codeword is applied to the representation of the codeword.

Abstract: To obtain greater transcoding efficiency, a node administrator (160) distributes digital files among transcoding nodes (120, 140 and 190) based on a comparison of a transcoding profile for each digital file and the transcoding histories of the transcoding nodes. In this way, the node administrator (160) will select the transcoding node best able to undertake transcoding, taking into account the characteristics of the file to be transcoded.

Abstract: An approach is provided in which in which a decoder pipeline receives a data stream that includes a stream of deflate blocks. The decoder pipeline decodes an end of block symbol included in one of the deflate blocks and identifies a recycle point in the data stream in response to decoding the end of block symbol. In turn, the decoder pipeline recycles pipeline data residing between the end of block symbol and the recycle point.

Abstract: Provided are a computer program product, system, method, and data structure for compressing an input data stream. A determination is made of consecutive data units in the input data stream that match consecutive data units in a history buffer. A copy pointer symbol indicates a copy pointer symbol referencing previously received data units in the history buffer. A determination is made of a relative displacement count in the history buffer at which the number of matching consecutive data units start. A determination is made of a range of relative displacement counts comprising one of a plurality of ranges of displacement counts including the determined relative displacement count. A determination is made of the encoding scheme associated with the determined range. An encoding of the relative displacement count is determined from the determined encoding scheme. The determined encoding of the relative displacement count is indicated in the copy pointer.

Abstract: Data compression using a combination, of content independent data compression and content dependent data compression. In one aspect, a method for compressing data comprises: determining whether or not a parameter or attribute of data within a data block is identified for the data block wherein the determining is not based solely on a descriptor that is indicative of the parameter or attribute of the data within the data block; and compressing the data block with at least one encoder associated with the parameter or attribute of the data within the data block to provide a compressed data block.

Abstract: A video coding device includes a buffer simulation unit that calculates an occupation amount of a virtual buffer to be used for controlling a coding amount, by using, for each picture, (a) a code length of a code that is an intermediate result of compression coding and (b) a code length of a compressed code that is a final result of the compression coding. This means that, for a picture that has not yet processed by an arithmetic coding unit, an occupation amount of the virtual buffer is calculated by using a code length of codes provided from a binarization unit.

Abstract: In an embodiment, a data encoding method may be provided. The data encoding method may include: inputting data to be encoded; determining a polynomial so that an evaluation of the polynomial at a sum of a first supporting point of the polynomial and a second supporting point of the polynomial corresponds to the sum of an evaluation of the polynomial at the first supporting point and an evaluation of the polynomial at the second supporting point, wherein coefficients of the polynomial are determined based on the data to be encoded; and generating a plurality of encoded data items by evaluating the polynomial at a plurality of supporting points.

Abstract: An audio encoder for encoding segments of coefficients, the segments of coefficients representing different time or frequency resolutions of a sampled audio signal, the audio encoder including a processor for deriving a coding context for a currently encoded coefficient of a current segment based on a previously encoded coefficient of a previous segment, the previously encoded coefficient representing a different time or frequency resolution than the currently encoded coefficient. The audio encoder further includes an entropy encoder for entropy encoding the current coefficient based on the coding context to obtain an encoded audio stream.

Abstract: Methods and apparatus intelligently switching between line coding schemes based on context. In one exemplary embodiment, an High Definition Multimedia Interface (HDMI) system is configured to transmit control and video data according to an 8B/10B line coding protocol, and data island data according to TERC4 (TMDS (Transition Minimized Differential Signaling) Error Reduction Coding 4-bit). Various elements of the disclosed HDMI devices are configured to determine when a context switch occurs, and thereafter seamlessly transition between the appropriate line code protocol.

Abstract: Methods and apparatus are provided for Lempel-Ziv data compression with shortened hash chains based on repetitive multi-byte runs. Data is compressed by processing a sequence of data to identify a repetitive pattern, such as a multi-byte run; and providing indicators associated with the sequence of data of a start position and an end position of the repetitive pattern. The indicators of the start and end positions of the repetitive pattern may comprise, for example, flags associated with the positions. The indicators of the start and end positions of the repetitive pattern are processed to determine a sequence length of the repetitive pattern. In addition, a match can be identified in the sequence of data having a length that is greater than or equal to an offset of s bytes to identify a run comprised of an s-byte sequence.

Abstract: Provided are a meta data encoding/decoding method and apparatus. The meta data decoding method includes decoding a media signal containing a media object, and decoding meta data corresponding to the media object. During the decoding of the meta data signal, decoding of the meta data is skipped when the meta data that is to be decoded is identical to already decoded meta data.

Abstract: A signal processor for providing a processed version of an input signal in dependence on the input signal includes a windower configured to window a portion of the input signal, or of a pre-processed version thereof, in dependence on a signal processing window described by signal processing window values for a plurality of window value index values, in order to obtain the processed version of the input signal. The signal processor also includes a window provider for providing the signal processing window values for a plurality of window value index values in dependence on one or more window shape parameters.

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 computer-implemented method and apparatus are disclosed for decoding an encoded data signal. In one embodiment, the method includes accessing, in a memory, a set of signal elements. The encoded data signal is received at a computing device. The signal includes signal fragments each having a projection value and an index value. The projection value has been calculated as a function of at least one signal element of the set of signal elements and at least a portion of the data signal. The index value associates its respective signal fragment with the at least one signal element used to calculate the projection value. The computing device determines amplitude values based on the projection values in the signal fragments. The decoded signal is determined using the amplitude values and the signal elements associated with the at least some of the signal fragments.

Abstract: For encoding data for analysis acceleration, a method calculates a classification set for a data group of a data set including a plurality of entries. The classification set includes a finite plurality of classification values. Each classification value is associated with a bit position in a data binary string of a specified binary length. The method further encodes each data value of the data group for each entry with one of the plurality of classification values in a corresponding data binary string for the entry.

Abstract: According to one embodiment, a computer-implemented method of decompressing compressed data is described. A first decompression dictionary is analyzed, the first decompression dictionary including a plurality of chains each with uncompressed data portions distributed in a non-contiguous manner within the first decompression dictionary based on an addressing scheme, where the uncompressed data portions of each chain form a corresponding uncompressed version of compressed data. A second decompression dictionary is generated by combining the uncompressed data portions of each of the chains in the first decompression dictionary to form uncompressed versions of compressed data and instructions are inserted within the second decompression dictionary to decompress compressed data. The compressed data are decompressed by applying the compressed data to the second decompression dictionary.

Abstract: An encoding device, a decoding device, and related methods are provided that eliminate the loss of synchronization of the adaptive filters of a terminal at the encoding end and a terminal at the decoding end caused by transmission errors. Deterioration of the sound quality is suppressed when a multiple channel signal is encoded with high efficiency using an adaptive filter. In the terminal at the encoding end, a buffer stores updated filter coefficients. When packet loss detection information indicating whether there is any packet loss in the terminal at the decoding end indicates that there is packet loss, a switch outputs the past filter coefficients of the previous (NX+1) frames from the buffer to an adaptive filter. The adaptive filter uses the past filter coefficients of the previous (NX+1) frames to conduct filtering.

Abstract: A digital information encoder including a divider configured to divide a block of information into a plurality of sub-parts, an initial bit allocator configured to perform an initial allocation of bits to a KTH sub-part of said plurality of sub-parts, a processor configured to compute an estimated number of bits for encoding said KTH sub-part, and a bit allocation adjuster configured to obtain an adjusted bit allocation for said KTH sub-part by adjusting said initial allocation of bits to said KTH sub-part based, at least in part, on said estimated number of bits, wherein the encoder encodes said KTH sub-part using said adjusted bit allocation for said KTH sub-part.

Abstract: A method for wireless communication is disclosed that includes selecting a plurality of probabilities for a symbol based on a bit-to-symbol mapping; calculating a conditional mean of the symbol based on the plurality of probabilities; and, generating a signal representative of the symbol based on the conditional mean of the symbol. An apparatus for performing the method is also disclosed.

Abstract: The present disclosure discloses a method and device for identifying or converting data_coding, and a method and system for processing data_coding. By finding out a source data_coding adopted by information sent by a source account in communication protocols specified in the area to which it belongs and a target data_coding accepted and adopted by a target account based on preset data_coding information of a first account group and code conversion information of a second account group, the data_coding adopted by the sent information and the data_coding desired by the target account can be accurately determined, and a code conversion error is avoided. In addition, by pre-configuring code conversion information of each account and subsequently finding out the actually adopted data_coding based on finding mechanism, not only is the finding result accurate, but also the system is convenient to be extended and flexible to be configured.

Abstract: Aspects of the invention are provided for decoding a selected span of data within a compressed code stream. A selection of data within the compressed code stream from an arbitrary position is presented for decompression. The arbitrary position is the starting point in the compressed code stream for decompression, and a phrase within the compressed code stream containing the starting point is identified. From the arbitrary starting point, a back pointer may provide direction to the literal. The literal is extracted as a decoding of the compressed data associated with the starting point.

Abstract: A binary arithmetic coding scheme is extended by a functionality to encode and decode non-negative integer values with particular low computational complexity.

Abstract: A computer-implemented method of performing lossless compression of a digital data set uses an iterative compression process in which the number of symbols N and bit length per symbol n may vary on successive iterations. The process includes analyzing at least a part of the data set to establish a partition thereof into N symbols of symbol length n, and to determine whether the N symbols can be further compressed, and, if so, a model to be used in encoding the N symbols.

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 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: Generating and using a high-speed, scalable, and easily updateable data structure are described. The proposed 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: Methods and apparatus for compression of generalized sensor data are described. One example method for use in compression of generalized sensor data at a first location for transmission to a second location includes analyzing the sensor data to identify high interest data and low interest data, and compressing the high interest data with a lossless compression algorithm.

Abstract: The through metal communication system sends messages by tapping on metal barriers, such as pipelines, bulkheads, and the like. A robotic element attaches itself to a metal barrier, wall, pipe, and the like. A piezoelectric tapping device is attached to the robotic element and can tap an encoded message onto the metal. The robot preferably includes a piezoelectric actuator, a microcontroller to convert text/information to Morse code, and a power source for the actuator. The messages are retrieved and interpreted by a remote transducer connected to a computer or microcontroller.

Abstract: In an embodiment, a compression unit is provided which may perform compression of images with low latency and relatively little hardware. Similarly, a decompression unit may be provided which may decompress the images with low latency and hardware. In an embodiment, the transmission of compressed coefficients may be performed using less than two passes through the list of coefficients. During the first pass, the most significant coefficients may be transmitted and other significance groups may be identified as linked lists. The linked lists may then be traverse to send the other significance groups. In an embodiment, a color space conversion may be made to permit filtering of fewer color components than might be possible in the source color space.

Abstract: A data acquisition device incorporates a front end analog-to-digital converter (ADC), which is responsive to an applied analog input signal, sample that signal and provide digital data representative of the sampled signal. The digital data is applied to a data channel connected to a data acquisition memory, which stores data values representative of the sampled analog input signal. The digital data from the ADC is also applied to a real time a trigger channel connected to a composite function trigger equalizer and filter, a trigger processor and to a trigger memory. The trigger channel operates in real time to identify trigger events and store real-time trigger event occurrence signals in the trigger memory. A controller reads out the stored data values from the data acquisition memory by way of a data equalizer, in synchronism with corresponding real-time trigger event occurrence signals from the trigger memory.

Abstract: A decompression circuit for decompressing data includes a first decompression unit and a second decompression unit. The data sequentially includes a compressed first string, a compressed distance-length pair and a compressed second string. The first decompression unit performs a first decompression on the data to obtain a first string, a distance-length pair and a second string. The second decompression unit receives and decompresses the first string, the distance-length pair and the second string. The first decompression unit does not involve data associated with the distance-length pair when decompression the second string.

Abstract: A decompression circuit includes a first decompression unit and a second decompression unit. The first decompression unit performs a first decompression operation on data to generate first decompressed data. The first decompressed data includes a plurality of literals and a distance-length pair. The second decompression unit receives the first decompressed data, and sequentially performs a second decompression operation on the literals and the distance-length pair to generate second decompressed data. After the second decompression unit receives the distance-length pair from the first decompression unit and before the second decompression unit completes decompressing the distance-length pair, the second decompression unit transmits data required for the subsequent first decompression operation performed by the first decompression unit to the first decompression unit according to the distance-length pair.