SwePub
Sök i LIBRIS databas

  Extended search

onr:"swepub:oai:DiVA.org:liu-71782"
 

Search: onr:"swepub:oai:DiVA.org:liu-71782" > Optimum Circuits fo...

  • 1 of 1
  • Previous record
  • Next record
  •    To hitlist

Optimum Circuits for Bit Reversal

Garrido Gálvez, Mario (author)
Linköpings universitet,Elektroniksystem,Tekniska högskolan
Grajal, Jesus (author)
University of Politecn Madrid
Gustafsson, Oscar (author)
Linköpings universitet,Elektroniksystem,Tekniska högskolan
 (creator_code:org_t)
Institute of Electrical and Electronics Engineers (IEEE), 2011
2011
English.
In: IEEE Transactions on Circuits and Systems - II - Express Briefs. - : Institute of Electrical and Electronics Engineers (IEEE). - 1549-7747 .- 1558-3791. ; 58:10, s. 657-661
  • Journal article (peer-reviewed)
Abstract Subject headings
Close  
  • This brief presents novel circuits for calculating bit reversal on a series of data. The circuits are simple and consist of buffers and multiplexers connected in series. The circuits are optimum in two senses: they use the minimum number of registers that are necessary for calculating the bit reversal and have minimum latency. This makes them very suitable for calculating the bit reversal of the output frequencies in hardware fast Fourier transform (FFT) architectures. This brief also proposes optimum solutions for reordering the output frequencies of the FFT when different common radices are used, including radix-2, radix-2(k), radix-4, and radix-8.

Keyword

Bit reversal
fast Fourier transform (FFT)
pipelined architecture
TECHNOLOGY
TEKNIKVETENSKAP

Publication and Content Type

ref (subject category)
art (subject category)

Find in a library

To the university's database

  • 1 of 1
  • Previous record
  • Next record
  •    To hitlist

Search outside SwePub

Kungliga biblioteket hanterar dina personuppgifter i enlighet med EU:s dataskyddsförordning (2018), GDPR. Läs mer om hur det funkar här.
Så här hanterar KB dina uppgifter vid användning av denna tjänst.

 
pil uppåt Close

Copy and save the link in order to return to this view