A New Fast Algorithm for the Discrete Cosine Transform
DOI:
CSTR:
Author:
Affiliation:

Clc Number:

TP391.41

Fund Project:

  • Article
  • |
  • Figures
  • |
  • Metrics
  • |
  • Reference
  • |
  • Related
  • |
  • Cited by
  • |
  • Materials
  • |
  • Comments
    Abstract:

    We prepose a new fast algorithm for computing discrete cosine transform and its inverse on two dimensional input sizes which are powers of 2.Because the integer operation is more faster than the float operation in computer,the integer operation is used in this algorithm.Through the matrix linear transform the number of operation for multiplications and additions is reduced,so that the speed is greatly raised.This algorithm is applied to our developmented JPEG image coding,and yields very good results.

    Reference
    Related
    Cited by
Get Citation

吴晓芸 张太怡.一种新的快速离散余弦变换算法[J].重庆大学学报,1994,17(4):29~34

Copy
Related Videos

Share
Article Metrics
  • Abstract:
  • PDF:
  • HTML:
  • Cited by:
History
  • Received:
  • Revised:
  • Adopted:
  • Online:
  • Published:
Article QR Code