Line Spectral Pairs

Line spectral pairs (LSP) or line spectral frequencies (LSF) are used to represent linear prediction coefficients (LPC) for transmission over a channel. LSPs have several properties (e.g. smaller sensitivity to quantization noise) that make them superior to direct quantization of LPCs. For this reason, LSPs are very useful in speech coding.

LSP representation was developed by Fumitada Itakura, at Nippon Telegraph and Telephone (NTT) in 1975. From 1975 to 1981, he studied problems in speech analysis and synthesis based on the LSP method. In 1980, his team developed an LSP-based speech synthesizer chip. LSP is an important technology for speech synthesis and coding, and in the 1990s was adopted by almost all international speech coding standards as an essential component, contributing to the enhancement of digital speech communication over mobile channels and the internet worldwide. LSPs are used in the code-excited linear prediction (CELP) algorithm, developed by Bishnu S. Atal and Manfred R. Schroeder in 1985.

Mathematical foundation

The LP polynomial $A(z) = 1- \sum_^p a_k z^$ can be expressed as A(z) = 0.5 (z) + Q(z)/math>, where:
* $P(z) = A(z) + z^A(z^)$
* $Q(z) = A(z) - z^A(z^)$

By construction, ''P'' is a palindromic polynomial and ''Q'' an antipalindromic polynomial; physically ''P''(''z'') corresponds to the vocal tract with the glottis closed and ''Q''(''z'') with the glottis open. It can be shown that:
* The roots of ''P'' and ''Q'' lie on the unit circle in the complex plane.
* The roots of ''P'' alternate with those of ''Q'' as we travel around the circle.
* As the coefficients of ''P'' and ''Q'' are real, the roots occur in conjugate pairs

The Line Spectral Pair representation of the LP polynomial consists simply of the location of the roots of ''P'' and ''Q'' (i.e. $\omega$ such that $z = e^, P(z) = 0$). As they occur in pairs, only half of the actual roots (conventionally between 0 and $\pi$) need be transmitted. The total number of coefficients for both ''P'' and ''Q'' is therefore equal to ''p'', the number of original LP coefficients (not counting $a_0=1$).

A common algorithm for finding thesee.g. lsf.c in http://www.ietf.org/rfc/rfc3951.txt is to evaluate the polynomial at a sequence of closely spaced points around the unit circle, observing when the result changes sign; when it does a root must lie between the points tested. Because the roots of ''P'' are interspersed with those of ''Q'' a single pass is sufficient to find the roots of both polynomials.

To convert back to LPCs, we need to evaluate
A(z) = 0.5 (z)+ Q(z)/math>
by "clocking" an impulse through it ''N'' times (order of the filter), yielding the original filter, ''A''(''z'').

Properties

Line spectral pairs have several interesting and useful properties. When the roots of ''P''(''z'') and ''Q''(''z'') are interleaved, stability of the filter is ensured if and only if the roots are monotonically increasing. Moreover, the closer two roots are, the more resonant the filter is at the corresponding frequency. Because LSPs are not overly sensitive to quantization noise and stability is easily ensured, LSP are widely used for quantizing LPC filters. Line spectral frequencies can be interpolated.

See also

* Log area ratios

Sources

Speex manual
and source code (lsp.c)

"The Computation of Line Spectral Frequencies Using Chebyshev Polynomials"
P. Kabal and R. P. Ramachandran. IEEE Trans. Acoustics, Speech, Signal Processing, vol. 34, no. 6, pp. 1419–1426, Dec. 1986.
Includes an overview in relation to LPC.

"Line Spectral Pairs" chapter
as an online excerpt (pdf) / "Digital Signal Processing - A Computer Science Perspective" () Jonathan Stein.

References

{{Compression Methods

Lossy compression algorithms
Digital signal processing
Data compression