Next: Wilson-Burg theory
Up: The helical coordinate
Previous: Blind deconvolution
(If you are new to this material, you should pass over this section.)
Spectral factorization is the job of taking a power spectrum
and from it finding a causal (zero before zero time) filter with that spectrum.
Methods for this task (there are many)
not only produce a causal wavelet,
but they typically produce one whose
convolutional inverse is also causal.
(This is called the ``minimum phase'' property.)
In other words, with such a filter we can do stable deconvolution.
Here
I introduce a new method of spectral factorization
that looks particularly suitable for the task at hand.
I learned this new method from John Parker Burg who
attributes it to an old paper by Wilson
(I find Burg's explanation, below, much clearer than Wilson's.)
To invoke the factorization subroutine,
you need to supply one side of an autocorrelation function.
For example, let us specify the negative of the 2-D Laplacian
(an autocorrelation)
in a vector n =
points long.
rr[0] = 4.
rr[1] = -1.
rr[256] = -1.
Subsections
Next: Wilson-Burg theory
Up: The helical coordinate
Previous: Blind deconvolution
2011-08-18