diff options
| author | Jean-Marc Valin <jean-marc.valin@usherbrooke.ca> | 2011-03-07 20:18:45 +0300 |
|---|---|---|
| committer | Jean-Marc Valin <jean-marc.valin@usherbrooke.ca> | 2011-03-07 20:18:45 +0300 |
| commit | f2b86588cd6db584968a2bace3007734e4fe6d1d (patch) | |
| tree | 80bb7d42f1ff43b8cef732f73e321e4a2085ac3c /doc | |
| parent | fc7d19eab505a83c9c03f1e5ac75e7d3e4694961 (diff) | |
fixes error in definition of V(N,K)
Diffstat (limited to 'doc')
| -rw-r--r-- | doc/draft-ietf-codec-opus.xml | 2 |
1 files changed, 1 insertions, 1 deletions
diff --git a/doc/draft-ietf-codec-opus.xml b/doc/draft-ietf-codec-opus.xml index 9b59408d..705fa49c 100644 --- a/doc/draft-ietf-codec-opus.xml +++ b/doc/draft-ietf-codec-opus.xml @@ -731,7 +731,7 @@ The codeword is converted from a unique index in the same way as specified in (denoted N(L,K) in <xref target="PVQ"></xref>), which is the number of possible combinations of K pulses in N samples. The number of combinations can be computed recursively as -V(N,K) = V(N+1,K) + V(N,K+1) + V(N+1,K+1), with V(N,0) = 1 and V(0,K) = 0, K != 0. +V(N,K) = V(N-1,K) + V(N,K-1) + V(N-1,K-1), with V(N,0) = 1 and V(0,K) = 0, K != 0. There are many different ways to compute V(N,K), including pre-computed tables and direct use of the recursive formulation. The reference implementation applies the recursive formulation one line (or column) at a time to save on memory use, |