Compressed Frame Scanning for PMOLED Displays

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Conventional PMOLED display driving methods struggle to maintain a high refresh rate when the number of rows exceeds a certain limit, leading to reduced brightness and visual flickering due to increased aggregate scan time.

Innovation Solution

A system and method for compressed frame scanning, which identifies pixels with maximum brightness data in each row, computes scan times based on brightness indices, and determines aggregate scan times to enable efficient scanning of frames, potentially dividing frames into sub-frames for further compression.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Quantity of substance

If the number of rows is extended to increase display resolution, then the display can show more pixels, but the aggregate scan time increases beyond the refresh rate period causing reduced brightness and flickering

Engineering Contradiction:
Improvenumber of rowsVSAvoidaggregate scan time
Core Design Contradiction:
Quantity of substanceVSLoss of time

Solution Approach 1:

The patent divides the frame into multiple sub-frames, where each sub-frame contains a subset of rows to be scanned. This segmentation allows the scanning task to be distributed across multiple smaller units, enabling the display to maintain high refresh rates even with an increased total number of rows by scanning sub-frames in sequence within the same time period.

Inventive Principle:
Principle #1Segmentation

2Device complexity

If conventional scanning method is used with fixed scan time per row, then the scanning process is simple, but the refresh rate decreases when number of rows increases

Engineering Contradiction:
Improvescanning control complexityVSAvoidrefresh rate
Core Design Contradiction:
Device complexityVSProductivity

Solution Approach 1:

The patent implements dynamic scan time adjustment where the scan time allocated to each row is not fixed but varies based on the brightness index of pixels in that row. Rows with higher brightness indices are scanned for longer durations to maintain perceived brightness, while rows with lower brightness indices receive shorter scan times. This dynamic allocation allows the system to maintain high refresh rates with more rows by optimizing the time distribution rather than using uniform fixed timing.

Inventive Principle:
Principle #15Dynamics

3Device complexity

If all source drivers drive the display panel concurrently with one common electrode switch selected at a time, then the driving method is simple, but the scan time per frame increases when number of rows exceeds 100

Engineering Contradiction:
Improvedriving method complexityVSAvoidframe scan time
Core Design Contradiction:
Device complexityVSLoss of time

Solution Approach 1:

The patent segments the frame into multiple sub-frames, where each sub-frame contains a subset of rows to be scanned. This segmentation allows the scanning task to be distributed across multiple smaller units, enabling the display to maintain high refresh rates even with an increased total number of rows by scanning sub-frames in sequence within the same time period.

Inventive Principle:
Principle #1Segmentation

Solution Approach 2:

The patent changes the scanning parameter from a fixed uniform scan time across all rows to a variable scan time based on brightness index. By adjusting the scan time parameter dynamically according to the content requirements of each row, the system optimizes the total frame scan time to fit within the refresh rate constraints even when the number of rows is increased.

Inventive Principle:
Principle #35Parameter changes

Data Source

PatentUS10347174B2System of compressed frame scanning for a display and a method thereof
Publication Date: 2019.07.09 SOLOMON SYSTECH CHINA LTD
  • US10347174B2 patent drawing
  • US10347174B2 patent drawing
  • US10347174B2 patent drawing

AI summary

A system enabling compressed frame scanning for a display and a method thereof are described herein. A pixel having a maximum pixel data in a row of the plurality of rows corresponding to a frame is identified. The maximum pixel data identified in the row is assigned as a pixel data for the row. A scan time for the row is computed based upon the pixel data of the row and a scanning time associated with a unit of the brightness index. An aggregate scan time for the frame is determined based upon the scan time computed for each of the plurality of rows corresponding to the frame. Finally, the frame is scanned based upon the aggregate scan time determined for the frame thereby enabling compressed scanning of the frame. The method is further implemented for randomly assigned rows of the frame to two or more sub-frames of the frame.