A digit-recurrence square root implementation for field programmable gate arrays
- 30 December 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
No abstract availableKeywords
This publication has 11 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
- On digit-recurrence division implementations for field programmable gate arraysPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Logic transformations for synchronous logic synthesisPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Retiming and resynthesis: optimizing sequential networks with combinational techniquesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Module to perform multiplication, division, and square root in systolic arrays for matrix computationsJournal of Parallel and Distributed Computing, 1991
- Hardware speedups in long integer multiplicationACM SIGARCH Computer Architecture News, 1991
- Square rooting algorithms for integer and floating-point numbersIEEE Transactions on Computers, 1990
- On-the-Fly Conversion of Redundant into Conventional RepresentationsIEEE Transactions on Computers, 1987
- A division algorithm with prediction of quotient digitsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1985