DocumentCode
1942825
Title
Efficient Finite Word Length Determination For Neural Networks Implementation
Author
Emir, Damergi ; Abdellatif, Benrabaa ; Ammar, Bouallegue
Author_Institution
Sys´´Com Lab., Nat. Eng. Sch. of Tunis
Volume
2
fYear
2005
fDate
28-30 Nov. 2005
Firstpage
31
Lastpage
35
Abstract
Most of the artificial neural networks (ANN) based applications are implemented on FPGAs using fixed-point arithmetic. The problem is to achieve a balance between the need for numerical precision, which is important for network accuracy, and the cost of logic areas, i.e. FPGA resources. In this paper we propose a genetic algorithm based methodology permitting the optimization of the FPGA resources needed for the implementation of a pipelined recurrent neural network (PRNN) while respecting the precision constraints. The quality of our methodology would be evaluated through experiment on a PRNN based WCDMA receiver. Our methodology is not restricted to this class of ANNs and can be used for any complex with variable dimensions system
Keywords
field programmable gate arrays; fixed point arithmetic; genetic algorithms; neural chips; recurrent neural nets; FPGA; WCDMA receiver; artificial neural network; finite word length determination; fixed-point arithmetic; genetic algorithm; numerical precision; optimization; pipelined recurrent neural network; Artificial neural networks; Constraint optimization; Costs; Field programmable gate arrays; Fixed-point arithmetic; Genetic algorithms; Logic; Neural networks; Pipeline processing; Recurrent neural networks; ANN; FPGA resources; fixed-point arithmetic; optimization;
fLanguage
English
Publisher
ieee
Conference_Titel
Computational Intelligence for Modelling, Control and Automation, 2005 and International Conference on Intelligent Agents, Web Technologies and Internet Commerce, International Conference on
Conference_Location
Vienna
Print_ISBN
0-7695-2504-0
Type
conf
DOI
10.1109/CIMCA.2005.1631441
Filename
1631441
Link To Document