By Topic

An approach to an arithmetic analog of Berlekamp's algorithm (Corresp.)

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)

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.

Published in:

Information Theory, IEEE Transactions on  (Volume:30 ,  Issue: 5 )