Optimal circuits for parallel bit reversal

In this paper, we develop novel parallel circuit designs for calculating the bit reversal. To perform bit reversal on 2 n data words, the designs take 2 k (k <; n) words as input each cycle. The circuits consist of concatenated single-port buffers and 2-to-1 multiplexers and use minimum number of...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:2017 54th ACM/EDAC/IEEE Design Automation Conference (DAC) s. 1 - 6
Hlavní autoři: Ren Chen, Prasanna, Viktor K.
Médium: Konferenční příspěvek
Jazyk:angličtina
Vydáno: IEEE 01.06.2017
Témata:
Buffer storage
Circuit synthesis
Delays
Hardware
Memory management
Ports (Computers)
Switches
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:In this paper, we develop novel parallel circuit designs for calculating the bit reversal. To perform bit reversal on 2 n data words, the designs take 2 k (k <; n) words as input each cycle. The circuits consist of concatenated single-port buffers and 2-to-1 multiplexers and use minimum number of registers for control. The designs consume minimum number of single-port memory banks that are necessary for calculating continuous-flow bit reversal, as well as near optimal 2 n memory words. The proposed parallel circuits can be built for any given fixed k and n , and achieve superior performance over state-of-the-art for calculating the bit reversal in parallel multi-path FFT architectures.
DOI:10.1145/3061639.3062295