Gotowe bibliografie tematyczne / Pipeline datapath

Gotowa bibliografia na temat „Pipeline datapath”

Autor: Grafiati
Data publikacji: 25 maja 2024

Utwórz poprawne odniesienie w stylach APA, MLA, Chicago, Harvard i wielu innych

Wybierz rodzaj źródła:

Spis treści

Zobacz listy aktualnych artykułów, książek, rozpraw, streszczeń i innych źródeł naukowych na temat „Pipeline datapath”.

Przycisk „Dodaj do bibliografii” jest dostępny obok każdej pracy w bibliografii. Użyj go – a my automatycznie utworzymy odniesienie bibliograficzne do wybranej pracy w stylu cytowania, którego potrzebujesz: APA, MLA, Harvard, Chicago, Vancouver itp.

Możesz również pobrać pełny tekst publikacji naukowej w formacie „.pdf” i przeczytać adnotację do pracy online, jeśli odpowiednie parametry są dostępne w metadanych.

Artykuły w czasopismach na temat "Pipeline datapath"

1

Ravikumar, C. P., i V. Saxena. "TOGAPS: A Testability Oriented Genetic Algorithm For Pipeline Synthesis". VLSI Design 5, nr 1 (1.01.1996): 77–87. http://dx.doi.org/10.1155/1996/65320.

Pełny tekst źródła
Streszczenie:
In this paper, we describe TOGAPS, a Testability-Oriented Genetic Algorithm for Pipeline Synthesis. The input to TOGAPS is an unscheduled data flow graph along with a specification of the desired pipeline latency. TOGAPS generates a register-level description of a datapath which is near-optimal in terms of area, meets the latency requirement, and is highly testable. Genetic search is employed to explore a 3-D search space, the three dimensions being the chip area, average latency, and the testability of the datapath. Testability of a design is evaluated by counting the number of self-loops in the structure graph of the data path. Each design is characterized by a four-tuple consisting of (i) the latency and schedule information, (ii) the module allocation, (iii) operation-to-module binding, and (iv) value-to-register binding. Accordingly, we maintain the population of designs in a hierarchical manner. The topmost level of this hierarchy consists of the latency and schedule information, which together characterize the timing performance of the design. The middle level of the hierarchy consists of a number of allocations for a given latency/schedule duplet. The lowest level of the hierarchy consists of a number of bindings for a specific latency/schedule/ allocation. An initial population of designs is constructed from the given data flow graph using different latency cycles whose average latency is in the specified range. Multiple scheduling heuristics are used to generate schedules for the DFG. For each of the resulting scheduled data flow graphs, we decide on an allocation of modules and registers based on a lower bound estimated using the schedule and latency information. The operation-to-module binding and the value-to-register binding are then carried out. A fitness measure is evaluated for each of the resulting data paths; this fitness measure includes one component for each of the three search dimensions. Crossover and mutation operators are used to generate new designs from the current set of parent designs. The crossover operator attempts to combine the properties of two designs. The mutation operators include addition and deletion of pure delays before scheduling, as well as changes in the register and module allocation prior to binding. The genetic algorithm applies the rule of the survival of the fittest to obtain nearoptimal solution to the otherwise intractable problem of data path synthesis. We have implemented TOGAPS on a Sun/SPARC 10 and studied its performance on a number of benchmark examples. Results indicate that TOGAPS finds area-optimal datapaths for the specified latency cycle, while reducing the number of self-loops in the data path.
Style APA, Harvard, Vancouver, ISO itp.
2

Kingyens, Jeffrey, i J. Gregory Steffan. "The Potential for a GPU-Like Overlay Architecture for FPGAs". International Journal of Reconfigurable Computing 2011 (2011): 1–15. http://dx.doi.org/10.1155/2011/514581.

Pełny tekst źródła
Streszczenie:
We propose a soft processor programming model and architecture inspired by graphics processing units (GPUs) that are well-matched to the strengths of FPGAs, namely, highly parallel and pipelinable computation. In particular, our soft processor architecture exploits multithreading, vector operations, and predication to supply a floating-point pipeline of 64 stages via hardware support for up to 256 concurrent thread contexts. The key new contributions of our architecture are mechanisms for managing threads and register files that maximize data-level and instruction-level parallelism while overcoming the challenges of port limitations of FPGA block memories as well as memory and pipeline latency. Through simulation of a system that (i) is programmable via NVIDIA's high-levelCglanguage, (ii) supports AMD's CTM r5xx GPU ISA, and (iii) is realizable on an XtremeData XD1000 FPGA-based accelerator system, we demonstrate the potential for such a system to achieve 100% utilization of a deeply pipelined floating-point datapath.
Style APA, Harvard, Vancouver, ISO itp.
3

Lee, Y. H., M. Khalil-Hani i M. N. Marsono. "An FPGA-Based Quantum Computing Emulation Framework Based on Serial-Parallel Architecture". International Journal of Reconfigurable Computing 2016 (2016): 1–18. http://dx.doi.org/10.1155/2016/5718124.

Pełny tekst źródła
Streszczenie:
Hardware emulation of quantum systems can mimic more efficiently the parallel behaviour of quantum computations, thus allowing higher processing speed-up than software simulations. In this paper, an efficient hardware emulation method that employs a serial-parallel hardware architecture targeted for field programmable gate array (FPGA) is proposed. Quantum Fourier transform and Grover’s search are chosen as case studies in this work since they are the core of many useful quantum algorithms. Experimental work shows that, with the proposed emulation architecture, a linear reduction in resource utilization is attained against the pipeline implementations proposed in prior works. The proposed work contributes to the formulation of a proof-of-concept baseline FPGA emulation framework with optimization on datapath designs that can be extended to emulate practical large-scale quantum circuits.
Style APA, Harvard, Vancouver, ISO itp.
4

Kashima, Ryota, Ikki Nagaoka, Masamitsu Tanaka, Taro Yamashita i Akira Fujimaki. "64-GHz Datapath Demonstration for Bit-Parallel SFQ Microprocessors Based on a Gate-Level-Pipeline Structure". IEEE Transactions on Applied Superconductivity 31, nr 5 (sierpień 2021): 1–6. http://dx.doi.org/10.1109/tasc.2021.3061353.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
5

Alachiotis, Nikolaos, i Alexandros Stamatakis. "A Vector-Like Reconfigurable Floating-Point Unit for the Logarithm". International Journal of Reconfigurable Computing 2011 (2011): 1–12. http://dx.doi.org/10.1155/2011/341510.

Pełny tekst źródła
Streszczenie:
The use of reconfigurable computing for accelerating floating-point intensive codes is becoming common due to the availability of DSPs in new-generation FPGAs. We present the design of an efficient, pipelined floating-point datapath for calculating the logarithm function on reconfigurable devices. We integrate the datapath into a stand-alone LUT-based (Lookup Table) component, the LAU (Logarithm Approximation Unit). We extended the LAU, by integrating two architecturally independent, LAU-based datapaths into a larger component, the VLAU (vector-like LAU). The VLAU produces 2 results/cycle, while occupying the same amount of memory as the LAU. Under single precision, one LAU is 12 and 1.7 times faster than the GNU and Intel Math Kernel Library (MKL) implementations, respectively. The LAU is also 1.6 times faster than the FloPoCo reconfigurable logarithm architecture. Under double precision, one LAU is 20 and 2.6 times faster than the respective GNU and MKL functions and 1.4 times faster than the FloPoCo logarithm. The VLAU is approximately twice as fast as the LAU, both under single and double precision.
Style APA, Harvard, Vancouver, ISO itp.
6

Titus, Dr Anita. "Datapath Optimization in AES using Pipelined Architecture". International Journal for Research in Applied Science and Engineering Technology 8, nr 8 (31.08.2020): 940–44. http://dx.doi.org/10.22214/ijraset.2020.31056.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
7

Cekli, Serap, i Ali Akman. "Enhanced SPIHT Algorithm with Pipelined Datapath Architecture Design". Electrica 19, nr 1 (5.03.2019): 29–36. http://dx.doi.org/10.26650/electrica.2018.15101.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
8

Nabi, Syed Waqar, i Wim Vanderbauwhede. "Automatic Pipelining and Vectorization of Scientific Code for FPGAs". International Journal of Reconfigurable Computing 2019 (18.11.2019): 1–12. http://dx.doi.org/10.1155/2019/7348013.

Pełny tekst źródła
Streszczenie:
There is a large body of legacy scientific code in use today that could benefit from execution on accelerator devices like GPUs and FPGAs. Manual translation of such legacy code into device-specific parallel code requires significant manual effort and is a major obstacle to wider FPGA adoption. We are developing an automated optimizing compiler TyTra to overcome this obstacle. The TyTra flow aims to compile legacy Fortran code automatically for FPGA-based acceleration, while applying suitable optimizations. We present the flow with a focus on two key optimizations, automatic pipelining and vectorization. Our compiler frontend extracts patterns from legacy Fortran code that can be pipelined and vectorized. The backend first creates fine and coarse-grained pipelines and then automatically vectorizes both the memory access and the datapath based on a cost model, generating an OpenCL-HDL hybrid working solution for FPGA targets on the Amazon cloud. Our results show up to 4.2× performance improvement over baseline OpenCL code.
Style APA, Harvard, Vancouver, ISO itp.
9

Cappuccino, G., G. Cocorullo, P. Corsonello i S. Perri. "High speed self-timed pipelined datapath for square rooting". IEE Proceedings - Circuits, Devices and Systems 146, nr 1 (1999): 16. http://dx.doi.org/10.1049/ip-cds:19990271.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
10

Arató, Péter, lstván Béres, Andrzej Rucinski, Robert Davis i Roy Torbert. "A high-level datapath synthesis method for pipelined structures". Microelectronics Journal 25, nr 3 (maj 1994): 237–47. http://dx.doi.org/10.1016/0026-2692(94)90015-9.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
Więcej źródeł

Rozprawy doktorskie na temat "Pipeline datapath"

1

Cronquist, Darren C. "Reconfigurable pipelined datapaths /". Thesis, Connect to this title online; UW restricted, 1999. http://hdl.handle.net/1773/6988.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
2

Ait, Bensaid Samira. "Formal Semantics of Hardware Compilation Framework". Electronic Thesis or Diss., université Paris-Saclay, 2023. http://www.theses.fr/2023UPASG085.

Pełny tekst źródła
Streszczenie:
Les analyses statiques de pire temps d’exécution sont utilisées pour garantir les délais requis pour les systèmes critiques. Afin d’estimer des bornes précises sur ces temps d’exécution, ces analyses temporelles nécessitent des considérations sur la (micro)- architecture. Habituellement, ces modèles de micro-architecture sont construits à la main à partir des manuels des processeurs. Cependant, les initiatives du matériel libre et les langages de description de matériel de haut niveau (HCLs), permettent de réaborder la problématique de la génération automatique de ces modèles de micro-architecture, et plus spécifiquement des modèles de pipeline. Nous proposons un workflow qui vise à construire automatiquement des modèles de chemin de données de pipeline à partir de conceptions de processeurs décrites dans des langages de contruction de matériel (HCLs). Notre workflow est basé sur la chaine de compilation matériel Chisel/FIRRTL. Nous construisons au niveau de la représentation intermédiaire les modèles de pipeline du chemin de données. Notre travail vise à appliquer ces modèles pour prouver des propriétés liées à la prédictibilité temporelle. Notre méthode repose sur la vérification formelle. Les modèles générés sont ensuite traduits en modèles formels et intégrés dans une procédure existante basée sur la vérification de modèles pour détecter les anomalies de temps. Nous utilisons le langage de modélisation et de vérification TLA+ et expérimentons notre analyse avec plusieurs processeurs RISC-V open-source. Enfin, nous faisons progresser les études en évaluant l’impact de la génération automatique à l’aide d’une série de critères synthétiques
Static worst-case timing analyses are used to ensure the timing deadlines required for safety-critical systems. In order to derive accurate bounds, these timing analyses require precise (micro-)architecture considerations. Usually, such micro-architecture models are constructed by hand from processor manuals.However, with the open-source hardware initiatives and high-level Hardware Description Languages (HCLs), the automatic generation of these micro-architecture models and, more specifically, the pipeline models are promoted. We propose a workflow that aims to automatically construct pipeline datapath models from processor designs described in HCLs. Our workflow is based on the Chisel/FIRRTL Hardware Compiler Framework. We build at the intermediate representation level the datapath pipeline models. Our work intends to prove the timing properties, such as the timing predictability-related properties. We rely on the formal verification as our method. The generated models are then translated into formal models and integrated into an existing model checking-based procedure for detecting timing anomalies. We use TLA+ modeling and verification language and experiment with our analysis with several open-source RISC-V processors. Finally, we advance the studies by evaluating the impact of automatic generation through a series of synthetic benchmarks
Style APA, Harvard, Vancouver, ISO itp.
3

Pasca, Bogdan Mihai. "Calcul flottant haute performance sur circuits reconfigurables". Phd thesis, Ecole normale supérieure de lyon - ENS LYON, 2011. http://tel.archives-ouvertes.fr/tel-00654121.

Pełny tekst źródła
Streszczenie:
De plus en plus de constructeurs proposent des accélérateurs de calculs à base de circuits reconfigurables FPGA, cette technologie présentant bien plus de souplesse que le microprocesseur. Valoriser cette flexibilité dans le domaine de l'accélération de calcul flottant en utilisant les langages de description de circuits classiques (VHDL ou Verilog) reste toutefois très difficile, voire impossible parfois. Cette thèse a contribué au développement du logiciel FloPoCo, qui offre aux utilisateurs familiers avec VHDL un cadre C++ de description d'opérateurs arithmétiques génériques adapté au calcul reconfigurable. Ce cadre distingue explicitement la fonctionnalité combinatoire d'un opérateur, et la problématique de son pipeline pour une précision, une fréquence et un FPGA cible donnés. Afin de pouvoir utiliser FloPoCo pour concevoir des opérateurs haute performance en virgule flottante, il a fallu d'abord concevoir des blocs de bases optimisés. Nous avons d'abord développé des additionneurs pipelinés autour des lignes de propagation de retenue rapides, puis, à l'aide de techniques de pavages, nous avons conçu de gros multiplieurs, possiblement tronqués, utilisant des petits multiplieurs. L'évaluation de fonctions élémentaires en flottant implique souvent l'évaluation en virgule fixe d'une fonction. Nous présentons un opérateur générique de FloPoCo qui prend en entrée l'expression de la fonction à évaluer, avec ses précisions d'entrée et de sortie, et construit un évaluateur polynomial optimisé de cette fonction. Ce bloc de base a permis de développer des opérateurs en virgule flottante pour la racine carrée et l'exponentielle qui améliorent considérablement l'état de l'art. Nous avons aussi travaillé sur des techniques de compilation avancée pour adapter l'exécution d'un code C aux pipelines flexibles de nos opérateurs. FloPoCo a pu ainsi être utilisé pour implanter sur FPGA des applications complètes.
Style APA, Harvard, Vancouver, ISO itp.
4

Lu, Chin-Te, i 呂進德. "Area-Efficient Design and Implementation of Deep-Pipeline Latency Datapath". Thesis, 2008. http://ndltd.ncl.edu.tw/handle/22100268830966382822.

Pełny tekst źródła
Streszczenie:
碩士
國立交通大學
電子工程系所
97
Datapath is primarily the most critical element that affects performance. The allocations and design of datapath depends various application requirements. General speaking, for high-performance processors like Intel’s Pentium Processors, IBM’s Cell Processors and so on, the designers extremely rise up operating frequency by board VLSI techniques. On the contrary, such as lightweight applications in the embedded system, the goal of datapath design is to seek low-power, small chip area and so on. The instruction set architecture (ISA) has different ways of implementation for different application requirements. Therefore, this thesis proposes the design flow to automatically generate the area-efficient datapath for various application requirements. The area-efficient datapath generator includes the two-phased including spatial-optimized and temporal-optimized for datapath optimization. It can systematically develop and optimize datapth of the processors while leveraging the instruction set architecture (ISA) of high performance processor like IBM’s Cell and the software toolchain and application programs. Spatial-optimized means that efficient utilization in spatial domain including function modeling and cycle-accurate design. In other phase, temporal-optimization explores the instruction latency to systematically build up mathematical formulation to get the optimal micro-architecture. We take the Cell synergistic processor unit (SPU) as our datapath design example to analyze the optimization space of SPU ISA implementation, and find the area-efficient micro-architecture by using our proposed design flow. In the experiment, the micro-architecture by using our proposed design flow improves about 15-20% of area compared to using CAD tools for datapath design of embedded processors targeted 100MHz to 800MHz. Finally, we use the previous design flow to implement the SPU DSP in the UMC 90nm 1P9M CMOS process. The silicon area is 2.5mm x 2.5mm and the clock rate is 400MHz.
Style APA, Harvard, Vancouver, ISO itp.
5

Lin, Sheng-Hsun, i 林聖勳. "A Single Pipeline Datapath Design for Joinable Narrow-operand Operations". Thesis, 2006. http://ndltd.ncl.edu.tw/handle/64738928061451413217.

Pełny tekst źródła
Streszczenie:
碩士
國立交通大學
資訊科學與工程研究所
94
Most general-purpose processors and embedded processors have 32-bit word widths or wider. However, integer operations rarely need the full 32-bit dynamic range of the datapath. If we partition the operand bus, result bus, and ALU into several blocks, the datapath could perform more than one operation in parallel. In this thesis, mechanisms to join two narrow-operand operations together to share a single datapath are proposed. We proposed one novel ALU-sharing scheme by turning around operation-block ordering. Efficient designs to merge operands to share buses and ALU based on the technique are proposed and discussed. Compared with traditional “shift” approach, the turnaround approach has many advantages on area and delay. Besides, a technique to mitigate the delay overhead of the partitioned ALU by swapping operands is proposed. We also made performance simulation to help decide how to partition the datapath. Finally, how to integrate such datapath into a MIPS five-stage pipeline and required modifications are discussed.
Style APA, Harvard, Vancouver, ISO itp.
6

Vlad, Ciubotariu. "Automatic Datapath Abstraction Of Pipelined Circuits". Thesis, 2011. http://hdl.handle.net/10012/5804.

Pełny tekst źródła
Streszczenie:
Pipelined circuits operate as an assembly line that starts processing new instructions while older ones continue execution. Control properties specify the correct behaviour of the pipeline with respect to how it handles the concurrency between instructions. Control properties stand out as one of the most challenging aspects of pipelined circuit verification. Their verification depends on the datapath and memories, which in practice account for the largest part of the state space of the circuit. To alleviate the state explosion problem, abstraction of memories and datapath becomes mandatory. This thesis provides a methodology for an efficient abstraction of the datapath under all possible control-visible behaviours. For verification of control properties, the abstracted datapath is then substituted in place of the original one and the control circuitry is left unchanged. With respect to control properties, the abstraction is shown conservative by both language containment and simulation. For verification of control properties, the pipeline datapath is represented by a network of registers, unrestricted combinational datapath blocks and muxes. The values flowing through the datapath are called parcels. The control is the state machine that steers the parcels through the network. As parcels travel through the pipeline, they undergo transformations through the datapath blocks. The control- visible results of these transformations fan-out into control variables which in turn influence the next stage the parcels are transferred to by the control. The semantics of the datapath is formalized as a labelled transition system called a parcel automaton. Parcel automata capture the set of all control visible paths through the pipeline and are derived without the need of reachability analysis of the original pipeline. Datapath abstraction is defined using familiar concepts such as language containment or simulation. We have proved results that show that datapath abstraction leads to pipeline abstraction. Our approach has been incorporated into a practical algorithm that yields directly the abstract parcel automaton, bypassing the construction of the concrete parcel automaton. The algorithm uses a SAT solver to generate incrementally all possible control visible behaviours of the pipeline datapath. Our largest case study is a 32-bit two-wide superscalar OpenRISC microprocessor written in VHDL, where it reduced the size of the implementation from 35k gates to 2k gates in less than 10 minutes while using less than 52MB of memory.
Style APA, Harvard, Vancouver, ISO itp.
7

Hsiao, Pi-Chen, i 蕭丕承. "Efficient Datapath Design for Clustered & Pipelined VLIW DSP Processors". Thesis, 2005. http://ndltd.ncl.edu.tw/handle/24419684455805579987.

Pełny tekst źródła
Streszczenie:
碩士
國立交通大學
電子工程系所
94
Most DSP applications feature a high degree of data-level and instruction-level parallelism, which enables efficient datapath design with clustering and deep pipelining. However, the ad-hoc data forwarding and inter-cluster communications in most processors significantly compensate the advantages. This thesis presents analytical formulae which are based on cell-based implementation with flip-flops and multiplexers to analyze the complexity of forwarding unit and inter-cluster communication mechanisms. We also propose a complexity-aware data forwarding architecture and a simple inter-cluster communication mechanism based on load/store instruction pairs. Moreover, we introduce the distributed & ping-pong register file to further reduce the complexity of register file inside clusters. In the experiments with UMC 0.13um 1P8M CMOS technology, our proposed forwarding architecture can improve cycle time by 13.2%, while the distributed ping-pong register file collocated with proposed inter-cluster communication mechanism can reduce the area and access time of register file by 76.8% and 46.9%. For portable applications, we bring up the folded datapath with binary compatibility which saves 55.33% area and increases the clock speed by 26.3%. Finally, we implement the proposed forwarding unit and the proposed inter-cluster communication mechanism with distributed & ping-pong register file organization in a complete 4-way VLIW DSP processor which can operate at 333MHz and shows comparable performance with state-of-the-art DSPs.
Style APA, Harvard, Vancouver, ISO itp.

Książki na temat "Pipeline datapath"

1

Tamás, Visegrády, i Jankovits István, red. High level synthesis of pipelined datapaths. Chichester, [England]: Wiley, 2001.

Znajdź pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
2

Péter Arató, Tamás Visegrády i István Jankovits. High Level Synthesis of Pipelined Datapaths. Wiley, 2001.

Znajdź pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.

Części książek na temat "Pipeline datapath"

1

Ebeling, Carl, Darren C. Cronquist i Paul Franklin. "RaPiD — Reconfigurable pipelined datapath". W Lecture Notes in Computer Science, 126–35. Berlin, Heidelberg: Springer Berlin Heidelberg, 1996. http://dx.doi.org/10.1007/3-540-61730-2_13.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.

Streszczenia konferencji na temat "Pipeline datapath"

1

Nurvitadhi, Eriko, James C. Hoe, Shih-Lien L. Lu i Timothy Kam. "Automatic multithreaded pipeline synthesis from transactional datapath specifications". W the 47th Design Automation Conference. New York, New York, USA: ACM Press, 2010. http://dx.doi.org/10.1145/1837274.1837356.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
2

Asato, C., C. Ditzen i S. Dholakia. "A datapath multiplier with automatic insertion of pipeline stages". W 1989 Proceedings of the IEEE Custom Integrated Circuits Conference. IEEE, 1989. http://dx.doi.org/10.1109/cicc.1989.56815.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
3

Isshiki, Tsuyoshi, Takenobu Shimizugashira, Akihisa Ohta, Imanuddin Amril i Hiroaki Kunieda. "A new FPGA architecture for high-performance bit-serial pipeline datapath (abstract)". W the 1998 ACM/SIGDA sixth international symposium. New York, New York, USA: ACM Press, 1998. http://dx.doi.org/10.1145/275107.275147.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
4

Istoan, Matei, i Florent de Dinechin. "Automating the pipeline of arithmetic datapaths". W 2017 Design, Automation & Test in Europe Conference & Exhibition (DATE). IEEE, 2017. http://dx.doi.org/10.23919/date.2017.7927080.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
5

Kikkeri, N., i P. M. Seidel. "Formal co-verification of pipelined datapaths". W 48th Midwest Symposium on Circuits and Systems, 2005. IEEE, 2005. http://dx.doi.org/10.1109/mwscas.2005.1594050.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
6

Cronquist, D. C., C. Fisher, M. Figueroa, P. Franklin i C. Ebeling. "Architecture design of reconfigurable pipelined datapaths". W Proceedings 20th Anniversary Conference on Advanced Research in VLSI. IEEE, 1999. http://dx.doi.org/10.1109/arvlsi.1999.756035.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
7

Sergiyenko, Anatoliy, Anastasia Serhienko i Vitaliy Romankevich. "Genetic Programming of Pipelined Datapaths for FPGA". W 2020 IEEE 40th International Conference on Electronics and Nanotechnology (ELNANO). IEEE, 2020. http://dx.doi.org/10.1109/elnano50318.2020.9088773.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
8

Hanoun, Abdulrahman, Henning Manteuffel, F. Mayer-Lindenberg i Wjatscheslaw Galjan. "Architecture of a Pipelined Datapath Coarse-Grain Reconfigurable Coprocessor Array". W 2007 IEEE International Conference on Signal Processing and Communications. IEEE, 2007. http://dx.doi.org/10.1109/icspc.2007.4728448.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
9

Passaretti, Daniele, i Thilo Pionteck. "Configurable Pipelined Datapath for Data Acquisition in Interventional Computed Tomography". W 2021 IEEE 29th Annual International Symposium on Field-Programmable Custom Computing Machines (FCCM). IEEE, 2021. http://dx.doi.org/10.1109/fccm51124.2021.00044.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
10

McGraw, Robert, James H. Aylor i Robert H. Klenke. "A top-down design environment for developing pipelined datapaths". W the 35th annual conference. New York, New York, USA: ACM Press, 1998. http://dx.doi.org/10.1145/277044.277105.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
Możesz być także zainteresowany rozszerzonymi bibliografiami na temat „Pipeline datapath” dla poszczególnych typów źródeł:
Artykuły w czasopismach
Oferujemy zniżki na wszystkie plany premium dla autorów, których prace zostały uwzględnione w tematycznych zestawieniach literatury. Skontaktuj się z nami, aby uzyskać unikalny kod promocyjny!

Do bibliografii