Connexions

You are here: Home » Content » DFT as a Matrix Operation
Content Actions
Lenses

What is a lens?

Lenses

A lens is a custom view of Connexions content. You can think of it as a fancy kind of list that will let you see Connexions through the eyes of organizations and people you trust.

What is in a lens?

Lens makers point to Connexions materials (modules and collections), creating a guide that includes their own comments and descriptive tags about the content.

Who can create a lens?

Any individual Connexions member, a community, or a respected organization.

This content is ...
Affiliated with (?)
This content is either by members of the organizations listed or about topics related to the organizations listed. Click each link to see a list of all content affiliated with the organization.
  • This module is included inLens: Rice University OpenCourseWare
    By: OpenCourseWare ConsortiumAs a part of collection:"Intro to Digital Signal Processing"

    Click the "Rice University OCW" link to see all content affiliated with them.

    Rice University OCW
Tags

(?)

These tags come from the endorsement, affiliation, and other lenses that include this content.

DFT as a Matrix Operation

Module by: Robert Nowak

Summary: This module introduces linear algebra, DFT, FFT, matrix and vector.

Matrix Review

Recall:
  • Vectors in N N : xi,xi:x=x0x1x N - 1 xi xi x x0 x1 x N - 1
  • Vectors in N N : xi,xi:x=x0x1x N - 1 xi xi x x0 x1 x N - 1
  • Transposition:
    1. transpose: xT=x0x1x N - 1 x x0 x1 x N - 1
    2. conjugate: xH=x0¯x1¯x N - 1 ¯ x x0 x1 x N - 1
  • Inner product:
    1. real: xTy=i=0N-1xiyi x y i 0 N 1 xi yi
    2. complex: xHy=i=0N-1xn¯yn x y i 0 N 1 xn yn
  • Matrix Multiplication: Ax= a 0 0 a 0 1 a 0 , N - 1 a 1 0 a 1 1 a 1 , N - 1 a N - 1 , 0 a N - 1 , 1 a N - 1 , N - 1 x0x1x N - 1 =y0y1y N - 1 A x a 0 0 a 0 1 a 0 , N - 1 a 1 0 a 1 1 a 1 , N - 1 a N - 1 , 0 a N - 1 , 1 a N - 1 , N - 1 x0 x1 x N - 1 y0 y1 y N - 1 yk=n=0N-1a k n xn yk n 0 N 1 a k n xn
  • Matrix Transposition: AT= a 0 0 a 1 0 a N - 1 , 0 a 0 1 a 1 1 a N - 1 , 1 a 0 , N - 1 a 1 , N - 1 a N - 1 , N - 1 A a 0 0 a 1 0 a N - 1 , 0 a 0 1 a 1 1 a N - 1 , 1 a 0 , N - 1 a 1 , N - 1 a N - 1 , N - 1 Matrix transposition involved simply swapping the rows with columns. AH=AT¯ A A The above equation is Hermitian transpose. ATkn=Ank A k n A n k AHkn=A¯nk A k n A n k

Representing DFT as Matrix Operation

Now let's represent the DFT in vector-matrix notation. x=x0x1xN-1 x x 0 x 1 x N 1 X=X0X1XN-1N X X 0 X 1 X N 1 N Here xx is the vector of time samples and XX is the vector of DFT coefficients. How are xx and XX related: Xk=n=0N-1xn-2πNkn X k n 0 N 1 x n 2 N k n where a k n =-2πNkn=WNkn a k n 2 N k n WN k n so X=Wx X W x where XX is the DFT vector, WW is the matrix and xx the time domain vector. Wkn=-2πNkn W k n 2 N k n X=Wx0x1xN-1 X W x 0 x 1 x N 1 IDFT: xn=1Nk=0N-1Xk2πNnk x n 1 N k 0 N 1 X k 2 N n k where 2πNnk=WNnk¯ 2 N n k WN n k WNnk¯ WN n k is the matrix Hermitian transpose. So, x=1NWHX x 1 N W X where xx is the time vector, 1NWH 1 N W is the inverse DFT matrix, and XX is the DFT vector.

Comments, questions, feedback, criticisms?

Send feedback