Looking for breakthrough ideas for innovation challenges? Try Patsnap Eureka!

Inverse discrete cosine transform lookup fast algorithm with variable complexity

A technology of discrete cosine and fast algorithm, which is applied in television, electrical components, digital video signal modification, etc., can solve problems such as difficult realization of parallelism and difficult coupling of modules, so as to save interface cache and parameter transmission, speed up implementation, Reduce the effect of repeated calculations

Active Publication Date: 2012-07-04
LEADCORE TECH
View PDF6 Cites 7 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0014] 1. There are a large number of multiplication and addition operations in the prior art
[0015] 2. Fixed computing burden
The existing technology only roughly distinguishes all-zero blocks and non-all-zero blocks. Even if there is only one non-zero coefficient in the DCT coefficient matrix, a complete IDCT must be performed on the entire matrix;
[0016] 3. It is not easy to couple with other modules, and it is not easy to achieve parallelism

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Inverse discrete cosine transform lookup fast algorithm with variable complexity
  • Inverse discrete cosine transform lookup fast algorithm with variable complexity
  • Inverse discrete cosine transform lookup fast algorithm with variable complexity

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0071] The specific implementation manners of the present invention will be described in detail below in conjunction with the accompanying drawings.

[0072] The present invention utilizes the characteristics of the dequantized DCT coefficient matrix F (u, v) to organize technical solutions, that is, the present invention is based on the fact that there are a large number of zero values ​​in the dequantized DCT coefficient matrix F (u, v), and there are many non-zero coefficients Focus on the characteristics of the upper left corner of the matrix; the DCT coefficient matrix F(u, v) is disassembled, and the IDCT is completed only for the non-zero coefficient operation in the matrix to obtain the restored matrix, which can greatly reduce the amount of calculation. It mainly includes the following steps:

[0073] (1) Transform the DCT coefficient matrix F after inverse quantization into the form of the sum of multinomial matrices;

[0074] (2) Carry out inverse discrete cosine t...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

PUM

No PUM Login to View More

Abstract

The invention discloses an inverse discrete cosine transform (IDCT) lookup fast algorithm with variable complexity, which mainly aims at reducing the redundant operation in the original acceleration IDCT algorithm and accelerating the computation speed of an IDCT module. The algorithm provided by the invention comprises the steps of decomposing an inverse quantized DCT (discrete cosine transform) coefficient matrix F into polynomial matrixes to add; performing inverse discrete cosine transform for each decomposed matrix; and finally, adding the inverse discrete cosine transformed matrixes to obtain an original matrix f. The algorithm disclosed by the invention reduces the redundant operation in the original algorithm and effectively accelerates the computation speed of the inverse discrete cosine transform.

Description

technical field [0001] The invention relates to the technical field of digital image and video compression, in particular to the realization of a variable-complexity inverse discrete cosine transform table look-up algorithm of an IDCT (inverse discrete cosine transform) module in JPEG, MPEG, and H26X compression standards. Background technique [0002] Discrete cosine sine and inverse transform is an important part of most current multimedia compression standards (including: JPEG, MPEG, H26X). The two-dimensional discrete cosine transform (2D-DCT) redistributes the energy of the spatial domain signal, so that the low-frequency components containing most of the energy are concentrated together, and different lossy compression strategies are adopted according to the energy distribution, so that the energy loss can be reduced in the frequency domain. control. The discrete cosine inverse transform (2D-IDCT) restores the compressed frequency domain signal to the space domain, an...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

Application Information

Patent Timeline
no application Login to View More
Patent Type & Authority Applications(China)
IPC IPC(8): H04N7/26H04N7/30H04N19/625
Inventor 孙皓陈小敬
Owner LEADCORE TECH
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Patsnap Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Patsnap Eureka Blog
Learn More
PatSnap group products

Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com