Performance analysis for 2-D convolution implemented with the 2-D Modified Discrete Fourier Transform

C. Radhakrishnan, W. K. Jenkins

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

Recently the Quadratic Modified Fermat Number Transform (QMFNT) was extended to an analogous Modified Discrete Fourier Transform (MDFT) that enables overlap-add FFT block processing to be implemented without zero padding, resulting in reduced computational complexity and lower power requirements for nanoscale VLSI implementations. The MDFT was then extended into two dimensions and an experimental example was presented to illustrate how the 2-D extension manages two-dimensional wrap around effects. This paper presents an analysis of the how the modulation parameters should be chosen under various circumstances and how the computational complexity of the 2D-MDFT compares with more traditional 2D-FFT block processing.

Original languageEnglish (US)
Title of host publicationConference Record of the 46th Asilomar Conference on Signals, Systems and Computers, ASILOMAR 2012
Pages835-839
Number of pages5
DOIs
StatePublished - 2012
Event46th Asilomar Conference on Signals, Systems and Computers, ASILOMAR 2012 - Pacific Grove, CA, United States
Duration: Nov 4 2012Nov 7 2012

Publication series

NameConference Record - Asilomar Conference on Signals, Systems and Computers
ISSN (Print)1058-6393

Other

Other46th Asilomar Conference on Signals, Systems and Computers, ASILOMAR 2012
Country/TerritoryUnited States
CityPacific Grove, CA
Period11/4/1211/7/12

All Science Journal Classification (ASJC) codes

  • Signal Processing
  • Computer Networks and Communications

Fingerprint

Dive into the research topics of 'Performance analysis for 2-D convolution implemented with the 2-D Modified Discrete Fourier Transform'. Together they form a unique fingerprint.

Cite this