Scilab Website | Contribute with GitLab | Mailing list archives | ATOMS toolboxes
Scilab Online Help
5.5.1 - English

Change language to:
Français - 日本語 - Português - Русский

Please note that the recommended version of Scilab is 2024.1.0. This page might be outdated.
However, this page did not exist in the previous stable version.

Scilab Help >> Signal Processing > transforms > mfft

mfft

multi-dimensional fft. This function is obsolete.

Calling Sequence

[xk]=mfft(x,flag,dim)

Arguments

x

x(i,j,k,...) input signal in the form of a row vector whose values are arranged so that the i index runs the quickest, followed by the j index, etc.

flag

(-1) FFT or (1) inverse FFT

dim

dimension vector which gives the number of values of x for each of its indices.

xk

output of multidimensional fft in same format as for x

Description

FFT for a multi-dimensional signal

For example for a three dimensional vector which has three points along its first dimension, two points along its second dimension and three points along its third dimension the row vector is arranged as follows

x=[x(1,1,1),x(2,1,1),x(3,1,1),...
   x(1,2,1),x(2,2,1),x(3,2,1),...
   x(1,1,2),x(2,1,2),x(3,1,2),...
   x(1,2,2),x(2,2,2),x(3,2,2),...
   x(1,1,3),x(2,1,3),x(3,1,3),...
   x(1,2,3),x(2,2,3),x(3,2,3)]

and the dim vector is: dim=[3,2,3]

mfft is superseeded by fft: mfft(x,flag,dim) is equivalent to matrix(fft(matrix(x,dim),flag),size(x)).

This function is obsolete.
It is better to use fft instead of mfft

See also

  • fft — fast Fourier transform.

History

VersionDescription
5.5.0 Function tagged as obsolete. Will be removed in 5.5.1. Please use fft instead.
Report an issue
<< hilb transforms cepstrum >>

Copyright (c) 2022-2024 (Dassault Systèmes)
Copyright (c) 2017-2022 (ESI Group)
Copyright (c) 2011-2017 (Scilab Enterprises)
Copyright (c) 1989-2012 (INRIA)
Copyright (c) 1989-2007 (ENPC)
with contributors
Last updated:
Thu Oct 02 13:46:50 CEST 2014