Scaled DCT's on input sizes that are composite

  • Authors:

  • E. Feig;E. Linter

  • Affiliations:

  • IBM Thomas J. Watson Res. Center, Yorktown Heights, NY;-

  • Venue:
  • IEEE Transactions on Signal Processing
  • Year:
  • 1995

Quantified Score

Hi-index 35.68

Visualization

Abstract

Given efficient scaled discrete cosine transforms (DCT's) of size p and q, where p and q are relatively prime, we present methods for constructing fast algorithms to compute scaled DCT's and scaled inverse DCT's of size pq. Extensions to multidimensional transforms are also given