摘要:
It is inter alia disclosed to identify one or more target vectors from a plurality of candidate vectors, each candidate vector having sorted elements and being associated with a respective class of one or more code vectors of a codebook and at least one of the candidate vectors being associated with a respective class of two or more code vectors that comprise the respective candidate vector and at least one code vector obtainable from the respective candidate vector by one of permutation and signed permutation, the target vectors having, among all candidate vectors of the plurality of candidate vectors, smallest distances towards a at least sorted representation of an input vector. The identifying comprises checking, for a candidate vector of the plurality of candidate vectors, at least based on a distance between the candidate vector and a reference vector and on a distance between the reference vector and the at least sorted representation of the input vector, if a distance between the at least sorted representation of the input vector and the candidate vector is larger than a distance between the at least sorted representation of the input vector and the reference vector. The identifying further comprises computing, for the candidate vector, the distance between the at least sorted representation of the input vector and the candidate vector only if the checking yields a negative result.
摘要:
Methods and devices provide improved perceived quality of an audio (or other) coded signal at a low bit-rate. An input signal may be split into an outlier portion and a stationary portion. The outlier portion of the input signal may be encoded. The stationary portion may be divided into subvectors. Each subvector may be classified as trivial or non-trivial. Each trivial subvector may be encoded using a pre-defined pattern. Each non-trivial subvector may be encoded with at least one location of at least one significant sample and a sign of the significant sample.
摘要:
A method comprises identifying a component k of a codevector from a codebook C having one or more codevectors, the component k introducing highest variance for an input vector; allowing ordering of codevectors in the codebook C; and searching for a best match vector for the input vector using ordered codevectors.