Pipelined scaling of signed residue numbers with the mixed-radix conversion in the programmable gate array

• Autorzy: Czyżak M. , Smyk R. , Ulman Z.
• Konferencja: Computer Applications in Electrical Engineering 2013 (15-16.04.2013; Poznań, Polska)
• Języki publikacji: EN

Abstrakty

EN

In this work a scaling technique of signed residue numbers is proposed. The method is based on conversion to the Mixed-Radix System(MRS) adapted for the FPGA implementation. The scaling factor is assumed to be a moduli product from the Residue Number System (RNS) base. Scaling is performed by scaling of terms of the mixed-radix expansion, generation of residue representations of scaled terms, binary addition of these representations and generation of residues for all moduli. The sign is detected on the basis of the value of the most significant coefficient of the MRS representation. For negative numbers their residues are adequately corrected. The basic blocks of the scaler are realized in the form of the modified two-operand modulo adders with included additional multiply and modulo reduction operations. The pipelined realization of the scaler in the Xilinx environment is shown and analyzed with respect to hardware amount and maximum pipelining frequency. The design is based on the LUTs(2⁶x 1) that simulate small RAMs serving as the main component for the look-up realization.

Słowa kluczowe

EN

scaling technique; Mixed-Radix System; MRS; Residue Number System; pipelining

• Wydawca: Wydawnictwo Politechniki Poznańskiej
• Czasopismo: Poznan University of Technology Academic Journals. Electrical Engineering
• Rocznik: 2013
• Tom: No. 76
• Strony: 89--99
• Opis fizyczny: Bibliogr. 15 poz., rys.

Twórcy

autor

Czyżak M.

• Gdańsk University of Technology

autor

Smyk R.

• Gdańsk University of Technology

autor

Ulman Z.

• Gdańsk University of Technology

Bibliografia

• [1] Szabo N.S, R.J., Tanaka R.J., Residue Arithmetic and its Applications to Computer Technology, New York, McGraw-Hill, 1967.
• [2] Soderstrand M. et al., Residue Number System Arithmetic. Modern Applications in Digital Signal Processing, IEEE Press, NY, 1986.
• [3] Omondi A., Premkumar B.: Residue Number Systems: Theory and Implementation, London, Imperial College Press, 2007.
• [4] Xilinx, Virtex-7, www.xilinx.com.
• [5] Jullien G.A.: Residue number scaling and other operations using ROM arrays, IEEE Trans, on Computers, Volume C-27, pp. 325-336, April 1978.
• [6] Taylor F.J., Huang C.H.: An autoscale residue multiplier, IEEE Trans, on Computers, Volume C-31, Number 4, pp. 321-325, April 1982.
• [7] Miller D.D., Polky J.N.: An implementation of the LMS algorithm in the residue number system, IEEE Trans, on Circuits and Syst., Volume 31, pp.452-461. May 1984.
• [8] Jenkins W.: Recent advances in residue number techniques for recursive digital filtering, IEEE Trans, on Acoust., Speech and Signal Processing, Volume 27, Number 1, pp. 19-30, Feb. 1979.
• [9] Shenoy M.A.P. , Kumaresan R: A fast and accurate RNS scaling technique for highspeed signal processing, IEEE Trans. Acoust. Speech, Signal Processing, Volume 37, pp. 929-937, June 1989.
• [10] Ulman Z.D., Czyżak M.: Highly parallel fast scaling of numbers in nonredundant residue arithmetic, IEEE Trans, on Signal Processing, Volume 46, pp. 487-496, Feb. 1998.
• [11] Meyer-Baese U., Stouraitis T.: New power-of-2 RNS scaling scheme for cell based IC design, IEEE Trans, on Large Scale Integration(VLSI) Systems, Volume 11, Number 2, pp. 280-283.
• [12] Griffin M., Sousa M., Taylor F.: Efficient scaling in the residue number system, Proc. ASSP'98, pp. 1075-1078.
• [13] Garcia A, Lloris A.: A look-up scheme for scaling in the RNS, IEEE Trans, on Computers, Volume 48, Number 7, pp. 748-751, July 1999.
• [14] Ulman Z., Czyżak M.: Scaling of numbers with implicit sign in residue arithmetic, XlXth National Conf. Circuit Theory and Electronic Networks, Volume 2, pp. 505-510, 1996.
• [15] Burgess N.: Scaling an RNS Number Using the Core Function, 16th IEEE Symposium on Computer Arithmetic 2003, Santiago de Compostela, Spain, pp. 262-269, 2003.