An efficient algorithm and parallel implementations for binary and residue number systems

Journal of Symbolic Computation

Volumn 15, Issue 4, 1993, Pages 451-462

  Zhang, C N ^a   Shirazi, B ^b   Yun, D Y Y ^c  

^a UNIVERSITY OF REGINA   (Canada)

^b UNIVERSITY OF TEXAS AT ARLINGTON   (United States)

^c UNIVERSITY OF HAWAII   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 15844399684     PISSN: 07477171     EISSN: None     Source Type: Journal    
DOI: 10.1006/jsco.1993.1030     Document Type: Article

References (8)

1. Hwang, K. (1979). Computer Arithmetic-Principles, Architecture, and Design, John Wiley.
2. Jenkins, W.K. (1973). A Technique for the Efficient Generation of Projections for Error Correcting Residue Codes. IEEE Trans. Computers, Vol C-22, pp 762-767.
3. Szabo, N.S. and R. I. Tanaka (1967). Residue Arithmetic and its Applications to Computer Technology. McGraw-hill, New York.
4. Tseng, B., G.A. Julin and W.C. Miller. (1979). Implementation of FFT Structures Using the Residue Number System. IEEE Trans, on Computers, Vol. C-28, pp831-834.
5. Yun, D.Y.Y. (1978). Equivalent Complexity of a Class of Algebraic Mappings, Proc. SIAM 1978 Spring Meeting, Madison, Wisconsin.
6. Taylor, F.J. and A. S. Ramnarayanan. (1981). An Efficient Residue-to-decimal Converter, IEEE Trans. Circuits Syst., Vol. CAS-28, pp 1164-1169.
7. Vu, T.V. (1985). Efficient Implementations of the Chinese Remainder Theorem for Sign Detection and Residue Decoding, IEEE Trans. Computers, Vol C-34, pp 646-651.
8. Zhang, C.N., B. Shirazi and D.Y.Y. Yun. (1992). Efficient Algorithms for Residue Number Conversions, Tech. report, Dept, of Computer Science, University of Regina, Sep. 1992.