作者: Jen-Shiun Chiang , Hung-Da Chung , Min-Show Min-Show
关键词:
摘要: A carry-free subtractive division algorithm is proposed in this paper. In the conventional divider, adders are used to find both quotient bit and partial remainder. Carries usually generated addition operation, it may take time finish therefore, carry propagation delay a bottleneck of divider. paper, scheme by using signed representation represent During arithmetic special technique decide bit, new remainder can be found further table lookup-like method. The format converted on-the-fly conversion binary representation. Based on 32-b/32-b divider designed implemented, simulation shows that works well.