liu.seSearch for publications in DiVA
Endre søk
RefereraExporteraLink to record
Permanent link

Direct link
Referera
Referensformat
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Annet format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annet språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf
On the efficient computation of single-bit input word length pipelined FFTs
Linköpings universitet, Institutionen för systemteknik, Elektroniksystem. Linköpings universitet, Tekniska högskolan.
Linköpings universitet, Institutionen för systemteknik, Elektroniksystem. Linköpings universitet, Tekniska högskolan.ORCID-id: 0000-0003-3470-3911
Linköpings universitet, Institutionen för systemteknik, Elektroniksystem. Linköpings universitet, Tekniska högskolan.
University of Westminster, London, United Kingdom.
2011 (engelsk)Inngår i: IEICE Electronics Express, ISSN 1349-2543, E-ISSN 1349-2543, Vol. 8, nr 17, s. 1437-1443Artikkel i tidsskrift (Fagfellevurdert) 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.

sted, utgiver, år, opplag, sider
IEICE-INST ELECTRONICS INFORMATION COMMUNICATIONS ENG, KIKAI-SHINKO-KAIKAN BLDG MINATO-KU SHIBAKOEN 3 CHOME, TOKYO, 105, JAPAN , 2011. Vol. 8, nr 17, s. 1437-1443
Emneord [en]
FFT algorithm, complexity, single-bit, word length
HSV kategori
Identifikatorer
URN: urn:nbn:se:liu:diva-71646DOI: 10.1587/elex.8.1437ISI: 000295835400011OAI: oai:DiVA.org:liu-71646DiVA, id: diva2:451816
Merknad

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)||

Tilgjengelig fra: 2011-10-27 Laget: 2011-10-27 Sist oppdatert: 2017-12-08

Open Access i DiVA

Fulltekst mangler i DiVA

Andre lenker

Forlagets fulltekst

Personposter BETA

Athar, SaimaGustafsson, OscarQureshi, Fahad

Søk i DiVA

Av forfatter/redaktør
Athar, SaimaGustafsson, OscarQureshi, Fahad
Av organisasjonen
I samme tidsskrift
IEICE Electronics Express

Søk utenfor DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetric

doi
urn-nbn
Totalt: 364 treff
RefereraExporteraLink to record
Permanent link

Direct link
Referera
Referensformat
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Annet format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annet språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf