In VLSI cell placement, quadratic assignment places modules or cells such that the total weighted Euclidean distance between connected modules is minimised. However, current methods fail to take module size into account, and impractical placements can occur. An algorithm is proposed that takes module size into account, without a significant increase in computational expense.
|Number of pages||3|
|Journal||IEE Electronics Letters|
|Publication status||Published - Jul 1997|