ref: 390c89225d6eb3cbd974a9d3f9eb3f6b723fbeb3
parent: e4689464eb5f1cc33f958a119deb3669919c529d
author: Jean-Marc Valin <[email protected]>
date: Mon Apr 23 20:57:04 EDT 2012
Adds some references, bumps version number
--- a/Makefile.draft
+++ b/Makefile.draft
@@ -20,7 +20,7 @@
###################### END OF OPTIONS ######################
-CFLAGS += -DOPUS_VERSION='"0.9.9"'
+CFLAGS += -DOPUS_VERSION='"0.9.10"'
include silk_sources.mk
include celt_sources.mk
include opus_sources.mk
--- a/configure.ac
+++ b/configure.ac
@@ -9,7 +9,7 @@
OPUS_MAJOR_VERSION=0
OPUS_MINOR_VERSION=9
-OPUS_MICRO_VERSION=9
+OPUS_MICRO_VERSION=10
OPUS_EXTRA_VERSION=
OPUS_VERSION="$OPUS_MAJOR_VERSION.$OPUS_MINOR_VERSION.$OPUS_MICRO_VERSION$OPUS_EXTRA_VERSION"
--- a/doc/draft-ietf-codec-opus.xml
+++ b/doc/draft-ietf-codec-opus.xml
@@ -2,7 +2,7 @@
<!DOCTYPE rfc SYSTEM 'rfc2629.dtd'>
<?rfc toc="yes" symrefs="yes" ?>
-<rfc ipr="trust200902" category="std" docName="draft-ietf-codec-opus-11">
+<rfc ipr="trust200902" category="std" docName="draft-ietf-codec-opus-12">
<front>
<title abbrev="Interactive Audio Codec">Definition of the Opus Audio Codec</title>
@@ -53,7 +53,7 @@
</address>
</author>
-<date day="17" month="February" year="2012" />
+<date day="24" month="April" year="2012" />
<area>General</area>
@@ -6771,7 +6771,7 @@
<xref target='ltp_quantizer_overview_section'/>, and the quantized LTP
coefficients are used to compute the LTP residual signal.
This LTP residual signal is the input to an LPC analysis where the LPCs are
- estimated using Burg's method, such that the residual energy is minimized.
+ estimated using Burg's method <xref target="Burg"/>, such that the residual energy is minimized.
The estimated LPCs are converted to a Line Spectral Frequency (LSF) vector
and quantized as described in <xref target='lsf_quantizer_overview_section'/>.
After quantization, the quantized LSF vector is converted back to LPC
@@ -6811,7 +6811,7 @@
The implementation of Burg's method differs from traditional
implementations in two aspects.
The first difference is that it
-operates on autocorrelations, similar to the Schur algorithm, but
+operates on autocorrelations, similar to the Schur algorithm <xref target="Schur"/>, but
with a simple update to the autocorrelations after finding each
reflection coefficient to make the result identical to Burg's method.
This brings down the complexity of Burg's method to near that of
@@ -7707,6 +7707,22 @@
<title>Fast Fourier Transform</title>
<author><organization>Wikipedia</organization></author>
</front>
+</reference>
+
+<reference anchor="Burg">
+<front>
+<title>Maximum Entropy Spectral Analysis</title>
+<author initials="JP." surname="Burg" fullname="J.P. Burg"><organization/></author>
+</front>
+</reference>
+
+<reference anchor="Schur">
+<front>
+<title>A fixed point computation of partial correlation coefficients</title>
+<author initials="J." surname="Le Roux" fullname="J. Le Roux"><organization/></author>
+<author initials="C." surname="Gueguen" fullname="C. Gueguen"><organization/></author>
+</front>
+<seriesInfo name="ICASSP-1977, Proc. IEEE Int. Conf. Acoust., Speech, Signal Processing, pp. 257-259, October" value="1977"/>
</reference>
</references>