previous up next print clean
Next: TOEPLITZ STRUCTURE Up: Zhang: Interpolation Previous: Introduction

CONTINUOUS SIGNALS WITH DISCRETE SPECTRA

Let us suppose we have a one dimensional, continuous signal s(t) that has a finite time duration T. Within the time interval T, this signal can be represented by a Fourier series expansion as follows:  
 \begin{displaymath}
s(t) = \sum_k S_k e^{j\omega_k t},\end{displaymath} (2)
where Sk is the discrete spectrum of the signal at the discrete frequency

\begin{displaymath}
\omega_k = k \Delta \omega = {2\pi k \over T}.\end{displaymath}

Let $\{s_i=s(t_i);\ \ i=1,2,\ldots,N\}$ be a sequence of samples of this signal. If one can reconstruct the original continuous signal from this finite number of samples, then one can interpolate or resample this signal arbitrarily. This reconstruction is possible if the spectrum of the signal is band-limited, in other words, if the Fourier series expansion in equation (2) has a finite number of terms. With this assumption, equation (2) tells us that the continuous signal can be fully described by a finite number of samples of its spectrum. Thus, the key step of the reconstruction is to estimate the spectrum.

Substituting the known samples into equation (2) gives  
 \begin{displaymath}
s_i= \sum_k S_k e^{j\omega_k t_i} \ \ \ \ i=1,2,\ldots,N.\end{displaymath} (3)
If we define

\begin{displaymath}
s^T = \pmatrix{s_1 & s_2 & \ldots & s_N},\end{displaymath}

\begin{displaymath}
S^T = \pmatrix{S_1 & S_2 & \ldots & S_K}\end{displaymath}

and

\begin{displaymath}
{\bf A} = 
{\pmatrix{e^{j\omega_1t_1} & e^{j\omega_2t_1} & \...
 ...ega_1t_N} & e^{j\omega_2t_N} & \ldots & e^{j\omega_Kt_N} \cr}},\end{displaymath}

where K is the number of frequencies required to model the signal, we can rewrite equation (3) into the corresponding matrix form
\begin{displaymath}
{\bf A}S = s.\end{displaymath} (4)
The least squares solution of this system equation is defined by the following normal equation:  
 \begin{displaymath}
{\bf R}S = {\bf A}^Hs,\end{displaymath} (5)
where ${\bf R}={\bf A}^H{\bf A}$ is a $K \times K$ matrix with complex elements and ${\bf A}^H$ is the conjugate transpose of ${\bf A}$.

There exist many numerical algorithms for solving a general normal equation. But the computation required is generally in an order of K3. Fortunately, as we will see later, the matrix ${\bf R}$ has a special structure that makes it possible to solve equation with an order of K2 operations.


previous up next print clean
Next: TOEPLITZ STRUCTURE Up: Zhang: Interpolation Previous: Introduction
Stanford Exploration Project
12/18/1997