Algorithms for Cell Layout

Cell layout is a critical step in the design process of computer chips. A cell is a logic function or storage element implemented in CMOS technology by transistors connected with wires. As each cell is used many times on a chip, improvements of a single cell layout can have a large effect on the overall chip performance. In the past years increasing difficulty to manufacture small feature sizes has lead to growing complexity of design rules. Producing cell layouts which are compliant with design rules and at the same time optimized w.r.t. layout size has become a difficult task for human experts. In this thesis we present BonnCell, a cell layout generator which is able to fully automatically produce design rule compliant layouts. It is able to guarantee area minimality of its layouts for small and medium sized cells. For large cells it uses a heuristic which produces layouts with a significant area reduction compared to those created manually. The routing problem is based on the Vertex Disjoint Steiner Tree Packing Problem with a large number of additional design rules. In Chapter 4 we present the routing algorithm which is based on a mixed integer programming (MIP) formulation that guarantees compliance with all design rules. The algorithm can also handle instances in which only part of the transistors are placed to check whether this partial placement can be extended to a routable placement of all transistors. Chapter 5 contains the transistor placement algorithm. Based on a branch and bound approach, it places transistors in turn and achieves efficiency by pruning parts of the search tree which do not contain optimum solutions. One major contribution of this thesis is that BonnCell only outputs routable placements. Simply checking the routability for each full placement in the search tree is too slow in practice, therefore several speedup strategies are applied. Some cells are too large to be solved by a single call of the placement algorithm. In Chapter 7 we describe how these cells are split up into smaller subcells which are placed and routed individually and subsequently merged into a placement and routing of the original cell. Two approaches for dividing the original cell into subcells are presented, one based on estimating the subcell area and the other based on solving the Min Cut Linear Arrangement Problem. BonnCell has enabled our cooperation partner IBM to drastically improve their cell design and layout process. In particular, a team of human experts needed several weeks to find a layout for their largest cell, consisting of 128 transistors. BonnCell processed this cell without manual intervention in 3 days and its layout uses 15% less area than the layout found by the human experts

Timing-Driven Macro Placement

Placement is an important step in the process of finding physical layouts for electronic computer chips. The basic task during placement is to arrange the building blocks of the chip, the circuits, disjointly within a given chip area. Furthermore, such positions should result in short circuit interconnections which can be routed easily and which ensure all signals arrive in time. This dissertation mostly focuses on macros, the largest circuits on a chip. In order to optimize timing characteristics during macro placement, we propose a new optimistic timing model based on geometric distance constraints. This model can be computed and evaluated efficiently in order to predict timing traits accurately in practice. Packing rectangles disjointly remains strongly NP-hard under slack maximization in our timing model. Despite of this we develop an exact, linear time algorithm for special cases. The proposed timing model is incorporated into BonnMacro, the macro placement component of the BonnTools physical design optimization suite developed at the Research Institute for Discrete Mathematics. Using efficient formulations as mixed-integer programs we can legalize macros locally while optimizing timing. This results in the first timing-aware macro placement tool. In addition, we provide multiple enhancements for the partitioning-based standard circuit placement algorithm BonnPlace. We find a model of partitioning as minimum-cost flow problem that is provably as small as possible using which we can avoid running time intensive instances. Moreover we propose the new global placement flow Self-Stabilizing BonnPlace. This approach combines BonnPlace with a force-directed placement framework. It provides the flexibility to optimize the two involved objectives, routability and timing, directly during placement. The performance of our placement tools is confirmed on a large variety of academic benchmarks as well as real-world designs provided by our industrial partner IBM. We reduce running time of partitioning significantly and demonstrate that Self-Stabilizing BonnPlace finds easily routable placements for challenging designs – even when simultaneously optimizing timing objectives. BonnMacro and Self-Stabilizing BonnPlace can be combined to the first timing-driven mixed-size placement flow. This combination often finds placements with competitive timing traits and even outperforms solutions that have been determined manually by experienced designers

High performance algorithms for large scale placement problem

Placement is one of the most important problems in electronic design automation (EDA). An inferior placement solution will not only affect the chip’s performance but might also make it nonmanufacturable by producing excessive wirelength, which is beyond available routing resources. Although placement has been extensively investigated for several decades, it is still a very challenging problem mainly due to that design scale has been dramatically increased by order of magnitudes and the increasing trend seems unstoppable. In modern design, chips commonly integrate millions of gates that require over tens of metal routing layers. Besides, new manufacturing techniques bring out new requests leading to that multi-objectives should be optimized simultaneously during placement. Our research provides high performance algorithms for placement problem. We propose (i) a high performance global placement core engine POLAR; (ii) an efficient routability-driven placer POLAR 2.0, which is an extension of POLAR to deal with routing congestion; (iii) an ultrafast global placer POLAR 3.0, which explore parallelism on POLAR and can make full use of multi-core system; (iv) some efficient triple patterning lithography (TPL) aware detailed placement algorithms

Conception et mise au point de l'électronique frontale du détecteur de pied de gerbe (Preshower) de l'expérience CMS

Modern particle physics collider experiments consist of a number of macroscopic modules each consisting of large number of sensors measuring charge deposition from traversing particles. The CMS Preshower detector is designed as a sampling calorimeter producing electromagnetic showers for incident electrons and photons resulting from LHC p-p interactions. The ultimate aim is to provide neutral pion / gamma separation reducing the background to the most promising Higgs channel, SM Higgs to 2 photons. The detector has 4300 silicon sensors each subdivided into 32 channels with a total sensitive area of 16.4 m2. Front-end microelectronics ASICs must measure the charge of each channel accurately with low noise and over a wide dynamic range (4 fC to 1600 fC) at the rate of 40 MHz within a harsh radiation environment. This thesis presents the design and development of the Preshower front-end electronics ASIC development, PACE. The first chapter introduces the Preshower experiment and defines the specification for PACE as derived from the physics. The second chapter examines the radiation environment, its effect on electronic devices, and design techniques / technologies that can resist to LHC radiation levels. Chapters 3 to 5 present the design and results of two PACE developments examining analog memories based on current and voltage sampling techniques. Experimental results from a Preshower electro-mechanical prototype tested in a particle beam are also given

Modern FPGA placement techniques with hardware acceleration

In deep sub-micron technology nodes, Application-Specific Integrated Circuits (ASICs) are becoming expensive to design and manufacture. For this reason, Field Programmable Gate Arrays (FPGAs), which are general purpose and flexible programmable hardware, are gaining more design wins in low volume and fast evolving applications. Modern FPGAs are becoming popular in high performance data analytics, search engines, autonomous cars, communication and networking applications. FPGAs are also accompanied with a complete Computer-Aided Design (CAD) toolchain, that is used to optimally map and fit the design applications or workloads onto the underlying target FPGA device. These design applications mapped onto the FPGA demand high maximum achievable clock frequency (Fmax) and low power consumption while maintaining a low compilation time, which is a major hindrance in widespread adoption of FPGAs. The focus of this Ph.D. dissertation is the placement problem for FPGAs, which takes a major portion of the FPGA CAD tool runtime. A new algorithm for spreading cells during FPGA global placement is proposed, which achieves better wirelength and routing congestion and takes less runtime than the algorithm used in the state-of-the-art academic FPGA placer. We also propose FPGA acceleration of various subsystems of an analytic global placement algorithm, including wirelength gradient computation and spreading, which achieves significant speedup over the multi-threaded CPU version. A new detailed placement algorithm is proposed, which offers better tradeoff between quality and runtime compared to existing methods. This algorithm is also accelerated on a GPU and an FPGA, achieving significant speedup over multi-threaded CPU implementation. Another detailed placement algorithm is also proposed which physically re-aligns timing critical paths and improves Fmax with minimal runtime overhead. Both of these algorithms for detailed placement have shown good results on industrial benchmarks and have been integrated into an industrial FPGA CAD tool flowElectrical and Computer Engineerin

Improved Physical Design for Manufacturing Awareness and Advanced VLSI

Increasing challenges arise with each new semiconductor technology node, especially in advanced nodes, where the industry tries to extract every ounce of benefit as it approaches the limits of physics, through manufacturing-aware design technology co-optimization and design-based equivalent scaling. The increasing complexity of design and process technologies, and ever-more complex design rules, also become hurdles for academic researchers, separating academic researchers from the most up-to-date technical issues.This thesis presents innovative methodologies and optimizations to address the above challenges. There are three directions in this thesis: (i) manufacturing-aware design technology co-optimization; (ii) advanced node design-based equivalent scaling; and (iii) an open source academic detailed routing flow.To realize manufacturing-aware design technology co-optimization, this thesis presents two works: (i) a multi-row detailed placement optimization for neighbor diffusion effect mitigation between neighboring standard cells; and (ii) a post-routing optimization to generate 2D block mask layout for dummy segment removal in self-aligned multiple patterning.To achieve advanced node design-based equivalent scaling, this thesis presents two improved physical design methodologies: (i) a post-placement flop tray generation approach for clock power reduction; and (ii) a detailed placement approach to exploit inter-row M1 routing for congestion and wirelength reduction.To address the increasing gap between academia and industry, this thesis presents two works toward an open source academic detailed routing flow: (i) a complete, robust, scalable and design ruleaware dynamic programming-based pin access analysis framework; and (ii) TritonRoute – the open source detailed router that is capable of delivering DRC-clean detailed routing solutions in advanced nodes.This thesis concludes with a summary of its contributions and open directions for future research

Support des applications multimédia dans les réseaux de prochaine génération

RÉSUMÉ Les applications multimédia sont devenues tellement populaires que certaines d’entre elles sont utilisées quotidiennement par les usagers. Cette popularité peut être attribuée à plusieurs facteurs, tels que la diversification du contenu et des services offerts, l’accès en tout temps grâce à la mobilité et à la nomadicité, ainsi qu’aux avancées au niveau des architectures et des protocoles utilisés, afin de supporter les requis plus exigeants de ces applications. Par exemple, ce qui était jadis un simple appel téléphonique, se transforme désormais en une vidéoconférence, permettant à un nombre dynamique d’usagers d’y participer. Un autre exemple d’application multimédia, qui connait également un essor fulgurant, est IP TeleVision (IPTV), soit la technologie permettant la transmission de la télévision, en direct et sur demande, sur des réseaux IP. On retrouve également sa version mobile, soit Mobile IP TeleVision (MobileTV). Du côté des opérateurs, le focus est mis sur le déploiement des réseaux de prochaine génération. Les opérateurs sans-fil se tournent vers les technologies cellulaires de quatrième génération, telles que 3GPP Long Term Evolution (LTE), alors que ceux qui offrent les services filaires regardent plutôt vers les réseaux basés sur la fibre optique, tels que Fiber to the Home (FTTH). Ces réseaux promettent d’augmenter le débit offert, ainsi que de réduire la latence, soit deux critères importants pour le déploiement des applications multimédia à grande échelle. Malgré ces avancées technologiques, il existe encore plusieurs obstacles au bon fonctionnement des applications multimédia. Dans cette optique, cette thèse se penche sur trois problématiques importantes dans les réseaux de prochaine génération, chacune faisant l’objet d’un article scientifique. Les deux premiers volets s’attardent sur la convergence des réseaux fixes et mobiles, ou Fixed-Mobile Convergence (FMC). Cette convergence vient brouiller la distinction entre les réseaux mobiles et les réseaux fixes. Entre autre, elle permet à un usager d’avoir accès à ses services, autant sur le réseau cellulaire (LTE, par exemple) que sur un réseau local (Wireless Fidelity (WiFi), par exemple). Pour s’y faire, l’usager est généralement muni d’un terminal pouvant se connecter sur les deux réseaux. La première problématique soulevée dans cette thèse est au niveau de la prise de décision de la relève. En effet, les deux protocoles de mobilité les plus populaires, soit Mobile IP (MIP) et Proxy Mobile IP (PMIP), adoptent deux approches diamétralement opposées. Avec le premier protocole, ce sont l’usager et son terminal qui prennent entièrement en charge la relève. Même si cette approche permet la FMC, les opérateurs préfèrent plutôt garder le contrôle sur la prise de décision, afin de pouvoir optimiser leur réseau. En effet, avec MIP, beaucoup de messages de signalisation sont envoyés, ce qui gaspille des ressources réseaux, surtout au niveau de l’accès radio, la partie la plus précieuse du réseau. De plus, en ne sollicitant pas le réseau, le terminal ne prend pas nécessairement les meilleures décisions. Il peut donc basculer vers un réseau qui est plus chargé et qui ne garantit pas nécessairement ses exigences au niveau de la qualité de service. De ce fait, le protocole PMIP a été proposé. Son approche est exactement à l’opposé de celle de MIP, soit la mobilité qui est entièrement gérée par le réseau. De ce fait, la mobilité est masquée au niveau du terminal, qui pense toujours se trouver dans son réseau mère. Grâce à l’ajout de nouveaux nœuds dans le réseau, qui gèrent la mobilité à la place du terminal, on élimine la signalisation sur l’accès radio. De plus, les informations supplémentaires que le réseau détient lui permettront de prendre une meilleure décision. Par contre, le problème avec ce protocole est que, sans l’intervention du terminal, il lui est impossible de détecter toutes les situations de relèves. Dans plusieurs cas, le réseau fixe de l’opérateur est masqué par un réseau interne, par exemple un réseau WiFi, et la détection de ce réseau n’est possible que grâce à l’intervention du terminal. Ainsi, PMIP n’est pas un protocole qui se prête bien au déploiement de FMC. Le premier article, qui s’intitule « Client-Based Network-Assisted Mobile IPv6 », s’attaque donc à ce problème, en proposant un nouveau protocole, basé sur Mobile IP v6 (MIPv6), et qui introduit l’implication du réseau. Le résultat obtenu est un protocole hybride qui combine les avantages de MIPv6 et de Proxy Mobile IP v6 (PMIPv6). Pour s’y faire, deux étapes ont été nécessaires. La première consiste en une refonte du protocole MIPv6 qui, dans son état actuel, était difficile à modifier, à cause de ses spécifications qui sont lourdes. Le résultat de cette étape est un protocole beaucoup plus léger et offrant uniquement les fonctionnalités de base. Les autres fonctionnalités, telles que les mécanismes de sécurité, ont été séparées dans des modules. En deuxième lieu, un nouveau module a été proposé, qui introduit un nouveau nœud dans le réseau, capable de gérer la mobilité du terminal. Ainsi, la collaboration entre le terminal et ce nœud permet de réduire les messages de signalisation et d’optimiser les décisions au niveau des relèves, tout en offrant le support pour FMC. La deuxième problématique, sur laquelle la thèse porte, se trouve au niveau de la transparence de la relève entre les deux réseaux. On parle d’une relève qui est transparente si cette dernière n’engendre aucune interruption des services de l’usager. Par exemple, un appel en cours, qui est démarré sur le réseau cellulaire, ne doit pas être interrompu lorsque la connexion bascule sur le réseau local, et vice-versa. Les applications visées, par notre travail, sont les applications multimédia en temps réél, notamment IPTV et MobileTV (en mode télévision en direct). Ces applications emploient des protocoles de multidiffusion permettant l’envoi optimisé de données à partir d’une ou de plusieurs sources vers plusieurs destinataires, avec un nombre minimal de paquets. Le problème avec ces applications est que, lorsqu’une relève verticale survient (dans le cadre de FMC par exemple), la connexion est rompue et doit être réétablie. Ceci est dû au fait que le terminal change son adresse IP, ce qui le force à rejoindre ses services à partir de la nouvelle adresse. Cette déconnexion résulte en une perte de paquets, se traduisant par une interruption de l’application de l’usager. Le second article, qui s’intitule « Seamless handover for multicast Mobile IPv6 traffic », propose une solution à ce problème. Cette solution consiste en l’ajout d’un nouveau nœud, dans le réseau, dont le rôle est de mettre en tampon les paquets perdus, lors de la relève du terminal. Ainsi, lorsque ce dernier recouvre sa connectivité, il est en mesure de récupérer ces paquets auprès de ce nœud. L’application de l’usager se déroule alors sans interruption. La troisième problématique abordée dans cette thèse porte sur la planification des réseaux d’accès, afin de supporter les requis des applications multimédia au niveau du débit. Pour que la FMC soit réussie, il faut que le réseau local puisse supporter les débits nécessaires de l’application. Le réseau WiFi interne n’étant généralement pas un problème, la limitation se trouve plutôt au niveau de l’accès filaire. Afin d’augmenter les débits offerts, les opérateurs ont introduit la fibre optique dans leurs réseaux, complémentant ainsi les méthodes traditionnelles, tels les paires de cuivre torsadées et le câble coaxial. Ainsi, de nouvelles technologies optiques hybrides ont été proposées. Dans un contexte o`u une infrastructure est déjà existante, le choix d’une technologie hybride est très attrayant, car l’opérateur peut rentabiliser son investissement précédent, minimisant ainsi le coût de la mise à jour. Par contre, dans un environnement vierge, il n’existe pas d’infrastructure à réutiliser. Le consensus, dans un tel scénario, est que la meilleure technologie à déployer est celle qui n’emploie que des liens en fibre optique, car elle offre les meilleurs débits ainsi que la plus grande flexibilité au niveau de l’évolutivité. La différence, au niveau du coût, devient moins grande et n’est plus nécessairement le critère principal au niveau du choix de la technologie à déployer. Une des difficultés, qui compliquent la planification, est que ces réseaux sont souvent déployés par les opérateurs, en phases. La planification doit être alors dynamique et prendre en considération la nature évolutive de la demande des clients. Le troisième article, qui s’intitule « Dynamic Greenfield Fiber to the Home Planning », propose donc une modélisation dynamique du problème de planification des réseaux d’accès en fibre optique. Le résultat est un modèle mathématique linéaire, en nombres entiers, qui prend en entrée des paramètres, tels que les demandes des clients, et qui produit la planification minimisant le coût total du réseau et ce, sur plusieurs phases. Les résultats numériques obtenus en simulant notre modèle montrent sa supériorité par rapport aux méthodes séquentielles existantes.--------- ABSTRACT Multimedia applications have been gaining momentum and are finding their way into everyday life. Their popularity can be attributed to several factors, such as the diversification of content and services, ubiquitous access thanks to the mobility and nomadicity, as well as advances in architectures and protocols used to support their most demanding requirements. For example, what was once a simple phone call has morphed nowadays into a videoconference, allowing a dynamic number of users to participate. Another example of a multimedia application that gained popularity is IP TeleVision (IPTV), which is the technology that allows the transmission of live and on demand television, on IP networks. There also exists a mobile version, called Mobile IP TeleVision (MobileTV). From the operators’ point of view, the focus is put on the deployment of next generation networks. Wireless operators are therefore deploying fourth generation cellular technologies, such as 3GPP Long Term Evolution (LTE), while those offering wired connectivity are looking into fiber optical based networks, such as Fiber to the Home (FTTH). These new networks increase the rate offered, as well as reduce latency, which are two important criteria for the deployment of large-scale multimedia applications. However, despite these advances, there still exist several obstacles hindering the proper operation of multimedia applications. This thesis therefore focuses on three important issues in next generation networks, each of these subjects leading to a scientific article. The first two works deal with the issues of the Fixed-Mobile Convergence (FMC). This convergence is blurring the distinction between mobile and fixed networks. Among other things, it allows a user to have access to its services, both on the cellular network (LTE, for example) as well as on a local network (Wireless Fidelity (WiFi), for example). This is usually accomplished by equipping the user with a device with that can connect to both networks. The first issue raised in this thesis is about the decision of when to execute a handover. The two most popular mobility protocols, Mobile IP (MIP) and Proxy Mobile IP (PMIP), approach this problem with diametrically opposed views. With the first protocol, the decision is made by the user and his device. Although this approach allows for FMC, operators would much rather have complete control over the decision-making, in order to optimize their network. Indeed, with MIP, many signaling messages are sent, wasting valuable network resources, especially at the radio access, which is the most precious part of the network. Furthermore, by not involving the network, the decision taken by the device will not be necessarily optimal. It might request to switch to a more overloaded network, that cannot meet its demands of Quality of Service (QoS). For these reasons, the PMIP protocol was proposed. Its approach is the opposite of that of MIP, the mobility being managed entirely by the network. By doing so, the device is actually shielded from any aspect of the mobility, and is fooled into thinking that its always in its home network. This is possible by introducing new nodes in the networks that act on its behalf, which eliminates all signaling on the radio link. In addition, since the network is usually better suited to make the right decision, because of the additional information it holds, the mobility is optimized. However, the big issue that arises is that, without the intervention of the terminal, it is impossible to detect all the handover possibilities. In many cases, the operator’s fixed network is hidden by an internal network, usually a WiFi network, and the detection of the network is only possible with the help of the terminal. Thus, PMIP is not a protocol that is well suited to deploy FMC. The first article, entitled “Client-Based Network-Assisted Mobile IPv6”, therefore addresses this problem by proposing a new protocol based on Mobile IP v6 (MIPv6), in which we introduce the involvement of the network. The result is a hybrid protocol that draws upon the strength of MIPv6 and Proxy Mobile IP v6 (PMIPv6). To accomplish this, two steps were required. The first consisted of a complete overhaul of the MIPv6 protocol, as in its current state, it was near impossible to make any modifications, because of the complexity and heaviness of its specifications. The result is a much more lightweight protocol which provides only basic functionality. Other features, such as security mechanisms, were separated into modules. In the second step, we proposed a new module, which introduces a new node in the network that can handle the terminal mobility. Thus, the collaboration of the terminal and the new node reduces the signaling messages and optimizes the decisions for handing over, while still offering support for FMC. The second issue that this thesis tackles is the seamlessness of a handover between two networks. A handover is deemed seamless if it does not cause any disruption to the user’s services. For example, a call that is in progress on the cellular network should not be interrupted when the connection switches to a local network, and the same goes for the other way around. The applications targeted by our work are multimedia applications operating in real-time , such as IPTV and MobileTV (in live television mode). These applications employ multicast protocols that are optimized for the transmission of data from one or more sources to multiple receivers, while using the minimum number of packets required. The problem, however, with these applications is that when a vertical handover occurs (in the case of FMC, for example), the connection is lost and must be re-established. This is because the terminal changes its IP address, which forces it to rejoin the services from the new address. This disconnection results in a packet loss, which entails an interruption of the user application. The second article, entitled “Seamless handover for multicast Mobile IPv6 traffic”, proposes a solution to this problem. This is accomplished by introducing a new node in the network, whose role is to buffer the lost packets while the handover is occurring. Thus, when the device reconnects, it is able to recover these packets. The user application is therefore able to proceed without interruption. The third issue addressed in this thesis focuses on the planning of access networks, to support the high bandwidth required by multimedia applications. For the FMC to be successful, it is necessary that the local network supports the bandwidth requirements. The internal WiFi network is generally not an issue, the limitation rather lies in the wired network. To increase the offered rates, operators have started introducing fiber optic links in their networks, complementing the traditional links, such as twisted pair copper and coaxial cable. Thus, new hybrid optical technologies have been proposed. In a context where an infrastructure already exists, the choice of a hybrid technology is very attractive, because the operator can leverage its previous investment and minimize the cost of the upgrade. However, in a new environment, there is no infrastructure to reuse. Therefore, the consensus in such a scenario is that the best technology to deploy is the one that only uses fiber optic links, as it offers the best rates and the greatest scalability. The cost difference is smaller and therefore no longer the main criterion for selecting the technology to deploy. One of the difficulties of network planning is that these networks are often deployed by operators in phases. Therefore, the planning must be dynamic and take into account the changing nature of customer demands. The third article, entitled “Dynamic Greenfield Fiber to the Home Planning”, proposes a dynamic model for the network planning problem of fiber optic networks. The result is a linear integer mathematical model, which takes input parameters, such as customer demands, and produces a planning that minimizes the total cost of the network, over all of the phases. The numerical results obtained when simulating our solution show its superiority compared to existing sequential methods

Development, Characterization, and Analysis of Silicon Microstrip Detector Modules for the CBM Silicon Tracking System

The future Facility for Antiproton and Ion Research (FAIR) at GSI, Germany, will enable scientists to create tiny droplets of cosmic matter in the laboratory—matter subject to extreme conditions usually found in the interior of stars or during stellar collisions. The Compressed Baryonic Matter (CBM) experiment at FAIR aims to explore the quantum chromodynamics (QCD) phase diagram at high densities and moderate temperatures. By colliding heavy ions at relativistic beam energies, the conditions inside these supermassive objects can be recreated for an exceptionally short amount of time. The CBM detector is a fixed-target multi-purpose detector designed for measuring hadrons, electrons and muons in elementary nucleon and heavy-ion collisions over the full FAIR beam energy range delivered by the SIS100 synchrotron. One of the core detectors of CBM is the Silicon Tracking System (STS), responsible for measuring the momentum and tracks of up to 700 charged particles produced in a central nucleus-nucleus collisions. Due to the required momentum resolution, the material budget of the STS must be minimized. Therefore, the readout electronics and the cooling and mechanical infrastructure are placed out of the detector acceptance. The double-sided silicon microstrip sensors are connected to the self-triggering frontend electronics using low-mass flexible microcables with a length of up to 50 cm. The main goal of this thesis was to develop a high-density interconnection technology based on copper microcables. We developed a low-mass double-layered copper microcable at the edge of modern fabrication technology. Based on the copper microcable, we developed a novel high-density interconnection technology, comprising fine-grain solder paste printing on the microcable and gold stud bumping on the die. The gold stud--solder technology combines a high automation capability with good mechanical and electrical properties, making it an interesting technology also for future detector systems. Building on the gold stud--solder technology, a fully customized bonder machine was developed and constructed in hardware and software. Its main purpose is the realization of the challenging interconnection between the microcable and the sensor. Key components of the machine are four step motors with a sub-micron step resolution, a dual-camera pattern recognition system, a heatable, temperature-controlled bond head and sensor plate, as well as tailor-made mechanical supports for the STS detector modules. With the help of this bonder machine, a full-scale STS detector module in the copper technology was built. The noise performance of the copper module was evaluated in a bias voltage scan. Very low noise levels were observed. Measurements of the absolute value of the signal with a radioactive source allowed us to estimate the signal-to-noise ratio of the module. The results of these measurements give us confidence that STS modules based on the copper technology can achieve a satisfying performance comparable to the modules built in the aluminium technology. Another essential component of the STS detector module is the frontend electronics chip. During this work, the version 2.1 of the STS-XYTER readout ASIC was extensively characterized. Noise discrepancies between odd and even channels and increasingly higher noise towards the higher channel numbers had been observed in the predecessor chip. Our measurements of the STS-XYTER2.1 verified that both issues were successfully resolved. Furthermore, the noise behavior of the ASIC with respect to input load capacitance was studied. This is essential to parametrize expected noise levels for the many kinds of detector modules employed in the STS, to which the measured noise levels can then be compared. Measurements of the noise levels as a function of shaping time showed that the overall noise level is practically independent of shaper peaking time. Radiation tests with 50 MeV protons were performed with copper microcables connected to the ASIC in a non-powered state. No indications of damage to the chip and interconnects could be observed. Finally, a complete STS detector module in aluminium technology was subjected to a pencil-like monochromatic beam of 2.7 GeV/c protons at the Cooling Synchrotron at the research center Jülich. Several essential performance criteria of the detector module were evaluated. The best coincidence between the STS and the reference fiber hodoscopes was established based on time information. An excellent time resolution of a few nanoseconds could be demonstrated. Based on the best coincidence, the spatial resolution of the full system was determined to be a few hundred microns. This is in line with expectations, as the resolution is limited by the fiber hodoscope resolution. Charge distributions of 1-strip clusters showed a clear separation between the noise and the proton signal peak, with a signal-to-noise ratio above 20 for the p-- and n-side. The charge collection efficiency of the module was estimated to be $96 \%$. The COSY beamtime enabled a first-time evaluation of the full analysis software chain with real data and the evaluation of the full electronic readout chain of STS. The experience gained at COSY is immensely helpful for commissioning and data analysis in more complex beam environments such as mCBM, where a subsample of the CBM detectors is exposed to the particles created in a heavy-ion collision in run-time scenarios closely resembling the final CBM environment

Indigenous Life Projects and Extractivism

Exploring indigenous life projects in encounters with extractivism, the present open access volume discusses how current turbulences actualise questions of indigeneity, difference and ontological dynamics in the Andes and Amazonia. While studies of extractivism in South America often focus on wider national and international politics, this contribution instead provides ethnographic explorations of indigenous politics, perspectives and worlds, revealing loss and suffering as well as creative strategies to mediate the extralocal. Seeking to avoid conceptual imperialism or the imposition of exogenous categories, the chapters are grounded in the respective authors’ long-standing field research. The authors examine the reactions (from resistance to accommodation), consequences (from anticipation to rubble) and materials (from fossil fuel to water) diversely related to extractivism in rural and urban settings. How can Amerindian strategies to preserve localised communities in extractivist contexts contribute to ways of thinking otherwise

Rôle du cortex pariétal postérieur dans le processus d'intégration visuomotrice - connexions anatomiques avec le cortex moteur et activité cellulaire lors de la locomotion chez le chat

La progression d’un individu au travers d’un environnement diversifié dépend des informations visuelles qui lui permettent d’évaluer la taille, la forme ou même la distance et le temps de contact avec les obstacles dans son chemin. Il peut ainsi planifier en avance les modifications nécessaires de son patron locomoteur afin d’éviter ou enjamber ces entraves. Ce concept est aussi applicable lorsque le sujet doit atteindre une cible, comme un prédateur tentant d’attraper sa proie en pleine course. Les structures neurales impliquées dans la genèse des modifications volontaires de mouvements locomoteurs ont été largement étudiées, mais relativement peu d’information est présentement disponible sur les processus intégrant l’information visuelle afin de planifier ces mouvements. De nombreux travaux chez le primate suggèrent que le cortex pariétal postérieur (CPP) semble jouer un rôle important dans la préparation et l’exécution de mouvements d’atteinte visuellement guidés. Dans cette thèse, nous avons investigué la proposition que le CPP participe similairement dans la planification et le contrôle de la locomotion sous guidage visuel chez le chat. Dans notre première étude, nous avons examiné l’étendue des connexions cortico-corticales entre le CPP et les aires motrices plus frontales, particulièrement le cortex moteur, à l’aide d’injections de traceurs fluorescents rétrogrades. Nous avons cartographié la surface du cortex moteur de chats anesthésiés afin d’identifier les représentations somatotopiques distales et proximales du membre antérieur dans la partie rostrale du cortex moteur, la représentation du membre antérieur située dans la partie caudale de l’aire motrice, et enfin la représentation du membre postérieur. L’injection de différents traceurs rétrogrades dans deux régions motrices sélectionnées par chat nous a permis de visualiser la densité des projections divergentes et convergentes pariétales, dirigées vers ces sites moteurs. Notre analyse a révélé une organisation topographique distincte de connexions du CPP avec toutes les régions motrices identifiées. En particulier, nous avons noté que la représentation caudale du membre antérieur reçoit majoritairement des projections du côté rostral du sillon pariétal, tandis que la partie caudale du CPP projette fortement vers la représentation rostrale du membre antérieur. Cette dernière observation est particulièrement intéressante, parce que le côté caudal du sillon pariétal reçoit de nombreux inputs visuels et sa cible principale, la région motrice rostrale, est bien connue pour être impliquée dans les fonctions motrices volontaires. Ainsi, cette étude anatomique suggère que le CPP, au travers de connexions étendues avec les différentes régions somatotopiques du cortex moteur, pourrait participer à l’élaboration d’un substrat neural idéal pour des processus tels que la coordination inter-membre, intra-membre et aussi la modulation de mouvements volontaires sous guidage visuel. Notre deuxième étude a testé l’hypothèse que le CPP participe dans la modulation et la planification de la locomotion visuellement guidée chez le chat. En nous référant à la cartographie corticale obtenue dans nos travaux anatomiques, nous avons enregistré l’activité de neurones pariétaux, situés dans les portions des aires 5a et 5b qui ont de fortes connexions avec les régions motrices impliquées dans les mouvements de la patte antérieure. Ces enregistrements ont été effectués pendant une tâche de locomotion qui requiert l’enjambement d’obstacles de différentes tailles. En dissociant la vitesse des obstacles de celle du tapis sur lequel le chat marche, notre protocole expérimental nous a aussi permit de mettre plus d’emphase sur l’importance de l’information visuelle et de la séparer de l’influx proprioceptif généré pendant la locomotion. Nos enregistrements ont révélé deux groupes de cellules pariétales activées en relation avec l’enjambement de l’obstacle: une population, principalement située dans l’aire 5a, qui décharge seulement pendant le passage du membre au dessus del’entrave (cellules spécifiques au mouvement) et une autre, surtout localisée dans l’aire 5b, qui est activée au moins un cycle de marche avant l’enjambement (cellules anticipatrices). De plus, nous avons observé que l’activité de ces groupes neuronaux, particulièrement les cellules anticipatrices, était amplifiée lorsque la vitesse des obstacles était dissociée de celle du tapis roulant, démontrant l’importance grandissante de la vision lorsque la tâche devient plus difficile. Enfin, un grand nombre des cellules activées spécifiquement pendant l’enjambement démontraient une corrélation soutenue de leur activité avec le membre controlatéral, même s’il ne menait pas dans le mouvement (cellules unilatérales). Inversement, nous avons noté que la majorité des cellules anticipatrices avaient plutôt tendance à maintenir leur décharge en phase avec l’activité musculaire du premier membre à enjamber l’obstacle, indépendamment de sa position par rapport au site d’enregistrement (cellules bilatérales). Nous suggérons que cette disparité additionnelle démontre une fonction diversifiée de l’activité du CPP. Par exemple, les cellules unilatérales pourraient moduler le mouvement du membre controlatéral au-dessus de l’obstacle, qu’il mène ou suive dans l’ordre d’enjambement, tandis que les neurones bilatéraux sembleraient plutôt spécifier le type de mouvement volontaire requis pour éviter l’entrave. Ensembles, nos observations indiquent que le CPP a le potentiel de moduler l’activité des centres moteurs au travers de réseaux corticaux étendus et contribue à différents aspects de la locomotion sous guidage visuel, notamment l’initiation et l’ajustement de mouvements volontaires des membres antérieurs, mais aussi la planification de ces actions afin d’adapter la progression de l’individu au travers d’un environnement complexe.When progressing through a varied environment, an individual will depend on visual information to evaluate the size, shape or the distance and time to contact of objects in his path. This will allow him to plan in advance the gait requirements necessary to avoid or step over these obstacles. This concept is also applicable in situations where the subject must reach a target, as with a predator chasing down its prey. The neural structures involved in generating voluntary gait modifications during locomotion have been extensively studied, but relatively little information is available on the processes that integrate visual information to plan these movements. Numerous studies in the primate suggest that the posterior parietal cortex (PPC) plays an important role in the preparation and execution of visually-guided reaching movements. In this thesis, we investigated the proposition that the PPC is similarly involved in the planning and control of visually-guided locomotion in the cat. Our first study examined the extent of cortico-cortical connections between the PPC and the more frontal motor areas, particularly the motor cortex, using injections of fluorescent retrograde tracers. We mapped the cortical surface of anaesthetized cats to identify the somatotopical representations of the distal and proximal forelimb in the rostral portion of the motor cortex, the forelimb representation in the caudal motor area, and also the hindlimb representation. The injection of different tracers in two selected regions, for every cat, allowed us to visualize the density of divergent and convergent parietal projections to these motor sites. Our analysis revealed a distinct topographical organization of parietal connections with all of the identified motor regions. In particular, the caudal motor representation of the forelimb primarily received projections from the rostral bank of the parietal cortex, while the caudal portion of the PPC strongly projected to the rostral forelimb representation. The latter observation is particularly interesting, since the caudal bank of the PPC receives numerous visual inputs and its target, the rostral motor region, is well-known for its involvement in voluntary motor functions. Therefore, this study suggests that the PPC, through extensive connections with the different somatotopic representations of the motor cortex, could constitute an ideal neural substrate for processes such as inter- and intra-limb coordination, as well as the modulation of visually-guided voluntary movements. Our second study tested the hypothesis that the PPC participates in the modulation and planning of voluntary gait modifications during locomotion in the cat. Using the cortical mapping established in our anatomical study, we recorded the activity of parietal neurons, localized in parts of areas 5a and 5b which are known to project strongly towards motor regions involved in forelimb movements. These recordings were obtained during a locomotion task requiring the cat to step over several obstacles of different sizes. By dissociating the speed of the obstacles from that of the treadmill onto which the cat is walking, our experimental protocol also allows us to increase the importance of visual information from the obstacles and to separate it from the influx of proprioceptive influx generated during locomotion. Our recordings revealed two groups of parietal cells on the basis of their activity in relation with the step over the obstacle: one population, mostly localized in area 5a, discharged solely as the lead forelimb passed over the obstacle (step-related cells), and another group, mainly found in area 5b, that showed significant activity at least one step cycle before the gait modification (step-advanced cells). Additionally, we observed an increase of cell activity in these groups, but particularly in step-advanced cells, when the speed of the obstacles was dissociated from that of the treadmill, demonstrating the growing importance of visual information as the task’s difficulty is increased. Finally, a great number of step-related cells were found to discharge specifically in correlation with muscle activity in the contralateral forelimb, regardless of whether or not it led over the obstacle (limb-specific cells). Inversely, the majority of step-advanced neurons tended to maintain their discharge in phase with the leading limb during the gait modification, independently of its position in relation with the recording site (limb-independent cells). We suggest that this additional disparity indicates diversified functions in PPC activity. For example, limb-specific cells could be involved in modulating the movement of the contralateral forelimb over the obstacle, regardless of its order of passage, while limb-independent neurons could instead specify the type of voluntary movement required to overcome the obstacle. Together, our observations indicate that the PPC can potentially influence the activity of motor centers through extensive cortical networks, and contributes to different aspects of visually-guided locomotion, such as initiation and modulation of voluntary forelimb movements, as well as the planning of these gait modifications to allow an individual to walk through a complex environment