Video Encoder Without Frame Buffer Using Pixel Check Values
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
The high cost of frame buffer chips is driving up the cost of digital video compression systems, as they require storing entire frames of pixel information, which is inefficient and costly, especially when network throughput is insufficient.
Innovation Solution
The encoder stores only check values for groups of pixels instead of entire frames, using run-length, series, and pixel encoding commands, and sends these check values to the decoder, which can then use 'copy old' commands to replicate unchanged pixel lines, eliminating the need for a frame buffer chip.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If frame buffer chips are used to store entire frames of pixel information, then video compression can be achieved, but the hardware cost and device complexity increase significantly
Solution Approach 1:
The patent extracts only the essential information needed for video compression - specifically check values (hash codes) representing groups of pixels - rather than storing entire frames. This extraction approach eliminates the need for expensive frame buffer chips while maintaining the ability to detect and compress video data, directly resolving the contradiction between compression capability and hardware cost.
Solution Approach 2:
The patent changes the parameter representation from storing complete pixel frames to storing compressed check values (hash codes). This parameter transformation reduces the data volume dramatically, allowing video compression functionality to be achieved with minimal hardware resources, thus resolving the cost-complexity contradiction.
2Loss of information
If entire frames are stored in frame buffers, then pixel relationship determination is enabled, but data storage requirements and transmission volume increase
Solution Approach 1:
The patent extracts only the essential check values that represent pixel groups rather than storing complete frames. This extraction maintains the ability to determine pixel relationships through hash code comparison while reducing data storage volume from entire frames to mere check values, directly resolving this contradiction.
Solution Approach 2:
The patent uses check values as simplified copies or representations of actual pixel data. These check values serve as proxies that enable pixel relationship determination without requiring the original full-frame data, thus maintaining information utility while minimizing storage requirements.
3Device complexity
If check values are stored instead of entire frames, then hardware requirements are reduced, but the ability to determine pixel relationships may be compromised
Solution Approach 1:
The patent creates check values as representative copies of pixel groups using hash functions. These check values preserve the essential characteristics needed for relationship determination while using minimal storage. The decoder can accurately determine pixel relationships by comparing these check values, thus maintaining information accuracy while reducing hardware requirements.
Solution Approach 2:
The patent transforms pixel data into check values through hash function parameter changes. This transformation preserves the relational information needed for compression decisions while reducing the data to a compact form that can be stored in minimal hardware, resolving the contradiction between hardware requirements and information accuracy.
4Device complexity
If frame buffer chips are eliminated, then system cost decreases, but network throughput insufficiency may cause compression inefficiency
Solution Approach 1:
The patent extracts only check values for transmission rather than complete frame data. This extraction reduces the data volume to be transmitted over the network, making compression efficient even with limited network throughput. The system maintains high productivity by working with minimal data while eliminating expensive frame buffer hardware.
Data Source
Figure 1
Figure 2
Figure 3
AI summary
A video compression encoder which does not require a video frame buffer is disclosed. Without a frame buffer, incoming pixels can not be compared to pixels previously sent to the decoder. Instead, the disclosed encoder only stores check values for groups of pixels sent. If a group's check value has not changed, the encoder sends a command to the decoder not to change that pixel group. Also, without a frame buffer, an incoming video frame can not be captured and later sent to the decoder as network throughput permits. Instead, if throughput is insufficient to send an encoded group of pixels, the encoder leaves the check value for that group unchanged and sends a command instructing the decoder not to change those pixels. This defers updating that group until the next screen update is sent to the decoder. Grouping of pixels can be done in any fashion, for example; a group can be a single video line, a portion of a line, multiple lines or screen rectangles containing portions of multiple lines.