1.3 Sampling, up--sampling, down--sampling, and multi--rate  (Page 5/5)

The multiplicative constant is found from knowing the result for a single delta function.

These “shah functions" will be useful in sampling signals in both the continuous time and discrete time cases.

Up–sampling, signal stretching, and interpolation

In several situations we would like to increase the data rate of a signal or, to increase its length if it has finite length. This may be part of amulti rate system or part of an interpolation process. Consider the process of inserting $M-1$ zeros between each sample of a discrete time signal.

For the finite length sequence case we calculate the DFT of the stretched or up–sampled sequence by

where the length is now $NM$ and $k=0,1,\cdots ,NM-1$ . Changing the index variable $n=Mm$ gives:

which says the DFT of the stretched sequence is exactly the same as the DFT of the original sequence but over $M$ periods, each of length $N$ .

For up–sampling an infinitely long sequence, we calculate the DTFT of the modified sequence in Equation 34 from FIR Digital Filters as

where $C\left(\omega \right)$ is the DTFT of $x\left(n\right)$ . Here again the transforms of the up–sampled signal is the same as the original signal except over $M$ periods. This shows up here as $C_s\left(\omega \right)$ being a compressed version of $M$ periods of $C\left(\omega \right)$ .

The z-transform of an up–sampled sequence is simply derived by:

which is consistent with a complex version of the DTFT in [link] .

Notice that in all of these cases, there is no loss of information or invertibility. In other words, there is no aliasing.

Down–sampling, subsampling, or decimation

In this section we consider the sampling problem where, unless there is sufficient redundancy, there will be a loss of information caused byremoving data in the time domain and aliasing in the frequency domain.

The sampling process or the down sampling process creates a new shorter or compressed signal by keeping every $M^{th}$ sample of the original sequence. This process is best seen as done in two steps. The first isto mask off the terms to be removed by setting $M-1$ terms to zero in each length- $M$ block (multiply $x\left(n\right)$ by ${⨿}_M\left(n\right)$ ), then that sequence is compressed or shortened by removing the $M-1$ zeroed terms.

We will now calculate the length $L=N/M$ DFT of a sequence that was obtained by sampling every $M$ terms of an original length- $N$ sequence $x\left(n\right)$ . We will use the orthogonal properties of the basis vectors of the DFT which says:

We now calculate the DFT of the down-sampled signal.

where $N=LM$ and $k=\mathrm{0,1,...,L-1}$ . This is done by masking $x\left(n\right)$ .

The compression or removal of the masked terms is achieved in the frequency domain by using $k=\mathrm{0,1,...,L-1}$ This is a length-L DFT of the samples of $x\left(n\right)$ . Unless $C\left(k\right)$ is sufficiently bandlimited, this causes aliasing and $x\left(n\right)$ is not unrecoverable.

It is instructive to consider an alternative derivation of the above result. In this case we use the IDFT given by

The sampled signal gives

for $n=0,1,\cdots ,L-1$ . This sum can be broken down by

From the term in the brackets, we have

as was obtained in [link] .

Now consider still another derivation using shah functions. Let

From the convolution property of the DFT we have

therefore

which again is the same as in [link] .

We now turn to the down sampling of an infinitely long signal which will require use of the DTFT of the signals.

which shows the aliasing caused by the masking (sampling without compression). We now give the effects of compressing $x_s\left(n\right)$ which is a simple scaling of $\omega$ . This is the inverse of the stretching results in [link] .

In order to see how the various properties of the DFT can be used, consider an alternate derivation which uses the IDTFT.

which for the down–sampled signal becomes

The integral broken into the sum of $M$ sections using a change of variables of $\omega =({\omega }_1+2\pi l)/M$ giving

which shows the transform to be the same as given in Equation 9 from Chebyshev of Equal Ripple Error Approximation Filters .

Still another approach which uses the shah function can be given by

which has as a DTFT

which after compressing becomes

which is same as Equation 9 from Chebyshev of Equal Ripple Error Approximation Filters .

Now we consider the effects of down–sampling on the z-transform of a signal.

Applying this to the sampled signal gives

which becomes after compressing

This concludes our investigations of the effects of down–sampling a discrete–time signal and we discover much the same aliasing properties asin sampling a continuous–time signal. We also saw some of the mathematical steps used in the development.

More later

We will later develop relations of sampling to multirate systems, periodically time varying systems, and block processing. This should be avery effective formulation for teaching as well as research on these topics.