Method and system for performing two-dimensional transform on data value array with reduced power consumption

• US 8,660,380 B2
• Filed: 08/25/2006
• Issued: 02/25/2014
• Est. Priority Date: 08/25/2006
• Status: Active Grant

• Current Assignee: NVIDIA Corporation
• Original Assignee: NVIDIA Corporation
• Inventors: Bulusu, Ravi, Sriram, Partha
• Primary Examiner(s): Rahmjoo, Mike
• Application Number:
  US11/510,218
• Publication Number:
  US 20080050036A1
• Time in Patent Office: 2,741 Days
• Field of Search: 382/281, 382/276, 382/277, 382/305, 382/245, 382/248
• US Class Current: 382/281
• CPC Class Codes: G06F 17/145 Square transforms, e.g. Hadamard, Walsh, Haar, Hough, Slant transforms
• CPC Class Codes: G06F 17/147 Discrete orthonormal transforms, e.g. discrete cosine transform, discrete sine transform, and variations therefrom, e.g. modified discrete cosine transform, integer transforms approximating the discrete cosine transform G06F17/145 takes precedence

Abstract

In some embodiments, a method for performing and a system configured to perform a 2D transform (for example, an inverse discrete cosine transform) on each block of a sequence of data blocks, where the 2D transform includes a row transform and a column transform. To perform the row or column transform on a row or column of data, these embodiments determine whether each of different subsets of the data values comprising a partition of the row (column) includes at least one zero value, whether each of different subsets of a first subset of the partition includes at least one zero value, and whether each of different subsets of at least one other subset of the partition includes at least one zero value. When performing the row (column) transform on each row or column that includes at least one zero value and at least one non-zero value, at least one transformation operation on at least one zero value is bypassed or performed in a reduced-power manner, where such transformation operation would otherwise be performed in a manner consuming full power if the zero value were a non-zero value. In some embodiments, the system is a pipelined video decoding system or other video processing system (or a video processing subsystem of a portable media player or other system) including a transform engine implemented in accordance with the invention. Other aspects are transform engines and transform engine circuitry for use in any embodiment of the system.

Claims

1. A system comprising:

row transform circuitry configured to perform a row transform on first data to generate second data; and

column transform circuitry configured to perform a column transform on said second data to generate third data, and

wherein said row transform circuitry is configured to separate a row of said first data into a first portion and a second portion, wherein said first portion of said row comprises a first plurality of values, and wherein said second portion of said row comprises a second plurality of values,

wherein said row transform circuitry is configured to determine whether said first plurality of values of said first portion of said comprises at least one zero value,

wherein said row transform circuitry is further configured to determine whether said second plurality of values of said second portion of said row comprises at least one zero value,

wherein said row transform circuitry is further configured to process said first portion and said second portion contemporaneously, and

wherein said row transform circuitry is further configured to perform, when performing said row transform, an operation associated with at least one data value comprising a zero value, wherein said at least one data value is selected from a group consisting of at least one data value of said first portion of said row and at least one data value of said second portion of said row.

2. The system of claim 1, wherein said operation comprises bypassing at least one transformation operation.

3. The system of claim 1, wherein said operation comprises performing, in a reduced-power manner, at least one transformation operation on said at least one data value comprising a zero value.

4. The system of claim 3, wherein said at least one transformation operation comprises a multiplication operation.

5. The system of claim 1 further comprising:

a buffer coupled to said row transform circuitry and said column transform circuitry, wherein said row transform circuitry is configured to store said second data in said buffer, and wherein said column transform circuitry is configured to access said second data from said buffer.

6. The system of claim 1, wherein said row transform circuitry is configured to reorder data values of said first data when performing said row transform.

7. The system of claim 1, wherein said row transform and said column transform are associated with an inverse discrete cosine transform.

8. The system of claim 1, wherein said row transform circuitry is configured to separate said row of said first data based on a type of transform to be implemented.

9. A method comprising:

performing, using circuitry, a row transform on first data to generate second data;

performing a column transform on said second data to generate third data, and

wherein said performing said row transform further comprises;

separating a row of said first data into a first portion and a second portion, wherein said first portion of said row comprises a first plurality of values, and wherein said second portion of said row comprises a second plurality of values;

determining whether said first plurality of values of said first portion of said row comprises at least one zero value;

determining whether said second plurality of values of said second portion of said row comprises at least one zero value;

processing said first portion and said second portion contemporaneously; and

performing an operation associated with at least one data value comprising a zero value, wherein said at least one data value is selected from a group consisting of at least one data value of said first portion of said row and at least one data value of said second portion of said row.

10. The method of claim 9, wherein said operation comprises bypassing at least one transformation operation.

11. The method of claim 9, wherein said performing said operation further comprises performing, in a reduced-power manner, at least one transformation operation on said at least one data value comprising a zero value.

12. The method of claim 11, wherein said at least one transformation operation comprises a multiplication operation.

13. The method of claim 9 further comprising:

storing said second data in a buffer after said performing said row transform; and

accessing said second data from said buffer before performing said column transform.

14. The method of claim 9, wherein said performing said row transform further comprises reordering data values of said first data.

15. The method of claim 9, wherein said row transform and said column transform are associated with an inverse discrete cosine transform.

16. The method of claim 9, wherein said separating further comprises separating said row of said first data based on a type of transform to be implemented.