Fast algorithms for signal processing
著者
書誌事項
Fast algorithms for signal processing
Cambridge University Press, 2010
- : Hardback
- タイトル別名
-
Fast algorithms for digital signal processing
大学図書館所蔵 全10件
  青森
  岩手
  宮城
  秋田
  山形
  福島
  茨城
  栃木
  群馬
  埼玉
  千葉
  東京
  神奈川
  新潟
  富山
  石川
  福井
  山梨
  長野
  岐阜
  静岡
  愛知
  三重
  滋賀
  京都
  大阪
  兵庫
  奈良
  和歌山
  鳥取
  島根
  岡山
  広島
  山口
  徳島
  香川
  愛媛
  高知
  福岡
  佐賀
  長崎
  熊本
  大分
  宮崎
  鹿児島
  沖縄
  韓国
  中国
  タイ
  イギリス
  ドイツ
  スイス
  フランス
  ベルギー
  オランダ
  スウェーデン
  ノルウェー
  アメリカ
注記
Originally published as: Fast algorithms for digital signal processing by Addison-Wesley, Reading, MA, 1985
Includes bibliographical references (p. 442-448) and index
内容説明・目次
内容説明
Efficient signal processing algorithms are important for embedded and power-limited applications since, by reducing the number of computations, power consumption can be reduced significantly. Similarly, efficient algorithms are also critical to very large scale applications such as video processing and four-dimensional medical imaging. This self-contained guide, the only one of its kind, enables engineers to find the optimum fast algorithm for a specific application. It presents a broad range of computationally-efficient algorithms, describes their structure and implementation, and compares their relative strengths for given problems. All the necessary background mathematics is included and theorems are rigorously proved, so all the information needed to learn and apply the techniques is provided in one convenient guide. With this practical reference, researchers and practitioners in electrical engineering, applied mathematics, and computer science can reduce power dissipation for low-end applications of signal processing, and extend the reach of high-end applications.
目次
- 1. Introduction
- 2. Introduction to abstract algebra
- 3. Fast algorithms for the discrete Fourier transform
- 4. Fast algorithms based on doubling strategies
- 5. Fast algorithms for short convolutions
- 6. Architecture of filters and transforms
- 7. Fast algorithms for solving Toeplitz systems
- 8. Fast algorithms for trellis search
- 9. Numbers and fields
- 10. Computation in finite fields and rings
- 11. Fast algorithms and multidimensional convolutions
- 12. Fast algorithms and multidimensional transforms
- Appendices: A. A collection of cyclic convolution algorithms
- B. A collection of Winograd small FFT algorithms.
「Nielsen BookData」 より