Abstract: A decoder for decoding an input bit stream into a plurality of symbols is provided. The decoder includes an extractor, a length generator, a base selector, and a processing unit. The extractor receives the input bit stream and extracts a code with a predetermined codeword length therefrom. The length generator receives the extracted code and determines a first codeword length corresponding to a symbol according to the extracted code and a base table. The base selector determines a codeword base corresponding to the first codeword length according to the base table. The processing unit generates the symbol corresponding to the extracted code according to the codeword base, an offset table and the first codeword length.

Abstract: Methods and apparatus for implementing an n-state ripple-adder scheme coder with n?2 using an n-state reversible switching function and a non-reversible n-state switching function acting upon a first and a second word of at least 2 n-state symbols are disclosed. Corresponding decoding methods and apparatus are also disclosed. A resulting codeword may be a codeword which can be decoded by using the identical or different n-state switching functions in a corresponding ripple adder scheme decoder. Feistel networks and LFSRs apply the coding and decoding. Systems using the coding and decoding methods may be communication, storage and/or financial systems.

Abstract: According to one embodiment, a run length limiter includes a searcher configured to search a received digital data for a specific symbol, an operator configured to operate an exclusive OR operation of the specific symbol and the digital data, and an output module configured to output the exclusive OR operated digital data with the specific symbol.

Abstract: Systems, methods, and computer programs for high quality wide-range multi-layer image compression coding, including consistent ubiquitous use of floating point values in essentially all computations; an adjustable floating-point deadband; use of an optimal band-split filter; use of entire SNR layers at lower resolution levels; targeting of specific SNR layers to specific quality improvements; concentration of coding bits in regions of interest in targeted band-split and SNR layers; use of statically-assigned targets for high-pass and/or for SNR layers; improved SNR by using a lower quantization value for regions of an image showing a higher compression coding error; application of non-linear functions of color when computing difference values when creating an SNR layer; use of finer overall quantization at lower resolution levels with regional quantization scaling; removal of source image noise before motion-compensated compression or film steadying; use of one or more full-range low bands; use of alternate q

Abstract: A method for embedded encoding of at least two types of information. A first message and a second message are received. The types of a first encoder and a second encoder are determined. The rates of the first encoder and the second encoder are determined. A first codeword and a second codeword are generated. A mapping rule for the second codeword and a coding rule for the first codeword are determined. The second codeword is mapped into a plurality of symbols using the mapping rule. A third codeword is determined using the first codeword, the plurality of symbols, and the coding rule. The third codeword is then transmitted. The third codeword includes at least two types of information.

Abstract: A method for decoding includes receiving a message at a decoding device, where the message includes a code corresponding to a sequence of data symbols. Based on the code, a first data symbol of the sequence of data symbols is determined. The first data symbol is determined based at least in part on a first radix used to generate the code. Based on the code, a second data symbol of the sequence of data symbols is also determined. The second data symbol is determined based at least in part on a second radix and at least in part on the first data symbol.

Abstract: Encoding and decoding apparatuses and encoding and decoding methods are provided. The decoding method includes extracting a plurality of encoded signals from an input bitstream, determining which of a plurality of decoding methods is to be used to decode each of the encoded signals, decoding the encoded signals using the determined decoding methods, and synthesizing the decoded signals. Accordingly, it is possible to encode signals having different characteristics at an optimum bitrate by classifying the signals into one or more classes according to the characteristics of the signals and encoding each of the signals using an encoding unit that can best serve the class where a corresponding signal belongs. In addition, it is possible to efficiently encode various signals including audio and speech signals.

Abstract: A server based method for optimizing call setup latency including updating client location information using at least one application server; identifying and updating parameters including location update information uniquely identifying a sector from which the at least one client is receiving communication service; determining at least one geographically dense call group; choosing at least one designated responder to respond to the at least one call group; selecting a plurality of designated responders as targets for m largest clusters; computing hash outputs of the targets; and performing a logical OR operation on lower order n bits of the hash outputs corresponding to the targets.

Abstract: Class-D amplifiers have evolved from using binary pulse-width modulation (PWM) modulators to three-level PWM modulators. Three-level PWM drivers for audio applications offer the benefits of eliminating costly elements at the output of an audio system. However, they also introduce increased common-mode interference. Three-level PWM generates three states, but one state has two interchangeable representations which can be scrambled in order to shape the common-mode output spectrum.

Abstract: One embodiment of the present invention is an apparatus that transcodes an n code unit block of UTF-8 input data in the form of eight parallel n-bit segments of u8-indexed bit streams u8bit0 through u8bit7 into UTF-16 output data in the form of sixteen parallel n-bit segments of u16-indexed bit streams u16bit0 through u16bit15 where n is 4 or more.

Abstract: An entropy coding apparatus configured to categorize each binarized symbol according to a corresponding bit position and a target arithmetic coding mode, and configured to parallelly perform arithmetic coding of a plurality of symbols belonging to an identical category is provided.

Abstract: Methods and apparatus for determining the existence of an external clock over a digital input port on a computer. In one embodiment, the external clock is validated, and a lock is performed when the clock is valid. Whenever a loss of the lock is detected, and, if a re-lock is likely, the apparatus is muted so that audio artifacts that would otherwise be heard are minimized. The methods and apparatus also provide automatic re-locking to the external clock when a sampling rate change is detected.

Abstract: A compression/decompression apparatus according to the present invention divides a transfer data amount per cycle, and after allocating compressed data in a predetermined amount of at least two sub-block data elements of a plurality of compressed sub-block data elements to each segmented region, combines elements of compressed data in respective segmented regions to generate transfer data, and the compression/decompression apparatus decompresses compressed data of read transfer data allocated to each segmented region in parallel and performs address conversion so that the compressed data is arranged at an original position in block data.

Abstract: A method for decoding elements is disclosed. The method decodes at least a part of the binary stream into a set of elements on the basis of first and second decoding parameters CodlOffset0 and CodIRange, the set of elements comprising a prefix composed of n first elements and a suffix comprising m second elements, the prefix and the suffix being separated by an element called a pivot. The method comprises: determining the value of n on the basis of the first and second decoding parameters and of the values of k consecutive bits of the binary stream, termed k first bits, so as to deduce therefrom the prefix and the value of m; and determining the suffix on the basis of the first and second decoding parameters and of the values of m consecutive bits which follow the n first bits of the k first bits.

Abstract: In a data acquisition system that captures signal data from one or more input channels, the signal data are compressed prior to transfer or storage. Compression allows the data acquisition system to effectively store more captured signal data in a given amount of memory. The data transfer interface of the data acquisition system requires less bandwidth for transfer of compressed data than for uncompressed data. The compression operations may be performed in real time. The data acquisition system may include one or more analog-to-digital converters to sample analog signals received over the input channels to produce the sampled data for compression. The compressed data are transferred to a processor where they are decompressed prior processing or analysis. This abstract does not limit the scope of the invention as described in the claims.

Abstract: A transmission device configured to transmit a transmission bit string which is an arrangement of a unit bit string of multiple N bits includes: a conversion unit configured to convert the unit bit string into a converted bit string in accordance with a conversion table obtained by obtaining an error rate wherein a k'th bit out of the N bits is in error; obtaining an error expectancy which is an expectancy that a significant bit of the N bits in the unit bit string will err; and creating a conversion table that correlates the unit bit string and a converted bit string obtained by converting the insignificant bit of the unit bit string to a smallest error expectancy bit pattern which is a bit pattern that minimizes the error expectancy of the multiple bit patterns; and a transmission unit configured to transmit the converted bit string.

Abstract: Techniques for decompressing a compressed input by determining, according to an ordering of allowable codewords, an offset for a variable length codeword detected in the input; accessing a record at the determined offset in a data structure having one record for each of the allowable codewords, each record including a portion for at least one of a literal value and a length value and a portion for a type value indicative of whether the record is for a literal or a length; and determining a decompressed output based at least in part on the accessed record.

Abstract: Described is a system and method for receiving a signal for transmission and encoding the signal into a plurality of linear projections representing the signal. The encoding includes defining a transform matrix. The transform matrix being defined by processing the signal using a macroseparation matrix, processing the signal using a microseparation matrix and processing the signal using an estimation vector.

Abstract: Disclosed is an Ethernet-IEEE 1394 repeater apparatus as a network transmission equipment for connecting between networks having the same or different protocols is disclosed.

Abstract: A data conversion device is provided with a data converting means that sequentially converts first data into second data of the number of second bits, wherein an analog signal is quantized into the first data by the number of first bits, and the first and second data can be first and second maximum values, respectively. The data converting means is comprised of a first conversion means (steps 21 and 23) that, when a value of the fast data is not the first maximum value, converts the first data to the second data by adding 0 to a lower bit side of the first data and a second conversion means (steps 21 and 24-26) that converts the first data to the second data so that, when a value of the first data is the fast maximum value, a value can be made larger, in accordance with a value be-fore or after the first data, than the data of the number of second bits obtained by adding 0 to the lower bit side of the first data.

Abstract: A memory device includes a receiver to receive a first input data signal and to create an output signal corresponding to the first input data signal and a voltage representative of a second signal received earlier in time than the first input data signal. A memory system includes a memory controller and one or more memory devices, at least one or which includes a receiver to receive a first input data signal and to create an output signal corresponding to the first input data signal and a voltage representative of a second signal received earlier in time than the first input data signal.

Abstract: In a coding system, input data within a system is encoded. The input data might include sequences of symbols that repeat in the input data or occur in other input data encoded in the system. The encoding includes determining a target segment size, determining a window size, identifying a fingerprint within a window of symbols at an offset in the input data, determining whether the offset is to be designated as a cut point and segmenting the input data as indicated by the set of cut points. For each segment so identified, the encoder determines whether the segment is to be a referenced segment or an unreferenced segment, replacing the segment data of each referenced segment with a reference label and storing a reference binding in a persistent segment store for each referenced segment, if needed.

Abstract: A system and method for increasing transmission distance and/or transmission data rates using tedons and an encoding scheme to reduce the number of ones in a data signal is described. For example, the method for increasing transmission distance and transmission data rate of a fiber optical communications link using tedons includes the steps of encoding a data signal to be transmitted using an encoding scheme that reduces a number of ones in the data signal, transmitting the encoded data signal over the fiber optical communications link, receiving the encoded data signal and decoding the encoded data signal.

Abstract: One embodiment of the present invention is an apparatus that transcodes an n code unit block of UTF-8 input data in the form of eight parallel n-bit segments of u8-indexed bit streams u8bit0 through u8bit7 into UTF-16 output data in the form of sixteen parallel n-bit segments of u16-indexed bit streams u16bit0 through u16bit15 where n is 4 or more.

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: A method for converting data received in either a Level A or Level B SMPTE 425M compliant format into either a Level B or a Level A compliant format, respectively, includes receiving and processing data in one of a Level A or a Level B SMPTE 425M compliant format. Inputting the received Level A formatted data into a storage device and reading out Level B formatted data at an output of the storage device, or inputting Level B formatted data into the storage device and reading out Level A formatted data at an output of the storage device. Back-end circuitry further processes the Level A formatted data when Level B formatted data is received or further processes the Level B formatted data when Level A formatted data is received. The storage device is operated as a line multiplexer to convert data in a Level B format to data in a Level A format and is operated as a line demultiplexer to convert data in a Level A format to data in a Level B format.

Abstract: A network device comprises a data translator that receives a first data stream at a first data rate and that includes a data sampler that selects one of X data symbols that are received, wherein the one of the X data symbols includes (M+N) bits, and that outputs a second data stream at a second data rate and a data remover that removes N of the (M+N) bits and that outputs a third data stream including symbols with the M bits at a third data rate. A physical layer device receives the third data stream.

Abstract: A coder has a binarizing circuit (130) for converting multivalued data into a binary symbol sequence, the multivalued data being generated from an input signal and having a plurality of contexts, an arithmetic code amount approximating circuit (200) for calculating a prediction code amount in the predetermined coding unit from the binary symbol sequence, and a coding circuit (102) for coding the input signal arithmetically on the basis of the prediction code amount.

Abstract: Method to convert a hexadecimal floating point number (H) into a binary floating point number by using a Floating Point Unit (FPU) with fused multiply add with an A-register a B-register for two multiplicand operands and a C-register for an addend operand, wherein a leading zero counting unit (LZC) is associated to the addend C-register, wherein the difference of the leading zero result provided by the LZC and the input exponent (E) is calculated by a control unit and determines based on the Raw-Result-Exponent a force signal (F) with special conditions like ‘Exponent Overflow’, ‘Exponent Underflow’, and ‘Zero Result’.

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

Abstract: An intelligent search and retrieval system and method is provided to allow an end-user effortless access yet most relevant, meaningful, up-to-date, and precise search results as quickly and efficiently as possible. The method may include providing a query profiler having a taxonomy database; receiving a query from a user; accessing the taxonomy database of the query profiler to identify a plurality of codes that are relevant to the query; augmenting the query using the codes to generate feedback information to the user for query refinement, the feedback information including a plurality of query terms associated with the query and to be selected by the user; presenting the feedback information to the user; receiving one of the query terms from the user; and identifying a source of the query term and presenting to the user.

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

Abstract: Embodiments of the claimed subject matter provide a method and system for performing data compression by encoding input into Exp-Golomb code. In one embodiment, data compression of data input is achieved via encoding as unsigned Exp-Golomb code. The method is achieved by converting the input, determining the position of the most significant bit in the converted input having a non-zero value (MSB), deriving information from the position of the MSB and arithmetically encoding the information to derive a compressed output.

Abstract: A system is provided that includes a device having an emissive portion, a memory, and a dictionary decompressor. The device having an emissive portion is configured to produce a patterned beam. The memory is configured to store a compressed representation of a requested dose pattern, comprising two groups of repeating pattern features, to be formed on a surface by the patterned beam. The dictionary decompressor at least partially decompresses the compressed representation. The dictionary decompressor comprises a first dictionary memory configured to store pattern data corresponding to a first group of the two groups of repeating pattern features and a second dictionary memory configured to store pattern data corresponding to a second group of the two groups of repeating pattern features. The repeating pattern features in the first group have one or more differing characteristics than the repeating pattern features in the second group. Related methods are also provided.

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

Abstract: A multi-level transform generates descriptions containing compressed data that represents source data using a description generation operation and variable support filters for compaction at each level. The initial level filters the source data and each subsequent level operates on data filtered by a prior level. The description assignment and filtering at each level may vary to create different operating points for the multi-level transform. Each operating point may have a corresponding error recovery process. In one aspect, an error recovery process encodes additional descriptions that are combined with non-erroneous description data to provide error recovery of the data in missing or damaged descriptions. In another aspect, a multi-level transform is created by combining description generation and variable support filters at the various levels.

Abstract: An encoder uses an input file of data and a key to produce an output symbol. An output symbol with key I is generated by determining a weight, W(I), for the output symbol to be generated, selecting W(I) of the input symbols associated with the output symbol according to a function of I, and generating the output symbol's value B(I) from a predetermined value function F(I) of the selected W(I) input symbols. An encoder can be called repeatedly to generate multiple output symbols. The output symbols are generally independent of each other, and an unbounded number (subject to the resolution of I) can be generated, if needed. A decoder receives some or all of the output symbols generated. The number of output symbols needed to decode an input file is equal to, or slightly greater than, the number of input symbols comprising the file, assuming that input symbols and output symbols represent the same number of bits of data.

Abstract: A system and method of creating and using compact linguistic data are provided. Frequencies of words appearing in a corpus are calculated. Each unique character in the words is mapped to a character index, and characters in the words are replaced with the character indexes. Sequences of characters are mapped to substitution indexes, and the sequences of characters in the words are replaced with the substitution indexes. The words are grouped by common prefixes, and each prefix is mapped to location information for the group of words which start with the prefix.

Abstract: A method of resampling a digital signal involves serially receiving a plurality of samples of said digital signal and applying a plurality of filter coefficients to a first subset of the plurality of samples to generate a first plurality of intermediate results and to a second subset of the samples to generate a second plurality of intermediate results. The first plurality of intermediate results is accumulated to generate a first resampled value, and the second plurality of intermediate results is accumulated to generate a second resampled value. Upon receipt, each signal sample may be used to update each of a plurality of running accumulation values and then discarded before receipt of a next signal sample. Furthermore, multiple signals may be resampled concurrently using a single filter path by multiplexing circuit components, such as memory blocks.

Abstract: A lossless encoding and/or decoding apparatus which encodes audio data on a real-time basis includes a lossless compression unit which losslessly compression encodes the audio data stored in an input buffer in units of predetermined data and outputs the encoded data in sequence, and an output buffer which stores the encoded audio data output from the lossless compression unit. A bitrate controller divides a plurality of the encoded audio data stored in the output buffer into first data having a data amount exceeding the maximum bitrate and second data having a data amount less than the maximum bitrate, divides the first data into third data being the encoded audio data having a data amount of the maximum bitrate and fourth data being the encoded data of the portion exceeding the maximum bitrate, and controls the output buffer so that the fourth data is output together with the second data.

Abstract: A pulse modulation method divides code comprising 4N-bit data into 2-bit units of data. For each pulse signal having a fixed pulse width tw, a code modulated signal is generated by pausing between pulse pause intervals Tr. An adjusted time width of between ½ and 1 times the fixed pulse width tw is taken to be ?t. One of time widths 0, ?t, 2?t, and 3?t is added to a fixed pause period tm of time intervals according to a corresponding value of the 2-bit data. If the sum total time TD of the code modulated signal is an interval of at least [(2tw+2tm+3?t)N+?t], each pulse pause interval Tr is substituted by a pulse pause interval Tr corresponding to the inverted 2-bit data. An inversion flag signal expresses that inversion information is added to the code modulated signal.

Abstract: An audio codec system and an encoding method using the same are provided. According to the method, encoding and decoding processes are repeatedly performed so as to determine optimized coding parameters when analog audio signals being inputted are encoded. The processes of encoding and decoding inputted analog audio signals using initial coding parameters, and computing new parameters using a differential computed during the encoding process are repeatedly performed.

Abstract: Provided is a distributed decoding device using a multi-core processor, including a multi-core processor that includes a plurality of cores which process data as threads; an MPEG division module that receives MPEG data, extracts decoding information from the MPEG data, divides the MPEG data into individual slices, and generates and provides a single-slice decoding function, which separately decodes one slice, such that threads which decode the divided slices allocated thereto are distributed to the cores within the multi-core processor; a memory that includes a plurality of buffers which receive the slices from the MPEG data division module to store therein and provide the stored slices to the cores of the multi-core processor; and a merging module that merges the data decoded through the cores of the multi-core processor.

Abstract: An encoding method for dividing a bit string of an input signal at a position of x bits from a least significant bit into a high-order bit string and a low-order bit string, performing variable-length-encoding of the high-order bit string, and performing fixed-length-encoding of the low-order bit string includes deriving a reference integer I close to 2x (x=m/2, m is an integer of 0 or more); obtaining a quotient and a remainder that are determined by performing a dividing operation on numerical values represented respectively by the bit strings by using the reference integer I; and performing variable-length-encoding of each of quotients of two consecutive bit strings, combining remainders corresponding to the quotients and performing fixed-length-encoding of the result, and generating a codeword.

Abstract: A coder converts M-bit information words into N-bit code words by generating a first and a second provisional code sequence using a coding rule by which, code words are logically assigned to information words so that a two's complement of a sum of coding bits included in the first provisional code sequence, is always different from a two's complement of a sum of coding bib included in the second provisional code sequence, when a first code state of the first sequence encoded starting from a predetermined original state is identical to a second code state of the second sequence encoded starting from said predetermined original state. Then, selecting either the first sequence or the second sequence depending on a value of at least one parameter that correlates with a DC content of the coded bit stream.

Abstract: A method for encoding and decoding codes of constant weight that is based on conjugate dissections, which progressively modifies element values of an input vector to satisfy the constraint that each encoded symbol is to comprise integer component elements even when the encoded symbol is generated through processing that involved permuting.

Abstract: Methods or sub-component method step/s necessary for lossless data compressions of input binary (or adaptable for even N-ary) data file, or for compression/representation of sequential list of positive integers (or offsetted to all be positive integers >0, which may be a sequential list of variable length binary base positive integer digit numbers or even N-ary base positive integer digit numbers) are described, providing many magnitudes orders improvements over existing state-of-art best available methods such as Rice-Coulomb encodings/RunLength based/LZW encodings . . . etc. The methods or sub-component method step/s further makes possible or forms the basis/sub-component method step/s for ‘infinite data compressions’ algorithms to be adapted designed implemented.

Abstract: Embodiments described herein may include example embodiments of a method, article and apparatus for compressing data utilizing combinatorial coding with specified occurrences which may be used for communicating between two or more components connected to an interconnection medium (e.g., a bus) within a single computer or digital data processing system, and/or for communication between computing platforms via a network or other interconnection medium.

Abstract: Embodiments described herein may include example embodiments of a method, article and apparatus for compressing data utilizing combinatorial coding with specified occurrences which may be used for communicating between two or more components connected to an interconnection medium (e.g., a bus) within a single computer or digital data processing system, and/or for communication between computing platforms via a network or other interconnection medium.

Abstract: A method for organizing and compressing spatial data to enable fast, incremental downloads of spatial data over a network. The method comprises multiple steps for segmenting and reducing spatial data, and introduces a location-relevant naming system for storing and accessing the data. Applications installed on remote devices are able to efficiently compute data file names based solely on location information, download the data over a network and cache the data on the device.