Technologies for compressing a blockchain. In some examples, the technologies include removing selected blocks within a blockchain, and replacing the selected blocks with a summary block and a padding block. Each block of the selected blocks includes data in a certain state (such as data in an obsolete state). The technologies can include generating the summary block and padding blocks according to the data in the selected blocks and an original root hash included in the selected blocks and other blocks of the blockchain. The generating of the summary and padding blocks can include generating a new root hash in the summary and padding blocks that only replaces the original root hash in the summary and padding blocks. The generation of the new root hash can be based on a part of a header of a non-selected block of the blockchain directly linked to an end block of selected blocks.

An embodiment of the present invention is a prime representation data structure in a computer architecture. The prime representation data structure has a plurality of records where each record contains a prime representation and where the prime representation is a product of two or more selected prime factors. Each of the selected prime factor associated with an n-gram of a domain representation of a domain string. The domain representation of the domain string is a domain string of ordered, contiguous domain characters. The n-gram being a subset of n number of the ordered, contiguous domain characters in the domain string. The computer architecture performs string searching and includes one or more central processing units (CPUs) with one or more operating systems, one or more input/output device interfaces, one or more memories, and one or more input/output devices. The architecture further includes the prime representation data structure, one or more prime target query data structures and a search process performed by one or more of the CPUs. The CPUs can be organized in a hierarchical structure. The prime target query data structure has one or more target prime queries. Each target prime query is the product of one or more target selected prime factors. Each target selected factor is associated with a target n-gram of a target domain representation of a target domain string. The search process, performed by one or more of the CPUs, determines whether one or more of the target selected prime factors is common with one of the selected prime factors. By performing this efficient testing, the computer system can determine if one or more small strings are included in one or more large strings.

A method and a device for matching a quantization table of data representative of a radio signal received by a radio antenna of a mobile network. The method includes: obtaining an item of information representative of a channel decoding error rate of a decoded quantized demodulated signal from a demodulation of the radio signal received by the antenna, the demodulated radio signal having been quantized by the quantization table, and the quantized demodulated radio signal having undergone a channel decoding; matching the quantization table when the channel decoding error rate is higher than a determined threshold; and transmitting an item of information representative of the matching of the quantization table to a channel decoding device or to a demodulation device.

A computer-implemented method for compressing a data set, the method comprising receiving a first data block of the data set, selecting automatically by a compression management module a compression module from a plurality of compression modules to apply to the first data block based on projected compression efficacy or resource utilization, and compressing the first data block with the selected compression module to generate a first compressed data block.

A method for compressing IQ data for high speed transport link and an associated device. The method comprises: determining, based on dynamical statistical distribution of the IQ data, one or more parameters of a companding function for a nonlinear companding operation (S310); applying the companding function with the determined one or more parameters on the IQ data (S320); performing uniform quantization on the IQ data to generate compressed IQ data (S330); and transmitting the compressed IQ (S340). And a method for decompressing compressed IQ data for high speed transport link, and an associated device.

A method for compressing IQ data for high speed transport link and an associated device. The method comprises: determining, based on dynamical statistical distribution of the IQ data, one or more parameters of a companding function for a nonlinear companding operation (S310); applying the companding function with the determined one or more parameters on the IQ data (S320); performing uniform quantization on the IQ data to generate compressed IQ data (S330); and transmitting the compressed IQ (S340). And a method for decompressing compressed IQ data for high speed transport link, and an associated device.

Disclosed is a transmission device capable of reducing quantization errors in nonlinear quantization of IQ signals. In the device, a standard deviation measuring unit measures a standard deviation σ of the amplitude distribution of input signals. A kurtosis measuring unit measures the kurtosis of the amplitude distribution of the input signals. A correction coefficient determining unit determines a correction coefficient α corresponding to the kurtosis of the amplitude distribution of the input signals. A quantization unit quantizes the input signals using the correction coefficient α and calculates quantization data. A multiplexing unit multiplexes the quantization data and quantization control information with each other.

Embodiments are directed to a companding method and system for reducing coding noise in an audio codec. A method of processing an audio signal includes the following operations. A system receives an audio signal. The system determines that a first frame of the audio signal includes a sparse transient signal. The system determines that a second frame of the audio signal includes a dense transient signal. The system compresses/expands (compands) the audio signal using a companding mle that applies a first companding exponent to the first frame of the audio signal and applies a second companding exponent to the second frame of the audio signal, each companding exponent being used to derive a respective degree of dynamic range compression and expansion for a corresponding frame. The system then provides the companded audio signal to a downstream device.

A method for quantizing data representative of a radio signal received by a radio antenna of a mobile network. The method includes: demodulating the radio signal received by the antenna, providing a demodulated signal; scalar quantizing each value of the demodulated signal using a quantization table selected according to a channel coding level used to transmit the radio signal, providing a quantized demodulated signal; and transmitting the quantized demodulated signal to a channel decoding module.

Embodiments are directed to a companding method and system for reducing coding noise in an audio codec. A method of processing an audio signal includes the following operations. A system receives an audio signal. The system determines that a first frame of the audio signal includes a sparse transient signal. The system determines that a second frame of the audio signal includes a dense transient signal. The system compresses/expands (compands) the audio signal using a companding rule that applies a first companding exponent to the first frame of the audio signal and applies a second companding exponent to the second frame of the audio signal, each companding exponent being used to derive a respective degree of dynamic range compression and expansion for a corresponding frame. The system then provides the companded audio signal to a downstream device.