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.

Vector Quantizer and method therein for efficient vector quantization, e.g. in a transform audio codec. The method comprises comparing an input target vector s with a plurality of centroids, each centroid representing a respective class of codevectors in a codebook. Further, a starting point for a search related to the input target vector in the codebook is determined, based on the result of the comparison. The codevectors in the codebook are sorted according to a distortion measure reflecting the distance between each codevector and the centroids of the classes. The Vector Quantizer and method enables that the class of codevectors comprising the most probable candidate codevectors in regard of the input vector s may be searched first.

Methods and devices for encoding a sparse signal x to generate a compressed encoded signal. The methods employ directionless grammar-based dimension coding. Using labelled subsets and the finding of disjoint repeated subsets in order to build a directionless grammar, the non-zero positions of the sparse signal are encoded in a directionless grammar-based dimension encoder. Element values are encoded in a conditional non-zero encoder. The coding process facilitates random access.

A system and method for the efficient compression of the Channel State Information (CSI) in a wireless network with very low complexity and implementation cost. In accordance with the present invention, the CSI can be approximated as the summation of very few sinusoids on constant frequencies and the parameters of the sinusoids can be found efficiently by very simple calculations such as dot products of vectors which are implementable in hardware at very low cost.

Techniques are disclosed relating to detecting matching datasets using encode values. In various embodiments, a data monitoring system may perform encoding operations on a first dataset to generate a first encode value that corresponds to a particular one of one or more fields included in the first dataset. The data monitoring system may then determine whether the first dataset matches a previously analyzed dataset. For example, in some embodiments, data monitoring system may compare the first encode value to a previous encode value that corresponds to a second field of the previously analyzed dataset. Based on this comparison, the data monitoring system may generate an output value that is indicative of a similarity between the first encode value and the previous encode value. The data monitoring system may then determine whether the first dataset matches the previously analyzed dataset based on this output value.

In one embodiment, an apparatus comprises a decompression engine to perform a non-speculative decode operation on a first portion of a first compressed payload comprising a first plurality of codes; and perform a speculative decode operation on a second portion of the first compressed payload, wherein the non-speculative decode operation and the speculative decode operation share at least one decode path and the non-speculative decode operation is to utilize bandwidth of the at least one decode path that is not used by the non-speculative decode operation.

Embodiments of the present application proposes a frequency envelope vector quantization method and apparatus, where the method includes: dividing N frequency envelopes in one frame into N1 vectors; quantizing a first vector in the N1 vectors by using a first codebook, to obtain a code word corresponding to the quantized first vector, where the first codebook is divided into 2.sup.B1 portions; determining, according to the code word corresponding to the quantized first vector; determining a second codebook according to the codebook of the i.sup.th portion; and quantizing a second vector in the N1 vectors based on the second codebook. In the embodiments of the present application, vector quantization can be performed on frequency envelope vectors by using a codebook with a smaller quantity of bits. Therefore, complexity of vector quantization can be reduced, and an effect of vector quantization can also be ensured.

A three-dimensional data encoding method includes: encoding, for each of three-dimensional points included in point cloud data, geometry information and one or more items of attribute information to generate a bitstream. In the encoding, a normal vector of each of the three-dimensional points is encoded as an item of attribute information included in the one or more items of attribute information of the three-dimensional point.

A method implemented by a processor for coding a real signal, for example an image signal, into a quantized signal, comprises the following steps applied to each real sample of the real signal: converting the real sample into a digital representation, selecting, in the fractional part of the number, a predetermined number N of most significant non-zero bits, for each non-zero significant bit i selected, i varying from 1 to N, determining its distance P.sub.i with respect to the neighboring selected non-zero significant bit of higher rank or, for the first non-zero significant bit selected, with respect to the decimal point, deducting from the distance P.sub.i the minimum value of distance between two non-zero bits, coding the modified distance R on a predetermined number M.sub.i of bits.

An encoder and a method therein for Pyramid Vector Quantizer, PVQ, shape search, the PVQ taking a target vector x as input and deriving a vector y by iteratively adding unit pulses in an inner dimension search loop. The method comprises, before entering a next inner dimension search loop for unit pulse addition, determining, based on the maximum pulse amplitude, maxamp.sub.y, of a current vector y, whether more than a current bit word length is needed to represent enloop.sub.y, in a lossless manner in the upcoming inner dimension loop. The variable enloop.sub.y is related to an accumulated energy of the vector y. The performing of this method enables the encoder to keep the complexity of the search at a reasonable level.