Implementation Of 64Bit High Speed Multiplier For DSP Application-Based On Vedic Mathematics

被引:0
作者
Jinesh, S. [1 ]
Ramesh, P. [2 ]
Thomas, Josmin [2 ]
机构
[1] Coll Engn Thalassery, Dept ECE, Kannur, Kerala, India
[2] Coll Engn Munnar, Dept ECE, Munnar, Kerala, India
来源
TENCON 2015 - 2015 IEEE REGION 10 CONFERENCE | 2015年
关键词
Cadence; Carry Select Adder; Urdhava tiryakbhyam; Vedic multiplier;
D O I
暂无
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
In modern days Digital Signal processors are one of the fastest growing segments as it has many applications in the various fields of engineering disciplines like Audio Signal Processing, Image Processing, wireless application etc. Like all other processors, a successful DSP processor should have maximum speed, higher code density and low power. For many DSP application specific processors speed is the major concerned parameter compared with other useful parameters like area and power. In the frequently used functions like Fast Fourier Transform (FFT), Discrete Cosine Transform (DCT), multiplication is the important function carried out internally. When we consider the speed of execution of these functions, the easiest way for the improvement is to enhance the performance of the multiplier units. Thus the implementation of fast multiplier will improve the performance of the current processors. Vedic mathematics based on ancestral Indian Vedas gives a different multiplication algorithm to carry out fast multiplication. In emerging technological world the data handling capacity is an important factor. So the implementation of a high end processor can make significant impact in the technological world. This paper proposes a new architecture for high end processor which gives better performance than existing architectures. In this work digital coding is done in Verilog HDL, synthesis of the design is done by using Xilinx ISE 14.7 and Cadence encounter RTL Compiler. Analysis of implemented digital system is done by using powerful cadence tool Encounter. Finally in this paper we analyse how speed and area changes when the number of bits increases.
引用
收藏
页数:5
相关论文
共 13 条
[1]  
AKHTER S, 2014, SIGN PROC INT NETW S, P470
[2]  
Bansal M., 2011, 2011 International Conference on Computational Intelligence and Communication Networks, Gwalior, P411, DOI DOI 10.1109/CICN.2011.86
[3]  
GUYOT A, 1987, IEEE T COMPUT, V36, P1144, DOI 10.1109/TC.1987.1676855
[4]  
Mehta Parth, 2009, Proceedings of the 2009 International Conference on Advances in Computing, Control, & Telecommunication Technologies (ACT 2009), P640, DOI 10.1109/ACT.2009.162
[5]  
Ortiz M, 2009, IEEE INT CONF ASAP, P207, DOI 10.1109/ASAP.2009.22
[6]   High Speed Vedic Multiplier for Digital Signal Processors [J].
Pushpangadan, Ramesh ;
Sukumaran, Vineeth ;
Innocent, Rino ;
Sasikumar, Dinesh ;
Sundar, Vaisak .
IETE JOURNAL OF RESEARCH, 2009, 55 (06) :282-286
[7]   Low-Power and Area-Efficient Carry Select Adder [J].
Ramkumar, B. ;
Kittur, Harish M. .
IEEE TRANSACTIONS ON VERY LARGE SCALE INTEGRATION (VLSI) SYSTEMS, 2012, 20 (02) :371-375
[8]  
Shah S., 2000, MICR 2000 ICM 2000 P
[9]  
Sindhu V., 2011, INT J MANAGEMENT IT, V1, P146
[10]  
Somani A., COMP VEDIC MULTIPLIE