On the continued fraction and Berlekamp's algorithm (Corresp.)
Unjeng Cheng · IEEE Transactions on Information Theory · 1984
Continued fraction techniques are equivalent to Berlekamp's algorithm. The sequenceD(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 whenD(K) < k + 1/2; and whenD(k) eq D(k + 1), it implies that Berlekamp's algorithm begins the next iterative step of the continued fraction.