Abstract: Aspects of the disclosure provide for methods and systems for Sub-codebook based Trellis Coded Quantization for CSI Feedback. An aspect of the disclosure provides method executed by a receiver. The method includes receiving a signal from a transmitter, via a communication channel between the receiver and the transmitter. The method further includes estimating parameters associated with the channel based on the received signal. The method further includes obtaining phase information from the estimated parameters. The method further includes applying a trellis coded quantization (TCQ) scheme to the obtained phase information by mapping each sub-codebook index of a set of sub-codebook indices to output bits of each trellis branch making the distance between sub-codebooks maximally equal.

Abstract: Techniques are disclosed relating to processing of time-restricted data records. In various embodiments, a computing system receives a request to store a record that includes a timestamp identifying a time to live (TTL) for the record in a database, with the database being organized in a layered data structure. The computing system stores the record in the database in a particular location in the layered data structure, with the particular location being selected based on the TTL timestamp for the record. The timestamp may be used by a compaction process to indicate that the record TTL has expired and the data record may be written to a message queue by an eviction process.

Abstract: A device is provided with: a first transformer which transforms an coding unit (CU); and a second transformer which transforms a part of first transform coefficients output from the first transformer, wherein the second transformer transforms at least any of the first transform coefficients for a region (first region) having different sizes in a horizontal direction and a vertical direction or the first transform coefficients for a non-rectangular region (second region).

Abstract: A technique is provided that can reduce degradation of the sound quality due to a tandem connection of paired coding and decoding, and can reduce the operation processing amount and the required memory amount of a multipoint control unit. At a terminal of a communication network having a larger communication capacity in multipoint connection between terminals in a plurality of communication networks (e.g., a fixed phone line and a mobile phone line) having different communication capacities, a multichannel coding including a monaural coding scheme of the communication network having the smaller communication capacity is performed on the coding side, whereas decoding of a multichannel-coded code of one point, decoding of a monaural-coded code of one point, or decoding of a monaural-coded code of a plurality of points is performed on the decoding side in accordance with the input code.

Abstract: A system and method for data compression with encryption, that produces a conditioned data stream by replacing data blocks within an input data stream to bring the frequency of each data block closer to an ideal value, produces an error stream comprising the differences between the original data and the encrypted data, and compresses the conditioned data.

Abstract: A computer-implemented method for compressing video data comprises receiving a sequence of video data values, each video data value being a digital value from a successive one of a plurality of pixels that form a video sensor, the sequence of video data values resulting from successive frames of video captured by the video sensor; extracting the video data values for each pixel in turn to create a plurality of pixel data streams, each pixel data stream including the video data value for each frame of captured video for the pixel; and applying data compression to each pixel data stream to create compressed data for each pixel data stream.

Abstract: A system and method for data compression with genomic encryption, which uses frequency analysis on data blocks within an input data stream to produce a prefix table, representing a first layer of transformation, and which applies a Burrow's-Wheeler transform (BWT) to the data inside the prefix table, representing a second layer of transformation, and which compresses the transformed data. In some implementations, the system and method may further include applying the BWT to a conditioned stream of genomic data, wherein the conditioned stream of genomic data is accompanied by an error stream comprising the differences between the original data and the encrypted data.

Abstract: Various embodiments relate to a method and system for stopping a target detection greedy algorithm used in a radar system having a sparse array, including: running an iteration of the target detection greedy algorithm on signals received by the sparse array; adding a complex DC component to a residue produced by the target detection greedy algorithm; estimating the variance of the noise in the received signal; testing a first null hypothesis using the estimate of the variance of noise in the received signal and the average of the square magnitude of the complex data of the received signal; and stopping the target detection greedy algorithm when the first null hypothesis test passes.

Abstract: A first segment of a probe media item that is transmitted as a first live-stream of an event is received. After a first delay period, whether the first segment of the probe media item is similar to a first segment of a first reference media item that is transmitted as a second live-stream of the event and received subsequent to the probe media item is determined. Responsive to determining, after the first delay period, that the first segment is similar to the first segment of the first reference media item, a remedial action in association with the probe media item is performed.

Abstract: A method and apparatus for parallel context processing for example for high coding efficient entropy coding in HEVC. The method comprising retrieving syntax element relating to a block of an image, grouping at least two bins belonging to similar context based on the syntax element, and coding the grouped bins in parallel.

Abstract: Aspects of the disclosure provide methods, apparatuses, and a non-transitory computer-readable medium for point cloud coding. In a method, when parallel octree coding is enabled for occupancy codes of nodes in an octree partitioning structure of the point cloud, syntax information of the point cloud is decoded from a coded bitstream and a bitstream offset of an octree depth is determined. The syntax information indicates a bitstream length of the octree depth at which the parallel octree coding is enabled. Parallel decoding is performed on the occupancy codes of the nodes of the octree depth based on the bitstream offset and the bitstream length of the octree depth. Further, the point cloud is reconstructed based on the occupancy codes of the nodes.

Abstract: Methods, apparatuses, and computer-readable medium for fronthaul compression are provided. An example method may include receiving, from a UE, uplink data via one or more active tones of a plurality of tones in a symbol, the uplink data corresponding to an access vector. The example method may further include compressing the uplink data based on a linear transformation of a pseudo-access vector generated based on the access vector, the linear transformation including a matrix, the compression enabling a second network entity to decompress the compressed uplink data without knowing one or more locations associated with the one or more active tones. The example method may further include transmitting, to the second network entity, the compressed uplink data.

Abstract: An input sequence that has a plurality of bits is received where the input sequence is associated with a first section of data within a compressed block. The plurality of bits in the input sequence are divided into a first sub-sequence comprising a first set of bits and a second sub-sequence comprising a second set of bits. The first sub-sequence is encoded using a first Huffman code tree to obtain a first codeword and the second sub-sequence is encoded using a second Huffman code tree to obtain a second codeword. Encoded data that includes information associated with the first Huffman code tree, information associated with the second Huffman code tree, the first codeword, and the second codeword is output.

Abstract: Compression of data that permits direct reconstruction of arbitrary portions of the uncompressed data. Also, the direct reconstruction of arbitrary portions of the uncompressed data. Conventional compression is done such that decompression has to begin either at the very beginning of the data, or at particular intervals (e.g., at block boundaries—every 64 kilobytes) within the data. However, the principles described herein permit decompression to begin at any point within the compressed data, without having to decompress any prior portion of the file. Thus, the principles described herein permit random access of the compressed data. In accordance with the principles described herein, this is accomplished by using an index that correlates positions within the uncompressed data with positions within the compressed data.

Abstract: A hardware implementable lossless data compression decompression algorithm is disclosed, where the input data string is described in term of consecutive groups of alternating same type bits, where one of these groups of same type bits is defined as a preferred group with the other groups having either lower or higher number of same type bits, where the data string is partitioned into variable length processing strings where the variable length is determined by the occurrence of the preferred group or of a determined number of bits consisting of groups of lower number of same type bits, where these variable length processing strings are processed function of the configuration and content of each processing string only, where consecutive processing strings are additionally processed based on their content only, where processing is performed in a loop until a certain target performance is achieved, where processing is done without any data analysis, and where no negative compression gain is achieved for any cont

Abstract: Aspects of the disclosure provide methods, apparatuses, and non-transitory computer-readable storage mediums for video encoding/decoding. An apparatus includes processing circuitry that decodes prediction information for a current block in a current picture that is a part of a coded video sequence. The processing circuitry determines prediction samples of the current block based on a first linear transform of reference samples of the current block. One or more parameters of the first linear transform are determined based on one of the prediction information and one or more parameters of a second linear transform associated with another block in the coded video sequence. The processing circuitry reconstructs the current block based on the prediction samples.

Abstract: A system and method for providing channel recovery for angle domain sparse channels is herein provided. According to one embodiment, a method includes receiving an input including a measurement output, and recovering analog channels utilizing bases derived from the measurement output.

Abstract: Methods, systems, and computer programs for compressing nucleic acid sequence data. A method can include obtaining nucleic acid sequence data representing: (i) a read sequence, and (ii) a plurality of quality scores, determining whether the read sequence includes at least one “N” base, based on a determination that the read sequence does not include at least one “N” base, generating a first encoded data set by using a first encoding process to encode each of the quality scores of the read sequence using a base-(x minus 1) number, where x is an integer representing a number of different quality scores used by the nucleic acid sequencing device, and using a second encoding process to encode the first encoded data set, thereby compressing the data to be compressed.

Abstract: A system for transmitting information may include a server that generates pseudo-random superpositions, each superposition including multiple packet fragments encoded using a Galois field. The system may transmit the superpositions across a plurality of communication links, which form a single logical path, to a client device. Communication links may include a combination of diverse communication channels, and more preferably one or more low latency (but low bandwidth) communication links and one or more high bandwidth (but high latency) communication links. Advantageously, the use of a plurality of communication links may facilitate transmitting information quickly and reliably.

Abstract: A method, device, and system for data compression and decompression are provided. The method for data compression comprises, converting data to be transmitted within each period, from the time domain to the frequency domain, wherein, a default time length is set as a period; identifying weak power frequencies in the frequency domain data according to a set identification rule; weighting data transmitted on the identified weak power frequencies to obtain corresponding weighting information; converting other data converted to the frequency domain and the weighted data back to time domain; compressing the data converted back to the time domain; and transmitting, the compressed data along the weighting information.

Abstract: A literal element that has a plurality of bits is received. The plurality of bits in the literal element is divided into a first sub-literal comprising a first set of bits and a second sub-literal comprising a second set of bits. The first sub-literal is encoded using a first Huffman code tree to obtain a first sub-literal codeword; the second sub-literal is encoded using a second Huffman code tree to obtain a second sub-literal codeword. Encoded data that includes information associated with the first Huffman code tree, information associated with the second Huffman code tree, the first sub-literal codeword, and the second sub-literal codeword is output.

Abstract: In general, examples of the present disclosure provide systems, methods and computer readable media for data record compression using graph-based techniques. For example, an example method includes retrieving a compound data record list that includes compound data records, identifying a unique second component value set that includes unique second component values, determining a data record position list based at least in part on at least one data record position within the compound data record list, and generating a data record encoding of the compound data records.

Abstract: An encoding apparatus includes: a memory; and a processor coupled to the memory and configured to: generate a value corresponding to a reference direction selected in intra prediction for a process target block by converting a value indicating the reference direction in accordance with a shape of the process target block; calculate a predicted value in the process target block from the values corresponding to the reference directions generated in intra prediction for neighboring blocks adjacent to the process target block; and generate a binary signal for arithmetic encoding based on the predicted value and the value corresponding to the reference direction generated in the intra prediction for the process target block.

Abstract: An apparatus to facilitate cache replacement is disclosed. The apparatus includes a cache memory and cache replacement logic to manage data in the cache memory. The cache replacement logic includes tracking logic to track addresses accessed at the cache memory and replacement control logic to monitor the tracking logic and apply a replacement policy based on information received from the tracking logic.

Abstract: A storage system in one embodiment comprises a plurality of storage devices and a storage controller. The storage system is configured by the storage controller to receive a plurality of data records in a count-key-data format, to separate count and key portions of the data records from remaining portions of the data records, to store the count and key portions of the data records in at least one designated page of a set of pages of a logical storage volume of the storage system, and to store the remaining portions of the data records in one or more other pages of the set of pages of the logical storage volume of the storage system. The designated page of the set of pages of the logical storage volume may comprise a first page of the set of pages, and the one or more other pages of the set of pages may comprise respective ones of a sequence of consecutive pages following the first page.

Abstract: Described are systems and methods for lossy compression and restoration of data. The raw data is first truncated. Then the truncated data is compressed. The compressed truncated data can then be efficiently stored and/or transmitted using fewer bits. To restore the data, the compressed data is then decompressed and restoration bits are concatenated. The restoration bits are selected to compensate for statistical biasing introduced by the truncation.

Abstract: There is provided an image processing apparatus and a method that can suppress an increase in the memory capacity necessary for an orthogonal transform and an inverse orthogonal transform. A submatrix as part of a transform matrix in a first size is used to derive a transform matrix in a second size that is a size smaller than the first size. The derived transform matrix is used to apply an inverse orthogonal transform to coefficient data in which a predicted residual of an image is orthogonally transformed. In this way, an image is generated. The present disclosure can be applied to, for example, an image processing apparatus, an image decoding apparatus, an image encoding apparatus, or the like.

Abstract: A system that includes a first device configured to send a set of real world values to a second device using an unsecure channel and to send a correlithm object algorithm and a correlithm object key to the second device using a secure channel. The first device is further configured to input the set of real world values and the correlithm object key into the correlithm object algorithm to generate a sensor table that identifies the set of real world values and a set of correlithm objects corresponding with the set of real world values. The first device is further configured to store the sensor table in a first memory.

Abstract: A computer-implemented method for compressing video data comprises receiving a sequence of video data values, each video data value being a digital value from a successive one of a plurality of pixels that form a video sensor, the sequence of video data values resulting from successive frames of video captured by the video sensor; extracting the video data values for each pixel in turn to create a plurality of pixel data streams, each pixel data stream including the video data value for each frame of captured video for the pixel; and applying data compression to each pixel data stream to create compressed data for each pixel data stream.

Abstract: An apparatus and a method for selectively migrating data of a virtualized network function (VNF) instance from a first administrative domain to a second administrative domain. The data used within a single process of the VNF instance within the first administrative domain is read. The read data comprises marked data and non-marked data. The marked data is overwritten by anonymous data according to a pre-configured policy. The data, comprising said anonymous data and said non-marked data, is transferred to the second administrative domain. The present disclosure allows determining which areas within a process need to be protected.

Abstract: Methods and systems for querying data are disclosed. In disclosed embodiments, a data set is batched to a first data set in a first range and a second data set in a second range, the batching based on a determination of data fluctuation of the data set. A first model that includes an m order polynomial based on the first data set and a second model that includes an n order polynomial based on the second data set is generated. In embodiments, a query of the data set is received, spanning at least a portion of the range of the first and second data sets. A query output is generated in response to the query, based on output from the first model and second model.

Abstract: In one example, a method includes: receiving a first input value associated with a first data field; responsive to determining that the first data field is associated with an equivalence operation, selecting a second input value associated with a second data field of a previously transmitted message, where the second input field corresponds to the first input field; comparing the first input value and the second input value to determine if the first input value and the second input value are equivalent; and, when the first input value and the second input value are equivalent, generating a message that omits the first input value for the first data field, and providing an operator symbol indicating the equivalence operation to specify that the second input value of the second data field in the previously transmitted message is to be associated with the first data field of the message.

Abstract: Systems and methods are described for measuring, using one or more cameras, anthropomorphic features of two or more individuals to classify and/or grade whether the two or more individuals possess physical abilities to collectively perform desired physical acts, actions or activities. The performance of such actions may involve objects with measured or known dimensions, and/or one or more assistive devices to compensate for differences in anthropomorphic features. Anthropomorphic features of the two or more individuals may also be projected into the future based on attributes such as ages, medical conditions, activity levels and predispositions. Classification schemes may use neural network-based approaches and/or statistical methods based on labelled datasets of abilities of two or more individuals with given anthropomorphic features to perform selected actions.

Abstract: An encoder that encodes a current block in a picture includes circuitry and memory. Using the memory, the circuitry: determines whether to use intra prediction for the current block; and when determining to use intra prediction, (i) performs a first transform on a residual signal of the current block using a first transform basis to generate first transform coefficients; and (ii-1) performs a second transform on the first transform coefficients using a second transform basis to generate second transform coefficients and quantizes the second transform coefficients, when an intra prediction mode of the current block is a predetermined mode or when the first transform basis is same as a predetermined transform basis; and (ii-2) quantizes the first transform coefficients without performing the second transform when the intra prediction mode is different from the predetermined mode and the first transform basis is different from the predetermined transform basis.

Abstract: There is provided an image processing apparatus and method that make it possible to suppress degradation of the encoding efficiency. In the case where primary transform that is a transform process for a prediction residual that is a difference between an image and a prediction image of the image is to be skipped, also secondary transform, which is a transform process for a primary transform coefficient obtained by the primary transform of the prediction residual, is skipped. The present disclosure can be applied, for example, to an image processing apparatus, an image encoding apparatus, an image decoding apparatus and so forth.

Abstract: Computer-implemented methods, systems, and devices to perform lossless compression of floating point format time-series data are disclosed. A first data value may be obtained in floating point format representative of an initial time-series parameter. For example, an output checkpoint of a computer simulation of a real-world event such as weather prediction or nuclear reaction simulation. A first predicted value may be determined representing the parameter at a first checkpoint time. A second data value may be obtained from the simulation. A prediction error may be calculated. Another predicted value may be generated for a next point in time and may be adjusted by the previously determined prediction error (e.g., to increase accuracy of the subsequent prediction). When a third data value is obtained, the adjusted prediction value may be used to generate a difference (e.g., XOR) for storing in a compressed data store to represent the third data value.

Abstract: Methods for converting an n-bit number into an m-bit number for situations where n>m and also for situations where n<m, where n and m are integers. The methods use truncation or bit replication followed by the calculation of an adjustment value which is applied to the replicated number.

Abstract: The present invention discloses a compensation table compression method, a display manufacturing apparatus, and a memory. The method includes: obtaining a reference frame compensation table and a current frame compensation table; dividing the reference frame compensation table and the current frame compensation table into a plurality of coding blocks, wherein each coding block is separately processed by using multiple prediction modes to obtain a residual coding block in the corresponding prediction mode; and compressing the residual coding block. By using the above method, the invention can save resources, reduce costs, and improve work efficiency.

Abstract: There is provided an image processing apparatus and method that make it possible to suppress degradation of the encoding efficiency. In the case where primary transform that is a transform process for a prediction residual that is a difference between an image and a prediction image of the image is to be skipped, also secondary transform, which is a transform process for a primary transform coefficient obtained by the primary transform of the prediction residual, is skipped. The present disclosure can be applied, for example, to an image processing apparatus, an image encoding apparatus, an image decoding apparatus and so forth.

Abstract: Methods, devices and systems for data compression and decompression are disclosed. A collection of data is obtained. The collection of data is sampled to establish, for a plurality of different symbol sizes, relative frequencies of symbols of the respective sizes in the collection of data. A code is generated to contain variable-length codewords by entropy encoding sampled symbols in the collection of data based on a metric which reflects the relative frequencies of the sampled symbols as well as their sizes. Symbols in the collection of data are compressed into compressed representations using the generated code, wherein the compressed representation of a symbol comprises a codeword which represents the symbol as well as metadata for decompressing the compressed representation.

Abstract: Apparatus and a method for compressing data that represent a time-dependent signal that includes a multiplicity of time-dependent signal elements, wherein a multiplicity of spectra are received, where each spectrum corresponds to one of the time-dependent signal elements, and where each spectrum includes a multiplicity of frequencies fj and a multiplicity of amplitudes of the multiplicity of frequencies, wherein a compressed data record is generated, wherein a respective number of coefficients of an autoregressive model for the multiplicity of amplitudes of each of the multiplicity of frequencies is ascertained, and wherein the compressed data record is generated, where the compressed data record includes at least the number of coefficients and the frequencies associated with the coefficients.

Abstract: A method for compressing time series data includes: reading original data including time series data; measuring a unit of the original data; determining a threshold for determining a range allowing for a difference between compressed data and the original data; performing longest distance downsampling to preserve an abnormal point of the original data; storing a start point and an end point of the original data; performing drop-out on the longest distance downsampling result, wherein the drop-out is not performed for the start point and the end point; and if the number of values of the original data is smaller than ? times the original data length, storing at least one of the values of the original data as a reference point, wherein ? is a real number having a value between 0 and 1.

Abstract: Computer-implemented methods, systems, and devices to perform lossless compression of floating point format time-series data are disclosed. A first data value may be obtained in floating point format representative of an initial time-series parameter. For example, an output checkpoint of a computer simulation of a real-world event such as weather prediction or nuclear reaction simulation. A first predicted value may be determined representing the parameter at a first checkpoint time. A second data value may be obtained from the simulation. A prediction error may be calculated. Another predicted value may be generated for a next point in time and may be adjusted by the previously determined prediction error (e.g., to increase accuracy of the subsequent prediction). When a third data value is obtained, the adjusted prediction value may be used to generate a difference (e.g., XOR) for storing in a compressed data store to represent the third data value.

Abstract: A technique for user notification involves receiving an event notification related to an event associated with user notification by a user; providing the event notification from a stored array to a process executed by a processor; using the event notification as a first title used for the process; providing a second title from the stored array to the process; and using the second title to identify the process to the user.

Abstract: A device and a method for compressing data by a device are provided, which relate to the storage field and are used to resolve a prior-art problem that a compression ratio at which data in a data block is compressed by a device is relatively low. The method includes: parsing, by a device, an information block in a data block, to obtain a file type of data in the data block and a data sub-block that is included in the data block; determining a characteristic of data in the data sub-block according to the file type; selecting, according to the characteristic, a target compression algorithm that is used to compress the data in the data sub-block; and compressing the data in the data sub-block by using the target compression algorithm. Embodiments of the present disclosure are used to compress data.

Abstract: The present invention generally relates to storing sequence read data. The invention can involve obtaining a plurality of sequence reads from a sample, identifying one or more sets of duplicative sequence reads within the plurality of sequence reads, and storing only one of the sequence reads from each set of duplicative sequence reads in a text file using nucleotide characters.

Abstract: An enhanced encoder system generates residual bitstreams representing additional image information that can be used by an image enhancement system to improve a low quality image. The enhanced encoder system upsamples a low quality image and compares the upsampled image to a true high quality image to determine image inaccuracies that arise due to the upsampling process. The enhanced encoder system encodes the information describing the image inaccuracies using a trained encoder model as the residual bitstream. The image enhancement system upsamples the same low quality image to obtain a prediction of a high quality image that can include image inaccuracies. Given the residual bitstream, the image enhancement system decodes the residual bitstream using a trained decoder model and uses the additional image information to improve the predicted high quality image. The image enhancement system can provide an improved, high quality image for display.

Abstract: Devices and techniques are generally described for compression of natural language processing models. A first index value to a first address of a weight table may be stored in a hash table. The first address may store a first weight associated with a first feature of a natural language processing model. A second index value to a second address of the weight table may be stored in the hash table. The second address may store a second weight associated with a second feature of the natural language processing model. A first code associated with the first feature and comprising a first number of bits may be generated. A second code may be generated associated with the second feature and comprising a second number of bits greater than the first number of bits based on a magnitude of the second weight being greater than a magnitude of the first weight.

Abstract: There is provided an encoder for encoding input data to generate corresponding encoded data. The encoder is operable to process the input and to encode at least a portion thereof using at least one Delta encoding algorithm, and to generate one or more predictors for use in encoding one or more subsequent portions of the input data, wherein the encoder is also operable to encode data generated by the at least one Delta encoding algorithm and the one or more predictors by employing at least one entropy encoding algorithm to generate the encoded data. There is provided a decoder for decoding the encoded data to generate corresponding decoded data; optionally, the decoded data and the input data are mutually similar.

Abstract: A system for compressing an input data stream to create a compressed output data stream is provided. The system comprises a memory storing a hash table comprising hash entries each comprising a hash value of an associated subset of following data items of an input data stream and a pointer to a memory location of the associated subset. A processor coupled to the memory executes operations while instructing an SIMD engine to execute concurrently one or more of the operations for consecutive subsets: calculate the hash value for each subset, search the hash table for a match of each calculated hash value and update the hash table according to the match result. The processor then updates the compressed output data stream according to the match result and a comparison result depending on the match result and operations for the plurality of associated subsets to create the compressed output data stream.