Novel high speed vedic mathematics multiplier using compressors
暂无分享,去创建一个
[1] Andrew D. Booth,et al. A SIGNED BINARY MULTIPLICATION TECHNIQUE , 1951 .
[2] Bruce A. Wooley,et al. A Two's Complement Parallel Array Multiplication Algorithm , 1973, IEEE Transactions on Computers.
[3] Low cost serial multipliers for high-speed specialised processors , 1988 .
[4] I. Koren. Computer arithmetic algorithms , 2018 .
[5] Shen-Fu Hsiao,et al. Design of high-speed low-power 3-2 counter and 4-2 compressor for fast multipliers , 1998 .
[6] A. P. Preethy,et al. Low power CMOS pass logic 4-2 compressor for high-speed multiplication , 2000, Proceedings of the 43rd IEEE Midwest Symposium on Circuits and Systems (Cat.No.CH37144).
[7] M.B. Srinivas,et al. An efficient method of elliptic curve encryption using Ancient Indian Vedic Mathematics , 2005, 48th Midwest Symposium on Circuits and Systems, 2005..
[8] Chan Mo Kim,et al. Multiplier design based on ancient Indian Vedic Mathematics , 2008, 2008 International SoC Design Conference.
[9] M. Ramalatha,et al. High speed energy efficient ALU design using Vedic multiplication techniques , 2009, 2009 International Conference on Advances in Computational Tools for Engineering Applications.
[10] T. N. Prabakar,et al. Design and implementation of two variable multiplier using KCM and Vedic Mathematics , 2012, 2012 1st International Conference on Recent Advances in Information Technology (RAIT).