
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
B. Parhami, "On the Implementation of Arithmetic Support Functions for Generalized SignedDigit Number Systems," IEEE Transactions on Computers, vol. 42, no. 3, pp. 379384, March, 1993.  
BibTex  x  
@article{ 10.1109/12.210182, author = {B. Parhami}, title = {On the Implementation of Arithmetic Support Functions for Generalized SignedDigit Number Systems}, journal ={IEEE Transactions on Computers}, volume = {42}, number = {3}, issn = {00189340}, year = {1993}, pages = {379384}, doi = {http://doi.ieeecomputersociety.org/10.1109/12.210182}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Computers TI  On the Implementation of Arithmetic Support Functions for Generalized SignedDigit Number Systems IS  3 SN  00189340 SP379 EP384 EPD  379384 A1  B. Parhami, PY  1993 KW  zero detection; arithmetic support functions; generalized signeddigit number systems; OSD number representation; borrowfree subtraction; redundant number representations; carryfree addition; sign detection; overflow handling; digital arithmetic. VL  42 JA  IEEE Transactions on Computers ER   
Ordinary signeddigit (OSD) number representation systems have been defined for any radix r
[1] A. Avizienis, "Signeddigit number representation for fast parallel arithmetic,"IRE Trans. Electron. Comput., vol. EC10, pp. 389400, 1961.
[2] A. Avizienis, "On a flexible implementation of digital computer arithmetic," inInform. Processing '62 (Proc. IFIP Congress), NorthHolland, Amsterdam, 1963, pp. 664670.
[3] A. Avizienis, "Binarycompatible signeddigit arithmetic," inAFIPS Conf. Proc. (1964 Fall Joint Computer Conf.), pp. 663672.
[4] L. J. Guibas and F. M. Liang, "Systolic stacks, queues, and counters," inProc. Conf. Advanced Res. VLSI, M.I.T., 1982, pp. 155164.
[5] A. Guyot, B. Hochet, and J.M. Muller, "A way to build efficient carryskip adders,"IEEE Trans. Comput., vol. C36, no. 4, pp. 11441151, Oct. 1987.
[6] M. J. Irwin and R. M. Owens, "Digit pipelined arithmetic as illustrated by the pasteup system,"IEEE Comput. Mag., pp. 6173, Apr. 1987.
[7] M. Lehman and N. Burla, "Skip techniques for highspeed carry propagation in binary arithmetic units,"IRE Trans. Electron. Comput., vol. EC10, no. 4, pp. 691698, Dec. 1961.
[8] O. L. MacSorley, "Highspeed arithmetic in binary computers,"Proc. IRE, vol. 49, pp. 6791, Jan. 1961, Reprinted in [16].
[9] G. Metze and J.E. Robertson, "Elimination of carry propagation in digital computers," inInform. Processing '59 (Proc. UNESCO Conf., June 1959), 1960, pp. 389396.
[10] B. Parhami, "Systolic up/down counters with zero and sign detection," inProc. Symp. Comput. Arithmetic, Como, Italy, May 1987, pp. 174178.
[11] B. Parhami, "A general theory of carryfree and limitedcarry computer arithmetic," inProc. Canadian Conf. VLSI, Winnipeg, Canada, Oct. 1987, pp. 167172.
[12] B. Parhami, "Carryfree addition of recoded binary signeddigit numbers,"IEEE Trans. Comput., vol. 37, no. 11, pp. 14701476, Nov. 1988.
[13] B. Parhami, "Zero, sign, and overflow detection schemes for generalized signeddigit arithmetic," inProc. 22nd Asilomar Conf. Signals, Syst., and Comput., Pacific Grove, CA, Oct./Nov. 1988, pp. 636639.
[14] B. Parhami, "A new method for designing highly parallel binary multipliers," inProc. 3rd Annu. Parallel Processing Symp., Fullerton, CA, Mar. 1989, pp. 176185.
[15] B. Parhami, "Generalized signeddigit number systems: A unifying framework for redundant number representations,"IEEE Trans. Comput., vol. 39, no. 1, pp. 8998, Jan. 1990.
[16] E. E. Swartzlander, Ed.,Computer Design Development, Principal Papers. Hayden, 1976.