Learning in hardware: architecture and implementation of an FPGA-based rough set machine

The "Learning Hardware" approach proposed here involves creating a computational network based on feedback from the environment (for instance, positive and negative examples from the trainer), and realizing this network in an array of Field Programmable Gate Arrays (FPGAs). We advocate the approaches based on a "strong AI criterion"; for instance, the computational networks can be built based on Sum-of-Products logic minimization, functional logic decomposition, or Decision Tree construction. Here we propose the constructive induction approach to Learning Hardware based on Rough Sets Theory (RST). This approach allows the use of logical analysis to develop efficient hardware-realizable algorithms, and is contrasted with the popular Evolvable Hardware (EHW) approach in which learning/evolution is based on the genetic algorithm only. The RST algorithms have a natural high parallelism and high possible speed-ups. Using a fast prototyping tool, the DEC-PERLE-1 board based on an array of Xilinx FPGAs, we are developing a virtual SIMD processor that accelerates the learning (design) of optimized multi-valued logic nets.

[1]  Laurent Moll,et al.  High-Energy Physics on DECPeRLe-1 Programmable Active Memory , 1995, Third International ACM Symposium on Field-Programmable Gate Arrays.

[2]  Ivan Bratko,et al.  Machine Learning and Data Mining; Methods and Applications , 1998 .

[3]  Hugo de Garis,et al.  EVOLVABLE HARDWARE Genetic Programming of a Darwin Machine , 1993 .

[4]  J. H. Herzog,et al.  Genetic programming and its applications to the synthesis of digital logic , 1997, 1997 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing, PACRIM. 10 Years Networking the Pacific Rim, 1987-1997.

[5]  Lech Jozwiak,et al.  Massively parallel structures of specialized re-configurable cellular processors for fast symbolic computations , 1998 .

[6]  Yaser S. Abu-Mostafa,et al.  Complexity in Information Theory , 1988, Springer New York.

[7]  Yiyu Yao,et al.  Data mining using extensions of the rough set model , 1998, KDD 1998.

[8]  Tadeusz Luba,et al.  Decomposition of multiple-valued functions , 1995, Proceedings 25th International Symposium on Multiple-Valued Logic.

[9]  Lech Jozwiak,et al.  Architecture of a programmable FPGA coprocessor for constructive induction approach to machine learning and other discrete optimization problems , 1997 .

[10]  Z. Pawlak Rough Sets: Theoretical Aspects of Reasoning about Data , 1991 .

[11]  Stephen Y. H. Su,et al.  Computer Minimization of Multivalued Switching Functions , 1972, IEEE Transactions on Computers.

[12]  Mieczyslaw Muraszkiewicz,et al.  Towards a Parallel Rough Sets Computer , 1993, RSKD.

[13]  Lech Józwiak,et al.  Solving synthesis problems with genetic algorithms , 1998, Proceedings. 24th EUROMICRO Conference (Cat. No.98EX204).

[14]  Ryszard S. Michalski,et al.  Inductive inference of VL decision rules , 1977, SGAR.

[15]  Marek A. Perkowski,et al.  A universal logic machine , 1992, [1992] Proceedings The Twenty-Second International Symposium on Multiple-Valued Logic.

[16]  Michael J. Flynn,et al.  Some Computer Organizations and Their Effectiveness , 1972, IEEE Transactions on Computers.

[17]  Mark Shand,et al.  Programmable active memories: reconfigurable systems come of age , 1996, IEEE Trans. Very Large Scale Integr. Syst..

[18]  Allan Gottlieb,et al.  Highly parallel computing , 1989, Benjamin/Cummings Series in computer science and engineering.

[19]  Lech Jozwiak,et al.  New approach to learning noisy Boolean functions , 1998 .