Method of flow graph simplification for the 16-point discrete Fourier transform

An efficient method for the realization of the paired algorithm for calculation of the one-dimensional (1-D) discrete Fourier transform (DFT), by simplifying the signal-flow graph of the transform, is described. The signal-flow graph is modified by separating the calculation for real and imaginary p...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	IEEE transactions on signal processing 2005-01, Vol.53 (1), p.384-389
Hauptverfasser:	Grigoryan, A.M., Bhamidipati, V.S.
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithms Applied sciences Chaos Chaotic communication Convergence Discrete Fourier transforms Exact sciences and technology Fast Fourier transform Flow graphs Fourier transforms Graphs Information, signal and communications theory Mathematical analysis Mathematical methods Maximum likelihood estimation Multiplication paired function and transform Signal generators Signal processing Signal processing algorithms Simplification Telecommunications and information theory Transforms
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!