Video Decoding Micro Architecture Using Shift Look-Up Tables

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Existing video decoding algorithms face a trade-off between efficiency and accuracy, where complex algorithms improve picture quality but reduce response speed, and simplifying algorithms to enhance speed results in data loss and decreased precision.

Innovation Solution

A method and apparatus for video decoding that utilize a micro architecture design with shift and look-up table processing on data stored in spaced data registers, followed by distributed computing to obtain decoded data, increasing accuracy while maintaining efficiency.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Manufacturing precision

If a relatively complicated decoding algorithm is used, then picture quality and display effect are improved, but decoding efficiency and response speed are reduced

Engineering Contradiction:
Improvepicture qualityVSAvoiddecoding efficiency
Core Design Contradiction:
Manufacturing precisionVSProductivity

Solution Approach 1:

The patent divides the decoding process into two separate processing paths: a first processing path for first coefficient matrix data and a second processing path for second coefficient matrix data. Each path has dedicated processing units that can operate independently and in parallel, thereby maintaining high decoding efficiency while ensuring accurate processing of each data type according to its specific requirements.

Inventive Principle:
Principle #1Segmentation

2Productivity

If the decoding algorithm is simplified to improve decoding performance, then decoding speed is improved, but accuracy of decoding process and precision of decoding output data are decreased

Engineering Contradiction:
Improvedecoding performanceVSAvoiddecoding accuracy
Core Design Contradiction:
ProductivityVSMeasurement precision

Solution Approach 1:

The patent implements different processing strategies for different types of coefficient matrix data. The first processing path is optimized for first coefficient matrix data with specific processing operations, while the second processing path is optimized for second coefficient matrix data with different processing operations. This localized optimization ensures that each data type receives the most appropriate processing for its characteristics, maintaining high accuracy without unnecessary complexity.

Inventive Principle:
Principle #3Local quality

3Speed

If data loss occurs in decoding output data, then processing speed may be improved, but the difference between display areas having different gray scale values increases and softness of display picture decreases

Engineering Contradiction:
Improveprocessing speedVSAvoiddisplay picture softness
Core Design Contradiction:
SpeedVSManufacturing precision

Solution Approach 1:

The patent performs preliminary classification of coefficient matrix data into first and second types before processing. By identifying and separating different data types in advance, the system can apply appropriate processing operations to each type, preventing data loss and maintaining the precision needed for smooth gray scale transitions in the final display output.

Inventive Principle:
Principle #10Preliminary action

Data Source

PatentUS9838704B2Method and apparatus for decoding video
Publication Date: 2017.12.05 BOE TECHNOLOGY GROUP CO LTD
  • US9838704B2 patent drawing
  • US9838704B2 patent drawing
  • US9838704B2 patent drawing

AI summary

Embodiments of the present application provide a method for decoding a video and an apparatus for decoding a video, which increases accuracy of data processing while simplifying a micro architecture design of inverse discrete cosine transform in video decoding process. The method comprises: storing received data to be decoded in a plurality of first data registers and a plurality of second data registers that are spaced with each other in sequence; performing shift and look-up table processing on the data to be decoded that is stored in the first data registers and the second data register, to obtain a look-up table result corresponding to a first coefficient matrix and a look-up table result corresponding to a second coefficient matrix respectively; performing a distributed computing on the look-up table result corresponding to the first coefficient matrix and the look-up table result corresponding to the second coefficient matrix, to obtain decoded data.