Method for generating a dynamic index

• US 8,284,217 B2
• Filed: 01/26/2007
• Issued: 10/09/2012
• Est. Priority Date: 01/27/2006
• Status: Active Grant

• Current Assignee: AU Optronics Corporation
• Original Assignee: AU Optronics Corporation
• Inventors: Chang, Wen-Chieh, Hsieh, Yao-Jen, Li, Huan-Hsin
• Primary Examiner(s): Wang, Quan-Zhen
• Assistant Examiner(s): Chow, Yuk
• Application Number:
  US11/698,123
• Publication Number:
  US 20070192389A1
• Time in Patent Office: 2,083 Days
• Field of Search: 345/418, 345/596, 345/599, 345/619, 345/644, 345/690, 345/694, 348/574, 358/3.13, 358/3.14, 358/3.19, 358/457, 708/250, 327/172, 341/131
• US Class Current: 345/690
• CPC Class Codes: G06F 7/582 Pseudo-random number generators

Abstract

Disclosure is a method for randomly and dynamically generating a dynamic index, incorporated in a dynamic index system to improve the color performance of a display, comprises: transmitting video data to the dynamic index system; dynamically generating a substantially random number by a pseudo-random number generating unit; selecting the m bits of the substantially random number as a target adapted to as a position code of the dynamic pattern index matrix; and generating the two-dimensional dynamic pattern index matrix (S×T) by operating the position code.

Claims

1. A method for randomly and dynamically generating a dynamic pattern index incorporated in a dynamic index system received video data and processed each sub-pixel datum of the video data by a pseudo-random number generating unit of the dynamic index system to alternately form dithering data of three dimensions of pixel, line, and frame, comprising:

transmitting the video data to the dynamic index system;

dynamically generating a substantially random number by the pseudo-random number generating unit;

selecting m bits of the substantially random number as at least one target adapted to as a position code of a dynamic pattern index matrix;

repeating the step of selecting the m bits of the substantially random number as at least one target adapted to as a position code of a dynamic pattern index matrix for M times so as to guide the acquired N sets of m bits as the position code of the dynamic pattern index matrix; and

generating the two-dimensional dynamic pattern index matrix (S×

T) according to the position code by operating of the pseudo-random number generating unit, wherein the pseudo-random number generating unit comprises a plurality of linear feedback shift registers, and the linear feedback shift registers receive the video data as an initial value of the linear feedback shift registers and the linear feedback shift registers produce the substantially random number by a way of the operation of XOR with the initial value.

2. The method according to claim 1, wherein the pseudo-random number generating unit processes each the sub-pixel datum of the video data to generate the substantially random number.

3. The method according to claim 1, wherein the substantially random number comprises N sets, each of the N sets has m bits, and one of the N sets is as the target.

4. The method according to claim 1, wherein the substantially random number comprises N sets, each of the N sets has m bits, and one of the N sets is as a guide to indicate an acquired set of the N sets as the target.

5. The method according to claim 1, wherein the position code of the dynamic pattern index matrix comprises a column vector position code (S×

1) of the dynamic pattern index matrix.

6. The method according to claim 5, wherein the column vector position code (S×

Nn), the value Nn is predetermined number that represents the n-th column as a target adapted position code within the dynamic pattern index matrix (S×

T), wherein the repeated step further includes wherein Nn=1˜

Nn+1.

7. The method according to claim 5, wherein the column vector position code (S×

Nn), the value Nn is predetermined number that represents the n-th column as a target adapted position code within the dynamic pattern index matrix (S×

T), wherein the column vector position code (S×

1) is a first column of the dynamic pattern index matrix (S×

T), the second column (S×

2) of the dynamic pattern index matrix (S×

T) is a one'"'"'s complement of the first column (S×

1), and the third column (S×

3) of the dynamic pattern index matrix (S×

T) is the second column (S×

(1+Kn)), wherein Kn is a positive integer, and the repeating step includes Kn being equal to the values n=1˜

(S−

1), S>

2.

8. The method according to claim 5, wherein the column vector position code (S×

Nn), the value Nn is predetermined number that represents the n-th column as a target adapted position code within the dynamic pattern index matrix (S×

T), wherein the column vector position code (S×

(1+Kn)) is a first column of the dynamic pattern index matrix (S×

T), the second column (S×

2) of the dynamic pattern index matrix (S×

T) is a one'"'"'s complement of the first column (S×

(1+Kn)), and the third column (S×

3) of the dynamic pattern index matrix (S×

T) is the second column (S×

(2+Kn)), wherein Kn is a positive integer, and the repeating step includes Kn being equal to the values n=1˜

S.

9. The method according to claim 1, wherein the position code of the dynamic pattern index matrix comprises a row vector position code (1×

T) of the dynamic pattern index matrix.

10. The method according to claim 9, wherein the row vector position code (Nn×

T), the value Nn is predetermined number that represents the n-th row as a target adapted position code within the dynamic pattern index matrix (S×

T), wherein the repeated step further includes wherein Nn=1˜

Nn+1.

11. The method according to claim 9, wherein the row vector position code (T×

Nn), the value Nn is predetermined number that represents the n-th row as a target adapted position code within the dynamic pattern index matrix (S×

T), wherein the row vector position code (1×

T) is a first row of the dynamic pattern index matrix (S×

T), the second row (2×

T) of the dynamic pattern index matrix (S×

T) is a one'"'"'s complement of the first row (1×

T), and the third row (3×

T) of the dynamic pattern index matrix (S×

T) is the second row ((1+Kn)×

T), wherein Kn is a positive integer, and the repeating step includes Kn being equal to the values n=1˜

(S−

1), S>

2.

12. The method according to claim 9, wherein the row vector position code (T×

Nn), the value Nn is predetermined number that represents the n-th row as a target adapted position code within the dynamic pattern index matrix (S×

T), wherein the row vector position code ((1+Kn)×

T)is a first row of the dynamic pattern index matrix (S×

T), the second row (2×

T) of the dynamic pattern index matrix (S×

T) is a one'"'"'s complement of the first row ((1+Kn)×

T), and the third row (3×

T) of the dynamic pattern index matrix (S×

T) is the second row ((2+Kn)×

T), wherein Kn is a positive integer, and the repeating step includes Kn being equal to the values n=1˜

S.

13. The method according to claim 1, wherein the column number S of the dynamic pattern index matrix (S×

T) is equal to the row number T of the dynamic pattern index matrix (S×

T).

14. A method for randomly and dynamically generating a dynamic pattern index incorporated in a dynamic index system received video data and processed each sub-pixel datum of the video data by a pseudo-random number generating unit of the dynamic index system to alternately form dithering data of three dimensions of pixel, line, and frame, comprising:

transmitting the video data to the dynamic index system;

dynamically generating a substantially random number by the pseudo-random number generating unit;

selecting m bits of the substantially random number as a target adapted to as a position code (1,1) of a dynamic pattern index matrix;

generating a vector position code of the dynamic pattern index matrix by the position code (1,1); and

generating the two-dimensional dynamic pattern index matrix (S×

T) by operating the vector position code, wherein the pseudo-random number generating unit comprises a plurality of linear feedback shift registers, and the linear feedback shift registers receive the video data as an initial value of the linear feedback shift registers and the linear feedback shift registers produce the substantially random number by a way of the operation of XOR with the initial value.

15. The method according to claim 14, wherein the pseudo-random number generating unit processes each the sub-pixel datum of the video data to generate the substantially random number.

16. The method according to claim 14, wherein the substantially random number comprises N sets, each of the N sets has m bits, and one of the N sets is as the target.

17. The method according to claim 14, wherein the substantially random number comprises N sets, each of the N sets has m bits, and one of the N sets is as a guide to indicate an acquired set of the N sets as the target.

18. The method according to claim 14, wherein the column vector position code (S×

Nn), the value Nn is predetermined number that represents the n-th column as a target adapted position code position code (1,1), wherein the column vector position code (S×

1) is a first column of the position code (1,1), the second column (S×

2) of the dynamic pattern index matrix (S×

T) is a one'"'"'s complement of the first column (S×

1), and the third column (S×

3) of the dynamic pattern index matrix (S×

T) is the second column (S×

(1+Kn)), wherein Kn is a positive integer, and the repeating step includes Kn being equal to the values n=1˜

(S−

1), S>

2.

19. The method according to claim 18, wherein the column vector position code (S×

Nn), the value Nn is predetermined number that represents the n-th column as a target adapted position code within the dynamic pattern index matrix (S×

T), wherein the repeated step further includes wherein Nn=1˜

Nn+1.

20. The method according to claim 19 wherein the column vector position code (S×

Nn), the value Nn is predetermined number that represents the n-th column as a target adapted position code within the dynamic pattern index matrix (S×

T), wherein the column vector position code (S×

1) is a first column of the dynamic pattern index matrix (S×

T), the second column (S×

2) of the dynamic pattern index matrix (S×

T) is a one'"'"'s complement of the first column (S×

1), and the third column (S×

3) of the dynamic pattern index matrix (S×

T) is the second column (S×

(1+Kn)), wherein Kn is a positive integer, and the repeating step includes Kn being equal to the values n=1˜

(S−

1), S>

2.

21. The method according to claim 19, wherein the column vector position code (S×

Nn), the value Nn is predetermined number that represents the n-th column as a target adapted position code within the dynamic pattern index matrix (S×

T), wherein the column vector position code (S×

(1+Kn)) is a first column of the dynamic pattern index matrix (S×

T), the second column (S×

2) of the dynamic pattern index matrix (S×

T) is a one'"'"'s complement of the first column (S×

(1+Kn)), and the third column (S×

3) of the dynamic pattern index matrix (S×

T) is the second column (S×

(2+Kn)), wherein Kn is a positive integer, and the repeating step includes Kn being equal to the values n=1˜

S.

22. The method according to claim 14, wherein the row vector position code (T×

Nn), the value Nn is predetermined number that represents the n-th row as a target adapted position code (1,1), wherein the row vector position code (1×

T) is a first row of the dynamic pattern index matrix (S×

T) the second of the position code (1,1) is a one'"'"'s complement of the first row (1×

T), and the third row (3×

T) of the dynamic pattern index matrix (S×

T) is the second row ((1+Kn)×

T), wherein Kn is a positive integer, and the repeating step includes Kn being equal to the values n=1˜

(S−

1), S>

2.

23. The method according to claim 22, wherein the row vector position code (Nn×

T), the value Nn is predetermined number that represents the n-th row as a target adapted position code within the dynamic pattern index matrix (S×

T), wherein the repeated step further includes wherein Nn=1˜

Nn+1.

24. The method according to claim 22, wherein the row vector position code (T×

Nn), the value Nn is predetermined number that represents the n-th row as a target adapted position code within the dynamic pattern index matrix (S×

T), wherein the row vector position code (1×

T) is a first row of the dynamic pattern index matrix (S×

T), the second row (2×

T) of the dynamic pattern index matrix (S×

T) is a one'"'"'s complement of the first row (1×

T), and the third row (3×

T) of the dynamic pattern index matrix (S×

T) is the second row ((1+Kn)×

T), wherein Kn is a positive integer, and the repeating step includes Kn being equal to the values n=1˜

(S−

1), S>

2.

25. The method according to claim 22, wherein the row vector position code (T×

Nn), the value Nn is predetermined number that represents the n-th row as a target adapted position code within the dynamic pattern index matrix (S×

T), wherein the row vector position code ((1+Kn)×

T)is a first row of the dynamic pattern index matrix (S×

T), the second row (2×

T) of the dynamic pattern index matrix (S×

T) is a one'"'"'s complement of the first row ((1+Kn)×

T), and the third row (3×

T) of the dynamic pattern index matrix (S×

T) is the second row ((2+Kn)×

T), wherein Kn is a positive integer, and the repeating step includes Kn being equal to the values n=1˜

S.

26. The method according to claim 14, wherein the vector position code comprises an orthogonal permuting, so that none of two the targets are identical.

27. A method for randomly and dynamically generating a dynamic pattern index incorporated in a dynamic index system received video data and processed each sub-pixel datum of the video data by a pseudo-random number generating unit of the dynamic index system to alternately form dithering data of three dimensions of pixel, line, and frame, comprising:

transmitting the video data to the dynamic index system;

dynamically generating a substantially random number by the pseudo-random number generating unit;

selecting m bits of the substantially random number as at least one target adapted to as a position code of a dynamic pattern index matrix, wherein the order of the lowest bit to the highest bit of the m bits of the random number are B_x, x=1˜

m, wherein a B₁ is as a first number bit, a B₂ is as a second number bit, a B₃ is as a third number bit, a B₁₀ is as a tenth number bit, a B<sub>m−

1</sub> is as a second to the last number bit and a B_m is as a last number bit;

repeating the step of selecting the m bits of the substantially random number as at least one target adapted to as a position code of a dynamic pattern index matrix for M times so as to guide the acquired N sets of m bits as the position code of the dynamic pattern index matrix; and

generating the two-dimensional dynamic pattern index matrix (S×

T) according to the position code by operating of the pseudo-random number generating unit, wherein the pseudo-random number generating unit comprises a plurality of linear feedback shift registers, and the steps of producing the substantially random number including receiving the video data as an initial value;

producing a new first number bit of the substantially random number by XOR the third number bit of the initial value and the tenth number bit of the initial value in a way of performing the operation of XOR;

setting the first number bit to be a new second number bit, the second number bit to be a new third number bit, and the second- last number bit to be a new last number bit so the substantially random numbers is generated; and

a next substantially random numbers is generated repeatedly by repeating the steps of producing a next first number bit by XOR the third number bit of a former substantially random numbers and the tenth number bit of a former substantially random numbers; and

setting the former first number bit to be a next second number bit, a former second number bit to be a next third number bit, and a former second to the last number bit to be a next last number bit.

28. A method for randomly and dynamically generating a dynamic pattern index incorporated in a dynamic index system received video data and processed each sub-pixel datum of the video data by a pseudo-random number generating unit of the dynamic index system to alternately form dithering data of three dimensions of pixel, line, and frame, comprising:

transmitting the video data to the dynamic index system;

dynamically generating a substantially random number by the pseudo-random number generating unit;

selecting m bits of the substantially random number as a target adapted to as a position code (1,1) of a dynamic pattern index matrix, wherein the order of the lowest bit to the highest bit of the m bits of the random number are B_x, x=1˜

m, wherein a B₁ is as a first number bit, a B₂ is as a second number bit, a B₃ is as a third number bit, a B₁₀ is as a tenth number bit, a B<sub>m−

1</sub> is as a second to the last number bit and a B_m is as a last number bit;

generating a vector position code of the dynamic pattern index matrix by the position code (1,1); and

generating the two-dimensional dynamic pattern index matrix (S×

T) by operating the vector position code, wherein the pseudo-random number generating unit comprises a plurality of linear feedback shift registers, and the steps of producing the substantially random number including receiving the video data as an initial value;

producing a new first number bit of the substantially random number by XOR the third number bit of the initial value and the tenth number bit of the initial value in a way of performing the operation of XOR;

setting the first number bit to be a new second number bit, the second number bit to be a new third number bit, and the second to the last number bit to be a new last number bit so the substantially random numbers is generated; and

a next substantially random numbers is generated repeatedly by repeating the steps of producing a next first number bit by XOR the third number bit of a former substantially random numbers and the tenth number bit of a former substantially random numbers; and

setting the former first number bit to be a next second number bit, a former second number bit to be a next third number bit, and a former second to the last number bit to be a next last number bit.