By Topic

On the continued fraction and 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)

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) < k + 1/2 ; and when D(k) \neq D(k + 1) , it implies that Berlekamp's algorithm begins the next iterative step of the continued fraction.

Published in:

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