Video Data Processing Memory Tile Scan Arrangement
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current video data processing methods, particularly in MPEG-2 compression, face inefficiencies due to the need for frequent memory access during motion compensation, which reduces encoding and decoding performance.
Innovation Solution
The method involves using a deblocking filter to store macroblock pixel data in consecutive memory addresses through a tile scan arrangement, reducing the number of memory accesses required for reference macroblock retrieval.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Quantity of substance
If a reference picture is stored in a buffer using conventional raster scan arrangement, then the memory can store the reference picture, but the number of memory accesses increases when retrieving macroblock data for motion compensation
Solution Approach 1:
The patent divides the reference picture into multiple picture segments, where each segment corresponds to a specific macroblock region. This segmentation allows the memory to be organized in a way that groups related macroblock data together, reducing the number of separate memory accesses needed when retrieving data for motion compensation. Each picture segment is stored contiguously in memory, enabling efficient sequential access patterns.
Solution Approach 2:
The patent introduces a new dimension to memory organization by mapping macroblock coordinates to memory addresses through a specific formula that incorporates both horizontal and vertical positions. This dimensional transformation reorganizes the memory layout from conventional raster scan to a pattern that optimizes for macroblock retrieval, reducing memory access hops by leveraging spatial proximity in the transformed coordinate space.
2Ease of manufacture
If conventional raster scan storage is used for reference pictures, then memory addresses are assigned sequentially, but the access efficiency for motion compensation is reduced due to scattered data locations
Solution Approach 1:
The patent changes the parameter mapping from simple sequential raster scan to a coordinate-based address calculation that uses both macroblock row and column indices. The memory address is calculated using the formula: base address + (macroblock_row × total_macroblocks_per_row + macroblock_col) × pixels_per_macroblock. This parameter transformation optimizes data locality for motion compensation operations while maintaining systematic address assignment.
3Ease of operation
If the line buffer memory accesses DRAM sequentially for each row, then the memory can be accessed in a simple manner, but the access efficiency is reduced when retrieving macroblock data across different rows
Solution Approach 1:
The patent performs preliminary organization of the reference picture into picture segments during the encoding process. Each picture segment is pre-grouped with its corresponding macroblock data in contiguous memory locations. This preliminary segmentation allows the line buffer memory to retrieve multiple macroblock rows with fewer sequential memory accesses, as the data is already organized in optimal segments rather than requiring random access across the entire reference picture.
Data Source
AI summary
A method and associated apparatus for processing video data are provided. The video data includes a first frame formed by a plurality of macroblocks. The method includes providing a memory, deblocking a first macroblock in the first frame, and writing the deblocked macroblock into the memory. The step of writing the deblocked macroblock lets a plurality of pixel data of the deblocked macroblock to be stored to a first storage space at consecutive addresses in the memory.