Discrete cosine transformation circuit
Abstract
The present invention has an object to provide a high-speed discrete cosine transformation circuit. In this structure, the one-dimensional input signals x(0) to x(7) are input in parallel to the positive input terminals "+" or the negative input terminals "-" of eight neural operation units (NOU) 11 to 18 through capacitors d0 to d6. In each NOU 11 to 18, input signals x(0) to x(7) are added and subtracted: x(0) to x(7) are multiplied beforehand by the coefficient in proportion to the capacities of capacitors d0 to d6 which are connected to NOU 11 to 18. Thereafter, discrete cosine transforming coefficients y(0) to y(7) are output. A two-dimensional descrete cosine transformation circuit is realized by using the one-dimensional descrete cosine transforming circuit.

Term
Term ended
Projected expiry passed 18 March 2017, 9.5 years ago.
- Priority
- Filed
- Published
- Projected expiry
- Today
4 claims: 1 independent, 3 dependent
- 1A one-dimensional discrete cosine transformation circuit for generating an output of discrete transformation from N (positive integer) number of input voltages:N number of operational units each of which comprises: i) a positive input terminal;ii) a negative input terminal;iii) an output terminal;iv) a first inverting amplifier having an input and an output, said input being connected to said positive input terminal;v) a first feedback capacitance connected between said input and said output of said first inverting amplifier;vi) an intermediate capacitance having an input and an output,vii) said input being connected to said output of said first inverting amplifier;viii) a second inverting amplifier having an input and an output, said input being connected to said output of said intermediate capacitance, said output being connected to said output terminal of said output terminal;andix) a second feedback capacitance connected between said input and said output of said second inverting amplifier;andN number of capacitances corresponding to said input voltages each of which is connected between one of said input voltages and one of said positive and negative terminals, and capacitances having capacities according to coefficients of said discrete cosine transformation.
54 paragraphs in 6 sections, as filed
FIELD OF THE INVENTION
The present invention relates to a discrete cosine transformation circuit (DCT circuit).
BACKGROUND OF THE INVENTION
Discrete cosine transformation (DCT) is one kind of orthogonal transformation. It is a signal processing method used more widely now that multimedia processing has developed recently. Especially in the field of image processing discrete cosine transformations like JPEG and MPEG are used with increasing importance.
DCT is usually implemented by digital circuits or software.
SUMMARY OF THE INVENTION
When DCT is executed by software, high-speed processing is difficult, although proprietary hardware is not requisite.
When proprietary hardware is used, high-speed processing is possible, but only with extra hardware requiring many multiplication circuits and address and the quantity of hardware is large.
In many cases the analog input signal must be converted to a digital one.
The present invention has an object to provide a discrete cosine transformation circuit for high-speed discrete cosine transformation with less hardware requisite and with an analog input signal.
To achieve the foregoing object, the linear discrete cosine transformation circuit of the present invention includes: I) N number of signal input means for receiving N points of analog input signals, and II) N number of operation units comprising: i) a first and second inverting amplifier; ii) a first, second and third capacitor, each having a capacity corresponding to the coefficients for a discrete cosine transformation, two positive and negative input terminals and an output terminal, with the first capacitor provided between an input and output of the first inverting amplifier, the second capacitor provided between an output of the first inverting amplifier and an input of the second inverting amplifier, and the third capacitor provided between an input and an output of the second inverting amplifier; iii) two positive and negative input terminals connected to an input of the first and second inverting amplifier in the operation unit, respectively; and iv) an output terminal.
The secondary discrete cosine transformation circuit of the present invention includes N number of linear discrete cosine transformation circuits to each of which is input N number of rows or columns of signals in parallel, as mentioned above, and N number of those to each of which is input in parallel the outputs corresponding to the identical rows or columns of the inputs of said N number of linear discrete cosine transformation circuits.
Another secondary discrete cosine transformation circuit of the present invention includes the above-mentioned first discrete cosine transformation circuit for receiving N number of rows or columns of signals in parallel, a secondary memory device for storing outputs of the above first discrete cosine transformation circuit on each row, and a second linear discrete cosine transformation circuit for receiving the signals read out by each column from the secondary memory device.
Another secondary discrete cosine transformation circuit of the present invention besides the two mentioned above includes: i) a first switching circuit having first and second input terminals, each receiving N number of input signals, and a first switching circuit having an output terminal for outputting N number of output signals; ii) a one-dimensional discrete cosine transformation circuit as claimed in claim 1, with an input connected to an output terminal of the first switching circuit; iii) a second switching circuit having an input terminal to connect with an output of the one-dimensional discrete cosine transformation circuit as well as first and second output terminals, each able to output N number of signals; and iv) a two-dimensional memory means for storing signals input from the first output terminal of the second switching circuit to each row, wherein N number of rows or columns of signal sources are connected to the first input terminal of the first switching circuit, and signals read out by column from the two-dimensional memory means are connected to the second input terminal of the first switching circuit.
BRIEF DESCRIPTION OF THE DRAWINGS
Fig. 1 (a) and (b) show diagrams of the neural operation units used in the present invention.
Fig. 2 shows a diagram of the one-dimensional discrete cosine transformation circuit of the first embodiment of the present invention.
Fig. 3 shows a diagram of the two-dimensional discrete cosine transformation circuit of the second embodiment of the present invention.
Fig. 4 shows a diagram of a variation of the two-dimensional discrete cosine transformation circuit of the present invention.
Fig. 5 shows a diagram of another variation of the two-dimensional discrete cosine transformation circuit of the present invention.
PREFERRED EMBODIMENT OF THE PRESENT INVENTION
Fig. 1 (a) shows the structure of neural operation unit (NOU) 10 used in the discrete cosine transformation circuit of the present invention. In this figure, 1 and 2 are input terminals for inputting analog voltage signals, 3 is an output terminal, 4 and 5 are inverting amplifiers, and 7 and 8 are capacitors having identical capacities, with the capacity of each assumed to be C0. The input of inverting amplifier 4 is connected to input terminal 1, and the output of inverting amplifier 4 is connected to an input of inverting amplifier 5 through capacitor 7. Input terminal 2 is connected to the input of inverting amplifier 5, its output being connected to output terminal 3. Capacitor 6 is provided between the input and output of inverting amplifier 4, and capacitor 8 is provided between the input and output of inverting amplifier 5. Inverting amplifiers 4 and 5 include CMOS inverters connected in serial by an odd number of stages and other components.
The working mechanism of neural operation unit 10 having the above structure is described with reference to Fig. 1 (b), which shows neural operation unit 10 with three input voltages applied. As shown, voltages V1 and V2 are applied to input terminal 1 through capacitors C1 and C2, respectively, and voltage V3 is applied to input terminal 2 through capacitor C3.
Point A on the input of inverting amplifier 4 is connected to the capacitors C0, C1 and C2, and to an n-type MOSFET and a p-type MOSFET gate electrodes which are included in the first-stage CMOS inverter of inverting amplifier 4. Point A is floating, as is point B. If all the electric charges stored in capacitors 6, 7, 8, C1, C2 and C3 are 0, the total quantity stored in the capacitors is 0 based on the principle of conservation of charge with reference to points A and B, even when input voltages V1, V2 and V3 are applied.
Consequently, formulas of conservation of charge (1) and (2) at points A and B, respectively, pertain.<maths id="math0001" num=""><math display="block"><mrow><mtable><mtr><mtd><mrow><mtable><mtr><mtd><mrow><mtable><mlabeledtr><mtext>(1)</mtext><mtd><mrow><mtext>C1(V1-Vb)+C2(V2-Vb)+C0(Va-Vb)=0</mtext></mrow></mtd></mlabeledtr></mtable></mrow></mtd></mtr><mtr><mtd><mrow><mtable><mlabeledtr><mtext>(2)</mtext><mtd><mrow><mtext>C0(Va-Vb)+C3(V3-Vb)+C0(Vout-Vb)=0 </mtext></mrow></mtd></mlabeledtr></mtable></mrow></mtd></mtr></mtable></mrow></mtd></mtr></mtable></mrow></math><img file="EP0803829A1_D0001.tif" /></maths>
Here, Vb is the electric potential on points A and B, and Va is the electric potential of the output of inverting amplifier 4. The electric potential Vb of points A and B is usually set to be 1/2 of the supply voltage applied to inverting amplifiers 4 and 5. When inverting amplifiers 4 and 5 are driven by +Vdd and the grounded potential, the Vb is +(1/2)Vdd, and when inverting amplifiers 4 and 5 are driven by positive and negative supply voltages, respectively, it is 0 volts.
Formula (3) can be derived from formulas (1) and (2):<maths id="math0002" num="(3)"><math display="block"><mrow><mtext>C1(V1-Vb)+C2(V2-Vb)-C3(V3-Vb)-C0(Vout-Vb)=0</mtext></mrow></math><img file="EP0803829A1_D0002.tif" /></maths>
When the electric potentials in formula (3) correspond to the potentials on reference Vb as <maths id="math0003" num=""><math display="inline"><mrow><mtext>V(1) =V1-Vb</mtext></mrow></math><img file="EP0803829A1_D0003.tif" /></maths>, <maths id="math0004" num=""><math display="inline"><mrow><mtext>V(2)=V2-Vb</mtext></mrow></math><img file="EP0803829A1_D0004.tif" /></maths>, <maths id="math0005" num=""><math display="inline"><mrow><mtext>V(3)=V3-Vb</mtext></mrow></math><img file="EP0803829A1_D0005.tif" /></maths>, <maths id="math0006" num=""><math display="inline"><mrow><mtext>Vo=Vout-Vb</mtext></mrow></math><img file="EP0803829A1_D0006.tif" /></maths>, formula (3) can be expressed by formula (4):<maths id="math0007" num="(4)"><math display="block"><mrow><mtext mathvariant="italic">Vo</mtext><mtext> = </mtext><mfrac><mrow><mtext mathvariant="italic">C</mtext><mtext>1</mtext></mrow><mrow><mtext mathvariant="italic">C</mtext><mtext>0</mtext></mrow></mfrac><mtext mathvariant="italic">V</mtext><mtext>(1) + </mtext><mfrac><mrow><mtext mathvariant="italic">C</mtext><mtext>2</mtext></mrow><mrow><mtext mathvariant="italic">C</mtext><mtext>0</mtext></mrow></mfrac><mtext mathvariant="italic">V</mtext><mtext>(2) - </mtext><mfrac><mrow><mtext mathvariant="italic">C</mtext><mtext>3</mtext></mrow><mrow><mtext mathvariant="italic">C</mtext><mtext>0</mtext></mrow></mfrac><mtext mathvariant="italic">V</mtext><mtext>(3)</mtext></mrow></math><img file="EP0803829A1_D0007.tif" /></maths>
Formula (4) means that V(1) and V(2) for inputting to input terminal 1 are added, and V(3) for inputting to input terminal 2 is subtracted. Input voltages V(1), V(2) and V(3) are output after being multiplied by the values corresponding to the ratios of C0 provided in neural operation unit 10 and the respective connected capacitors C1, C2 and C3.
The operations above are performed at an extremely high speed in a time span approximately equal to the delay time from input to output of inverting amplifiers 4 and 5. The circuit of NOU is realized as an integrated circuit of a semiconductor. Determining the capacities of the capacitances according to conductor areas makes them remarkably accurate, enabling accurate operation results. Since its voltage alone drives the neural operation unit, electric power consumption is quite low.
The discrete cosine transformation circuit of the present invention uses the above neural operation unit as its operation unit.
Next, the one-dimensional discrete cosine transformation circuit of the first embodiment of the present invention is described.
The one-dimensional discrete cosine transformation on point N of the first dimensional signal x(k) is defined by formula (5):<maths id="math0008" num=""><img file="EP0803829A1_D0008.tif" /></maths>
When it is assumed that <maths id="math0009" num=""><math display="inline"><mrow><mtext>C(m,k)=cos(kπ/m)</mtext></mrow></math><img file="EP0803829A1_D0009.tif" /></maths> through one cycle of operation, formula (5) can be simplified into formula (6). This is the example when N=8.<maths id="math0010" num=""><math display="block"><mrow><mtable><mtr><mtd><mrow><mtable><mtr><mtd><mrow><mtable><mlabeledtr><mtext>(6)</mtext><mtd><mrow><mtext mathvariant="italic">y</mtext><mtext>(0) = </mtext><mfrac><mrow><mtext>1</mtext></mrow><mrow><mtext>2√2</mtext></mrow></mfrac><mtext></mtext><apply><sum /><lowlimit><mtext mathvariant="italic">k</mtext><mtext>=0</mtext></lowlimit><uplimit><mtext>7</mtext></uplimit><mrow><mtext mathvariant="italic">x</mtext><mtext>(</mtext><mtext mathvariant="italic">k</mtext><mtext>)</mtext></mrow></apply></mrow></mtd></mlabeledtr></mtable></mrow></mtd></mtr><mtr><mtd><mrow><mtable><mlabeledtr><mtext>(7)</mtext><mtd><mrow><mtext>y(1)=</mtext><mfrac><mrow><mtext>1</mtext></mrow><mrow><mtext>2</mtext></mrow></mfrac><mtext> {x(0)C(16,1)+x(1)C(16,3)+x(2)C(16,5)+x(3)C(16,7) -x(4)C(16,7)-x(5)C(16,5)-x(6)C(16,3)-x(7)C(16,1)}</mtext></mrow></mtd></mlabeledtr></mtable></mrow></mtd></mtr><mtr><mtd><mrow><mtable><mlabeledtr><mtext>(8)</mtext><mtd><mrow><mtext>y(2) = </mtext><mfrac><mrow><mtext>1</mtext></mrow><mrow><mtext>2</mtext></mrow></mfrac><mtext> {x(0)C(8,1)+x(1)C(8,3)-x(2)C(8,3)-x(3)C(8,1) -x(4)C(8,1)-x(5)C(8,3)+x(6)C(8,3)+x(7)C(8,1)}</mtext></mrow></mtd></mlabeledtr></mtable></mrow></mtd></mtr><mtr><mtd><mrow><mtable><mlabeledtr><mtext>(9)</mtext><mtd><mrow><mtext mathvariant="italic">y</mtext><mtext>(3) = </mtext><mfrac><mrow><mtext>1</mtext></mrow><mrow><mtext>2</mtext></mrow></mfrac><mtext> {x(0)C(16,3)-x(1)C(16,7)-x(2)C(16,1)-x(3)C(16,5) +x(4)C(16,5)+x(5)C(16,1)+x(6)C(16,7)-x(7)C(16,3)}</mtext></mrow></mtd></mlabeledtr></mtable></mrow></mtd></mtr><mtr><mtd><mrow><mtable><mlabeledtr><mtext>(10)</mtext><mtd><mrow><mtext mathvariant="italic">y</mtext><mtext>(4) = </mtext><mfrac><mrow><mtext>1</mtext></mrow><mrow><mtext>2√2</mtext></mrow></mfrac><mtext> {x(0)-x(1)-x(2)+x(3)+x(4)-x(5)-x(6)+x(7)</mtext></mrow></mtd></mlabeledtr></mtable></mrow></mtd></mtr><mtr><mtd><mrow><mtable><mlabeledtr><mtext>(11)</mtext><mtd><mrow><mtext mathvariant="italic">y</mtext><mtext>(5) = </mtext><mfrac><mrow><mtext>1</mtext></mrow><mrow><mtext>2</mtext></mrow></mfrac><mtext> {x(0)C(16,5)-x(1)C(16,1)+x(2)C(16,7)+x(3)C(16,3) -x(4)C(16,3)-x(5)C(16,7)+x(6)C(16,1)-x(7)C(16,5)}</mtext></mrow></mtd></mlabeledtr></mtable></mrow></mtd></mtr><mtr><mtd><mrow><mtable><mlabeledtr><mtext>(12)</mtext><mtd><mrow><mtext mathvariant="italic">y</mtext><mtext>(6) = </mtext><mfrac><mrow><mtext>1</mtext></mrow><mrow><mtext>2</mtext></mrow></mfrac><mtext> {x(0)C(8,3)-x(1)C(8,1)+x(2)C(8,1)-x(3)C(8,3) -x(4)C(8,3)+x(5)C(8,1)-x(6)C(8,1)+x(7)C(8,3)}</mtext></mrow></mtd></mlabeledtr></mtable></mrow></mtd></mtr><mtr><mtd><mrow><mtable><mlabeledtr><mtext>(13)</mtext><mtd><mrow><mtext mathvariant="italic">y</mtext><mtext>(7) = </mtext><mfrac><mrow><mtext>1</mtext></mrow><mrow><mtext>2</mtext></mrow></mfrac><mtext> {x(0)C(16,7)-x(1)C(16,5)+x(2)C(16,3)-x(3)C(16,1) +x(4)C(16,1)-x(5)C(16,3)+x(6)C(16,5)-x(7)C(16,7)} </mtext></mrow></mtd></mlabeledtr></mtable></mrow></mtd></mtr></mtable></mrow></mtd></mtr></mtable></mrow></math><img file="EP0803829A1_D0010.tif" /></maths>
Using the neural operation unit described above, the one-dimensional discrete cosine transformation circuit of the first embodiment performs the operations in formulas (6) to (13) in parallel. Fig. 2 shows the structure of the one-dimensional discrete cosine transformation circuit on eight points of N. In Fig. 2, 11 to 18 are the neural operation units mentioned above, d0 to d6 are capacitors, and x(0) to x(7) are one-dimensional input signals. As shown, matrices are formed by the wiring connected to the one-dimensional input signals x(0) to x(7), and to positive input terminals "+" and negative input terminals "-" of neural operation units 11 to 18. Capacitors d0 to d6 are connected to the cross points of the wiring. The "+" and "-" correspond to input terminals 1 and 2 in Fig. 1.
Capacitors d0 to d6 are formed so as to possess the capacities in formulas (14) to (20) when the capacity of the capacitors in neural operation units 11 to 18 is C0:<maths id="math0011" num=""><math display="block"><mrow><mtable><mtr><mtd><mrow><mtable><mtr><mtd><mrow><mtable><mlabeledtr><mtext>(14)</mtext><mtd><mrow><mtext mathvariant="italic">d</mtext><mtext>0 = </mtext><mfrac><mrow><mtext>1</mtext></mrow><mrow><mtext>2√2</mtext></mrow></mfrac><mtext></mtext><mtext mathvariant="italic">C</mtext><mtext>0</mtext></mrow></mtd></mlabeledtr></mtable></mrow></mtd></mtr><mtr><mtd><mrow><mtable><mlabeledtr><mtext>(15)</mtext><mtd><mrow><mtext mathvariant="italic">d</mtext><mtext>1 = </mtext><mfrac><mrow><mtext mathvariant="italic">C</mtext><mtext>(16,1)</mtext></mrow><mrow><mtext>2</mtext></mrow></mfrac><mtext></mtext><mtext mathvariant="italic">C</mtext><mtext>0 = </mtext><mfrac><mrow><mtext>cos(π/16)</mtext></mrow><mrow><mtext>2</mtext></mrow></mfrac><mtext></mtext><mtext mathvariant="italic">C</mtext><mtext>0</mtext></mrow></mtd></mlabeledtr></mtable></mrow></mtd></mtr><mtr><mtd><mrow><mtable><mlabeledtr><mtext>(16)</mtext><mtd><mrow><mtext mathvariant="italic">d</mtext><mtext>2 = </mtext><mfrac><mrow><mtext mathvariant="italic">C</mtext><mtext>(16,1)</mtext></mrow><mrow><mtext>2</mtext></mrow></mfrac><mtext></mtext><mtext mathvariant="italic">C</mtext><mtext>0 = </mtext><mfrac><mrow><mtext>cos(3π/16)</mtext></mrow><mrow><mtext>2</mtext></mrow></mfrac><mtext></mtext><mtext mathvariant="italic">C</mtext><mtext>0</mtext></mrow></mtd></mlabeledtr></mtable></mrow></mtd></mtr><mtr><mtd><mrow><mtable><mlabeledtr><mtext>(17)</mtext><mtd><mrow><mtext mathvariant="italic">d</mtext><mtext>3 = </mtext><mfrac><mrow><mtext mathvariant="italic">C</mtext><mtext>(16,5)</mtext></mrow><mrow><mtext>2</mtext></mrow></mfrac><mtext></mtext><mtext mathvariant="italic">C</mtext><mtext>0 = </mtext><mfrac><mrow><mtext>cos(5π/16)</mtext></mrow><mrow><mtext>2</mtext></mrow></mfrac><mtext></mtext><mtext mathvariant="italic">C</mtext><mtext>0</mtext></mrow></mtd></mlabeledtr></mtable></mrow></mtd></mtr><mtr><mtd><mrow><mtable><mlabeledtr><mtext>(18)</mtext><mtd><mrow><mtext mathvariant="italic">d</mtext><mtext>4 = </mtext><mfrac><mrow><mtext mathvariant="italic">C</mtext><mtext>(16,7)</mtext></mrow><mrow><mtext>2</mtext></mrow></mfrac><mtext></mtext><mtext mathvariant="italic">C</mtext><mtext>0 = </mtext><mfrac><mrow><mtext>cos(7π/16)</mtext></mrow><mrow><mtext>2</mtext></mrow></mfrac><mtext></mtext><mtext mathvariant="italic">C</mtext><mtext>0</mtext></mrow></mtd></mlabeledtr></mtable></mrow></mtd></mtr><mtr><mtd><mrow><mtable><mlabeledtr><mtext>(19)</mtext><mtd><mrow><mtext mathvariant="italic">d</mtext><mtext>5 = </mtext><mfrac><mrow><mtext mathvariant="italic">C</mtext><mtext>(8,1)</mtext></mrow><mrow><mtext>2</mtext></mrow></mfrac><mtext></mtext><mtext mathvariant="italic">C</mtext><mtext>0 = </mtext><mfrac><mrow><mtext>cos(π/8)</mtext></mrow><mrow><mtext>2</mtext></mrow></mfrac><mtext></mtext><mtext mathvariant="italic">C</mtext><mtext>0</mtext></mrow></mtd></mlabeledtr></mtable></mrow></mtd></mtr><mtr><mtd><mrow><mtable><mlabeledtr><mtext>(20)</mtext><mtd><mrow><mtext mathvariant="italic">d</mtext><mtext>6 =</mtext><mfrac><mrow><mtext mathvariant="italic">C</mtext><mtext>(8,3)</mtext></mrow><mrow><mtext>2</mtext></mrow></mfrac><mtext></mtext><mtext mathvariant="italic">C</mtext><mtext>0 = </mtext><mfrac><mrow><mtext>cos(3π/8)</mtext></mrow><mrow><mtext>2</mtext></mrow></mfrac><mtext></mtext><mtext mathvariant="italic">C</mtext><mtext>0</mtext></mrow></mtd></mlabeledtr></mtable></mrow></mtd></mtr></mtable></mrow></mtd></mtr></mtable></mrow></math><img file="EP0803829A1_D0011.tif" /></maths>
In this structure, the one-dimensional input signals x(0) to x(7) are input in parallel to the positive input terminals "+" and the negative input terminals "-" of eight neural operation units (NOU) 11 to 18 through capacitors d0 to d6 connected to the cross points of the matrices. In each NOU 11 to 18, input signals x(0) to x(7) are added and subtracted: x(0) to x(7) are multiplied beforehand by the coefficient determined by capacities of capacitors d0 to d6 which are connected to NOU 11 to 18. Thereafter, discrete cosine transforming coefficients y(0) to y(7) are output.
All input signals x(0) to x(7) are input to the positive input terminal of NOU 11 through capacitor d0. The operation in formula (6) above is performed in NOU 11.
Similarly, the operations in formulas (7) to (13) are performed in NOU 12 to 18, respectively, and then discrete cosine transforming coefficients y(1) to y(7) are output from NOU 12 to 18, respectively.
The discrete cosine transformation on eight points is performed by the structure in Fig. 2. Any number of points on the first dimensional discrete cosine transformation circuit can be defined; it is not limited to eight.
N number of points of discrete cosine transformation can be performed in parallel in N number of neural operation circuits by the one-dimensional discrete cosine transformation circuit of the present invention. Each neural operation circuit has an operation time approximately identical to the propagation delay time of the inverting amplifier mentioned above. This enables high-speed operation of the one-dimensional discrete cosine transformation. As each neural operation unit includes two inverting amplifiers as mentioned, of which usually includes three steps of CMOS inverters, the one-dimensional discrete cosine transformation circuit can be realized with only 48 CMOS inverters and 88 capacitors. Consequently, the quantity of hardware is small.
The two-dimensional discrete cosine transformation circuit of the second embodiment of the present invention is as follows.
The two-dimensional discrete cosine transformation is defined by formula (21):<maths id="math0012" num="(21)"><math display="block"><mrow><mtext mathvariant="italic">y</mtext><mtext>(</mtext><mtext mathvariant="italic">u</mtext><mtext>,</mtext><mtext mathvariant="italic">v</mtext><mtext>) = </mtext><mfrac><mrow><mtext>2</mtext></mrow><mrow><mtext mathvariant="italic">N</mtext></mrow></mfrac><mtext mathvariant="italic">C</mtext><mtext>(</mtext><mtext mathvariant="italic">u</mtext><mtext>)</mtext><mtext mathvariant="italic">C</mtext><mtext>(</mtext><mtext mathvariant="italic">v</mtext><mtext>)</mtext><apply><sum /><lowlimit><mtext mathvariant="italic">i=0</mtext></lowlimit><uplimit><mtext mathvariant="italic">N</mtext><mtext>-1</mtext></uplimit><mrow><apply><sum /><lowlimit><mtext mathvariant="italic">j</mtext><mtext>=0</mtext></lowlimit><uplimit><mtext mathvariant="italic">N</mtext><mtext>-1</mtext></uplimit><mrow><mtext mathvariant="italic">x</mtext><mtext>(</mtext><mtext mathvariant="italic">i</mtext><mtext>,</mtext><mtext mathvariant="italic">j</mtext><mtext>)cos </mtext><mfrac><mrow><mtext>(2</mtext><mtext mathvariant="italic">i</mtext><mtext>+1)</mtext><mtext mathvariant="italic">u</mtext><mtext>π</mtext></mrow><mrow><mtext>2</mtext><mtext mathvariant="italic">N</mtext></mrow></mfrac><mtext> cos </mtext><mfrac><mrow><mtext>(2</mtext><mtext mathvariant="italic">j</mtext><mtext>+1)</mtext><mtext mathvariant="italic">v</mtext><mtext>π</mtext></mrow><mrow><mtext>2</mtext><mtext mathvariant="italic">N</mtext></mrow></mfrac></mrow></apply></mrow></apply></mrow></math><img file="EP0803829A1_D0012.tif" /></maths>
The two-dimensional discrete cosine transformation can be decomposed into the processings of the one-dimensional discrete cosine transformations independent of the variables i and j. First, the one-dimensional discrete cosine transformation is performed with respect to i(j) as shown in formula (22) and then with respect to j(i) as shown in formula (23):<maths id="math0013" num=""><math display="block"><mrow><mtable><mtr><mtd><mrow><mtable><mtr><mtd><mrow><mtable><mlabeledtr><mtext>(22)</mtext><mtd><mrow><mtext mathvariant="italic">t</mtext><mtext>(</mtext><mtext mathvariant="italic">u,j</mtext><mtext>) = </mtext><msqrt><mfrac><mrow><mtext>2</mtext></mrow><mrow><mtext mathvariant="italic">N</mtext></mrow></mfrac></msqrt><mtext mathvariant="italic">C</mtext><mtext>(</mtext><mtext mathvariant="italic">u</mtext><mtext>)</mtext><apply><sum /><lowlimit><mtext mathvariant="italic">i</mtext><mtext>=0</mtext></lowlimit><uplimit><mtext mathvariant="italic">N</mtext><mtext>-1</mtext></uplimit><mrow><mtext mathvariant="italic">x</mtext><mtext>(</mtext><mtext mathvariant="italic">i</mtext><mtext>,</mtext><mtext mathvariant="italic">j</mtext><mtext>)cos</mtext><mfrac><mrow><mtext>(2</mtext><mtext mathvariant="italic">i</mtext><mtext>+1)</mtext><mtext mathvariant="italic">u</mtext><mtext>π</mtext></mrow><mrow><mtext>2</mtext><mtext mathvariant="italic">N</mtext></mrow></mfrac></mrow></apply></mrow></mtd></mlabeledtr></mtable></mrow></mtd></mtr><mtr><mtd><mrow><mtable><mlabeledtr><mtext>(23)</mtext><mtd><mrow><mtext mathvariant="italic">y</mtext><mtext>(</mtext><mtext mathvariant="italic">u</mtext><mtext>,</mtext><mtext mathvariant="italic">v</mtext><mtext>) = </mtext><msqrt><mfrac><mrow><mtext>2</mtext></mrow><mrow><mtext mathvariant="italic">N</mtext></mrow></mfrac></msqrt><mtext mathvariant="italic">C</mtext><mtext>(</mtext><mtext mathvariant="italic">v</mtext><mtext>)</mtext><apply><sum /><lowlimit><mtext mathvariant="italic">j</mtext><mtext>=0</mtext></lowlimit><uplimit><mtext mathvariant="italic">N</mtext><mtext>-1</mtext></uplimit><mrow><mtext mathvariant="italic">t</mtext><mtext>(</mtext><mtext mathvariant="italic">u</mtext><mtext>,</mtext><mtext mathvariant="italic">j</mtext><mtext>)cos</mtext><mfrac><mrow><mtext>(2</mtext><mtext mathvariant="italic">j</mtext><mtext>+1)</mtext><mtext mathvariant="italic">v</mtext><mtext>π</mtext></mrow><mrow><mtext>2</mtext><mtext mathvariant="italic">N</mtext></mrow></mfrac></mrow></apply></mrow></mtd></mlabeledtr></mtable></mrow></mtd></mtr></mtable></mrow></mtd></mtr></mtable></mrow></math><img file="EP0803829A1_D0013.tif" /></maths> These two operations reduce the number of operations
Fig. 3 shows the structure of the two-dimensional discrete cosine transformation circuit of the second embodiment. The circuit performs two dimensional discrete cosine transformations on 8 rows x 8 columns of data. In Fig. 3, 20 to 35 represent the one-dimensional discrete transformation circuits shown in Fig. 2. High-speed two-dimensional discrete cosine transformations can be performed by eight first discrete cosine transformation circuits 20 to 27 doing one-dimensional cosine transformations in column direction, and by the other eight first discrete cosine transformation circuits 28 to 35 doing such transformations in row-direction.
Eight inputs from x(0,0) to x(7,0), x(0,1) to x(7,1), ..., x(0,7) to x(7,7) are input to one-dimensional discrete cosine transformation circuits 20 to 27, respectively, and one-dimensional discrete cosine transformation is performed in each circuit. Then, first dimensional discrete cosine transforming coefficients t(0,0) to t(7,0), t(0,1) to t(7,1), ..., t(0,7) to t(7,7) are output from circuits 20 to 27, respectively. Thereafter, coefficients belonging to the identical row of one-dimensional discrete cosine transforming coefficients t(0,0) to t(7,7) are input to one-dimensional discrete cosine transformation circuits 28 to 35 in such manner that coefficients t(7,0) to t(7,7) are input to first discrete cosine transformation circuit 28, and coefficients t(6,0) to t(6,7) are input to circuit 29.
Number 42 shows a buffer and D/A converting circuit for inputting one row of image data in sequence in such manner as to read data from x(0,0) to x(0,7) first, x(1,0) to x(1,7) second, and successively on to x(7,0) to x(7,7), converting the data from digital to analog and outputting it to one-dimensional cosine transformation circuit 43. Number 43 shows a one-dimensional discrete cosine transformation circuit for performing discrete cosine transformation on the one-row image data converted into analog data input from the buffer and D/A converting circuit 42. Its structure is similar to that in Fig. 2. Number 44 shows an analog memory for storing output from one-dimensional discrete cosine transformation circuit 43, including a two-dimensional analog shift register, for example. Number 45 shows a one-dimensional discrete cosine transformation circuit for reading in column direction the one-dimensional discrete cosine coefficients stored in analog memory 44 and performing one-dimensional discrete cosine transformation. It has the same structure as that in Fig. 2.
In the two-dimensional DCT circuit having the above structure, data x(0,0) to x(0,7) on the 0-order row in the 8x8 8-bit digital image data stored in digital memory 41 is read out into the buffer and D/A converting circuit 42, and each is the, converted into an analog voltage signal. The image data signal of one row converted into the analog voltage signal in the buffer and D/A converting circuit 42 is supplied in parallel to one-dimensional DCT circuit 43, which then performs in parallel the one-dimensional discrete cosine transformation. Conversion result outputs t(0,0) to t(0,7) are written in analog memory 44.
Digital image data of the first row x(1,0) to x(1,7) stored in digital memory 41 is input to the buffer and D/A converting circuit 42, the one-dimensional discrete cosine conversion is performed in DCT circuit 43, and results t(1,0) to t(1,7) are stored in analog memory 44. Similarly, digital image data in digital memory 41 are successively input to the buffer and D/A converting circuit 42 row by row, and the one-dimensional discrete cosine conversion is performed in one-dimensional DCT circuit 43. The results are successively stored in analog memory 44, and the results after performing the row by row one-dimensional discrete cosine conversions are stored in analog memory 44, as shown in Fig. 4.
Data stored in analog memory 44 is read out by column by column in column direction and supplied to one-dimensional DCT circuit 45. That is, 0-order column data t(0,0) to t(0,7) among the data in analog memory 44 is read out and supplied to one-dimensional DCT circuit 45 and the first degree discrete cosine transformation performed. This DCT circuit 45 performs the first discrete cosine transformation in column direction, and two-dimensional discrete cosine conversion coefficients from y(0,0) to y(0,7) are output from first degree DCT circuit 45.
First column data from t(1,0) to t(1,7) is read out from analog memory 44 and the one-dimension cosine conversion performed in one-dimension DCT circuit 45. The two-dimensional discrete cosine conversion coefficients from y(1,0) to y(1,7) are next output from the outputs of one-dimensional DCT circuit 45. Similarly, data in column direction is read out and processed successively in one-dimensional DCT circuit 45. Results of the two-dimensional discrete cosine conversions are then successively output from the outputs of one-dimensional DCT circuit 45.
Though the time requisite for the two-dimensional discrete cosine conversion increases, the quantity of hardware in this embodiment is small.
Fig. 5 shows the embodiment with legs hardware than that of the embodiment in Fig. 4. The quantity of the hardware of the embodiment is smaller by switch-using a single one-dimensional DCT circuit from input to output and from output to input. The structure is formed because one-dimensional DCT circuits 43 and 45 do not work at the same time in Fig. 4.
In Fig. 5, 41, 42 and 44, respectively, are the digital memory buffer and D/A converting circuit and analog memory identical to those in Fig. 4. Number 50 is the one-dimensional DCT circuit exactly like that in Fig. 2, and 46 and 47 are switching circuits for switching the input and the output, respectively, for this DCT circuit 50.
In the two-dimensional DCT circuit with the above structure, switching circuit 46 is initially set so that data from side A is output and switching circuit 47 so that the supplied data is output to side D. In this configuration, similar to that in Fig. 4, image data stored in digital memory 41 is sequentially read out by one row into the buffer and D/A converting circuit 42, and the signal, now converted into analog, is applied to one-dimensional circuit 50 through switching circuit 46. The output signal, having had the one-dimensional discrete cosine conversion performed in row direction in one-dimensional DCT circuit 50, is output from side D of switching circuit 47 and sequentially stored in analog memory 44.
After completing the one-dimensional discrete cosine conversion with respect to the 8x8 image data in digital memory 41, the resulting data undergoes the one-dimensional discrete cosine conversion in analog memory 44 and is stored there in row direction. Then, the signal read out from analog memory 44 is switched so as to be input to one-dimensional DCT circuit 50 by switching circuit 46 to side B, and simultaneously, the output of one-dimensional DCT circuit 50 is switched so as to be output to the outside by switching circuit 47 to side C.
As above, after setting switching circuits 46 and 47, data is read out column by column from analog memory 44, input to one-dimensional DCT circuit 50 through switching circuit 46 and the one-dimensional discrete cosine conversion performed in column direction. The resulting signal of the two-dimensional discrete cosine conversion is output in sequence from one-dimensional DCT circuit 50 through an output terminal of switching circuit 47.
This embodiment decreases the amount of needed hardware.
ADVANTAGES OF THE PRESENT INVENTION
The discrete cosine transformation circuit of the present invention enables high-speed one- and two-dimensional discrete cosine conversions with minimal hardware.
Contents6
19 sheets
Sheet 1 Sheet 2 Sheet 3 Sheet 4 Sheet 5 Sheet 6 Sheet 7 Sheet 8 Sheet 9 Sheet 10 Sheet 11 Sheet 12 Sheet 13 Sheet 14 Sheet 15 Sheet 16 Sheet 17 Sheet 18 Sheet 19
Every citation, both waysCites: the store holds 9 of 10
| Document | Relation | Office | Category | Cited during | Relevant claims |
|---|---|---|---|---|---|
| EP0551524A1 | Cites | European Patent Office (EPO) | A | Search report | 1-4 |
| EP0551524A1 | Cites | European Patent Office (EPO) | A | Search report | 1-4 |
| US4156284A | Cites | United States of America | X | Search report | 1-4 |
| US4156923A | Cites | United States of America | A | Search report | 1-4 |
| US4156923A | Cites | United States of America | A | Search report | 1-4 |
| US4161785A | Cites | United States of America | A | Search report | 1-4 |
| US4161785A | Cites | United States of America | A | Search report | 1-4 |
| US5166896A | Cites | United States of America | A | Search report | 1-4 |
| WO9016039A1 | Cites | World Intellectual Property Organization (WIPO) | X | Search report | 1-4 |
6 members in 4 offices
Priority claims5
| Document | Office | Kind | Date |
|---|---|---|---|
| 8893296 | Japan | – | |
| 8893296 | Japan | A | |
| 8893296 | Japan | A | |
| 8893296 | – | – | – |
| JP19960088932 | – | – | – |
Members6
| Document | Office | Kind | |
|---|---|---|---|
| JPH09259206A | Japan | A | |
| EP0803829A1This record | European Patent Office (EPO) | A1 | |
| US5862070A | United States of America | A | |
| EP0803829B1 | European Patent Office (EPO) | B1 | |
| DE69700559D1 | Germany | D1 | |
| DE69700559T2 | Germany | T2 |
28 legal events, as 3 offices reported them to INPADOC
Over the term
Point at a mark for the eventEvents
| Event | Code | Office | |
|---|---|---|---|
| Notification of lapseLapsedST | ST | FR | |
| Gb: european patent ceased through non-payment of renewal feeCeasedGBPC | GBPC | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Annual fee paid to national office [announced via postgrant information from national office to epo]GrantedPGFP | PGFP | EP | |
| Annual fee paid to national office [announced via postgrant information from national office to epo]GrantedPGFP | PGFP | EP | |
| Annual fee paid to national office [announced via postgrant information from national office to epo]GrantedPGFP | PGFP | EP | |
| European patent in force as of 2002-01-01IF02 | IF02 | GB | |
| No opposition filedOpposition26N | 26N | EP | |
| No opposition filed within time limitOppositionORIGINAL CODE: 0009261PLBE | PLBE | EP | |
| Information on the status of an ep patent application or granted ep patentGrantedSTATUS: NO OPPOSITION FILED WITHIN TIME LIMITSTAA | STAA | EP | |
| Fr: translation filedET | ET | EP | |
| Corresponds to:REF | REF | EP | |
| Designated contracting statesAK | AK | EP | |
| Information on inventor provided before grant (corrected)RIN1 | RIN1 | EP | |
| Information on inventor provided before grant (corrected)RIN1 | RIN1 | EP | |
| Information on inventor provided before grant (corrected)RIN1 | RIN1 | EP | |
| Information on inventor provided before grant (corrected)RIN1 | RIN1 | EP | |
| (expected) grantORIGINAL CODE: 0009210GRAA | GRAA | EP | |
| Despatch of communication of intention to grant a patentORIGINAL CODE: EPIDOS IGRAGRAH | GRAH | EP | |
| Despatch of communication of intention to grantORIGINAL CODE: EPIDOS AGRAGRAG | GRAG | EP | |
| Despatch of communication of intention to grant a patentORIGINAL CODE: EPIDOS IGRAGRAH | GRAH | EP | |
| First examination report despatched17Q | 17Q | EP | |
| Despatch of communication of intention to grantORIGINAL CODE: EPIDOS AGRAGRAG | GRAG | EP | |
| Request for examination filed17P | 17P | EP | |
| Designated contracting statesAK | AK | EP | |
| Public reference made under article 153(3) epc to a published international application that has entered the european phaseORIGINAL CODE: 0009012PUAI | PUAI | EP |
Numbers
- Publication
- 0803829
- Publication, DOCDB
- 0803829
- Publication, EPODOC
- EP0803829
- Application
- 97104602
- Application, DOCDB
- 97104602
- Application, EPODOC
- EP19970104602
Titles3
- German
- Schaltung zur Berechnung der diskreten Cosinustransformation
- English
- Discrete cosine transformation circuit
- French
- Circuit de calcul d'un transformé discret du cosinus
Classification
- CPC, 2
- G06G7/22
- G06F17/147
- IPC, 2
- G06F17 14
- G06G7 22
Designated states3
- Contracting states, 3
- Germany
- France
- United Kingdom