hardware resource
Recently Published Documents


TOTAL DOCUMENTS

117
(FIVE YEARS 43)

H-INDEX

8
(FIVE YEARS 1)

Author(s):  
B Murali Krishna ◽  
◽  
B.T. Krishna ◽  
K Babulu ◽  
◽  
...  

A comparison of linear and quadratic transform implementation on field programmable gate array (FPGA) is presented. Popular linear transform namely Stockwell Transform and Smoothed Pseudo Wigner Ville Distribution (SPWVD) transform from Quadratic transforms is considered for the implementation on FPGA. Both the transforms are coded in Verilog hardware description language (Verilog HDL). Complex calculations of transformation are performed by using CORDIC algorithm. From FPGA family, Spartan-6 is chosen as hardware device to implement. Synthetic chirp signal is taken as input to test the both designed transforms. Summary of hardware resource utilization on Spartan-6 for both the transforms is presented. Finally, it is observed that both the transforms S-Transform and SPWVD are computed with low elapsed time with respect to MATLAB simulation.


2022 ◽  
Vol 6 ◽  
pp. 857-876
Author(s):  
Yin Sheng Zhang ◽  

Purpose–This study is to explore a way toretainthe strengths and eliminatethe weaknesses of the existingarchitecture oflocal OS and cloud OS,then create an innovativeone, which is referredto as semi-network OS architecture.Method–The elements of semi-network OS architecture includes networkresources, localresources, and semi-mobile hardware resources; among them, networkresources are the expanded portionof OS, which is used to ensure the scalability of OS; local resources are the base portion of OS, which is used to ensure the stability of local computing, as well as the autonomy of user operations; the semi-mobile hardware resource is OSPU, which is used to ensure the positioning and security of dataflow.Results–Thefat client OS relies on the network shared resources,local exclusive resources,and semi-mobilehardware resources (OSPU), not relies solely on a single resource, to perform its tasks on a fat client, in thisarchitecture, most of the system files of OS on a fat client isderived from OS server, which is a network shared resources, and the rest of system files of OS is derived from OSPUof a fat client, which is a non-network resource, so the architecture of OShas "semi-network" attribute, wherein the OSPU is a key subordinate component for data processing and security verification,the OS server is a storage place rather than operating a placeof system files, and system files that stored on a server can only be downloaded to a fat client to carry out their mission.Conclusion–A complete OS is divided into base portion and expanded portion, and this "portion" division of OS enables a fat client to be dually supported by remote network resources and local non-network resources, therefore, it is expected to make a fat client more flexible, safer and more reliable, and more convenient to be operated.


Electronics ◽  
2021 ◽  
Vol 10 (23) ◽  
pp. 3039
Author(s):  
Zhao Huang ◽  
Liang Li ◽  
Yin Chen ◽  
Zeyu Li ◽  
Quan Wang ◽  
...  

With the advancement of the Internet of Things (IoTs) technology, security issues have received an increasing amount of attention. Since IoT devices are typically resource-limited, conventional security solutions, such as classical cryptography, are no longer applicable. A physically unclonable function (PUF) is a hardware-based, low-cost alternative solution to provide security for IoT devices. It utilizes the inherent nature of hardware to generate a random and unpredictable fingerprint to uniquely identify an IoT device. However, despite existing PUFs having exhibited a good performance, they are not suitable for effective application on resource-constrained IoT devices due to the limited number of challenge-response pairs (CRPs) generated per unit area and the large hardware resources overhead. To solve these problems, this article presents an ultra-lightweight reconfigurable PUF solution, which is named RPPUF. Our method is built on pico-PUF (PPUF). By incorporating configurable logics, one single RPPUF can be instantiated into multiple samples through configurable information K. We implement and verify our design on the Xilinx Spartan-6 field programmable gate array (FPGA) microboards. The experimental results demonstrate that, compared to previous work, our method increases the uniqueness, reliability and uniformity by up to 4.13%, 16.98% and 10.5%, respectively, while dramatically reducing the hardware resource overhead by 98.16% when a 128-bit PUF response is generated. Moreover, the bit per cost (BPC) metric of our proposed RPPUF increased by up to 28.5 and 53.37 times than that of PPUF and the improved butterfly PUF, respectively. This confirms that the proposed RPPUF is ultra-lightweight with a good performance, making it more appropriate and efficient to apply in FPGA-based IoT devices with constrained resources.


Author(s):  
Wei-Lung Mao ◽  
Chorng-Sii Hwang ◽  
Chung-Wen Hung ◽  
Jyh Sheen ◽  
Po-Hung Chen

Galileo will be Europe’s own Global Navigation Satellite System (GNSS), which is aiming to provide highly accurate and guaranteed positioning services. Galileo E1 system has a code period of 4ms which is quadruple that of GPS C/A code. In other words, due to the large number of hypotheses in code phase at acquisition stage, a longer searching time or more hardware resource is required. It is difficult to acquire Galileo signal because of longer code length and the multiple peaks of autocorrelation function of BOC modulation. In this paper, the cyclically shift-and-combine (CSC) and BPSK-like architectures are employed to resolve the unambiguous acquisition for BOC modulation and acquires these satellite signals with hardware complexity reduction. The concept of CSC code is to modify the code structure and shorten the code period such that the acquisition burden can be decreased. Simulation results show that our proposed search algorithm can provide better performances in terms of low hardware complexity for acquiring these satellite signals and detection probability at the low value of CNR.


Computers ◽  
2021 ◽  
Vol 10 (11) ◽  
pp. 147
Author(s):  
Konstantinos M. Giannoutakis ◽  
Christos K. Filelis-Papadopoulos ◽  
George A. Gravvanis ◽  
Dimitrios Tzovaras

There is a tendency, during the last years, to migrate from the traditional homogeneous clouds and centralized provisioning of resources to heterogeneous clouds with specialized hardware governed in a distributed and autonomous manner. The CloudLightning architecture proposed recently introduced a dynamic way to provision heterogeneous cloud resources, by shifting the selection of underlying resources from the end-user to the system in an efficient way. In this work, an optimized Suitability Index and assessment function are proposed, along with their theoretical analysis, for improving the computational efficiency, energy consumption, service delivery and scalability of the distributed orchestration. The effectiveness of the proposed scheme is being evaluated with the use of simulation, by comparing the optimized methods with the original approach and the traditional centralized resource management, on real and synthetic High Performance Computing applications. Finally, numerical results are presented and discussed regarding the improvements over the defined evaluation criteria.


Author(s):  
Mostafa Rizk ◽  
Amer Baghdadi ◽  
Michel Jézéquel

Emergent wireless communication standards, which are employed in different transmission environments, support various modulation schemes. High-order constellations are targeted to achieve high bandwidth efficiency. However, the complexity of the symbol-by-symbol Maximum A Posteriori (MAP) algorithm increases dramatically for these high-order modulation schemes. In order to reduce the hardware complexity, the suboptimal Max-Log-MAP, which is the direct transformation of the MAP algorithm into logarithmic domain, is alternatively implemented. In the literature, a great deal of research effort has been invested into Max-Log-MAP demapping. Several simplifications are presented to meet with specific constellations. In addition, the hardware implementations dedicated for Max-Log-MAP demapping vary greatly in terms of design choices, supported flexibility and performance criteria, making them a challenge to compare. This paper explores the published Max-Log-MAP algorithm simplifications and existing hardware demapper designs and presents an extensive review of the current literature. In-depth comparisons are drawn amongst the designs and different key performance characteristics are described, namely, achieved throughput, hardware resource requirements and flexibility. This survey should facilitate fair comparisons of future designs, as well as opportunities for improving the design of Max-Log-MAP demappers.


2021 ◽  
Author(s):  
Shamoona Imtiaz ◽  
Jakob Danielsson ◽  
Moris Behnam ◽  
Gabriele Capannini ◽  
Jan Carlson ◽  
...  

Sensors ◽  
2021 ◽  
Vol 21 (15) ◽  
pp. 5082
Author(s):  
Mateus C. Silva ◽  
Jonathan C. F. da Silva ◽  
Saul Delabrida ◽  
Andrea G. C. Bianchi ◽  
Sérvio P. Ribeiro ◽  
...  

Ecological environments research helps to assess the impacts on forests and managing forests. The usage of novel software and hardware technologies enforces the solution of tasks related to this problem. In addition, the lack of connectivity for large data throughput raises the demand for edge-computing-based solutions towards this goal. Therefore, in this work, we evaluate the opportunity of using a Wearable edge AI concept in a forest environment. For this matter, we propose a new approach to the hardware/software co-design process. We also address the possibility of creating wearable edge AI, where the wireless personal and body area networks are platforms for building applications using edge AI. Finally, we evaluate a case study to test the possibility of performing an edge AI task in a wearable-based environment. Thus, in this work, we evaluate the system to achieve the desired task, the hardware resource and performance, and the network latency associated with each part of the process. Through this work, we validated both the design pattern review and case study. In the case study, the developed algorithms could classify diseased leaves with a circa 90% accuracy with the proposed technique in the field. This results can be reviewed in the laboratory with more modern models that reached up to 96% global accuracy. The system could also perform the desired tasks with a quality factor of 0.95, considering the usage of three devices. Finally, it detected a disease epicenter with an offset of circa 0.5 m in a 6 m × 6 m × 12 m space. These results enforce the usage of the proposed methods in the targeted environment and the proposed changes in the co-design pattern.


2021 ◽  
Author(s):  
Dimple Sharma ◽  
Lev Kirischian ◽  
Valeri Kirischian

Systems for application domains like robotics, aerospace, defense, autonomous vehicles, etc. are usually developed on System-on-Programmable Chip (SoPC) platforms, capable of supporting several multi-modal computation-intensive tasks on their FPGAs. Since such systems are mostly autonomous and mobile, they have rechargeable power sources and therefore, varying power budgets. They may also develop hardware faults due to radiation, thermal cycling, aging, etc. Systems must be able to sustain the performance requirements of their multi-task multi-modal workload in the presence of variations in available power or occurrence of hardware faults. This paper presents an approach for mitigating power budget variations and hardware faults (transient and permanent) by run-time structural adaptation of the SoPC. The proposed method is based on dynamically allocating, relocating and re-integrating task-specific processing circuits inside the partially reconfigurable FPGA to accommodate the available power budget, satisfy tasks’ performances and hardware resource constraints, and/or to restore task functionality affected by hardware faults. The proposed method has been experimentally implemented on the ARM Cortex-A9 processor of Xilinx Zynq XC7Z020 FPGA. Results have shown that structural adaptation can be done in units of milliseconds since the worst-case decision-making process does not exceed the reconfiguration time of a partial bit-stream.


Sign in / Sign up

Export Citation Format

Share Document