HARDWARE IMPLEMENTATION OF EWA For Point-Based Three-Dimensional Graphics Rendering

Author(s):  
Adam Herout ◽  
Pavel Zemčík ◽  
Julien Reptin
2021 ◽  
Author(s):  
Jianming Cai ◽  
Han Bao ◽  
Quan Xu ◽  
Zhongyun Hua ◽  
Bocheng Bao

Abstract The Hindmarsh-Rose (HR) neuron model is built to describe the neuron electrical activities. Due to the polynomial nonlinearities, multipliers are required to implement the HR neuron model in analog. In order to avoid the multipliers, this brief presents a novel smooth nonlinear fitting scheme. We first construct two nonlinear fitting functions using the composite hyperbolic tangent functions and then implement an analog multiplierless circuit for the two-dimensional (2D) or three- dimensional (3D) HR neuron model. To exhibit the nonlinear fitting effects, numerical simulations and hardware experiments for the fitted HR neuron model are provided successively. The results show that the fitted HR neuron model with analog multiplierless circuit can display different operation patterns of resting, periodic spiking, and periodic/chaotic bursting, entirely behaving like the original HR neuron model. The analog multiplierless circuit has the advantage of low implementation cost and thereby it might be suitable for the hardware implementation of large-scale neural networks.


Electronics ◽  
2018 ◽  
Vol 7 (12) ◽  
pp. 428 ◽  
Author(s):  
Guohe Zhang ◽  
Zejie Kuang ◽  
Sufen Wei ◽  
Kai Huang ◽  
Feng Liang ◽  
...  

Digital speckle correlation method is widely used in the areas of three-dimensional deformation and morphology measurement. It has the advantages of non-contact, high precision, and strong stability. However, it is very complex to be carried out with low speed software implementation. Here, an improved full pixel search algorithm based on the normalized cross correlation (NCC) method considering hardware implementation is proposed. According to the field programmable gate array (FPGA) simulation results, the speed of hardware design proposed in this paper is 2000 faster than that of software in single point matching, and 600 times faster than software in multi-point matching. The speed of the presented algorithm shows an increasing trend with the increase of the template size when performing multipoint matching.


1996 ◽  
Vol 28 (1) ◽  
pp. 358-362
Author(s):  
David A. Goldman ◽  
Richard R. Eckert ◽  
Maxine S. Cohen

2000 ◽  
Vol 78 (2) ◽  
pp. 177-205 ◽  
Author(s):  
Mahmoud Meribout ◽  
Mamoru Nakanishi ◽  
Eiichi Hosoya ◽  
Takeshi Ogura

2003 ◽  
Vol 2 ◽  
pp. 54-57 ◽  
Author(s):  
J.P. Durbano ◽  
F.E. Ortiz ◽  
J.R. Humphrey ◽  
M.S. Mirotznik ◽  
D.W. Prather

Sign in / Sign up

Export Citation Format

Share Document