DCSP-11 Jianfeng Feng

1. Data transmission 2. Information theory

3. Signal Representation idea: time vs. Frequency ( continuous FT)

Sequences and their representation A sequence is an infinite series of real numbers { x(n) }, which is written { x(n) } = {…, x(-1),x(0),x(1),x(2), …,x(n), … }

Sequences and their representation A sequence is an infinite series of real numbers { x(n) }, which is written { x(n) } = {…, x(-1),x(0),x(1),x(2), …,x(n), … } This can be used to represent a sampled signal, i.e. x(n) = x(nT), where x(t) is the original (continuous) function of time. (might prefer x[n]) Q: we can not work on x(t), how about x(n)?

Discrete Time Fourier Transform (DTFT) The basic tool of signal analysis is the Fourier transform (DTFT)

Definition and properties: The DTFT gives the frequency representation of a discrete time sequence with infinite length.

Definition and properties: The DTFT gives the frequency representation of a discrete time sequence with infinite length. X( ): frequency domain x(n): time domain

Find the DC term ? Calculate the power spectrum?

the unit impulse

Computation of the DTFT It is well known that the whole Fourier approach to signal analysis is based on the expansion of a signal in terms of sinusoids or, more precisely complex exponentials. In this approach we begin analyzing a signal by determining the frequencies contributing to its spectrum in terms of magnitudes and phases.

For example, if a sequence is a sinusoid x(n)=cos( 0 n) of infinite length, its DTFT yields two `delta' functions,