A Radix-4 New Svota-Tung Divider with Constant Timing Complexity for Precsaling

doi:10.1023/A:1021150020008

機構典藏 > College of Engineering > Graduate Institute & Department of Electrical Engineering > Journal Article > Item 987654321/60812

Please use this identifier to cite or link to this item: https://tkuir.lib.tku.edu.tw/dspace/handle/987654321/60812

Title:	A Radix-4 New Svota-Tung Divider with Constant Timing Complexity for Precsaling
Authors:	江正雄;Chiang, Jen-shiun;Tsai, Min-show
Contributors:	淡江大學電機工程學系
Keywords:	computer arithmetic;floating-point division;new Svoboda-Tung;division;prescaling;radix-4;signed digit number system;Svoboda-Tung division
Date:	2003-01
Issue Date:	2011-10-15 00:55:09 (UTC+8)
Abstract:	A new floating-point division architecture that complies with the IEEE 754-1985 standard is proposed in this paper. This architecture is based on the New Svoboda-Tung (NST) division algorithm and the radix-4 MROR (maximally redundant maximally recoded) signed digit number system. In NST division, the divisor and dividend must be prescaled. We summarize a general systematic method to accomplish the prescaling, and we also propose a hardware scheme such that the timing complexity is constant regardless of the bit length of the divisor. For the divider implementation, a new MROR signed digit adder with carry free characteristic is proposed for addition and subtraction, and this adder can improve the cycle time significantly. A 32-b/32-b radix-4 divider is thus designed in Verilog HDL; the simulation results show that this architecture is implementable using currently available libraries. The hardware complexity and performance of this divider is competitive with conventional SRT dividers.
Relation:	Kluwer Journal of VLSI Signal Processing 33(1/2), pp.117-124
DOI:	10.1023/A:1021150020008
Appears in Collections:	[Graduate Institute & Department of Electrical Engineering] Journal Article

Files in This Item:

File	Size	Format
index.html	0Kb	HTML	119	View/Open

Loading...