GitHub - Shouri14/256-FFT: Input consists of 20-bit of real and imaginary data. One FFT must be performed within 256 clocks. The design consists of 1024 butterfly operations, with 4 butterfly operations occurring concurrently. The test bench is designed to allow an error of +/- 3 lsb.

Shouri14 / 256-FFT Public

Notifications You must be signed in to change notification settings
Fork 0
Star 0

Input consists of 20-bit of real and imaginary data. One FFT must be performed within 256 clocks. The design consists of 1024 butterfly operations, with 4 butterfly operations occurring concurrently. The test bench is designed to allow an error of +/- 3 lsb.

0 stars 0 forks Branches Tags Activity

Star

Notifications

Branches Tags

Name		Name	Last commit message	Last commit date
Latest commit History 7 Commits
4114667f273e0dbdb5cb38a37cfc5f9d60d5(1).pdf		4114667f273e0dbdb5cb38a37cfc5f9d60d5(1).pdf
G25691.pdf		G25691.pdf
Radix-2-DIT-FFT-Butterfly-Architecture.png		Radix-2-DIT-FFT-Butterfly-Architecture.png
ffts18.pdf		ffts18.pdf