【摘要】We describe a hardware-oriented design of a complex division algorithm proposed in . This algorithm is similar to a radix-r digit-recurrence division algorithm with real operands and prescaling. Prescaling of complex operands allows efficient selection of complex quotient digits in higher radix. The use of the digit-recurrence method allows hardware implementation similar to that of conventional dividers. Moreover, this method makes correct rounding of complex quotient possible. On the other hand, the proposed scheme requires the use of prescaling tables which are more demanding than tables in similar dividers with real operands. In this paper we present main design ideas, implementation details, and give a rough estimate of the expected latency. We also make a comparison with the estimated latency of the Smith's algorithm used in software routines for complex division.
【会议地点】Denver,CO (US)
【作者】Milos D. Ercegovac;Jean-Michel Muller;
【作者单位】Computer Science Department, University of California, Los Angeles, California. U.S.A.;
【会议组织】
【会议召开年】2004
【页码】P.51-59
【总页数】9
【原文格式】PDF
【正文语种】eng
【中图分类】TP391;TN911;
【关键词】complex division;digit-recurrence algorithms;prescaling;radix r;hardware implementation;
