function y = fft13(x,u,ip,op) % y = fft13(x,u,ip,op) % y : the 13 point DFT of x % u : a vector of precomputed multiplicative constants % ip : input permutation % op : ouput permutation y = zeros(13,1); x = x(ip); % input permutation x(2:13) = KRED([2,3],[2,1],2,x(2:13)); % reduction operations y(1) = x(1)+x(2); % DC term calculation % -------------------- block : 1 ------------------------------------------------- y(2) = x(2)*u(1); % -------------------- block : 2 ------------------------------------------------- y(3) = x(3)*u(2); % -------------------- block : 4 ------------------------------------------------- v = ID2I(1,1,x(4:5)); % v = (I(1) kron D2 kron I(1)) * x(4:5) v = v.*u(3:5); y(4:5) = ID2tI(1,1,v); % y(4:5) = (I(1) kron D2' kron I(1)) * v % -------------------- block : 3 ------------------------------------------------- v = ID2I(1,1,x(6:7)); % v = (I(1) kron D2 kron I(1)) * x(6:7) v = v.*u(6:8); y(6:7) = ID2tI(1,1,v); % y(6:7) = (I(1) kron D2' kron I(1)) * v % -------------------- block : 6 = 2 * 3 ----------------------------------------- v = ID2I(1,1,x(8:9)); % v = (I(1) kron D2 kron I(1)) * x(8:9) v = v.*u(9:11); y(8:9) = ID2tI(1,1,v); % y(8:9) = (I(1) kron D2' kron I(1)) * v % -------------------- block : 12 = 4 * 3 ---------------------------------------- v = ID2I(1,2,x(10:13)); % v = (I(1) kron D2 kron I(2)) * x(10:13) v = ID2I(3,1,v); % v = (I(3) kron D2 kron I(1)) * v v = v.*u(12:20); v = ID2tI(1,3,v); % v = (I(1) kron D2' kron I(3)) * v y(10:13) = ID2tI(2,1,v); % y(10:13) = (I(2) kron D2' kron I(1)) * v % -------------------------------------------------------------------------------- y(2) = y(1)+y(2); % DC term calculation y(2:13) = tKRED([2,3],[2,1],2,y(2:13)); % transpose reduction operations y = y(op); % output permutation % For complex data - % Total Number of Real Multiplications : 40 % Total Number of Real Additions: 188