Continue to Site

Welcome to EDAboard.com

Welcome to our site! EDAboard.com is an international Electronics Discussion Forum focused on EDA software, circuits, schematics, books, theory, papers, asic, pld, 8051, DSP, Network, RF, Analog Design, PCB, Service Manuals... and a whole lot more! To participate you need to register. Registration is free. Click here to register now.

Register Log in

8 point sequence discrete fourier transform

Status
Not open for further replies.
B

bspandaaa

Member level 1
Joined
Jan 30, 2014
Messages
40
Helped
0
Reputation
0
Reaction score
0
Trophy points
16
Location
Visakhapatnam
Activity points
198
In Discrete Fourier Transform, We use TWIDDLE FACTOR
for obtaining the discrete Fourier transform of a particular
signal to verify its frequency spectrum...
For 8-point sequence, the Matrix multiplication
will be for [8 x 8] and [8 x 1] with
complex elements...
So it would be somewhat difficult to solve...
So please provide any trick to solve easily...
Regards
 

Hi,

this tends to the direction like an FFT works. Google for "FFT butterfly", maybe this helps.

Klaus
 

Status
Not open for further replies.

Similar threads

Part and Inventory Search

Welcome to EDABoard.com

Sponsor

Back
Top