Toward a solution of the reverse engineering problem using FPGAs

摘要: An important issue in computational biology is the reverse engineering problem for genetic networks. In this ongoing work we consider context of univariate finite fields models. A solution to using multipoint interpolation relies on intensive arithmetic computations over fields, where multiplication dominant operation. work, develop an efficient multiplier GF(2m) generated by irreducible trinomials form αm +αn +1. We propose a design described parallel/serial architecture that computes m clock cycles. This approach exploits symmetries Mastrovito matrices order improve time complexities FPGA (Field Programmable Gate Array) implementation. According preliminary performance results, our performs efficiently large and has potential networks, as well other applications such cryptography Reed-Solomon decoders.