Image Processor Compression Engine Row Data Block Storage
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
The increasing demand for higher resolution video data, such as Full-HD and beyond, poses a challenge in efficiently using memory during image data processing, leading to issues with bandwidth and power consumption.
Innovation Solution
An image processor divides image frames into data blocks, performs compression on each block, and stores them in a memory using a control unit that optimizes storage by arranging compressed data blocks in continuous spaces, reducing waste and improving memory efficiency.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Quantity of substance
If image frames are stored in memory without compression, then memory usage efficiency is low and bandwidth consumption is high, but compression operations increase processing complexity and power consumption
Solution Approach 1:
The image frame is divided into multiple data blocks (M rows × N columns), and compression is performed on each block independently. This segmentation allows parallel processing, reduces the complexity of individual compression operations, and enables efficient memory storage by organizing compressed blocks in continuous storage spaces.
Solution Approach 2:
The compression operation is performed on each data block before storage in the memory. By performing compression in advance on segmented blocks, the system reduces the amount of data that needs to be transmitted and stored, thereby improving memory usage efficiency and reducing bandwidth consumption without requiring complex real-time compression of the entire image frame.
2Quantity of substance
If compression operation is performed on each data block individually, then memory usage efficiency improves, but processing time and power consumption increase
Solution Approach 1:
The image frame is divided into M rows of data block rows and each row is divided into N data blocks, creating M×N individual blocks. This segmentation enables parallel compression processing where multiple blocks can be compressed simultaneously, reducing the total processing time while maintaining the memory efficiency benefits of compressed storage.
Solution Approach 2:
The control unit stores compressed data blocks in continuous storage spaces in the memory, optimizing the storage arrangement to minimize access time and maximize throughput. This continuous storage arrangement allows for efficient data retrieval and reduces the overall processing time by eliminating gaps and fragmentation in memory usage.
3Quantity of substance
If data blocks are stored in continuous storage space, then memory efficiency and bandwidth savings improve, but storage organization complexity increases
Solution Approach 1:
The image frame is segmented into M rows of data block rows, with each row containing N data blocks. This segmentation structure provides a systematic organization for storing compressed blocks in continuous storage spaces, making the storage arrangement predictable and manageable while maximizing memory efficiency.
Solution Approach 2:
The control unit pre-determines the storage arrangement of compressed data blocks in continuous storage spaces before actual storage occurs. This preliminary organization plan eliminates the need for complex real-time storage decisions and reduces the operational complexity of managing memory allocation while maintaining high memory efficiency.
Data Source
AI summary
The present application provides a method for storing an image frame in a memory, including: receiving the image frame; dividing the image frame into M rows of data block rows along a first direction; dividing each of the M rows of data block rows into N data blocks along a second direction perpendicular to the first direction; performing a compression operation upon each of the M*N data blocks individually to generate M*N compressed data blocks; and storing N compressed data blocks corresponding to the 1st data block row of the M data block rows and N compressed data blocks corresponding to the (P+1)th data block row of the M data block rows in a continuous storage space in the memory, wherein M, N, and P are integers, and M>1, N>0 and P<M.