书籍详情
信号与系统的结构和解释：英文版
作者：（美）Edward A.Lee，（美）Pravin Varaiya著
出版社：机械工业出版社
出版时间：2004-01-01
ISBN：9787111134695
定价：¥59.00
购买这本书可以去
内容简介
“这部著作的确展现了信号与系统在当前研究和应用范围内的核心地位。” ——Ravi Mazumdar，普度大学 “Lee和Varaiya在富有建设性的重大课程改革中迈出了大胆的一步。他们采用了革命性的方法，而不是逐步改动，这也正是我们所需要的。” ——Theodore Djaferis，马萨诸塞大学 本书结合加州大学伯克利分校多年成功授课的经验而编写，对信号与系统进行了深刻与清晰的剖析，力求反映当今数字化世界的成果。所用实例包含声音和图像处理，取代以前的枯燥电路，从而激发读者的兴趣去了解应用背后的理论知识。 本书的配套Web站点（WWW．aw.com/lee_varaiya）包括扩充的实验材料，可帮助读者跨越理论与实践之间的障碍。另外，还提供了更多内容，包括声音和图像交互式操作的Java小程序，帮助读者更加直观地理解书中内容。 本书适合作为电子工程、计算机工程。计算机科学等专业的教材。
作者简介
Edward A.Lee1986年于加州大学伯克利分校获得博士学位，现为该校电子工程与计算机科学系教授。他因在工程教育领域的成就和扩展性的研究而闻名。其主要研究方向为设计、建模、嵌入式仿真和实时计算系统等。他曾获得多项殊荣，其中包括工程教育界的Frederick Emmons Terman奖。
目录
Preface xi
1 Signals and systems 1
1.1 Signals 2
1.1.1 Audio signals 3
PROBING FURTHER: Household electrical power 7
1.1.2 Images 9
1.1.3 Video signals 11
PROBING FURTHER: Color and light 12
1.1.4 Signals representing physical attributes 15
1.1.5 Sequences 16
1.1.6 Discrete signals and sampling 18
1.2 Systems 23
1.2.1 Systems as functions 24
1.2.2 Telecommunications systems 25
PROBING FURTHER: Wireless
communication 27
PROBING FURTHER:LEO telephony 28
PROBING FURTHER: Encrypted speech 32
1.2.3 Audio storage and retrieval 33
1.2.4 Modem negotiation 34
1.2.5 Feedback control systems 35
1.3 Summary 40
2 Defining signals
and systems 45
2.1 Defining functions 46
2.1.1 Declarative assignment 47
2.1.2 Graphs 48
PROBING FURTHER:Relations 50
2.1.3 Tables 51
2.1.4 Procedures 52
2.1.5 Composition 53
2.1.6 Declarative versus imperative 56
PROBING FURTHER:Declarative interpretation of imperative definitions 57
2.2 Defining signals 59
2.2.1 Declarative definitions 59
2.2.2 Imperative definitions 60
2.2.3 Physical modeling 61
PROBING FURTHER:Physics of a tuningfork 61
2.3 Defining systems 63
2.3.1 Memoryless systems and systems
with memory 63
2.3.2 Differential equations 65
2.3.3 Difference equations 66
2.3.4 Composing systems by using block diagrams 68
BASiCS:Summations 69
PROBING FURTHER: Composition of graphs 71
2.4 Summary 74
INTERVIEW: Panos Antsaklis 83
3 State machines 85
3.1 Structure of state machines 86
3.1.1 Updates 87
3.1.2 Stuttering 88
3.2 Finite-state machines 90
3.2.1 State transition diagrams 90
3.2.2 Update table 96
3.3 Nondeterministic state machines 100
3.3.1 State transition diagram 100
3.3.2 Sets and functions model 103
3.4 Simulation and bisimulation 106
3.4.1 Relating behaviors 112
3.5 Summary 115
4 Composing state machines 123
4.1 Synchrony 123
4.2 Side-by-side composition 125
4.3 Cascade composition 128
4.4 Product-form inputs and outputs 132
4.5 General feed-forward composition 135
4.6 Hierarchical composition 138
4.7 Feedback 139
4.7.1 Feedback composition with no inputs 140
4.7.2 State-determined output 145
4.7.3 Feedback composition with
inputs 149
4.7.4 Constructive procedure for feedback
composition 153
4.7.5 Exhaustive search 156
PROBING FURTHER: Constructive semantics 157
4.7.6 Nondeterministic machines 158
4.8 Summary 158
INTERVIEW: Gerard Berry 166
5 Linear systems 169
5.1 Operation of an infinite-state machine 170
BASICS:Functions yielding tuples 172
5.1.1 Time 173
BASICS:Matrices and vectors 174
BASICS:Matrix arithmetic 175
5.2 Linear functions 176
5.3 The [A,B,C,D] representation of a discrete
linear system 179
5.3.1 Impulse response 181
5.3.2 One-dimensional SISO systems 183
5.3.3 Zero-state and zero-input
response 188
5.3.4 Multidimensional SISO systems 191
5.3.5 Multidimensional MIMO systems 199
PROBING FURTHER: Impulse responses of MIMO
systems 200
5.3.6 Linear input-output function 201
5.4 Continuous-time state-space models 201
PROBING FURTHER: Approximating continuous-time systems 202
5.5 Summary 203
6 Hybrid systems 209
6.1 Mixed models 211
6.2 Modal models 213
6.3 Timed automata 216
PROBING FORTHER: Internet protocols 224
6.4 More interesting dynamics 226
6.5 Supervisory control 231
6.6 Formal model 237
6.7 Summary 239
INTERVIEW: PR. Kumar 244
7 Frequency domain 247
7.1 Frequency decomposition 248
BASICS: Frequencies in Hertz and radians 248
BASICS: Ranges of frequencies 249
PROBING FURTHER: Circle of fifths 251
7.2 Phase 253
7.3 Spatial frequency 254
7.4 Periodic and finite signals 255
7.5 Fourier series 258
PROBING FURTHER: Uniform convergence of the
Fourier series 262
PROBING FURTHER: Mean square convergence
of the Fourier series 263
PROBING FURTHER: Dirichlet conditions for
validity of the Fourier series 263
7.5.1 Uniqueness of the Fourier series 265
7.5.2 Periodic, finite, and aperiodic
signals 266
7.5.3 Fourier series approximations to
images 266
7.6 Discrete-time signals 268
7.6.1 Periodicity 268
BASICS: Discrete-time frequencies 269
7.6.2 The discrete-time Fourier series 270
7.7 Summary 270
8 Frequency response 277
8.1 LTl systems 278
8.1.1 Time invariance 278
8.1.2 Linearity 283
8.1.3 Linearity and time invariance 286
8.2 Finding and using the frequency
response 289
8.2.1 Linear difference and differential
equations 292
BASICS: Sinusoids in terms of complex
exponentials 294
TIPS AND TRICKS:Phasors 294
8.2.2 The Fourier series with complex
exponentials 301
PROBING FURTHER: Relating DFS coefficients 303
8.2.3 Examples 304
8.3 Determining the Fourier series
coefficients 305
PROBING FURTHER: Formula for Fourier series
coefficients 306
PROBING FURTHER: Exchanging integrals and
summations 307
8.3.1 Negative frequencies 307
8.4 Frequency response and the Fourier series 307
8.5 Frequency response of composite systems 309
8.5.1 Cascade connection 309
8.5.2 Feedback connection 311
PROBING FURTHER: Feedback systems are LTI 312
8.6 Summary 315
INTERVIEW:Dawn Tilbury 323
9 Filtering 325
9.1 Convolution 328
9.1.1 Convolution sum and integral 328
9.1.2 Impulses 332
9.1.3 Signals as sums of weighted delta functions 333
9.1.4 Impulse response and convolution 335
9.2 Frequency response and impulse response 338
9.3 Causality 342
PROBING FURTHER: Causality 342
9.4 Finite impulse response filters 343
9.4.1 Design of FIR filters 346
9.4.2 Decibels 349
PROBING FURTHER:Decibels 350
9.5 Infinite impulse response (IIR) filters 351
9.5.1 Designing IIR filters 352
9.6 Implementation of filters 355
9.6.1 MATLAB implementation 355
PROBING FURTHER:Joua implementation of an
hTR filter 356
PROBING FURTHER: Programmable DSP
implementation of an FIR filter 357
9.6.2 Signal flow graphs 358
9.7 Summary 361
lO The four Fourier transforms 369
10.1 Notation 370
10.2 The Fourier series 370
PROBING FURTHER: Showing inverse relations 372
10.3 The discrete Fourier transform 376
10.4 The discrete-time Fourier transform 380
10.5 The continuous-time Fourier transform 383
10.6 Fourier transforms versus Fourier series 385
10.6.1 Fourier transforms of finite signals 385
10.6.2 Fourier analysis of a speech signal 387
10.6.3 Fourier transforms of periodic signals 390
10.7 Properties of Fourier transforms 393
10.7.1 Convolution 393
PROBING fURTHER:Multiplying signals 398
10.7.2 Conjugate symmetry 399
10.7.3 Time shifting 401
10.7.4 Linearity 404
10.7.5 Constant signals 405
10.7.6 Frequency shifting and modulation 407
10.8 Summary 408
INTERVIEW:Jeff Bier 422
11 Sampling and reconstruction 425
11.1 Sampling 425
11.1.1 Sampling a sinusoid 426
BASICS: Units 426
11.1.2 Aliasing 426
11.1.3 Perceived pitch experiment 428
11.1.4 Avoiding aliasing ambiguities 431
PROBING FURTHER: Antialiasing for fonts 432
11.2 Reconstruction 433
11.2.1 A model for reconstruction 434
PROBING FURTHER:Sampling 437
PROBING FURTHER: Impulse trains 438
11.3 The Nyquist-Shannon sampling theorem 438
11.4 Summary 442
12 Stability 447
12.1 Boundedness and stability 450
12.1.1 Absolutely summable and absolutely
integrable 450
12.1.2 Stability 452
PROBING FURTHER:Stable systems and their impulse response 453
12.2 The Z transform 456
12.2.1 Structure of the region of convergence 458
12.2.2 Stability and the Z transform 463
12.2.3 Rational Z tranforms and poles and zeros 463
12.3 The Laplace transform 467
12.3.1 Structure of the region of convergence 469
12.3.2 Stability and the Laplace transform 472
12.3.3 Rational Laplace tranforms and poles and zeros 474
12.4 Summary 475
INTERVlEW: Xavier Rodet 481
13 Laplace and Z transforms 483
13.1 Properties of the Z tranform 485
13.1.1 Linearity 485
13.1.2 Delay 488
13.1.3 Convolution 489
13.1.4 Conjugation 490
13.1.5 Time reversal 491
PROBING FURTHER: Derivatives of Z transforms 491
13.1.6 Multiplication by an exponential 492
13.1.7 Causal signals and the initial value
theorem 493
13.2 Frequency response and pole-zero plots 494
13.3 Properties of the Laplace transform 497
13.3.1 Integration 497
13.3.2 Sinusoidal signals 499
13.3.3 Differential equations 500
13.4 Frequency response and pole-zero plots,
continuous time 501
13.5 The inverse transforms 503
13.5.1 Inverse Z transform 503
13.5.2 Inverse Laplace transform 512
PROBING FURTHER: Inverse transform as on
integral 514
PROBING FURTHER:Differentiation property of the Laplace transform 515
13.6 Steady-state response 515
13.7 Linear difference and differential equations 519
13.7.1 LTI differential equations 525
13.8 State-space models 530
13.8.1 Continuous-time state-space models 535
13.9 Summary 541
14 Composition and feedback control 549
14.1 Cascade composition 550
14.1.1 Stabilization 550
14.1.2 Equalization 551
14.2 Parallel composition 557
14.2.1 Stabilization 558
14.2.2 Noise cancelation 559
14.3 Feedback composition 562
14.3.1 Proportional controllers 564
14.4 PID controllers 574
14.5 Summary 580
A Sets and functions 589
A. 1 Sets 589
A.1.1 Assignment and assertion 591
A.1.2 Sets of sets 592
A.1.3 Variables and predicates 592
PROBING FURTHER:Predicates in MATLAB 593
A.1.4 Quantification over sets 594
A.1.5 Some useful sets 596
A.1.6 Set operations: union, intersection,
complement 597
A.1.7 Predicate operations 597
A.1.8 Permutations and combinations 599
BASICS: Tuples, strings, and sequences 600
A.1.9 Product sets 601
A.1.10 Evaluating an expression 605
A.2 Functions 608
A.2.1 Defining functions 610
A.2.2 Tuples and sequences as functions 610
A.2.3 Function properties 611
PROBING FURTHER:Infinite sets 612
PROBING FURTHER:Even bigger sets 613
A.3 Summary 614
B Complex numbers 619
B.1 Imaginary numbers 619
B.2 Arithmetic of imaginary numbers 621
B.3 Complex numbers 622
B.4 Arithmetic of complex numbers 622
B.5 Exponentials 624
B.6 Polar coordinates 626
BASICS: From Cartesian to polar coordinates 627
Symbols 635
Index 637
1 Signals and systems 1
1.1 Signals 2
1.1.1 Audio signals 3
PROBING FURTHER: Household electrical power 7
1.1.2 Images 9
1.1.3 Video signals 11
PROBING FURTHER: Color and light 12
1.1.4 Signals representing physical attributes 15
1.1.5 Sequences 16
1.1.6 Discrete signals and sampling 18
1.2 Systems 23
1.2.1 Systems as functions 24
1.2.2 Telecommunications systems 25
PROBING FURTHER: Wireless
communication 27
PROBING FURTHER:LEO telephony 28
PROBING FURTHER: Encrypted speech 32
1.2.3 Audio storage and retrieval 33
1.2.4 Modem negotiation 34
1.2.5 Feedback control systems 35
1.3 Summary 40
2 Defining signals
and systems 45
2.1 Defining functions 46
2.1.1 Declarative assignment 47
2.1.2 Graphs 48
PROBING FURTHER:Relations 50
2.1.3 Tables 51
2.1.4 Procedures 52
2.1.5 Composition 53
2.1.6 Declarative versus imperative 56
PROBING FURTHER:Declarative interpretation of imperative definitions 57
2.2 Defining signals 59
2.2.1 Declarative definitions 59
2.2.2 Imperative definitions 60
2.2.3 Physical modeling 61
PROBING FURTHER:Physics of a tuningfork 61
2.3 Defining systems 63
2.3.1 Memoryless systems and systems
with memory 63
2.3.2 Differential equations 65
2.3.3 Difference equations 66
2.3.4 Composing systems by using block diagrams 68
BASiCS:Summations 69
PROBING FURTHER: Composition of graphs 71
2.4 Summary 74
INTERVIEW: Panos Antsaklis 83
3 State machines 85
3.1 Structure of state machines 86
3.1.1 Updates 87
3.1.2 Stuttering 88
3.2 Finite-state machines 90
3.2.1 State transition diagrams 90
3.2.2 Update table 96
3.3 Nondeterministic state machines 100
3.3.1 State transition diagram 100
3.3.2 Sets and functions model 103
3.4 Simulation and bisimulation 106
3.4.1 Relating behaviors 112
3.5 Summary 115
4 Composing state machines 123
4.1 Synchrony 123
4.2 Side-by-side composition 125
4.3 Cascade composition 128
4.4 Product-form inputs and outputs 132
4.5 General feed-forward composition 135
4.6 Hierarchical composition 138
4.7 Feedback 139
4.7.1 Feedback composition with no inputs 140
4.7.2 State-determined output 145
4.7.3 Feedback composition with
inputs 149
4.7.4 Constructive procedure for feedback
composition 153
4.7.5 Exhaustive search 156
PROBING FURTHER: Constructive semantics 157
4.7.6 Nondeterministic machines 158
4.8 Summary 158
INTERVIEW: Gerard Berry 166
5 Linear systems 169
5.1 Operation of an infinite-state machine 170
BASICS:Functions yielding tuples 172
5.1.1 Time 173
BASICS:Matrices and vectors 174
BASICS:Matrix arithmetic 175
5.2 Linear functions 176
5.3 The [A,B,C,D] representation of a discrete
linear system 179
5.3.1 Impulse response 181
5.3.2 One-dimensional SISO systems 183
5.3.3 Zero-state and zero-input
response 188
5.3.4 Multidimensional SISO systems 191
5.3.5 Multidimensional MIMO systems 199
PROBING FURTHER: Impulse responses of MIMO
systems 200
5.3.6 Linear input-output function 201
5.4 Continuous-time state-space models 201
PROBING FURTHER: Approximating continuous-time systems 202
5.5 Summary 203
6 Hybrid systems 209
6.1 Mixed models 211
6.2 Modal models 213
6.3 Timed automata 216
PROBING FORTHER: Internet protocols 224
6.4 More interesting dynamics 226
6.5 Supervisory control 231
6.6 Formal model 237
6.7 Summary 239
INTERVIEW: PR. Kumar 244
7 Frequency domain 247
7.1 Frequency decomposition 248
BASICS: Frequencies in Hertz and radians 248
BASICS: Ranges of frequencies 249
PROBING FURTHER: Circle of fifths 251
7.2 Phase 253
7.3 Spatial frequency 254
7.4 Periodic and finite signals 255
7.5 Fourier series 258
PROBING FURTHER: Uniform convergence of the
Fourier series 262
PROBING FURTHER: Mean square convergence
of the Fourier series 263
PROBING FURTHER: Dirichlet conditions for
validity of the Fourier series 263
7.5.1 Uniqueness of the Fourier series 265
7.5.2 Periodic, finite, and aperiodic
signals 266
7.5.3 Fourier series approximations to
images 266
7.6 Discrete-time signals 268
7.6.1 Periodicity 268
BASICS: Discrete-time frequencies 269
7.6.2 The discrete-time Fourier series 270
7.7 Summary 270
8 Frequency response 277
8.1 LTl systems 278
8.1.1 Time invariance 278
8.1.2 Linearity 283
8.1.3 Linearity and time invariance 286
8.2 Finding and using the frequency
response 289
8.2.1 Linear difference and differential
equations 292
BASICS: Sinusoids in terms of complex
exponentials 294
TIPS AND TRICKS:Phasors 294
8.2.2 The Fourier series with complex
exponentials 301
PROBING FURTHER: Relating DFS coefficients 303
8.2.3 Examples 304
8.3 Determining the Fourier series
coefficients 305
PROBING FURTHER: Formula for Fourier series
coefficients 306
PROBING FURTHER: Exchanging integrals and
summations 307
8.3.1 Negative frequencies 307
8.4 Frequency response and the Fourier series 307
8.5 Frequency response of composite systems 309
8.5.1 Cascade connection 309
8.5.2 Feedback connection 311
PROBING FURTHER: Feedback systems are LTI 312
8.6 Summary 315
INTERVIEW:Dawn Tilbury 323
9 Filtering 325
9.1 Convolution 328
9.1.1 Convolution sum and integral 328
9.1.2 Impulses 332
9.1.3 Signals as sums of weighted delta functions 333
9.1.4 Impulse response and convolution 335
9.2 Frequency response and impulse response 338
9.3 Causality 342
PROBING FURTHER: Causality 342
9.4 Finite impulse response filters 343
9.4.1 Design of FIR filters 346
9.4.2 Decibels 349
PROBING FURTHER:Decibels 350
9.5 Infinite impulse response (IIR) filters 351
9.5.1 Designing IIR filters 352
9.6 Implementation of filters 355
9.6.1 MATLAB implementation 355
PROBING FURTHER:Joua implementation of an
hTR filter 356
PROBING FURTHER: Programmable DSP
implementation of an FIR filter 357
9.6.2 Signal flow graphs 358
9.7 Summary 361
lO The four Fourier transforms 369
10.1 Notation 370
10.2 The Fourier series 370
PROBING FURTHER: Showing inverse relations 372
10.3 The discrete Fourier transform 376
10.4 The discrete-time Fourier transform 380
10.5 The continuous-time Fourier transform 383
10.6 Fourier transforms versus Fourier series 385
10.6.1 Fourier transforms of finite signals 385
10.6.2 Fourier analysis of a speech signal 387
10.6.3 Fourier transforms of periodic signals 390
10.7 Properties of Fourier transforms 393
10.7.1 Convolution 393
PROBING fURTHER:Multiplying signals 398
10.7.2 Conjugate symmetry 399
10.7.3 Time shifting 401
10.7.4 Linearity 404
10.7.5 Constant signals 405
10.7.6 Frequency shifting and modulation 407
10.8 Summary 408
INTERVIEW:Jeff Bier 422
11 Sampling and reconstruction 425
11.1 Sampling 425
11.1.1 Sampling a sinusoid 426
BASICS: Units 426
11.1.2 Aliasing 426
11.1.3 Perceived pitch experiment 428
11.1.4 Avoiding aliasing ambiguities 431
PROBING FURTHER: Antialiasing for fonts 432
11.2 Reconstruction 433
11.2.1 A model for reconstruction 434
PROBING FURTHER:Sampling 437
PROBING FURTHER: Impulse trains 438
11.3 The Nyquist-Shannon sampling theorem 438
11.4 Summary 442
12 Stability 447
12.1 Boundedness and stability 450
12.1.1 Absolutely summable and absolutely
integrable 450
12.1.2 Stability 452
PROBING FURTHER:Stable systems and their impulse response 453
12.2 The Z transform 456
12.2.1 Structure of the region of convergence 458
12.2.2 Stability and the Z transform 463
12.2.3 Rational Z tranforms and poles and zeros 463
12.3 The Laplace transform 467
12.3.1 Structure of the region of convergence 469
12.3.2 Stability and the Laplace transform 472
12.3.3 Rational Laplace tranforms and poles and zeros 474
12.4 Summary 475
INTERVlEW: Xavier Rodet 481
13 Laplace and Z transforms 483
13.1 Properties of the Z tranform 485
13.1.1 Linearity 485
13.1.2 Delay 488
13.1.3 Convolution 489
13.1.4 Conjugation 490
13.1.5 Time reversal 491
PROBING FURTHER: Derivatives of Z transforms 491
13.1.6 Multiplication by an exponential 492
13.1.7 Causal signals and the initial value
theorem 493
13.2 Frequency response and pole-zero plots 494
13.3 Properties of the Laplace transform 497
13.3.1 Integration 497
13.3.2 Sinusoidal signals 499
13.3.3 Differential equations 500
13.4 Frequency response and pole-zero plots,
continuous time 501
13.5 The inverse transforms 503
13.5.1 Inverse Z transform 503
13.5.2 Inverse Laplace transform 512
PROBING FURTHER: Inverse transform as on
integral 514
PROBING FURTHER:Differentiation property of the Laplace transform 515
13.6 Steady-state response 515
13.7 Linear difference and differential equations 519
13.7.1 LTI differential equations 525
13.8 State-space models 530
13.8.1 Continuous-time state-space models 535
13.9 Summary 541
14 Composition and feedback control 549
14.1 Cascade composition 550
14.1.1 Stabilization 550
14.1.2 Equalization 551
14.2 Parallel composition 557
14.2.1 Stabilization 558
14.2.2 Noise cancelation 559
14.3 Feedback composition 562
14.3.1 Proportional controllers 564
14.4 PID controllers 574
14.5 Summary 580
A Sets and functions 589
A. 1 Sets 589
A.1.1 Assignment and assertion 591
A.1.2 Sets of sets 592
A.1.3 Variables and predicates 592
PROBING FURTHER:Predicates in MATLAB 593
A.1.4 Quantification over sets 594
A.1.5 Some useful sets 596
A.1.6 Set operations: union, intersection,
complement 597
A.1.7 Predicate operations 597
A.1.8 Permutations and combinations 599
BASICS: Tuples, strings, and sequences 600
A.1.9 Product sets 601
A.1.10 Evaluating an expression 605
A.2 Functions 608
A.2.1 Defining functions 610
A.2.2 Tuples and sequences as functions 610
A.2.3 Function properties 611
PROBING FURTHER:Infinite sets 612
PROBING FURTHER:Even bigger sets 613
A.3 Summary 614
B Complex numbers 619
B.1 Imaginary numbers 619
B.2 Arithmetic of imaginary numbers 621
B.3 Complex numbers 622
B.4 Arithmetic of complex numbers 622
B.5 Exponentials 624
B.6 Polar coordinates 626
BASICS: From Cartesian to polar coordinates 627
Symbols 635
Index 637
猜您喜欢
