找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

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

[复制链接]
查看: 42306|回复: 35
发表于 2025-3-21 18:55:32 | 显示全部楼层 |阅读模式
书目名称Multiplicative Complexity, Convolution, and the DFT
编辑Michael T. Heideman
视频video
丛书名称Signal Processing and Digital Filtering
图书封面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
关键词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

书目名称Multiplicative Complexity, Convolution, and the DFT影响因子(影响力)




书目名称Multiplicative Complexity, Convolution, and the DFT影响因子(影响力)学科排名




书目名称Multiplicative Complexity, Convolution, and the DFT网络公开度




书目名称Multiplicative Complexity, Convolution, and the DFT网络公开度学科排名




书目名称Multiplicative Complexity, Convolution, and the DFT被引频次




书目名称Multiplicative Complexity, Convolution, and the DFT被引频次学科排名




书目名称Multiplicative Complexity, Convolution, and the DFT年度引用




书目名称Multiplicative Complexity, Convolution, and the DFT年度引用学科排名




书目名称Multiplicative Complexity, Convolution, and the DFT读者反馈




书目名称Multiplicative Complexity, Convolution, and the DFT读者反馈学科排名




单选投票, 共有 0 人参与投票
 

0票 0%

Perfect with Aesthetics

 

0票 0%

Better Implies Difficulty

 

0票 0%

Good and Satisfactory

 

0票 0%

Adverse Performance

 

0票 0%

Disdainful Garbage

您所在的用户组没有投票权限
发表于 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
发表于 2025-3-22 02:16:40 | 显示全部楼层
Signal Processing and Digital Filteringhttp://image.papertrans.cn/n/image/641077.jpg
发表于 2025-3-22 06:46:47 | 显示全部楼层
发表于 2025-3-22 12:34:50 | 显示全部楼层
发表于 2025-3-22 14:18:36 | 显示全部楼层
Multiplicative Complexity, Convolution, and the DFT978-1-4612-3912-3Series ISSN 1431-7893
发表于 2025-3-22 18:47:00 | 显示全部楼层
发表于 2025-3-22 22:09:06 | 显示全部楼层
发表于 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
发表于 2025-3-23 05:45:46 | 显示全部楼层
10楼
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-5-2 03:10
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表