A novel pipeline design for the realization of the prime factor FFT
An extremely efficient pipeline architecture is proposed for the realization of the prime factor algorithm (PFA). Using the extended diagonal feature of the Chinese remainder theorem mapping, it is shown that data transactions during the computation can be efficiently carried out with the simplest c...
Gespeichert in:
Hauptverfasser: | , |
---|---|
Format: | Tagungsbericht |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext bestellen |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Schreiben Sie den ersten Kommentar!