A fast recursive algorithm for computing the discrete cosine transform

Hou, H. S.

doi:10.1109/tassp.1987.1165060

Cited by 294 publications

(10 citation statements)

References 16 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In other words, N-point IDCT can be decomposed into an N/2-point IDCT by partitioning even and odd coefficients. This allows us to generate 8point IDCT from lower-order 4-point IDCTs [6]. Therefore, this 4-point IDCT can be simultaneously shared both in MPEG-2 and H.264, and the problem of different transform size can be resolved.…”

Section: Dual-mode Video Decodermentioning

confidence: 99%

Topics in circuits for communications

2005

View full text Add to dashboard Cite

Section: Dual-mode Video Decodermentioning

confidence: 99%

Topics in circuits for communications

2005

View full text Add to dashboard Cite

“…Many algorithms are used to compute the DCT coefficients [3,4]. Using a time recursive lattice structure [5,6] is a good choice for generating the RT-DCT coefficients since it can produce dual transforms (e.g., "DCT and DSCT" or "DST and DCST").…”

Section: Introductionmentioning

confidence: 99%

A fast discrete transform architecture for Frequency Domain Motion Estimation

Ismail

McNeely

Shaaban

et al. 2010

2010 IEEE International Conference on Image Processing

View full text Add to dashboard Cite

Frequency Domain Motion Estimation (FDME) is a recent technique that promises to efficiently reduce the computational complexity of ME process. Related Transformed-Discrete Cosine Transform (RT-DCT) is one of the main modules that build the FDME encoder. The RT-DCT module is responsible for generating four transforms that are required for the ME process in the frequency domain. The main problem of generating such transforms is the low speed of the FDME encoder that prevents its use in real time applications. In this paper an efficient fast RT-DCT architecture is proposed to accelerate the encoding process in the frequency domain. The proposed architecture achieves approximately 58%, 39%, and 50% reductions in gate count, power consumption, and area compared to the conventional state of the art pipelined RT-DCT generators. Implementation and Simulation results project that the proposed RT-DCT architecture, when integrated in a whole FDME system, can perform ME for 60 fps of 4CIF video at 118 MHz.

show abstract

“…Compression performances using JPEG (Joint Photographic Experts Group), the conventional periodic-extended wavelet transform (PWT) and the symmetric-extended wavelet transform (SWT) are compared on image "azalea" in Figure 6.8 at bit rate of 0.5bpp after about 50 times compression. JPEG is implemented in Visual C++ using FDCT algorithm [80,81] to compress the windows device independent bitmap (DIB)…”

Section: Symmetric-extended Wavelet Transform On Image Compressionmentioning

confidence: 99%

High performance shift invariant motion estimation and compensation in wavelet domain video compression

Cai¹

View full text Add to dashboard Cite

A fast recursive algorithm for computing the discrete cosine transform

Cited by 294 publications

References 16 publications

Topics in circuits for communications

Topics in circuits for communications

A fast discrete transform architecture for Frequency Domain Motion Estimation

High performance shift invariant motion estimation and compensation in wavelet domain video compression

Contact Info

Product

Resources

About