Method of reducing errors in displays using double-line sub-field addressing

• US 20010048431A1
• Filed: 04/11/2001
• Published: 12/06/2001
• Est. Priority Date: 04/25/2000
• Status: Active Grant

• Current Assignee: Koninklijke Philips Electronics N.V. (Koninklijke Philips N.V.)
• Original Assignee: Koninklijke Philips Electronics N.V. (Koninklijke Philips N.V.)
• Inventors: Van Dijk, Roy, Laffargue, Franck, Hoppenbrouwers, Jurgen Jean Louis
• Granted Patent: US 6,590,571 B2
• Time in Patent Office: Days
• US Class Current: 345/204
• CPC Class Codes: G09G 2310/0205 Simultaneous scanning of several lines in flat panels
• CPC Class Codes: G09G 3/2018 by time modulation using two or more time intervals
• CPC Class Codes: G09G 3/2022 using sub-frames
• CPC Class Codes: G09G 3/2037 with specific control of sub-frames corresponding to the least significant bits

Abstract

Method of calculating new luminance value data based on original luminance value data to be displayed on a matrix display device, where luminance value data are coded in sub-fields, and double-line addressing for the least significant sub-fields is used for reducing the addressing time. A reduction of the difference between the new data and the original data is obtained by computing a new common value for the least significant sub-fields of a set of neighboring or adjacent lines, and new values for the most significant sub-fields of each line of said set of adjacent lines. The method comprises embodiments which are applicable to both binary and non-binary sub-fields.

Claims

1. A method of determining new luminance value data based on original luminance value data to be displayed on a matrix display device, said new luminance value data being coded in sub-fields, said sub-fields consisting of a group of most significant sub-fields, and a group of least significant sub-fields, said device comprising a set of lines, said lines being grouped in sets of neighbouring or adjacent lines, wherein a common value for the least significant sub-fields is addressed simultaneously to the set of lines, characterized in that

a new common value for the least significant sub-fields of said set of neighbouring or adjacent lines is computed and addressed simultaneously to said set of lines, and new values for the most significant sub-fields of each line of said set of neighbouring or adjacent lines are computed and addressed to each line of said set.

2. A method as claimed in

claim 1

, wherein said sets of neighbouring or adjacent lines comprise pairs of lines.

3. A method as claimed in to

claim 2

, wherein the sub-fields have weights proportional to successive powers of two, the luminance value data being larger than or equal to zero, and smaller than two to the Nth power (2^N), N being the number of sub-fields, “

A”

being the original data of a first line of a pair of lines to be displayed, “

a”

being the weight of the least significant sub-fields of said first line, “

B”

being the original data of the other line of said pair of lines, “

b”

being the weight of the least significant sub-fields of said line, n being the number of doubled least significant sub-fields, r being a real number, the method comprising the steps of

computing a difference Δ

of a minus b (Δ

=a−

b);

computing Δ

′

as being 2 to the nth power minus Δ

(Δ

′

=2ⁿ−

Δ

) if Δ

is positive, and else being minus 2 to the nth power minus Δ

(Δ

′

=−

2ⁿ−

Δ

);

computing a new value for A (A′

) as being equal to the original value of A plus the integral part of the value of Δ

′

multiplied by r (A′

=A+int(Δ

′

*r)), and a new value for B (B′

) as being equal to the original value of B minus Δ

′

plus the integral part of the value of Δ

′

multiplied by r (B′

=B−

Δ

′

+int(A′

*r)), if the absolute value of Δ

is larger than 2 to the (n−

1)th power, and else a new value for A (A′

) as being equal to the original value of A minus the integral part of the value of Δ

multiplied by r (A′

=A−

int(Δ

*r), and a new value for B (B′

) as being equal to the original value of B plus Δ

minus the integral part of the value of Δ

multiplied by r (B′

=B+Δ

−

int(Δ

*r));

if said new value of A or said new value of B is smaller than zero, or equal to or larger than 2 to the Nth power, replacing said new values of A and B, respectively, by the original value of A minus the integral part of the value of Δ

multiplied by r (A−

int(Δ

*r), and by the original value of B plus Δ

minus the integral part of the value of Δ

multiplied by r (B+Δ

−

int(Δ

*r));

4. A method as claimed in

claim 3

, characterized in that r is given the value one half (r={fraction (1/2)}).

5. A method as claimed in

claim 3

, characterized in that r is given the value A divided by the sum of A and B (r=A/(A+B)).

6. A method as claimed in

claim 2

, “

A”

being the weight of the most significant sub-fields of the original data of a first line of a pair of lines to be displayed, “

a”

being the weight of the least significant sub-fields of said first line, “

B”

being the weight of the most significant sub-fields of the original data of the other line of said pair of lines to be displayed, “

b”

being the weight of the least significant sub-fields of said line, n being the number of least significant sub-fields, comprising the steps of

(a) computing lsb_max as being the sum of the weights of all least significant sub-fields;

(b) building a table (‘

MSB table’

) of the weight of all possible combinations of the most significant sub-fields;

(c) building a first corresponding table of the differences between the data A+a of the first line, and each element of the MSB table(‘

first differences set’

,A+a−

A′

);

(d) building a second corresponding table of the differences between the data B+b of the other line of said pair of lines, and each element of the MSB table (‘

subsequent differences set’

, B+b−

B′

);

(e) determining, among all pairs of values, the first one taken from the first differences set and the second one taken from the subsequent differences set, the pairs of values, so that the absolute value of their difference is minimum among all said pairs(‘

minimal pairs’

);

(f) determining, for all said minimal pairs, c as being

the integral part of the sum of the lowest one of the pair of determined difference values (MIN(A+a−

A′

),(B+b−

B′

))) plus the absolute value of their difference multiplied by r,(r*ABS((A+a−

A′

)−

(B+b−

B′

))) r being a real number, if said integral part is positive and smaller than twice lsb_max;

zero if said integral part is negative;

lsb_max if said integral part is larger than twice lsb_max.

(g) determining, for all said minimal pairs, the error as being the absolute value of A+a−

A′

−

c+B+b−

B′

−

c;

(h) selecting, among all minimal pairs, a pair having the smallest error(‘

selected minimal pair’

);

(i) determining the weight of the most significant sub-fields of the new data of said first line to be displayed as being the element of the MSB table corresponding to the first element of the selected minimal pair;

(j) determining the weight of the most significant sub-fields of the new data of said other line to be displayed as being the element of the MSB table corresponding to the second element of the selected minimal pair;

(k) determining the weight of the least significant sub-fields of the new data for both said first and said other line to be displayed as being the value of c for the selected minimal pair.

7. A method as claimed in

claim 6

, characterized in that, prior to step c, a value error_max is computed, determined or set, error_max being half the weight of the lowest most significant sub-field, the values comprised between minus error_max and lsb_max+error_max being selected in the first corresponding table as a reduced first difference set, and the values between minus error_max and lsb_max+error_max being selected in the second corresponding table as a reduced second difference set, and in step e, among all pairs of values, the first one being taken from the reduced first differences set and the second one being taken from the reduced second differences set, the pairs of values, so that the absolute value of their difference is minimum among all said pairs (‘

minimal pairs’

).

8. A method as claimed in to

claim 6

, characterized in that r is given the value one half (r={fraction (1/2)}).

9. A method as claimed in to

claim 6

, characterized in that r is given the value of the sum of A plus a divided by the sum of A, a, B and b (r=(A+a)/(A+a+B+b)).

10. A method as claimed in to

claim 2

, comprising the steps of

taking the original luminance value data for the new luminance value data of a first line of a pair of lines;

extracting the weight of the least significant sub-fields of said value, said weight being ‘

LSB’

;

computing the weight of the most significant sub-fields for the new luminance value data of a second line of a pair of lines by subtracting LSB from the original data for said line, and by rounding obtained value to the nearest combination of most significant sub-fields value

taking the computed weight for the most significant sub-fields for the new luminance value data of said other line, and LSB for the least significant sub-fields.

11. A method as claimed in to

claim 10

, characterized in that said first line of a pair of lines is selected as the line with the smallest least significant sub-fields weight.

12. A method as claimed in to

claim 10

or

11

, where the sub-fields have weights proportional to successive powers of two, wherein

extracting the weight of the least significant sub-fields is performed by masking the most significant bits;

13. A method as claimed in to

claim 10

or

11

, characterized in that

a set of most and least significant sub-fields representing the luminance value of said first line is determined;

said least significant sub-fields is used as entry, with the original luminance value for said second line, in a precalculated look-up table for giving the new luminance value for said second line.

14. A method as claimed in to

claim 10

or

11

, characterized in that

a set of most and least significant sub-fields representing the luminance value of said first line is determined;

the resulting luminance value level corresponding to said least significant sub-fields is computed;

the difference between the original luminance value for said second line and said resulting luminance value is computed;

said difference is used as entry in a precalculated look-up table for giving the new most significant sub-fields for said second line.

16. A display device as claimed in

claim 15

, characterized in that the display device comprises a computing unit (3) for performing a method as claimed in any of

claims 1

to

14

.

15. A matrix display device (1) comprising a receiving circuit (2) for receiving luminance data comprising original luminance value data of pixels, the matrix display device (1) further comprising a display panel (5) comprising a set of lines r₁ . . . r_M, and a driver circuit (4) for supplying line luminance value data to said lines, said lines being grouped in sets of neighbouring or adjacent lines, wherein a common value for the least significant sub-fields is addressed simultaneously to a set of lines

characterized in that

the matrix display device (1) comprises a computing unit (3) for computing new line luminance values C of pixels on the basis of the original line luminance values, a new common value for the least significant sub-fields of said set of neighbouring or adjacent lines being computed and addressed simultaneously to said set of lines, and new values for the most significant sub-fields of each line of said set of neighbouring or adjacent lines being computed and addressed to each line of said set.