Fundamentals of Digital Signal Processing Using MATLAB 2nd Edition Robert J. Schilling 2025 scribd download
Fundamentals of Digital Signal Processing Using MATLAB 2nd Edition Robert J. Schilling 2025 scribd download
https://ebookultra.com/download/digital-signal-processing-with-
examples-in-matlab-second-edition-hush/
https://ebookultra.com/download/signal-processing-for-digital-
communications-artech-house-signal-processing-library-george-j-miao/
https://ebookultra.com/download/digital-signal-processing-second-
edition-fundamentals-and-applications-li-tan/
Digital Signal Processing and Applications with the
TMS320C6713 and TMS320C6416 DSK Topics in Digital Signal
Processing 2nd Edition Rulph Chassaing
https://ebookultra.com/download/digital-signal-processing-and-
applications-with-the-tms320c6713-and-tms320c6416-dsk-topics-in-
digital-signal-processing-2nd-edition-rulph-chassaing/
https://ebookultra.com/download/digital-signal-processing-
laboratory-2nd-ed-edition-b-preetham-kumar/
https://ebookultra.com/download/digital-audio-signal-processing-2nd-
ed-edition-udo-zolzer/
https://ebookultra.com/download/digital-signal-processing-laboratory-
second-edition-kumar/
Fundamentals of Digital
Signal Processing
Using MATLAB®
Second Edition
Clarkson University
Potsdam, NY
Australia • Brazil • Japan • Korea • Mexico • Singapore • Spain • United Kingdom • United States
Copyright 2010 Cengage Learning. All Rights Reserved. May not be copied, scanned, or duplicated, in whole or in part. Due to electronic rights, some third party content may be suppressed from the eBook and/or eChapter(s).
Editorial review has deemed that any suppressed content does not materially affect the overall learning experience. Cengage Learning reserves the right to remove additional content at any time if subsequent rights restrictions require it.
i
This is an electronic version of the print textbook. Due to electronic rights
restrictions, some third party content may be suppressed. Editorial
review has deemed that any suppressed content does not materially
affect the overall learning experience. The publisher reserves the
right to remove content from this title at any time if subsequent
rights restrictions require it. For valuable information on pricing, previous
editions, changes to current editions, and alternate formats, please visit
www.cengage.com/highered to search by ISBN#, author, title, or keyword
for materials in your areas of interest.
Copyright 2010 Cengage Learning. All Rights Reserved. May not be copied, scanned, or duplicated, in whole or in part. Due to electronic rights, some third party content may be suppressed from the eBook and/or eChapter(s).
Editorial review has deemed that any suppressed content does not materially affect the overall learning experience. Cengage Learning reserves the right to remove additional content at any time if subsequent rights restrictions require it.
Schilling-1120949 6909X˙00˙FM˙pi-xviii November 12, 2010 8:25
Copyright 2010 Cengage Learning. All Rights Reserved. May not be copied, scanned, or duplicated, in whole or in part. Due to electronic rights, some third party content may be suppressed from the eBook and/or eChapter(s).
Editorial review has deemed that any suppressed content does not materially affect the overall learning experience. Cengage Learning reserves the right to remove additional content at any time if subsequent rights restrictions require it.
ii
Schilling-1120949 6909X˙00˙FM˙pi-xviii November 12, 2010 8:25
Edgar J. Schilling
and
George W. Harris
Copyright 2010 Cengage Learning. All Rights Reserved. May not be copied, scanned, or duplicated, in whole or in part. Due to electronic rights, some third party content may be suppressed from the eBook and/or eChapter(s).
Editorial review has deemed that any suppressed content does not materially affect the overall learning experience. Cengage Learning reserves the right to remove additional content at any time if subsequent rights restrictions require it.
iii
Schilling-1120949 6909X˙00˙FM˙pi-xviii November 12, 2010 8:25
Preface
Digital signal processing, more commonly known as DSP, is a field of study with increasingly
widespread applications in the modern technological world. This book focuses on the fun-
damentals of digital signal processing with an emphasis on practical applications. The text,
Fundamentals of Digital Signal Processing, consists of the three parts pictured in Figure 1.
FIGURE 1: Parts
of Text
I. Signal and System Analysis
1. Signal Processing
2. Discrete-time Systems in the Time Domain
3. Discrete-time Systems in the Frequency Domain
4. Fourier Transforms and Signal Spectra
Copyright 2010 Cengage Learning. All Rights Reserved. May not be copied, scanned, or duplicated, in whole or in part. Due to electronic rights, some third party content may be suppressed from the eBook and/or eChapter(s).
Editorial review has deemed that any suppressed content does not materially affect the overall learning experience. Cengage Learning reserves the right to remove additional content at any time if subsequent rights restrictions require it.
Schilling-1120949 6909X˙00˙FM˙pi-xviii November 12, 2010 8:25
vi Preface
• • • • • • • • • ••••• ••
• • • • • • • • • ••••• ••
Chapter Structure
Each of the chapters of this book follows the template shown in Figure 2. Chapters start with
motivation sections that introduce one or more examples of practical problems that can be
solved using techniques covered in the chapter. The main body of each chapter is used to
FIGURE 2: Chapter
Structure
Motivation
Concepts,
techniques,
examples
GUI software,
case studies
Problems
Copyright 2010 Cengage Learning. All Rights Reserved. May not be copied, scanned, or duplicated, in whole or in part. Due to electronic rights, some third party content may be suppressed from the eBook and/or eChapter(s).
Editorial review has deemed that any suppressed content does not materially affect the overall learning experience. Cengage Learning reserves the right to remove additional content at any time if subsequent rights restrictions require it.
Schilling-1120949 6909X˙00˙FM˙pi-xviii November 12, 2010 8:25
Preface vii
introduce a series of analysis tools and signal processing techniques. Within these sections,
the analysis methods and processing techniques evolve from the simple to the more complex.
Sections marked with a ∗ near the end of the chapter denote more advanced or specialized
material that can be skipped without loss of continuity. Numerous examples are used throughout
to illustrate the principles involved.
Near the end of each chapter is a GUI software and case studies section that introduces
GUI modules designed to allow the student to interactively explore the chapter concepts and
techniques without any need for programming. The GUI modules feature a standard user
interface that is simple to use and easy to learn. Data files created as output from one module
can be imported as input into other modules. This section also includes case study examples
that present complete solutions to practical problems in the form of MATLAB programs.
The Chapter Summary section concisely reviews important concepts, and it provides a list of
student learning outcomes for each section. The chapter concludes with an extensive set of
homework problems separated into three categories and cross referenced to the sections. The
Analysis and Design problems can be done by hand or with a calculator. They are used to test
student understanding of, and in some cases extend, the chapter material. The GUI Simulation
problems allow the student to interactively explore processing and design techniques using the
chapter GUI modules. No programming is required for these problems. MATLAB Computation
problems are provided that require the user to write programs that apply the signal processing
√
techniques covered in the chapter. Solutions to selected problems, marked with the symbol,
are available as pdf files using the course software.
• • • • • • • • • ••••• ••
FDSP Toolbox
One of the unique features of this textbook is an integrated software package called the Fun-
damentals of Digital Signal Processing (FDSP) Toolbox that can be downloaded from the
companion web site of the publisher. It is also possible to download the FDSP toolbox from
the following web site maintained by the authors. Questions and comments concerning the
text and the software can be addressed to the authors at: [email protected].
www.clarkson.edu/~rschilli/fdsp
The FDSP toolbox includes the chapter GUI modules, a library of signal processing functions,
all of the MATLAB examples, figures, and tables that appear in the text, solutions to selected
problems, and on-line help . All of the course software can be accessed easily through a simple
menu-based FDSP driver program that is executed with the following command from the
MATLAB command prompt.
>> f_dsp
The FDSP toolbox is self-contained in the sense that only the standard MATLAB interpreter
is required. There is no need to for users to have access to optional MATLAB toolboxes such
as the Signal Processing and Filter Design toolboxes.
• • • • • • • • • ••••• ••
Support Material
To access additional course materials [including CourseMate], please visit www.cengagebrain
.com. At the cengagebrain.com home page, search for the ISBN of your title (from the back
Copyright 2010 Cengage Learning. All Rights Reserved. May not be copied, scanned, or duplicated, in whole or in part. Due to electronic rights, some third party content may be suppressed from the eBook and/or eChapter(s).
Editorial review has deemed that any suppressed content does not materially affect the overall learning experience. Cengage Learning reserves the right to remove additional content at any time if subsequent rights restrictions require it.
Schilling-1120949 6909X˙00˙FM˙pi-xviii November 12, 2010 8:25
viii Preface
cover of your book) using the search box at the top of the page. This will take you to the
product page where these resources can be found.
Supplementary course material is provided for both the student and√the instructor. For the
student, solutions to selected end-of-chapter problems, marked with a , are included as pdf
files with the FDSP toolbox. Students are encouraged to use these problems as a test of their
understanding of the material. For the instructor, an enhanced version of the FDSP toolbox
includes pdf file solutions to all of the problems that appear at the end of each chapter. In
addition, as an instructional aid, every computational example, every figure, every table, and
the solution to every problem in the text can be displayed in the classroom using the instructor’s
version of the driver module, f dsp.
• • • • • • • • • ••••• ••
Acknowledgments
This project has been years in the making and many individuals have contributed to its com-
pletion. The reviewers commissioned by Brooks/Cole and Cengage Learning made numerous
thoughtful and insightful suggestions that were incorporated into the final draft. Thanks to
graduate students Joe Tari, Rui Guo, and Lingyun Bai for helping review the initial FDSP tool-
box software. We would also like to thank a number of individuals at Brooks/Cole who helped
see this project to completion and mold the final product. Special thanks to Bill Stenquist who
worked closely with us throughout, and to Rose Kernan. The second edition from Cengage
Learning was made possible through the efforts and support of the dedicated group at Global
Engineering including Swati Meherishi, Hilda Gowans, Lauren Betsos, Tanya Altieri, and
Chris Shortt.
Robert J. Schilling
Sandra L. Harris
Potsdam, NY
Copyright 2010 Cengage Learning. All Rights Reserved. May not be copied, scanned, or duplicated, in whole or in part. Due to electronic rights, some third party content may be suppressed from the eBook and/or eChapter(s).
Editorial review has deemed that any suppressed content does not materially affect the overall learning experience. Cengage Learning reserves the right to remove additional content at any time if subsequent rights restrictions require it.
Schilling-1120949 6909X˙00˙FM˙pi-xviii November 12, 2010 21:52
Contents
1.1 Motivation 3
1.1.1 Digital and Analog Processing 4
1.1.2 Total Harmonic Distortion (THD) 6
1.1.3 A Notch Filter 7
1.1.4 Active Noise Control 7
1.1.5 Video Aliasing 10
1.2 Signals and Systems 11
1.2.1 Signal Classification 11
1.2.2 System Classification 16
1.3 Sampling of Continuous-time Signals 21
1.3.1 Sampling as Modulation 21
1.3.2 Aliasing 23
1.4 Reconstruction of Continuous-time Signals 26
1.4.1 Reconstruction Formula 26
1.4.2 Zero-order Hold 29
1.5 Prefilters and Postfilters 33
1.5.1 Anti-aliasing Filter 33
1.5.2 Anti-imaging Filter 37
∗
1.6 DAC and ADC Circuits 39
1.6.1 Digital-to-analog Converter (DAC) 39
1.6.2 Analog-to-digital Converter (ADC) 41
1.7 The FDSP Toolbox 46
1.7.1 FDSP Driver Module 46
1.7.2 Toolbox Functions 46
1.7.3 GUI Modules 49
1.8 GUI Software and Case Studies 52
1.9 Chapter Summary 60
∗
Sections marked with a ∗ contain more advanced or specialized material that can be skipped without loss of continuity.
ix
Copyright 2010 Cengage Learning. All Rights Reserved. May not be copied, scanned, or duplicated, in whole or in part. Due to electronic rights, some third party content may be suppressed from the eBook and/or eChapter(s).
Editorial review has deemed that any suppressed content does not materially affect the overall learning experience. Cengage Learning reserves the right to remove additional content at any time if subsequent rights restrictions require it.
Schilling-1120949 6909X˙00˙FM˙pi-xviii November 12, 2010 8:25
x Contents
1.10 Problems 62
1.10.1 Analysis and Design 62
1.10.2 GUI Simulation 67
1.10.3 MATLAB Computation 68
•2 •Discrete-time
• • • • • • •Systems
•••••
in the Time Domain
••
70
2.1 Motivation 70
2.1.1 Home Mortgage 71
2.1.2 Range Measurement with Radar 72
2.2 Discrete-time Signals 74
2.2.1 Signal Classification 74
2.2.2 Common Signals 79
2.3 Discrete-time Systems 82
2.4 Difference Equations 86
2.4.1 Zero-input Response 87
2.4.2 Zero-state Response 90
2.5 Block Diagrams 94
2.6 The Impulse Response 96
2.6.1 FIR Systems 97
2.6.2 IIR Systems 98
2.7 Convolution 100
2.7.1 Linear Convolution 100
2.7.2 Circular Convolution 103
2.7.3 Zero Padding 105
2.7.4 Deconvolution 108
2.7.5 Polynomial Arithmetic 109
2.8 Correlation 110
2.8.1 Linear Cross-correlation 110
2.8.2 Circular Cross-correlation 114
2.9 Stability in the Time Domain 117
2.10 GUI Software and Case Studies 119
2.11 Chapter Summary 129
2.12 Problems 132
2.12.1 Analysis and Design 133
2.12.2 GUI Simulation 140
2.12.3 MATLAB Computation 142
•3 •Discrete-time
• • • • • • •Systems
•••••
in the Frequency Domain
••
145
3.1 Motivation 145
3.1.1 Satellite Attitude Control 146
3.1.2 Modeling the Vocal Tract 148
3.2 Z-transform Pairs 149
3.2.1 Region of Convergence 150
3.2.2 Common Z-transform Pairs 153
3.3 Z-transform Properties 157
3.3.1 General Properties 157
3.3.2 Causal Properties 162
Copyright 2010 Cengage Learning. All Rights Reserved. May not be copied, scanned, or duplicated, in whole or in part. Due to electronic rights, some third party content may be suppressed from the eBook and/or eChapter(s).
Editorial review has deemed that any suppressed content does not materially affect the overall learning experience. Cengage Learning reserves the right to remove additional content at any time if subsequent rights restrictions require it.
Schilling-1120949 6909X˙00˙FM˙pi-xviii November 12, 2010 8:25
Contents xi
•4 •Fourier
• • • •Transforms
• • • •••••
and Spectral Analysis
••
228
4.1 Motivation 228
4.1.1 Fourier Series 229
4.1.2 DC Wall Transformer 230
4.1.3 Frequency Response 232
4.2 Discrete-time Fourier Transform (DTFT) 233
4.2.1 DTFT 233
4.2.2 Properties of the DTFT 236
4.3 Discrete Fourier Transform (DFT) 241
4.3.1 DFT 241
4.3.2 Matrix Formulation 243
4.3.3 Fourier Series and Discrete Spectra 245
4.3.4 DFT Properties 248
4.4 Fast Fourier Transform (FFT) 256
4.4.1 Decimation in Time FFT 256
4.4.2 FFT Computational Effort 260
4.4.3 Alternative FFT Implementations 262
Copyright 2010 Cengage Learning. All Rights Reserved. May not be copied, scanned, or duplicated, in whole or in part. Due to electronic rights, some third party content may be suppressed from the eBook and/or eChapter(s).
Editorial review has deemed that any suppressed content does not materially affect the overall learning experience. Cengage Learning reserves the right to remove additional content at any time if subsequent rights restrictions require it.
Schilling-1120949 6909X˙00˙FM˙pi-xviii November 12, 2010 8:25
xii Contents
•5 •Filter
• • •Design
• • • • •••••
Specifications
••
337
5.1 Motivation 337
5.1.1 Filter Design Specifications 338
5.1.2 Filter Realization Structures 339
5.2 Frequency-selective Filters 342
5.2.1 Linear Design Specifications 343
5.2.2 Logarithmic Design Specifications (dB) 348
5.3 Linear-phase and Zero-phase Filters 350
5.3.1 Linear Phase 350
5.3.2 Zero-phase Filters 356
5.4 Minimum-phase and Allpass Filters 358
5.4.1 Minimum-phase Filters 359
5.4.2 Allpass Filters 362
5.4.3 Inverse Systems and Equalization 366
5.5 Quadrature Filters 367
5.5.1 Differentiator 367
5.5.2 Hilbert Transformer 369
5.5.3 Digital Oscillator 372
Copyright 2010 Cengage Learning. All Rights Reserved. May not be copied, scanned, or duplicated, in whole or in part. Due to electronic rights, some third party content may be suppressed from the eBook and/or eChapter(s).
Editorial review has deemed that any suppressed content does not materially affect the overall learning experience. Cengage Learning reserves the right to remove additional content at any time if subsequent rights restrictions require it.
Schilling-1120949 6909X˙00˙FM˙pi-xviii November 12, 2010 8:25
Contents xiii
•6 •FIR
• •Filter
• • • • • •••••
Design 406
••
Copyright 2010 Cengage Learning. All Rights Reserved. May not be copied, scanned, or duplicated, in whole or in part. Due to electronic rights, some third party content may be suppressed from the eBook and/or eChapter(s).
Editorial review has deemed that any suppressed content does not materially affect the overall learning experience. Cengage Learning reserves the right to remove additional content at any time if subsequent rights restrictions require it.
Schilling-1120949 6909X˙00˙FM˙pi-xviii November 12, 2010 8:25
xiv Contents
•7 •IIR• •Filter
• • • • • •••••
Design 499
••
•8 •Multirate
• • • • •Signal
• • •••••
Processing
••
583
8.1 Motivation 583
8.1.1 Narrowband Filter Banks 584
8.1.2 Fractional Delay Systems 586
8.2 Integer Sampling Rate Converters 587
8.2.1 Sampling Rate Decimator 587
8.2.2 Sampling Rate Interpolator 588
Copyright 2010 Cengage Learning. All Rights Reserved. May not be copied, scanned, or duplicated, in whole or in part. Due to electronic rights, some third party content may be suppressed from the eBook and/or eChapter(s).
Editorial review has deemed that any suppressed content does not materially affect the overall learning experience. Cengage Learning reserves the right to remove additional content at any time if subsequent rights restrictions require it.
Schilling-1120949 6909X˙00˙FM˙pi-xviii November 12, 2010 8:25
Contents xv
•9 •Adaptive
• • • • Signal
• • • •••••
Processing
••
645
9.1 Motivation 645
9.1.1 System Identification 646
9.1.2 Channel Equalization 647
9.1.3 Signal Prediction 648
9.1.4 Noise Cancellation 648
9.2 Mean Square Error 649
9.2.1 Adaptive Transversal Filters 649
9.2.2 Cross-correlation Revisited 650
9.2.3 Mean Square Error 651
9.3 The Least Mean Square (LMS) Method 656
9.4 Performance Analysis of LMS Method 660
9.4.1 Step Size 660
9.4.2 Convergence Rate 663
9.4.3 Excess Mean Square Error 666
9.5 Modified LMS Methods 669
9.5.1 Normalized LMS Method 669
9.5.2 Correlation LMS Method 671
9.5.3 Leaky LMS Method 674
9.6 Adaptive FIR Filter Design 678
9.6.1 Pseudo-filters 678
9.6.2 Linear-phase Pseudo-filters 681
Copyright 2010 Cengage Learning. All Rights Reserved. May not be copied, scanned, or duplicated, in whole or in part. Due to electronic rights, some third party content may be suppressed from the eBook and/or eChapter(s).
Editorial review has deemed that any suppressed content does not materially affect the overall learning experience. Cengage Learning reserves the right to remove additional content at any time if subsequent rights restrictions require it.
Schilling-1120949 6909X˙00˙FM˙pi-xviii November 12, 2010 8:25
xvi Contents
•References
• • • • •and
• • • •••••
Further Reading
••
734
•Appendix
• • • •1• •Transform
• • •••••
Tables
••
738
1.1 Fourier Series 738
1.2 Fourier Transform 739
1.3 Laplace Transform 741
1.4 Z-transform 743
1.5 Discrete-time Fourier Transform 744
1.6 Discrete Fourier Transform (DFT) 745
•Appendix
• • • •2• •Mathematical
• • •••••
Identities
••
747
2.1 Complex Numbers 747
2.2 Euler’s Identity 747
2.3 Trigonometric Identities 748
2.4 Inequalities 748
2.5 Uniform White Noise 749
•Appendix
• • • •3• •FDSP
• • •••••
Toolbox Functions
••
750
3.1 Installation 750
3.2 Driver Module: f dsp 751
3.3 Chapter GUI Modules 751
3.4 FDSP Toolbox Functions 752
•Index
• • •755• • • • • • • • • • ••
Copyright 2010 Cengage Learning. All Rights Reserved. May not be copied, scanned, or duplicated, in whole or in part. Due to electronic rights, some third party content may be suppressed from the eBook and/or eChapter(s).
Editorial review has deemed that any suppressed content does not materially affect the overall learning experience. Cengage Learning reserves the right to remove additional content at any time if subsequent rights restrictions require it.
Schilling-1120949 6909X˙00˙FM˙pi-xviii November 12, 2010 8:25
Margin Contents
xvii
Copyright 2010 Cengage Learning. All Rights Reserved. May not be copied, scanned, or duplicated, in whole or in part. Due to electronic rights, some third party content may be suppressed from the eBook and/or eChapter(s).
Editorial review has deemed that any suppressed content does not materially affect the overall learning experience. Cengage Learning reserves the right to remove additional content at any time if subsequent rights restrictions require it.
Schilling-1120949 6909X˙00˙FM˙pi-xviii November 12, 2010 8:25
Copyright 2010 Cengage Learning. All Rights Reserved. May not be copied, scanned, or duplicated, in whole or in part. Due to electronic rights, some third party content may be suppressed from the eBook and/or eChapter(s).
Editorial review has deemed that any suppressed content does not materially affect the overall learning experience. Cengage Learning reserves the right to remove additional content at any time if subsequent rights restrictions require it.
1019763_FM_VOL-I.qxp 9/17/07 4:22 PM Page viii
1
2
3
4
5
6
7
8
9
10
11 This page was intentionally left blank
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
S 50
R 51
PART I
1
Signal Processing
2 3
Discrete Systems, Discrete Systems,
Time Domain Frequency Domain
4
Fourier Transforms,
Signal Spectra
Copyright 2010 Cengage Learning. All Rights Reserved. May not be copied, scanned, or duplicated, in whole or in part. Due to electronic rights, some third party content may be suppressed from the eBook and/or eChapter(s).
Editorial review has deemed that any suppressed content does not materially affect the overall learning experience. Cengage Learning reserves the right to remove additional content at any time if subsequent rights restrictions require it.
1
Schilling-1120949 book November 12, 2010 9:33
CHAPTER
1 Signal Processing
•••••
• • • • • •• • • •••••
Chapter Topics
1.1 Motivation
1.2 Signals and Systems
1.3 Sampling of Continuous-time Signals
1.4 Reconstruction of Continuous-time Signals
1.5 Prefilters and Postfilters
1.6 DAC and ADC Circuits
1.7 The FDSP Toolbox
1.8 GUI Software and Case Study
1.9 Chapter Summary
1.10 Problems
• • • • • • • • • ••••• ••
1.1 Motivation
A signal is a physical variable whose value varies with time or space. When the value of
Continuous-time the signal is available over a continuum of time it is referred to as a continuous-time or
signal analog signal. Everyday examples of analog signals include temperature, pressure, liquid level,
chemical concentration, voltage and current, position, velocity, acceleration, force, and torque.
Discrete-time signal If the value of the signal is available only at discrete instants of time, it is called a discrete-
time signal. Although some signals, for example economic data, are inherently discrete-time
signals, a more common way to produce a discrete-time signal, x(k), is to take samples of an
underlying analog signal, xa (t).
x(k) = xa (kT ), |k| = 0, 1, 2, · · ·
Sampling interval Here T denotes the sampling interval or time between samples, and = means equals by
definition. When finite precision is used to represent the value of x(k), the sequence of quantized
Digital signal values is then called a digital signal. A system or algorithm which processes one digital signal
x(k) as its input and produces a second digital signal y(k) as its output is a digital signal
processor. Digital signal processing (DSP) techniques have widespread applications, and they
play an increasingly important role in the modern world. Application areas include speech
Copyright 2010 Cengage Learning. All Rights Reserved. May not be copied, scanned, or duplicated, in whole or in part. Due to electronic rights, some third party content may be suppressed from the eBook and/or eChapter(s).
Editorial review has deemed that any suppressed content does not materially affect the overall learning experience. Cengage Learning reserves the right to remove additional content at any time if subsequent rights restrictions require it.
Schilling-1120949 book November 12, 2010 9:33
recognition, detection of targets with radar and sonar, processing of music and video, seismic
exploration for oil and gas deposits, medical signal processing including EEG, EKG, and
ultrasound, communication channel equalization, and satellite image processing. The focus of
this book is the development, implementation, and application of modern DSP techniques.
We begin this introductory chapter with a comparison of digital and analog signal process-
ing. Next, some practical problems are posed that can be solved using DSP techniques. This
is followed by characterization and classification of signals. The fundamental notion of the
spectrum of a signal is then presented including the concepts of bandlimited and white-noise
signals. This leads naturally to the sampling process which takes a continuous-time signal and
produces a corresponding discrete-time signal. Simple conditions are presented that ensure
that an analog signal can be reconstructed from its samples. When these conditions are not
satisfied, the phenomenon of aliasing occurs. The use of guard filters to reduce the effects of
aliasing is discussed. Next DSP hardware in the form of analog-to-digital converters (ADCs)
and digital-to-analog converters (DACs) is examined. The hardware discussion includes ways
to model the quantization error associated with finite precision converters. A custom MATLAB
toolbox, called FDSP, is then introduced that facilitates the development of simple DSP pro-
GUI modules grams. The FDSP toolbox also includes a number of graphical user interface (GUI) modules
that can be used to browse examples and explore digital signal processing techniques without
any need for programming. The GUI module g sample allows the user to investigate the sig-
nal sampling process, while the companion module g reconstruct allows the user to explore
the signal reconstruction process. The chapter concludes with a case study example, and a
summary of continuous-time and discrete-time signal processing.
Copyright 2010 Cengage Learning. All Rights Reserved. May not be copied, scanned, or duplicated, in whole or in part. Due to electronic rights, some third party content may be suppressed from the eBook and/or eChapter(s).
Editorial review has deemed that any suppressed content does not materially affect the overall learning experience. Cengage Learning reserves the right to remove additional content at any time if subsequent rights restrictions require it.
Schilling-1120949 book November 12, 2010 9:33
1.1 Motivation 5
processing of x(k) is then achieved with an algorithm that is implemented in software. For
a filtering operation, the DSP algorithm consists of a difference equation, but other types of
processing are also possible and are often used. The digital output signal y(k) is then converted
back to an equivalent analog signal ya (t) by the digital-to-analog converter or DAC.
Although the DSP approach requires more steps than analog signal processing, there are
many important benefits to working with signals in digital form. A comparison of the relative
advantages and disadvantages of the two approaches is summarized in Table 1.1. Although the
DSP approach requires more steps than analog signal processing, there are many important
benefits to working with signals in digital form. A comparison of the relative advantages and
disadvantages of the two approaches is summarized in Table 1.1.
The primary advantages of analog signal processing are speed and cost. Digital signal
processing is not as fast due to the limits on the sampling rates of the converter circuits. In
addition, if substantial computations are to be performed between samples, then the clock rate
Real time of the processor also can be a limiting factor. Speed can be an issue in real-time applications
where the kth output sample y(k) must be computed and sent to the DAC as soon as possible
after the kth input sample x(k) is available from the ADC. However, there are also applications
where the entire input signal is available ahead of time for processing off-line. For this batch
mode type of processing, speed is less critical.
DSP hardware is often somewhat more expensive than analog hardware because analog
hardware can consist of as little as a few discrete components on a stand-alone printed circuit
board. The cost of DSP hardware varies depending on the performance characteristics required.
In some cases, a PC may already be available to perform other functions for a given application,
and in these instances the marginal expense of adding DSP hardware is not large.
In spite of these limitations, there are great benefits to using DSP techniques. Indeed, DSP
is superior to analog processing with respect to virtually all of the remaining features listed
in Table 1.1. One of the most important advantages is the inherent flexibility available with a
software implementation. Whereas an analog circuit might be tuned with a potentiometer to
vary its performance over a limited range, the DSP algorithm can be completely replaced, on
the fly, when circumstances warrant.
DSP also offers considerably higher performance than analog signal processing. For ex-
ample, digital filters with arbitrary magnitude responses and linear phase responses can be
designed easily whereas this is not feasible with analog filters.
A common problem that plagues analog systems is the fact that the component values tend
to drift with age and with changes in environmental conditions such as temperature. This leads
to a need for periodic calibration or tuning. With DSP there is no drift problem and therefore
no need to manually calibrate.
Since data are already available in digital form in a DSP system, with little or no additional
expense, one can log the data associated with the operation of the system so that its performance
can be monitored, either locally of remotely over a network connection. If an unusual operating
condition is detected, its exact time and nature can be determined and a higher-level control
Copyright 2010 Cengage Learning. All Rights Reserved. May not be copied, scanned, or duplicated, in whole or in part. Due to electronic rights, some third party content may be suppressed from the eBook and/or eChapter(s).
Editorial review has deemed that any suppressed content does not materially affect the overall learning experience. Cengage Learning reserves the right to remove additional content at any time if subsequent rights restrictions require it.
Schilling-1120949 book November 12, 2010 9:33
FIGURE 1.3: An
Audio Amplifier
xa (t) e - K e ya (t)
system can be alerted. Although strip chart recorders can be added to an analog system, this
substantially increases the expense thereby negating one of its potential advantages.
The flexibility inherent in software can be exploited by having the parameters of the DSP
algorithm vary with time and adapt as the characteristics of the input signal or the processing
task change. Applications, like system identification and active noise control, exploit adaptive
signal processing, a topic that is addressed in Chapter 9.
An ideal amplifier will produce a desired output signal yd (t) that is a scaled and delayed version
of the input signal. For example, if the scale factor or amplifier gain is K and the delay is τ ,
then the desired output is
yd (t) = K xa (t − τ )
= K a cos[2π F0 (t − τ )] (1.1.2)
In a practical amplifier, the relationship between the input and the output is only approximately
linear, so some additional terms are present in the actual output ya .
The presence of the additional harmonics indicates that there is distortion in the amplified
signal due to nonlinearities within the amplifier. For example, if the amplifier is driven with
an input whose amplitude a is too large, then the amplifier will saturate with the result that the
output is a clipped sine wave that sounds distorted when played through a speaker. To quantify
the amount of distortion, the average power contained in the ith harmonic is di2 /2 for i ≥ 1
and di2 /4 for i = 0. Thus the average power of the signal ya (t) is
1 2
M−1
d02
Py = + d (1.1.4)
4 2 i=1 i
Total harmonic The total harmonic distortion or THD of the output signal ya (t) is defined as the power
distortion in the spurious harmonic components, expressed as a percentage of the total power. Thus the
Copyright 2010 Cengage Learning. All Rights Reserved. May not be copied, scanned, or duplicated, in whole or in part. Due to electronic rights, some third party content may be suppressed from the eBook and/or eChapter(s).
Editorial review has deemed that any suppressed content does not materially affect the overall learning experience. Cengage Learning reserves the right to remove additional content at any time if subsequent rights restrictions require it.
Schilling-1120949 book November 12, 2010 9:33
1.1 Motivation 7
Copyright 2010 Cengage Learning. All Rights Reserved. May not be copied, scanned, or duplicated, in whole or in part. Due to electronic rights, some third party content may be suppressed from the eBook and/or eChapter(s).
Editorial review has deemed that any suppressed content does not materially affect the overall learning experience. Cengage Learning reserves the right to remove additional content at any time if subsequent rights restrictions require it.
Schilling-1120949 book November 12, 2010 9:33
0.8
A(f)
0.6
0.4
0.2
0
0 100 200 300 400 500 600 700
f (Hz)
y(k)
x(k) e(k)
- Controller
The purpose of the reference microphone in Figure 1.5 is to detect the primary noise x(k)
generated by the noise source or blower. The primary noise signal is then passed through a
digital filter of the following form.
m
y(k) = wi (k)x(k − i) (1.1.9)
i=0
The output of the filter y(k) drives a speaker that creates the secondary sound sometimes called
Antisound antisound. The error microphone, located downstream of the speaker, detects the sum of the pri-
mary and secondary sounds and produces an error signal e(k). The objective of the adaptive
algorithm is the take x(k) and e(k) as inputs and adjust the filter weights w(k) so as to drive
e2 (k) to zero. If zero error can be achieved, then silence is observed at the error microphone. In
practical systems, the error or residual sound is significantly reduced by active noise control.
Copyright 2010 Cengage Learning. All Rights Reserved. May not be copied, scanned, or duplicated, in whole or in part. Due to electronic rights, some third party content may be suppressed from the eBook and/or eChapter(s).
Editorial review has deemed that any suppressed content does not materially affect the overall learning experience. Cengage Learning reserves the right to remove additional content at any time if subsequent rights restrictions require it.
Schilling-1120949 book November 12, 2010 9:33
1.1 Motivation 9
To illustrate the operation of this adaptive DSP system, suppose the blower noise is modeled
as a periodic signal with fundamental frequency F0 and r harmonics plus some random white
noise v(k).
r
x(k) = ai cos(2πik F0 T + θi ) + v(k), 0 ≤ k < p (1.1.10)
i=1
For example, suppose F0 = 100 Hz and there are r = 4 harmonics with amplitudes ai = 1/i
and random phase angles. Suppose the random white noise term is distributed uniformly over
the interval [−.5, .5]. Let p = 2048 samples, suppose the sampling interval is T = 1/1600
sec, and the filter order is m = 40. The adaptive algorithm used to adjust the filter weights is
called the FXLMS method, and it is discussed in detail in Chapter 9. The results of applying
this algorithm are shown in Figure 1.6.
Initially the filter weights are set to w(0) = 0 which corresponds to no noise control at all.
The adaptive algorithm is not activated until sample k = 512, so the first quarter of the plot
in Figure 1.6 represents the ambient or primary noise detected at the error microphone. When
adaptation is activated, the error begins to decrease rapidly and after a short transient period
it reaches a steady-state level that is almost two orders of magnitude quieter than the primary
noise itself. We can quantify the noise reduction by using the following measure of overall
noise cancellation.
p/4−1 p−1
E = 10 log10 e (i) − 10 log10
2
e (i) dB
2
(1.1.11)
i =0 i = 3 p/4
The overall noise cancellation E is the log of the ratio of the average power of the noise during
the first quarter of the samples divided by the average power of the noise during the last quarter
of the samples, expressed in units of decibels. Using this measure, the noise cancellation
observed in Figure 1.6 is E = 37.8 dB.
70
60
e2(k)
40
30
20
10
0
0 500 1000 1500 2000
k
Copyright 2010 Cengage Learning. All Rights Reserved. May not be copied, scanned, or duplicated, in whole or in part. Due to electronic rights, some third party content may be suppressed from the eBook and/or eChapter(s).
Editorial review has deemed that any suppressed content does not materially affect the overall learning experience. Cengage Learning reserves the right to remove additional content at any time if subsequent rights restrictions require it.
Schilling-1120949 book November 12, 2010 9:33
0 0
−5 −5
−5 0 5 −5 0 5
k = 2 k = 3
5 5
0 0
−5 −5
−5 0 5 −5 0 5
Copyright 2010 Cengage Learning. All Rights Reserved. May not be copied, scanned, or duplicated, in whole or in part. Due to electronic rights, some third party content may be suppressed from the eBook and/or eChapter(s).
Editorial review has deemed that any suppressed content does not materially affect the overall learning experience. Cengage Learning reserves the right to remove additional content at any time if subsequent rights restrictions require it.
Schilling-1120949 book November 12, 2010 9:33
explanation is that the disk is actually rotating clockwise at a rate of 315 degrees/frame.
Both interpretations are plausible. Is the motion captured by the snapshots a fast clockwise
rotation or a slow counter clockwise rotation? If the disk is in fact rotating clockwise at F0
revolutions/second, but the sampling rate is f s ≤ 2F0 , then aliasing occurs in which case the
disk can appear to turn backwards at a slow rate. Interestingly, this manifestation of aliasing
was quite common in older western films that featured wagon trains heading west. The spokes
on the wagon wheels sometimes appeared to move backwards because of the slow frame rate
used to shoot the film and display it on older TVs.
• • • • • • • • • ••••• ••
2.5
x (t)
2
a
1.5
0.5
0
0 0.5 1 1.5 2 2.5 3 3.5 4
t (sec)
Copyright 2010 Cengage Learning. All Rights Reserved. May not be copied, scanned, or duplicated, in whole or in part. Due to electronic rights, some third party content may be suppressed from the eBook and/or eChapter(s).
Editorial review has deemed that any suppressed content does not materially affect the overall learning experience. Cengage Learning reserves the right to remove additional content at any time if subsequent rights restrictions require it.
Schilling-1120949 book November 12, 2010 9:33
Sampling interval Here, T > 0 is the time between samples or sampling interval in seconds. The sample spacing
Sampling frequency also can be specified using the reciprocal of the sampling interval which is called the sampling
frequency, f s .
1
Hz fs = (1.2.2)
T
Here, the unit of Hz is understood to mean samples/second. Notice that the integer k in (1.2.1)
Discrete-time denotes discrete time or, more specifically, the sample number. The sampling interval T is
left implicit on the left-hand side of (1.2.1) because this simplifies subsequent notation. In
those instances where the value of T is important, it will be stated explicitly. An example of
a discrete-time signal generated by sampling the continuous-time signal in Figure 1.8 using
T = .25 seconds is shown in Figure 1.9.
Just as the independent variable can be continuous or discrete, so can the dependent variable
or amplitude of the signal be continuous or discrete. If the number of bits of precision used to
Quantized signal represent the value of x(k) is finite, then we say that x(k) is a quantized or discrete-amplitude
signal. For example, if N bits are used to represent the value of x(k), then there are 2 N distinct
values that x(k) can assume. Suppose the value of x(k) ranges over the interval [xm , x M ]. Then
Quantization level the quantization level, or spacing between adjacent discrete values of x(k), is
x M − xm
q= (1.2.3)
2N
The quantization process can be thought of as passing a signal through a piecewise-constant
staircase type function. For example, if the quantization is based on rounding to the nearest N
Quantization bits, then the process can be represented with the following quantization operator.
operator
x
Q N (x) = q · round (1.2.4)
q
A graph of Q N (x) for x ranging over the interval [−1, 1] using N = 5 bits is shown in
Digital signal Figure 1.10. A quantized discrete-time signal is called a digital signal. That is, a digital signal,
2.5
x(k)
1.5 T = .25
0.5
0
0 .5 1 1.5 2 2.5 3 3.5 4
kT (sec)
Copyright 2010 Cengage Learning. All Rights Reserved. May not be copied, scanned, or duplicated, in whole or in part. Due to electronic rights, some third party content may be suppressed from the eBook and/or eChapter(s).
Editorial review has deemed that any suppressed content does not materially affect the overall learning experience. Cengage Learning reserves the right to remove additional content at any time if subsequent rights restrictions require it.
Schilling-1120949 book November 12, 2010 9:33
0.6
q = .0625
0.4
0.2
Q(x)
0
−0.2
−0.4
−0.6
−0.8
−1
−1 −0.5 0 0.5 1
x
3.5
2.5
xq(k)
2
T = .25
1.5
q = .1290
N = 5 bits
1
0.5
0
0 .5 1 1.5 2 2.5 3 3.5 4
kT (sec)
Copyright 2010 Cengage Learning. All Rights Reserved. May not be copied, scanned, or duplicated, in whole or in part. Due to electronic rights, some third party content may be suppressed from the eBook and/or eChapter(s).
Editorial review has deemed that any suppressed content does not materially affect the overall learning experience. Cengage Learning reserves the right to remove additional content at any time if subsequent rights restrictions require it.
Schilling-1120949 book November 12, 2010 9:33
produce xq (k). Careful inspection of Figure 1.11 reveals that at some of the samples there are
noticeable differences between xq (k) and xa (kT ). If rounding is used, then the magnitude of
the error is, at most, q/2.
Most of the analysis in this book will be based on discrete-time signals rather than digital
signals. That is, infinite precision is used to represent the value of the dependent variable.
Finite precision, or finite word length effects, are examined in Chapters 6 and 7 in the context
of digital filter design. When digital filter are implemented in MATLAB using the default
double-precision arithmetic, this corresponds to 64 bits of precision (16 decimal digits). In
most instances this is sufficiently high precision to yield insignificant finite word length effects.
Quantization A digital signal xq (k) can be modeled as a discrete-time signal x(k) plus random quanti-
noise zation noise, v(k), as follows.
An effective way to measure the size or strength of the quantization noise is to use average
Expected value power defined as the mean, or expected value, of v 2 (k). Typically, v(k) is modeled as a
random variable uniformly distributed over the interval [−q/2, q/2] with probability density
p(x) = 1/q. In this case, the expected value of v 2 (k) is
q/2
E[v 2 ] = p(x)x 2 dx
−q/2
q/2
1
= x 2 dx (1.2.7)
q −q/2
Thus, the average power of the quantization noise is proportional to the square of the quanti-
zation level with
q2
E[v 2 ] = (1.2.8)
12
Copyright 2010 Cengage Learning. All Rights Reserved. May not be copied, scanned, or duplicated, in whole or in part. Due to electronic rights, some third party content may be suppressed from the eBook and/or eChapter(s).
Editorial review has deemed that any suppressed content does not materially affect the overall learning experience. Cengage Learning reserves the right to remove additional content at any time if subsequent rights restrictions require it.
Schilling-1120949 book November 12, 2010 9:33
Finally, taking the natural log of both sides and solving for N we have
ln(182.5742)
= 7.5123
N >
ln(2)
Since N must be an integer, the minimum number of bits needed to ensure that the average
power of the quantization noise is less than .001 is N = 8 bits.
Signals can be further classified depending on whether or not they are nonzero for negative
values of the independent variable.
DEFINITION
A signal xa (t) defined for t ∈ R is causal if and only if it is zero for negative t. Otherwise,
1.1: Causal Signal
the signal is noncausal.
xa (t) = 0 for t < 0
Most of the signals that we work with will be causal signals. A simple, but important,
Unit step example of a causal signal is the unit step which is denoted μa (t) and defined
0, t < 0
μa (t) = (1.2.9)
1, t ≥ 0
Note that any signal can be made into a causal signal by multiplying by the unit step. For
example, xa (t) = exp(−t/τ )μa (t) is a causal decaying exponential with time constant τ .
Unit impulse Another important example of a causal signal is the unit impulse which is denoted δa (t).
Strictly speaking, the unit impulse is not a function because it is not defined at t = 0. However,
the unit impulse can be defined implicitly by the equation
t
δa (τ )dτ = μa (t) (1.2.10)
−∞
That is, the unit impulse δa (t) is a signal that, when integrated, produces the unit step μa (t).
Consequently, we can loosely think of the unit impulse as the derivative of the unit step function,
keeping in mind that the derivative of the unit step is not defined at t = 0. The two essential
characteristics of the unit impulse that follow from (1.2.10) are
δa (t) = 0, t = 0 (1.2.11a)
∞
δa (t)dt = 1 (1.2.11b)
−∞
A more informal way to view the unit impulse is to consider a narrow pulse of width and
height 1/ starting at t = 0. The unit impulse can be thought of as the limit of this sequence of
pulses as the pulse width goes to zero. By convention, we graph the unit impulse as a vertical
arrow with the height of the arrow equal to the strength, or area, of the impulse as shown in
Figure 1.12.
The unit impulse has an important property that is a direct consequence of (1.2.11). If xa (t)
is a continuous function, then
∞ ∞
xa (τ )δa (τ − t0 )dτ = xa (t0 )δa (τ − t0 )dτ
−∞ −∞
∞
= xa (t0 ) δa (τ − t0 )dτ
−∞∞
= xa (t0 ) δa (α)dα (1.2.12)
−∞
Copyright 2010 Cengage Learning. All Rights Reserved. May not be copied, scanned, or duplicated, in whole or in part. Due to electronic rights, some third party content may be suppressed from the eBook and/or eChapter(s).
Editorial review has deemed that any suppressed content does not materially affect the overall learning experience. Cengage Learning reserves the right to remove additional content at any time if subsequent rights restrictions require it.
Schilling-1120949 book November 12, 2010 9:33
ua(t )
1
xa(t)
0.5 d a(t )
−0.5
−2 −1.5 −1 −0.5 0 0.5 1 1.5 2
t (sec)
FIGURE 1.13: A
System S with Input
x and Output y x e - S e y
Sifting property Since the area under the unit impulse is one, we then have the following sifting property of the
unit impulse
∞
xa (t)δa (t − t0 )dt = xa (t0 ) (1.2.13)
−∞
From (1.2.13) we see that when a continuous function of time is multiplied by an impulse
and then integrated, the effect is to sift out or sample the value of the function at the time the
impulse occurs.
Copyright 2010 Cengage Learning. All Rights Reserved. May not be copied, scanned, or duplicated, in whole or in part. Due to electronic rights, some third party content may be suppressed from the eBook and/or eChapter(s).
Editorial review has deemed that any suppressed content does not materially affect the overall learning experience. Cengage Learning reserves the right to remove additional content at any time if subsequent rights restrictions require it.
Schilling-1120949 book November 12, 2010 9:33
to produce a discrete-time output y(k). There are also examples of systems that contain both
continuous-time signals and discrete-time signals. These systems are referred to as sampled-
data systems.
Almost all of the examples of systems in this book belong to an important class of systems
called linear systems.
DEFINITION
Let x1 and x2 be arbitrary inputs and let a and b be arbitrary scalars. A system S is linear
1.2: Linear System
if and only if the following holds, otherwise it is a nonlinear system.
S(ax1 + bx2 ) = aSx1 + bSx2
Thus a linear system has two distinct characteristics. When a = b = 1, we see that the response
to a sum of inputs is just the sum of the responses to the individual inputs. Similarly, when
b = 0, we see that the response to a scaled input is just the scaled response to the original input.
Examples of linear discrete-time systems include the notch filter in (1.1.8) and the adaptive
filter in (1.1.9). On the other hand, if the analog audio amplifier in Figure 1.3 is over driven and
its output saturates to produce harmonics as in (1.1.3), then this is an example of a nonlinear
continuous-time system. Another important class of systems is time-invariant systems.
DEFINITION
A system S with input xa (t) and output ya (t) is time-invariant if and only if whenever the
1.3: Time-invariant
input is translated in time by τ , the output is also translated in time by τ . Otherwise the
System
system is a time-varying system.
Sxa (t − τ ) = ya (t − τ )
For a time-invariant system, delaying or advancing the input delays or advances the output
by the same amount, but it does not otherwise affect the shape of the output. Therefore the results
of an input-output experiment do not depend on when the experiment is performed. Time-
invariant systems described by differential or difference equations have constant coefficients.
More generally, physical time-invariant systems have constant parameters. The notch filter in
(1.1.8) is an example of a discrete-time system that is both linear and time-invariant. On the
other hand, the adaptive digital filter in (1.1.9) is a time-varying system because the weights
w(k) are coefficients that change with time as the system adapts. The following example shows
that the concepts of linearity and time-invariance can sometimes depend on how the system is
characterized.
Copyright 2010 Cengage Learning. All Rights Reserved. May not be copied, scanned, or duplicated, in whole or in part. Due to electronic rights, some third party content may be suppressed from the eBook and/or eChapter(s).
Editorial review has deemed that any suppressed content does not materially affect the overall learning experience. Cengage Learning reserves the right to remove additional content at any time if subsequent rights restrictions require it.
Schilling-1120949 book November 12, 2010 9:33
Thus an unstable system is a system for which the magnitude of the output grows arbitrarily
large with time for a least one bounded input.
Copyright 2010 Cengage Learning. All Rights Reserved. May not be copied, scanned, or duplicated, in whole or in part. Due to electronic rights, some third party content may be suppressed from the eBook and/or eChapter(s).
Editorial review has deemed that any suppressed content does not materially affect the overall learning experience. Cengage Learning reserves the right to remove additional content at any time if subsequent rights restrictions require it.
Schilling-1120949 book November 12, 2010 9:33
Just as light can be decomposed into a spectrum of colors, signals also contain energy that
is distributed over a range of frequencies. To decompose a continuous-time signal xa (t) into
Fourier transform its spectral components, we use the Fourier transform.
∞
X a ( f ) = F{xa (t)} = xa (t) exp(− j2π f t)dt (1.2.16)
−∞
It is assumed that the reader is familiar with the basics of continuous-time transforms, specifi-
cally the Laplace transform and the Fourier transform. Tables of transform pairs and transform
properties for all of the tranforms used in this text can be found in Appendix 1. Here, f ∈ R
denotes frequency in cycles/sec or Hz. In general the Fourier transform, X a ( f ), is complex.
Polar form As such, it can be expressed in polar form in terms of its magnitude Aa ( f ) = |X a ( f )| and
phase angle φa ( f ) = X a ( f ) as follows.
Magnitude, phase The real-valued function Aa ( f ) is called the magnitude spectrum of xa (t), while the real-
spectrum valued function φa ( f ) is called the phase spectrum of xa (t). More generally, X a ( f ) itself is
called the spectrum of xa (t). For a real xa (t), the magnitude spectrum is an even function of
f , and the phase spectrum is an odd function of f .
When a signal passes through a linear system, the shape of its spectrum changes. Systems
Filters designed to reshape the spectrum in a particular way are called filters. The effect that a linear
system has on the spectrum of the input signal can be characterized by the frequency response.
DEFINITION
Let S be a stable linear time-invariant continuous-time system with input xa (t) and output
1.5: Frequency Response
ya (t). Then the frequency response of the system S is denoted Ha ( f ) and defined
Ya ( f )
Ha ( f ) =
Xa( f )
Thus the frequency response of a linear system is just the Fourier transform of the output
divided by the Fourier transform of the input. Since Ha ( f ) is complex, it can be represented
by its magnitude Aa ( f ) = |Ha ( f )| and its phase angle φa ( f ) = Ha ( f ) as follows
Magnitude, phase The function Aa ( f ) is called the magnitude response of the system, while φa ( f ) is called the
response phase response of the system. The magnitude response indicates how much each frequency
component of xa (t) is scaled as it passes through the system. That is, Aa ( f ) is the gain of
the system at frequency f . Similarly, the phase response indicates how much each frequency
component of xa (t) gets advanced in phase by the system. That is, φa ( f ) is the phase shift of
the system at frequency f . Therefore, if the input to the stable system is a pure sinusoidal tone
xa (t) = sin(2π F0 t), the steady-state output of the stable system is
The magnitude response of a real system is an even function of f , while the phase response
is an odd function of f . This is similar to the magnitude and phase spectra of a real signal.
Indeed, there is a simple relationship between the frequency response of a system and the
spectrum of a signal. To see this, consider the impulse response.
Copyright 2010 Cengage Learning. All Rights Reserved. May not be copied, scanned, or duplicated, in whole or in part. Due to electronic rights, some third party content may be suppressed from the eBook and/or eChapter(s).
Editorial review has deemed that any suppressed content does not materially affect the overall learning experience. Cengage Learning reserves the right to remove additional content at any time if subsequent rights restrictions require it.
Schilling-1120949 book November 12, 2010 9:33
DEFINITION Suppose the initial condition of a continuous-time system S is zero. Then the output of the
1.6: Impulse Response system corresponding to the unit impulse input is denoted h a (t) and is called the system
impulse response.
h a (t) = Sδa (t)
From the sifting property of the unit impulse in (1.2.13) one can show that the Fourier
transform of the unit impulse is simply a ( f ) = 1. It then follows from Definition 1.5 that
when the input is the unit impulse, the Fourier transform of the system output is Ya ( f ) = Ha ( f ).
That is, an alternative way to represent the frequency response is as the Fourier transform of
the impulse response.
Ha ( f ) = F{h a (t)} (1.2.20)
In view of (1.2.17), the magnitude response of a system is just the magnitude spectrum of
the impulse response, and the phase response is just the phase spectrum of the impulse response.
It is for this reason that the same symbol, Aa ( f ), is used to denote both the magnitude spectrum
of a signal and the magnitude response of a system. A similar remark holds for φa ( f ) which
is used to denote both the phase spectrum of a signal and the phase response of a system.
FIGURE 1.15: Ha ( f )
Frequency
Response of Ideal 6
Lowpass Filter
1
- f
−B 0 B
Copyright 2010 Cengage Learning. All Rights Reserved. May not be copied, scanned, or duplicated, in whole or in part. Due to electronic rights, some third party content may be suppressed from the eBook and/or eChapter(s).
Editorial review has deemed that any suppressed content does not materially affect the overall learning experience. Cengage Learning reserves the right to remove additional content at any time if subsequent rights restrictions require it.
Schilling-1120949 book November 12, 2010 9:33
150
h (t)
100
a
50
−50
−0.04 −0.03 −0.02 −0.01 0 0.01 0.02 0.03 0.04
t (sec)
Notice that the sinc function, and therefore the impulse response, is not a causal signal.
But h a (t) is the filter output when a unit impulse input is applied at time t = 0. Consequently,
for the ideal filter we have a causal input producing a noncausal output. This is not possible
for a physical system. Therefore, the frequency response in Figure 1.15 cannot be realized
with physical hardware. In Section 1.4, we examine some lowpass filters that are physically
realizable that can be used to approximate the ideal frequency response characteristic.
• • • • • • • • • ••••• ••
Copyright 2010 Cengage Learning. All Rights Reserved. May not be copied, scanned, or duplicated, in whole or in part. Due to electronic rights, some third party content may be suppressed from the eBook and/or eChapter(s).
Editorial review has deemed that any suppressed content does not materially affect the overall learning experience. Cengage Learning reserves the right to remove additional content at any time if subsequent rights restrictions require it.
Schilling-1120949 book November 12, 2010 9:33
Thus δT (t) consists of unit impulses at integer multiples of the sampling interval T . The
Sampled signal sampled version of signal xa (t) is denoted x̂a (t), and is defined as the following product.
x̂a (t) = xa (t)δT (t) (1.3.2)
Since x̂a (t) is obtained from xa (t) by multiplication by a periodic signal, this process is
Amplitude a form of amplitude modulation of δT (t). In this case δT (t) plays a role similar to the high-
modulation frequency carrier wave in AM radio, and xa (t) represents the low-frequency information signal.
A block diagram of the impulse model of sampling is shown in Figure 1.17.
Using the basic properties of the unit impulse in (1.2.11), the sampled version of xa (t) can
be written as follows.
x̂a (t) = xa (t)δT (t)
∞
= xa (t) δa (t − kT )
k=−∞
∞
= xa (t)δa (t − kT )
k=−∞
∞
= xa (kT )δa (t − kT ) (1.3.3)
k=−∞
Thus the sampled version of xa (t) is the following amplitude modulated impulse train.
∞
x̂a (t) = x(k)δa (t − kT ) (1.3.4)
k=−∞
It is assumed that the reader is familiar with the basics of the Laplace transform. Tables of
common Laplace transform pairs and Laplace transform properties can be found in Appendix 1.
Comparing (1.3.5) with (1.2.16) it is clear that for causal signals, the Fourier transform is just
the Laplace transform, but with the complex variable s replaced by j2π f . Consequently, the
Copyright 2010 Cengage Learning. All Rights Reserved. May not be copied, scanned, or duplicated, in whole or in part. Due to electronic rights, some third party content may be suppressed from the eBook and/or eChapter(s).
Editorial review has deemed that any suppressed content does not materially affect the overall learning experience. Cengage Learning reserves the right to remove additional content at any time if subsequent rights restrictions require it.
Schilling-1120949 book November 12, 2010 9:33
dT(t)
0.5
0
0 0.5 1 1.5 2 2.5 3 3.5 4
t (sec)
(b) Amplitude Modulated Impulse Train
4
3
xa(t)
0
0 0.5 1 1.5 2 2.5 3 3.5 4
t (sec)
spectrum of a causal signal can be obtained from its Laplace transform as follows.
X a ( f ) = X a (s)|s= j2π f (1.3.6)
At this point a brief comment about notation is in order. Note that the same base symbol, X a , is
being used to denote both the Laplace transform, X a (s), in (1.3.5), and the Fourier transform,
X a ( f ), in (1.2.16). Clearly, an alternative approach would be to introduce distinct symbols for
each. However, the need for additional symbols will arise repeatedly in subsequent chapters,
so using separate symbols in each case quickly leads to a proliferation of symbols that can
be confusing in its own right. Instead, the notational convention adopted here is to rely on
the argument type, a complex s or a real f , to distinguish between the two cases and dictate
the meaning of X a . The subscript a denotes a continuous-time or analog quantity. The less
cumbersome X , without a subscript, is reserved for discrete-time quantities introduced later.
If the periodic impulse train δT (t) is expanded into a complex Fourier series, the result can
be substituted into the definition of x̂a (t) in (1.3.2). Taking the Laplace transform of x̂a (t) and
converting the result using (1.3.6), we then arrive at the following expression for the spectrum
of the sampled version of xa (t).
∞
1
X̂ a ( f ) = X a ( f − if s ) (1.3.7)
T i=−∞
1.3.2 Aliasing
The representation of the spectrum of the sampled version of xa (t) depicted in (1.3.7) is called
Aliasing formula the aliasing formula. The aliasing formula holds the key to determining conditions under which
the samples x(k) contain all the information necessary to completely reconstruct or recover
xa (t) from the samples. To see this, we first consider the notion of a bandlimited signal.
Copyright 2010 Cengage Learning. All Rights Reserved. May not be copied, scanned, or duplicated, in whole or in part. Due to electronic rights, some third party content may be suppressed from the eBook and/or eChapter(s).
Editorial review has deemed that any suppressed content does not materially affect the overall learning experience. Cengage Learning reserves the right to remove additional content at any time if subsequent rights restrictions require it.
Schilling-1120949 book November 12, 2010 9:33
The aliasing formula in (1.3.7) is quite revealing when it is applied to bandlimited signals.
Notice that the aliasing formula says that the spectrum of the sampled version of a signal is
just a sum of scaled and shifted spectra of the original signal with the replicated versions of
X a ( f ) centered at integer multiples of the sampling frequency f s . This is a characteristic of
amplitude modulation in general where the unshifted spectrum (i = 0) is called the base band
Base, side bands and the shifted spectra (i = 0) are called side bands. An illustration comparing the magnitude
spectra of xa (t) and x̂a (t) is shown in Figure 1.19.
Undersampling The case shown in Figure 1.19 corresponds to f s = 3B/2 and is referred to as undersam-
pling because f s ≤ 2B. The details of the shape of the even function |X a ( f )| within [−B, B]
are not important, so for convenience a triangular spectrum is used. Note how the sidebands in
Figure 1.19b overlap with each other and with the baseband. This overlap is an indication of
Aliasing an undesirable phenomenon called aliasing. As a consequence of the overlap, the shape of the
spectrum of x̂a (t) in [−B, B] has been altered and is different from the shape of the spectrum
of xa (t) in Figure 1.19a. The end result is that no amount of signal-independent filtering of
x̂a (t) will allow us to recover the spectrum of xa (t) from the spectrum of x̂a (t). That is, the
overlap or aliasing has caused the samples to be corrupted to the point that the original signal
xa (t) can no longer be recovered from the samples. Since xa (t) is bandlimited, it is evident
0.5
0
−300 −200 −fs −100 0 100 fs 200 300
f (Hz)
(b) Magnitude Spectrum of Sampled Signal
200
fd
150
|Xa(f)|
100
50
0
−300 −200 −fs −100 0 100 fs 200 300
f (Hz)
Copyright 2010 Cengage Learning. All Rights Reserved. May not be copied, scanned, or duplicated, in whole or in part. Due to electronic rights, some third party content may be suppressed from the eBook and/or eChapter(s).
Editorial review has deemed that any suppressed content does not materially affect the overall learning experience. Cengage Learning reserves the right to remove additional content at any time if subsequent rights restrictions require it.
Schilling-1120949 book November 12, 2010 9:33
that there will be no aliasing if the sampling rate is sufficiently high. This fundamental result
is summarized in the Shannon sampling theorem.
PROPOSITION
Suppose a continuous-time signal xa (t) is bandlimited to B Hz. Let x̂a (t) denote the
1.1: Signal Sampling
sampled version of xa (t) using impulse sampling with a sampling frequency of f s . Then the
samples x(k) contain all the information necessary to recover the original signal xa (t) if
f s > 2B
From the Fourier transform pair table in Appendix 1, the spectrum of xa (t) is
j[δ( f + 90) − δ( f − 90)]
Xa( f ) =
2
Thus xa (t) is a bandlimited signal with bandwidth B = 90 Hz. From the sampling theorem,
we need f s > 180 Hz to avoid aliasing. Suppose xa (t) is sampled at the rate f s = 100 Hz. In
this case T = .01 seconds, and the samples are
x(k) = xa (kT )
= sin(180π kT )
= sin(1.8π k)
= sin(2π k − .2π k)
= sin(2π k) cos(.2π k) − cos(2π k) sin(.2π k)
= − sin(.2π k)
= − sin(20π kT )
Thus the samples of the 90 Hz signal xa (t) = sin(180π t) are identical to the samples of the
following lower-frequency signal that has its power concentrated at 10 Hz.
xb (t) = − sin(20π t)
A plot comparing the two signals xa (t) and xb (t) and their shared samples is shown in
Figure 1.20.
Copyright 2010 Cengage Learning. All Rights Reserved. May not be copied, scanned, or duplicated, in whole or in part. Due to electronic rights, some third party content may be suppressed from the eBook and/or eChapter(s).
Editorial review has deemed that any suppressed content does not materially affect the overall learning experience. Cengage Learning reserves the right to remove additional content at any time if subsequent rights restrictions require it.
Another Random Scribd Document
with Unrelated Content
CHAPTER XIX.
n the day after the breaking of the bridge, the king, the
Prince Alfonso, the Prince Enrique, the various masters of
the orders, and a great part of the army, crossed the
Guadalquivir and commenced an attack on Triana, while
the bold Admiral Bonifaz approached with his ships and assaulted
the place from the water. But the Christian army was unprovided
with ladders or machines for the attack, and fought to great
disadvantage. The Moors, from the safe shelter of their walls and
towers, rained a shower of missiles of all kinds. As they were so high
above the Christians, their arrows, darts, and lances came with the
greater force. They were skillful with the cross-bow, and had engines
of such force that the darts which they discharged would sometimes
pass through a cavalier all armed, and bury themselves in the earth.
[93]
The very women combated from the walls, and hurled down
stones that crushed the warriors beneath.
While the army was closely investing Triana, and fierce
encounters were daily taking place between Moor and Christian,
there arrived at the camp a youthful Infanzon, or noble, of proud
lineage. He brought with him a shining train of vassals, all newly
armed and appointed, and his own armor, all fresh and lustrous,
showed none of the dents and bruises and abuses of the war. As this
gay and gorgeous cavalier was patrolling the camp, with several
cavaliers, he beheld Garci Perez pass by, in armor and
accoutrements all worn and soiled by the hard service he had
performed, and he saw a similar device to his own, of white waves,
emblazoned on the scutcheon of this unknown warrior. Then the
nobleman was highly ruffled and incensed, and he exclaimed, “How
is this? who is this sorry cavalier that dares to bear these devices?
By my faith, he must either give them up or show his reasons for
usurping them.” The other cavaliers exclaimed, “Be cautious how
you speak; this is Garci Perez; a braver cavalier wears not sword in
Spain. For all he goes thus modestly and quietly about, he is a very
lion in the field, nor does he assume anything that he cannot well
maintain. Should he hear this which you have said, trust us he would
not rest quiet until he had terrible satisfaction.”
Now so it happened that certain mischief-makers carried word to
Garci Perez of what the nobleman had said, expecting to see him
burst into fierce indignation, and defy the other to the field. But
Garci Perez remained tranquil, and said not a word.
Within a day or two after, there was a sally from the castle of
Triana and a hot skirmish between the Moors and Christians; and
Garci Perez and the Infanzon, and a number of cavaliers, pursued
the Moors up to the barriers of the castle. Here the enemy rallied
and made a fierce defense, and killed several of the cavaliers. But
Garci Perez put spurs to his horse, and couching his lance, charged
among the thickest of the foes, and followed by a handful of his
companions, drove the Moors to the very gates of Triana. The Moors
seeing how few were their pursuers turned upon them, and dealt
bravely with sword and lance and mace, while stones and darts and
arrows were rained down from the towers above the gates. At length
the Moors took refuge within the walls, leaving the field to the
victorious cavaliers. Garci Perez drew off coolly and calmly amidst a
shower of missiles from the wall. He came out of the battle with his
armor all battered and defaced; his helmet bruised, the crest broken
off, and his buckler so dented and shattered that the device could
scarcely be perceived. On returning to the barrier, he found there
the Infanzon, with his armor all uninjured, and his armorial bearing
as fresh as if just emblazoned, for the vaunting warrior had not
ventured beyond the barrier. Then Garci Perez drew near to the
Infanzon, and eying him from head to foot, “Señor cavalier,” said he,
“you may well dispute my right to wear this honorable device in my
shield, since you see I take so little care of it that it is almost
destroyed. You, on the other hand, are worthy of bearing it. You are
the guardian angel of honor, since you guard it so carefully as to put
it to no risk. I will only observe to you that the sword kept in the
scabbard rusts, and the valor that is never put to the proof becomes
sullied.”[94]
At these words the Infanzon was deeply humiliated, for he saw
that Garci Perez had heard of his empty speeches, and he felt how
unworthily he had spoken of so valiant and magnanimous a cavalier.
“Señor cavalier,” said he, “pardon my ignorance and presumption;
you alone are worthy of bearing those arms, for you derive not
nobility from them, but ennoble them by your glorious deeds.”
Then Garci Perez blushed at the praises he had thus drawn upon
himself, and he regretted the harshness of his words towards the
Infanzon, and he not merely pardoned him all that had passed, but
gave him his hand in pledge of amity, and from that time they were
close friends and companions in arms.[95]
CHAPTER XX.
Geoffrey Crayon.
LEGEND OF DON MUNIO SANCHO DE HINOJOSA.
THE END.
FOOTNOTES
[1] Many of the facts in this legend are taken from an old chronicle, written
in quaint and antiquated Spanish, and professing to be a translation from the
Arabian chronicle of the Moor Rasis, by Mohammed, a Moslem writer, and Gil
Perez, a Spanish priest. It is supposed to be a piece of literary mosaic work,
made up from both Spanish and Arabian chronicles; yet, from this work most
of the Spanish historians have drawn their particulars relative to the fortunes
of Don Roderick.
[2] Florain, de Ocampo, lib. 3, c. 12. Justin, Abrev. Trog Pomp., lib. 44.
Bleda, Cronica, lib. 2, c. 3.
[8] “Como esta Infanta era muy hermosa, y el Rey [Don Rodrigo] dispuesto
y gentil hombre, entro por medio el amor y aficion, y junto con el regalo con
que la avia mandado hospedar y servir ful causa que el rey persuadio esta
Infanta que si se tornava a su ley de christiano la tomaria por muger, y que
la haria señora de sus Reynos. Con esta persuasion ella fue contenta, y
aviendose vuelto christiana, se caso con ella, y se celebraron sus bodas con
muchas fiestas y regozijos, como era razon.”—Abulcasim, Conq’st de Espan,
cap. 3.
[9] Condes Espatorios; so called from the drawn swords of ample size and
breadth with which they kept guard in the ante-chambers of the Gothic
kings. Comes Spathariorum, custodum corporis Regis Profectus. Hunc et
Propospatharium appellatum existimo.—Patr. Pant. de Offic. Goth.
[11] From the minute account of the good friar, drawn from the ancient
chronicles, it would appear that the walls of the tower were pictured in
mosaic work.
[22] This name was given to it subsequently by the Arabs. It signifies the
River of Death. Vide Pedraza, Hist. Granad. p. 3, c. 1.
[31] In this legend most of the facts respecting the Arab inroads into Spain
are on the authority of Arabian writers, who had the most accurate means of
information. Those relative to the Spaniards are chiefly from old Spanish
chronicles. It is to be remarked that the Arab accounts have most the air of
verity, and the events as they relate them are in the ordinary course of
common life. The Spanish accounts, on the contrary, are full of the
marvelous; for there were no greater romancers than the monkish
chroniclers.
[34] The house shown as the ancient residence of Aben Habuz is called la
Casa del Gallo, or the house of the weathercock; so named, says Pedraza, in
his history of Granada, from a bronze figure of an Arab horseman, armed
with lance and buckler, which once surmounted it, and which varied with
every wind. On this warlike weathercock was inscribed, in Arabic characters,
—
The Casa del Gallo, even until within twenty years, possessed two great
halls beautifully decorated with morisco reliefs. It then caught fire and was so
damaged as to require to be nearly rebuilt. It is now a manufactory of coarse
canvas, and has nothing of the Moorish character remaining. It commands a
beautiful view of the city and the vega.
[38] According to Arabian legends, this table was a mirror revealing all great
events; insomuch that by looking on it the possessor might behold battles
and sieges and feats of chivalry, and all actions worthy of renown; and might
thus ascertain the truth of all historic transactions. It was a mirror of history
therefore; and had very probably aided King Solomon in acquiring that
prodigious knowledge and wisdom for which he was renowned.
Our website is not just a platform for buying books, but a bridge
connecting readers to the timeless values of culture and wisdom. With
an elegant, user-friendly interface and an intelligent search system,
we are committed to providing a quick and convenient shopping
experience. Additionally, our special promotions and home delivery
services ensure that you save time and fully enjoy the joy of reading.
ebookultra.com