Associative memory organisations, Computer Engineering

Associative Memory Organisations

The associative memory is organised in w words with b bits per word. In w x b array, every bit is known a cell. Each cell is made up of a flip-flop that haves some comparison logic gates for read-write operations and pattern match. Thus, it is possible to read or write in parallel due to the logic structure. A set of bit cells of all the words at the similar position in a vertical column is known bit slice as shown below:-

                                       238_Associative Memory Organisations.png

                                                                  Associative memory

Posted Date: 3/4/2013 5:27:54 AM | Location : United States







Related Discussions:- Associative memory organisations, Assignment Help, Ask Question on Associative memory organisations, Get Answer, Expert's Help, Associative memory organisations Discussions

Write discussion on Associative memory organisations
Your posts are moderated
Related Questions
Q. Returns information about present virtual machine? int pvm_parent( void ) Returns the tid of process which spawned the calling process.  int pvm_tidtohost(

write algorithm and draw flowchart for exchange the values of two variables.

What is the Semiconductor memory chip A semiconductor memory chip comprises a large number of cells organized into an array and the logic necessary to access any array in the c

Event-based Simulator Digital  Logic  Simulation  method  sacrifices  performance  for  rich  functionality:  each active signal  is  calculated  for  every  device  it  propa

What are several issues for selecting best workarounds in multiple inheritances? Some restrictions methods are used. Use two approaches of delegations, which is an implementati

algorithm for deleteing a node

The linkage section is part of a known as program that 'links' or maps to data items in the calling program are working storage. It is the part of the called program where these sh

What is the last entry in all BDC tables? In all BDC tables the last entry is to save the data by using the field name BDC_OKCODE and a field value of '/11'.

What is configuration?  Turing  machine  computes,  changes  occur  in  the  current  state,  the  current  tap contents  and  the  current  head  location. A  setting  of  the

Q. What is multi-threaded unix kernel? Multi-threaded UNIX kernel: We know threads are light-weight processors demanding minimal state information comprising the processor stat