Buffer Controller Pixel Arrangement for Non-Divisible Storage
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
The challenge lies in efficiently arranging N-bit luma and chroma pixels in M-bit DRAM storage units where M is not divisible by N, which affects the efficiency of video compression and decompression due to storage and transmission limitations in video systems.
Innovation Solution
A method and apparatus for arranging pixels in storage units, involving a buffer write and read process where pixel data is calculated and stored in M-bit storage units, ensuring that each unit stores an integer number of N-bit pixels without fractional pixels, using a buffer controller that handles pixel data in a raster-scan order and manages storage space effectively.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Quantity of substance
If pixel data is stored in M-bit storage units where M is not divisible by N, then storage capacity is optimized, but data arrangement complexity increases
Solution Approach 1:
The patent segments pixel data into groups that can be fully stored in M-bit storage units. By dividing the pixel data stream into complete N-bit pixel groups (where the total bit count is divisible by M), the system avoids fractional pixel storage while maintaining efficient memory utilization. This segmentation approach resolves the contradiction by organizing data to match storage unit boundaries.
Solution Approach 2:
The patent changes the parameter of pixel grouping by adjusting how many N-bit pixels are grouped together to form complete M-bit storage units. By modifying the grouping parameter (number of pixels per group) to ensure divisibility, the system optimizes storage capacity while managing arrangement complexity through systematic parameter selection.
2Reliability
If pixel data is arranged to ensure complete pixels in each storage unit, then data integrity is improved, but storage efficiency decreases
Solution Approach 1:
The patent employs dynamic pixel grouping where the number of pixels per group is adjusted based on the specific M and N values. The system dynamically determines the optimal group size to ensure complete pixel storage while maximizing storage unit utilization. This dynamic approach allows the system to adapt to different storage unit sizes and maintain both data integrity and storage efficiency.
Solution Approach 2:
The patent changes the grouping parameter to optimize the balance between data integrity and storage efficiency. By selecting group sizes that are multiples of both N (for complete pixels) and that maximize M-bit utilization, the system achieves both complete pixel storage and high storage efficiency through parameter optimization.
3Productivity
If larger DRAM word width is used to increase system performance, then processing speed is improved, but compatibility with non-power-of-two pixel depths is lost
Solution Approach 1:
The patent creates a universal data arrangement method that works with any M-bit storage unit and any N-bit pixel depth combination. The systematic grouping approach (organizing pixels into complete groups that fill M-bit units) provides a multi-functional solution that maintains compatibility across different pixel depths (8, 10, 12 bits) while utilizing the full capacity of various DRAM word widths. This universal method preserves both high system performance and broad adaptability.
Data Source
AI summary
A buffer write method for a buffer, including a plurality of M-bit storage units, has following steps: obtaining pixel data of a plurality of first N-bit pixels of a picture; calculating a corresponding start address of the buffer for the pixel data of the first N-bit pixels; and storing the first N-bit pixels of the picture according to the calculated start address of the buffer in the M-bit storage units by a buffer controller. The storing step includes fully storing at least one of the first N-bit pixels in one of the M-bit storage units storage units, wherein M and N are positive integers, and M is not divisible by N.