Frame Buffer Access Units for Compressed Image Random Retrieval
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Conventional methods for accessing compressed image frames in a frame buffer face difficulties in random data access due to continuous storage, which increases memory bus bandwidth requirements and hampers processing efficiency.
Innovation Solution
The method involves dividing image frames into access units and encoding units for data compression, generating output bitstreams based on compression results, and storing these in non-overlapping storage spaces within the frame buffer, allowing for random access by maintaining separate storage spaces for each access unit and using headers to track region sizes for efficient retrieval.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Quantity of substance
If data of the compressed image frame is continuously stored in the frame buffer, then the storage space utilization is improved, but the random access capability deteriorates
Solution Approach 1:
The frame buffer is divided into multiple non-overlapping storage spaces, with each storage space corresponding to a specific access unit. This segmentation allows the graphic processor to randomly access specific access units without reading the entire frame buffer, thereby maintaining random access capability while efficiently utilizing storage space through compression.
2Loss of energy
If data compression is employed to compress each image frame, then the memory bus bandwidth requirement is reduced, but the random access difficulty increases
Solution Approach 1:
The compressed image frame is divided into multiple access units, with each access unit stored in a separate non-overlapping storage space. This segmentation enables the graphic processor to randomly access specific access units without decompressing the entire frame, reducing memory bus bandwidth requirements while maintaining random access capability.
Solution Approach 2:
A header is introduced as an intermediary data structure that stores metadata about each access unit, including its position and size in the frame buffer. This header allows the graphic processor to quickly locate and access specific access units without scanning the entire compressed frame buffer, thereby facilitating random access while maintaining compression efficiency.
3Quantity of substance
If the frame buffer stores compressed data, then the storage capacity is improved, but the processing efficiency for graphic processors deteriorates
Solution Approach 1:
The frame buffer is segmented into non-overlapping storage spaces, each dedicated to a specific access unit. This segmentation allows the graphic processor to efficiently process only the required access units without decompressing and processing the entire frame buffer, thereby maintaining high processing efficiency while increasing storage capacity through compression.
Solution Approach 2:
The image frame is pre-divided into access units and compressed before being stored in the frame buffer. This preliminary action organizes the data in a way that facilitates efficient random access and processing, allowing the graphic processor to quickly retrieve and process only the necessary access units without unnecessary data transfer and decompression overhead.
Data Source
AI summary
A method for storing data of an image frame into a frame buffer includes at least the following steps: dividing the image frame into a plurality of access units, each having at least one encoding unit, wherein each encoding unit is a unit for data compression; and performing the data compression upon each encoding unit of the image frame, and generating an output bitstream to the frame buffer based on a data compression result of the encoding unit. A processing result of each access unit includes each output bitstream of the at least one encoding unit included in the access unit; a plurality of processing results of the access units are stored in a plurality of storage spaces allocated in the frame buffer, respectively; and a size of each of the storage spaces is equal to a size of a corresponding access unit.