Výsledky vyhledávání - "Rader's FFT algorithm"

Autor: Keith John Jones

Publikováno v: The Regularized Fast Hartley Transform ISBN: 9783030682446
The Regularized Fast Hartley Transform
The Regularized Fast Hartley Transform ISBN: 9789048139163

This chapter introduces the DHT and discusses those aspects of its solution, as obtained via the FHT, which make it an attractive choice for applying to the real-data DFT problem. This involves first showing how the DFT may be obtained from the DHT,

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4084fc8229f407670a9529c796cb7442
https://doi.org/10.1007/978-3-030-68245-3_3

Zobrazit plný text záznamu

FFT formulations of adaptive Fourier decomposition

Autor: Min Ku, Jianzhong Wang, Tao Qian, You Gao

Publikováno v: Journal of Computational and Applied Mathematics. 324:204-215

Adaptive Fourier decomposition (AFD) has been found to be among the most effective greedy algorithms. AFD shows an outstanding performance in signal analysis and system identification. As compensation of effectiveness, the computation complexity is g

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::6bcc5fc5fa91f228b2e2aae79fc044bc
https://doi.org/10.1016/j.cam.2017.04.029

Zobrazit plný text záznamu

Sparse fast Fourier transform for exactly sparse signals and signals with additive Gaussian noise

Autor: Esra Şengün Ermeydan, İlyas Çankaya

Publikováno v: Signal, Image and Video Processing. 12:445-452

In recent years, the Fourier domain representation of sparse signals has been very attractive. Sparse fast Fourier transform (or sparse FFT) is a new technique which computes the Fourier transform in a compressed way, using only a subset of the input

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::0aab849b1daba22de10c62e722c2c50a
https://doi.org/10.1007/s11760-017-1177-5

Zobrazit plný text záznamu

An acceleration of FFT-based algorithms for the match-count problem

Autor: Kensuke Baba

Publikováno v: Information Processing Letters. 125:1-4

The match-count problem on strings is a problem of counting the matches of characters for every possible gap of the starting positions between two strings. This problem for strings of lengths m and n ( m ≤ n ) over an alphabet of size σ is classic

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::7f3ca5f1215701fa509f1bc76acfac95
https://doi.org/10.1016/j.ipl.2017.04.013

Zobrazit plný text záznamu

A Memory-Based FFT Processor Design With Generalized Efficient Conflict-Free Address Schemes

Autor: Bin Wu, Tian-Chun Ye, Kaifeng Xia, Tao Xiong

Publikováno v: IEEE Transactions on Very Large Scale Integration (VLSI) Systems. 25:1919-1929

This paper presents the design and implementation of memory-based fast Fourier transform (FFT) processors with generalized efficient, conflict-free address schemes. We unified the conflict-free address schemes of three different FFT lengths, includin

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::786769c8c3f06a5a907f1d450106129d
https://doi.org/10.1109/tvlsi.2017.2666820

Zobrazit plný text záznamu

Design of a recursive single-bin DFT algorithm for sparse spectrum analysis

Autor: Wei Wang, Wang Kening, Xiongxing Zhang, Ying Tang

Publikováno v: Cluster Computing. 20:1483-1492

Discrete Fourier transform (DFT) is the basic means of spectrum analysis in the field of digital signal processing, and the fast Fourier transform (FFT) has become the most popular algorithm which decreases the computational complexity from quadratic

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::9e09107edeb4feb6e2ec56be86dc1f5f
https://doi.org/10.1007/s10586-017-0866-8

Zobrazit plný text záznamu

Area-Time Efficient Architecture of FFT-Based Montgomery Multiplication

Autor: Ray C. C. Cheung, Çetin Kaya Koç, Wangchen Dai, Donald Donglong Chen

Publikováno v: IEEE Transactions on Computers. 66:375-388

The modular multiplication operation is the most time-consuming operation for number-theoretic cryptographic algorithms involving large integers, such as RSA and Diffie-Hellman. Implementations reveal that more than 75 percent of the time is spent in

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::53212432b672a63a798ebbdd21ec1a06
https://doi.org/10.1109/tc.2016.2601334

Zobrazit plný text záznamu

Modification of a two-dimensional fast Fourier transform algorithm with an analog of the Cooley–Tukey algorithm for image processing

Autor: M. V. Noskov, V. S. Tutatchikov

Publikováno v: Pattern Recognition and Image Analysis. 27:110-113

Two-dimensional fast Fourier transform (FFT) for image processing and filtering is widely used in modern digital image processing systems. This paper concerns the possibility of using a modification of two-dimensional FFT with an analog of the Cooley

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::abe4a5aedf5b254498c0f2fc8585a840
https://doi.org/10.1134/s1054661817010096

Zobrazit plný text záznamu

Elementary Number Theory and Rader's FFT

Autor: Shlomo Engelberg

Publikováno v: SIAM Review. 59:671-678

This note provides a self-contained introduction to Rader's fast Fourier transform (FFT). We start by explaining the need for an additional type of FFT. The properties of the multiplicative group o...

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::41b479c2d2461a0639ab5a60e51aae94
https://doi.org/10.1137/15m1044990

Zobrazit plný text záznamu

Vyhledávací nástroje:

Upřesnit hledání