BREAKING NEWS
Pyramid vector quantization

## Summary

Pyramid vector quantization (PVQ) is a method used in audio and video codecs to quantize and transmit unit vectors, i.e. vectors whose magnitudes are known to the decoder but whose directions are unknown. PVQ may also be used as part of a gain/shape quantization scheme, whereby the magnitude and direction of a vector are quantized separately from each other. PVQ was initially described in 1986 in the paper "A Pyramid Vector Quantizer" by Thomas R. Fischer.[1]

Improving uniformity of PVQ point distribution by ${\displaystyle w}$ or ${\displaystyle 1/w}$ coordinate-wise power ${\displaystyle p_{i}\to \operatorname {sgn}(p_{i})(|p_{i}|)^{w}}$ of the vector before projection.[2] Diagram presents constellations for ${\displaystyle N=3}$ dimensions and written ${\displaystyle K=11,16,23,32}$ L1-norm.

One caveat of PVQ is that it operates under the taxicab distance (L1-norm). Conversion to/from the more familiar Euclidean distance (L2-norm) is possible via vector projection, though results in a less uniform distribution of quantization points (the poles of the Euclidean n-sphere become denser than non-poles).[3] No efficient algorithm for the ideal (i.e., uniform) vector quantization of the Euclidean n-sphere is known as of 2010.[4] This non-uniformity can be reduced by applying deformation like coordinate-wise power before projection, reducing mean-squared quantization error by ~10%.[2]

PVQ is used in the CELT audio codec (now Opus) and the Daala video codec.

## Overview

As a form of vector quantization, PVQ defines a codebook of M quantization points, each of which is assigned an integer codeword from 0 to M−1. The goal of the encoder is to find the codeword of the closest vector, which the decoder must decode back into a vector.

The PVQ codebook consists of all N-dimensional points ${\displaystyle {\vec {p}}}$  with integer-only coordinates whose absolute values sum to a constant K (i.e. whose L1-norm equals K). In set-builder notation:

${\displaystyle S(N,K)=\left\{{\vec {p}}\in \mathbb {Z} ^{N}:\left\|{\vec {p}}\right\|_{1}=K\right\}}$

where ${\displaystyle \left\|{\vec {p}}\right\|_{1}}$  denotes the L1-norm of ${\displaystyle {\vec {p}}}$ .

As it stands, the set S tesselates the surface of an N-dimensional pyramid. If desired, we may reshape it into a sphere by "projecting" the points onto the sphere, i.e. by normalizing them:

${\displaystyle S_{\text{sphere}}(N,K)=\left\{{\frac {\vec {p}}{\left\|{\vec {p}}\right\|_{2}}}:{\vec {p}}\in S(N,K)\right\}}$

where ${\displaystyle \left\|{\vec {p}}\right\|_{2}}$  denotes the L2-norm of ${\displaystyle {\vec {p}}}$ .

Increasing the parameter K results in more quantization points, and hence typically yields a more "accurate" approximation of the original unit vector ${\displaystyle {\vec {v}}}$  at the cost of larger integer codewords that require more bits to transmit.

### Example

Suppose we wish to quantize three-dimensional unit vectors using the parameter K=2. Our codebook becomes:

Codeword Point Normalized point
0 <−2, 0, 0> <−1.000, 0.000, 0.000>
1 <−1, −1, 0> <−0.707, −0.707, 0.000>
2 <−1, 0, −1> <−0.707, 0.000, −0.707>
3 <−1, 0, 1> <−0.707, 0.000, 0.707>
4 <−1, 1, 0> <−0.707, 0.707, 0.000>
5 <0, −2, 0> <0.000, −1.000, 0.000>
6 <0, −1, −1> <0.000, −0.707, −0.707>
7 <0, −1, 1> <0.000, −0.707, 0.707>
8 <0, 0, −2> <0.000, 0.000, −1.000>
9 <0, 0, 2> <0.000, 0.000, 1.000>
Codeword Point Normalized point
10 <0, 1, −1> <0.000, 0.707, −0.707>
11 <0, 1, 1> <0.000, 0.707, 0.707>
12 <0, 2, 0> <0.000, 1.000, 0.000>
13 <1, −1, 0> <0.707, −0.707, 0.000>
14 <1, 0, −1> <0.707, 0.000, −0.707>
15 <1, 0, 1> <0.707, 0.000, 0.707>
16 <1, 1, 0> <0.707, 0.707, 0.000>
17 <2, 0, 0> <1.000, 0.000, 0.000>

(0.707 = ${\displaystyle {\sqrt {2}}/2}$  rounded to 3 decimal places.)

Now, suppose we wish to transmit the unit vector <0.592, −0.720, 0.362> (rounded here to 3 decimal places, for clarity). According to our codebook, the closest point we can pick is codeword 13 (<0.707, −0.707, 0.000>), located approximately 0.381 units away from our original point.

Increasing the parameter K results in a larger codebook, which typically increases the reconstruction accuracy. For example, based on the Python code below, K=5 (codebook size: 102) yields an error of only 0.097 units, and K=20 (codebook size: 1602) yields an error of only 0.042 units.

### Python code

import itertools
import math
from typing import List, NamedTuple, Tuple

class PVQEntry(NamedTuple):
codeword: int
point: Tuple[int, ...]
normalizedPoint: Tuple[float, ...]

def create_pvq_codebook(n: int, k: int) -> List[PVQEntry]:
"""
Naive algorithm to generate an n-dimensional PVQ codebook
with k pulses.
Runtime complexity: O(k**n)
"""
ret = []
for p in itertools.product(range(-k, k + 1), repeat=n):
if sum(abs(x) for x in p) == k:
norm = math.sqrt(sum(abs(x) ** 2 for x in p))
q = tuple(x / norm for x in p)
ret.append(PVQEntry(len(ret), p, q))

return ret

def search_pvq_codebook(
codebook: List[PVQEntry], p: Tuple[float, ...]
) -> Tuple[PVQEntry, float]:
"""
Naive algorithm to search the PVQ codebook. Returns the point in the
codebook that's "closest" to p, according to the Euclidean distance.)
"""
ret = None
min_dist = None
for i in range(len(codebook)):
q = codebook[i].normalizedPoint
dist = math.sqrt(sum(abs(q[j] - p[j]) ** 2 for j in range(len(p))))
if min_dist is None or dist < min_dist:
ret = codebook[i]
min_dist = dist

return ret, min_dist

def example(p: Tuple[float, ...], k: int) -> None:
n = len(p)
codebook = create_pvq_codebook(n, k)
print("Number of codebook entries: " + str(len(codebook)))
entry, dist = search_pvq_codebook(codebook, p)
print("Best entry: " + str(entry))
print("Distance: " + str(dist))

phi = 1.2
theta = 5.4
x = math.sin(phi) * math.cos(theta)
y = math.sin(phi) * math.sin(theta)
z = math.cos(phi)
p = (x, y, z)
example(p, 2)
example(p, 5)
example(p, 20)


## Complexity

The PVQ codebook can be searched in ${\displaystyle O(KN)}$ .[4] Encoding and decoding can likewise be performed in ${\displaystyle O(KN)}$  using ${\displaystyle O(K+N)}$  memory.[5]

The codebook size obeys the recurrence[4]

${\displaystyle V(N,K)=V(N-1,K)+V(N,K-1)+V(N-1,K-1)}$

with ${\displaystyle V(N,0)=1}$  for all ${\displaystyle N\geq 0}$  and ${\displaystyle V(0,K)=0}$  for all ${\displaystyle K\neq 0}$ .

A closed-form solution is given by[6]

${\displaystyle V(N,K)=2N\cdot {}_{2}F_{1}(1-K,1-N;2;2).}$

where ${\displaystyle {}_{2}F_{1}}$  is the hypergeometric function.