Multiplicative complexity, convolution, and the DFT

@inproceedings{Heideman1988MultiplicativeCC,
  title={Multiplicative complexity, convolution, and the DFT},
  author={Michael T. Heideman},
  year={1988}
}
1. Introduction.- 1.1. An Overview of Multiplicative Complexity.- 1.2. Why Count Only Multiplications and Divisions?.- 1.3. Organization.- 2. Multiplicative Complexity of Linear and Bilinear Systems.- 2.1. Historical Perspective.- 2.2. Definitions and Basic Results.- 2.3. Semilinear Systems.- 2.4. Quadratic and Bilinear Systems.- 2.4.1. Properties of Quadratic Systems.- 2.4.2. Bilinear Systems and Noncommutative Algorithms.- 2.4.3. Direct Products and Direct Sums of Systems.- 2.5. Summary of… CONTINUE READING
BETA

Similar Papers

Topics from this paper.

Citations

Publications citing this paper.
SHOWING 1-10 OF 27 CITATIONS

A Hardware implementation of Winograd Fourier Transform algorithm for Cryptography

Govindharaju Sathishkumar, Dr. K. Boopathy bagan
  • 2008
VIEW 5 EXCERPTS
CITES METHODS
HIGHLY INFLUENCED

Efficient Computation of the 8-point DCT via Summation by Parts

VIEW 4 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

Broadband Multiple Cone-Beam 3-D IIR Digital Filters Applied to Planar Dense Aperture Arrays

  • IEEE Transactions on Antennas and Propagation
  • 2012
VIEW 3 EXCERPTS
CITES BACKGROUND
HIGHLY INFLUENCED