Accession Number:

ADA458534

Title:

Computational Workloads for Commonly Used Signal Processing Kernels

Descriptive Note:

Project rept.

Corporate Author:

MASSACHUSETTS INST OF TECH LEXINGTON LINCOLN LAB

Personal Author(s):

Report Date:

2006-11-30

Pagination or Media Count:

92.0

Abstract:

In the course of designing or evaluating signal processing algorithms, one often must determine the computational workload needed to implement the algorithms on a digital computer. The floating-point operation flop counts for real versions of the most common signal processing kernels are well documented. However, the flop counts for kernels operating on complex inputs are not as readily found. This report collects the flop count expressions for both real and complex kernels and also presents brief outlines of the derivations for the flop count expressions. Specifically, the following computational kernels are addressed 1 the dimensions of the two multiplicands m x n and n x p for the matrix-matrix multiplication 2 the length of the vector n for the fast Fourier transform 3 the size of the triangular system n for forward and back substitutions 4 the dimensions of the input matrix m x n for the Householder QR decomposition, eigenvalue decomposition, and singular value decomposition.

Subject Categories:

  • Numerical Mathematics
  • Theoretical Mathematics
  • Computer Programming and Software
  • Radiofrequency Wave Propagation

Distribution Statement:

APPROVED FOR PUBLIC RELEASE