Grey relational grade applied to FPGA placement with minimal wire length

Abstract

This work aims at developing grey relational grade for minimal wire length FPGA placement to follow-up the FPGA routing work. The proposed GRAP (Grey Relational Grade Apply to Placement) algorithm was combined with grey relational clustering and CAPRI algorithm to construct a placement netlist to successfully solve minimal wire length in FPGA placement design problem. After the grey relational grade is calculated, GRAP can rank the sequence and analyze the minimal distance in CLB blocks from the grey relational sequence and combine connection-based approaches. Experimental results demonstrate that the proposed algorithm can obtain minimal total wire length.