An efficient algorithm to compute Allan variance from spectral density

Abstract

An efficient algorithm is presented for conversion of spectral density, the measure of signal purity commonly used in the design process, to another popular measure, Allan variance. Curves are presented that show the relationship between parameters controlling the degree of approximation and the resulting inaccuracy. A flow chart of the algorithm is given. Execution times for a sample problem are compared with times using simpler algorithms.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">&gt;</ETX>