Search 250 million research papers

Hardware Implementation

Peter W. Becker · 1974

Cited by 0

Hardware implementation

W. E. Donath · 1968

The area of hardware implementation shall be (some-what arbitrarily) defined to include placement, wire routing, terminal assignment, and the interface to hardware fabrication devices. At this stage, many companies have automated at least some of these steps. In the first three areas, we encounter problems which must be solved by analysis into sub-problems and by development of algorithms; in the last area, we are faced with the problem of developing a convenient means of man-machine communication. LSI Mask Design, for which various systems were developed over the last few years, falls into the latter area.

Cited by 4

Hardware Implementation

Yang Yang · 2019

Cited by 5

Hardware implementation.

Ariel Burman (20329776), Jordi Solé-Casals (20329779), Sergio E. Lew (4683736) · Figshare · 2024

<p>The buffer is divided in three section: left(lower)-side, middle(median) and right(high)-side. Cells from same section have same combinational logic circuit which controls the multiplexer.</p>

Cited by 0Open access

Hardware Implementation

M. Padmanabhan, Ken Martin, G. Péceli · Kluwer international series in engineering and computer science · 1996

Cited by 1

Hardware Implementation

Peter W. Becker · 1978

Cited by 0

Hardware Implementation

W.E. Alexander, Cranos Williams · Digital Signal Processing · 2017

Cited by 3

Hardware Implementation

Brian P. Bailey, Grant Martín, Andrew Piziali · Elsevier eBooks · 2007

Cited by 0

Hardware implementation

Pascal Gautron · 2007

Article Hardware implementation Share on Author: Pascal Gautron France Telecom R&D Rennes France France Telecom R&D Rennes FranceView Profile Authors Info & Claims SIGGRAPH '07: ACM SIGGRAPH 2007 coursesAugust 2007 Pages 8–eshttps://doi.org/10.1145/1281500.1281623Online:05 August 2007Publication History 0citation12DownloadsMetricsTotal Citations0Total Downloads12Last 12 Months0Last 6 weeks0 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteGet Access

Cited by 0

Hardware Chess Implementation

Zajíc, Roman · Brno University of Technology Digital Library (Brno University of Technology) · 2020

Tato práce se zabývá návrhem a následnou výrobou elektronické šachovnice. Důraz byl kladen na to, aby výsledná šachovnice byla co nejvíce podobná klasickým šachovým deskám. Zejména, aby co nejméně omezovala hráče při hře. K ovládání šachovnice slouží modul hodin, který kromě přepínače času obsahuje i displej a ovládací klávesy. Jako hlavní kontrolér této desky slouží WeMos R1 mini v kombinaci se třemi Arduiny Nano. Dvě z těchto Arduin slouží k detekci šachových figur a signalizaci na samotné šachovnici. Třetí Arduino slouží k ovládání šachových hodin a úpravám nastavení šachovnice.

Cited by 0Open access

ZFP Hardware Implementation

G. Lloyd, Peter Lindström · OSTI OAI (U.S. Department of Energy Office of Scientific and Technical Information) · 2020

As core counts increase in new HPC systems with comparatively little increase in memory bandwidth, the trend is an effective decrease in memory bandwidth per core. Other bandwidth limitations in HPC systems exist between CPU and GPU memory, between system nodes, and between node memory and storage. Compression of floating-point data has the potential to reduce data movement and pressure across these communication channels. Furthermore, it has the potential to reduce the footprint of floating-point arrays stored in memory. ZFP, implemented in software, is gaining traction as an effective method in floating-point compression; however, performance gains are limited to the spare compute cycles available before reaching the bandwidth limitations of the communication channel. A hardware implementation of ZFP has the potential to raise the bar on performance. From the inception of ZFP, it was designed to accommodate a hardware implementation.

Cited by 0Open access

Hardware implementation architectures

Cambridge University Press eBooks · 2013

In this chapter we investigate hardware implementation of the DDS, sinusoidal and arbitrary waveform generation techniques presented in earlier chapters. We do not concern ourselves with specific target technologies such as FPGAs, but restrict our signal flow descriptions to the ‘register transfer level’ (RTL). The exact implementation technology (e.g. FPGA, ASIC or even hardwired logic) and the partitioning between hardware and embedded software are left to the suitably skilled reader and his or her application-specific requirements. For the most part, implementation of these algorithms, particularly in wide bandwidth applications, is best handled in high speed FPGA or ASIC logic. It is intended that this chapter will impart sufficient architectural detail to enable adaptation to any particular implementation technology.

Cited by 0

Hardware Implementation of Ciphers

Hari Priya Machiraju · 2008

With the rapid growth in computer systems and electronic communications using virtual networks, the demand for a secure encryption has increased and with it the demand for high performance hardware implementations of the cryptographic algorithms. This paper studies the performances of different hardware implementations of cryptographic algorithms present in literature so far, placing emphasis mostly on DES and Rijndael. This aim of the paper is to gain an understanding of the different techniques used in the hardware implementation of the different cryptographic algorithms as well as the optimizations done in speed and throughput. It also discusses a new idea for implementing DES as well as Triple DES making use of afore mentioned designs. I.

Cited by 0

FBRC converter hardware implementation.

M. Zakir Hossain (6033752), Jeyraj A/L Selvaraj (19429354), N. A. Rahim (6033758) · Figshare · 2024

<div><p>High conversion ratio dc-dc converters have received significant attention in renewable energy systems, primarily due to their necessary high-gain characteristics. This research proposes a high step-up ratio full-bridge resonant cascaded (FBRC) dc-dc converter designed for use in photovoltaics (PV), fuel cells (FC), electric vehicles (EV), and other low-voltage output energy sectors to achieve high voltage gain. This converter contains a full-bridge cell with a boost input inductor, a diode-capacitor cascaded stage that replaces the transformer as a voltage multiplier and an inductor-capacitor (LC) parallel-series resonant network across the FB terminal. One of the strategic features of the converter is its high voltage step-up characteristic combined with lower duty cycle operation that limits the maximum current through the active devices, making it particularly suitable for systems that generate low output voltage. In addition, zero-voltage switching (ZVS) is achieved during the turn-off and turn-on operation of the FB switches from 25% to full load, thereby lessening the switching losses. Moreover, the diminished necessity for passive components and the decreased voltage stress on both active and passive devices lead to the use of smaller and more cost-effective components. The theoretical analysis of the proposed converter is validated using a 500 W laboratory-scale prototype wherein high-performance SiC-based MOSFETs have been utilized as switching devices. It offers reduced ripples, with input current ripple at 5% and output voltage ripple at 0.76%. When the load is 400 W and 60 V as the input voltage, the maximum efficiency is found 95.8% at 400 V output voltage. The proposed dc-dc converter, with its high voltage gain and reduced component stress, shows significant promise for application in renewable energy systems.</p></div>

Cited by 0Open access

Hardware Design and Implementation

Hani Saleh, Nourhan Bayasi, Baker Mohammad et al. · Analog circuits and signal processing/Analog circuits and signal processing series · 2017

Cited by 1

Hardware implementation of habituation

Ting Wang, L.A. Akers · 2002

Habituation is a biological behavior allowing non-critical information to be disregarded enabling more processing resources for critical tasks. We have implemented habituation adaptation in VLSI. Our simulations and experimental results illustrate the habituation response.

Cited by 4

ECDSA (Secp256k1) Hardware Implementation

Yasuhiro Atsuhiko · 2023

Yasuhiro implemented ECDSA (Secp256k1) signing hardware design in Verilog with sidechannel resistance.ECDSA is an essential digital signature protocol for blockchain because the signature length is only 512 bits and it's secure.Hardwear implementation of ECDSA is a conventional idea, however, most papers don't show their codes and have no reproducibility.Yasuhiro follows the basics of ECDSA design methodology, creates ECDSA code from scratch, and uploads it with a clear description on GitHub for hardware learners.

Cited by 1Open access

Hardware Implementation for Cryptography

Sakhybay Tynymbaev, Rat Berdibaev, Timur Namazbaev et al. · 2026

Today, cryptography is one of the fundamental methods of information protection within the critical infrastructure of the state. Symmetric algorithms are quite fast, but their main disadvantage lies in the challenge of secure key distribution. Asymmetric cryptography solves this problem, but its algorithms are not as fast (by 2–3 orders of magnitude) as the symmetric ones. Slow algorithms, even if they are cryptographically robust, limit practical applications, especially where performance, latency, and resource efficiency are important (e.g., in critical infrastructure). Therefore, when choosing a crypto algorithm, it is important to consider not only its security but also its speed as a key factor in system adaptability and efficiency. This chapter considers the circuit solution of the device of modular number squaring, where, at each step, two digits of the squared number are analyzed. For this purpose, the device includes residue formers and a multiplier that operates on a pair of digits using partial modulo residues. The developed device can be included in the block of encryption and decryption of data of cryptosystems with a public key (systems RSA, El-Gamal, Fiat–Shamir, Schnorr, Okamoto, etc.) to increase their speed of operation.

Cited by 0

Handwashing hardware implementation imperatives

Stephen Harries · Loughborough University Institutional Repository (Loughborough University) · 2005

This paper considers ways that the practice of handwashing can be implemented in a community or family context. Given\nthat handwashing has proven to be an effective barrier against diarrhoeal disease and respiratory infections and that\npeople are particularly vulnerable to these diseases in low-income communities, it is vital that this practice is implemented.\nYet little work has focused on implementation of the practise at a grass roots level. The paper further discusses\nwhy handwashing is difficult to implement and proposes a technical solution that may enable handwashing to be more\naccessible, convenient and possible.

Cited by 0Open access

Hardware Implementation Low Power

High Speed, Fft Core, I Kannan et al. · 2007

Abstract: In recent times, DSP algorithms have received increased attention due to rapid advancements in multimedia computing and high-speed wired and wireless communications. In response to these advances, the search for novel implementations of arithmetic-intensive circuitry has intensified. For the portability requirement in telecommunication systems, there is a need for low power hardware implementation of fast fourier transforms algorithm. This paper proposes the hardware implementation of low power multiplier-less radix-4 single–path delay commutator pipelined fast fourier transform processor architecture of sizes 16, 64 and 256 points. The multiplier-less architecture uses common sub-expression sharing to replace complex multiplications with simpler shift and add operations. By combining a new commutator architecture and low power butterfly architecture with this approach power reduction is achieved. When compared with a conventional fast fourier transform architecture based on non-booth coded wallace tree multiplier the power reduction in this implementation is 44% and 60 % for 64-point and 16-point radix-4 fast fourier transforms respectively. The power dissipation is estimated using cadence RTL compiler. The operating frequencies are 166 MHz and 200 MHz, for 64 point and 16 point fast fourier transforms, respectively. Our implementation of the 256 point FFT architecture consumes 153 mw for an operating speed of 125 MHz.

Cited by 0