Optimizing Programmable Logic Arrays Using the Simulated Annealing Algorithm

نویسندگان

  • Liudmila Cheremisinova
  • Irina Loginova
چکیده

In the paper the programmable logic array (PLA) topological optimization problem is dealt with using folding techniques. A PLA folding algorithm based on the method of simulated annealing is presented. A simulated-annealing PLA folding algorithm is presented for multiple unconstrained folding. Then, the algorithm is extended to handle constrained folding. In this way, simple folding is considered as a case of multiple constrained folding. Some experimental results of computer investigation of the suggested algorithms are given.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Multiple-Valued Programmable Logic Array Minmization by Simulated Annealing

We propose a solution to the minimization problem of multiple-valued programmable logic arrays (PLA) that uses simulated annealing. The algorithm accepts a sum-ofproducts expression, divides and recombines the product terms. gradually progressing toward a minimal solution. The input expression can be user-specijied or one produced by another heuristic. Unlike recently studied minimization techn...

متن کامل

Parallel Dynamic Parameter Adaption of Adaptive Array Antennas Based on Nature Inspired Optimisation

The following paper describes and discusses the suitability of the particle swarm optimization (PSO), of the simulated annealing algorithm (SA) and of the genetic algorithm (GA) for the employment with blind adaptation of the directional characteristic of array antennas. By means of extensive simulations, it was confirmed that the suggested PSO and SA and the improved GA are able to follow dyna...

متن کامل

Language and Compiler for FPGA

This paper presents a high-level, algorithmic, single-assignment programming language and its optimizing compiler for reconfigurable systems. The compiler is capable of accepting our proposed instruction sets and generating a set of synthesizable VHDL codes. Simulated annealing algorithm at the heart of this compiler determines the design speed and resource needed on Field Programmable Gate Arr...

متن کامل

Mapping Tools for the Triptych FPGA

Field-programmable gate arrays (FPGAs) have recently become a dominant implementation medium for digital logic. One of the most important keys to using FPGAs effectively is a complete, automated software system for mapping onto the FPGA architecture. Unfortunately, many of the tools necessary require different techniques than traditional circuit implementation options, and these techniques are ...

متن کامل

A Methodology to Design Pipelined Simulated Annealing Kernel Accelerators in Space-borne Field-Programmable Gate Arrays

A Methodology to Design Pipelined Simulated Annealing Kernel Accelerators on Space-borne Field-Programmable Gate Arrays

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2012