Abstract: A decoding device includes an interface unit, a readout unit that reads out a file and recording medium management information from an external recording medium, a decoding unit that analyzes a read out file, a storage unit that stores file analysis information and recording medium management information, a determination unit that determines whether or not the recording medium management information pieces are the same when the external recording medium is connected to the interface unit, and a matching confirmation unit that, when the recording medium management information pieces are determined as being the same, determines whether or not the file contents match. When the determination results in a mismatch, the decoding unit generates new file analysis information and performs file decoding using the generated file analysis information, and when the determination results in a match, the decoding unit performs file decoding using the file analysis information in the storage unit.

Abstract: Embodiments of the present invention disclose a data decoding method and apparatus, relate to the field of wireless communications, and can improve a resource utilization rate in a decoding process, thereby improving decoding efficiency. The method of the present invention includes: dividing a to-be-decoded data transport block into N code blocks, where N is an integer greater than or equal to 2; and decoding the N code blocks in parallel according to a reverse direction of encoding. The present invention is applicable to data decoding.

Abstract: An aspect of the present invention provides for lossless compression of an input stream using variable width codes. In an embodiment, in each of a sequence of iterations, an output code is emitted (to an output stream) corresponding to a longest string from a present symbol based on entries in a dictionary. In each iteration, two entries are thereafter added to the dictionary, with the first entry associating (the longest string+symbol succeeding said longest string in said input stream) to a first available code in the dictionary, and a second entry associating a (previous token+symbol succeeding said previous token in said input stream) to a second available code in the dictionary, wherein the previous token represents the token of a first entry in a previous iteration, and wherein ‘+’ represents a text appending operation.

Abstract: A method implemented in a computer system may include reading a first set of data byte values, providing a reproducible first array that includes at least one of each data byte value in the first set, identifying in the first array a first contiguous pathway that defines a set of data byte values matching the first set, and creating a second set of command byte values representing the first contiguous pathway. The method may further include providing a reproducible second array that includes at least one of each command byte value in the second set, identifying in the second array a second contiguous pathway that defines a set of command byte values matching the second set, and creating a third set of command byte values representing the second contiguous pathway.

Abstract: An exemplary encoder device includes a data storage comprising an indication of a coordinate system and a set of symbols, each having at least one coordinate position in the coordinate system. A processor associated with the data storage is configured to encode at least one symbol within information comprising a plurality of symbols using the coordinate position of the at least one symbol relative to the coordinate position of another symbol within the information.

Abstract: A communication network comprises a communication medium and a plurality of nodes. Each node is configured to communicate with the other nodes using a protocol that has at least one of an idle period or a preamble period. The at least one node of the plurality of nodes is configured to transmit an out-of-band signal during at least one of the idle period or the preamble period and is configured to modify at least a portion of the out-of-band signal to communicate data to at least one other node. The at least one other node is configured to interpret the modified portion of the out-of-band signal to identify the data communicated in the modified out-of-band signal. The modified out-of-band signal complies with the protocol's encoding rules such that any node not configured to interpret the modified portion of the out-of-band signal processes the modified out-of-band signal according to the protocol.

Abstract: In an RF source, a digital waveform synthesizer comprises a computational module to synchronously determine a desired periodic function, f(?), within a first bandwidth portion, to which computational result there is combined an injected digital noise increment in an adjustable range of bounded amplitude, specifically selected to average over discontinuities of the DAC transfer characteristic. The combination is effected after passing the injected noise increment through a programmable digital filter forming a composite tuning word having a total bandwidth at a selected Nyquist zone and thence passing the composite tuning word through a truncation component to a DAC. The programmable digital filter is constructed to displace the spectral distribution of the injected noise increment to a portion of the total bandwidth remote from the first bandwidth portion.

Abstract: A method and apparatus is presented for reducing or eliminating pathological data patterns from signals for transmission over optical communications systems. One embodiment includes a decoder/deserializer configured to receive an encoded serial digital signal, a ditherer configured to dither a least significant bit of each digital data word, and a reserializer/encoder configured to serialize digital data and encode it, for example according to an applicable communication standard such as SMPTE 259M. The improvements may be provided in a single removable unit, such as a small form-factor pluggable (SFP) module compatible with existing optical communications equipment.

Abstract: An encoding device enables the amount of processing operations to be significantly reduced while minimizing deterioration in the quality of an output signal. This encoding device (101) encodes an input signal by determining the correlation between a first signal generated by using the input signal and a second signal generated by a predetermined method. An importance assessment unit (202) sets the importance of each of a plurality of processing units obtained by dividing the frames of the input signal. A CELP coder (203) performs sparse processing in which the amplitude value of a predetermined number of samples among multiple samples constituted by the first signal and/or the second signal in each processing unit is set to zero according to the importance that was set for each processing unit, and calculates the correlation between the first signal and the second signal, either of which was subjected to sparse processing.

Abstract: A method for compressing a plurality of coordinates includes obtaining a plurality of approximately-zero polynomials of dimension dim for a plurality of coordinate parameters. The method further includes selecting dim+1 non-approximately-zero polynomials, and providing a compressed data set that includes the approximately-zero polynomials, the dim+1 non-approximately-zero polynomials, and evaluations of the selected dim+1 non-approximately-zero polynomials based on the coordinates.

Abstract: Input bits are stored in memory cells by mapping the input bits into a larger number of transformed bits using a shaping encoding that has a downward asymptotic bias with respect to a mapping of bit patterns to cell states and programming some of the cells according to that mapping of bit patterns to cell states. The programmed cells are erased before being programmed to store any other bits. The invention sacrifices memory capacity to increase endurance.

Abstract: There is provided an entropy modifier which is operable to encode, alternatively decode, a stream of input data bits having a first entropy for generating corresponding entropy-modified output data having a second entropy, wherein the entropy modifier is operable to process the stream of input data bits to handle groups of mutually similar bits and the value of the first bit, and one or more maximum run lengths of the groups of mutually similar bits. Optionally, the entropy modifier is operable to control one or more maximum run lengths of the groups of mutually similar bits by using at least one escape code.

Abstract: The transmission of broadcast data, such as financial data and news feeds, is accelerated over a communication channel using data compression and decompression to provide secure transmission and transparent multiplication of communication bandwidth, as well as reduce the latency. Broadcast data may include packets having fields. Encoders associated with particular fields may be selected to compress those particular fields.

Abstract: A method is described for encoding N variables onto less than 2N channels by forming a respective signal for each of the channels by combining inverted and/or non inverted forms of the variables, such that, each of the N variables is balanced across the channels, and, combination on any particular channel is not the polar opposite of a combination on any other channel.

Abstract: The disclosure discloses a method and system for transmitting a large message mode CPM message, both of which enable the respective establishment of Message Session Relay Protocol (MSRP) links between a CPM client of a sender and an originating participation function entity, between the originating participation function entity and a terminating participation function entity, and between the terminating participation function entity and an inter-working function entity, wherein the establisher of each segment of MSRP link obtains the MSRP connection parameters of the opposite end through media negotiations and establishes the MSRP link according to the MSRP connection parameters; the CPM client of the sender sends the large message mode CPM message to the inter-working function entity through each segment of established MSRP link in sequence, the inter-working function entity performs a protocol conversion on the received the large message mode CPM message and then transmits the converted message to a non-CPM

Abstract: Coding/decoding of a digital signal, consisting of successive blocks of samples, the coding being of the transform with overlap type and comprising, upon analysis, the application of a weighting window to two blocks of M successive samples. In particular, this weighting window is asymmetric and comprises four distinct portions extending successively over the two aforesaid blocks, with: a first portion, increasing over a first interval of samples, a second portion, constant at a value of 1 over a second interval, a third portion, decreasing over a third interval, and a fourth portion, constant at a value of 0 over a fourth interval.

Abstract: A method and apparatus for data compression, particularly applicable to spectral signals such as Fast Fourier Transforms of vibration data. The data is merged to remove redundant frequencies when recorded at multiple sample rates, thresholded with respect to a noise floor to remove even more redundant data, and then the positions of non-zero signal values, with respect to the noise floor, are recorded in a first dataword and the non-zero signal values themselves are all recorded concatenated to form a second dataword. The compressed data set consists of the first and second datawords, together with the value of the noise floor, maximum original amplitude and the broadband power. In the event of successive data sets having the same or similar locations for non-zero signal values a re-use flag may be set and the locations dataword discarded. Preferably the signal values are non-linearly quantized to further reduce the amount of data.

Abstract: A method for decoding run-length encoded (RLE) data includes the steps of receiving the RLE data and storing a predetermined value (e.g., zero) in each of a plurality of consecutively-accessible storage locations of a buffer. The method further includes writing a first value different than the predetermined value to a first storage location based on the RLE data, jumping over (i.e., skipping) a number of the consecutively-accessible storage locations from the first storage location to a next storage location based on the RLE data, and writing a next value different than the predetermined value to the next storage location based on the RLE data. In the case of JPEG, the values stored in the storage locations of the buffer are quantized coefficients associated with a block of image data. A run-length decoder is also described.

Abstract: A method and apparatus for encoding structured data by fragmenting the structured data into fragments according to a configuration of the structured data and encoding the fragments to generate encoded fragments using a string table including strings contained in the structured data.

Abstract: The transmission of broadcast data, such as financial data and news feeds, is accelerated over a communication channel using data compression and decompression to provide secure transmission and transparent multiplication of communication bandwidth, as well as reduce the latency. Broadcast data may include packets having fields. Encoders associated with particular fields may be selected to compress those particular fields.

Abstract: The present invention discloses a method and a device for pulse encoding, and a method and a device for pulse decoding. The method for pulse encoding includes: calculating an index value of an input pulse; selecting an adjustment threshold value according to the number of pulses, and comparing the index value of the pulse with the adjustment threshold value; if the index value is smaller than the adjustment threshold value, adopting the first number of encoding bits to encode the index value, if the index value is not smaller than the adjustment threshold value, adopting the second number of encoding bits to encode the index value plus an offset value, where the first number is smaller than the second number, the first number and the second number are both positive integers, and the offset value is greater than or equal to the adjustment threshold value.

Abstract: In a chip-to-chip communication system and apparatus, a set of physical signals to be conveyed over a communication bus is provided, and mapped to a codeword of a vector signaling code using the physical signals and a state information, wherein a codeword is representable as a vector of plurality of real-valued components, and wherein a vector signaling code is a set of codewords in which the components sum to zero and for which there is at least one component and at least three codewords having different values in that component; and wherein the state information is a plurality of information present in continuous or discrete form which may have been obtained from previous codewords transmitted over the communication bus.

Abstract: Systems and methods for providing fast and efficient data compression using a combination of content independent data compression and content dependent data compression. In one aspect, a method for compressing data comprises the steps of: analyzing a data block of an input data stream to identify a data type of the data block, the input data stream comprising a plurality of disparate data types; performing content dependent data compression on the data block, if the data type of the data block is identified; performing content independent data compression on the data block, if the data type of the data block is not identified.

Abstract: A plurality of samples are vector-quantized to obtain a vector quantization index and quantized values; bits are assigned in a predetermined order of priority based on auditory perceptual characteristics to one or more sets of sample positions among a plurality of sets of sample positions, each set having a plurality of sample positions and being given an order of priority based on the auditory perceptual characteristics, the number of bits not being larger than the number of bits obtained by subtracting the number of bits used for a code corresponding to the vector quantization index from the number of bits assigned for the code corresponding to the vector quantization index; and index information indicating a group of coefficients that minimizes the sum of the error between the value of each sample included in each of the sets of sample positions to which the bits are assigned and the value obtained by multiplying the quantized value of each sample included in the set of sample positions by a coefficient co

Abstract: Methods and devices for creating, compressing and searching a binary tree are provided by the present disclosure, which relates to the field of traffic classification. Binary tree compression includes: determining a number of a compression layer or a number of an intermediate node, compressing a binary tree according to the number of the compression layer or the number of the intermediate node to form at least one compression node, and creating a bitmap of the compression node. Therefore, the depth of the decision tree is reduced, the search speed is increased, rule expansion is avoided, and rule replication is reduced.

Abstract: An encoding method includes searching a search target symbol string within a specific range from the end of a symbol string, which has been utilized for encoding, for a match symbol string corresponding to a beginning symbol string of a symbol string to be encoded, encoding the beginning symbol string based on a distance between the match symbol string and the beginning symbol string, and a length of the match symbol string.

Abstract: A mechanism is provided in a data processing system for pipelined compression of multi-byte frames. The mechanism combines a current cycle of data in an input data stream with at least a portion of a next cycle of data in the input data stream to form a frame of data. The mechanism identifies a plurality of matches in a plurality of dictionary memories. Each match matches a portion of a given substring in the frame of data. The mechanism identifies a subset of matches from the plurality of matches that provides a best coverage of the current cycle of data. The mechanism encodes the frame of data into an encoded output data stream.

Abstract: Hybrid-coding, multi-cell architecture and operating techniques for step devices provide advantages over binary-coded and thermometer-coded step devices by minimizing or avoiding glitches common in the transient response of binary-coded step devices and by minimizing or avoiding significant increases or degradation in one or more of area, package dimensions, pin counts, power consumption, insertion loss and parasitic capacitance common to thermometer-coded step devices having equivalent range and resolution.

Abstract: Provided are a computer program product, system, and method for generating a code alphabet for use by a deployed program to determine codewords for words. A first code alphabet is generated having a first number of symbols that provide variable length codings of the words. The symbols in the first code alphabet are merged into a second number of groups of the symbols in the first code alphabet, where the second number is less than the first number. A second code alphabet is generated having the second number of symbols, wherein a second average codeword length of the codewords produced using the symbols in the second code alphabet is smaller than the codeword length (b) of the words, and wherein the second code alphabet comprises the code alphabet used by the deployed program.

Abstract: A method and apparatus for encoding based on a linear block code, and a method and apparatus for generating a linear block code are provided. The method for encoding based on a linear block code includes: generating a linear block code; and encoding an information sequence with an encoding matrix of the linear block code to obtain a bit stream sequence. The linear block codes have a good minimum distance characteristic, so that the error correction performance is improved.

Abstract: The transmission of broadcast data, such as financial data and news feeds, is accelerated over a communication channel using data compression and decompression to provide secure transmission and transparent multiplication of communication bandwidth, as well as reduce the latency. Broadcast data may include packets having fields. Encoders associated with particular fields may be selected to compress those particular fields.

Abstract: A method of communicating electronic map data is disclosed, wherein map data is compiled as at least one cell comprising a plurality of vector data records and a plurality of feature data records to, for instance, the IHO S-57 standard. During the compilation, the respective bit lengths of a plurality of vector data values are reduced and both the bit-reduced vector data values and feature data values are entropy encoded. The compiled cell data, which may be an Electronic Navigational Chart, is then compressed, encrypted and digitally signed according to, for instance, the IHO S-63 standard. The encrypted and digitally signed cell data is eventually transmitted to a remote navigational system, which may be an Electronic Chart Display and Information System, over a network, for instance in a satellite telecommunication. A system embodying the method is also disclosed.

Abstract: A system and method for sending binary data via a short message service (SMS) over a wireless communication system. The method provides the capability to send and receive binary data to a vehicle telematics unit using a text SMS message. The binary data is converted to encoded text according to an encoding scheme supported by a wireless communication system. Then, the encoded text is sent as an SMS message over the wireless communication system. Once, the SMS message containing the encoded text is received at its destination, it is converted back to binary data.

Abstract: A data encoding apparatus for communicating between robot softwares includes a meta structure converter factory configured to allow one or more meta structure converters generated based on an information file, and if a type of user data for encoding is a structure or a structure array, select a meta structure converter, operable to convert a structure of the user data into a meta structure, from among the registered meta structure converters; an encoder factory configured to allow encoders for respective types of data to be registered, and to select an encoder from among the registered encoders in order to encode the user data to be encoded; and an encoder unit configured to encode the user data to be encoded using the meta structure generated by the selected meta structure converter and the encoder.

Abstract: A method for determining whether portions of text have been copied during electronic copying, photocopying, or scanning of a document. The method comprises generating a target code from a target passage of the text, determining whether a sample passage of text includes the target code, and, upon successful determination, initiating an action if the sample passage of text includes the target code. A method of generating a code representative of a passage of text uses a spacing between respective occurrences of one or more key symbol strings within the text. By comparing the known code of a target text passage with the code generated from a sample text passage, it is easy to determine whether the target text has been used within the sample. The method may be integrated within a copying device.

Abstract: A decoding apparatus and method store at least one table including at least one code, receive at least one instruction signal, and extract a symbol value and a symbol length from the at least one table based on the at least one instruction signal. The decoding apparatus calculates a target suffix length that minimizes the size of a generated table and minimizes the size of a non-prefix length of the at least one code.

Abstract: In response to receipt of an input string, an attempt is made to identify, in a template store, a closely matching template for use as a compression template. In response to identification of a closely matching template that can be used as a compression template, the input string is compressed into a compressed string by reference to a longest common subsequence compression template. Compressing the input string includes encoding, in a compressed string, an identifier of the compression template, encoding substrings of the input string not having commonality with the compression template of at least a predetermined length as literals, and encoding substrings of the input string having commonality with the compression template of at least the predetermined length as a jump distance without reference to a base location in the compression template. The compressed string is then output.

Abstract: The present inventions are related to systems and methods for information data processing included selective decoder message determination.

Abstract: A computerized method for data conversion, comprising receiving a data sequence, receiving a dictionary having patterns respective to patterns in the data sequence, and converting the data sequence by substituting the patterns in the data sequence with at least one of the patterns of the dictionary respective to the patterns in the data sequence, or references to the patterns of the dictionary respective to the patterns in the data sequence, or a combination thereof, and an apparatus for performing the same.

Abstract: Method, apparatus, and systems employing 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 method for generating occurrence data of data values for enabling encoding of a data set includes determining occurrences of data values in a first data batch and determining occurrence count information for a first number of most frequent data values in the first data batch, the occurrence count information identifying the most frequent data values and their occurrence counts. The method also includes generating for rest of the data values in the first data batch at least a first histogram having a second number of buckets and merging the occurrence count information of the first data batch with occurrence count information of a second data batch. The method further includes merging the first histogram of the first data batch to a merged histogram corresponding to the second data batch and processing a next data batch as a first data batch until the data set to be encoded is processed.

Abstract: An object of the present invention is to achieve high coding efficiency for a companded signal sequence and reduce the amount of codes. A coding method according to the present invention includes an analysis step and a signal sequence transformation step. The analysis step is to check whether or not there is a number that is included in a particular range but does not occur in a second signal sequence (a number sequence that indicates the magnitude (magnitude relationship) of original signals) and output information that indicates the number that does not occur.

Abstract: Computer implemented methods for compressing 3D hyperspectral image data having a plurality of spatial pixels associated with a hyperspectral image, and a number of spectral dimensions associated with each spatial pixel, include receiving, using a processor, the 3D hyperspectral image data, a set of basis vectors associated therewith, and either a maximum error amount or a maximum data size. The methods also include partitioning the 3D hyperspectral image data into a plurality of 2D images, each associated with one of the number of spectral dimensions, and an associated one of the set of basis vectors. The methods additionally include ranking the set of basis vectors if not already ranked. The methods may further include iteratively applying lossy compression to the 2D images, in an order determined by the ranking. Other embodiments and features are also disclosed.

Abstract: Systems and methods for optimizing the compression of data using a dictionary coding compression system are described. A system performs an initial compression operation, such as by using a dictionary or other coder. The system then refines the compression by performing an iterative backward reference search for an optimized compressed file.

Abstract: A management module registers a request to convert code from a first code set to a second code set, identifies a code set converter (CSC), determines whether a most recently used CSC is the identified CSC and, in response to determining that the most recently used CSC is not the identified CSC, locates a user-preferred CSC pool comprising a subset of locally stored CSCs each corresponding to a preference index. The management module, in response to determining that the identified CSC is located within the user-preferred CSC pool, searches the user-preferred CSC pool for the identified CSC, loads the identified CSC, initiates the identified CSC that converts the code from the first code set to the second code set, modifies usage data for the identified CSC, and orders the user-preferred CSC pool based on a preference index for each CSC stored in the CSC pool.

Abstract: Systems and methods for providing fast and efficient data compression using a combination of content independent data compression and content dependent data compression. In one aspect, a method for compressing data comprises the steps of: analyzing a data block of an input data stream to identify a data type of the data block, the input data stream comprising a plurality of disparate data types; performing content dependent data compression on the data block, if the data type of the data block is identified; performing content independent data compression on the data block, if the data type of the data block is not identified.

Abstract: Methods for decoding data are disclosed herein. The data is coded such that a transition from a first state to a second state represents a logic one and a transition from the second state to the first state represents a logic zero. An embodiment includes determining a pulse width for a first pulse and measuring the width of a second pulse, wherein the second pulse occurs directly after the first pulse. The method continues with comparing the second pulse width to at least one first predetermined period and assigning a value to the second pulse width when the second pulse width is within at least one of the first predetermined periods. The method also includes assigning a value to the second pulse width based on the value assigned to the first pulse width when the second pulse width is not within at least one of the first predetermined periods.

Abstract: A method for encoding an input sequence of symbols. The method includes, sequentially, for each symbol in the input sequence, determining an estimated probability for that symbol based on a context model, identifying a codeword associated with a sequence of symbols resulting from appending that symbol to a previous sequence of symbols associated with that estimated probability, using an encoding tree associated with that estimated probability, and storing the codeword in a buffer element of a first-in-first-out buffer, wherein the buffer element is associated with the estimated probability. Stored codewords are output from the buffer in a first-in-first-out order.

Abstract: Hybrid-coding, multi-cell architecture and operating techniques for step devices provide advantages over binary-coded and thermometer-coded step devices by minimizing or avoiding glitches common in the transient response of binary-coded step devices and by minimizing or avoiding significant increases or degradation in one or more of area, package dimensions, pin counts, power consumption, insertion loss and parasitic capacitance common to thermometer-coded step devices having equivalent range and resolution.

Abstract: Filter banks may have different structures and different individual output signal domains. Often a translation between different filter bank domains is desirable. Usually, mapping matrices are used that, however, vary over frequency. This requires a significant amount of lookup tables. A method for transforming first data frames of a first filter bank domain to second data frames of a different second filter bank domain, comprises steps of transcoding sub-bands of the first filter bank domain into sub-bands of an intermediate domain that corresponds to said second filter bank domain but has warped phase, and transcoding the sub-bands of the intermediate domain to sub-bands of the second filter bank domain, wherein a phase correction is performed on the sub-bands of the intermediate domain.