A network node signals to a wireless communication device which precoders in a codebook are restricted from being used. The network node in this regard generates codebook subset restriction signaling that, for each of one or more groups of precoders, jointly restricts the precoders in the group by restricting a certain component (e.g., a certain beam precoder) that the precoders in the group have in common. This signaling may be for instance rank-agnostic signaling that jointly restricts the precoders in a group without regard to the precoders transmission rank. Regardless, the network node sends the generated signaling to the wireless communication device.

A method, article comprising machine-readable instructions and apparatus that processes data systems for encoding, decoding, pattern recognition/matching and data generation is disclosed. State subsets of a data system are identified for the efficient processing of data based, at least in part, on the data system's systemic characteristics.

A method, article comprising machine-readable instructions and apparatus that processes data systems for encoding, decoding, pattern recognition/matching and data generation is disclosed. State subsets of a data system are identified for the efficient processing of data based, at least in part, on the data system's systemic characteristics.

A data compression apparatus includes a receiver that outputs sampling sequences corresponding to signals obtained by adding different delay times to different signals obtained by branching a target signal into a plurality of lines, and sampling the signals at a sampling rate less than the Nyquist rate, and an encoder that converts the sampling sequences into compressed data. The encoder includes a sub-FFT that converts the sampling sequences into frequency-domain signals, a signal processing unit that performs, at one time, phase compensation processing for sub-Nyquist zones of the sampling sequences, and processing to cancel phase rotation, a target frequency estimator that determines into which sub-Nyquist zone the target signal has been folded and estimates the frequency of the target signal, and an encoding unit that converts a value representing the sub-Nyquist zone and the corresponding amplitude value into the compressed data and output the compressed data.

Disclosed approaches for accumulating pre-carry data include initializing hold sum to a sum of a LSB of the first pre-carry word of an input stream and an MSB of a second pre-carry word by a pre-carry processing circuit. For successive pre-carry words, the LSB of pre-carry word i and the MSB of pre-carry word i+1 are summed into a next sum. An FFcount is incremented by an adder circuit if the LSB of the next sum is equal to 0xFF. If the LSB of the next sum is not equal to 0xFF, the pre-carry processing circuit outputs either: the hold sum followed by FFcount consecutive 0xFF values, if the MSB of the next sum is equal to 0x00, or the hold sum plus one, followed by FFcount consecutive 0x00 values, if the MSB of the next sum is not equal to 0x00. If the LSB of the next sum is not equal to 0xFF, the hold sum is updated with the LSB of the next sum, and the FFcount is reset to 0. Processing repeats for successive pre-carry words in the stream.

A method of compressing image data comprising a set of image values each representing a position in image-value space so as to define an occupied region thereof. The method comprises selectively applying a series of compression transforms to subsets of the image data items to generate a transformed set of image data items occupying a compacted region of value space. The method further comprises identifying a set of one or more reference data items that quantizes the compacted region in value space. For each image data item in the set of image data items, a sequence of decompression transforms from a fixed set of decompression transforms is identified that generates an approximation of that image data item when applied to a selected one of the one or more reference data items. Each image data item in the set of image data items is encoded as a representation of the identified sequence of decompression transforms for that image data item. The encoded image data items, set of reference data items and the fixed set of decompression transforms are stored as compressed image data.

The disclosure relates to compressing strings by reducing the number of string characters that are stored. For example, a system may generate a first radix tree for a set of strings and a second radix tree for a reverse of each of the set of strings. The system may merge nodes of the first radix tree and/or second radix tree based on a tuning parameter. The system may identify, based on the first radix tree, beginning portions of at least two strings that match and identify, based on the second radix tree, ending portions of at least two strings that match. The system may use the matching beginning portions, the unique portions, and/or the matching ending portions to generate a pattern that matches the two or more strings. The system may store the two or more strings in association with the generated pattern without their matching beginning and/or ending portions.

A computer-implemented method for compressing digital data includes obtaining a sequence of digital data values; mapping the sequence of digital data values to a sequence of code words having non-uniform bit lengths; packing the sequence of code words into a sequence of storage words having uniform bit length and corresponding to a fixed-size piece of data handled as a unit by the instruction set or the hardware of a processor; and outputting the sequence of storage words together with a first bitmask indicating the bit length of each code word, wherein in the method is implemented using special purpose vector instructions.

A signed media bitstream comprises data units and signature units. Each signature unit is associated with one or more nearby data units and include at least one fingerprint derived from the associated data units and a digital signature of the at least one fingerprint. A storing method comprises: receiving a segment of the media bitstream; identifying N≥2 instances of a repeating data unit in the received segment; pruning up to N−1 of the identified instances of the repeating data unit; and storing the received segment after pruning. A validation method comprises: receiving a segment of the media bitstream stored in accordance with the storing method; and validating a signature unit using a digital signature contained therein. Despite the pruning of the repeating data unit, the received associated data units can be successfully validated, either directly or indirectly, by means of different embodiments herein.

In at least one embodiment, a history data structure of a Lempel-Ziv compressor is preloaded with fixed predetermined history data typical of actual data of a workload of the Lempel-Ziv compressor. The Lempel-Ziv compressor then compresses each of multiple data pages in a sequence of data pages by reference to the fixed predetermined history data.