这篇文章介绍了基于algorithm H【*】的异步除法器。在一般的处理器中SRT除法器是比较常见的，但algorithm H也有其独特的优势（平均迭代次数少）。该文章使用GasP异步控制电路实现了这个除法器，充分利用了异步电路能够获得平均数据延时的特点，HSPICE仿真结果表明相比于SRT除法器，能够获得更少的FO4延时。
参考文章
Jamadagni N , Ebergen J . An Asynchronous Divider Implementation[C]// IEEE International Symposium on Asynchronous Circuits & Systems. IEEE Computer Society, 2012.
配合这篇文章一起阅读更佳：
【*】New Division Algorithms by Digit Recurrence
Outline
•Basic Introduction
•Radix-2 SRT algorithm & algorithm H
•Implementation
•Results
Introduction
[1] M. Ercegovac and J. Muller, “Digit-recurrence algorithms for division and square root with limited precision primitives,” in Signals, Systems and Computers, 2003. Conference Record of the Thirty-Seventh Asilomar Conference on , vol. 2, nov. 2003, pp. 1440 – 1444 Vol.2.
[2] J. Ebergen, I. Sutherland, and A. Chakraborty, “New division algorithms by digit recurrence,” in Signals, Systems and Computers, 2004. Confer-ence Record of the Thirty-Eighth Asilomar Conference on , vol. 2, nov. 2004, pp. 1849 – 1855 Vol.2.
[3] J. Ebergen, I. Sutherland, and D. Cohen, “Method and apparatus for performing a carry-save division operation,” U.S. Patent 7 660 842, February 9, 2010
Radix-2 SRT algorithm & algorithm H
SRT算法有一个csdn的栗子，比较通俗易懂。链接如下：
https://blog.csdn.net/alangaixiaoxiao/article/details/81624946blog.csdn.net
Implementation
Results
Conclusion
