Research Article

Discrete Time Convolution is Multiplication without Carry

Innocent E. Okoloko
Dennis Osadebay University, Nigeria
* Corresponding author
DOI icon 10.24018/ejece.2021.5.5.358

Read Counter
308

Downloads
296

Citations

Share

Article Sidebar

Submitted 2021-08-28
Published 2021-10-31

Read counter = 308 times

Table of Contents

Article Main Content

In this paper an analysis of discrete-time convolution is performed to prove that the convolution sum is polynomial multiplication without carry, whether the sequences are finite or not, by using several examples to compare the results computed using the existing approaches to the polynomial multiplication approach presented here. In the design and analysis of signals and systems the concept of convolution is very important. While software tools are available for calculating convolution, for proper understanding it is important to learn now to calculate it by hand. To this end, several popular methods are available. The idea that the convolution sum is indeed polynomial multiplication without carry is demonstrated in this paper. The concept is further extended to deconvolution, N-point circular convolution and the Z-transform approach.

Keywords: Convolution, deconvolution, N-point circular convolution, Z-transform

References

  1. B. P. Lathi, Linear Systems and Signals. Carmichael, CA: Berkeley-Cambridge, 1998.
     Google Scholar
  2. S. S. Soliman and M. D. Srinath, Continuous and Discrete Signals and Systems. Englewood Cliffs, NJ: Prentice-Hall, 1990.
     Google Scholar
  3. R. D. Strum and D. E. Kirk, First Principles of Discrete Systems and Digital Signal Processing. Reading, MA: Addison-Wesley, 1988.
     Google Scholar
  4. J. G. Proakis and D. G. Manolakis, Digital Signal Processing: Principles, Algorithm, and Applications, 4th ed. Upper Saddle River, NJ: Prentice-Hall, 2007.
     Google Scholar
  5. A. V. Oppenheim and R. W. Schafer, Discrete-Time Signal Processing, 3rd ed. Upper Saddle River, NJ: Prentice-Hall, 2014.
     Google Scholar
  6. A. V. Oppenheim, A. S. Willsky and S. H. Nawab, Signals and Systems, 2nd ed. Upper Saddle River, NJ: Prentice-Hall, 1997.
     Google Scholar
  7. J. W. Pierre, ?A Novel Method for Calculating the Convolution Sum of Two Finite Length Sequences,? IEEE Trans. Education, vol. 39, no. 1, pp. 77?80, Feb. 1996.
     Google Scholar
  8. I. E. Okoloko, ?Unified Vector Multiplication Approach for Calculating Convolution and Correlation,? European Journal of Engineering and Technology Research, vol. 6, no. 4, pp. 129?134, Jun. 2021.
     Google Scholar