Home | Forum | DAQ Fundamentals | DAQ Hardware | DAQ Software Input Devices | Data Loggers + Recorders | Books | Links + Resources |

Digital signal processing has never been more prevalent or easier to perform. It wasn't that long ago when the fast Fourier transform (FFT), a topic we'll discuss in Section 4, was a mysterious mathematical process used only in industrial research centers and universities. Now, amazingly, the FFT is readily available to us all. It's even a built-in function provided by inexpensive spreadsheet software for home computers. The availability of more sophisticated commercial signal processing software now allows us to analyze and develop complicated signal processing applications rapidly and reliably. We can perform spectral analysis, design digital filters, develop voice recognition, data communication, and image compression processes using software that's interactive both in the way algorithms are defined and how the resulting data are graphically displayed. Since the mid-1980s the same integrated circuit technology that led to affordable home computers has produced powerful and inexpensive hardware development systems on which to implement our digital signal processing designs. Regardless, though, of the ease with which these new digital signal processing development systems and software can be applied, we still need a solid foundation in understanding the basics of digital signal processing. The purpose of this guide is to build that foundation. ====== During a television interview in the early 1990s, a leading computer scientist stated that had automobile technology made the same strides as the computer industry, we'd all have a car that would go a half million miles per hour and get a half million miles per gallon. The cost of that car would be so low that it would be cheaper to throw it away than pay for one day's parking in San Francisco. ====== In this section we'll set the stage for the topics we'll study throughout the remainder of this guide by defining the terminology used in digital signal process- mg, illustrating the various ways of graphically representing discrete signals, establishing the notation used to describe sequences of data values, presenting the symbols used to depict signal processing operations, and briefly introducing the concept of a linear discrete system. 1. In general, the term signal processing refers to the science of analyzing time varying physical processes. As such, signal processing is divided into two categories, analog signal processing and digital signal processing. The term analog is used to describe a waveform that's continuous in time and can take on a continuous range of amplitude values. An example of an analog signal is some voltage that can be applied to an oscilloscope, resulting in a continuous display as a function of time. Analog signals can also be applied to a conventional spectrum analyzer to determine their frequency content. The term analog appears to have stemmed from the analog computers used prior to 1980. These computers solved linear differential equations by means of connecting physical (electronic) differentiators and integrators using old-style telephone operator patch cords. That way, a continuous voltage or current in the actual circuit was analogous to some variable in a differential equation, such as speed, temperature, air pressure, etc. (Although the flexibility and speed of modem-day digital computers have since made analog computers obsolete, a good description of the short-lived utility of analog computers can be found in reference [1].) Because present-day signal processing of continuous radio type signals using resistors, capacitors, operational amplifiers, etc., has nothing to do with analogies, the term analog is actually a misnomer. The more correct term is continuous signal processing for what is today so commonly called analog signal processing. As such, in this guide we'll minimize the use of the term analog signals and substitute the phrase continuous signals when ever appropriate.
The term discrete-time signal is used to describe a signal whose independent
time variable is quantized so that we know only the value of the signal at
discrete instants in time. Thus a discrete-time signal is not represented by
a continuous waveform but, instead, a sequence of values. In addition to quantizing
time, a discrete-time signal quantizes the signal amplitude. We can illustrate
this concept with an example. Think of a continuous sinewave with a peak amplitude
of 1 at a frequency f x(t) = sin(2πf The frequency f0 is measured in hertz (Hz). (In physical systems, we usually
measure frequency in units of hertz. One Hz is a single oscillation, or cycle,
per second. One kilohertz (kHz) is a thousand Hz, and a megahertz (MHz) is
one million Hz.) With t in Eq. 1 representing time in seconds, the f ========= The dimension for frequency used to be cycles/second; that's why the tuning dials of old radios indicate frequency as kilocycles/second (kcps) or megacycles/second (Mcps). In 1960 the scientific community adopted hertz as the unit of measure for frequency in honor of the German physicist, Heinrich Hertz, who first demonstrated radio wave transmission and reception in 1887. ======== Plotting Eq. (eqn. 1), we get the venerable continuous sinewave curve shown in FIG. 1(a). If our continuous sinewave represents a physical voltage, we could sample it once every t, seconds using an analog-to-digital converter and represent the sinewave as a sequence of discrete values. Plotting those individual values as dots would give us the discrete waveform in FIG. 1(b). We say that FIG. 1(b) is the "discrete-time" version of the continuous signal in FIG. 1(a). The independent variable t in Eq. (eqn. 1) and FIG. 1(a) is continuous. The independent index variable n in FIG. 1(b) is discrete and can have only integer values. That is, index n is used to identify the individual elements of the discrete sequence in FIG. 1(b). Do not be tempted to draw lines between the dots in FIG. 1(b). For some reason, people (particularly those engineers experienced in working with continuous signals) want to connect the dots with straight lines, or the stairstep lines shown in FIG. 1(c). Don't fall into this innocent-looking trap. Connecting the dots can mislead the beginner into forgetting that the x(n) sequence is nothing more than a list of numbers. Remember, x(n) is a discrete-time sequence of individual values, and each value in that sequence plots as a single dot. It's not that we're ignorant of what lies between the dots of x(n); there is nothing between those dots. We can reinforce this discrete-time sequence concept by listing those FIG. 1(b) sampled values as follows: x(0) = 0 (1st sequence value, index n =0) x(1) = 0.31 (2nd sequence value, index n = 1) x(2) = 0.59 (3rd sequence value, index n =2) x(3) = 0.81 (4th sequence value, index n =3) and so on, (eqn. 2) where n represents the time index integer sequence 0, 1, 2, 3, etc., and t, is some constant time period. Those sample values can be represented collectively, and concisely, by the discrete-time expression x(n) = sin(2πf (Here again, the 27cfonts term is an angle measured in radians.) Notice that the index n in Eq. (eqn. 2) started with a value of 0, instead of 1. There's nothing sacred about this; the first value of n could just as well have been 1, but we start the index n at zero out of habit because doing so allows us to describe the sinewave starting at time zero. The variable x(n) in Eq. (eqn. 3) is read as "the sequence x of n." Equations (eqn. 1) and (eqn. 3) describe what are also referred to as time-domain signals because the independent variables, the continuous time t in Eq. (eqn. 1), and the discrete-time nt, values used in Eq. (eqn. 3) are measures of time. With this notion of a discrete-time signal in mind, let's say that a discrete system is a collection of hardware components, or software routines, that operate on a discrete-time signal sequence. For example, a discrete system could be a process that gives us a discrete output sequence y(0), y(1), y(2), etc., when a discrete input sequence of x(0), x(1), x(2), etc., is applied to the system input as shown in FIG. 2(a). Again, to keep the notation concise and still keep track of individual elements of the input and output sequences, an abbreviated notation is used as shown in FIG. 2(b) where n represents the integer sequence 0,1,2,3, etc. Thus, x(n) and y(n) are general variables that represent two separate sequences of numbers. FIG. 2(b) allows us to describe a system's output with a simple expression such as y(n) = 2x(n) - 1 . (eqn. 4) Illustrating Eq. (eqn. 4), if x(n) is the five-element sequence: x(0) = 1, x(1) = 3, x(2) = 5, x(3) = 7, and x(4) = 9, then y(n) is the five-element sequence y(0) = 1, y(1) = 5, y(2) = 9, y(3) = 13, and y(4) = 17. ===========
=========== The fundamental difference between the way time is represented in continuous
and discrete systems leads to a very important difference in how we characterize
frequency in continuous and discrete systems. To illustrate, let's reconsider
the continuous sinewave in FIG. 1(a). If it represented a volt age at the
end of a cable, we could measure its frequency by applying it to an oscilloscope,
a spectrum analyzer, or a frequency counter. We'd have a problem, however,
if we were merely given the list of values from Eq. (eqn. 2) and asked to determine
the frequency of the waveform they represent. We'd graph those discrete values,
and, sure enough, we'd recognize a single sinewave as in FIG. 1(b). We
can say that the sinewave repeats every 20 samples, but there's no way to determine
the exact sinewave frequency from the discrete sequence values alone. You can
probably see the point we're leading to here. If we knew the time between samples--the
sample period t Given that the t sinewave period =[20 samples/period] [0.05 milliseconds/sample] = 1 millisecond. (eqn. 5) Because the frequency of a sinewave is the reciprocal of its period, we now know that the sinewave's absolute frequency is 1/(1 ms), or 1 kHz. On the other hand, if we found that the sample period was, in fact, 2 milliseconds, the discrete samples in FIG. 1(b) would represent a sinewave whose period is 40 milliseconds and whose frequency is 25 Hz. The point here is that, in discrete systems, absolute frequency determination in Hz is dependent on the sample frequency f s = lits. We'll be reminded of this dependence throughout the rest of this guide. =========
========= In digital signal processing, we often find it necessary to characterize the frequency content of discrete-time domain signals. When we do so, this frequency representation takes place in what's called the frequency domain. By way of example, let's say we have a discrete sinewave sequence x1 (n) with an arbitrary frequency L Hz as shown on the left side of FIG. 3(a). We can also describe x i (n) as shown on the right side of FIG. 3(a) by indicating that it has a frequency of 1, measured in units of fo, and no other frequency content. Although we won't dwell on it just now, notice that the frequency domain representations in FIG. 3 are themselves discrete. To illustrate our time- and frequency-domain representations further, FIG. 3(b) shows another discrete sinewave x2 (n), whose peak amplitude is 0.4, with a frequency of 2f0. The discrete sample values of x2(n) are ex pressed by the equation x2(n) = 0.4 • sin(2π2f When the two sinewaves, x1 (n) and x2(n), are added to produce a new waveform
x x and its time- and frequency-domain representations are those given in FIG. 3(c). We interpret the Xsum(m) frequency-domain depiction, the spectrum, in FIG. 3(c) to indicate that Xsum (n) has a frequency component of fo Hz and a reduced-amplitude frequency' component of 2f0 Hz. Notice three things in FIG. 3. First, time sequences use lowercase variable
names like the "x" in xi (n), and uppercase symbols for frequency
domain variables such as the "X" in X1(m). The term X1(m) is read
as "the spectral sequence X sub one of m." Second, because the X1
(m) frequency-domain representation of the x1(n) time sequence is itself a
sequence (a list of numbers), we use the index "m" to keep track
of individual elements in X1(m). We can list frequency-domain sequences just
as we did with the time sequence in Eq. (eqn. 2). For example X X X X X and so on, where the frequency index m is the integer sequence 0, 1, 2, 3, etc. Third,
because the xi (n) + x2(n) sinewaves have a phase shift of zero degrees relative
to each other, we didn't really need to bother depicting this phase relationship
in X A key point to keep in mind here is that we now know three equivalent ways to describe a discrete-time waveform. Mathematically, we can use a time-domain equation like Eq. (eqn. 6). We can also represent a time-domain waveform graphically as we did on the left side of FIG. 3, and we can depict its corresponding, discrete, frequency-domain equivalent as that on the right side of FIG. 3. As it turns out, the discrete-time domain signals we're concerned with are not only quantized in time; their amplitude values are also quantized. Be cause we represent all digital quantities with binary numbers, there's a limit to the resolution, or granularity, that we have in representing the values of discrete numbers. Although signal amplitude quantization can be an important consideration-we cover that particular topic in Section 12--we won't worry about it just now. Of course, are people." the engineer, the surgeon the brain surgeon, the engineer is the layman.
2. Let's define two important terms that we'll be using throughout this guide: amplitude and magnitude. It's not surprising that, to the layman, these terms are typically used interchangeably. When we check our thesaurus, we find that they are synonymous. In engineering, however, they mean two different things, and we must keep that difference clear in our discussions. The amplitude of a variable is the measure of how far, and in what direction, that vari able differs from zero. Thus, signal amplitudes can be either positive or negative. The time-domain sequences in FIG. 3 presented the sample value amplitudes of three different waveforms. Notice how some of the individual discrete amplitude values were positive and others were negative. The magnitude of a variable, on the other hand, is the measure of how far, regardless of direction, its quantity differs from zero. So magnitudes are always positive values. FIG. 4 illustrates how the magnitude of the x1(n) time sequence in FIG. 3(a) is equal to the amplitude, but with the sign al ways being positive for the magnitude. We use the modulus symbol ( I I) to represent the magnitude of x1 (n). Occasionally, in the literature of digital signal processing, we'll find the term magnitude referred to as the absolute value. When we examine signals in the frequency domain, we'll often be interested in the power level of those signals. The power of a signal is proportional to its amplitude (or magnitude) squared. If we assume that the proportionality constant is one, we can express the power of a sequence in the time or frequency domains as: x or x Very often we'll want to know the difference in power levels of two signals in the frequency domain. Because of the squared nature of power, two signals with moderately different amplitudes will have a much larger difference in their relative powers. In FIG. 3, for example, signal xi (n)'s amplitude is 2.5 times the amplitude of signal x2 (n), but its power level is 6.25 that of x2(ri)'s power level. This is illustrated in FIG. 5 where both the amplitude and power of X 11 (m) are shown. Because of their squared nature, plots of power values often involve showing both very large and very small values on the same graph. To make these plots easier to generate and evaluate, practitioners usually employ the decibel scale as described in Section E. 3. We'll be using block diagrams to graphically depict the way digital signal processing operations are implemented. Those block diagrams will comprise an assortment of fundamental processing symbols, the most common of which are illustrated and mathematically defined in FIG. 6.
FIG. 6(a) shows the addition, element for element, of two discrete sequences to provide a new sequence. If our sequence index n begins at 0, we say that the first output sequence value is equal to the sum of the first element of the b sequence and the first element of the c sequence, or a(0) = b(0) + c(0). Likewise, the second output sequence value is equal to the sum of the second element of the b sequence and the second element of the c sequence, or a(1) = b(1) + c(1). Equation (eqn. 7) is an example of adding two sequences. The subtraction process in FIG. 6(b) generates an output sequence that's the element-for-element difference of the two input sequences. There are times when we must calculate a sequence whose elements are the sum of more than two values. This operation, illustrated in FIG. 6(c), is called summation and is very common in digital signal processing. Notice how the lower and upper limits of the summation index k in the expression in FIG. 6(c) tell us exactly which elements of the b sequence to sum to obtain a given a(n) value. Because we'll encounter summation operations so often, let's make sure we understand their notation. If we repeat the sum equation from FIG. 6(c) here we have: a(n)=n+ k=n Σ b(k) . (eqn. 9) This means that: when n = 0, index k goes from 0 to 3, so a(0) =b(0) + 6(1) + b(2) + b(3) when n = 1, index k goes from 1 to 4, so a(1)=b(1) + b(2) + b(3) + b(4) when n = 2, index k goes from 2 to 5, so a(2)=b(2) + b(3) + b(4) + b(5) when n = 3, index k goes from 3 to 6, so a(3) =b(3) + 6(4) + b(5) + b(6) and so on. (eqn. 10) We'll begin using summation operations in earnest when we discuss digital filters in Section 5. The multiplication of two sequences is symbolized in FIG. 6(d). Multiplication
generates an output sequence that's the element-for-element product of two
input sequences: a(0) = b(0)c(0), a(1) = b(1)c(1), and so on. The last fundamental
operation that we'll be using is called the unit delay in FIG. 6(e). While
we don't need to appreciate its importance at this point, we'll merely state
that the unit delay symbol signifies an operation where the out put sequence
a(n) is equal to a delayed version of the b(n) sequence. For ex ample, a(5)
= b(4), a(6) = b(5), a(7) = b(6), etc. As we'll see in Section 6, due to the
mathematical techniques used to analyze digital filters, the unit delay is
very often depicted using the term z The symbols in FIG. 6 remind us of two important aspects of digital signal processing. First, our processing operations are always performed on sequences of individual discrete values, and second, the elementary operations themselves are very simple. It's interesting that, regardless of how complicated they appear to be, the vast majority of digital signal processing algorithms can be performed using combinations of these simple operations. If we think of a digital signal processing algorithm as a recipe, then the symbols in FIG. 6 are the ingredients. 4. In keeping with tradition, we'll introduce the subject of linear time-invariant (LTI) systems at this early point in our text. Although an appreciation for LTI systems is not essential in studying the next three sections of this guide, when we begin exploring digital filters, we'll build on the strict definitions of linearity and time invariance. We need to recognize and understand the notions of linearity and time invariance not just because the vast majority of discrete systems used in practice are LTI systems, but because LTI systems are very accommodating when it comes to their analysis. That's good news for us be cause we can use straightforward methods to predict the performance of any digital signal processing scheme as long as it's linear and time invariant. Be cause linearity and time invariance are two important system characteristics having very special properties, we'll discuss them now. 5. The term linear defines a special class of systems where the output is the superposition, or sum, of the individual outputs had the individual inputs been applied separately to the system. For example, we can say that the application of an input x1 (n) to a system results in an output y1 (n). We symbolize this situation with the following expression: xi (n) results in > y1(n) Given a different input x2(n), the system has a y2(n) output as x2 (n) results in y2 (n) . (eqn. 12) For the system to be linear, when its input is the sum x1 (n) + x2(n), its output must be the sum of the individual outputs so that xi (n) + x2 (n) results in > y1 (n)+y2 (n). (eqn. 13) One way to paraphrase expression (eqn. 13) is to state that a linear system's out put is the sum of the outputs of its parts. Also, part of this description of linearity is a proportionality characteristic. This means that if the inputs are scaled by constant factors c1 and c2 then the output sequence parts are also scaled by those factors as cixi (n) + c2 x2 (n) results in > c1Y1(n)+c2Y2(n) (eqn. 14) In the literature, this proportionality attribute of linear systems in expression (eqn. 14) is sometimes called the homogeneity property. With these thoughts in mind, then, let's demonstrate the concept of system linearity.
5.1 To illustrate system linearity, let's say we have the discrete system shown in FIG. 7(a) whose output is defined as y(n) = -x(n)/2 (eqn 1) that is, the output sequence is equal to the negative of the input sequence with the amplitude reduced by a factor of two. If we apply an xi (n) input sequence representing a 1-Hz sinewave sampled at a rate of 32 samples per cycle, we'll have a On) output as shown in the center of FIG. 7(b). The frequency-domain spectral amplitude of the On) output is the plot on the (eqn. 15) right side of FIG. 7(b), indicating that the output comprises a single tone of peak amplitude equal to -0.5 whose frequency is 1 Hz. Next, applying an x2 (n) input sequence representing a 3-Hz sinewave, the system provides a y2 (n) output sequence, as shown in the center of FIG. 7(c). The spectrum of the y2(n) output, Y2 (m), confirming a single 3-Hz sinewave output is shown on the right side of FIG. 7(c). Finally-here's where the linearity comes in-if we apply an x3(n) input sequence that's the sum of a 1-Hz sinewave and a 3-Hz sinewave, the y3(n) output is as shown in the center of FIG. 7(d). Notice how y3(n) is the sample-for-sample sum of y1 (n) and y2(n). FIG. 7(d) also shows that the output spectrum Y3(m) is the sum of Y1 (m) and Y2(m). That's linearity.
5.2 It's easy to demonstrate how a nonlinear system yields an output that is not equal to the sum of y1 (n) and y2(n) when its input is x1 (n) + x2(n). A simple ex ample of a nonlinear discrete system is that in FIG. 8(a) where the output is the square of the input described by y(n) = [x(n)] We'll use a well known trigonometric identity and a little algebra to predict the output of this nonlinear system when the input comprises simple sinewaves. Following the form of Eq. (eqn. 3), let's describe a sinusoidal sequence, whose frequency f0 = 1 Hz, by x1 (n) = sin(27Efonts ) = sin(27t • 1 • nt). (eqn. 17) Equation (eqn. 17) describes the x1 (n) sequence on the left side of FIG. 8(b). Given this xi (n) input sequence, the y1 (n) output of the nonlinear system is the square of a 1-Hz sinewave, or y1 (n) = [x1 (n)12 = sin(2n • 1 - nt) • sin(27t • 1 • nt) . (eqn. 18) We can simplify our expression for On) in Eq. (eqn. 18) by using the following trigonometric identity: sin(a) • sin(/3) = cos(a - /3) cos(a + /3) 2 2 . (eqn. 19) Using Eq. (eqn. 19), we can express y1 (n) as (eqn. 20) which is shown as the all positive sequence in the center of FIG. 8(b). Be cause Eq. (eqn. 19) results in a frequency sum (a + 13) and frequency difference (a - p) effect when multiplying two sinusoids, the On) output sequence will be a cosine wave of 2 Hz and a peak amplitude of -0.5, added to a constant value of 1/2. The constant value of 1/2 in Eq. (eqn. 20) is interpreted as a zero Hz frequency component, as shown in the Y1(m) spectrum in FIG. 8(b). We could go through the same algebraic exercise to determine that, when a 3-Hz sinewave x2(n) sequence is applied to this nonlinear system, the output y2 (n) would contain a zero Hz component and a 6 Hz component, as shown in FIG. 8(c). System nonlinearity is evident if we apply an x3(n) sequence comprising the sum of a 1-Hz and a 3-Hz sinewave as shown in FIG. 8(d). We can predict the frequency content of the y3(n) output sequence by using the algebraic relationship (a+ b)2 = a2+2ab+b2 , (eqn. 21) where a and b represent the 1-Hz and 3-Hz sinewaves, respectively. From Eq. (eqn. 19), the a2 term in Eq. (eqn. 21) generates the zero-Hz and 2-Hz output sinusoids in FIG. 8(b). Likewise, the b2 term produces in y3 (n) another zero Hz and the 6-Hz sinusoid in FIG. 8(c). However, the 2ab term yields additional 2-Hz and 4-Hz sinusoids in y3 (n). We can show this algebraically by using Eq. (eqn. 19) and expressing the 2ab term in Eq. (eqn. 21) as 2ab = 2 - sin(2n -1- nts )- sin(2n - 3. nts ) = 2 cos(2n • 1. nts - 2n • 3. nts ) 2 cos(2n • 1. nt s + 2n • 3. nts ) 2 2 (eqn. 22) = cos(2 • 2. nts ) - cos(2n • 4 • nts ) . Equation (eqn. 22) tells us that two additional sinusoidal components will be present in y3(n) because of the system's nonlinearity, a 2-Hz cosine wave whose amplitude is +1 and a 4-Hz cosine wave having an amplitude of -1. These spectral components are illustrated in y3(m) on the right side of FIG. 8(d). The first term in Eq. (eqn. 22) is cos(27c • nt s - 67E - nt) = cos(-47c • nt) = cos(-27c • 2 • nt). However, be cause the cosine function is even, cos(-cc) = cos(cc), we can express that first term as cos(27c • 2 - nt). Notice that, when the sum of the two sinewaves is applied to the nonlinear system, the output contained sinusoids, Eq. (eqn. 22), that were not present in either of the outputs when the individual sinewaves alone were applied. Those extra sinusoids were generated by an interaction of the two input sinusoids due to the squaring operation. That's nonlinearity; expression (eqn. 13) was not satisfied. (Electrical engineers recognize this effect of internally generated sinusoids as intermodulation distortion.) Although nonlinear systems are usually difficult to analyze, they are occasionally used in practice. References [2], [3], and [4], for example, describe their application in nonlinear digital filters. Again, expressions (eqn. 13) and (eqn. 14) state that a linear system's output resulting from a sum of individual inputs, is the superposition (sum) of the individual outputs. They also stipulate that the output sequence y1 (n) depends only on xi (n) combined with the system characteristics, and not on the other input x2(n), i.e., there's no interaction between inputs xi (n) and x2(n) at the output of a linear system. 6. A time-invariant system is one where a time delay (or shift) in the input sequence causes a equivalent time delay in the system's output sequence. Keeping in mind that n is just an indexing variable we use to keep track of our input and output samples, let's say a system provides an output y(n) given an input of x(n), or X(n) results in y(n) . (eqn. 23) For a system to be time invariant, with a shifted version of the original x(n) input applied, x'(n), the following applies: results in y' (n). y(n + k) , (eqn. 24) where k is some integer representing k sample period time delays. For a system to be time invariant, expression (eqn. 24) must hold true for any integer value of k and any input sequence. 6.1 Let's look at a simple example of time invariance illustrated in FIG. 9. Assume that our initial x(n) input is a unity-amplitude 1-Hz sinewave sequence with a y(n) output, as shown in FIG. 9(b). Consider a different input sequence xi(n), where x'(n) = x(n+4) . (eqn. 25) Equation (eqn. 25) tells us that the input sequence x'(n) is equal to sequence x(n) shifted four samples to the left, that is, x'(0) = x(4), x'(1) = x(5), x'(2) = x(6), and so on, as shown on the left of FIG. 9(c). The discrete system is time invariant because the yi(n) output sequence is equal to the y(n) sequence shifted to the left by four samples, or y'(n) = y(n+4). We cart see that y'(0) = y(4), y'(1) = y(5), y'(2) y(6), and so on, as shown in FIG. 9(c). For time-invariant systems, the y time shift is equal to the x time shift. Some authors succumb to the urge to define a time-invariant system as one whose parameters do not change with time. That definition is incomplete and can get us in trouble if we're not careful. We'll just stick with the formal definition that a time-invariant system is one where a time shift in an input sequence results in an equal time shift in the output sequence. By the way, time-invariant systems in the literature are often called shift-invariant systems. xt (n)= x(n + k) An example of a discrete process that's not time-invariant is the down-sampling, or decimation, process described in Section 10.
7. Although we don't substantiate this fact until we reach Section 6.8, it's not too early to realize that LTI systems have a useful commutative property by which their sequential order can be rearranged with no change in their final output. This situation is shown in FIG. 10 where two different LTI systems are configured in series. Swapping the order of two cascaded systems does not alter the final output. Although the intermediate data sequences f(n) and g(n) will usually not be equal, the two pairs of LTI systems will have identical y(n) output sequences. This commutative characteristic comes in handy for designers of digital filters, as we'll see in Sections 5 and 6.
8. As previously stated, LTI systems can be analyzed to predict their performance. Specifically, if we know the unit impulse response of an LTI system, we can calculate everything there is to know about the system; that is, the system's unit impulse response completely characterizes the system. By unit impulse response, we mean the system's time-domain output sequence when the input is a single unity-valued sample (unit impulse) preceded and followed by zero-valued samples as shown in FIG. 11(b). Knowing the (unit) impulse response of an LTI system, we can deter mine the system's output sequence for any input sequence because the out put is equal to the convolution of the input sequence and the system's impulse response. Moreover, given an LTI system's time-domain impulse response, we can find the system's frequency response by taking the Fourier transform in the form of a discrete Fourier transform of that impulse response. Don't be alarmed if you're not exactly sure what is meant by convolution, frequency response, or the discrete Fourier transform. We'll introduce these subjects and define them slowly and carefully as we need them in later sections. The point to keep in mind here is that LTI systems can be designed and analyzed using a number of straightforward and powerful analysis techniques. These techniques will become tools that we'll add to our signal processing toolboxes as we journey through the subject of digital signal processing.
[1] Karplus, W. J., and Soroka, W. W. Analog Methods, Second Edition, McGraw-Hill, New York, 1959, p. 117. [2] Mikami, N., Kobayashi, M., and Yokoyama, Y. "A New 1DSP-Oriented Algorithm for Calculation of the Square Root Using a Nonlinear Digital Filter," IEEE Trans. on Signal Processing, Vol. 40, No. 7, July 1992. [3] Heinen, P, and Neuvo, Y. "FIR-Median Hybrid Filters," IEEE Trans. on Acoust. Speech, and Signal Processing, Vol. ASSP-35, No. 6, June 1987. [4] Oppenheim, A., Schafer, R., and Stockham, T. "Nonlinear Filtering of Multiplied and Convolved Signals," Proc. IEEE, Vol. 56, August 1968. [5] Pickerd, John. "Impulse-Response Testing Lets a Single Test Do the Work of Thousands," EDN, April 27, 1995. Related Articles -- Top of Page -- Home |

Updated: Wednesday, July 31, 2019 16:45 PST