Peichen Pan
ABSTRACT
In this paper, w e presen t a new retiming-based technology mapping algorithm for look-up table-based field programmable gate arrays. The algorithm is based on a novel iterative procedure for computing all k-cuts of all nodes in a sequen tialcircuit, in the presence of retiming. The algorithm completely avoids flow computation whic his the bottleneck of previous algorithms. Due to the fact that k is very small in practice, the procedure for computing all k-cuts is v ery fast. Experimental results indicate the overall algorithm is very efficient in practice.
- 1.Altera. Data Book Altera, San Jose, CA, 1995.Google Scholar
- 2.N. Bhat and D. Hill. Routable technology mapping for FPGAs. ~ A CM/SIGDA ~~~ on ~~s, p~ 143-148, 1992.Google Scholar
- 3.3. ~ong ~d Y. D~g. ~M~: An ~gm~ te~n~o~ mapping ~goHthm ~r d~ ~~z~~ ~ lo~u~ tab~ b~ed FPGA d~i~s. ~ ~ns. on ~~e~ Aid~ Des~ 13:1-11, 1994.Google Scholar
- 4.3. Cong ~d ~ Din~ On ~e~de~h t~d~off ~ ~~ b~ed FPGA te~n~o~ m~p~ ~ ~~. on ~~ ~tem~ 2:13~148, 1994.Google Scholar
- 5.3. C~g ~d Y.-~ ~g. P~~~p~~ ~ tion~ d~ompo~t~n ~th ~~~ ~ FPGA ~ th~ ~d m~p~g. In A CM/SIGDA ~~. on ~eld ~m~ab~ Gate A~y~ 1997. Google ScholarDigital Library
- 6.J. C~g ~d C. ~. An i~r~d ~~t~ ~ p~ ~~ce ~m~ te&n~o~ m~~g ~ ~t~g ~ ~~~ed FPGA d~. ~ ~c. ~ ~~ on ~mpurer Des~ pag~ 572-578, 1996.Google Scholar
- 7.3. Cong ~d G. ~. P~~~&~n FPGA ~h~ s~ ~th r~i~ng ~d p~~ng ~r se~e~i~ c~cu~s. ~ ~c. A~ D~n A~om~n ~~, 199ZGoogle Scholar
- 8.A. H. ~~ ~d M. S~~~. C~l~ ~ ~ ~u~t~ m~im~ion p~em ~r FPGA te~do~ m~p~g. ~ ~~. on ~~~A~d D~~ 13:1~I~2, 1994. -Google Scholar
- 9.R. ~. ~c~, ~. ~se, ~d K. C~g. Cho~: A te~~ m~p~g ~r ~okup ~~b~ed fidd pr~ ~~m~e g~e ~~. ~ ~c. A~ D~n A~om~n ~~, pag~ 613~619i 1990. Google ScholarDigital Library
- 10.R. J. ~c~, J. ~se, ~d Z. %~~. ~~I~ ~t te~n~o~ m~p~g ~r ~up t~~~ed F~ GAs. ~ ~c. A~ D~n A u~m~n ~, p~ 22~233, 1991. Google ScholarDigital Library
- 11.R. 3. ~c~, 3. ~se, ~d Z.~~~. ~~oN o~ m~ng ~r ~o~p t~l~b~ed FPGAs ~r p~~ m~ce. In D~est ~ ~ ~tL ~~ on ~~ut~ Aided D~n, pa~ 568-571, 1991.Google Scholar
- 12.K. K~~. Xm~: A te~n~o~m~p~ ~r t~l~ ~o~p FPGAs. ~ ~c. A~ D~n Autom~ t~on ~~, pag~ ~~3, 1991. Google ScholarDigital Library
- 13.C. E. L~~~ ~d 3. B. S~e. ~t~ng ~n~~o~ ~c~t~ A~~hm~, 6:5~5, 1991.Google Scholar
- 14.A. M~~ ~d C. L. L~. ~~rm~ ~i~n te~N o~ m~p~g ~r ~u~~e b~ed FPG~ ~g ~e gener~ d~ mode. In A GM/SIGDA ~~h~ on ~eld ~~mab~ Gate A~y~ 1994.Google Scholar
- 15.~&T Mi~o~~o~. A~T ~~~~m~ Gate A~~ Data Boo~ ~&T Mi~o~~o~, 1995.Google Scholar
- 16.R. M~, R.K. ~~~, ~d A. S~~N ~~t~i. Se~~ ~h~ ~r t~le lo~ up ~ ~~m~e g~e ~~s. ~ ~c. A~ D~n Autom~n ~~, pag~ 22~29, 1993. Google ScholarDigital Library
- 17.R. Murg~, Y. Nishizaki, N. Shenoy, R.K. Brayton, and A. San~ovanni-Vincentelli. Lo~c synth~is ~gofithms ~r table look up pro~ammable gate ~rays. In P~c. A CM/IBBE Des~n A~om~n Conf., pages 620-625, 1990. Google ScholarDigital Library
- 18.~ Pan. Continuous ~tim~ ~gofithms and ap~N c~ns. In IntL Conf. on Computer Des~n ~CCD), pag~ 116-121, 199LGoogle Scholar
- 19.L Pan and C. L. Liu. Op~m~ dock period FPGA technMogy mapp~g ~r sequenfi~ ekeu~s. In A GM/1BEE Desert A~om~n Conf. (DA G), pag~ 720-725, 1996. Google ScholarDigital Library
- 20.~ Pan and C. L. Liu. Techndogy mapping of sequenti~ ckcu~s ~r LUT-b~ed FPGAs ~r performance. In A GM/SIGDA IntL Sympos~m on Fiel$Programmab~ Gate A~a~, pag~ 58-64, 1996. Google ScholarDigital Library
- 21.~ Pan and C.L. Liu. Optim~ dock p~iod FPGA teehndogy reaping for sequenti~ eirc~ts with retiming. A GM Trans. on D~n AuWm~n of El~twn~ System~ ~o appear). Google ScholarDigital Library
- 22.~ Sawkar and D. Thom~. Area and dday mapping for tabl~look-up b~ed fidd pro~ammable gate arrays. In Proc. ACId/IEEE Des~n A~om~n Conf., pages 368-373, 1992. , Google ScholarDigital Library
- 23.E Sawkar and D. Thom~. P~rmance dire~ed techn~ogy mapp~g ~r lookup table b~ed FPGAs. In Proc. A CM/IEEE D~n Au~m~n Conf., pages 208-212, 1993. Google ScholarDigital Library
- 24.M. Schla~ J. Kon~ and EK. Chan. RoutabiHty-driven techn~ogy mapp~g ~r lookup tabl~b~ed FPGA~. IEEE Trans. on Compute~Aided Des~ 13:13-26, 1994.Google Scholar
- 25.U. We~mann and W. R~ns~. Techn~ogy mapping ~r sequentiM c~c&ts b~ed on ~fiming tech~qu~, in Proc. Europ~n Des~n A~om~n Conf., pages 318- 323, 1993.Google Scholar
- 26.N.-S. Woo. A heur~fiC m~hod ~r FPGA technoN ogy mapp~g b~ed on .the edge ~sibility. In Proc. ACM/IEEE D~n Au~m~n Conf., pag~ 248-251, 1991. Google ScholarDigital Library
- 27.XiHn.x. The Prog~mmable Gate A~a~ Data Book. XiN lax, San Jose, CA, 1993.Google Scholar
- 28.H. Yang and D. F. Wong. Edg~Map: Optim~ pe~ ~rmance driven techndogy mapp~g ~r it~ive LUT b~ed FPGA deigns. In D~t IEEE/A CM IntL Conf. on Compeer-Aided D~n, pag~ 150--155, 1994. Google ScholarDigital Library
Index Terms
- A new retiming-based technology mapping algorithm for LUT-based FPGAs
Recommendations
Improvements to technology mapping for LUT-based FPGAs
FPGA '06: Proceedings of the 2006 ACM/SIGDA 14th international symposium on Field programmable gate arraysThe paper presents several improvements to state-of-the-art in FPGA technology mapping exemplified by a recent advanced technology mapper DAOmap [Chen and Cong, ICCAD '04]. Improved cut enumeration computes all K-feasible cuts without pruning for up to ...
Placement-driven technology mapping for LUT-based FPGAs
FPGA '03: Proceedings of the 2003 ACM/SIGDA eleventh international symposium on Field programmable gate arraysIn this paper, we study the problem of placement-driven technology mapping for table-lookup based FPGA architectures to optimize circuit performance. Early work on technology mapping for FPGAs such as Chortle-d[14] and Flowmap[3] aim to optimize the ...
Comments