### Abstract

This paper proposes a simultaneous placement and global routing algorithm for FPGAs with power optimization. The algorithm is based on hierarchical bipartitioning of layout regions and sets of logic-blocks. When bipartitioning a layout region, pseudo-blocks are introduced to preserve connections if there exist connections between bipartitioned logic-block sets. A global route is represented by a sequence of pseudo-blocks. Since pseudo-blocks and logic-blocks can be dealt with equally, placement and global routing are processed simultaneously. The algorithm gives weights to the nets with high switching probabilities and assigns the blocks connected by weighted nets to the same region. Thus their length is shortened and the power consumption of a whole circuit can be reduced. The experimental results demonstrate the effectiveness and efficiency of the algorithm.

Original language | English |
---|---|

Title of host publication | IEEE Asia-Pacific Conference on Circuits and Systems - Proceedings |

Place of Publication | Piscataway, NJ, United States |

Publisher | IEEE |

Pages | 125-128 |

Number of pages | 4 |

ISBN (Print) | 0780351460 |

Publication status | Published - 1998 |

Event | Proceedings of the 1998 IEEE Asia-Pacific Conference on Circuits and Systems - Microelectronics and Integrating Systems (IEEE APCCAS-98) - Chiangmai, Thailand Duration: 1998 Nov 24 → 1998 Nov 27 |

### Other

Other | Proceedings of the 1998 IEEE Asia-Pacific Conference on Circuits and Systems - Microelectronics and Integrating Systems (IEEE APCCAS-98) |
---|---|

City | Chiangmai, Thailand |

Period | 98/11/24 → 98/11/27 |

### Fingerprint

### ASJC Scopus subject areas

- Electrical and Electronic Engineering

### Cite this

*IEEE Asia-Pacific Conference on Circuits and Systems - Proceedings*(pp. 125-128). Piscataway, NJ, United States: IEEE.

**Simultaneous placement and global routing algorithm for FPGAs with power optimization.** / Togawa, Nozomu; Ukai, Kaoru; Yanagisawa, Masao; Ohtsuki, Tatsuo.

Research output: Chapter in Book/Report/Conference proceeding › Chapter

*IEEE Asia-Pacific Conference on Circuits and Systems - Proceedings.*IEEE, Piscataway, NJ, United States, pp. 125-128, Proceedings of the 1998 IEEE Asia-Pacific Conference on Circuits and Systems - Microelectronics and Integrating Systems (IEEE APCCAS-98), Chiangmai, Thailand, 98/11/24.

}

TY - CHAP

T1 - Simultaneous placement and global routing algorithm for FPGAs with power optimization

AU - Togawa, Nozomu

AU - Ukai, Kaoru

AU - Yanagisawa, Masao

AU - Ohtsuki, Tatsuo

PY - 1998

Y1 - 1998

N2 - This paper proposes a simultaneous placement and global routing algorithm for FPGAs with power optimization. The algorithm is based on hierarchical bipartitioning of layout regions and sets of logic-blocks. When bipartitioning a layout region, pseudo-blocks are introduced to preserve connections if there exist connections between bipartitioned logic-block sets. A global route is represented by a sequence of pseudo-blocks. Since pseudo-blocks and logic-blocks can be dealt with equally, placement and global routing are processed simultaneously. The algorithm gives weights to the nets with high switching probabilities and assigns the blocks connected by weighted nets to the same region. Thus their length is shortened and the power consumption of a whole circuit can be reduced. The experimental results demonstrate the effectiveness and efficiency of the algorithm.

AB - This paper proposes a simultaneous placement and global routing algorithm for FPGAs with power optimization. The algorithm is based on hierarchical bipartitioning of layout regions and sets of logic-blocks. When bipartitioning a layout region, pseudo-blocks are introduced to preserve connections if there exist connections between bipartitioned logic-block sets. A global route is represented by a sequence of pseudo-blocks. Since pseudo-blocks and logic-blocks can be dealt with equally, placement and global routing are processed simultaneously. The algorithm gives weights to the nets with high switching probabilities and assigns the blocks connected by weighted nets to the same region. Thus their length is shortened and the power consumption of a whole circuit can be reduced. The experimental results demonstrate the effectiveness and efficiency of the algorithm.

UR - http://www.scopus.com/inward/record.url?scp=0032218438&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0032218438&partnerID=8YFLogxK

M3 - Chapter

SN - 0780351460

SP - 125

EP - 128

BT - IEEE Asia-Pacific Conference on Circuits and Systems - Proceedings

PB - IEEE

CY - Piscataway, NJ, United States

ER -