Discrete cosine transform processing system
First Claim
Patent Images
1. A data processing system comprising:
- A. a first 1D DCT network, said first DCT network having an i-value parallel data input channel for receiving a succession of parallel data words applied thereto, each word having up to i data values, and having a j-value parallel data output channel, and including means for transforming said applied data words in accordance with a one dimensional discrete cosine transformation (DCT) to generate a succession of parallel DCT data words, each word being associated with one of said applied data words and having a plurality of data values, and for applying said succession of parallel DCT data words to said output channel,B. a corner turning memory network having a j-value parallel data input channel, an i-value parallel data output channel, and an i×
j cell rectangular array of data storage locations, each location being adapted to store a data value, said locations extending in the direction of an input axis from a j cell input edge of said array, and extending in the direction of an output axis to an i cell output edge of said array, said output axis being orthogonal to said input axis,wherein said locations at said input edge are coupled to receive data values in parallel from said parallel data input channel, and said locations at said output edge are coupled to transfer data values in parallel to said parallel output channel,wherein said array includes first means for selectively transferring stored data values from each of said locations to the adjacent locations in said array in the direction of said input axis, and includes second means for selectively transferring said stored data values from each of said locations to the adjacent locations in said array in the direction of said output axis, andwherein said array further includes a corner controller having means for controlling said first and second transferring means of said array to be operative alternately to load said locations with a succession of data words from said parallel data input channel and to unload said locations and apply a succession of data words to said parallel data output channel,C. a second 1D DCT network, said second DCT network having an i-value parallel data input channel for receiving a succession of parallel data words applied thereto, each word having up to i data values, and having a j-value parallel data output channel, and including means for transforming data words applied to said parallel data input channel in accordance with a one dimensional discrete cosine transformation (DCT) to generate a succession of parallel DCT data words, each being associated with one of said applied data words and having a plurality of values and for applying said succession of parallel DCT data words to said output channel,D. means for coupling said output channel of said first DCT network to said input channel of said corner turning memory network, andE. means for coupling said output channel of said corner turning memory network to said input channel of said second DCT network.
1 Assignment
0 Petitions
Accused Products
Abstract
A three dimensional (3D) discrete cosine transform (DCT) uses one dimensional DCT networks for transforming and inverse-transforming blocks of data, such as image data. The 3D DCT configuration uses DCT transform coding to remove both the spatial and temporal redundancy of a sequence of image frames to achieve high bandwidth compression.
91 Citations
8 Claims
-
1. A data processing system comprising:
-
A. a first 1D DCT network, said first DCT network having an i-value parallel data input channel for receiving a succession of parallel data words applied thereto, each word having up to i data values, and having a j-value parallel data output channel, and including means for transforming said applied data words in accordance with a one dimensional discrete cosine transformation (DCT) to generate a succession of parallel DCT data words, each word being associated with one of said applied data words and having a plurality of data values, and for applying said succession of parallel DCT data words to said output channel, B. a corner turning memory network having a j-value parallel data input channel, an i-value parallel data output channel, and an i×
j cell rectangular array of data storage locations, each location being adapted to store a data value, said locations extending in the direction of an input axis from a j cell input edge of said array, and extending in the direction of an output axis to an i cell output edge of said array, said output axis being orthogonal to said input axis,wherein said locations at said input edge are coupled to receive data values in parallel from said parallel data input channel, and said locations at said output edge are coupled to transfer data values in parallel to said parallel output channel, wherein said array includes first means for selectively transferring stored data values from each of said locations to the adjacent locations in said array in the direction of said input axis, and includes second means for selectively transferring said stored data values from each of said locations to the adjacent locations in said array in the direction of said output axis, and wherein said array further includes a corner controller having means for controlling said first and second transferring means of said array to be operative alternately to load said locations with a succession of data words from said parallel data input channel and to unload said locations and apply a succession of data words to said parallel data output channel, C. a second 1D DCT network, said second DCT network having an i-value parallel data input channel for receiving a succession of parallel data words applied thereto, each word having up to i data values, and having a j-value parallel data output channel, and including means for transforming data words applied to said parallel data input channel in accordance with a one dimensional discrete cosine transformation (DCT) to generate a succession of parallel DCT data words, each being associated with one of said applied data words and having a plurality of values and for applying said succession of parallel DCT data words to said output channel, D. means for coupling said output channel of said first DCT network to said input channel of said corner turning memory network, and E. means for coupling said output channel of said corner turning memory network to said input channel of said second DCT network. - View Dependent Claims (2, 3, 4, 5, 6)
-
-
7. A cube turning memory network having:
-
an i×
j stage serial-in/parallel-out input data shift register adapted to receive a succession of j i-value serial data words and to transfer out a succession of i×
j value parallel data words,a k stage parallel-in output data shift register adapted to receive a succession of k-value parallel data words and to transfer out a succession of k-value data words, an i×
j×
k cell rectangular array of data storage locations, each location being adapted to store a data value, said locations extending in the direction of an input axis from an i×
j cell input edge of said array, and extending in the direction of an output axis to a k cell output edge of said array, said output axis being orthogonal to said input axis,wherein, said locations at said input edge are coupled to receive data in parallel from said input shift register, and said locations at said output edge are coupled to transfer data in Parallel to said output shift register, wherein said array includes first means for selectively transferring stored data values from each of said locations to the adjacent locations in said array in the direction of said input axis, and includes second means for selectively transferring said stored data values from each of said locations to the adjacent locations in said array in the direction of said output axis, and wherein said array further includes a cube controller having means for controlling said first and second transferring means of said array to be operative alternately to load said locations with a succession of data words from said input shift register and to unload said locations and apply a succession of data words to said output shift register. - View Dependent Claims (8)
-
Specification