A better FFT bit-reversal algorithm without tables

التفاصيل البيبلوغرافية
العنوان: A better FFT bit-reversal algorithm without tables
المؤلفون: A.A. Yong
المصدر: IEEE Transactions on Signal Processing. 39:2365-2367
بيانات النشر: Institute of Electrical and Electronics Engineers (IEEE), 1991.
سنة النشر: 1991
مصطلحات موضوعية: Loop (topology), Sequence, Split-radix FFT algorithm, Computer science, Heuristic (computer science), Signal Processing, Fast Fourier transform, Prime-factor FFT algorithm, Electrical and Electronic Engineering, Algorithm, Discrete Fourier transform, Twiddle factor
الوصف: The bit-reversal counteralgorithm of B. Gold and C.M. Radar (1969) bit reverses a continuous sequence of N numbers by running a loop N -1 times. The heuristic approach presented repeats a similar loop only N/4 times. >
تدمد: 1053-587X
URL الوصول: https://explore.openaire.eu/search/publication?articleId=doi_________::449e7a9972f856588f12fd94c6bab659
https://doi.org/10.1109/78.91199
حقوق: CLOSED
رقم الأكسشن: edsair.doi...........449e7a9972f856588f12fd94c6bab659
قاعدة البيانات: OpenAIRE