DocumentCode :
939365
Title :
An approach to an arithmetic analog of Berlekamp´s algorithm (Corresp.)
Author :
Mandelbaum, David M.
Volume :
30
Issue :
5
fYear :
1984
fDate :
9/1/1984 12:00:00 AM
Firstpage :
758
Lastpage :
762
Abstract :
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.
Keywords :
Polynomials; Residue coding; Sequences; Arithmetic; Detectors; Iterative algorithms; Iterative decoding; Iterative methods; Polynomials; Relays;
fLanguage :
English
Journal_Title :
Information Theory, IEEE Transactions on
Publisher :
ieee
ISSN :
0018-9448
Type :
jour
DOI :
10.1109/TIT.1984.1056960
Filename :
1056960
Link To Document :
بازگشت