Patent US5272471A successfully refreshed from Google Patents.
← Back to Patent Explorer
US5272471A Expired / Lapsed US ⏱️ 0.0 years remaining

Display system

Assignee: AUO Corp
•
Filing: 1992-10-07
•
Granted: 1993-12-21
•
Expires: 2012-10-07
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract A display system for converting N bit signals, each representing 2 N gray levels, to M bit signals representing 2 M gray levels, where N is an integer larger than or equal to 2 and M is an integer satisfying N>M≧1. Each of the N bit signals are separated into higher M bits and lower N-M bits. There are 2 N-M tables, each of which stores a distinctive set of P×Q modification values satisfying P×Q≧2 N-M . One of the tables is selected using the N-M bits. Unequality between a first set of modification values and a second set of modification values of the selected table are detected. The first set of modification values and the second set of modification values are exchanged to generate a modified table of the selected table. The M bits of one N bit signal and each of the modification values of the selected table are added to generate a first set of P×Q M bit signals. The M bits of the next N bit signal and each of the modification values of the modified table are added to generate a second set of P×Q M bit signals. The first and second sets of M bit signals are provided to a display device of 2 M gray levels.

Inventors

  • 👤 Shigeki Asada
  • 👤 Masayuki Sohda
  • 👤 Hiroaki Yasuda

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-11-07 21:55
CPC Classifications
G; G06; G06F; G06F3/00; G06F3/14; G06F3/153; G06F3/147; G06F3/1475; G09; G09G; G09G3/00; G09G3/20; G09G3/34; G09G3/36; G09G3/3611; G09G2340/00; G09G2340/04; G09G2340/0407; G09G2340/0414; G09G2340/0421; G09G2340/0442; G09G3/2007; G09G3/2044; G09G3/2051

Claims Analysis

Total Claims: 10
Claim 1
Independent Claim 216 words
A display system for converting N bit signals each, representing 2 N gray scale levels, to M bit signals representing 2 M gray levels, where N is an integer larger than or equal to 2 and M is an integer satisfying N>M≧1, said system comprising: means for separating each of said N bit signals into higher M bits and N-M bits; 2 N-M tables each of which stores a distinctive set of P×Q modification values satisfying P×Q≧2 N-M means for selecting one of said tables using said N-M bits; means for detecting unequality between first set of modification values and second set of modification values of said selected table, means for exchanging said first set of modification values and said second set of modification values to generate a modified table of said selected table; means for adding said M bits of one N bit signal and each of the modification values of said selected table to generate first set of P×Q M bit signals, and for adding said M bits of next N bit signal and each of the modification values of said modified table to generate second set of P×Q M bit signals; and means for supplying said first and second sets of M bit signals to a display device of 2 M gray levels.
Claim 2
Dependent Claim 216 words
A display system for converting N bit signals each, representing 2 N gray scale levels, to M bit signals representing 2 M gray levels, where N is an integer larger than or equal to 2 and M is an integer satisfying N>M≧1, said system comprising: means for separating each of said N bit signals into higher M bits and N-M bits; 2 N-M tables each of which stores a distinctive set of P×Q modification values satisfying P×Q≧2 N-M means for selecting one of said tables using said N-M bits; means for detecting unequality between first set of modification values and second set of modification values of said selected table, means for exchanging said first set of modification values and said second set of modification values to generate a modified table of said selected table; means for adding said M bits of one N bit signal and each of the modification values of said selected table to generate first set of P×Q M bit signals, and for adding said M bits of next N bit signal and each of the modification values of said modified table to generate second set of P×Q M bit signals; and means for supplying said first and second sets of M bit signals to a display device of 2 M gray levels.
Claim 3
Dependent Claim 44 words
A display system according to claim 1, wherein said display device receives said first and second sets of P×Q M bit signals to display them on Q image lines and the same image as that of the Qth image line on one additional line.
Claim 4
Dependent Claim 51 words
A display system according to claim 1, wherein said first set of modification values in said table are P modification values arranged in first horizontal line in said table, and said second set of modification values in said table are P modification values arranged in second horizontal line in said table.
Claim 5
Dependent Claim 51 words
A display system according to claim 1, wherein said first set of modification values in said table are Q modification values arranged in first vertical column in said table, and said second set of modification values in said table are Q modification values arranged in second vertical line in said Table.
Claim 6
Independent Claim 207 words
A method for converting N bit signals each, representing 2 N gray levels, to M bit signals representing 2 M gray levels, where N is an integer larger than or equal to 2 and M is an integer satisfying N>M≧1, said method comprising the steps of: separating each of said N bit signals into higher M bits and lower N-M bits; creating 2 N-M tables each of which stores a distinct set of P×Q modification values satisfying P×Q2≧ N-M ; selecting one of said tables using said N-M bits; detecting unequality between first set of modification values and second set of modification values of said selected table; exchanging said first set of modification values and said second set of modification values to generate a modified table of said selected table; adding said M bits of one N bit signal and each of the modification values of said selected table to generate first set of P×Q M bit signals and adding said M bits of next N bit signal and each of the modification values of said modified table to generate second set of P×Q M bit signals; and supplying said first and second sets of M bit signals to a display device of 2 M gray levels.
Claim 7
Independent Claim 207 words
A method for converting N bit signals each, representing 2 N gray levels, to M bit signals representing 2 M gray levels, where N is an integer larger than or equal to 2 and M is an integer satisfying N>M≧1, said method comprising the steps of: separating each of said N bit signals into higher M bits and lower N-M bits; creating 2 N-M tables each of which stores a distinct set of P×Q modification values satisfying P×Q2≧ N-M ; selecting one of said tables using said N-M bits; detecting unequality between first set of modification values and second set of modification values of said selected table; exchanging said first set of modification values and said second set of modification values to generate a modified table of said selected table; adding said M bits of one N bit signal and each of the modification values of said selected table to generate first set of P×Q M bit signals and adding said M bits of next N bit signal and each of the modification values of said modified table to generate second set of P×Q M bit signals; and supplying said first and second sets of M bit signals to a display device of 2 M gray levels.
Claim 8
Dependent Claim 42 words
A method according to claim 5, wherein said display device receives said first and second sets of P×Q M bit signals to display them on Q image lines and the same image as that of Qth image line on one additional line.
Claim 9
Dependent Claim 50 words
A method according to claim 5, wherein said first set of modification values in said table are P modification values arranged in first horizontal line in said table, and said second set of modification values in said table are P modification values arranged in second horizontal line in said table.
Claim 10
Dependent Claim 50 words
A method according to claim 5, wherein said first set of modification values in said table are Q modification values arranged in first vertical column in said table, and said second set of modification values in said table are Q modification values arranged in second vertical column in said table.

References Cited (Backward Citations)

US5155478A Cited
US4956638A Cited

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 1996-12-20 1997-06-21 1997-12-21 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 2000-12-20 2001-06-21 2001-12-21 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 2004-12-20 2005-06-21 2005-12-21 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag