Book contents
- Frontmatter
- Contents
- Preface
- Acknowledgments
- 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
- A A collection of cyclic convolution algorithms
- B A collection of Winograd small FFT algorithms
- Bibliography
- Index
5 - Fast algorithms for short convolutions
Published online by Cambridge University Press: 03 May 2011
- Frontmatter
- Contents
- Preface
- Acknowledgments
- 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
- A A collection of cyclic convolution algorithms
- B A collection of Winograd small FFT algorithms
- Bibliography
- Index
Summary
- Type
- Chapter
- Information
- Fast Algorithms for Signal Processing , pp. 145 - 193Publisher: Cambridge University PressPrint publication year: 2010