Rev | Line | |
---|
[37] | 1 | function Y = iqdft(X, A, L) |
---|
| 2 | % IQDFT Inverse discrete quaternion Fourier transform. |
---|
| 3 | % |
---|
| 4 | % This function computes the inverse discrete quaternion Fourier transform |
---|
| 5 | % of X. See the function qdft.m for details. Because this is an inverse |
---|
| 6 | % transform it divides (columns of) the result by N, the length of the |
---|
| 7 | % transform. |
---|
| 8 | |
---|
| 9 | % Copyright © 2005 Stephen J. Sangwine and Nicolas Le Bihan. |
---|
| 10 | % See the file : Copyright.m for further details. |
---|
| 11 | |
---|
| 12 | error(nargchk(3, 3, nargin)), error(nargoutchk(0, 1, nargout)) |
---|
| 13 | |
---|
| 14 | % We omit any check on the A and L parameters here, because the qdft |
---|
| 15 | % function does this and there is no need to duplicate it here. In the |
---|
| 16 | % unlikely event that -A has no meaning, an error will arise here. |
---|
| 17 | |
---|
| 18 | [N,M] = size(X); |
---|
| 19 | |
---|
| 20 | % We can compute the inverse transform by using the forward transform code |
---|
| 21 | % with a negated axis. |
---|
| 22 | |
---|
| 23 | Y = qdft(X, -A, L) ./ N; |
---|
Note: See
TracBrowser
for help on using the repository browser.