4 Pages

Bipn140 Lect 9 Notes Oct10

Course: BIPN BIPN 140, Fall 2010
School: UCSD
Rating:
 
 
 
 
 

Word Count: 559

Document Preview

140 BIPN LECT #9 1 DKBerg NEUROTRANSMITTERS/RECEPTORS I. NT Receptors A. Ionotropic Receptors: transmembrane proteins having an internal pore (ligand-gated ion channel) 1. Four TM domains a) nACh Receptors **FIGURE 6.3a/c**. b) GABAA & glycine Receptors 2. Three TM helices a) AMPA receptors (glutamate Rs) b) NMDA receptors (glutamate Rs) [subunit composition determines specific subtype properties, e.g....

Register Now

Unformatted Document Excerpt

Coursehero >> California >> UCSD >> BIPN BIPN 140

Course Hero has millions of student submitted documents similar to the one
below including study guides, practice problems, reference materials, practice exams, textbook help and tutor support.

Course Hero has millions of student submitted documents similar to the one below including study guides, practice problems, reference materials, practice exams, textbook help and tutor support.
140 BIPN LECT #9 1 DKBerg NEUROTRANSMITTERS/RECEPTORS I. NT Receptors A. Ionotropic Receptors: transmembrane proteins having an internal pore (ligand-gated ion channel) 1. Four TM domains a) nACh Receptors **FIGURE 6.3a/c**. b) GABAA & glycine Receptors 2. Three TM helices a) AMPA receptors (glutamate Rs) b) NMDA receptors (glutamate Rs) [subunit composition determines specific subtype properties, e.g. calcium-permeable vs calcium-impermeable NMDA receptors] **FIGURE 6.4a/b**. B. Metabotropic receptors 1. Seven TM regions 2. Shared NTs (with ionotropic Rs) but different outcomes: linked to intracellular pathways 3. G protein-coupled **FIGURE 6.5**. II. Classical Neurotransmitters A. Acetylcholine (ACh) 1. NT at the vertebrate NMJ 2. Rapid local synthesis: choline acetyltransferase (ChAT); defines a cholinergic neuron 3. Excess: desensitization of receptor **FIGURE 6.2**. BIPN 140 LECT #9 2 DKBerg B. Amino Acid NTs: 1. Glutamate: from glutamine; rapidly recycled via transporters 2. -Amino butyric acid (GABA): from glutamate by glutamic acid decarboxylase (GAD) 3. Others: aspartate, glycine **FIGURE 6.6** **FIGURE 6.8**. C. Biogenic Amines: 1. From tyrosine: dopamine, norepinephrine, epinephrine (catecholamines) 2. From tryptophan: serotonin (5-Hydroxytrypamine) **FIGURE 6.1**. D. Other: Purines (e.g. ATP) IV. Non-classical transmitters A. Neuropeptides 1. Multi-step synthesis: pre-proproteins (RER) to pro-peptides in vesicles and then to peptides 2. Delivery: transported to axon terminals, released, cleaved (not recycled). **FIGURE 6.14**. B. Retrograde Transmitters 1. Endocannabinoids see previously paper (Wilson & Nicoll, 2001). 2. Nitric oxide (NO): released from arginine; diffuses across BIPN 140 LECT #9 3 DKBerg membrane; can act retrograde across synapse **FIGURE 6.18**. V. Interesting NT Receptor subtypes A. AMPA vs NMDA glutamate receptors 1. AMPA Rs requires only glutamate for activation; rapid on/off 2. NMDA Rs requires glutamate, glycine, & membrane depolarization (to relieve Mg++ block), thus needing convergence of events. **FIGURE 6.7a-c**. B. GABAA receptors Chloride multiple permeable; regulation sites **FIGURE 6.9a/b**. VI. Original Reference - Liu Z, Neff RA, Berg DK (2006) Sequential interplay of nicotinic and GABAergic signaling guides neuronal development. Science 314:1610-1613. A. Background: GABA, the main inhibitory transmitter in the brain, is actually excitatory during embryogeneis and early postnatal life because of a reversed Cl- gradient. The excitatory phase of GABA signaling is critical for proper neuronal development and integration into circuits, i.e. synapses forming onto the neuron. Key to the GABA switch from excitation to inhibition is the appearance of the mature Cl- transporter KCC2, which pumps Cl- out of the cell, and the loss of the immature transporter NKCC1, which pumps Cl- into the cell. The mature Cl- gradient then enables GABA to be inhibitory (Cl- rushes in when GABAA receptors are activated). B. Experiment: Spontaneous nicotinic cholinergic signaling drives waves of excitation through the embryonic and early postnatal nervous system. Might this be related to the GABAergic switch? Test whether blocking nicotinic activity delays the developmental conversion of GABAergic transmission from excitation to inhibition. Methods: (1) In chick embryos block nicotinic activity receptor antagonists. (2) In mice block nicotinic activity by removing nicotinic receptor BIPN 140 LECT #9 4 DKBerg genes (knockouts). Easy test for GABA excitation: calcium fluor to report calcium influx (through VGCCs opened by the GABA excitation). C. Results: Endogenous nicotinic activity determines when GABAergic signaling converts from excitation to inhibition. Nicotinic activity does this by increasing KCC2 and decreasing NKCC1 to make a mature chloride gradient. Also shown (in other figures): (1) Preventing the depolarizing phase of GABA signaling causes the neurons to get less innervation. (2) Interestingly, even the initial inhibitory phase of GABAergic signaling has developmental instructions if, and only if, the neurons is also getting nicotinic excitation (integration is key). Show: **Fig. 1 from Liu et al., 2006** **Fig. 2 from Liu et al., 2006**
Find millions of documents on Course Hero - Study Guides, Lecture Notes, Reference Materials, Practice Exams and more. Course Hero has millions of course specific materials providing students with the best way to expand their education.

Below is a small sample set of documents:

UCSD - BIPN - BIPN 140
BIPN 140: Cellular Neurobiology LECTURE #10: Intracellular Signaling[Website: http:/www.biology.ucsd.edu/classes/bipn140.FA10] INSTRUCTORS Nicholas C. Spitzer (nspitzer@ucsd.edu) Darwin K. Berg (dberg@ucsd.edu) ANNOUNCEMENTS Prob Set #4 was posted on the
UCSD - BIPN - BIPN 140
BIPN 140 LECT #101DKBergINTRACELLULAR SIGNALING I. General Features A. Types of cell-cell signaling 1. Synaptic (chem & elect) 2. Paracrine signaling 3. Endocrine signaling B. Signal transduction purposes: 1. Molecular pathway from receptor to final ta
Uni. São Paulo - IME - MAC5711
Selected Solutions for Chapter 2: Getting StartedSolution to Exercise 2.2-2S ELECTION -S ORT.A/ n D A: length for j D 1 to n 1 smallest D j for i D j C 1 to n if Ai < Asmallest smallest D i exchange Aj with Asmallest The algorithm maintains the loop inv
Penn State - MATH 141 - 141
Fall 2003 Midterm II answers 1. a. NOTE: This topic is not included in Math141 SP05 Midterm II. 2. b 3. d 4. b 5. b 6. b 7. (I) converges; (II) converges; (III) diverges. 2 c) diverges. 8. a) converges to 0; b) converges to 3 ; 3 3 9. The integral converg
Penn State - MATH 141 - 141
MATH 1411. Find limx0EXAM IIcos 2x - cos 5x sin2 xSAMPLE A5. Which of the following is true for the four series given below:3 a) 2 b) c) 21 2(I)n=11 n3/2(II)n=11 n2/3(III)n=13 2n(IV)n=1(-1)n . n2/3a) (I) converges, but (II), (III), an
Penn State - MATH 141 - 141
MATH 1411. Evaluate the lim 2 3 1 2 x3 - x2 + x - 1 . 2x3 - x2 - xEXAM II5. Which one of the following is true for the integral2SAMPLE Bx11 dx? (x - 1)pa) b)a) Diverges for p = 1 and converges for both p > 1 and p < 1. b) Converges for p 1 and di
Penn State - MATH 141 - 141
MATH 1411. Find the limit lim a) b) 1 1 c) 2 d) - e) 0 1 2x0EXAM II1 - cos x . x2+SAMPLE C[tan-1 (n + 1) - tan-1 (n)].n=15. Find the sum of the seriesa) b) 4 c) 2 3 4d)e) The series diverges. 2. Find the limit lim (1 - 2x) x .x0 +16. If the
Penn State - PHYS - 211
Physics 211Midterm 2 Fall 2003Form E1. A trunk with a weight of 200 N rests on the floor. The coefficient of static friction between the trunk and the floor is 0.40, while the coefficient of kinetic friction is 0.15. If a person begins pushing on the c
Penn State - PHYS - 211
Phys 211MT02Sample Exam1. A horizontal spring (not pictured) with a spring constant of 588 N/m is used to launch a 2.00 k g block. The block slides a long a frictionless plateau and then down a frictionless ramp with total change in height of h = 0.750
Penn State - PHYS - 211
Phys 211 - MidTerm 2 SampleSummer 20091. A student sits at the top of his igloo, which is 3 m in radius and is very slippery so that friction may be neglected. The student begins to slide off the igloo from rest. What is the speed of the student when he
Uni. São Paulo - IME - MAC5711
Selected Solutions for Chapter 3: Growth of FunctionsSolution to Exercise 3.1-2To show that .n C a/b D .nb /, we want to nd constants c1 ; c2 ; n0 > 0 such that 0 c1 nb .n C a/b c2 nb for all n n0 . Note that n C a n C jaj 2n when jaj n , and n C a n ja
Uni. São Paulo - IME - MAC5711
Selected Solutions for Chapter 4: Divide-and-ConquerSolution to Exercise 4.2-4If you can multiply 3 3 matrices using k multiplications, then you can multiply n n matrices by recursively multiplying n=3 n=3 matrices, in time T .n/ D kT .n=3/ C .n2 /. Usi
Uni. São Paulo - IME - MAC5711
Selected Solutions for Chapter 5: Probabilistic Analysis and Randomized AlgorithmsSolution to Exercise 5.2-1Since H IRE -A SSISTANT always hires candidate 1, it hires exactly once if and only if no candidates other than candidate 1 are hired. This event
Uni. São Paulo - IME - MAC5711
Selected Solutions for Chapter 6: HeapsortSolution to Exercise 6.1-1Since a heap is an almost-complete binary tree (complete at all levels except possibly the lowest), it has at most 2hC1 1 elements (if it is complete) and at least 2h 1 C 1 D 2h element
Uni. São Paulo - IME - MAC5711
Selected Solutions for Chapter 7: QuicksortSolution to Exercise 7.2-3PARTITION does a worst-case partitioning when the elements are in decreasing order. It reduces the size of the subarray under consideration by only 1 at each step, which weve seen has
Uni. São Paulo - IME - MAC5711
Selected Solutions for Chapter 8: Sorting in Linear TimeSolution to Exercise 8.1-3If the sort runs in linear time for m input permutations, then the height h of the portion of the decision tree consisting of the m corresponding leaves and their ancestor
Uni. São Paulo - IME - MAC5711
Selected Solutions for Chapter 9: Medians and Order StatisticsSolution to Exercise 9.3-1For groups of 7, the algorithm still works in linear time. The number of elements greater than x (and similarly, the number less than x ) is at least l m 2n 1n 2 4 8
Uni. São Paulo - IME - MAC5711
Selected Solutions for Chapter 11: Hash TablesSolution to Exercise 11.2-1For each pair of keys k; l , where k l , dene the indicator random variable Xkl D I fh.k/ D h.l/g. Since we assume simple uniform hashing, Pr fXkl D 1g D Pr fh.k/ D h.l/g D 1=m, an
Uni. São Paulo - IME - MAC5711
Selected Solutions for Chapter 12: Binary Search TreesSolution to Exercise 12.1-2In a heap, a nodes key is both of its childrens keys. In a binary search tree, a nodes key is its left childs key, but its right childs key. The heap property, unlike the b
Uni. São Paulo - IME - MAC5711
Selected Solutions for Chapter 13: Red-Black TreesSolution to Exercise 13.1-4After absorbing each red node into its black parent, the degree of each node black node is 2, if both children were already black, 3, if one child was black and one was red,
Uni. São Paulo - IME - MAC5711
Selected Solutions for Chapter 14: Augmenting Data StructuresSolution to Exercise 14.1-7Let A1 : : n be the array of n distinct numbers. One way to count the inversions is to add up, for each element, the number of larger elements that precede it in the
Uni. São Paulo - IME - MAC5711
Selected Solutions for Chapter 15: Dynamic ProgrammingSolution to Exercise 15.2-5Each time the l -loop executes, the i -loop executes n l C 1 times. Each time the i -loop executes, the k -loop executes j i D l 1 times, each time referencing m twice. Thu
Uni. São Paulo - IME - MAC5711
Selected Solutions for Chapter 16: Greedy AlgorithmsSolution to Exercise 16.1-4Let S be the set of n activities. The obvious solution of using G REEDY-ACTIVITY-S ELECTOR to nd a maximum-size set S1 of compatible activities from S for the rst lecture hal
Uni. São Paulo - IME - MAC5711
Selected Solutions for Chapter 17: Amortized AnalysisSolution to Exercise 17.1-3Let ci D cost of i th operation. ( i if i is an exact power of 2 ; ci D 1 otherwise : Operation 1 2 3 4 5 6 7 8 9 10 : : : Cost 1 2 1 4 1 1 1 8 1 1 : : :n operations costn
Uni. São Paulo - IME - MAC5711
Selected Solutions for Chapter 21: Data Structures for Disjoint SetsSolution to Exercise 21.2-3We want to show that we can assign O.1/ charges to M AKE -S ET and F IND -S ET and an O.lg n/ charge to U NION such that the charges for a sequence of these o
Uni. São Paulo - IME - MAC5711
Selected Solutions for Chapter 22: Elementary Graph AlgorithmsSolution to Exercise 22.1-7BB T .i; j / DXe 2ET bie bej DXe 2Ebie bjeIf i D j , then bi e bje D 1 (it is 1 1 or . 1/ . 1/) whenever e enters or leaves vertex i , and 0 otherwise. If i
Uni. São Paulo - IME - MAC5711
Selected Solutions for Chapter 23: Minimum Spanning TreesSolution to Exercise 23.1-1Theorem 23.1 shows this. Let A be the empty set and S be any set containing u but not .Solution to Exercise 23.1-4A triangle whose edge weights are all equal is a grap
Uni. São Paulo - IME - MAC5711
Selected Solutions for Chapter 24: Single-Source Shortest PathsSolution to Exercise 24.1-3If the greatest number of edges on any shortest path from the source is m, then the path-relaxation property tells us that after m iterations of B ELLMAN -F ORD, e
Uni. São Paulo - IME - MAC5711
Selected Solutions for Chapter 25: All-Pairs Shortest PathsSolution to Exercise 25.1-3The matrix L.0/ corresponds to the identity matrix 1 0 0 0 1 0 0 0 1 : : : : : : : 0 0 0 0 0 0 : : : 1IDof regular matrix multiplication. Substitute 0 (the identity
Uni. São Paulo - IME - MAC5711
Selected Solutions for Chapter 26: Maximum FlowSolution to Exercise 26.2-11For any two vertices u and in G , we can dene a ow network Gu consisting of the directed version of G with s D u, t D , and all edge capacities set to 1. (The ow network Gu has V
Uni. São Paulo - IME - MAC5711
Solutions for Introduction to algorithms second editionPhilip BilleThe author of this document takes absolutely no responsibility for the contents. This is merely a vague suggestion to a solution to some of the exercises posed in the book Introduction t
Uni. São Paulo - IME - MAC5711
Introduction to Algorithms, Second EditionThomas H. Cormen Charles E. Leiserson Ronald L. Rivest Clifford Stein The MIT Press Cambridge , Massachusetts London, England McGraw-Hill Book Company Boston Burr Ridge , IL Dubuque , IA Madison , WI New York San
Uni. São Paulo - IME - MAC5711
Instructor's Manualby Thomas H. Cormen Clara Lee Erica Linto AccompanyIntroduction to AlgorithmsSecond Editionby Thomas H. Cormen Charles E. Leiserson Ronald L. Rivest Clifford SteinThe MIT Press Cambridge, MassachusettsLondon, England Dubuque, IA
Uni. São Paulo - IME - MAC5711
Universidad de Chile Facultad de Ciencias F sicas y Matemticas a Departamento de Ingenier Industrial aProgramacin Dinmica o aMarcel Goic F.1IN34A: Clase AuxiliarEsta es una versin bastante preliminar por lo que puede contar con numerosas faltas de ort
Arkansas Little Rock - COMPSCI - CSCP
n times,has the time complexity of; TOKDEMIR It which results in having the time complexity of: SERPILO Case)/2 = (0 O(log2(n) Worst (log2(n+c)= + n* n(n-1)/2)/2 = n* (n-1)/4CPSC 7385 ANALYSIS OF ALGORITHMS HOMEWORK ASSIGNMENT # 3Q. 1. E = cfw_a1, a2,
UGA - ANTH - 2120H
Anthropology chapter 2 Evolution and natural selection Essentialism Plato Universe and everything has always existed Each thing has a core of unchanging features idea unites all varieties Great chain of being Aristotle built on essentialism Basis for Jude
UConn - FNCE - 3101
Wen Jie Jolina Li October 27, 2010 Daniel ToscanoFinance 3101 Professor GilsonI did some research on Mr. Daniel Toscano, he has a wide range of great work experience in the financial field. He is currently is a Managing Director and Co-Head of Global Le
Grantham - CS - 263
Amanda Drobney October 24,2010 A Assignment #3 #include <iostream> # #include <iomanip> u using namespace std; / calculate the tax for single double SingleTax( double income); / calculate the tax for married double MarriedTax( double income); int main() c
Washington State - ENGINEERIN - 120
AIRPOLLUTIONPROBLEM SMOKESTACK F1 F2 12 9 35 42 37 53 COST ATMOST DECISIONX ATLEAST 8 1 1 0 10 1 0.62 0 FILTER F1 F2 25 20 18 31 28 24 7 1 0.34 0 6 1 1 0 BETTERFUELS F1 F2 17 13 56 49 29 20 11 1 0.05 0 9 1 1 0 RED. ACH. 60 150 125 32.15 RED. REQ. 60 150 1
Washington State - ENGINEERIN - 120
DIETPROBLEM XW 0 XR 0 TOTALCOST 0 MDR 20 15 3WHEAT RYEDAILYINTAKE CARB/UNIT 5 7 PROTEIN/UNIT 4 2 VITAMIN/UNIT 2 1 COST 0.6 0.35
Washington State - ENGINEERIN - 120
DIETPROBLEM XW 0 XR 0 TOTALCOST 0 MDR 20 15 3WHEAT RYEDAILYINTAKE CARB/UNIT 5 7 PROTEIN/UNIT 4 2 VITAMIN/UNIT 2 1 COST 0.6 0.35
Washington State - ENGINEERIN - 120
DIETPROBLEM XW 3.61 XR 0.28 TOTALCOST 2.26 MDR 20 15 3WHEAT RYEDAILYINTAKE CARB/UNIT 5 7 20 PROTEIN/UNIT 4 2 15 VITAMIN/UNIT 2 1 7.5 COST 0.6 0.35
Washington State - ENGINEERIN - 120
DIETPROBLEM XW 3.61 XR 0.28 TOTALCOST 2.26 MDR 20 15 3WHEAT RYEDAILYINTAKE CARB/UNIT 5 7 20 PROTEIN/UNIT 4 2 15 VITAMIN/UNIT 2 1 7.5 COST 0.6 0.35
Washington State - ENGINEERIN - 120
3.4-9 Grams of ingredient per serving Steak Potatoes 5 15 20 5 15 2 $4 $2 S 1.27 0 $10.91 P 2.91 0Ingredient Carbohydrates Protein Fat Cost per serving Decision X At least Target: Min C = 4S+2P =Daily Req. >= 50 >=40 <=6050 40 603.4-12 Unit Shipping C
Washington State - ENGINEERIN - 120
RADIATIONTHERAPYPROBLEM FRACTION AREA BEAM1 BEAM2 DOSERECEIVEDSIGN RESTRICTION HEALTHYANATOMY 0.4 0.5 5.25 MINIMIZE CRITICALTISSUE 0.3 0.1 2.7 <= 2.7 TUMORREGION 0.5 0.5 6 = 6 TUMORCENTER 0.6 0.4 6.3 >= 6 X1 7.5 X2 4.5
Art Inst. Boston - BM - CS1034
Nokia 7110 Secret codesJul, 08 2003 - 06:23contributed by: mef *#06# For checking the IMEI (International Mobile Equipment Identity) *#0000# To view Software Version. *#3370# Enhanced Full Rate Codec (EFR) activation. It will automatically restart. *#33
LSU - SOCIOLOGY - 2505
Chapter 5SexualitiesClick to edit Master subtitle style11/4/10SOCL 2505 1 September 28, 2010HistoricallyBy late 19th and early 20th centuries, two major categories developedHeterosexual Homosexual11/4/10Sexual IdentitiesSexual identity: a set of
LSU - SOCIOLOGY - 2505
Work and FamiliesChapter 8Click to edit Master subtitle style11/4/10SOCL 2505 1 October 11, 2010HistoricallylPaid work vs. Unpaid work Homemaker-breadwinner not a natural division-of-labor Contextual shiftllFamilies paying for services or relyin
LSU - SOCIOLOGY - 2505
Children and ParentsChapter 9Click to edit Master subtitle style11/4/10SOCL 2505 1 October 13, 2010What Are Parents Supposed to Do for Children?Provide the main setting where fundamental needs are met Supply most of the love, nurturing, care, and tr
LSU - SOCIOLOGY - 2505
Older People and Their FamiliesChapter 10Click to edit Master subtitle style11/4/10SOCL 2505 1 October 18, 2010Contemporary TrendsFour living grandparents a new phenomena People live longer todayNot all elderly persons are healthy & activeWill soc
LSU - SOCIOLOGY - 2505
Public and Private FamiliesSOCL 2505 1 August 25, 2010Contemporary Family ContextThe traditional nuclear familyu1950s sitcoms portrayed the American Family at the timeBreadwinner-homemakerrIs this the ideal family?Contemporary Family Context (con
LSU - SOCIOLOGY - 2505
The History of the FamilySOCL 2505 1 August 30, 2010The Study of the FamilyBegan in the 1960shWomen & Gender Public family as old as civilizationhFamily and KinshipHunter-gatherers: people who wander through forests or over plains in small bands,
Art Inst. Boston - BM - CS1034
Chapter 1 An Overview of Corporate Finance and The Financial EnvironmentANSWERS TO END-OF-CHAPTER QUESTIONS1-1a. A proprietorship, or sole proprietorship, is a business owned by one individual. A partnership exists when two or more persons associate to
NYU Poly - CS - 3224
CS3224 Chapter One3/9/2009CS3224 Operating SystemsIntroduction Administrivia What's the course about? History Hardware basics System Structure3/9/2009Sterling - CS32241Administrivia Website. cis.poly.edu/jsterling/cs3224 Text: Modern Operating Sy
NYU Poly - CS - 3224
Processes What are they? How do we represent them? Scheduling Something smaller than a process? Threads Synchronizing and Communicating Classic IPC problemsProcessesThe Process Modela) b) c)Multiprogramming of four processes Conceptual model of 4 ind
NYU Poly - EL - 537
Review TwoTCP/IP Essentials A Lab-Based ApproachSpring 2010CaveatIPv6, Metro Ethernet, and MPLS are three topics recently covered in lecture. Although this deck of slides does not include these topics, students are required to study the related materi
NYU Poly - EE - 4313
EE4313: CE Design Project IClass IntroductionN. Sertac Artan sartan@poly.eduEE4313Syllabus: People Instructor: N. Sertac Artan Office Hours: TBA Office: LC 105, Tel: (718) 260-3496, E-mail: sartan at poly edu URL: http:/eeweb.poly.edu/artan TA: Viv
NYU Poly - EE - 4313
EE4313/EL5493Lecture 2N. Sertac Artan sartan@poly.eduEE4313/EL5493Last Week:Top-down VHDL-based VLSI design methodologyVHDL Model Functional Simulation Synthesis Timing verificationFloorplan, placement and routingEE4313/EL54932Last Week: OR-AND
NYU Poly - EE - 4313
EE4313/EL5493Lecture 3N. Sertac Artan sartan@poly.eduEE4313/EL5493LAST WEEKEE4313/EL54932Signal Models a physical wire Remember: Variables are updated as soon as a variable assignment statement is executed Signals are updated at a specific time S
NYU Poly - EE - 4313
EE4313/EL5493Lecture 4N. Sertac Artan sartan@poly.eduEE4313/EL5493LAST WEEKEE4313/EL54932Component Declarationlibrary IEEE; use IEEE.std_logic_1164.all; entity or_andx2 is port ( a0, b0, c0: in std_logic; a1, b1, c1: in std_logic; o0, o1: out std_
NYU Poly - EE - 4313
EE4313/EL5493Lecture 5N. Sertac Artan sartan@poly.eduEE4313/EL5493PROCESSES (CONTD)EE4313/EL54932Process communication What kind of data can be shared in between processes? How about timing?First: Process(a) variable c:std_logic_vector(1 downto 0