Speedy Deconvolution using Vedic Mathematics
Full Text(PDF, 3000) PP.
| Author(s) |
|Rashmi K. Lomte, Prof.Bhaskar P.C|
| KEYWORDS |
Deconvolution, Non-Restoring algorithm, Urdhva Tiryagbhyam
Deconvolution is a computationally intensive digital signal processing (DSP) function widely used in applications such as imaging, wireless communication, seismology. In this paper deconvolution of two finite length sequences (NXM), is implemented using direct method to reduce deconvolution processing time. Vedic multiplier is used to achieve high speed. Urdhava Triyakbhyam algorithm of ancient Indian Vedic Mathematics is utilized to improve its efficiency. For division operation non-restoring algorithm is modified and used. The efficiency of the proposed convolution circuit is tested by embedding it on Spartan 3E FPGA. Simulation shows that ,the circuit has a delay of 79.595 ns from input to output using 90nm process library. It also provides the necessary modularity, expandability, and regularity to form different deconvolutions for any number of bits.
 John W. Pierre, “A Novel Method for Calculating the Convolution Sum
of Two Finite Length Sequences”, IEEE transaction on education,
VOL.39, NO. 1, 1996.
 Khader Mohammad, Sos Agaian, “Efficient FPGA implementation
of convolution”, Proceedings of the 2009 IEEE International
Conference on Systems, Man, and Cybernetics,San Antonio, TX,
USA - October 2009.
 Koren,I. Computer Arithemetic Algorithms,Prentice-Hall
 Hwang,K. Computer Arithmethmetic Principles,Arichitecture,and
design,John Wiley & Sons.
 Ramesh Pushpangadan, Vineeth Sukumaran, Rino Innocent,
Dinesh Sasikumar, Vaisak Sundarv, “High Speed Vedic Multiplier
for Digital Signal Processors” IETE, VOL.55,page 282-286