On the continued fraction and Berlekamp's algorithm

Continued fraction techniques are equivalent to Berlekamp's algorithm. The sequence D(k), k \geq 0 , in Berlekamp's algorithm provides the information about when Berlekamp's algorithm completes one iterative step of the continued fraction. In fact, this happens when D(K) ; and when D(k) \neq D(k + 1) , it implies that Berlekamp's algorithm begins the next iterative step of the continued fraction.