H03M7/6064

Cloud encoding system
10271075 · 2019-04-23 · ·

A system (and corresponding method and devices) for encoding an ungrouped signal into a plurality of grouped signals, wherein the ungrouped signal comprises at least a video service. The system further comprises: a first encoding means provided in a production system configured to execute a first encoding of the ungrouped video signal into a first encoded grouped signal and to associate encoding information with the first encoded signal; a second encoding means provided in a distribution system, wherein the second encoding means is separate from said first encoding means and is configured to execute a plurality of second encodings so as to correspondingly obtain the plurality of grouped signals, each of the plurality of grouped signals characterized by a corresponding predetermined property, wherein the second encodings are performed on the basis of said first encoded signal using the encoding information; a connection means configured to transmit the encoding information from the first encoding means to the second encoding means, wherein the encoding information comprises information on the first encoding.

MANAGING DATA COMPRESSION
20190104077 · 2019-04-04 ·

A transmitting apparatus is provided for transmitting data to a receiving apparatus, the transmitting apparatus comprising: a first network interface configured to transmit data to the receiving apparatus over a first communications path; a transmit buffer forming part of the first network interface, the transmit buffer being configured to store a series of packets of data for transmission over the first communications path; a data compression module configured to compress at least some of the packets of data stored for transmission; a second network interface configured to receive a decompression rate value from the receiving apparatus over a second communications path; and wherein the apparatus is configured to select data packets stored in the transmit buffer for compression based on a compression rate value and a transmission rate value of the transmitting apparatus and a decompression rate value received from the receiving apparatus via the second network interface. A receiving apparatus is also provided.

MULTI-DOMAIN CONFIGURABLE DATA COMPRESSOR/DE-COMPRESSOR

A data service implements a configurable data compressor/decompressor using a recipe generated for a particular data set type and using compression operators of a common registry (e.g., pantry) that are referenced by the recipe, wherein the recipe indicates at which nodes of a compression graph respective ones of the compression operators of the registry are to be implemented. The configurable data compressor/decompressor provides a customizable framework for compressing data sets of different types (e.g., belonging to different data domains) using a common compressor/decompressor implemented using a common set of compression operators.

HIERARCHICAL POINT CLOUD COMPRESSION

A system comprises an encoder configured to compress attribute information for a point cloud and/or a decoder configured to decompress compressed attribute information for the point cloud. Attribute values for at least one starting point are included in a compressed attribute information file and attribute correction values used to correct predicted attribute values are included in the compressed attribute information file. Attribute values are predicted based, at least in part, on attribute values of neighboring points and distances between a particular point for whom an attribute value is being predicted and the neighboring points. The predicted attribute values are compared to attribute values of a point cloud prior to compression to determine attribute correction values. A decoder follows a similar prediction process as an encoder and corrects predicted values using attribute correction values included in a compressed attribute information file.

Decompression using cascaded history windows

The following description is directed to decompression using cascaded history buffers. In one example, an apparatus can include a decompression pipeline configured to decompress compressed data comprising code words that reference a history of decompressed data generated from the compressed data. The apparatus can include a first-level history buffer configured to store a more recent history of the decompressed data received from the decompression pipeline. The apparatus can include a second-level history buffer configured to store a less recent history of the decompressed data received from the first-level history buffer.

CHAN FRAMEWORK, CHAN CODING AND CHAN CODE
20190013825 · 2019-01-10 ·

A framework and the associated method, schema and design for processing digital data, whether random or not, through encoding and decoding losslessly and correctly for purposes including the purposes of encryption/decryption or compression/decompression or both. There is no assumption of the digital information to be processed before processing. An universal coder is invented and now pigeonhole meets blackhole.

SSD COMPRESSION AWARE
20190007058 · 2019-01-03 ·

Embodiments of the present invention include a compression system including one or more compressibility inputs; a compression predictor configured to predict the compressibility of data based on the one or more compressibility inputs; a compressor configured to compress the data; and one or more compression inputs. At least one of the compression predictor or the compressor is configured to determine how to compress the data based on the one or more compression inputs. The one or more compressibility inputs comprise at least one of an object extension dictionary, an object signature dictionary, and an entropy estimation algorithm library. The one or more compression inputs comprise at least one of a quality of service profile, a device performance profile and a compression algorithm performance chart.

DECOMPRESSION USING CASCADED HISTORY WINDOWS
20180375528 · 2018-12-27 · ·

The following description is directed to decompression using cascaded history buffers. In one example, an apparatus can include a decompression pipeline configured to decompress compressed data comprising code words that reference a history of decompressed data generated from the compressed data. The apparatus can include a first-level history buffer configured to store a more recent history of the decompressed data received from the decompression pipeline. The apparatus can include a second-level history buffer configured to store a less recent history of the decompressed data received from the first-level history buffer.

RESIDUAL CODING CONSTRAINT FLAG SIGNALING
20240276019 · 2024-08-15 · ·

In a method of video decoding, a no transform skip residual coding rice constraint flag in a general constraint information (GCI) syntax structure for coded video data in a bitstream is determined. The no transform skip residual coding rice constraint flag is associated with a residual coding tool. When the no transform skip residual coding rice constraint flag in the GCI syntax structure is equal to 1, the coded video data is decoded without invoking the residual coding tool. When the no transform skip residual coding rice constraint flag is equal to 0, a value of a transform skip residual coding rice present in slice header flag for one of one or more coded layer video sequences (CLVSs) in the coded video data is determined. The coded video data in the bitstream is determined based on the value of the transform skip residual coding rice present in slice header flag.

ADAPTIVE ASYMMETRIC-KEY COMPRESSION FOR IDEMPOTENT DATA STORES IN COMPUTER MESSAGING
20240267204 · 2024-08-08 ·

A method includes: receiving, by a server node, a first notification indicating that a first message received by a first node of a cluster of nodes is not a redundant message and cannot be stored by a data store of the nodes, wherein the nodes are managed by the server node; determining to invoke a compression process used to compress message identifiers stored in the first node; receiving a first public key associated with the first node; generating a compression key; generating a first encrypted compression key by encrypting the compression key with the first public key; sending, to the first node, the first encrypted compression key; and receiving, from the first node, a second notification of storing, in a compressed form using a key decrypted from the first encrypted compression key, at least one message identifier in a data store of the first node.