C Noise In Recursive Algorithms

Michael Andrews; Donald Merchant

doi:10.1117/12.938246

8 December 1978 C Noise In Recursive Algorithms

Michael Andrews, Donald Merchant

Proceedings Volume 0154, Real-Time Signal Processing I; (1978) https://doi.org/10.1117/12.938246
Event: 22nd Annual Technical Symposium, 1978, San Diego, United States

Abstract

A number of on-line signal processing algorithms are being proposed for digital image processing. Some of these require recursive iterations in the arithmetic computations. For example, 2-D recursive filters are being used to transform and/or filter digital images in microprocessors. Inherent to microprocessors is the extremely short wordlength (8-16 bits) and, as a result, arithmetic operations are no longer precise and "C" noise is evident. These machines are being further proposed for adaptive filtering operations which aggravates the truncation/rounding effects since computations are now nested and errors are no longer statistically independent. In this paper the effects of truncation/rounding are depicted in the above setting by simulation examples.

Citation Download Citation

Michael Andrews and Donald Merchant "C Noise In Recursive Algorithms", Proc. SPIE 0154, Real-Time Signal Processing I, (8 December 1978); https://doi.org/10.1117/12.938246

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