|
|
|
|
|
|
Structure and Interpretation of Systems and Signals ( EE401) 信號(hào)與系統(tǒng)基礎(chǔ) 視頻課程 ( Berkeley ) (28課時(shí) ¥88) Instructor: Prof. Babak Ayazifar
Structure and Interpretation of Systems and Signals 是是UC Berkekey本科生課程 ,是信號(hào)與系統(tǒng)相關(guān)課程基礎(chǔ)的入門(mén)課程, 共28講,每講75分鐘左右。課程視頻全為.rm格式,同時(shí)有與視頻課程內(nèi)容配套的部分課程講義;有了課程講義讓您的學(xué)習(xí)更有效,在潛移默化中提高專業(yè)知識(shí)和英語(yǔ)能力。 加州大學(xué)伯克萊分校(UC Berkeley)作為世界一流大學(xué),有著世界頂級(jí)的大師,所設(shè)課程也都是精品中的精品,緊跟最新科技的進(jìn)展。本站推出的美國(guó)一流大學(xué)精品視頻課程套裝,讓您足不出戶就能一睹世界一流大學(xué)大師教學(xué)的風(fēng)采;聆聽(tīng)大師的聲音、拓展國(guó)際化的視野、與國(guó)際水平看齊、實(shí)現(xiàn)自我價(jià)值的提升。 |
|
Course Description: |
This course provides an accessible introduction to signals and systems for electrical engineering, computer engineering, and computer science students. Here introduces mathematical modeling techniques used in the design of electronic systems. An important keyword here is "mathematical." Signals are defined as functions on respective sets. Examples include:
-
Continuous-time signals (audio, radio, voltages);
-
Discrete-time signals (digital audio, synchronous circuits);
-
Images (discrete and continuous);
-
Discrete-event signals; and
-
Sequences.
Systems are defined as mappings on signals. The notion of the state is discussed in a general way. Feedback systems and automata illustrate alternative approaches to modeling state in systems. Automata theory is studied using Mealy machines with input and output. Notions of equivalence of automata and concurrent composition are introduced. Hybrid systems combine time-based signals with event sequences. Difference and differential equations are considered as models for linear, time-invariant state machines. Frequency domain models for signals and frequency response for systems are investigated. Sampling of continuous signals is discussed to relate continuous time and discrete time signals. Applications include communications systems, audio, video, and image processing systems, and control systems. A MATLAB-based laboratory is an integral part of the course. |
Textbooks: |
E. A. Lee and P. Varaiya, Structure and Interpretation of Signals and Systems, Addison-Wesley, 2003. |
Course objectives: |
This course introduces mathematical modeling techniques used in the study of signals and systems. Its intention is to promote rigorous thinking and mathematical intuition about, and an appreciation for a multidisciplinary study of, signals systems through precise modeling. |
Course Schedule |
Week |
Topic |
1 |
The first week motivates forthcoming material by illustrating how signals can be modeled abstractly as functions on sets. The emphasis is on characterizing the domain and the range, not on characterizing the function itself. The startup sequence of a voiceband data modem is used as an illustration, with a supporting applet that plays the very familiar sound of the handshake of V32.bis modem, and examines the waveform in both the time and frequency domain. The domain and range of the following signal types is given: sound, images, position in space, angles of a robot arm, binary sequences, word sequences, and event sequences. Since often the first day of the first week is a holiday, and the first class needs to be largely devoted to logistics, there is really only one lecture in which to do this. |
2 |
The second week introduces systems as functions that map functions (signals) into functions (signals). Again, it should focus not on how the function is defined, but rather on what is the domain and range. Block diagrams are defined as a visual syntax for composing functions. Applications considered are DTMF signaling, modems, digital voice, and audio storage and retrieval. These all share the property that systems are required to convert domains of functions. For example, to transmit a digital signal through the telephone system, the digital signal has to be converted into a signal in the domain of the telephone system (i.e., a bandlimited audio signal). |
3 |
Week 3 is when the students get seriously into Matlab. The first lecture in this week is therefore devoted to the problem of relating declarative and imperative descriptions of signals and systems. This sets the framework for making the intellectual connection between the labs and the mathematics. The rest of the week is devoted to introducing the notion of state and state machines. State machines are described by a function \set{update} that, given the current state and input, returns the new state and output. In anticipation of composing state machines, the concept of \textit{stuttering} is introduced. This is a slightly difficult concept to introduce at this time because it has no utility until you compose state machines. But introducing it now means that we don't have to change the rules later when we compose machines. |
4 |
The fourth week deals with nondeterminism and equivalence in state machines. Equivalence is based on the notion of simulation, so simulation relations and bisimulation are defined for both deterministic and nondeterministic machines. These are used to explain that two state machines may be equivalent even if they have a different number of states, and that one state machine may be an abstraction of another, in that it has all input/output behaviors of the other (and then some). |
5 |
This week is devoted to composition of state machines. The deep concepts are synchrony, which gives a rigorous semantics to block diagrams, and feedback. The most useful concept to help subsequent material is that feedback loops with delays are always well formed. |
6 |
We consider linear systems as state machines where the state is a vector of reals. Difference equations and differential equations are shown to describe such state machines. The notions of linearity and superposition are introduced, and convolution is touched upon (to be dealt with in more detail later). This week is a good time for the first midterm, with coverage including chapters 1-4, and appendix A of the reader, except sections 4.7 and 4.8 (i.e., leaving out feedback, since until this week, they haven't worked any problems involving feedback). |
7 |
Matrices and vectors are used to compactly describe systems with linear and time-invariant state updates. Impulses and impulse response are introduced. The deep concept here is linearity, and the benefits it brings, specifically being able to write the state and output response as a convolution sum. We also begin to develop frequency domain concepts, using musical notes as a way to introduce the idea that signals can be given as sums of sinusoids. |
8 |
This week introduces frequency domain concepts and the Fourier series. Periodic signals are defined, and Fourier series coefficients are calculated by inspection for certain signals. The frequency domain decomposition is motivated by the linearity of systems considered last week (using the superposition principle), and by psychoacoustics and music. |
9 |
In this week, we consider linear, time-invariant (LTI) systems, and introduce the notion of frequency response. We show that a complex exponential is an eigenfunction of an LTI system. The Fourier series is redone using complex exponentials, and frequency response is defined in terms of this Fourier series, for periodic inputs. |
10 |
The use of complex exponentials is further explored, and phasors and negative frequencies are discussed. The concept of filtering is introduced, with the terms lowpass, bandpass, and highpass, with applications to audio and images. Composition of LTI systems is introduced, with a light treatment of feedback. |
11 |
We describe signals as sums of weighted impulses and then use linearity and time invariance to derive convolution. FIR systems are introduced, with a moving average being the prime example. Implementation of FIR systems in software and hardware is discussed, and signal flow graphs are introduced. Causality is defined. |
12 |
We relate frequency response and convolution, building the bridge between time and frequency domain views of systems. We introduce the DTFT and the continuous-time Fourier transform and derive various properties. These transforms are described as generalizations of the Fourier series where the signal need not be be periodic. |
13 |
This week wraps up the discussion of Fourier transform and then introduces sampling and aliasing as a major application of these techniques. Emphasis is on intuitive understanding of aliasing and its relationship to the periodicity of the DTFT. The Nyquist-Shannon sampling theorem is stated and related to this intuition, but its proof is not emphasized. |
14 |
This week wraps up the discussion of sampling and aliasing and begins a review that focuses on how to apply the techniques of the course in practice. Filter design is considered with the objective of illustrating how frequency response applies to real problems, and of enabling educated use of filter design software. The modem startup sequence example is considered again in some detail, zeroing in detection of the answer tone to illustrate design tradeoffs. |
15 |
This week develops applications that combine techniques of the course. The precise topics depend on the interests and expertise of the instructors, but we have specifically covered the following: Speech analysis and synthesis, using a historical Bell Labs recording of the Voder and Vocoder from 1939 and 1940 respectively, and explaining how the methods illustrated there (parametric modeling) are used in today's digital cellular telephones. Digital audio, with emphasis on encoding techniques such as MP3. Psychoacoustic concepts such as perceptual masking are related to the frequency domain ideas in the course. Vehicle automation, with emphasis on feedback control systems for automated highways. The use of discrete magnets in the road and sensors on the vehicles provides a superb illustration of the risks of aliasing. |
|
|
|
【購(gòu)買(mǎi)聯(lián)系】 【全美一流大學(xué)視頻課程套裝】 【點(diǎn)擊瀏覽更多高校視頻課程...】 |
|
|
|
|