On-line arithmetic for recurrence problems

Milos D. Ercegovac

doi:10.1117/12.49827

1 December 1991 On-line arithmetic for recurrence problems

Milos D. Ercegovac

Proceedings Volume 1566, Advanced Signal Processing Algorithms, Architectures, and Implementations II; (1991) https://doi.org/10.1117/12.49827
Event: San Diego, '91, 1991, San Diego, CA, United States

Abstract

An arithmetic-level approach to increasing computation rate in solving recurrence problems is discussed. The approach, based on on-line arithmetic principles, is discussed in problems such as root finding and recursive filters. The main objective is to highlight the potential benefits and problems of the approach.

Citation Download Citation

Milos D. Ercegovac "On-line arithmetic for recurrence problems", Proc. SPIE 1566, Advanced Signal Processing Algorithms, Architectures, and Implementations II, (1 December 1991); https://doi.org/10.1117/12.49827

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available