Method for generating a dynamic index

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 (M×N) by operating the position code.

Description

BRIEF DESCRIPTION OF THE DRAWINGS

The features, objects, and advantages of the present invention will become more apparent from the following detailed description of the preferred embodiment of this invention, with reference to the accompanying drawings, in which:

FIG. 1A is a schematic view of a convectional serial dithering system;

FIG. 1B is a schematic view of a convectional pattern index system;

FIG. 2A illustrates a schematic view of an embodiment of a serial dithering system of the present invention;

FIG. 2B illustrates a schematic view of an embodiment of a dynamic index system of the present invention;

FIG. 3A illustrates a schematic view of a pseudo-random number generating unit and a dynamic pattern index generating unit of the present invention;

FIG. 3B illustrates a schematic view of a linear feedback shift register of the pseudo-random number generating unit of the present invention;

FIG. 4A is a schematic view of a first embodiment of M×1 position code of the present invention;

FIG. 4B is a schematic view of a second embodiment of M×1 position code of the present invention;

FIG. 4C shows a flow to generate a dynamic pattern index matrix by the position code of the present invention;

FIG. 5A shows a flow to generate a plurality of dynamic pattern index matrixes by one dynamic pattern index matrix of the present invention;

FIG. 5B illustrates a schematic view of a first embodiment of operating a fractal dynamic pattern index matrix of the present invention;

FIG. 5C illustrates a schematic view of a second embodiment of operating a fractal dynamic pattern index matrix of the present invention; and

FIG. 5D illustrates a schematic view of a third embodiment of operating a fractal dynamic pattern index matrix of the present invention.

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 M sets of m bits as the position code of the dynamic pattern index matrix; andgenerating the two-dimensional dynamic pattern index matrix (M×N) according to the position code by operating of the pseudo-random number generating unit.

2. The method according to claim 1, wherein the pseudo-random number generating unit comprises a plurality of linear feedback shift registers, which 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 (M×1) of the dynamic pattern index matrix.

6. The method according to claim 5, wherein the two-dimensional dynamic pattern index matrix (M×N) comprises the column vector position code (M×1) plus a predetermined number of Nn*3 is as the nth column of the dynamic pattern index matrix (M×N), n is 1 to N.

7. The method according to claim 5, wherein the column vector position code (M×1) is as a first column of the dynamic pattern index matrix (M×N), a ones complement of the first column is as a second column, the second column plus a predetermined number K1 is as a third column, another ones complement of the third column is as a fourth column, a ones complement of the (2n−1)th column is as the (2n)th column, and then plus a predetermined value Kn is as the (2n+1)th column, n is 1 to ((N/2)−1).

8. The method according to claim 5, wherein the column vector position code (M×1) plus a predetermined number K1 is as a first column of the dynamic pattern index matrix (M×N), a ones complement of the first column is as a second column, the second column plus a predetermined number K3 is as a third column, another ones complement of the third column is as a fourth column, so that the first column is the position code plus a predetermined number K, ones complement of the (2n−1)th is as the (2n)th column, and then plus a predetermined value K2n−1 is as the (2n+1)th column, n is 1 to (N/2).

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

10. The method according to claim 9, wherein the two-dimensional dynamic pattern index matrix (M×N) comprises the row vector position code (1×N) plus a predetermined number of Nn*3 is as the nth column of the dynamic pattern index matrix (M×N), n is 1 to N.

11. The method according to claim 9, wherein the row vector position code (1×N) is as a first row of the dynamic pattern index matrix (M×N), a ones complement of the first row is as a second row, the second row plus a predetermined number K1 is as a third row, another ones complement of the third row is as a fourth row, a ones complement of the (2n−1)th row is as the (2n)th row, and then plus a predetermined value Kn is as the (2n+1)th row, n is 1 to ((N/2)−1).

12. The method according to claim 9, wherein the row vector position code (M×1) plus a predetermined number K1 is as a first row of the dynamic pattern index matrix (M×N), a ones complement of the first row is as a second row, the second row plus a predetermined number K3 is as a third row, another ones complement of the third row is as a fourth row, so that the first row is the position code plus a predetermined number K, ones complement of the (2n−1)th is as the (2n)th row, and then plus a predetermined value K2−1 is as the (2n+1)th row, n is 1 to (N/2).

13. The method according to claim 1, wherein the column number M of the dynamic pattern index matrix (M×N) is equal to the row number N of the dynamic pattern index matrix (M×N).

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); andgenerating the two-dimensional dynamic pattern index matrix (M×N) by operating the vector position code.

15. The method according to claim 14, wherein the pseudo-random number generating unit comprises a plurality of linear feedback shift registers, which 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 vector position code comprises a column vector position code, which the target is as the position code (1,1) to generate the column vector position code comprises a ones complement of the position code (1,1) is as the position code (2,1), the position code (2,1) plus a predetermined value is as the position code (3,1), ones complement of the position code (2n−1,1) is as the position code (2n,1), and then plus a predetermined value Kn is as the position code (2n+1,1), n is 1 to (N/2).

19. The method according to claim 14, wherein the two-dimensional dynamic pattern index matrix (M×N) comprises the column vector position code plus a predetermined number of Nn*3 is as the nth column of the dynamic pattern index matrix (M×N), n is 1 to N.

20. The method according to claim 19, wherein the column vector position code is as a first column of the dynamic pattern index matrix (M×N), a ones complement of the first column is as a second column, the second column plus a predetermined number K1 is as a third column, another ones complement of the third column is as a fourth column, a ones complement of the (2n−1)th column is as the (2n)th column, and then plus a predetermined value Kn is as the (2n+1)th column, n is 1 to ((N/2)−1).

21. The method according to claim 19, wherein the column vector position code plus a predetermined number K1 is as a first column of the dynamic pattern index matrix (M×N), a ones complement of the first column is as a second column, the second column plus a predetermined number K3 is as a third column, another ones complement of the third column is as a fourth column, so that the first column is the position code plus a predetermined number K, ones complement of the (2n−1)th is as the (2n)th column, and then plus a predetermined value K2−1 is as the (2n+1)th column, n is 1 to (N/2).

22. The method according to claim 14, wherein the vector position code comprises a row vector position code, which the target is as the position code (1,1) to generate the row vector position code comprises a ones complement of the position code (1,1) is as the position code (1,2), the position code (1,2) plus a predetermined value is as the position code (1,3), ones complement of the position code (1,2n−1) is as the position code (1,2n), and then plus a predetermined value Kn is as the position code (1,2n+1), n is 1 to (N/2).

23. The method according to claim 22, wherein two-dimensional dynamic pattern index matrix (M×N) comprises the row vector position code plus a predetermined number of Nn*3 is as the nth row of the dynamic pattern index matrix (M×N), n is 1 to N.

24. The method according to claim 22, wherein the row vector position code is as a first row of the dynamic pattern index matrix (M×N), a ones complement of the first row is as a second row, the second row plus a predetermined number K1 is as a third row, another ones complement of the third row is as a fourth row, a ones complement of the (2n−1)th row is as the (2n)th row, and then plus a predetermined value Kn is as the (2n+1)th row, n is 1 to ((N/2)−1).

25. The method according to claim 22, wherein the row vector position code plus a predetermined number K1 is as a first row of the dynamic pattern index matrix (M×N), a ones complement of the first row is as a second row, the second row plus a predetermined number K3 is as a third row, another ones complement of the third row is as a fourth row, so that the first row is the position code plus a predetermined number K1 ones complement of the (2n−1)th is as the (2n)th row, and then plus a predetermined value K2−1 is as the (2n+1)th row, n is 1 to (N/2).

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.