找回密碼
 To register

QQ登錄

只需一步,快速開始

掃一掃,訪問微社區(qū)

打印 上一主題 下一主題

Titlebook: Algorithms for Discrete Fourier Transform and Convolution; R. Tolimieri,Myoung An,Chao Lu,C. S. Burrus (Profe Book 19891st edition Springe

[復(fù)制鏈接]
查看: 41411|回復(fù): 53
樓主
發(fā)表于 2025-3-21 17:51:58 | 只看該作者 |倒序瀏覽 |閱讀模式
期刊全稱Algorithms for Discrete Fourier Transform and Convolution
影響因子2023R. Tolimieri,Myoung An,Chao Lu,C. S. Burrus (Profe
視頻videohttp://file.papertrans.cn/154/153219/153219.mp4
學(xué)科分類Signal Processing and Digital Filtering
圖書封面Titlebook: Algorithms for Discrete Fourier Transform and Convolution;  R. Tolimieri,Myoung An,Chao Lu,C. S. Burrus (Profe Book 19891st edition Springe
影響因子This book is based on several courses taught during the last five years at the City College of the City University of New York and at Fudan University, Shanghai, China in the Summer, 1986. It was originally our intention to present to a mixed audience of electrical engineers, mathematicians and computer scientists at the graduate level, a collection of algorithms which would serve to represent the vast array of algorithms designed over the last twenty years for com- puting the finite Fourier transform (FFT) and finite convolution. However, it was soon apparent that the scope of the course had to be greatly expanded. For researchers interested in the design of new algorithms, a deeper understanding of the basic mathematical con- cepts underlying algorithm design was essential. At the same time, a large gap remained between the statement of an algorithm and the implementation of the algorithm. The main goal of this text is to describe tools which can serve both of these needs. In fact, it is our belief that certain mathematical ideas provide a natural lan- guage and culture for understanding, unifying and implementing a wide range of digital signal processing (DSP) algorithms. This b
Pindex Book 19891st edition
The information of publication is updating

書目名稱Algorithms for Discrete Fourier Transform and Convolution影響因子(影響力)




書目名稱Algorithms for Discrete Fourier Transform and Convolution影響因子(影響力)學(xué)科排名




書目名稱Algorithms for Discrete Fourier Transform and Convolution網(wǎng)絡(luò)公開度




書目名稱Algorithms for Discrete Fourier Transform and Convolution網(wǎng)絡(luò)公開度學(xué)科排名




書目名稱Algorithms for Discrete Fourier Transform and Convolution被引頻次




書目名稱Algorithms for Discrete Fourier Transform and Convolution被引頻次學(xué)科排名




書目名稱Algorithms for Discrete Fourier Transform and Convolution年度引用




書目名稱Algorithms for Discrete Fourier Transform and Convolution年度引用學(xué)科排名




書目名稱Algorithms for Discrete Fourier Transform and Convolution讀者反饋




書目名稱Algorithms for Discrete Fourier Transform and Convolution讀者反饋學(xué)科排名




單選投票, 共有 0 人參與投票
 

0票 0%

Perfect with Aesthetics

 

0票 0%

Better Implies Difficulty

 

0票 0%

Good and Satisfactory

 

0票 0%

Adverse Performance

 

0票 0%

Disdainful Garbage

您所在的用戶組沒有投票權(quán)限
沙發(fā)
發(fā)表于 2025-3-21 21:09:03 | 只看該作者
板凳
發(fā)表于 2025-3-22 02:15:45 | 只看該作者
Partnerinnen und T?chter im Vergleichte the resulting factorization by combining Rader and Winograd small FFT algorithms. The basic factorization is . where . is a block diagonal matrix with small skew-circulant blocks (rotated Winograd cores) and tensor product of these small skew-circulant blocks, and . is a pre-addition matrix with all its entries being 0, 1 or ?1.
地板
發(fā)表于 2025-3-22 05:39:32 | 只看該作者
5#
發(fā)表于 2025-3-22 10:40:32 | 只看該作者
Good-Thomas PFA,r in structure to these additive algorithms, but no longer requiring the twiddle factor multiplication. The idea is due to Good [2] in 1958 and Thomas [8] in 1963, and the resulting algorithm is called the Good-Thomas Prime Factor algorithm (PFA).
6#
發(fā)表于 2025-3-22 14:50:34 | 只看該作者
7#
發(fā)表于 2025-3-22 18:16:10 | 只看該作者
8#
發(fā)表于 2025-3-23 00:57:27 | 只看該作者
Partnerinnen und T?chter im Vergleich convolution theorem which returns the computation to an FFT computation. Since the size (.?1) is a composite number, the (.?1)-point FT can be handled by Cooley-Tukey FFT algorithms. The Winograd algorithm for small convolutions can also be applied to the skew-circulant action.
9#
發(fā)表于 2025-3-23 04:29:01 | 只看該作者
https://doi.org/10.1007/978-3-658-11082-6 of Rader’s multiplicative FT algorithms, we derive the fundamental factorization . where . is a block-diagonal matrix having skew-circulant blocks (rotated Winograd cores) and tensor products of these skew-circulant blocks and . is a matrix of pre-additions, all of whose entries are 0, 1 or ?1. Variants will then be derived.
10#
發(fā)表于 2025-3-23 08:53:12 | 只看該作者
 關(guān)于派博傳思  派博傳思旗下網(wǎng)站  友情鏈接
派博傳思介紹 公司地理位置 論文服務(wù)流程 影響因子官網(wǎng) 吾愛論文網(wǎng) 大講堂 北京大學(xué) Oxford Uni. Harvard Uni.
發(fā)展歷史沿革 期刊點評 投稿經(jīng)驗總結(jié) SCIENCEGARD IMPACTFACTOR 派博系數(shù) 清華大學(xué) Yale Uni. Stanford Uni.
QQ|Archiver|手機(jī)版|小黑屋| 派博傳思國際 ( 京公網(wǎng)安備110108008328) GMT+8, 2025-11-3 04:23
Copyright © 2001-2015 派博傳思   京公網(wǎng)安備110108008328 版權(quán)所有 All rights reserved
快速回復(fù) 返回頂部 返回列表
乐清市| 康定县| 唐海县| 兴山县| 沙河市| 弋阳县| 阜新市| 广河县| 麦盖提县| 荣成市| 五华县| 东乌| 荣成市| 弥勒县| 衢州市| 民县| 奎屯市| 神池县| 东源县| 同德县| 卢湾区| 团风县| 仙游县| 福州市| 陇南市| 青州市| 鞍山市| 云阳县| 西吉县| 曲水县| 昭苏县| 灌阳县| 得荣县| 青神县| 上栗县| 新巴尔虎右旗| 方正县| 佛冈县| 辛集市| 通渭县| 黑龙江省|