Design and Analysis of Content Addressable Memory
Journal Title: GRD Journal for Engineering - Year 2016, Vol 1, Issue 0
Abstract
The Content addressable Memory (CAM) is high speed memories that are used in high speed networks, lookup tables and so on. The data to be searched will be compared with the data stored in the CAM cell and the address of the cell will be returned for the matched data. The parallel search operation in the memory is the important feature which improves the speed of search operation in CAM cells. However this parallel search operation will have its impact on the power dissipation, delay and various other parameters. This paper discusses the various low power CAM cells and analysis of its important parameters.
Authors and Affiliations
Abarna. I, Mythili. R
A Survey on the Foundation of Software Architecture
Software architecture research has emerged over the past decade, as the fundamental study of the overall structure of software systems, particularly the relations among subsystems and components. Building the foundation...
Optimization of Cylindrical Grinding Machine Parameters for Minimum Surface Roughness and Maximum MRR
Cylindrical grinding is very important process to improve quality of the component and to get precision dimensions with smooth surface finish. In the manufacturing sector, producing smooth surface finish plays an importa...
Applications of Brain Gate System
The mind-to-movement system that allows a quadriplegic man to control a computer using only his thoughts is a scientific milestone. It was reached, in large part, through the brain gate system. This system has become a b...
Seismic Response of Buckling Restrained Braced Frames
Buckling restrained bracing systems are effectively being used to reduce seismic response during recent years. But often configurations of these systems are ignored while evaluating their behavior. Aim of this study is t...
An Analysis of Particle Swarm Optimization with Data Clustering- Technique for Optimization in Data Mining
Data clustering is an approach for automatically finding classes, concepts, or groups of patterns. It also aims at representing large datasets by a few number of prototypes or clusters. It brings simplicity in modelling...