| Cellular
Neural Network (CNN) |
Definition
Cellular Neural Network is a revolutionary concept and an experimentally proven
new computing paradigm for analog computers. Looking at the technological advancement
in the last 50 years ; we see the first revolution which led to pc industry in
1980's, second revolution led to internet industry in 1990's cheap sensors &
mems arrays in desired forms of artificial eyes, nose, ears etc. this third revolution
owes due to C.N.N.This technology is implemented using CNN-UM and is also used
in imageprocessing.It can also implement any Boolean functions. ARCHITECTURE
OF CNN A standard CNN architecture consists
of an m*n rectangular array of cells c(i,j) with Cartesian coordinates (i,j) i=1,2
..M,
j=12
...N. A class -1 m*n standard CNN
is defined by a m*n rectangular array of cells cij located at site (i,j) i= 1,2
.m ,j=1,2,
.n is defined mathematically by (dXij/dt
)= -Xij + A(I,j,k,l) Ykl + B(i,j,k,l) + Zij
Electronic Circuit Model Of CNN
Voltage controlled current sources impliment various coupling terms. These transconductances can be easily constructed on "CMOS" integrated circuits
Simplical CNN
Recently a novel structure has been introduced to implement any Boolean / gray level function of any number of variables .The output is no longer restricted to be binary so that CNNs with gray scale outputs are obtained. Simplical CNNs are implemented using RTDs (resonant tunneling diodes)
RTDs are nano electric quantum device is featuring high speed regims and small integration sizes and they can be designed to operate in nano /femto sizes leading to extreme low power designs. In addition they exhibit an intrinsic non linear behaviour which can be exploited in many diverse applications, for instance in frequency multiplier and parity generators the threshold logic gates multi gigahertz a-d converters, and multivalued logic applications including multivalued memory design among others.
A simplical partition is used to subdivide the domain in to convex regions called simplices which are the natural extension 2-d triangle into an n-d space the corners of these simplices are called vertices & for the particular chosen domain are the points of the form ( +1,-1,+1,-1) it was proven that the set of all PWL function f is a linear vector space. Every PWL function can be expressed as a linear combination
F= € CiAi (u)
Ai(v-j)=1, if i=j
You may also like this : 4G Broadband seminar report, Finger Tracking In Real Time Human Computer Interaction, Eye Movement-Based Human Computer Interaction Techniques, Ethical Hacking, E-Cash Payment System PPT, Cyborgs, Brain Fingerprinting Biometrics in SECURE e-transaction, X- Internet, Surface Computer, Secure ATM by Image Processing, Mobile Ad-Hoc Networks Extensions to Zone Routing Protocol, Wibree PDF , Telepresence, System in Package, Smart Memories, Slammer Worm, Sensitive Skin, Pixie Dust, Linux Kernel 2.6, Lamp Technology, Humanoid Robot, HTAM, Haptic Technology, Elastic Cluster, Digital Scent Technology, Distributed Interactive Virtual Environment, Dynamic TCP Connection Elapsing, CAPTCHA, Virtual Retinal Display, Wireless LAN Security, Chameleon Chip, Haptics, Intelligent RAM, iSCSI, Linux Kernel 2.6, 3D Searching, Biological Computers, Rain Technology, Real Time Application Interface, GPS, HALO , BitTorrent, Compositional Adaptation, Rover Technology,Computer Seminars
|
Labels : Software Engineering Seminar Topics, General Seminar Topics for Computer Science(CSE), Advanced Seminar Topics Computer Science(CSE), Computer Science(CSE) Seminar Topics Full Reports Presentations, Computer Science(CSE) IEEE Seminar Topics, Computer Science(CSE) Seminar Topics with Abstract, Computer Science(CSE) Seminar Topics 2011|2010|2012|2009, Computer Science(CSE) Paper Presentations 2011, Computer Science(CSE),IT and MCA Seminar Topics|Reports|PPT|PDF, MCA Seminar Topics Latest, Latest MCA Seminar Topics 2012|2011|2010|2009, MCA Seminar Topics Free Download, MCA Seminar Topics with Abstract, MCA Seminar Topics 2009|2010|2011|2012, Advanced MCA Seminar Topics
<<back |