piecewise polynomial approximation
Recently Published Documents


TOTAL DOCUMENTS

74
(FIVE YEARS 12)

H-INDEX

10
(FIVE YEARS 2)

Electronics ◽  
2021 ◽  
Vol 11 (1) ◽  
pp. 14
Author(s):  
Griselda González-Díaz_Conti ◽  
Javier Vázquez-Castillo ◽  
Omar Longoria-Gandara ◽  
Alejandro Castillo-Atoche ◽  
Roberto Carrasco-Alvarez ◽  
...  

Today, embedded systems (ES) tend towards miniaturization and the carrying out of complex tasks in applications such as the Internet of Things, medical systems, telecommunications, among others. Currently, ES structures based on artificial intelligence using hardware neural networks (HNNs) are becoming more common. In the design of HNN, the activation function (AF) requires special attention due to its impact on the HNN performance. Therefore, implementing activation functions (AFs) with good performance, low power consumption, and reduced hardware resources is critical for HNNs. In light of this, this paper presents a hardware-based activation function-core (AFC) to implement an HNN. In addition, this work shows a design framework for the AFC that applies a piecewise polynomial approximation (PPA) technique. The designed AFC has a reconfigurable architecture with a wordlength-efficient decoder, i.e., reduced hardware resources are used to satisfy the desired accuracy. Experimental results show a better performance of the proposed AFC in terms of hardware resources and power consumption when it is compared with state of the art implementations. Finally, two case studies were implemented to corroborate the AFC performance in widely used ANN applications.


2021 ◽  
Vol 21 (6) ◽  
pp. 8
Author(s):  
Weiwei Dai ◽  
Ivan Selesnick ◽  
John-Ross Rizzo ◽  
Janet Rucker ◽  
Todd Hudson

Electronics ◽  
2020 ◽  
Vol 9 (1) ◽  
pp. 182 ◽  
Author(s):  
Javier Vázquez-Castillo ◽  
Alejandro Castillo-Atoche ◽  
Roberto Carrasco-Alvarez ◽  
Omar Longoria-Gandara ◽  
Jaime Ortegón-Aguilar

The hardware of the matrix inversion architecture using QR decomposition with Givens Rotations (GR) and a back substitution (BS) block is required for many signal processing algorithms. However, the hardware of the GR algorithm requires the implementation of complex operations, such as the reciprocal square root (RSR), which is typically implemented using LookUp Table (LUT) and COordinate Rotation DIgital Computer (CORDICs), among others, conveying to either high-area consumption or low throughput. This paper introduces an Field-Programmable Gate Array (FPGA)-based full matrix inversion architecture using hybrid piecewise polynomial approximation systolic cells. In the design, a hybrid segmentation technique was incorporated for the implementation of piecewise polynomial systolic cells. This hybrid approach is composed by an external and internal segmentation, where the first is nonuniform and the second is uniform, fitting the curve shape of the complex functions achieving a better signal-quantization-to noise-ratio; furthermore, it improves the time performance and area resources. Experimental results reveal a well-balanced improvement in the design achieving high throughput and, hence, less resource utilization in comparison to state-of-the-art FPGA-based architectures. In our study, the proposed design achieves 7.51 Mega-Matrices per second for performing 4 × 4 matrix operations with a latency of 12 clock cycles; meanwhile, the hardware design requires only 1474 slice registers, 1458 LUTs in an FPGA Virtex-5 XC5VLX220T, and 1474 slice registers and 1378 LUTs when a FPGA Virtex-6 XC6VLX240T is used.


Sign in / Sign up

Export Citation Format

Share Document