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

Abstract: Semiconductor devices, a system including said semiconductor devices and methods thereof are provided. An example semiconductor device may receive data scheduled for transmission, scramble an order of bits within the received data, the scrambled order arranged in accordance with a given pseudo-random sequence. The received data may be balanced such that a difference between a first number of the bits within the received data equal to a first logic level and a second number of bits within the received data equal to a second logic level is below a threshold. The balanced and scrambled received data may then be transmitted. The example semiconductor device may perform the scrambling and balancing operations in any order. Likewise, on a receiving end, another semiconductor device may decode the original data by unscrambling and unbalancing the transmitted data. The unscrambling and unbalancing operations may be performed in an order based upon the order in which the transmitted data is scrambled and balanced.

Abstract: A method and apparatus are provided that allow exploitation of the common mode characteristics of a differential transmission network to provide an additional data signal. Signal (MODE) represents either a binary signal or a multi-valued signal to allow signaling of one or more bits of information. The signaling occurs through the variation of the common mode voltage in transmitters (300 and 400) and is detected using differential receiver (600). One embodiment is presented that achieves signaling of an extended run length data sequence to allow continued transmitter/receiver synchronization throughout the transmission of the sequence. In an alternate embodiment, a separate data path is provided to signal the extended run length sequence when a common mode signaling path is not available.

Abstract: A means for avoiding hash collisions by means of message pre-processing function to increase randomness and reduce redundancy of an input message whereby hash collisions are avoided when it is applied before hashing any message and the message pre-processing function comprises 4 steps like shuffling of bits, compression T-function and LFSR which steps increase the entropy of the input message at the end of 4 rounds, the output becomes more random.

Abstract: Method and apparatus are configured to assign a code of less than N number of bits in length to a pattern of bits of a first polarity value distributed within a block of N binary bits. The method basically comprises (1) determining a number of bits of the first value in the block of N binary bits; (2) selecting a base value based on the determined number of bits of the first value; (3) determining a displacement value representative of a particular distribution of the determined number of bits of the first value in the block of N binary bits; and (4) adding the base value and the displacement value to obtain a sum and using the sum to form an assigned code. The base value is preferably selected by evaluating an Expression Io=NC1+NC2+NC3 . . . +NCK?1, wherein K is the determined number of bits of the first value in the block of N binary bits.

Abstract: An energy dispersal circuit, which generates a PRBS (Pseudo Random Binary Sequence) and executes an XOR (exclusive-OR) operation with respect to a data signal and the PRBS based on a bit, includes a register value calculator for calculating a register value of a shift register based on inputted data and a packet number. The register value calculator has a bit divider for dividing the packet number from LSB to MSB, packet shift operators for bit-shifting an initial value of the shift register from 20 bits to 2N?1 bits, and selectors for selecting inputs and outputs thereof.

Abstract: A data encoder. The novel encoder includes a first circuit for generating a fundamental sequence coded data stream from an incoming input data stream, a second circuit for generating a k-split data stream from the incoming data stream, and a third circuit for combining the fundamental sequence coded data stream and k-split data stream to form a final encoded output. The first circuit includes a circuit for converting the incoming input data stream into a novel intermediate format comprising a set bit word and a zero word count, and a zero-word expander for converting the intermediate format to the fundamental sequence coded data stream. The first circuit may also include a register adapted to store the intermediate format to provide rate buffering.

Abstract: Embodiments of methods, apparatuses, devices and systems associated with encoding and/or decoding audio data are disclosed.

Abstract: A data processing method where a source bit stream is manipulated to produce four intermediate streams: flag bits, literals, offsets and lengths. Flag bits are grouped into multi-bit units, and an output stream containing flag units, literals, offsets and lengths is emitted. The output stream occupies fewer bits than the source bit stream, but encodes all the data of the source bit stream.

Abstract: Embodiments of methods, apparatuses, devices and systems associated with ordering and/or reordering a set of digital signal sample values are disclosed.

Abstract: A data weighted average (DWA) structure including a first delay unit, a binary to thermometer code converter, an adder, a second delay unit, a decoder, a barrel shifter, and a plurality of signal lines is provided. The first delay unit delays an input digital signal. The binary to thermometer code converter converts an output signal of the first delay unit into a thermal code. The second delay unit delays an output signal of the adder. The adder adds the input digital signal to an output signal of the second delay unit. The decoder decodes the output signal of the second delay unit. The barrel shifter generates an output signal from the thermal code in accordance with an output signal of the decoder. The signal lines route the output signal of the barrel shifter into two independent control signal groups.

Abstract: A method, a component, a system, and a computer program for changing an encoding mode of an encoded data stream from a first encoding mode to a second encoding mode are disclosed. The encoded data stream at the first encoding mode is represented by first encoding parameters. For the encoding mode change the steps of selecting (20) a first set of the first encoding parameters to be used unchanged at the second encoding mode, selecting (30) a second set of the first encoding parameters, changing (40) the second set according to an algorithm being adapted to change the second set to match to the second encoding mode when combined with the first set, and combining (50) the first set and the changed second set for representing the encoded data stream by second encoding parameters at the second encoding mode are performed.

Abstract: An apparatus for data compression includes an identifier which identifies a plurality of irredundant patterns in a data set, and an extractor which extracts at least a portion of the plurality of irredundant patterns from the data set to generate a compressed data set.

Abstract: A method and system for encoding or processing data is provided. Data is represented by a qubit. The qubit is generated by an emulator within an encoding system. The qubit is entangled with another qubit to create encoded data. The encoded data is useable for a non-quantum environment. The qubit and the another qubit are entangled by reconfiguring a quantum structure that is mapped onto the encoded data.

Abstract: Various technologies for efficiently storing and retrieving streaming data are described. Bits of data (e.g., P bits of data) are received and separated into most significant bits (MSB) of data and least significant bits (LSB) of data. Further, the MSB of data and the LSB of data are respectively packed into a first word and a second word. The first word is stored in a first area of a frame buffer and the second word is stored in a second area of the frame buffer. As a result, data is managed in a more efficient way to reduce memory bandwidth requirement.

Abstract: In a more effective data generation method and circuit used for 64B/66B encoding, when packet data, and head and tail information of the data packet are received, write user data in which a head and tail identifying bytes are respectively added to a head and a tail of the packet data based on the head and tail information is associated with control data indicating positions of both of the identifying bytes to be written in a memory sequentially from a predetermined address of the memory. From the predetermined address, user data by 8 bytes and the control data corresponding to the user data are sequentially read to be provided to a 64B/66B encoding circuit.

Abstract: An iterative method provides an output value at each iteration, indicating a time position of an output sample to be generated in a subsequent processing step, relative to the time position of a known input sample. The method also provides an indication as to whether a new input sample needs to be used to generate the output sample.

Abstract: A system and method for decompression optimization employing a data input and a dedicated back buffer and data parser. The system and method also relate to accelerating the parsing process during decompression of a block of data by taking advantage of those naturally occurring redundancies within the block of data identified at compression time. The system of the invention includes a parser and an annotated back buffer which operate collectively to optimize the parsing process during decompression.

Abstract: A bitstream generator is described, for placing variable length coding (VLC) data into a fixed width data stream. The bitstream generator includes an input for receiving VLC data; the VLC data may be separated into a value component, and a length component. The bitstream generator also includes an output buffer, a memory module, for storing the VLC data before sending. The bitstream generator also incorporates a backup buffer, which is used to store any overflow data which does not fit in the output buffer. A comparator is used, to determine how much of the VLC data will fit in the output buffer. Any portion of the VLC data which does not fit in the output buffer is stored in the backup buffer.

Abstract: Provided are a method, system, and program for decoding compressed data. Compressed data is received and decoded. An error is detected while decoding a first location in the compressed data. A reentry data set is accessed having a pointer to a second location in the compressed data following the first location and decoding information that enables decoding to start from the second location. The second location in the compressed data is accessed and the decoding information in the accessed reentry data set is used to continue decoding the compressed data from the second location.

Abstract: A signal compression optimization system between a communication network and wireless user equipment advantageously selects an optimized decompressor when feasible for reduced content processing latency and otherwise selects a virtual machine decompressor, such as a Universal Decompressor Virtual Machine (UDVM) that interprets the received decompression bytecode. Since the UDVM is not optimized for any particular decompression algorithm and suffers by the requisite delays associated with analyzing each statement in the bytecode before execution, being able to avoid use of the UDVM whenever possible enhances user experience in presenting wirelessly received signaling messages or media content.

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

Abstract: Emulation methods are provided for two PACK instructions, one for Unicode data and the other for ASCII coded data in which processing is carried out in a block-by-block fashion as opposed to a byte-by-byte fashion as a way to provide superior performance in the face of the usual challenges facing the execution of emulated data processing machine instructions as opposed to native instructions.

Abstract: Method and apparatus are configured to assign a code of less than N number of bits in length to a pattern of bits of a first polarity value distributed within a block of N binary bits. The method basically comprises (1) determining a number of bits of the first value in the block of N binary bits; (2) selecting a base value based on the determined number of bits of the first value; (3) determining a displacement value representative of a particular distribution of the determined number of bits of the first value in the block of N binary bits; and (4) adding the base value and the displacement value to obtain a sum and using the sum to form an assigned code. The base value is preferably selected by evaluating an Expression Io=NC1+NC2+N C3 . . . +NCK?1, wherein K is the determined number of bits of the first value in the block of N binary bits.

Abstract: Emulation methods are provided for two PACK instructions, one for Unicode data and the other for ASCII coded data in which processing is carried out in a block-by-block fashion as opposed to a byte-by-byte fashion as a way to provide superior performance in the face of the usual challenges facing the execution of emulated data processing machine instructions as opposed to native instructions.

Abstract: Providing interpolated signals with enhanced signal-to-noise-ratio (SNR). In an embodiment, for each digital sample (of an analog signal) having strength Dn, N values are inserted, with the kth inserted value having a strength of Dn(1+/?Dk), wherein Dk is selected randomly from within a range set according to quantization noise. The received digital samples along with inserted digital values are provided as the interpolated signal corresponding to the input signal represented by the received digital samples.

Abstract: Method for scalable coding of stereo signals includes left and right channel signals from a time into a frequency range; and then separately quantizing the transformed left and right channel signals; matrixing the quantized signals so as to form mid and side signals; and using the formed mid and side signals in a lossless coding stage so as to provide a coded signal for transmission.

Abstract: A system and method for encrypting and/or compressing an input data string is disclosed. The input data string is divided into a plurality of blocks of data that each contains a plurality of bits of data. A block code is used to identify the size of each of the blocks of data. The blocks of data are analyzed to determine how frequently different groups of bits of data are present within each block of data. The blocks of data are also analyzed to determine whether certain relationships among the groups of bits of data exist within the blocks of data. After the blocks of data are analyzed, and in response to the analyses, a control code is generated for each block of data through the use of a control code index. After the control code for each block of data is generated, a position code is also generated for each block of data in response to the control code for the corresponding block of data.

Abstract: A position in runlength compression data corresponding to a desired position in original data can be found fast. Index correspondence information is generated for representing correspondence between indexes representing predetermined positions in data arrangement of the original data having a plurality of values and positions corresponding thereto in the runlength compression data. The index closest to the desired position in the original data and an offset of the desired position from the index are found. Based on the index correspondence information, the corresponding index in the runlength compression data is found. The position corresponding to the desired position is then found in the runlength compression data, based on the corresponding index and the offset.

Abstract: A decoding apparatus for arithmetically decoding input coded data into symbol data by using a state variable and a context variable includes: a first decoding unit executes arithmetic decoding processing by using the state variable and the context variable and outputs first symbol data, and outputs the state variable and the context variable, which are updated by the arithmetic decoding processing, as a first state variable and a first context variable; and a second decoding unit executes arithmetic decoding processing by using the first state variable and the first context variable and outputs second symbol data, and outputs the first state variable and the first context variable, which are updated by the arithmetic decoding processing, as a second state variable and a second context variable. Whether to employ the second symbol data as a decoding result is determined based on the value of the first state variable.

Abstract: A decoding apparatus includes a state variable calculation unit which calculates a second state variable based on a first context variable and a first state variable which are stored in a first memory unit and a second memory unit, respectively, and determines a selection signal representing a symbol as a result of arithmetic decoding processing. A context variable calculation unit calculates a second context variable based on the first context variable and the selection signal and updates the first memory unit. A re-normalization unit calculates a third state variable by using the coded data and the second state variable and updates the second memory unit. The state variable calculation unit outputs the determined selection signal that is usable in processing of a succeeding step without waiting for the operations of the context variable calculation unit and the re-normalization unit.

Abstract: A telecommunications network comprises a sending entity (22) and a receiving entity (24) which communicate over a radio interface (26). The sending entity (22) comprises a compressor (40) and a message formatter (34). The compressor (40) in turn comprises a sending entity compression dictionary (60) and dictionary update decision logic (62). The compressor (40) compresses a message to obtain a compressed message to be sent over the radio interface (26) to the receiving entity (24) and also determines a compression factor for the message. The compression factor is based on similarity of the message to contents of the sending entity compression dictionary. The dictionary update decision logic (62) makes a decision whether the compression factor justifies updating of a receiving entity decompression dictionary (70). The message formatter (34) includes, in the compressed message, an update indication regarding the decision.

Abstract: A system adapted for use, e.g. in an MPEG audio-video decoder for decoding variable-length (e.g. Huffman) encoded codewords, each having associated a respective set of sign bits. The system operates on the basis of a signed decoding codebook including extended signed codewords. Each extended codeword includes a respective codeword in the original codebook plus the associated set of sign bits. The variable-length encoded codewords are decoded on the basis of the signed decoding codebook, whereby the codewords are decoded together with the sign bit set associated therewith. Preferably, the codewords are partitioned in “short” and “long” codewords with respect to a given threshold. The short codewords are decoded by means of a single lookup step in a first lookup table. The long words are decoded by means of a multi-step lookup process involving at least one second lookup table. The lookup tables are preferably arranged as nested lookup tables within a container table.

Abstract: A system including a buffer, a feedback loop configured to generate a fractional delay from a ratio of a first number of samples written into the buffer to a second number of samples read from the buffer, and a variable fractional delay filter configured to generate an output sample using a plurality of input samples and the fractional delay is provided.

Abstract: An asynchronous sample rate converter including a feedback loop configured to generate a control signal corresponding to an output sample rate that is synchronous with an output clock signal and a normalized time distance value corresponding to a plurality of input samples and an interpolator configured to generate an output sample in response to receiving the control signal using the normalized time distance value and outputs of at least two polyphase filter components that are generated from at least the plurality of input samples is provided.

Abstract: Methods and apparatus for entropy decoding are disclosed. Compressed input data representing one or more signals is loaded into one or more registers. A first candidate value for a most probable signal case is prepared from the input data. A second candidate value for a least probable signal case is prepared from the input data. A final signal value for the one or more signals is selected from the first and second candidate values and an output bin value is generated based on the final signal value. A processor readable medium having embodied therein processor readable instructions for implementing the method for entropy decoding is also disclosed. In addition, a method of avoiding a branch instruction in an electronic processing algorithm is disclosed.

Abstract: A method of selectively run length encoding data may include removing a trigger value from one or more data elements if the trigger value is present in the one or more data elements and calculating a run length of the one or more data elements. The method may also include encoding the one or more data elements as a command pair when the run length is greater than two. The command pair may include the trigger value. The one or more data elements may be output without encoding the one or more data elements when the run length is not greater than two.

Abstract: A communications channel comprises a seed selector that selectively removes X M-bit symbols of user data from a seed set comprising Y M-bit symbols and that selects a scrambling seed from Y-X symbols remaining in the seed set, where X, Y and M are integers greater than one. A Hamming weight coding device that determines a Hamming weight of symbols of scrambled user data that are generated based on the user data and the selected scrambling seed and that selectively codes the symbols depending upon the determined Hamming weight.

Abstract: A system and a method of suppressing outstanding degradation of decoded audio quality due to a transmission error of audio coded data are provided without feedback information from a receiver, thereby reducing the increase of the number of necessary transmission bands and the arithmetic complexity on the receiving side. A code conversion and transmission apparatus 100 for inputting audio coded data includes first to N-th code conversion and transmission units 102 and 104 to 106 for converting audio data to N pieces of coded data, and transmitting the data at predetermined or adaptively variable time intervals to M transmission lines 130. The second to N-th audio code conversion and transmission units 104 to 106 codes a frame at a compression rate equal to or higher than the rate of input coded data.

Abstract: A method of relocating the header compression context in a packet network which transmits packets having compressed headers. A connection is established between a mobile terminal and a first network entity and context information used with compression and decompression of the headers of the packets is stored at the mobile terminal and the first network entity. The context information updating is stopped in the mobile terminal and in the first network entity and after that, a snapshot of the compression and decompression context information is taken and stored in the first network entity. The connection between the first network entity and the mobile terminal is changed to a connection between the mobile terminal and a second network entity. The context information snapshot stored by the first network entity is transferred to the second network entity to be stored therein as the context information of the second network entity.

Abstract: A resampling detection apparatus for receiving a plurality of input signals composing a digital signal, and detecting whether the digital signal is a resampled signal, includes an estimation section that estimates a signal before resampling for the digital signal from one or more input signals, and a detecting section detects whether the digital signal is a resampled signal, using the estimated signal and one or more input signals.

Abstract: Embodiments include systems and methods of improving processing in a decoder in a multimedia transmission system. Multimedia data may include one or more of motion video, audio, still images, or any other suitable type of audio-visual data. One embodiment includes a system and method of parsing fixed and variable length codes from a bit-wise stream of multi-media data by maintaining and reading the data in a processor aligned (e.g., word aligned) way. Another embodiment includes a system and method of decoding variable length codes, particular as received from such a variable length code using multiple levels of decoding tables to speed up decoder table lookup.

Abstract: Digital filtering and sample rate conversion blocks are combined in order to reduce hardware and/or computational complexity. Input data samples provided at a first sample rate are converted to output data samples at a second sample rate unequal to the first sample rate. An Infinite Impulse Response filter having internal states are updated at the first sample rate filters the input data samples in, to produce filtered data samples at the first sample rate. Output data samples are output at the second sample rate, where each output data sample is created as the sum of at least two intermediate products, a first intermediate product and a second intermediate product.

Abstract: An apparatus for data recovery includes a multi-level comparison unit, a detection logic unit, and a data composer. The multi-level comparison unit compares an input signal with M different reference signal levels to generate M digital data, the number M being greater than or equal to 2. The detection logic unit is coupled to the multi-level comparison unit, and performs logic operations upon specified lengths over the M digital data obtained from the multi-level comparison unit. The data composer is coupled to the multi-level comparison unit and the detection logic unit. The data composer generates recovered data conforming with a run length encoding constraint based on the M digital data obtained from the multi-level comparison unit and the result obtained from the detection logic unit.

Abstract: A communications channel includes a buffer that receives symbols of user data including a plurality of M-bit symbols. A seed selector receives the M-bit symbols of the user data, selectively removes symbols of the user data from a seed set, and selects a scrambling seed from symbols remaining in the seed set. A scrambling device that communicates with the seed selector and the data buffer generates scrambled user data using the user data and the selected scrambling seed. A Hamming weight coding device determines a Hamming weight of symbols of the scrambled user data and selectively codes the symbols depending upon the determined Hamming weight.

Abstract: An efficient data-directed scrambler is provided for processing digital signals having an unequally-weighted code. The data-directed scrambler includes inputs for receiving unequally-weighted bits of an input signal, outputs for supplying N scrambled bits of an output signal, and two or more scrambler columns connected in series between the inputs and the outputs. One or more of the scrambler columns includes a swapper cell and a digital fanout. Least significant bits in the unequally-weighted code are input to a swapper cell, and higher order bits in the unequally-weighted code are input to respective digital fanouts. In the other embodiments, an efficient data-directed scrambler is provided for processing digital signals having an equally-weighted code.

Abstract: A system and a method of suppressing outstanding degradation of decoded audio quality due to a transmission error of audio coded data are provided without feedback information from a receiver, thereby reducing the increase of the number of necessary transmission bands and the arithmetic complexity on the receiving side. A code conversion and transmission apparatus 100 for inputting audio coded data includes first to N-th code conversion and transmission units 102 and 104 to 106 for converting audio data to N pieces of coded data, and transmitting the data at predetermined or adaptively variable time intervals to M transmission lines 130. The second to N-th audio code conversion and transmission units 104 to 106 codes a frame at a compression rate equal to or higher than the rate of input coded data.

Abstract: A communications channel includes a buffer that receives user data symbols including a plurality of M-bit symbols. A seed selector receives the plurality of M-bit symbols, selectively removes symbols from a seed set based on Hamming distances between at least two of the M-bit symbols, and selects a scrambling seed from remaining symbols in the seed set. A scrambling device that communicates with the seed selector and the data buffer generates scrambled user data based on the user data symbols and the scrambling seed. The communications channel is implemented in a data storage system. The seed selector ensures a minimum Hamming weight of 15 percent in the scrambled user data. The seed selector compares first and second user data symbols in the plurality of M-bit symbols.

Abstract: The invention is a system and method for processing a compressed data stream. The compressed data stream has a first group of source segments and a second group of source segments. For the first group of source segments, it is not necessary to decompress the source segments during the processing, and only status thereof, like timestamps, are needed to be modified. Comparatively, for the second group of source segments, it is necessary to decompress the source segments for successive manipulation. A recompression is the processed on the manipulated data segments. Finally, the resulting first group and second group of segments are combined together to generate a processed compressed data stream. Because of unnecessary decompression and recompression are dispensed with, significant efficiency is obtained and less error propagation occurs during processing the compressed data stream.

Abstract: A data converter (1) capable of reducing a size of the total implementation in a device is a processing apparatus that performs secret converting processing predetermined to input data with 64 bits, the data converter including a finite field polynomial cubing unit (10), data integrating units (11a) to (11d), (12) and (13), a first converter (14), a second converter (15), a data splitting unit (16), and a data integrating unit (17). The finite field polynomial cubing unit (10) performs cubing, on the 32 bits data, in the polynomial residue class ring with a value in the finite field GF (28) as a coefficient and respectively outputs data with 32 bits.