What is $N$,N-point Discrete fourier transform? Is it different from 2D Fourier transform?

and how to compute $N$, N-point Discrete Fourier Transform of a given laplacian filter kernel? say for a given filter {{0, 2, 0}, {1, -2, 1}, {0, 2, 0}}, where $N = 103$ and frequency and spatial indices ranges from -100 to 100, without using fft2 and ifft2 functions.

  • 1
    $\begingroup$ The word sounds like, yes, a square 2D DFT. But: to be certain, we'd need to know the context in which this arose. $\endgroup$ – Marcus Müller Nov 16 '20 at 16:00
  • 1
    $\begingroup$ Please provide a quote or reference where found this term $\endgroup$ – Hilmar Nov 16 '20 at 19:05
  • 1
    $\begingroup$ More conventionally a two-dimensional (2D) discrete-Fourier transform $X[k_1,k_2]$ is labelled like: $N \times M$-point 2D-DFT, where $N$ refers to first dimension and $M$ to the second. $\endgroup$ – Fat32 Nov 16 '20 at 19:37
  • 1
    $\begingroup$ Voting to close this as lacking detail since no clarification regarding context was given, sadly :( $\endgroup$ – Marcus Müller Nov 17 '20 at 10:24

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Browse other questions tagged or ask your own question.