Skip Navigation

The Computer Journal 1982 25(2):231-234; doi:10.1093/comjnl/25.2.231
© 1982 by British Computer Society
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Blake, A.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Fixed Point Solutions of Recursive Operations on Boolean Arrays

A. Blake *

Machine Intelligence Research Unit, Hope Park Square, Meadow Lane, Edinburgh, UK

Parallel array processors hold great promise for fast image processing applications. This paper contains an analysis of the convergence of some recursive parallel array processes in boolean arrays. The analysis involves looking for a fixed point solution to the recursion relation and ensuring that the fixed point is indeed accessible. A condition for stability is found for one potentially unstable recursive operation. Implementation of the recursive processes on a CLIP4 parallel array processor is also discussed.

Received May 1981.

* Machine Intelligence Research Unit, Hope Park Square, Meadow Lane, Edinburgh EH8 9NW, UK


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.