找回密碼
 To register

QQ登錄

只需一步,快速開(kāi)始

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

打印 上一主題 下一主題

Titlebook: Multiplicative Complexity, Convolution, and the DFT; Michael T. Heideman Book 1988 Springer-Verlag New York Inc. 1988 Mathematica.complexi

[復(fù)制鏈接]
查看: 42370|回復(fù): 35
樓主
發(fā)表于 2025-3-21 18:55:32 | 只看該作者 |倒序?yàn)g覽 |閱讀模式
書(shū)目名稱Multiplicative Complexity, Convolution, and the DFT
編輯Michael T. Heideman
視頻videohttp://file.papertrans.cn/642/641077/641077.mp4
叢書(shū)名稱Signal Processing and Digital Filtering
圖書(shū)封面Titlebook: Multiplicative Complexity, Convolution, and the DFT;  Michael T. Heideman Book 1988 Springer-Verlag New York Inc. 1988 Mathematica.complexi
描述This book is intended to be a comprehensive reference to multiplicative com- plexity theory as applied to digital signal processing computations. Although a few algorithms are included to illustrate the theory, I concentrated more on the develop- ment of the theory itself. Howie Johnson‘s infectious enthusiasm for designing efficient DfT algorithms got me interested in this subject. I am grateful to Prof. Sid Burrus for encouraging and supporting me in this effort. I would also like to thank Henrik Sorensen and Doug Jones for many stimulating discussions. lowe a great debt to Shmuel Winograd, who, almost singlehandedly, provided most of the key theoretical results that led to this present work. His monograph, Arithmetic Complexity o/Computations, introduced me to the mechanism behind the proofs of theorems in multiplicative complexity. enabling me to return to his earlier papers and appreciate the elegance of his methods for deriving the theory. The second key work that influenced me was the paper by Louis Auslander and Winograd on multiplicative complexity of semilinear systems defined by polynomials. After reading this paper, it was clear to me that this theory could be applied t
出版日期Book 1988
關(guān)鍵詞Mathematica; complexity; discrete Fourier transform; organization; proof
版次1
doihttps://doi.org/10.1007/978-1-4612-3912-3
isbn_softcover978-1-4612-8399-7
isbn_ebook978-1-4612-3912-3Series ISSN 1431-7893
issn_series 1431-7893
copyrightSpringer-Verlag New York Inc. 1988
The information of publication is updating

書(shū)目名稱Multiplicative Complexity, Convolution, and the DFT影響因子(影響力)




書(shū)目名稱Multiplicative Complexity, Convolution, and the DFT影響因子(影響力)學(xué)科排名




書(shū)目名稱Multiplicative Complexity, Convolution, and the DFT網(wǎng)絡(luò)公開(kāi)度




書(shū)目名稱Multiplicative Complexity, Convolution, and the DFT網(wǎng)絡(luò)公開(kāi)度學(xué)科排名




書(shū)目名稱Multiplicative Complexity, Convolution, and the DFT被引頻次




書(shū)目名稱Multiplicative Complexity, Convolution, and the DFT被引頻次學(xué)科排名




書(shū)目名稱Multiplicative Complexity, Convolution, and the DFT年度引用




書(shū)目名稱Multiplicative Complexity, Convolution, and the DFT年度引用學(xué)科排名




書(shū)目名稱Multiplicative Complexity, Convolution, and the DFT讀者反饋




書(shū)目名稱Multiplicative Complexity, Convolution, and the DFT讀者反饋學(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

您所在的用戶組沒(méi)有投票權(quán)限
沙發(fā)
發(fā)表于 2025-3-22 00:17:22 | 只看該作者
Book 1988ough a few algorithms are included to illustrate the theory, I concentrated more on the develop- ment of the theory itself. Howie Johnson‘s infectious enthusiasm for designing efficient DfT algorithms got me interested in this subject. I am grateful to Prof. Sid Burrus for encouraging and supporting
板凳
發(fā)表于 2025-3-22 02:16:40 | 只看該作者
Signal Processing and Digital Filteringhttp://image.papertrans.cn/n/image/641077.jpg
地板
發(fā)表于 2025-3-22 06:46:47 | 只看該作者
5#
發(fā)表于 2025-3-22 12:34:50 | 只看該作者
6#
發(fā)表于 2025-3-22 14:18:36 | 只看該作者
Multiplicative Complexity, Convolution, and the DFT978-1-4612-3912-3Series ISSN 1431-7893
7#
發(fā)表于 2025-3-22 18:47:00 | 只看該作者
8#
發(fā)表于 2025-3-22 22:09:06 | 只看該作者
9#
發(fā)表于 2025-3-23 05:21:47 | 只看該作者
Book 1988eciate the elegance of his methods for deriving the theory. The second key work that influenced me was the paper by Louis Auslander and Winograd on multiplicative complexity of semilinear systems defined by polynomials. After reading this paper, it was clear to me that this theory could be applied t
10#
發(fā)表于 2025-3-23 05:45:46 | 只看該作者
10樓
 關(guān)于派博傳思  派博傳思旗下網(wǎng)站  友情鏈接
派博傳思介紹 公司地理位置 論文服務(wù)流程 影響因子官網(wǎng) 吾愛(ài)論文網(wǎng) 大講堂 北京大學(xué) Oxford Uni. Harvard Uni.
發(fā)展歷史沿革 期刊點(diǎn)評(píng) 投稿經(jīng)驗(yàn)總結(jié) SCIENCEGARD IMPACTFACTOR 派博系數(shù) 清華大學(xué) Yale Uni. Stanford Uni.
QQ|Archiver|手機(jī)版|小黑屋| 派博傳思國(guó)際 ( 京公網(wǎng)安備110108008328) GMT+8, 2025-10-6 07:43
Copyright © 2001-2015 派博傳思   京公網(wǎng)安備110108008328 版權(quán)所有 All rights reserved
快速回復(fù) 返回頂部 返回列表
新余市| 黄浦区| 昆山市| 固安县| 高州市| 乃东县| 千阳县| 高青县| 汤原县| 温泉县| 教育| 荔波县| 山东省| 永嘉县| 屏边| 新化县| 康乐县| 余干县| 丰镇市| 光山县| 黔东| 蓝山县| 顺义区| 平果县| 富裕县| 兴仁县| 大同县| 汉川市| 镇平县| 个旧市| 昂仁县| 沙田区| 罗源县| 芒康县| 湟中县| 馆陶县| 安达市| 南通市| 乐平市| 韶关市| 莱芜市|