436 Nuclear Instruments and Methods in Physics Research A278 (1989) North-Holland, Amsterdam. 2. The detector
|
|
- Gertrude Walton
- 5 years ago
- Views:
Transcription
1 436 Nuclear Instruments and Methods in Physics Research A278 (1989) North-Holland, Amsterdam VLSI STRUCTURES FOR TRACK FINDING Mauro DELL'ORSO Dipartimento di Fisica, Università di Pisa, Piazza Torricelli 2, Pisa, Italy Luciano RISTORI INFN Sezione di Pisa, Via Vecchia Livornese 582a, S. Piero a Grado (PI), Italy Received 24 October 1988 We discuss the architecture of a device based on the concept of associative memory designed to solve the track finding problem, typical of high energy physics experiments, in a time span of a few microseconds even for very high multiplicity events. This "machine" is implemented as a large array of custom VLSI s. All the s are equal and each of them stores a number of "patterns". All the patterns in all the s are compared in parallel to the data coming from the detector while the detector is being read out. 1. Introduction The quality of results from present and future high energy physics experiments depends to some extent on the implementation of fast and efficient track finding algorithms. The detection of heavy flavor production, for example, depends on the reconstruction of secondary vertices generated by the decay of long lived particles, which in turn requires the reconstruction of the majority of the tracks in every event. Particularly appealing is the possibility of having detailed tracking information available at trigger level even for high multiplicity events. This information could be used to select events based on impact parameter or secondary vertices. If we could do this in a sufficiently short time we would significantly enrich the sample of events containing heavy flavors. Typical events feature up to several tens of tracks each of them traversing a few position sensitive detector layers. Each layer detects many hits and we must correctly correlate hits belonging to the same track on different layers before we can compute the parameters of the track. This task is typically time consuming : it is usually solved using "constraint equations" which apply to hits from the same track and going through a large number of different hit combinations using a "trial and error" approach. We propose here to use modern VLSI technology to build a device capable of solving the pattern recognition problem in a time span of a few microseconds even for the most complicated events. 2. The detector In this discussion we will assume that our detector consists of a number of layers, each layer being segmented into a number of bins. When charged particles cross the detector they hit one bin per layer. No particular assumption is made on the shape of trajectories : they could be straight or curved. Also the detector layers need not be parallel nor flat. This abstraction is meant to represent a whole class of real detectors (drift chambers, silicon microstrip detectors etc.). In the real world the coordinate of each hit will actually be the result of some computation performed on "raw" data: it could be the center of gravity of a cluster or a charge division interpolation or a drift-time to space conversion depending on the particular class of detector we are considering. We assume that all these operations are performed upstream and that the resulting coordinates are "binned" in some way before being transmitted to our device. 3. The pattern bank For each event we know which bins have been hit and from this information we want to reconstruct the trajectories of all the particles. We call this process track finding. The problem of track finding can be solved, at least conceptually, by a "brute force" approach. We consider all the possible tracks that go through our detector /89/$03.50 C Elsevier Science Publishers B.V. (North-Holland Physics Publishing Division)
2 437 Each track generates a hit pattern. Since the detector has a finite spatial resolution (bin size), many different tracks generate the same hit pattern. The number of different hit patterns generated by all the tracks is finite and it is possible to store all of them in a sufficiently large memory. The collection of all these patterns defines both the space of the tracks we are looking for and how they appear in the detector : we will refer to this collection as the pattern bank. For each event, a number of tracks traverse the detector and a particular configuration of hits is thus generated : we will refer to this configuration as the event. A conceptually simple way to perform the track finding algorithm is to scan the pattern bank and compare each pattern to the event. A track candidate is found whenever all the hits in the pattern are present in the event. Going through the totality of the patterns in the bank yields a number of track candidates. The number of different patterns to be stored in the bank depends on the detector granularity and geometry, and on the characteristics of the tracks we want to detect. As an example we will consider the situation shown in fig. 1 : the detector consists of four parallel planes and each plane is segmented into n bins. We consider all straight tracks crossing all four planes. We want to estimate the number of different patterns (NP ) that can be generated by a single track. A fairly good approximation is NP = 3n 2. Fig. 2. Roads and subroads. By selecting one bin in plane 1 and one bin in plane 4 we define a road : there are n 2 different roads. From fig. 2 it should be obvious that all the tracks belonging to a road generate three different patterns correspond ing to the three subroads delimited by dotted lines. Expression (1) can be generalized as follows : Np = (m-1)n 2, (2) m where NP = number of patterns, m = number of detector planes, n = number of bins/plane. The main problem with this approach is that the number of patterns to store in the bank for a practical situation may be very large. For example, if we consider 4 planes with 256 bins/plane we obtain : Np = 3x256 2 =2x10 5. To deal with such a large number of patterns we need a lot of memory and we expect the process of matching all the patterns sequentially to be very time consuming. 4. Associative memory The Pattern Bank Fig. 1. Straight tracks traversing four parallel detector layers. The pattern matching algorithm can be easily implemented on a parallel architecture because different patterns can be compared to the event independently and in any order ; in particular, any number of comparisons can be performed in parallel provided that this is allowed by the hardware. If our main goal is speed, we can try to push the degree of parallelism to the limit and compare all the
3 438 Layer 1 Layer 2 Layer 3 Layer 4 Cell o ~ffl mm lui Cell 1 i Cell 2 m Cell ~~ Data Bus 1 Data Bus 2 Data Bus 3 Data Bus 4 Fig. 3. Associative memory architecture. patterns to the event at once. To do this we need a special type of associative memory to store the pattern bank : each cell of the memory is big enough to hold one pattern and has enough logic built in to compare its contents to the event. A possible architecture for this device is shown in fig. 3. Each row represents one cell and is designed to store one pattern. Each cell is structured into a number of words, one word per detector layer (four of them are shown). Each word stores the address of one hit on the corresponding layer. All the words in a cell define a pattern by specifying one hit per layer. The Data Bus connects all the words in the same layer, this bus is used to load the pattern data into the memory cells during the initialization phase. During normal operation, for every event, the coordinates of all the hits in each layer are transmitted one after the other on the corresponding Data Bus ; all the words continuously compare their contents to what is on the bus and if a match is found the corresponding flip-flop (FF) is set. After all the hits have been transmitted, any cell that has all the flip-flops set is a track candidate because all the hits that define that pattern are present in the event. The addresses of all the track candidates are transmitted sequentially on the Output Bus. It is important to note that each hit needs to be fed into the associative memory only once. When a hit coordinate is placed on the bus all the flip-flops in all the cells containing that hit will be set simultaneously. Feeding a whole event into the associative memory will take a time proportional to the number of hits and will usually be performed in parallel with the detector readout. The actual pattern recognition process takes place within the associative memory during the time needed to extract the information from the detector. By the time all the hits have been read out, all the track information is also available. 5. VLSI Typical applications require a number of cells of the order of 100k or more. The amount of logic involved rules out the possibility of using standard components and requires the development of appropriate ASICs (Application Specific Integrated Circuits). Using the present VLSI technology, large numbers of logic gates can be integrated on a single. The structure we are proposing is basically a large array of very simple cells made of a memory bit and a comparator. A significant effort can be devoted to the design and optimisation of this cell in terms of silicon area and this basic building block can then be assembled into arrays of different size. In this way we believe we can design a CMOS with 256 cells of 32 bits (4 planes x 8 bits). We could then implement a system with 100k cells using only 400 s. A characteristic of VLSI technology is that s can be manufactured in large quantities at relatively low cost ; the input/output architecture of our should then be designed to facilitate the assembling of many of them into arrays of arbitrary size. One possible solution is described in the following sections. 6. The Fig. 4 shows the associative memory () and its input/output signals.
4 K _ ADDRESS BUS > DATA BUS CONTROLBUS OR 439 Fig. 4. Associative memory and 1/O signals. OR Data Bus : is used to input pattern data and event data. The number of bits depends on the number of layers and bins/layer in the detector. Address Bus : is used to input pattern addresses while loading the memory and to output pattern addresses when reading out track candidates. The number of bits depends on the number of cells in the. Control Bus : specifies the function to be performed (Reset, Read, Write, Compare, etc.). Output Ready (OR) : signals the presence of at least one track candidate ready to be output. Select () : directs the to output the first track candidate in the output queue on the Address Bus. The main functions that can be performed are : Write : patterns are loaded into the memory through the Data Bus at the address specified by the Address Bus. Compare : hit coordinates are input through the Data Bus, one coordinate per clock cycle. Readout : addresses of track candidates are output on the Address Bus, one track per clock cycle. ADDR[O-n] 7. Large arrays ADDR[n+5..n+8] ADDR[n+1..n+4] ADDR[n+9..n+12] Fig. 6. A large array. Fig. 5 shows how a number of s (16 in this case) can be connected to implement a larger associative memory. The logic in the shaded area is what is needed to expand the memory by a factor 16 : we will call it "glue". During readout the OR signals are priority encoded and only the leftmost is enabled by. As soon as all track candidates from one have been read out, the OR from that goes away and is automatically transferred to the next with available data. When all the ORs are off then also the global GROUT signal is turned off. The output from the priority encoder identifies the being read out and it is used to form the high order bits on the address bus, 4 ADDRESS BUS DATA BUS CONTROLBUS EXPANDED ADDRESS BUS RD'IN WRITE PRI ENC GROUT 6 DEC glue IN Fig s tied by the "glue".
5 M. Dell'Orso, L. Ristori / VLS1 structures for track finding low order bits being the pattern address within the. During write operations, the high order bits are input from the bus and fed to the decoder to select only the appropriate. In this way we obtain a device which contains 16 times the number of patterns but has the same I/O lines and protocol as a single with four additional address lines. It is then straightforward to replicate this structure hierarchically to expand our associative memory to an arbitrary size. Fig. 6 shows how to implement a very large array of s. The overall structure is tree-like the leaves being s and the nodes being "glue" s. Each level in the tree deals with a number of address lines (four in our case). Each link from one level to the next represents on OR line going to the right and a line going to the left ; other control signals and the Data Bus are broadcast to all the s in parallel. 8. Two-stage track finding In some cases, when the number of detector bins is large, the size of the associative memory required to solve completely the track finding problem might be too big. Tracking systems with thousands of channels per layer are often required by modern HEP experiments leading to an order of magnitude of many million patterns, a number which is certainly out of reach of present technology. What would be the use fo associative memory in this case? If the number of bins is too large we should treat the detector as if it had lower resolution by logically ORing adjacent bins (which is easily done by simply ignoring a number of low order bits in hit addresses) and perform a first stage of track finding in the associative memory at this reduced level of spatial definition. We can then pass track candidates to a second stage which will refine the definition of the track down to the detector limit. The key point here is that this second stage can be implemented with more conventional techniques (e.g. a sequential processor) since virtually all of the combinatorial problem which makes track finding so time consuming has already been solved. This happens because the number of patterns in the associative memory is orders of magnitude larger than the number of tracks in one event and therefore the probability of having two tracks "hitting" the same pattern is negligibly small.
PROGRAMMABLE LOGIC DEVICES
PROGRAMMABLE LOGIC DEVICES Programmable logic devices (PLDs) are used for designing logic circuits. PLDs can be configured by the user to perform specific functions. The different types of PLDs available
More informationFast pattern recognition with the ATLAS L1Track trigger for the HL-LHC
Fast pattern recognition with the ATLAS L1Track trigger for the HL-LHC On behalf of the ATLAS Collaboration Uppsala Universitet E-mail: mikael.martensson@cern.ch ATL-DAQ-PROC-2016-034 09/01/2017 A fast
More informationThe GAP project: GPU applications for High Level Trigger and Medical Imaging
The GAP project: GPU applications for High Level Trigger and Medical Imaging Matteo Bauce 1,2, Andrea Messina 1,2,3, Marco Rescigno 3, Stefano Giagu 1,3, Gianluca Lamanna 4,6, Massimiliano Fiorini 5 1
More informationSummer 2003 Lecture 18 07/09/03
Summer 2003 Lecture 18 07/09/03 NEW HOMEWORK Instruction Execution Times: The 8088 CPU is a synchronous machine that operates at a particular clock frequency. In the case of the original IBM PC, that clock
More informationSpiral 1 / Unit 6. Flip-flops and Registers
1-5.1 Spiral 1 / Unit 6 Flip-flops and Registers 1-5.2 Outcomes I know the difference between combinational and sequential logic and can name examples of each. I understand latency, throughput, and at
More informationOutcomes. Spiral 1 / Unit 6. Flip Flops FLIP FLOPS AND REGISTERS. Flip flops and Registers. Outputs only change once per clock period
1-5.1 1-5.2 Spiral 1 / Unit 6 Flip flops and Registers Mark Redekopp Outcomes I know the difference between combinational and sequential logic and can name examples of each. I understand latency, throughput,
More informationA New Variable-Resolution Associative Memory for High Energy Physics
A New Variable-Resolution Associative Memory for High Energy Physics A. Annovi, S. Amerio, M. Beretta, E. Bossini, F. Crescioli, M. Dell'Orso, P. Giannetti, J. Hoff, T. Liu, D. Magalotti, M. Piendibene,
More informationTPC Detector Response Simulation and Track Reconstruction
TPC Detector Response Simulation and Track Reconstruction Physics goals at the Linear Collider drive the detector performance goals: charged particle track reconstruction resolution: δ(1/p)= ~ 4 x 10-5
More informationPoS(High-pT physics09)036
Triggering on Jets and D 0 in HLT at ALICE 1 University of Bergen Allegaten 55, 5007 Bergen, Norway E-mail: st05886@alf.uib.no The High Level Trigger (HLT) of the ALICE experiment is designed to perform
More informationarxiv:physics/ v1 [physics.ins-det] 18 Dec 1998
Studies of 1 µm-thick silicon strip detector with analog VLSI readout arxiv:physics/981234v1 [physics.ins-det] 18 Dec 1998 T. Hotta a,1, M. Fujiwara a, T. Kinashi b, Y. Kuno c, M. Kuss a,2, T. Matsumura
More informationCOPYRIGHTED MATERIAL. Architecting Speed. Chapter 1. Sophisticated tool optimizations are often not good enough to meet most design
Chapter 1 Architecting Speed Sophisticated tool optimizations are often not good enough to meet most design constraints if an arbitrary coding style is used. This chapter discusses the first of three primary
More informationInterpolating Silicon Photomultipliers
Interpolating Silicon Photomultipliers Peter Fischer, Heidelberg University, Germany (Presenter) Claudio Piemonte, FBK, Italy We present the novel Interpolating Silicon PhotoMultiplier (ISiPM) topology
More informationFirst LHCb measurement with data from the LHC Run 2
IL NUOVO CIMENTO 40 C (2017) 35 DOI 10.1393/ncc/i2017-17035-4 Colloquia: IFAE 2016 First LHCb measurement with data from the LHC Run 2 L. Anderlini( 1 )ands. Amerio( 2 ) ( 1 ) INFN, Sezione di Firenze
More informationOutcomes. Spiral 1 / Unit 6. Flip Flops FLIP FLOPS AND REGISTERS. Flip flops and Registers. Outputs only change once per clock period
1-6.1 1-6.2 Spiral 1 / Unit 6 Flip flops and Registers Mark Redekopp Outcomes I know the difference between combinational and sequential logic and can name examples of each. I understand latency, throughput,
More informationInvestigating the Micron Automata Processor for HEP Pattern Recognition Applications
Investigating the Micron Automata Processor for HEP Pattern Recognition Applications, Christopher Green, and Ted Liu Fermilab E-mail: mwang@fnal.gov, greenc@fnal.gov, thliu@fnal.gov The Micron Automata
More informationR07. Code No: V0423. II B. Tech II Semester, Supplementary Examinations, April
SET - 1 II B. Tech II Semester, Supplementary Examinations, April - 2012 SWITCHING THEORY AND LOGIC DESIGN (Electronics and Communications Engineering) Time: 3 hours Max Marks: 80 Answer any FIVE Questions
More informationEEL 4744C: Microprocessor Applications. Lecture 7. Part 1. Interrupt. Dr. Tao Li 1
EEL 4744C: Microprocessor Applications Lecture 7 Part 1 Interrupt Dr. Tao Li 1 M&M: Chapter 8 Or Reading Assignment Software and Hardware Engineering (new version): Chapter 12 Dr. Tao Li 2 Interrupt An
More informationReading Assignment. Interrupt. Interrupt. Interrupt. EEL 4744C: Microprocessor Applications. Lecture 7. Part 1
Reading Assignment EEL 4744C: Microprocessor Applications Lecture 7 M&M: Chapter 8 Or Software and Hardware Engineering (new version): Chapter 12 Part 1 Interrupt Dr. Tao Li 1 Dr. Tao Li 2 Interrupt An
More informationNEW TECHNIQUES FOR CALCULATING VOLUMES BY CROSS SECTIONS.
NEW TECHNIQUES FOR CALCULATING VOLUMES BY CROSS SECTIONS. Stuart SPROTT. Numerical methods, Surveying, earthworks, volumes. Why investigate volume calculations? The standard method of calculating earthwork
More informationA New Segment Building Algorithm for the Cathode Strip Chambers in the CMS Experiment
EPJ Web of Conferences 108, 02023 (2016) DOI: 10.1051/ epjconf/ 201610802023 C Owned by the authors, published by EDP Sciences, 2016 A New Segment Building Algorithm for the Cathode Strip Chambers in the
More informationMAHALAKSHMI ENGINEERING COLLEGE TIRUCHIRAPALLI
DEPARTMENT: ECE MAHALAKSHMI ENGINEERING COLLEGE TIRUCHIRAPALLI 621213 QUESTION BANK SUBJECT NAME: DIGITAL ELECTRONICS SEMESTER III SUBJECT CODE: EC2203 UNIT 5 : Synchronous and Asynchronous Sequential
More informationCS24: INTRODUCTION TO COMPUTING SYSTEMS. Spring 2017 Lecture 13
CS24: INTRODUCTION TO COMPUTING SYSTEMS Spring 2017 Lecture 13 COMPUTER MEMORY So far, have viewed computer memory in a very simple way Two memory areas in our computer: The register file Small number
More informationMemory and Programmable Logic
Memory and Programmable Logic Memory units allow us to store and/or retrieve information Essentially look-up tables Good for storing data, not for function implementation Programmable logic device (PLD),
More informationDIGITAL CIRCUIT LOGIC UNIT 9: MULTIPLEXERS, DECODERS, AND PROGRAMMABLE LOGIC DEVICES
DIGITAL CIRCUIT LOGIC UNIT 9: MULTIPLEXERS, DECODERS, AND PROGRAMMABLE LOGIC DEVICES 1 Learning Objectives 1. Explain the function of a multiplexer. Implement a multiplexer using gates. 2. Explain the
More informationTrace Signal Selection to Enhance Timing and Logic Visibility in Post-Silicon Validation
Trace Signal Selection to Enhance Timing and Logic Visibility in Post-Silicon Validation Hamid Shojaei, and Azadeh Davoodi University of Wisconsin 1415 Engineering Drive, Madison WI 53706 Email: {shojaei,
More informationDigital VLSI Testing Prof. Santanu Chattopadhyay Department of Electronics and EC Engineering India Institute of Technology, Kharagpur.
Digital VLSI Testing Prof. Santanu Chattopadhyay Department of Electronics and EC Engineering India Institute of Technology, Kharagpur Lecture 05 DFT Next we will look into the topic design for testability,
More informationImplementation of the Content Addressable Memory (CAM) as an Encoder for the Silicon Track Card (STC)
Implementation of the Content Addressable Memory (CAM) as an Encoder for the Silicon Track Card (STC) Arvindh Lalam Rm. 312, FAMU-FSU College of Engineering, 2525, Pottsdamer Street, Tallahassee, FL 32310,
More informationarxiv: v1 [physics.ins-det] 11 Jul 2015
GPGPU for track finding in High Energy Physics arxiv:7.374v [physics.ins-det] Jul 5 L Rinaldi, M Belgiovine, R Di Sipio, A Gabrielli, M Negrini, F Semeria, A Sidoti, S A Tupputi 3, M Villa Bologna University
More informationPrimary Vertex Reconstruction at LHCb
LHCb-PUB-214-44 October 21, 214 Primary Vertex Reconstruction at LHCb M. Kucharczyk 1,2, P. Morawski 3, M. Witek 1. 1 Henryk Niewodniczanski Institute of Nuclear Physics PAN, Krakow, Poland 2 Sezione INFN
More informationECE 465, Fall 2013, Instructor: Prof. Shantanu Dutt. Project 2 : Project Files Due Tue Nov. 26, Report Due Wed. Nov. 27, both at midnight
ECE 465, Fall 2013, Instructor: Prof. Shantanu Dutt Project 2 : Project Files Due Tue Nov. 26, Report Due Wed. Nov. 27, both at midnight 1 Goal The goals of this project are: 1. To design a sequential
More informationTPC Detector Response Simulation and Track Reconstruction
TPC Detector Response Simulation and Track Reconstruction Physics goals at the Linear Collider drive the detector performance goals: charged particle track reconstruction resolution: δ reconstruction efficiency:
More informationCSEE 3827: Fundamentals of Computer Systems. Storage
CSEE 387: Fundamentals of Computer Systems Storage The big picture General purpose processor (e.g., Power PC, Pentium, MIPS) Internet router (intrusion detection, pacet routing, etc.) WIreless transceiver
More informationTPC Detector Response Simulation and Track Reconstruction
TPC Detector Response Simulation and Track Reconstruction Physics goals at the Linear Collider drive the detector performance goals: charged particle track reconstruction resolution: δ reconstruction efficiency:
More informationTEST, QUALIFICATION AND ELECTRONICS INTEGRATION OF THE ALICE SILICON PIXEL DETECTOR MODULES
TEST, QUALIFICATION AND ELECTRONICS INTEGRATION OF THE ALICE SILICON PIXEL DETECTOR MODULES I.A.CALI 1,2, G.ANELLI 2, F.ANTINORI 3, A.BADALA 4, A.BOCCARDI 2, G.E.BRUNO 1, M.BURNS 2, M.CAMPBELL 2, M.CASELLE
More information(Refer Slide Time: 00:01:53)
Digital Circuits and Systems Prof. S. Srinivasan Department of Electrical Engineering Indian Institute of Technology Madras Lecture - 36 Design of Circuits using MSI Sequential Blocks (Refer Slide Time:
More informationarxiv: v4 [physics.ins-det] 12 Mar 2015
Preprint typeset in JINST style - HYPER VERSION Simulation and performance of an artificial retina for 40 MHz track reconstruction arxiv:1409.0898v4 [physics.ins-det] 12 Mar 2015 A. Abba b, F. Bedeschi
More information3. The high voltage level of a digital signal in positive logic is : a) 1 b) 0 c) either 1 or 0
1. The number of level in a digital signal is: a) one b) two c) four d) ten 2. A pure sine wave is : a) a digital signal b) analog signal c) can be digital or analog signal d) neither digital nor analog
More informationSequential Logic Implementation. Mealy vs. Moore Machines. Specifying Outputs for a Mealy Machine. Specifying Outputs for a Moore Machine
uential Logic Implementation! Models for representing sequential circuits " bstraction of sequential elements " Finite state machines and their state diagrams " Inputs/ " Mealy, Moore, and synchronous
More informationAssociative Memory Pattern Matching for the L1 Track Trigger of CMS at the HL-LHC
Associative Memory Pattern Matching for the L1 Track Trigger of CMS at the HL-LHC Giacomo Fedi 1,a on behalf of the CMS collaboration 1 INFN Sezione di Pisa, Italy Abstract. The High Luminosity LHC (HL-LHC)
More informationReal-time Analysis with the ALICE High Level Trigger.
Real-time Analysis with the ALICE High Level Trigger C. Loizides 1,3, V.Lindenstruth 2, D.Röhrich 3, B.Skaali 4, T.Steinbeck 2, R. Stock 1, H. TilsnerK.Ullaland 3, A.Vestbø 3 and T.Vik 4 for the ALICE
More informationarxiv:hep-ph/ v1 11 Mar 2002
High Level Tracker Triggers for CMS Danek Kotliński a Andrey Starodumov b,1 a Paul Scherrer Institut, CH-5232 Villigen, Switzerland arxiv:hep-ph/0203101v1 11 Mar 2002 b INFN Sezione di Pisa, Via Livornese
More informationTrack pattern-recognition on GPGPUs in the LHCb experiment
Track pattern-recognition on GPGPUs in the LHCb experiment Stefano Gallorini 1,2 1 University and INFN Padova, Via Marzolo 8, 35131, Padova, Italy 2 CERN, 1211 Geneve 23, Switzerland DOI: http://dx.doi.org/10.3204/desy-proc-2014-05/7
More informationApproaches to Digital System Design
Approaches to Digital System Design In Digital Devices, you learned how to create a logic network (Flip-flops + combinational gates) to solve a problem The logic network was SPECIFIC to the problem. To
More informationLab 16: Data Busses, Tri-State Outputs and Memory
Lab 16: Data Busses, Tri-State Outputs and Memory UC Davis Physics 116B Rev. 0.9, Feb. 2006 1 Introduction 1.1 Data busses Data busses are ubiquitous in systems which must communicate digital data. Examples
More informationFinite State Machines (FSMs) and RAMs and CPUs. COS 116, Spring 2011 Sanjeev Arora
Finite State Machines (FSMs) and RAMs and CPUs COS 116, Spring 2011 Sanjeev Arora Recap Combinational logic circuits: no cycles, hence no memory Sequential circuits: cycles allowed; can have memory as
More information12. Use of Test Generation Algorithms and Emulation
12. Use of Test Generation Algorithms and Emulation 1 12. Use of Test Generation Algorithms and Emulation Jacob Abraham Department of Electrical and Computer Engineering The University of Texas at Austin
More informationALICE tracking system
ALICE tracking system Marian Ivanov, GSI Darmstadt, on behalf of the ALICE Collaboration Third International Workshop for Future Challenges in Tracking and Trigger Concepts 1 Outlook Detector description
More informationArchitecture as Interface
Architecture as Interface André DeHon Friday, June 21, 2002 Previously How do we build efficient, programmable machines How we mix Computational complexity W/ physical landscape
More informationDesign and construction of Micromegas detectors for the ATLAS Muon Spectrometer Upgrade
IL NUOVO CIMENTO 39 C (2016) 266 DOI 10.1393/ncc/i2016-16266-1 Colloquia: IFAE 2015 Design and construction of Micromegas detectors for the ATLAS Muon Spectrometer Upgrade Marco Sessa Dipartimento di Matematica
More informationMonte Carlo programs
Monte Carlo programs Alexander Khanov PHYS6260: Experimental Methods is HEP Oklahoma State University November 15, 2017 Simulation steps: event generator Input = data cards (program options) this is the
More informationTrack Reconstruction
4 Track Reconstruction 4 Track Reconstruction The NA57 experimental setup has been designed to measure strange particles. In order to translate the information extracted from the detectors to the characteristics
More informationCS 61C Summer 2012 Discussion 11 State, Timing, and CPU (Solutions)
State Elements State elements provide a means of storing values, and controlling the flow of information in the circuit. The most basic state element (we re concerned with) is a DQ Flip-Flop: D is a single
More informationReport on Cache-Oblivious Priority Queue and Graph Algorithm Applications[1]
Report on Cache-Oblivious Priority Queue and Graph Algorithm Applications[1] Marc André Tanner May 30, 2014 Abstract This report contains two main sections: In section 1 the cache-oblivious computational
More informationCOLLEGE OF ENGINEERING DEPARTMENT OF ELECTRICAL AND ELECTRONICS ENGINEERING QUESTION BANK SUBJECT CODE & NAME: EC 1312 DIGITAL LOGIC CIRCUITS UNIT I
KINGS COLLEGE OF ENGINEERING DEPARTMENT OF ELECTRICAL AND ELECTRONICS ENGINEERING QUESTION BANK SUBJECT CODE & NAME: EC 1312 DIGITAL LOGIC CIRCUITS YEAR / SEM: III / V UNIT I NUMBER SYSTEM & BOOLEAN ALGEBRA
More information8.882 LHC Physics. Track Reconstruction and Fitting. [Lecture 8, March 2, 2009] Experimental Methods and Measurements
8.882 LHC Physics Experimental Methods and Measurements Track Reconstruction and Fitting [Lecture 8, March 2, 2009] Organizational Issues Due days for the documented analyses project 1 is due March 12
More informationINTERCONNECT TESTING WITH BOUNDARY SCAN
INTERCONNECT TESTING WITH BOUNDARY SCAN Paul Wagner Honeywell, Inc. Solid State Electronics Division 12001 State Highway 55 Plymouth, Minnesota 55441 Abstract Boundary scan is a structured design technique
More informationComputer Systems. Binary Representation. Binary Representation. Logical Computation: Boolean Algebra
Binary Representation Computer Systems Information is represented as a sequence of binary digits: Bits What the actual bits represent depends on the context: Seminar 3 Numerical value (integer, floating
More informationEECS150 - Digital Design Lecture 20 - Finite State Machines Revisited
EECS150 - Digital Design Lecture 20 - Finite State Machines Revisited April 2, 2009 John Wawrzynek Spring 2009 EECS150 - Lec20-fsm Page 1 Finite State Machines (FSMs) FSM circuits are a type of sequential
More informationChapter 2 Logic Gates and Introduction to Computer Architecture
Chapter 2 Logic Gates and Introduction to Computer Architecture 2.1 Introduction The basic components of an Integrated Circuit (IC) is logic gates which made of transistors, in digital system there are
More informationLHC-B. 60 silicon vertex detector elements. (strips not to scale) [cm] [cm] = 1265 strips
LHCb 97-020, TRAC November 25 1997 Comparison of analogue and binary read-out in the silicon strips vertex detector of LHCb. P. Koppenburg 1 Institut de Physique Nucleaire, Universite de Lausanne Abstract
More informationSimulating the RF Shield for the VELO Upgrade
LHCb-PUB-- March 7, Simulating the RF Shield for the VELO Upgrade T. Head, T. Ketel, D. Vieira. Universidade Federal do Rio de Janeiro (UFRJ), Rio de Janeiro, Brazil European Organization for Nuclear Research
More informationWhere We Are in This Course Right Now. ECE 152 Introduction to Computer Architecture. This Unit: Caches and Memory Hierarchies.
Introduction to Computer Architecture Caches and emory Hierarchies Copyright 2012 Daniel J. Sorin Duke University Slides are derived from work by Amir Roth (Penn) and Alvin Lebeck (Duke) Spring 2012 Where
More informationMemory Supplement for Section 3.6 of the textbook
The most basic -bit memory is the SR-latch with consists of two cross-coupled NOR gates. R Recall the NOR gate truth table: A S B (A + B) The S stands for Set to remember, and the R for Reset to remember.
More informationECE 465, Spring 2010, Instructor: Prof. Shantanu Dutt. Project 2 : Due Fri, April 23, midnight.
ECE 465, Spring 2010, Instructor: Prof Shantanu Dutt Project 2 : Due Fri, April 23, midnight 1 Goal The goals of this project are: 1 To design a sequential circuit that meets a given speed requirement
More informationTrack reconstruction of real cosmic muon events with CMS tracker detector
Track reconstruction of real cosmic muon events with CMS tracker detector Piergiulio Lenzi a, Chiara Genta a, Boris Mangano b a Università degli Studi di Firenze and Istituto Nazionale di Fisica Nucleare
More informationISSCC 2003 / SESSION 2 / MULTIMEDIA SIGNAL PROCESSING / PAPER 2.6
ISSCC 2003 / SESSION 2 / MULTIMEDIA SIGNAL PROCESSING / PAPER 2.6 2.6 A 51.2GOPS Scalable Video Recognition Processor for Intelligent Cruise Control Based on a Linear Array of 128 4-Way VLIW Processing
More informationA Path Decomposition Approach for Computing Blocking Probabilities in Wavelength-Routing Networks
IEEE/ACM TRANSACTIONS ON NETWORKING, VOL. 8, NO. 6, DECEMBER 2000 747 A Path Decomposition Approach for Computing Blocking Probabilities in Wavelength-Routing Networks Yuhong Zhu, George N. Rouskas, Member,
More informationHOUGH TRANSFORM CS 6350 C V
HOUGH TRANSFORM CS 6350 C V HOUGH TRANSFORM The problem: Given a set of points in 2-D, find if a sub-set of these points, fall on a LINE. Hough Transform One powerful global method for detecting edges
More informationIMPLEMENTATION OF A FAST MPEG-2 COMPLIANT HUFFMAN DECODER
IMPLEMENTATION OF A FAST MPEG-2 COMPLIANT HUFFMAN ECOER Mikael Karlsson Rudberg (mikaelr@isy.liu.se) and Lars Wanhammar (larsw@isy.liu.se) epartment of Electrical Engineering, Linköping University, S-581
More informationKlaus Dehmelt EIC Detector R&D Weekly Meeting November 28, 2011 GEM SIMULATION FRAMEWORK
Klaus Dehmelt EIC Detector R&D Weekly Meeting November 28, 2011 GEM SIMULATION FRAMEWORK Overview GEM Simulation Framework in the context of Simulation Studies for a High Resolution Time Projection Chamber
More informationReference Sheet for C112 Hardware
Reference Sheet for C112 Hardware 1 Boolean Algebra, Gates and Circuits Autumn 2016 Basic Operators Precedence : (strongest),, + (weakest). AND A B R 0 0 0 0 1 0 1 0 0 1 1 1 OR + A B R 0 0 0 0 1 1 1 0
More information2015 Paper E2.1: Digital Electronics II
s 2015 Paper E2.1: Digital Electronics II Answer ALL questions. There are THREE questions on the paper. Question ONE counts for 40% of the marks, other questions 30% Time allowed: 2 hours (Not to be removed
More informationProgrammable Memory Blocks Supporting Content-Addressable Memory
Programmable Memory Blocks Supporting Content-Addressable Memory Frank Heile, Andrew Leaver, Kerry Veenstra Altera 0 Innovation Dr San Jose, CA 95 USA (408) 544-7000 {frank, aleaver, kerry}@altera.com
More informationWilliam Stallings Computer Organization and Architecture 8th Edition. Chapter 5 Internal Memory
William Stallings Computer Organization and Architecture 8th Edition Chapter 5 Internal Memory Semiconductor Memory The basic element of a semiconductor memory is the memory cell. Although a variety of
More informationHPC Algorithms and Applications
HPC Algorithms and Applications Dwarf #5 Structured Grids Michael Bader Winter 2012/2013 Dwarf #5 Structured Grids, Winter 2012/2013 1 Dwarf #5 Structured Grids 1. dense linear algebra 2. sparse linear
More information10/21/2016. ECE 120: Introduction to Computing. Let s Extend Our Keyless Entry FSM. FSM Designs Also Allow Use of Abstraction
University of Illinois at Urbana-Champaign Dept. of Electrical and Computer Engineering ECE 120: Introduction to Computing Extending Keyless Entry Combinational Logic Design Allows Use of Abstraction Recall
More informationCpE 442. Memory System
CpE 442 Memory System CPE 442 memory.1 Outline of Today s Lecture Recap and Introduction (5 minutes) Memory System: the BIG Picture? (15 minutes) Memory Technology: SRAM and Register File (25 minutes)
More informationDec Hex Bin ORG ; ZERO. Introduction To Computing
Dec Hex Bin 0 0 00000000 ORG ; ZERO Introduction To Computing OBJECTIVES this chapter enables the student to: Convert any number from base 2, base 10, or base 16 to any of the other two bases. Add and
More informationLecture #1: Introduction
Lecture #1: Introduction Kunle Olukotun Stanford EE183 January 8, 20023 What is EE183? EE183 is continuation of EE121 Digital Logic Design is a a minute to learn, a lifetime to master Programmable logic
More informationPhysics CMS Muon High Level Trigger: Level 3 reconstruction algorithm development and optimization
Scientifica Acta 2, No. 2, 74 79 (28) Physics CMS Muon High Level Trigger: Level 3 reconstruction algorithm development and optimization Alessandro Grelli Dipartimento di Fisica Nucleare e Teorica, Università
More information(Refer Slide Time: 1:43)
(Refer Slide Time: 1:43) Digital Circuits and Systems Prof. S. Srinivasan Department of Electrical Engineering Indian Institute of Technology, Madras Lecture - 27 Pattern Detector So, we talked about Moore
More informationAREA EFFICIENT IMAGE COMPRESSION USING WAVE DECODING at CHIP LEVEL
AREA EFFICIENT IMAGE COMPRESSION USING WAVE DECODING at CHIP LEVEL K.Ambika Assistant Professor Department of Electronics and Comm. & Engg. Mohammad Sathak A.J. College of Engineering B.Thilagavathi Assistant
More informationIntegrated CMOS sensor technologies for the CLIC tracker
Integrated CMOS sensor technologies for the CLIC tracker Magdalena Munker (CERN, University of Bonn) On behalf of the collaboration International Conference on Technology and Instrumentation in Particle
More informationTestability Optimizations for A Time Multiplexed CPLD Implemented on Structured ASIC Technology
ROMANIAN JOURNAL OF INFORMATION SCIENCE AND TECHNOLOGY Volume 14, Number 4, 2011, 392 398 Testability Optimizations for A Time Multiplexed CPLD Implemented on Structured ASIC Technology Traian TULBURE
More informationHenry Lin, Department of Electrical and Computer Engineering, California State University, Bakersfield Lecture 7 (Digital Logic) July 24 th, 2012
Henry Lin, Department of Electrical and Computer Engineering, California State University, Bakersfield Lecture 7 (Digital Logic) July 24 th, 2012 1 Digital vs Analog Digital signals are binary; analog
More informationTracking and flavour tagging selection in the ATLAS High Level Trigger
Tracking and flavour tagging selection in the ATLAS High Level Trigger University of Pisa and INFN E-mail: milene.calvetti@cern.ch In high-energy physics experiments, track based selection in the online
More informationSeminar on. A Coarse-Grain Parallel Formulation of Multilevel k-way Graph Partitioning Algorithm
Seminar on A Coarse-Grain Parallel Formulation of Multilevel k-way Graph Partitioning Algorithm Mohammad Iftakher Uddin & Mohammad Mahfuzur Rahman Matrikel Nr: 9003357 Matrikel Nr : 9003358 Masters of
More informationClustering and Reclustering HEP Data in Object Databases
Clustering and Reclustering HEP Data in Object Databases Koen Holtman CERN EP division CH - Geneva 3, Switzerland We formulate principles for the clustering of data, applicable to both sequential HEP applications
More informationTPC digitization and track reconstruction: efficiency dependence on noise
TPC digitization and track reconstruction: efficiency dependence on noise Daniel Peterson, Cornell University, DESY, May-2007 A study of track reconstruction efficiency in a TPC using simulation of the
More informationLecture-50 Intel 8255A: Programming and Operating Modes
Lecture-50 Intel 8255A: Programming and Operating Modes Operation Description: There are three basic modes of operation that can be selected by the system software. Mode 0: Basic Input/output Mode 1: Strobes
More informationAn important feature of CLEO III track finding is the diagnostics package providing information on the conditions encountered & decisions met in selec
CLEO III track finding uses cell level information in the initial phase, does not depend on intrinsic device resolution, is ideal for high (radial) density, low precision, information. CLEO III track finding
More informationTracking and Vertex reconstruction at LHCb for Run II
Tracking and Vertex reconstruction at LHCb for Run II Hang Yin Central China Normal University On behalf of LHCb Collaboration The fifth Annual Conference on Large Hadron Collider Physics, Shanghai, China
More informationVON NEUMANN ARCHITECTURE. VON NEUMANN ARCHITECTURE IB DP Computer science Standard Level ICS3U
C A N A D I A N I N T E R N A T I O N A L S C H O O L O F H O N G K O N G 5.3 Putting all the Units Together the Von Neumann Architecture 5.4 s Von Neumann Architecture the four components that make up
More informationA Low-Power Wave Union TDC Implemented in FPGA
A Low-Power Wave Union TDC Implemented in FPGA Jinyuan Wu a*, Yanchen Shi b and Douglas Zhu b a Fermi National Accelerator laboratory, Batavia, IL 60510, USA b Illinois Mathematics and Science Academy,
More informationApsel3D_TC. Alessandro Gabrielli Filippo Giorgi. INFN & Physics Department University of Bologna Italy. on behalf of the VIPIX collaboration
Apsel3D_TC User Guide A digital sparsification and readout circuit for a 8 32 matrix of 3D Pixels Alessandro Gabrielli Filippo Giorgi INFN & Physics Department University of Bologna Italy on behalf of
More informationSOFTWARE ARCHITECTURE For MOLECTRONICS
SOFTWARE ARCHITECTURE For MOLECTRONICS John H. Reif Duke University Computer Science Department In Collaboration with: Allara, Hill, Reed, Seminario, Tour, Weiss Research Report Presentation to DARPA:
More informationEECS 150 Homework 7 Solutions Fall (a) 4.3 The functions for the 7 segment display decoder given in Section 4.3 are:
Problem 1: CLD2 Problems. (a) 4.3 The functions for the 7 segment display decoder given in Section 4.3 are: C 0 = A + BD + C + BD C 1 = A + CD + CD + B C 2 = A + B + C + D C 3 = BD + CD + BCD + BC C 4
More informationFor Example: P: LOAD 5 R0. The command given here is used to load a data 5 to the register R0.
Register Transfer Language Computers are the electronic devices which have several sets of digital hardware which are inter connected to exchange data. Digital hardware comprises of VLSI Chips which are
More informationHigh performance, power-efficient DSPs based on the TI C64x
High performance, power-efficient DSPs based on the TI C64x Sridhar Rajagopal, Joseph R. Cavallaro, Scott Rixner Rice University {sridhar,cavallar,rixner}@rice.edu RICE UNIVERSITY Recent (2003) Research
More informationTrack reconstruction with the CMS tracking detector
Track reconstruction with the CMS tracking detector B. Mangano (University of California, San Diego) & O.Gutsche (Fermi National Accelerator Laboratory) Overview The challenges The detector Track reconstruction
More information