首页> 外文会议>IEEE East-West Design Test Symposium >Representation of solutions in genetic VLSI placement algorithms
【24h】

Representation of solutions in genetic VLSI placement algorithms

机译:遗传VLSI放置算法中解决方案的表示

获取原文

摘要

The VLSI placement problem is presented in this article. A mechanism of representation of solutions for further genetic algorithm implementation is described. The proposed encoding algorithm is based on a placement tree and reverse Polish notation. The decoding algorithm is implemented in two stages: twinning of elements in macroblocks and calculation of real coordinates of elements. Experimental results show time-response characteristics of the proposed coding and decoding mechanisms. The time complexity of the encoding algorithm is represented by O(n) whereas the time complexity of the decoding algorithm is represented by O(n log n), where n is the number of elements.
机译:本文介绍了VLSI放置问题。描述了用于进一步的遗传算法实现的解决方案的表示机制。所提出的编码算法基于放置树和反向波兰语表示法。解码算法分两个阶段实现:宏块中元素的孪生和元素实际坐标的计算。实验结果表明了所提出的编码和解码机制的时间响应特性。编码算法的时间复杂度用O(n)表示,而解码算法的时间复杂度用O(n log n)表示,其中n是元素数。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号