Abstract:
A clock and phase detect algorithm detects the best sample result for back-end system to recover the sample clock from front-end system. The algorithm of the present invention gets the sample result from ADC by applying slope variation sum (SPVS), which is used in turning points of sample result. The exact sample clock will always get the maximum SPVS value no matter how special or difficult the pattern is. It can detect not only most of normal patterns, but also the special patterns like block, linear piece pattern. The use of SPVS result allows back-end systems to distinguish which clock is the exact clock to sample the analog signal, and make the back-end convert quality is almost the same as the front-end. This function can be operated by system maker and maintain the quality of display automatically, no manual operation is need.

Description:
CROSS-REFERENCE TO RELATED APPLICATION  
       [0001]    This application claims the priority benefit of U.S. provisional application titled “PHASE DETECT ALGORITHM USING FIRST ORDER SLOPE FOR CLOCK RE-GENERATION” filed on Apr. 1, 2002, serial No. 60/369,527. 
     
    
     
       BACKGROUND OF THE INVENTION  
         [0002]    1. Field of the Invention  
           [0003]    The present invention generally relates to signals processing technology in the application of display systems. More particular, the present invention relates to an apparatus and method of clock recovery for sampling analog signals provided to an analog-to-digital converter (ADC).  
           [0004]    2. Description of Related Art  
           [0005]    Digital image processing is the most popular method used in display system. However, the drawback of digital signal processing is the use of high bit counts while digital signals are transmitted between different systems. In addition, a great deal of bandwidth and processing power are required for data transfer therebetween. Therefore, the use of analog signals is the prime solution in the application of data transmission between different system interfaces. For example, eight data lines are required for the transmission of a 8-bit digital pixel signal of 256 colors, while one data line provided for the transmission of analog signal is sufficient. Accordingly, the digital-to-analog converter (DAC) and the analog-to-digital converter (ADC) have become the most important components for connecting two digital systems. For example, digital pixel data are generated by a graphics chip and converted by the DAC into the associated analog pixel signals in a computer. The analog pixel signals are transmitted, through a cable, to the ADC of a back-end digital display device. The ADC receives the analog pixel signals and converts them into the associated digital pixel signals for image display. In other words, the ADC is used to generate the digital pixel signals corresponding to the digital pixel data.  
           [0006]    The analog pixel signals coming from a graphics system, such as a personal computer (PC), are generated in synchronization with an internal clock thereof. Therefore, it is required to provide a sample clock with substantially the same frequency as that of the internal clock for analog signal processing at the back-end display device. The quality of the image to be displayed on the back-end display is heavily relied upon whether the analog pixel signals are in synchronization with the sample clock.  
           [0007]    However, in the personal computer, no such sample clock will be so provided that the sample clock should be recovered from a reference signal, such as a horizontal synchronization signal, hereinafter Hsync. The Hsync signal is provided with a time period which is Htt times the pixel clock period, wherein Htt designates the horizontal total pixel counts for each line. Accordingly, the recovered clock should have a frequency of (Hsync frequency)×(Htt). However, Htt usually varies with different display modes or even different graphic chips while performing at the same display mode. Therefore, mode detection is needed to assist the display device to estimate the value of Htt. Conventionally, the mode detection uses a clock with a fixed frequency to count the Hsync signal and to generate a count value. The count value can be employed to look up the VESA (Video Electronic Standards Association) standard table so as to obtain the possible display mode (XGA, SVGA, etc.). But the conventional method cannot calculate the exact Htt because the clock with the fixed frequency is unrelated to the sample clock used by the back-end display device.  
           [0008]    In addition, phase detection algorithm can be used for sample clock recovery devicey by means of generating an estimated value of Htt and then using the estimated value to approach the exact one. A sum of Σ|pixel(n)−pixel(n+1)| is a simple way to implement the phase detection algorithm. However, the pixel difference method is useful for most kinds of patterns, but unfavorable for special patterns like block pattern, linear piece pattern, or the like. Moreover, the use of Σ|pixel(n)−pixel(n+1)| cannot identify incorrect maxima and slope change.  
         SUMMARY OF THE INVENTION  
         [0009]    The present invention is a first-order-slope phase detect algorithm for deducting the exact clock and phase. Analog signal is basically a wave in the time domain, therefore the clock and phase problem can be solved in the mathematical way. For any curve f(x), the derivative of the curve f(x) in respect to time is f′(x), and f′(x)=0 represents a local minimum or maximum. The local minima or maxima in the curve must be some of the correct sample points. The phase detect algorithm of the present invention is used to find the local minimum or maximum points. We induce a slope polarity variation sum SPVS to indicate whether all local minimum and maximum points are actual parts of the sample points when a clock and phase is applied. The result of correct sample clock will sample all local minimum and maximum points that have maximum SPVS result because of curve transition f′(x)=0. As a result, the SPVS value can accurately find the correct sample clock for an ADC. If all local minimum and maximum points are in the sets of sample points, the total sum of SPVS will be the maximum. Also, the concept of turning points, where the slope of the line changes from either positive or negative to zero, is introduced and applied to enhance the method of the present invention for special linear piece patterns to make sure that no false result will be induced during processing the SPVS. The present invention can detect all kinds of patterns includes the special pattern likes block, linear piece, and so on.  
           [0010]    It is to be understood that both the foregoing general description and the following detailed description are exemplary, and are intended to provide further explanation of the invention as claimed. 
       
    
    
     BRIEF DESCRIPTIOIN OF THE DRAWINGS  
       [0011]    The accompanying drawings are included to provide a further understanding of the invention, and are incorporated in and constitute a part of this specification. The drawings illustrate embodiments of the invention and, together with the description, serve to explain the principles of the invention. In the drawings,  
         [0012]    [0012]FIG. 1 is a schematic diagram of a computer display system according to a preferred embodiment of the present invention;  
         [0013]    [0013]FIG. 2 is a detail block diagram of sample clock recovery device according to a preferred embodiment of the present invention;  
         [0014]    [0014]FIG. 3 is an analog pixel signal having a block pattern;  
         [0015]    [0015]FIG. 4 is a curve by sampling the analog pixel signal of FIG. 3 according to a sample clock C;  
         [0016]    [0016]FIG. 5 is a curve by sampling the analog pixel signal of FIG. 3 according to a sample clock W;  
         [0017]    [0017]FIG. 6 is an analog pixel signal having a linear piece pattern;  
         [0018]    [0018]FIG. 7 is a drawing for explaining the concept of present invention; and  
         [0019]    [0019]FIG. 8 is the flow chart according to one preferred embodiment of the present invention. 
     
    
     DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS  
       [0020]    [0020]FIG. 1 shows a computer display system. A computer graphic card  100  generates Hsync, Vsync and pixel signals according to a source clock. A digital-to-analog converter (DAC)  102  is employed to convert digital pixels data into analog pixel signals. A digital display device  101  receives Hsync, Vsync, and the analog pixel signals through a cable connected to the computer graphic card  100 . A mode detector  103  uses a clock having a fixed frequency to count the Hsync and Vsync signals so as to obtain a total horizontal pixel number Htt and a total vertical line number Vtt. By referring to the VESA standard table, a rough Htt  106  along with a display mode can be therefore generated in accordance with the counted Htt. The rough Htt  106  is fed to the sample clock recovery device  104  to generate a reference clock signal  107  to an ADC  105  for sampling the analog pixel signals. The digital output of the ADC  105  is then fed into sample clock recovery device  104  to determine whether the sample data  108  are correct or not. If the sample data  108  are incorrect, the sample clock recovery device  104  adjusts the period and phase of the clock signal  107  to sample the analog pixel signals again. Such feedback processing continues again until the sample data are correct.  
         [0021]    [0021]FIG. 2 is a detailed block diagram of the sample clock recovery device  104 . As shown in FIG. 2, the sample clock recovery device  104  has a phase-locked loop (PLL)  201 , an indicator  202 , and a control  203 . The phase-locked loop  201  is used to lock the Hsync signal with a frequency of FIN and generate the clock signal  107  with a frequency of FOUT by the ratio FOUT=FIN×M/N, wherein M and N are integers. The indicator  202  is used to determine, responsive to the sample data  108 , whether the sample data  108  are prefect and to issue a detection result  204 , accordingly. If the the sample data  108  is detected by the indicator  202  to be incorrect, the detection result  204  associated therewith is transmitted and sent to the control  203  so as to generate new values of M′ and N′ via an output line  205 . The phase-locked loop  201  receives the M′ and N′, and regenerates the clock signal  107  with another frequency FOUT′ of (FIN×M′/N′), accordingly. The clock signal  107  with FOUT′ is thereafter provide for the ADC  105  to sample the analog pixel signals again. As mentioned above, the regeneration/re-sampling feedback processing continues until the sample data  108  are determined to be correct.  
         [0022]    [0022]FIG. 3 depicts the analog pixel signal having a block pattern  300 . The block pattern may occur while two or more pixels are provided with the same level. When two different sample clocks C and W are applied to the block pattern  300 , as referring to in FIGS. 4 and 5, the sample data are described as follows:  
         [0023]    Sample clock C: C_ 1 =0, C_ 2 =60, C_ 3 =60, and C_ 4 =0  
         [0024]    Sample clock W: W_ 1 =0, W_ 2 =30, W_ 3 =60, W_ 4 =30, and W_ 5 =0  
         [0025]    [0025]FIG. 4 shows a fitting curve  400  by sampling the block pattern  300  in accordance with the sample clock C. Thus, the result by using the conventional pixel difference method=|C_ 1 −C_ 2 |+|C_ 2 −C_ 3 |+|C_ 3 −C_ 4 |=60+0+60=120. FIG.  5  shows a fitting curve  500  by sampling the block pattern  300  in accordance with the sample clock W. The result by using the conventional pixel difference method=|W_ 1 −W_ 2 |+|W_ 2 −W_ 3 |+|W_ 3 −W_ 4 |+|W_ 4 −W_ 5 |=30+30+30+30=120. As shown in FIGS. 4 and 5, even though the curve  400  should be better than the curve  500 , the conventional pixel difference method cannot differentiate between them.  
         [0026]    [0026]FIG. 6 shows the analog pixel signal having a linear piece pattern  600 . For the same reason, the conventional pixel difference method cannot differentiate the sample clock provided with better sample data from another sample clock with worse sample data, while both are applied to the linear piece pattern  600 .  
         [0027]    According to the present invention, a slope-change approach is employed. For a continuous curve f(x), the slope f′(x) is defined to be a “limit point” indicator. If f′(x)=0, x represents a local minimum or maximum point which is designated to be a limit point). The limit point has a slope polarity changing from “positive” to “negative,” or from “negative” to “positive”. By taking the linear piece pattern  600  of FIG. 6 as an example, the slope polarity at the sample point B, C, D, G, H, or I is changed from “positive” to “positive, or from “negative” to “negative”. Owing to occurrence of the limit point, the slope polarity at the sample point A, E, F, or J is changed from “zero” to “positive”, from “positive” to zero, from “zero” to “negative,” or from “negative” to “zero”. The point A, E, F, or J is defined to be “a turning point” in accordance with the present invention. The turning points are characterized in that those points are provided with slope polarity change. The more the sample point closes to the turning point, the more the slope polarity changes.  
         [0028]    [0028]FIG. 7 shows a drawing for explaining the concept of present invention. According to the present invention, if the sample points located at the turning points the maximum slope-polarity-variation-sum (SPVS) can be obtained as compared to those far away from the turning points. The curve  700  is an analog signal, the curve  701  is the one that the sample points hit the turning points, and the curve  702  is the one that the sample points miss the turning points. The SPVS of the curve  701  is greater than that of the curve  702 . Accordingly, the value of SPVS is employed to generate the optimum sample clock.  
         [0029]    [0029]FIG. 8 shows the flow chart of the SPVS method in accordance with one preferred embodiment of the present invention. The SPVS method of the present invention will be described step-by-step as follows:  
         [0030]    (1) Step  801 : Initially, SPVS is reset to be zero. Based on the estimated Htt  106  generated by the mode detector  103 , a set of the candidate clock signals is fed to the ADC  105 . The sample data in response to different candidate clock signals are generated by the ADC  105 .  
         [0031]    (2) Step  802 : F′(n + )=F(n+1)−F(n) and F′(n − )=F(n)−F(n−1) are defined and calculated for a sample point n, wherein F(n−1), F(n), and F(n+1) represent the sample data.  
         [0032]    (3) Step  803 : If F′(n + ) and F′(n − ) has no polarity change, that is, from “positive” F′(n − ) to “positive” F′(n + ) or from “negative F′(n − ) to negative F′(n + ),” F(n) is determined not to be a turning point. After n is incremented by one, the flow goes back to Step  802 . Otherwise, if the polarities of F′(n − ) and F′(n + ) are changed from “positive” to “negative,” from “positive” to zero, from zero to “positive,” from “negative” to “positive,” from “negative” to zero, or from zero to “negative,” the flow goes to Step  804 . Where n=discrete sample points  
         [0033]    n + =X&gt;n X≈n  
         [0034]    n − =X&lt;n X≈n  
         [0035]    (4) Step  804 : the SPVS is accumulated according to Equation (1):  
         SPVS=SPVS+|F′(n + )−F(n − )|=|F(n+1)+F(n−1)−2F(n)|  (1)  
         [0036]    (5) Step  805 : By following Step  804 , the flow goes to Step  805  to check whether all sample points has been done. If no, the flow goes back to Step  802  after n is incremented by one. If yes, the flow goes to Step  806 .  
         [0037]    (6) Step  806 : By comparing the SPVS values, the sample clock having the maximum SPVS is selected for sampling the analog pixel signals.  
         [0038]    If the SPVS method of the present invention is applied to the block pattern of FIG. 3,  
         [0039]    Clock C: C_ 1 =0, C_ 2 =60, C_ 3 =60, C_ 4 =0;  
         [0040]    Clock W: W_ 1 =0, W_ 2 =30, W_ 3 =60,W_ 4 =30, W_ 5 =0.  
         [0041]    For clock C:  
         [0042]    Turning points: C_ 1 , C_ 2 , C_ 3 , and C_ 4   
             SPVS   =                F   ′          (     C_        1   +       )       -       F   ′          (     C_        1   -       )              +              F   ′          (     C_        2   +       )       -       F   ′          (     C_        2   -       )              +              F   ′          (     C_        3   +       )       -       F   ′          (     C_        3   +       )       -       F   ′          (     C_        3   -       )              +     
                              F   ′          (     C_        4   +       )       -       F   ′          (     C_        4   -       )                            =              C_      0     +     C_      2     -     2      C_      1            +            C_      1     +     C_      3     -     2      C_      2            +            C_      2     +     C_      4     -     2      C_      3            +            C_      3     +     C_      5     -     2      C_      4                          =     60   +   60   +   60   +   60                 =   240                               
 
         [0043]    For clock W:  
         [0044]    Turning points: W_ 1 , W_ 3 , W_ 5   
             SPVS   =                F   ′          (     W_        1   +       )       -       F   ′          (     W_        1   -       )              +              F   ′          (     W_        3   +       )       -       F   ′          (     W_        3   -       )              +              F   ′          (     W_        5   +       )       -       F   ′          (     W_        5   -       )                                =              W_      0     +     W_      2     -     2      W_      1            +            W_      2     +     W_      4     -     2      W_      3       )              +            W_      4     +     W_      6     -     2      W_      5                        =     30   +   60   +   30                 =   120                               
 
         [0045]    According to the SPVS method of the present invention, the sample clock C, but not the sample clock W, is selected to correctly sample the analog pixel signals due to its greater SPVS. The method of the present invention can accurately and easily calculate the correct sample clock for the ADC  105  whereby greatly enhancing image quality and sharpness.  
         [0046]    It will be apparent to those skilled in the art that various modifications and variations can be made to the structure of the present invention without departing from the scope or spirit of the invention. In view of the foregoing, it is intended that the present invention cover modifications and variations of this invention provided they fall within the scope of the following claims and their equivalents.