1 / 11

CT⊃DT

CT⊃DT. DTFT. CTFT. non-periodic ⊃ periodic. CTFS. CTFT. (Impulse train)  (Impulse train). Fourier said, “ 모든 주기함수는 기본적인 주기함수의 weighted sum 으로 표시할 수 있다 . “. weight. 기본적인 주기함수. CTFS. CTFS. CTFT. DTFT. modulation. ~. ~. ~. CTFT. 1kHz. -1kHz. CTFT. CTFT. De-modulation. ~.

spiro
Download Presentation

CT⊃DT

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. CT⊃DT DTFT CTFT

  2. non-periodic ⊃ periodic CTFS CTFT

  3. (Impulse train)  (Impulse train) Fourier said, “모든주기함수는 기본적인 주기함수의 weightedsum으로 표시할 수 있다. “ weight 기본적인 주기함수 CTFS CTFS CTFT DTFT

  4. modulation ~ ~ ~ CTFT 1kHz -1kHz CTFT CTFT

  5. De-modulation ~ ~ ~ LPF CTFT 1kHz -1kHz CTFT 2 A/2 CTFT A/4 fc

  6. sampling CTFT 1kHz -1kHz CTFT 2kHz sampling CTFT 8kHz sampling CTFT

  7. Up-sampling 2kHz sampling CTFT Zero padding DTFT LPF 8kHz sampling DTFT

  8. Down-sampling 8kHz sampling DTFT DTFT 2kHz sampling DTFT

  9. DA(digital to analog) 2kHz sampling DTFT CTFT CTFT CTFT 1kHz -1kHz

  10. Practical (not ideal)DA conversion 0-th order hold sinc CTFT 1 ho(t) 0 Ts CTFT 1-st order hold 1 h1(t) (sinc)2 t 0 Ts 2Ts t CTFT

  11. X2 y[n]=x[n]+x[n-1] X1 y[n]=x[n]+x[n-1] X2 y[n]=x[n]+x[n-1] X1

More Related