Abstract: The invention relates to a method for reducing a Cognitive Pilot Channel (CPC) bandwidth used for transmitting lists of information to a plurality of meshes of a geographical area comprising at least one base station (4) covering n meshes to allow a User Equipment camping on a given mesh among said plurality of meshes to select an operator and/or an access technology and/or a communication frequency available in said given mesh. According to the invention, for a given mesh #i (i=2 to n), the base station transmits to said mesh #i an identifier of a predetermined reference mesh and the difference between the list of information intended for said given mesh and the list of information intended for said reference mesh.

Abstract: Provided is a transmitter for transmitting signals by means of the STBC method or the DSTBC method, wherein communication is carried out effectively. The transmitter for transmitting signals by means of the STBC method or the DSTBC method has the following configuration. A frame in which synchronization words are arranged at specified positions is used. An encoding means in the transmitter encodes the entire frame to be transmitted including the synchronization words, by means of the STBC method or the DSTBC method. It is also possible to implement a communication system and a communication method for communicating signals by means of the STBC method or the DSTBC method.

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

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

Abstract: A method and apparatus for symbol-space based compression of patterns are provided. The method comprises receiving an input sequence, the input sequence being of a first length and comprising a plurality of symbols; extracting all common patterns within the input sequence, wherein a common pattern includes at least two symbols; generating an output sequence responsive of the extraction of all common patterns, wherein the output sequence has a second length that is shorter than the first length; and storing in a memory the output sequence as a data layer, wherein the output sequence is provided as a new input sequence for a subsequent generation of a data layer.

Abstract: A signal processing device is provided, including a prediction error calculating unit that calculates an error signal between a left signal l(n) and a prediction signal of the left signal l (n) predicted from a right signal r(n), a gain adjusting unit that makes a gain adjustment and outputs an error signal, a first adder that adds the left signal l(n) and the error signal and outputs, and a second adder that adds the right signal r(n) and the error signal in opposite phase and outputs.

Abstract: A data processing device includes a clock converter, a data converter, and an error detector. The clock converter is configured to receive a first clock signal, convert the first clock signal into a second clock signal, and output the second clock signal. The data converter is configured to receive first data, convert the first data into second data using the second clock signal, and output the second data. The error detector is configured to check whether the first clock signal is in a first clock state or a second clock state upon the first data transitioning to a first data state, and output an enable signal to the clock converter upon determining that the first clock signal has transitioned to the first clock state from the second clock state.

Abstract: A computer-implemented method for compressing data is disclosed. The method starts with determining a way to read a received data block in its native endian format of at a storage system, where the data block contains a set of data and the determination is based on sampling a subset from a set of data and checking variation of the values. The method selects a base value for the data block based on the determined way to read the data block and generates a set of updated data, where each value of the set of updated data corresponds to the base value and an original value. The method separates each data within the set of updated data into two portions with different bit-value distribution patterns and compresses one portion with a first algorithm while compresses another portion with a second algorithm different from the first.

Abstract: A method and an apparatus for encoding and decoding audio signals using adaptive sinusoidal coding are provided. The audio signal encoding method includes the steps of dividing a synthesized audio signal into a plurality of sub-bands, calculating the energy of each sub-band, selecting a predetermined number of sub-bands having a relatively large amount of energy from the sub-bands, and performing sinusoidal coding with regard to the selected sub-bands. Application of sinusoidal coding based on consideration of the amount of energy of each sub-band of the synthesized signal improves the quality of the synthesized signal more efficiently.

Abstract: A data packing apparatus for continuously receiving current data is provided. The apparatus includes N barrel shifters, a controller and a packing module. The controller determines a shift amount according to a length of previous residual data, and controls the N barrel shifters to sequentially perform M barrel shifts on current merging data to achieve the shift amount, noting that N is an integer greater than or equal to two, and M is a natural number smaller than or equal to N. The packing module merges the previous residual data and the current merging data passed through the N barrel shifters. The maximum shift amounts of the M barrel shifts are smaller than a threshold associated with a length of an operation cycle. The current merged data is a part or all of the current data.

Abstract: Digital methods and systems for signal processing and filtering are provided. The methods and corresponding systems provide asynchronous conversion of sampling rate frequencies and utilize advanced multistage phasor filters for converting an input signal having a first sampling rate into an output signal sampled in an arbitrary sequence of sampling times. The conversion process provides a sequence of sets of complex numbers representing a filtered version of the input signal. More specifically, the conversion process includes the calculation of values of the output signal by multiplying (e.g., scaling) the sets of complex numbers by a corresponding set of complex phasors, the complex phasors corresponding to the timing of the arbitrary time sequence to obtain a corresponding set of real results with the value of the output signal being the sum of the real results.

Abstract: Disclosed are systems and methods used in motion estimation and particularly for data compression. Embodiments of the invention may store and operate on an n-bit value in less than n bits. In one embodiment, if the multi-bit value is less than a threshold, then the multi-bit value is stored in the reduced-bit storage directly, with no loss of precision. If the multi-bit value is greater than the threshold, then the Most Significant Bits (MSBs) of the multi-bit value are shifted onto the reduced-bit storage, and a compression flag set. To decompress, if the compression flag was not set, the bits stored in the reduced-bit storage are merely copied back into the multi-bit value directly. If the compression flag was set, then the bits stored in the reduced-bit storage are shifted (left) by the same amount they were shifted (right) during compression, and an error-minimizing value is added.

Abstract: A decoder reads an instruction for information specifying a bit sequence storage area, information indicating a first bit range, and information indicating a second bit range that is contiguous with the first bit range, then outputs a decoded signal in response to the information so read, and a bit manipulation circuit generates and outputs an output sequence based on a bit sequence stored in the bit sequence storage area by inserting uniform predetermined values between a first bit range and a second bit range in accordance with the decoded signal output from the decoder.

Abstract: Unpacking a variable number of data bits is provided. A structure includes an input port operable to receive one or more input data units including a plurality of packed bits of data, each of the one or more input data units including a header and a payload, the header including a predetermined number of bits and identifying a format of the payload and a length of the payload, and the payload including a variable number of bits. The structure further includes a circuit operable to identify and unpack the one or more input data units based on the header and the payload of each of the one or more input data units. The structure further includes an output port operable to transmit one or more output data units including the unpacked one or more input data units, once per clock cycle.

Abstract: A data compression system comprising a transmit side having a first receive interface adapted to receive a first quantity of data from a first channel and a compression controller coupled to the first receive interface, a lossless compression controller, and a bandwidth monitor, the lossy compression controller and the bandwidth monitor coupled to a first transmit interface adapted to transmit a compressed first quantity of data into a second telecommunication channel wherein the bandwidth monitor evaluates the bandwidth of the second telecommunication channel and communicates with the compression controller.

Abstract: A data packing apparatus for continuously receiving current data is provided. The apparatus includes N barrel shifters, a controller and a packing module. The controller determines a shift amount according to a length of previous residual data, and controls the N barrel shifters to sequentially perform M barrel shifts on current merging data to achieve the shift amount, noting that N is an integer greater than or equal to two, and M is a natural number smaller than or equal to N. The packing module merges the previous residual data and the current merging data passed through the N barrel shifters. The maximum shift amounts of the M barrel shifts are smaller than a threshold associated with a length of an operation cycle. The current merged data is a part or all of the current data.

Abstract: Unpacking a variable number of data bits is provided. A structure includes an input port operable to receive one or more input data units including a plurality of packed bits of data, each of the one or more input data units including a header and a payload, the header including a predetermined number of bits and identifying a format of the payload and a length of the payload, and the payload including a variable number of bits. The structure further includes a circuit operable to identify and unpack the one or more input data units based on the header and the payload of each of the one or more input data units. The structure further includes an output port operable to transmit one or more output data units including the unpacked one or more input data units, once per clock cycle.

Abstract: A compression system configured to compress logical data objects into one or more accommodation blocks with a predefined size, and a method of operating thereof are provided. The compression system includes a compression engine capable of compressing input data with the help of sequential encoding one or more input strings and a counter operatively coupled to the compression engine. The counter is configured to keep its ongoing value indicative of a number of input bytes in one or more strings successfully encoded into a given accommodation block; and, responsive to unsuccessful compression of a string into the given accommodation block, to provide the compression engine with information indicative of starting point in the input stream for encoding into the next accommodation block, thus giving rise to a “start indication.

Abstract: A decoder reads an instruction for information specifying a bit sequence storage area, information indicating a first bit range, and information indicating a second bit range that is contiguous with the first bit range, then outputs a decoded signal in response to the information so read, and a bit manipulation circuit generates and outputs an output sequence based on a bit sequence stored in the bit sequence storage area by inserting uniform predetermined values between a first bit range and a second bit range in accordance with the decoded signal output from the decoder.

Abstract: Disclosed are systems and methods used in motion estimation and particularly for data compression. Embodiments of the invention may store and operate on an n-bit value in less than n bits. In one embodiment, if the multi-bit value is less than a threshold, then the multi-bit value is stored in the reduced-bit storage directly, with no loss of precision. If the multi-bit value is greater than the threshold, then the Most Significant Bits (MSBs) of the multi-bit value are shifted into the reduced-bit storage, and a compression flag set. To decompress, if the compression flag was not set, the bits stored in the reduced-bit storage are merely copied back into the multi-bit value directly. If the compression flag was set, then the bits stored in the reduced-bit storage are shifted (left) by the same amount they were shifted (right) during compression, and an error-minimizing value is added.

Abstract: Circuitry for scaling data from a first width (e.g., number of simultaneously presented parallel data signals) to a second width can preferably operate for any of a wide range of different ratios between the first and second widths (including ratios that are non-integer or even non-rational) without the need for more than one clock signal.

Abstract: An electronic device provides electronic access to a dataset representing meaningful information. The electronic device generates a first subset permutation based on a first subset of the dataset, and generates a second subset permutation based on a second subset of the dataset. Each subset of the dataset includes a series of data elements having a particular fixed bit-length. The first subset permutation includes a rearrangement of the series of data elements of the first subset. Similarly, the second subset permutation includes a rearrangement of the series of data elements of the second subset. The electronic device further forms an electronic aggregation based on the first subset permutation and the second subset permutation, and generates an aggregation permutation based on the electronic aggregation. The aggregation permutation includes a rearrangement of portions of the electronic aggregation. The meaningful information is fully recoverable from the aggregation permutation.

Abstract: In a method and device for encoding and/or decoding a sequence of discrete source values (Si) sub-groups (Gi) of a number of successive source values are taken from the sequence of source values. The sub-groups of source values are encoded into packets, comprising in each case an initial value (S1) corresponding to a first source value in a sub-group, a standardization factor (R) and difference values (?Si), standardized in accordance with the standardization factor, between values corresponding with other source values (Si) in the sub-group and in each case a value corresponding with a preceding source value (Si-1) in the sub-group. A standardization factor (R) is determined per packet subject to a greatest difference value (?max) within the sub-group between a source value and a preceding source value. The invention also relates to an information carrier provided with a thus encoded sequence of source values.

Abstract: ASCII input data to be packed into memory is obtained. The ASCII input data includes a plurality of blocks of ASCII data. wherein each block of ASCII data includes a plurality of ASCII characters. A block of ASCII data to he packed is selected. The selected block is chosen from the plurality of blocks of ASCII data and includes a plurality of bytes of data. One or more operations are performed on the selected block of ASCII data to obtain a plurality of bytes of packed data. The selecting and the performing are repeated one or more times for a next selected block to obtain a packed array for the input data.

Abstract: A system and method of compression is disclosed that includes the generation of position codes based on positions of individual codes. Individual codes having the same value are adjacent in the position code and are separated by a spacer code. The position codes can be generated from individual codes in increasing value or decreasing value of the individual codes. The position code can be prefixed by a maximum value of the individual codes or prefixed by a total number of the individual codes. The individual codes can be representative of an audio or a video data stream.

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 selected channel of a multi-channel signal represented by frames composed from sampling values having a high time resolution is provided that can be encoded with higher quality when a wave form parameter representation representing a wave form of an intermediate resolution representation of the selected channel is derived. The wave form parameter representation with the intermediate resolution can be used to shape a reconstructed channel to retrieve a channel having a signal envelope close to a selected original channel. The time scale on which the shaping is performed is shorter than the time scale of a framewise processing, thus enhancing the quality of the reconstructed channel. On the other hand, the shaping time scale is larger than the time scale of the sampling values, significantly reducing the amount of data needed by the wave form parameter representation.

Abstract: A system for transmitting digital data representing an original over plural transmission links, at least some of which have limited bandwidth, including a digital data source storing digital data representing the original, a digital data receiver receiving the digital data representing the original via one of the plural transmission links having limited bandwidth and a digital data transmitter operative to transmit the digital data representing the original to the receiver over a transmission link having a limited bandwidth in plural blocks which are sequentially transmitted at a rate determined by the limited bandwidth, each block being an incomplete collection of data which includes parts of multiple frames, each frame being viewable in a selectable order by the receiver even when less than all of the plural blocks have been received, receipt of subsequent blocks by the receiver being used to cumulatively improve the quality of the digital data viewed by the receiver.

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: Disclosed is an apparatus in which there are provided a first storage unit for storing signals to which indexes are given in order to distinguish each of a plurality of signals that are to be coded; a first index computing unit for computing first indexes of non-zero signals among the signals stored in the first storage unit; a second index computing unit for computing second indexes from a base index and the first indexes; a second index storage position search unit for searching for a storage position in a second storage unit in which the second indexes are to be stored based on values of the indexes stored in the second storage unit; a second index preserving unit for preserving the second index in the second storage unit based on a storage position searched for by the second index storage position search unit; and a control unit for giving the base index to the second index computing unit and for controlling operation of the first index computing unit, the second index computing unit the second index stor

Abstract: The invention relates to a compressed data managing system and method for circular buffer. By using the system and method of the invention, when storing the compressed data in a circular buffer and an event occurs, the hardware compression mechanism can stop immediately, without jeopardizing the decompression of the compressed data. Therefore, the system and method of the invention can overcome the following conventional problem: Conventional real-time tracers need several cycles to write the compressed data into the trace memory, which is unbeneficial to error diagnosis. Since when an error occurs, the system might enter the unstable state, this could cause that the tracers fail to write the last compressed data into the trace memory.

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: Briefly, in accordance with one embodiment, a method of data compression is disclosed.

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 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: A seed generator for a scrambler comprises a seed set identifier that identifies a seed set based on received user data symbols, which include a plurality of M-bit symbols. A seed selector selects a scrambling seed for the scrambler from the seed set based on Hamming distances between at least two of the M-bit symbols in the seed set.

Abstract: One embodiment of the present invention provides an apparatus for compressing data, comprising a compression mechanism which includes N channels. During operation, the compression mechanism receives a set of data words from an input bit-stream, compresses the data words into a set of variable-length words, and stores an I-th variable-length word in the set of variable-length words into a fixed-packet for an I-th channel. Then, the compression mechanism assembles each fixed-length packet into an output stream when the packet becomes full. Some other embodiments of the present invention provide an apparatus for data decompression, comprising a parallel-processing mechanism which includes N decompression mechanisms.

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: The described embodiments include a system for performing data compression. The system includes a compression mechanism with N channels, and an internal decompression mechanism in the compression mechanism that accepts N channels of fixed-length packets. The compression mechanism is configured to receive an input bit stream that includes a set of data words. In response to receiving a request from the internal decompression mechanism identifying at least one of the channels for which a fixed-length packet is to be appended to the output stream, the system fills a fixed-length packet for the identified channel with compressed data words; appends the fixed-length packet to the output stream; and forwards a copy of the fixed-length packet to the internal decompression mechanism. The internal decompression mechanism decompresses fixed-length packets for each of the channels to determine a next fixed-length packet to be appended to the output stream.

Abstract: A multi-mode multi-parallelism data exchange method and the device thereof are proposed to apply to a check node operator or a bit node operator. The proposed method comprises the steps of: duplicating part or all of an original shift data as a duplicated shift data; combining the original shift data and the duplicated shift data to form a data block; and using a data block as the unit to shift this data block so as to conveniently retrieve shift data from the shifted data block. With a maximum z factor circuit and duplication of part of data, specifications of different shift sizes can be supported. The functions of shifters of several sizes can therefore be accomplished with the minimum complexity.

Abstract: Methods of encoding and decoding a multi-channel audio signal and apparatuses for encoding and decoding a multi-channel audio signal are provided. The apparatus for decoding a multi-channel audio signal includes an unpacking extracting which extracts a pilot and data regarding a quantized CLD between a pair of channels of the plurality of channels from the bitstream, a differential decoding unit which restores a quantized CLD by adding the extracted pilot to the extracted data, and an inverse quantization unit which inversely quantizes the restored quantized CLD using a quantization table that considers the location properties of the pair of channels. The methods of encoding and decoding a multi-channel audio signal and the apparatuses for encoding and decoding a multi-channel audio signal can enable an efficient encoding/decoding by reducing the number of quantization bits required.

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: The described embodiments include a system for performing data compression. The system includes a compression mechanism with N channels, and an internal decompression mechanism in the compression mechanism that accepts N channels of fixed-length packets. The compression mechanism is configured to receive an input bit stream that includes a set of data words. In response to receiving a request from the internal decompression mechanism identifying at least one of the channels for which a fixed-length packet is to be appended to the output stream, the system fills a fixed-length packet for the identified channel with compressed data words; appends the fixed-length packet to the output stream; and forwards a copy of the fixed-length packet to the internal decompression mechanism. The internal decompression mechanism decompresses fixed-length packets for each of the channels to determine a next fixed-length packet to be appended to the output stream.

Abstract: A coding apparatus that codes video data using an arithmetic coding scheme such as the AVC standard includes an orthogonal transformation unit, a quantizer, an arithmetic coder, and a controller. The arithmetic coder includes a binarization unit, a binary arithmetic coder, and a code length predictor. The code length predictor outputs a predicted number of bits by evaluating a predictive function using, as the argument of the function, the bin size of the binary symbols generated from input data during coding. The controller controls the coding bit rate by changing the quantization scale of the quantizer on the basis of the predicted number of bits. The predictive function is defined such that the predicted number of bits increases as the bin size increases, and furthermore such that the polynomial degree of the function changes when the bin size exceeds a predefined threshold value.

Abstract: An apparatus for processing a signal and method thereof are disclosed. Data coding and entropy coding are performed with interconnection, and grouping is used to enhance coding efficiency. The present invention includes the steps of obtaining index information and data and entropy-decoding the index information and identifying an entropy table corresponding to the entropy-decoded index information and entropy-decoding the data using the identified entropy table.

Abstract: A method of data compression for use in a data communication's system for an electrical utility or the like to affect the most efficient transfer of data. The data is first formed into a forming a block (B). A parameter (M) is selected from among a group of parameters. Each data value in the block is divided by the selected parameter to produce, for each data value, a quotient (q=?n/M?) and a remainder (r=n?qM). The quotient of each data value is encoded using unary coding in which the value for the quotient is encoded by transmitting an appropriate number of zeroes followed by a one. The remainder of each data value is encoded using binary encoding, and the resultant encoded block of data is then transmitted. The data values comprising the block of data are positive integer values and the encoding employs a Golomb-Rice code defined by a positive integer parameter.

Abstract: A method and system for decompressing a compressed file is disclosed in this invention, the method comprising: reading a compressed data block from the compressed file; decompressing the compressed data block; outputting the decompressed data for storage into a decompressed file; deleting the compressed data block that was decompressed from the compressed file. The proposed method and system in this invention can reduce the unnecessary repeated data between compressed data and decompressed data. The storage space requirement will be reduced during decompression, and the existing compression/decompression algorithms need not be changed by using this invention. Thus, this invention is easy to be integrated into existing compression/decompression tools.

Abstract: A method and apparatus for improved efficiency in protocols using character coding have been disclosed.

Abstract: A technique for encoding 9-binary symbol (9B) source vectors into 10-binary symbol (10B) encoded vectors include the steps of obtaining a plurality of 9B source vectors, and encoding the 9B source vectors into a plurality of 10B encoded vectors according to an encoding scheme. A fraction of the 10B encoded data vectors have binary symbol changes, other than whole-vector complementation, compared to corresponding ones of the 9B source vectors, the fraction not including any disparity dependent encoded representations. Techniques for encoding 7B source vectors to 8B encoded vectors, and decoding techniques, are also provided.

Abstract: Several code detectors in parallel simultaneously examine varying overlapping segments of a data stream containing variable length codes, referred to as a data window. The data window segments directly address memory structures within each of the code detectors without any previous logic stages. Each code detector is responsible for a range of code lengths, and ignores data window bits that are not relevant to its code length range. Each code detector outputs a possible result to a layer of logic that selects the possible result of the single code detector which contains result data corresponding to a variable length code in the data window.