|
| This Article | ||
| ||
| Share | ||
| Bibliographic References | ||
| Add to: | ||
 Digg  Furl  Spurl  Blink  Simpy  Google  Del.icio.us  Y!MyWeb | ||
| Search | ||
| ||
| ASCII Text | x | ||
| T. Srikanthan, S.K. Lam, Mishra Suman, "Area-Time Efficient Sign Detection Technique for Binary Signed-Digit Number System," IEEE Transactions on Computers, vol. 53, no. 1, pp. 69-72, January, 2004. | |||
| BibTex | x | ||
| @article{ 10.1109/TC.2004.1255791, author = {T. Srikanthan and S.K. Lam and Mishra Suman}, title = {Area-Time Efficient Sign Detection Technique for Binary Signed-Digit Number System}, journal ={IEEE Transactions on Computers}, volume = {53}, number = {1}, issn = {0018-9340}, year = {2004}, pages = {69-72}, doi = {http://doi.ieeecomputersociety.org/10.1109/TC.2004.1255791}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, } | |||
| RefWorks Procite/RefMan/Endnote | x | ||
| TY - JOUR JO - IEEE Transactions on Computers TI - Area-Time Efficient Sign Detection Technique for Binary Signed-Digit Number System IS - 1 SN - 0018-9340 SP69 EP72 EPD - 69-72 A1 - T. Srikanthan, A1 - S.K. Lam, A1 - Mishra Suman, PY - 2004 KW - Sign detection KW - binary signed-digit number system KW - most significant carry detection. VL - 53 JA - IEEE Transactions on Computers ER - | |||
Abstract—Computer arithmetic operations based on the BSD (Binary Signed-Digit) number representation system lend themselves well to high-speed computations due to the facilitation of limited carry addition/subtraction. In this paper, we propose an area-time efficient method for sign detection in a BSD number system based on optimized reverse tree structure. When compared to other popular approaches, such as the Most Significant Carry detection-based CLA (Carry Look-Ahead) and MRC (Multilevel Reverse Carry) implementations, the proposed method is superior to both area and time costs in VLSI. Synthesis results for different word lengths show that the proposed approach to sign detection in the BSD number system continues to maintain its advantage over area and time measures.
[1] B. Parhami, Computer Arithmetic: Algorithms and Hardware Designs. Oxford, U.K., and New York: Oxford Univ. Press, 2000.
[2] A. Avizienis, Signed-Digit Number Representations for Fast Parallel Arithmetic IRE Trans. Electronic Computers, vol. 10, pp. 389-400, 1961.
[3] B. Parhami, "Generalized Signed-Digit Number Systems: A Unifying Framework for Redundant Number Representations," IEEE Trans. Computers, vol. 39, no. 1, pp. 89-98, Jan. 1990.
[4] B. Parhami,"Carry-Free Addition of Recoded Binary Signed-Digit Numbers," IEEE Trans. Computers, vol. 38, pp. 1,470-1,476, 1988.
[5] C.K. Koc and S. Johnson, Multiplication of Signed-Digit Numbers Electronics Letters, vol. 30, no. 11, pp. 840-841, May 1994.
[6] C.N. Lyu and D.W. Matula, “Redundant Binary Booth Recoding,” Proc. 12th Symp. Computer Arithmetic, pp. 50-57, 1995.
[7] J.E. Volder, The CORDIC Trigonometric Computing Technique IRE Trans. Electronic Computers, vol. 8, pp. 330-334, Sept. 1959.
[8] T. Lang and J.D. Bruguera, Multilevel Reverse-Carry Computation for Comparison and for Sign and Overflow Detection in Addition Proc. Int'l Conf. Computer Design (ICCD), 1999.
[9] B. Parhami, Zero, Sign and Overflow Detection Schemes for Generalised Signed-Digit Arithmetic Proc. 22nd Asilomar Conf. Signals, Systems, and Computers, pp. 636-639, 1988.
[10] Avant! Passport 0.35 micron, 3.3 Volt SC Library CB35OS142 Mar. 2000.