PROPERTIESOFTHEDFT.PDFVIP

PROPERTIES OF THE DFT 1. PRELIMINARIES (a) De?nition (b) The Mod Notation (c) Periodicity of WN (d) A Useful Identity (e) Inverse DFT Proof (f) Circular Shifting (g) Circular Convolution (h) Time-reversal (i) Circular Symmetry 2. PROPERTIES (a) Perodicity property (b) Circular shift property (c) Modulation property (d) Circular convolution property (e) Parseval’s theorem (f) Time-reversal property (g) Complex-conjugation property (h) Real x[n] property (i) Real and circularly symmetric x[n] I. Selesnick DSP lecture notes 1 DFT DEFINITION The DFT of an N-point signal x[n], n ∈ ZN := {0, 1, . . . , N ? 1} is de?ned as N?1 X ?kn Z X[k] = x[n] WN , k ∈ N (1) n=0 where j 2π 2π 2π W = e N = cos + j sin N N N is the principal N-th root of unity. The original sequence x[n] can be retrieved by the inverse discrete Fourier trans- form (IDFT) N?1 1 X x[n] = X[k] W kn, n ∈ Z . N N N k=0 I. Selesnick DSP lecture notes 2 THE MOD NOTATION The notation hkiN denotes the remainder r when k is divided by N. This is also denoted as k mod N. For example h3i4 = 3 and h6i4 = 2. The following table shows hki4 for values of k from 0 to 7. k hki4 0 0 1 1 2 2 3 3 4 0 5 1 6 2 7 3 . . . . The notation hkiN is also de?ned for negative integers k. We choose the remain- der r so that it is between 0 and N ? 1. 0 ≤ hkiN ≤ N ? 1 For example, ?3 = (?1)(4) + 1 so h?3i4 = 1 and ?6 = (?2)(4) + 2 so h?6i4 = 2 I. Selesnick DSP lecture notes 3