Discrete-Time Signals: Time-Domain Representation Signals are represented as sequences of numbers, called samples Sample value of a typical signal or sequence denoted as x[n] with n being an integer in the range-∞≤n≤∞ ·x[n] defined only for integer values of and undefined for non-integer values

Z-Transform The DTFT provides a frequency-domain representation of discrete-time signals and LTI discrete-time systems Because of the convergence condition, in many cases. the DTFT of a sequence may not exist As a result, it is not possible to make use of such frequency-domain characterization in these cases

Later in the course we shall review various methods of designing frequency-selective filters satisfying prescribed specifications · We now describe several loworder- FIR and IIR digital filters with reasonable selective frequency responses that often are satisfactory in a number of applications Copyright 2001, S. K. Mitra

C54x的指令系统包含助记符指令和代数指令两 种形式。 助记符指令:是一种采用助记符号表示的类似于 汇编语言的指令; 代数指令:是一种比汇编语言更高级,类似于高 级语言的代数形式指令,具有接近汇编语言的特点。 两种指令具有相同的功能。本章着重介绍助记符 指令的分类及基本功能。其内容有:

可编程DSP芯片开发需要一套完整的软、硬件开 发工具。通常可分成代码生成工具和代码调试工具两 大类。 代码生成工具是指将高级语言或汇编语言编写的 DSP程序转换成可执行的DSP芯片目标代码的工具程 序,主要包括汇编器、链接器和C编译器以及一些辅 助工具程序等 代码调试工具包括C/汇编语言源码调试器、仿真 器等

长期以来,快速傅氏变换(Fast Fourier Transform)和离散小波变换(Discrete Wavelet Transform)在数字信号处理、石油勘探、地震预报、医学断层诊断、编码理论

(1)x(n)是有限长序列,且长度为M。与 Fourier换和z变换不同,n仅定义在o,m-1]的整数区间上; (2)变换核为W=eN,将时域序列x(n)变换为频域序列X(k)

①直接利用DFT计算:复乘次数为N2,复加次数为N(N-1)利用FT计算:复乘次数为og:n复加次数为log:解

DSP系统的硬件设计,在设计思路和资源组织上与一般的CPU和MCU有所不同。本章主要介绍基于TMS320C54X芯片的DSP系统硬件设计,内容有:

一、多总线结构,三组16-bit数据总线和一组程序总线 二、40-bit算术逻辑单元(ALU),包括一个40- bit的桶形 三、移位器和两个独立的40-bit加器 四、17x17-bit并行乘法器,连接一个40-bit的专用加法器