Fast pipelined 2-D discrete cosine transform architecture

Boots – shoes – and leggings

Patent

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

364726, 364754, G06F 738, G06F 1500, G06F 1540

Patent

active

054834759

ABSTRACT:
A DCT circuit has a pre-processor stage which receives each element x.sub.ij i,j=1,2, . . . ,N, where N is an integer.gtoreq.4, of an input matrix X. The pre-processor stage simultaneously outputs Q.gtoreq.1 sequences of one or more columns of elements of a matrix A.sub.f having elements a.sub.ij =x.sub.ij +x.sub.(N-i+1)j i=1,2, . . . ,N/2, j=1,2, . . . ,N and Q.gtoreq.1 sequences of one or more columns of elements of a matrix A.sub.r having elements a.sub.ij =x.sub.(i-N/2)j -x.sub.(3N/2-i+1)j i=N/2+1, N/2+2, . . . ,N j=1,2, . . . ,N. The DCT circuit also has a 1-D DCT processing stage which simultaneously receives each of the 2Q sequences of elements outputted by the pre-processor stage, P sequences of one or more rows of elements of an N/2.times.N/2 DCT cosine coefficient matrix C.sub.1 and P sequences of rows of elements of an N/2.times.N/2 DCT cosine coefficient matrix C.sub.2. The 1-D DCT processing stage has K.gtoreq.1 column multiplication circuits which each simultaneously outputs a sequence of one or more vectors of elements of a matrix Y.sub.o containing the elements Y.sub.ij i=1,3, . . . ,N j=1,2, . . . ,N, where ##EQU1## and K.gtoreq.1 column multiplication circuits which each simultaneously outputs a sequence of one or more vectors of elements of a matrix Y.sub.e comprising elements Y.sub.ij i=2,4, . . . ,N j=1,2, . . . ,N where ##EQU2##

REFERENCES:
patent: 4150434 (1979-04-01), Shibayama et al.
patent: 4493048 (1985-01-01), Kung et al.
patent: 4553220 (1985-11-01), Swanson
patent: 4601006 (1986-07-01), Liu
patent: 4603348 (1986-07-01), Yamada et al.
patent: 4719588 (1988-01-01), Tatemichi et al.
patent: 4769790 (1988-06-01), Yamashita
patent: 4787057 (1988-11-01), Hammond
patent: 4791598 (1988-12-01), Liou et al.
patent: 4841469 (1989-06-01), Kuenemund et al.
patent: 4903231 (1990-02-01), Artieri
patent: 4918527 (1990-04-01), Penard et al.
patent: 4937776 (1990-06-01), Myers et al.
patent: 5038312 (1991-08-01), Kojima
patent: 5042007 (1991-08-01), D'Luna
patent: 5053985 (1991-10-01), Friedlander et al.
patent: 5177704 (1993-01-01), D'Luna
patent: 5204830 (1993-04-01), Wang et al.
patent: 5226002 (1993-07-01), Wu et al.
patent: 5267185 (1993-11-01), Akabane et al.
patent: 5291429 (1994-03-01), Iwana et al.
Shin-ichi Uramoto, Yoshitsugu Inoue, Akihiko Takabatake, Jun Takeda, Yukihiro Yamashita, Hideyuki Terane, and Masahiko Yoshimoto, A 100-MHz 2-D Discrete Cosine Transform Core Processor IEEE Journal Of Solid-State Circuits, vol. 27, No. 4 pp. 492-497 (1992).
N. Ahmed, et al., "Discrete Cosine Transform," IEEE Trans. on Computers, vol. C-23, Jan. 1974, pp. 90-93.
N. Cho, et al., "Fast Algorithm and Implementation of 2-D Discrete Cosine Transform," IEEE Transactions On Circuits And Systems, vol. 38, No. 3, Mar. 1991.
M. Sun, et al., "VLSI Implementation of a 16X16 Discrete Cosine Transform," IEEE Transactions On Circuits And Systems, vol. 36, No. 4, April 1989.
H. Hou, "A Fast Recursive Algorithm For Computing the Discrete Cosine Transform" IEEE Transactions On Acoustics, Speech, And Signal Proc., vol. ASSP-35, No. 10, Oct. 1987.

LandOfFree

Say what you really think

Search LandOfFree.com for the USA inventors and patents. Rate them and share your experience with other people.

Rating

Fast pipelined 2-D discrete cosine transform architecture does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Fast pipelined 2-D discrete cosine transform architecture, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Fast pipelined 2-D discrete cosine transform architecture will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-1307400

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.