An approach to an arithmetic analog of Berlekamp's algorithm (Corresp.)
D. Mandelbaum · IEEE Transactions on Information Theory · 1984
The Berlekamp algorithm used for generating convergents (polynomial fractions) to a polynomial sequence is altered for use with binary numbers. This provides an alternative to continued fraction generation of convergents, and the proposed algorithm uses no division. However optimality has not been proved unlike the case for the Berlekamp algorithm with polynomial sequences.