liu.seSearch for publications in DiVA
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • 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
On the efficient computation of single-bit input word length pipelined FFTs
Linköping University, Department of Electrical Engineering, Electronics System. Linköping University, The Institute of Technology.
Linköping University, Department of Electrical Engineering, Electronics System. Linköping University, The Institute of Technology.ORCID iD: 0000-0003-3470-3911
Linköping University, Department of Electrical Engineering, Electronics System. Linköping University, The Institute of Technology.
University of Westminster, London, United Kingdom.
2011 (English)In: IEICE Electronics Express, ISSN 1349-2543, E-ISSN 1349-2543, Vol. 8, no 17, 1437-1443 p.Article in journal (Refereed) Published
Abstract [en]

This letter describes an efficient architecture for the computation of fast Fourier transform (FFT) algorithms with single-bit input. The proposed architecture is aimed for the first stages of pipelined FFT architectures, processing one sample per clock cycle, hence making it suiable for real-time FFT computation. Since natural input order pipeline FFTs use large memories in the early stages, it is important to keep the word length shorter in the beginning of the pipeline. By replacing the initial butterflies and rotators of an architecture with that of the proposed block, the memory requirements can be significantly reduced. Comparisons with the commonly used single delay feedback (SDF) architecture show that more than 50% of the required memory can be saved in some cases.

Place, publisher, year, edition, pages
IEICE-INST ELECTRONICS INFORMATION COMMUNICATIONS ENG, KIKAI-SHINKO-KAIKAN BLDG MINATO-KU SHIBAKOEN 3 CHOME, TOKYO, 105, JAPAN , 2011. Vol. 8, no 17, 1437-1443 p.
Keyword [en]
FFT algorithm, complexity, single-bit, word length
National Category
Signal Processing
Identifiers
URN: urn:nbn:se:liu:diva-71646DOI: 10.1587/elex.8.1437ISI: 000295835400011OAI: oai:DiVA.org:liu-71646DiVA: diva2:451816
Note

Funding Agencies|NED University, Pakistan||Higher Education Commission, Pakistan||CENIIT at Linkoping University, Sweden||Innovative Navigation using new GNSS Signals with Hybridised Technologies (INSIGHT)||UK Engineering and Physical Sciences Research Council (EPSRC)||

Available from: 2011-10-27 Created: 2011-10-27 Last updated: 2017-12-08

Open Access in DiVA

No full text

Other links

Publisher's full text

Authority records BETA

Athar, SaimaGustafsson, OscarQureshi, Fahad

Search in DiVA

By author/editor
Athar, SaimaGustafsson, OscarQureshi, Fahad
By organisation
Electronics SystemThe Institute of Technology
In the same journal
IEICE Electronics Express
Signal Processing

Search outside of DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetric score

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

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • 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