Skip to main navigation Skip to search Skip to main content

A research on subsection progressive optimization placement algorithm of FPGA

  • Xiu Hai Cui
  • , Hai Gang Yang*
  • , Xiao Gong
  • , Juan Huang
  • , Yi Tao Tan
  • *Corresponding author for this work
  • CAS - Institute of Electronics
  • University of Chinese Academy of Sciences

Research output: Contribution to journalArticlepeer-review

Abstract

A novel FPGA simulated annealing placement algorithm is proposed to improve the routability and optimize the length of wires. Different cost functions are applied to different temperature range. In high temperature stage, the half perimeter method is utilized to fast optimize the placement; while in low temperature stage, a variable factor is added into the cost function and the reasonable temper process is also used to improve the quality of placement. Experiment results demonstrate that, compared with the VPR, the proposed method requires 6% fewer routing tracks and the length of wire is 4~23% shorter.

Original languageEnglish
Pages (from-to)1395-1400
Number of pages6
JournalDianzi Yu Xinxi Xuebao/Journal of Electronics and Information Technology
Volume32
Issue number6
DOIs
StatePublished - Jun 2010
Externally publishedYes

Keywords

  • Cost function
  • FPGA
  • Pacement
  • Routability
  • Simulated annealing
  • VPR (Versatile Place and Route)

Fingerprint

Dive into the research topics of 'A research on subsection progressive optimization placement algorithm of FPGA'. Together they form a unique fingerprint.

Cite this