×

Circuit for computing the quantized coefficient discrete cosine transform of digital signal samples

  • US 4,849,922 A
  • Filed: 12/11/1987
  • Issued: 07/18/1989
  • Est. Priority Date: 01/20/1987
  • Status: Expired due to Fees
First Claim
Patent Images

1. A circuit for computing a discrete cosine transform of f(j) sample vectors of dimension N(0<

  • j<

    N-1), said transform having a square matrix base of dimensions N.N with coefficients which repeat in absolute value at each column but whose order and sign can differ, said circuit obtaining transformed F(k) sample vectors including vectors of dimension N(0<

    K<

    N-1), said circuit comprising two circuit branches working in parallel including a first circuit branch for operations relating to coefficients in even matrix lines and a second circuit branch for coefficients in odd matrix lines, said branches comprising;

    a first adder and a first subtracter, belonging to the first and second branch respectively, which at inputs receive pairs of samples of an F(j) vector having index (j) and (N-j-1), with j increasing sequentially from 0 to NR-1;

    first and second calculating units, belonging to the first and second branch respectively, which, for each addition or subtraction result received respectively from said first adder or first subtracter, calculate NR partial products referring to the matrix column coefficients in even and odd lines respectively, with sequential order, among the coefficients of a column, fixed for all columns, so as to produce each partial product through an addition and shifting operation which involves the previous partial products or input datum;

    a first and second adder/subtracter belonging respectively to the first and second branch, which add or subtract a partial product received from a second input to or from a datum received from a first input of first and second calculating units respectively, and finding the sum in the case of a partial product referring to a positive coefficient or the difference in the case of a negative coefficient;

    first and second memories, belonging to the first and second branch respectively, accumulating NR partial results each, for accumulating calculations performed by said first and second adder/subtracters, said first memories accumulating partial results R* (2K) relating to even matrix column lines, said second memories accumulating partial result R* (2K+1) relating to odd lines, said partial results being components of a transformed sample vector F(k) at the NR-1 index columns;

    first addressing units which generate;

    first control signals for said first and second calculating units, said first control signals determining said sequential order, among coefficients of a column, fixed for all columns;

    addresses to be read in said first and second memories for accumulation of said partial results, supplied as data to said first input of first and second adder/subtracter respectively, and for re-writing said data updated in the same position, said addresses having a sequence which varies with the matrix column, such as to identify the partial result R* (2k) and R* (2k+1) whose index identifies the matrix line containing the coefficient for which said first and second calculating units perform said partial products;

    operation selection signals for said first and second adder/subtracter.

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