DocumentCode :
1391551
Title :
Primitive cellular automata, threshold decomposition, and ranked order operations
Author :
Zarowski, Christopher J. ; McLeod, Robert D. ; Card, Howard C.
Author_Institution :
Dept. of Electr. Eng., Manitoba Univ., Winnipeg, Man., Canada
Volume :
38
Issue :
1
fYear :
1989
fDate :
1/1/1989 12:00:00 AM
Firstpage :
148
Lastpage :
149
Abstract :
A connection between ranked filters and primitive cellular automata is discussed. Primitive cellular automata are those whose nodes comprise a single bit of state information. It is shown that these structures can perform ranked order operations on one-dimensional k -level signals by virtue of threshold decomposition. Extensions to the case of multidimensional signals are also possible
Keywords :
filtering and prediction theory; filters; finite automata; 1D cellular automata; one-dimensional k-level signals; primitive cellular automata; ranked filters; ranked order operations; threshold decomposition; Application software; Bonding; Filters; Graph theory; Mathematics; Multidimensional systems; Nonhomogeneous media; Notice of Violation; Printed circuits; Routing;
fLanguage :
English
Journal_Title :
Computers, IEEE Transactions on
Publisher :
ieee
ISSN :
0018-9340
Type :
jour
DOI :
10.1109/12.8738
Filename :
8738
Link To Document :
بازگشت