Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
A 1 Million-Point FFT on a Single FPGA
Linköping University, Department of Electrical Engineering. Linköping University, Faculty of Science & Engineering.
Linköping University, Department of Electrical Engineering. Linköping University, Faculty of Science & Engineering.
Linköping University, Department of Electrical Engineering, Computer Engineering. Linköping University, Faculty of Science & Engineering.ORCID iD: 0000-0001-5739-3544
Linköping University, Department of Electrical Engineering, Computer Engineering. Linköping University, Faculty of Science & Engineering.
Show others and affiliations
2019 (English)In: IEEE Transactions on Circuits and Systems Part 1: Regular Papers, ISSN 1549-8328, E-ISSN 1558-0806, Vol. 66, no 10, p. 3863-3873Article in journal (Refereed) Published
Abstract [en]

In this paper, we present the first implementation of a 1 million-point fast Fourier transform (FFT) completely integrated on a single field-programmable gate array (FPGA), without the need for external memory or multiple interconnected FPGAs. The proposed architecture is a pipelined single-delay feedback (SDF) FFT. The architecture includes a specifically designed 1 million-point rotator with high accuracy and a thorough study of the word length at the different FFT stages in order to increase the signal-to-quantization-noise ratio (SQNR) and keep the area low. This also results in low power consumption.

Place, publisher, year, edition, pages
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC , 2019. Vol. 66, no 10, p. 3863-3873
Keywords [en]
Binary tree; Cooley-Tukey; fast Fourier transform (FFT)
National Category
Other Electrical Engineering, Electronic Engineering, Information Engineering
Identifiers
URN: urn:nbn:se:liu:diva-161406DOI: 10.1109/TCSI.2019.2918403ISI: 000489730200020OAI: oai:DiVA.org:liu-161406DiVA, id: diva2:1367440
Note

Funding Agencies|Swedish ELLIIT Program

Available from: 2019-11-04 Created: 2019-11-04 Last updated: 2020-03-26

Open Access in DiVA

fulltext(4019 kB)8 downloads
File information
File name FULLTEXT01.pdfFile size 4019 kBChecksum SHA-512
8f4157c43caacffa0cd493afc204e05c57d1cc2624c160b83fc9853fe881a9f0f959633c74038b336bd67a203b4296cead6e32104ac586c7d1272658359e076c
Type fulltextMimetype application/pdf

Other links

Publisher's full text

Search in DiVA

By author/editor
Kanders, HansMellqvist, TobiasGarrido Gálvez, MarioPalmkvist, KentGustafsson, Oscar
By organisation
Department of Electrical EngineeringFaculty of Science & EngineeringComputer Engineering
In the same journal
IEEE Transactions on Circuits and Systems Part 1: Regular Papers
Other Electrical Engineering, Electronic Engineering, Information Engineering

Search outside of DiVA

GoogleGoogle Scholar
Total: 8 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

doi
urn-nbn

Altmetric score

doi
urn-nbn
Total: 103 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf