diff options
Diffstat (limited to 'macros/ifft2.sci')
| -rw-r--r-- | macros/ifft2.sci | 49 |
1 files changed, 24 insertions, 25 deletions
diff --git a/macros/ifft2.sci b/macros/ifft2.sci index 762631d..e2772b2 100644 --- a/macros/ifft2.sci +++ b/macros/ifft2.sci @@ -1,29 +1,28 @@ -Author: Abinash Singh <abinashsinghlalotra@gmail.com>
-*/
-/*Description
- Calculates the inverse two-dimensional discrete Fourier transform of A using a Fast Fourier Transform algorithm.
- It performs inverse two-dimensional FFT on the matrix A. m and n may be used specify the number of rows and columns of A to use. If either of these is larger
- than the size of A, A is resized and padded with zeros.
- If A is a multi-dimensional matrix, each two-dimensional sub-matrix of A is treated separately.
-Calling Sequence
- ifft2 (A)
- ifft2 (A, m, n)
-Parameters
- A: input matrix
- m: number of rows of A to be used
- n: number of columns of A to be used
-Examples
- A= [1 2 3; 4 5 6; 7 8 9]
- m = 4
- n = 4
- ifft2 (A, m, n) --functionCall
- ans =
- 2.81250 + 0.00000i -0.37500 + 0.93750i 0.93750 + 0.00000i -0.37500 - 0.93750i
- -1.12500 + 0.93750i -0.31250 - 0.50000i -0.37500 + 0.31250i 0.31250 + 0.25000i
- 0.93750 + 0.00000i -0.12500 + 0.31250i 0.31250 + 0.00000i -0.12500 - 0.31250i
- -1.12500 - 0.93750i 0.31250 - 0.25000i -0.37500 - 0.31250i -0.31250 + 0.50000i
-*/
+
function res = ifft2(A, m, n)
+// Description
+// Calculates the inverse two-dimensional discrete Fourier transform of A using a Fast Fourier Transform algorithm.
+// It performs inverse two-dimensional FFT on the matrix A. m and n may be used specify the number of rows and columns of A to use. If either of these is larger
+// than the size of A, A is resized and padded with zeros.
+// If A is a multi-dimensional matrix, each two-dimensional sub-matrix of A is treated separately.
+// Calling Sequence
+// ifft2 (A)
+// ifft2 (A, m, n)
+// Parameters
+// A: input matrix
+// m: number of rows of A to be used
+// n: number of columns of A to be used
+// Examples
+// A= [1 2 3; 4 5 6; 7 8 9]
+// m = 4
+// n = 4
+// ifft2 (A, m, n) --functionCall
+// ans =
+// 2.81250 + 0.00000i -0.37500 + 0.93750i 0.93750 + 0.00000i -0.37500 - 0.93750i
+// -1.12500 + 0.93750i -0.31250 - 0.50000i -0.37500 + 0.31250i 0.31250 + 0.25000i
+// 0.93750 + 0.00000i -0.12500 + 0.31250i 0.31250 + 0.00000i -0.12500 - 0.31250i
+// -1.12500 - 0.93750i 0.31250 - 0.25000i -0.37500 - 0.31250i -0.31250 + 0.50000i
+
funcprot(0);
lhs = argn(1)
rhs = argn(2)
|