DocumentCode
3255788
Title
Optimizations of bipartite memory systems for multiplicative divide and square root
Author
Chen, Jun ; Stine, James E.
Author_Institution
Dept. of Electr. & Comput. Eng., Oklahoma State Univ., Stillwater, OK
fYear
2005
fDate
7-10 Aug. 2005
Firstpage
1458
Abstract
This paper implements a memory system of improving the Goldschmidt algorithm. To accelerate the algorithm, a small correcting term is added to reduce the cycles needed to compute a divide or square root. The new method saves one iteration compared to the original method. Bipartite tables are included in the system for table lookups
Keywords
circuit optimisation; digital arithmetic; integrated memory circuits; table lookup; Goldschmidt algorithm; bipartite memory systems; bipartite tables; multiplicative divide; square root; table lookups; Acceleration; Convergence; Costs; Delay; Digital signal processing; Function approximation; Hardware; Iterative methods; Signal processing algorithms; Table lookup;
fLanguage
English
Publisher
ieee
Conference_Titel
Circuits and Systems, 2005. 48th Midwest Symposium on
Conference_Location
Covington, KY
Print_ISBN
0-7803-9197-7
Type
conf
DOI
10.1109/MWSCAS.2005.1594387
Filename
1594387
Link To Document