×

Efficient fixed-point approximations of forward and inverse discrete cosine transforms

  • US 8,699,810 B2
  • Filed: 06/21/2007
  • Issued: 04/15/2014
  • Est. Priority Date: 06/26/2006
  • Status: Expired due to Fees
First Claim
Patent Images

1. A method comprising:

  • receiving an 8×

    8 matrix of encoded coefficients;

    scaling each coefficient in the 8×

    8 matrix of encoded coefficients by one of a factor A, a factor B, a factor C, a factor D, a factor E, a factor F, a factor G, a factor H, a factor I, or a factor J in order to produce a matrix of scaled coefficients,wherein A=2048, B=1703, C=2676, D=2408, E=1416, F=2225, G=2003, H=3496, I=3147, and J=2832;

    using repeated applications of a fixed-point scaled one-dimensional transform to transform the matrix of scaled coefficients into a matrix of transformed coefficients;

    right-shifting transformed coefficients in the matrix of transformed coefficients in order to produce a matrix of adjusted coefficients;

    wherein each adjusted coefficient in the matrix of adjusted coefficients approximates a corresponding value in a matrix of values that would be produced by applying an ideal two-dimensional inverse discrete cosine transform (“

    IDCT”

    ) to the matrix of encoded coefficients;

    displaying an 8×

    8 block of pixels, wherein each pixel in the 8×

    8 block of pixels includes a pixel component value based on an adjusted coefficient in the matrix of adjusted coefficients.

View all claims
  • 1 Assignment
Timeline View
Assignment View
    ×
    ×