Packing LUT clusters with network flow programming
| Data(s) |
2007
|
|---|---|
| Resumo |
This paper describes a two-step packing algorithm for LUT clusters of which the LUT input multipliers are depopulated. In the first step, a greedy algorithm is used to search for BLE locations and cluster inputs. If the greedy algorithm fails, the second step with network flow programming algorithm is employed. Numerical results illustrate that our two-step packing algorithm obtains better packing density than one-step greedy packing algorithm. This paper describes a two-step packing algorithm for LUT clusters of which the LUT input multipliers are depopulated. In the first step, a greedy algorithm is used to search for BLE locations and cluster inputs. If the greedy algorithm fails, the second step with network flow programming algorithm is employed. Numerical results illustrate that our two-step packing algorithm obtains better packing density than one-step greedy packing algorithm. zhangdi于2010-03-09批量导入 zhangdi于2010-03-09批量导入 [Zhou, Huabing; Ni, Minghao; Chen, Stanley; Liu, Zhongli] Chinese Acad Sci, Inst Semicond, Beijing 100083, Peoples R China |
| Identificador | |
| Idioma(s) |
英语 |
| Publicador |
IEEE 345 E 47TH ST, NEW YORK, NY 10017 USA |
| Fonte |
Zhou, HB ; Ni, MH ; Chen, S ; Liu, ZL .Packing LUT clusters with network flow programming .见：IEEE .2007 INTERNATIONAL SYMPOSIUM ON INTEGRATED CIRCUITS,345 E 47TH ST, NEW YORK, NY 10017 USA ,2007,VOLS 1 AND 2: 469-472 |
| Palavras-Chave | #微电子学 |
| Tipo |
会议论文 |
