summaryrefslogtreecommitdiff
diff options
context:
space:
mode:
authoravinashlalotra2025-03-19 11:50:36 +0530
committeravinashlalotra2025-03-19 11:50:36 +0530
commitaf964f81c3001d162ba1e934d9157508fec516fb (patch)
tree018687fc79f550e5c14b829107740b40780cf4bf
parenta9ab1158be6a5057cb9693c84c0355b99340857a (diff)
downloadFOSSEE-Signal-Processing-Toolbox-af964f81c3001d162ba1e934d9157508fec516fb.tar.gz
FOSSEE-Signal-Processing-Toolbox-af964f81c3001d162ba1e934d9157508fec516fb.tar.bz2
FOSSEE-Signal-Processing-Toolbox-af964f81c3001d162ba1e934d9157508fec516fb.zip
Update License and Author Info
-rw-r--r--macros/ifft2.sci13
-rw-r--r--macros/ifftn.sci12
-rw-r--r--macros/spencer.sci13
3 files changed, 33 insertions, 5 deletions
diff --git a/macros/ifft2.sci b/macros/ifft2.sci
index 762631d..80badd0 100644
--- a/macros/ifft2.sci
+++ b/macros/ifft2.sci
@@ -1,5 +1,14 @@
-Author: Abinash Singh <abinashsinghlalotra@gmail.com>
-*/
+// Copyright (C) 2018 - IIT Bombay - FOSSEE
+// This file must be used under the terms of the CeCILL.
+// This source file is licensed as described in the file COPYING, which
+// you should have received as part of this distribution. The terms
+// are also available at
+// http://www.cecill.info/licences/Licence_CeCILL_V2-en.txt
+// Original Source : https://octave.sourceforge.io/
+// Modifieded by: Abinash Singh Under FOSSEE Internship
+// Last Modified on : 19 March 2024
+// Organization: FOSSEE, IIT Bombay
+// Email: toolbox@scilab.in
/*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
diff --git a/macros/ifftn.sci b/macros/ifftn.sci
index 941dc67..6439bdc 100644
--- a/macros/ifftn.sci
+++ b/macros/ifftn.sci
@@ -1,4 +1,14 @@
-*/
+// Copyright (C) 2018 - IIT Bombay - FOSSEE
+// This file must be used under the terms of the CeCILL.
+// This source file is licensed as described in the file COPYING, which
+// you should have received as part of this distribution. The terms
+// are also available at
+// http://www.cecill.info/licences/Licence_CeCILL_V2-en.txt
+// Original Source : https://octave.sourceforge.io/
+// Modifieded by: Abinash Singh Under FOSSEE Internship
+// Last Modified on : 19 March 2024
+// Organization: FOSSEE, IIT Bombay
+// Email: toolbox@scilab.in
/*Description
Compute the inverse N-dimensional discrete Fourier transform of A using a Fast Fourier Transform (FFT) algorithm.
The optional vector argument SIZE may be used specify the dimensions of the matrix to be used.
diff --git a/macros/spencer.sci b/macros/spencer.sci
index 1b0f377..9fbc3ee 100644
--- a/macros/spencer.sci
+++ b/macros/spencer.sci
@@ -1,3 +1,14 @@
+// Copyright (C) 2018 - IIT Bombay - FOSSEE
+// This file must be used under the terms of the CeCILL.
+// This source file is licensed as described in the file COPYING, which
+// you should have received as part of this distribution. The terms
+// are also available at
+// http://www.cecill.info/licences/Licence_CeCILL_V2-en.txt
+// Original Source : https://octave.sourceforge.io/
+// Modifieded by: Abinash Singh Under FOSSEE Internship
+// Last Modified on : 19 March 2024
+// Organization: FOSSEE, IIT Bombay
+// Email: toolbox@scilab.in
function savg = spencer (x)
//Returns Spencer's 15 point moving average of each column of x.
//Calling Sequence:
@@ -21,8 +32,6 @@ function savg = spencer (x)
c = 1;
x = matrix(x, n, 1);
end
-
- end
w = [-3, -6, -5, 3, 21, 46, 67, 74, 67, 46, 21, 3, -5, -6, -3] / 320;
savg = filter (w, 1, x);
savg = [zeros(7,c); savg(15:n,:); zeros(7,c);];