Multiplexeur

Résumé

Un multiplexeur (abréviation : MUX) est un circuit permettant de concentrer sur une même voie de transmission différents types de liaisons (informatique, télécopie, téléphonie, télétex) en sélectionnant une entrée parmi N. Il possédera donc une sortie et N entrées, ainsi qu'une entrée de commande de log2 N bits permettant de choisir quelle entrée sera sélectionnée. Il sert d'accès aux réseaux de transmission de données numériques ou analogiques, cependant grâce à la convergence numérique la plupart des signaux peuvent être convertis sous forme numérique ce qui simplifie les transmissions (par exemple les lignes téléphoniques peuvent être utilisées non seulement pour transmettre la parole, mais aussi des données informatiques ou la télévision). Table de vérité L'entrée A ou B est propagée sur la sortie Z suivant la valeur de S0. Représentation schématique Le schéma ci-joint montre comment 2 entrées peuvent être multiplexées pour passer dans le même canal. U

Source officielle

https://fr.wikipedia.org/wiki/Multiplexeur

À propos de ce résultat

Cette page est générée automatiquement et peut contenir des informations qui ne sont pas correctes, complètes, à jour ou pertinentes par rapport à votre recherche. Il en va de même pour toutes les autres pages de ce site. Veillez à vérifier les informations auprès des sources officielles de l'EPFL.

Publications associées (10)

Publications associées

Chargement

Personnes associées

Chargement

Unités associées

Chargement

Concepts associés (13)

Concepts associés

Chargement

Cours associés (12)

Cours associés

Chargement

Séances de cours associées (29)

Séances de cours associées

Chargement

Resource Sharing in Dataflow Circuits

Andrea Guerrieri, Paolo Ienne, Lana Josipovic, Axel Marmet

To achieve resource-efficient hardware designs, HLS tools share (i.e., time-multiplex) functional units among operations of the same type. This optimization is typically performed together with operation scheduling to ensure the best possible unit usage at each point in time. Dataflow circuits have emerged as an alternative HLS approach to efficiently handle irregular and control-dominated code. Yet, these circuits do not have a predetermined schedule-in its absence, it is challenging to determine which operations can share a functional unit without a performance penalty. Furthermore, although sharing seems to imply only some trivial circuitry, time-multiplexing units in dataflow circuits may cause deadlock by blocking certain data transfers and preventing operations from executing. In this paper, we present a technique to automatically identify performance-acceptable resource sharing opportunities in dataflow circuits and we describe a sharing mechanism that achieves deadlock-free dataflow designs. On benchmarks obtained from C code, we show that our approach effectively implements resource sharing: it results in significant area savings (i.e., a DSP reduction of up to 81%) compared to dataflow circuits which do not support this feature and matches the sharing capabilities of a state-of-the-art HLS tool.

IEEE2022

Chargement

In this work we analyze the architecture of real urban mobility networks from the multiplex perspective. In particular, based on empirical data about the mobility patterns in the cities of Bogot'a and Medell'{\i}n, each city is represented by six multiplex networks, each one representing the origin-destination trips performed by a subset of the population corresponding to a particular socioeconomic status. The nodes of each multiplex are the different urban locations whereas links represent the existence of a trip from one node (origin) to another (destination). On the other hand, the different layers of each multiplex correspond to the different existing transportation modes. By exploiting the characterization of multiplex transportation networks combining different transportation modes, we aim at characterizing the mobility patterns of each subset of the population. Our results show that the socioeconomic characteristics of the population have an extraordinary impact in the layer organization of these multiplex systems.

Springer2014

Chargement

Significance: Despite recent developments in microscopy, temporal aliasing can arise when imaging dynamic samples. Modern sampling frameworks, such as generalized sampling, mitigate aliasing but require measurement of temporally overlapping and potentially negative-valued inner products. Conventional cameras cannot collect these directly as they operate sequentially and are only sensitive to light intensity. Aim: We aim to mitigate aliasing in microscopy of dynamic monochrome samples by implementing generalized sampling via the use of a color camera and modulated color illumination. Approach: We solve the overlap problem by spectrally multiplexing the acquisitions and using (positive) B-spline segments as projection kernels. Reconstruction involves spectral unmixing and inverse filtering. We implemented this method using a color LED illuminator. We evaluated its performance by imaging a rotating grid and its applicability by imaging the beating zebrafish embryo heart in transmission and light-sheet microscopes. Results: Compared to stroboscopic imaging, our method mitigates aliasing with performance improving as the projection order increases. The approach can be implemented in conventional microscopes but is limited by the number of available LED colors and camera channels. Conclusions: Generalized sampling can be implemented via color modulation in microscopy to mitigate temporal aliasing. The simple hardware requirements could make it applicable to other optical imaging modalities. (C) The Authors.

SPIE-SOC PHOTO-OPTICAL INSTRUMENTATION ENGINEERS2020

Chargement