On digit-recurrence division implementations for field programmable gate arrays
- 30 December 2002
- proceedings article
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Flexible Processors: A Promising Application-specific Processor Design ApproachPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2005
- Mapping division algorithms to field programmable gate arraysPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Chortle: a technology mapping program for lookup table-based field programmable gate arraysPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Hardware speedups in long integer multiplicationACM SIGARCH Computer Architecture News, 1991
- Chortle-crf: Fast technology mapping for lookup table-based FPGAsPublished by Association for Computing Machinery (ACM) ,1991
- A division algorithm with prediction of quotient digitsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1985
- On-Line Arithmetic: An OverviewPublished by SPIE-Intl Soc Optical Eng ,1984
- Optimizing Synchronous Circuitry by Retiming (Preliminary Version)Published by Springer Nature ,1983
- Minimization Over Boolean GraphsIBM Journal of Research and Development, 1962
- A New Class of Digital Division MethodsIRE Transactions on Electronic Computers, 1958