Logarithmic complexity implementation for leading zeros detector

A logarithmic complexity implementation for the leading zeros detector is presented. The relation between the leading zeros detection result and the input string to be detected is analyzed, and then the logarithmic complexity algorithm is inferred, which takes the advantage of both speed and area. The complexities of the algorithm in terms of time and hardware are given. The experimental results of several concrete schemes based on the logarithmic complexity algorithm are also discussed.