🚀 go-pugleaf

In article <1992Aug5.103712.24039@ccsun.strath.ac.uk>, craa85@ccsun.strath.ac.uk writes:
|> Is there any known way of instantaneously identifying a bit stream (i.e. a 
|> very simple bit map of an image) using hardware techniques. The idea is
|> to avoid using processing power to identify the image.
|> 

If the pattern is fairly small and you are only concerned with an exact match, 
you could build a state machine and feed it one bit at a time.

If the pattern is more complex, you could store it in an eprom, and compare
it byte by byte to your new pattern.  This also would require a state machine
(counter) to control access to the eprom.

You could also do it using combinatorial logic.  A stack of eproms could be 
programmed to retreive a code for any pattern which is fed into its address space.
This solution should allow the identification of several bit patterns with
one circuit.

-- 
Larry D. Pyeatt                 The views expressed here are not
Internet : pyeatt@texaco.com    those of my employer or of anyone
Voice    : (713) 975-4056       that I know of with the possible
                                exception of myself.

In article <1992Aug5.103712.24039@ccsun.strath.ac.uk> craa85@ccsun.strath.ac.uk writes:
>Is there any known way of instantaneously identifying a bit stream (i.e. a 
>very simple bit map of an image) using hardware techniques. The idea is
>to avoid using processing power to identify the image.

Spang it into a frame buffer and look at it?

Why do you need to "avoid using processing power?"

							spl
-- 
Steve Lamont, SciViGuy -- (619) 534-7968 -- spl@dim.ucsd.edu
UCSD Microscopy and Imaging Resource/UCSD Med School/La Jolla, CA 92093-0608
"But is there hope to save/Even this ethereal essense from the grave?"
	- James Russel Lowell, "Ode Recited at the Harvard Commemoration"