Chris@49: // Copyright (C) 2013 Conrad Sanderson
Chris@49: // Copyright (C) 2013 NICTA (www.nicta.com.au)
Chris@49: // 
Chris@49: // This Source Code Form is subject to the terms of the Mozilla Public
Chris@49: // License, v. 2.0. If a copy of the MPL was not distributed with this
Chris@49: // file, You can obtain one at http://mozilla.org/MPL/2.0/.
Chris@49: 
Chris@49: 
Chris@49: 
Chris@49: //! \addtogroup op_fft
Chris@49: //! @{
Chris@49: 
Chris@49: 
Chris@49: 
Chris@49: //
Chris@49: // op_fft_real
Chris@49: 
Chris@49: 
Chris@49: 
Chris@49: template<typename T1>
Chris@49: inline
Chris@49: void
Chris@49: op_fft_real::apply( Mat< std::complex<typename T1::pod_type> >& out, const mtOp<std::complex<typename T1::pod_type>,T1,op_fft_real>& in )
Chris@49:   {
Chris@49:   arma_extra_debug_sigprint();
Chris@49:   
Chris@49:   typedef typename T1::pod_type         in_eT;
Chris@49:   typedef typename std::complex<in_eT> out_eT;
Chris@49:   
Chris@49:   const Proxy<T1> P(in.m);
Chris@49:   
Chris@49:   const uword n_rows = P.get_n_rows();
Chris@49:   const uword n_cols = P.get_n_cols();
Chris@49:   const uword n_elem = P.get_n_elem();
Chris@49:   
Chris@49:   const bool is_vec = ( (n_rows == 1) || (n_cols == 1) );
Chris@49:   
Chris@49:   const uword N_orig = (is_vec)              ? n_elem         : n_rows;
Chris@49:   const uword N_user = (in.aux_uword_b == 0) ? in.aux_uword_a : N_orig;
Chris@49:   
Chris@49:   fft_engine<out_eT,false> worker(N_user);
Chris@49:   
Chris@49:   // no need to worry about aliasing, as we're going from a real object to complex complex, which by definition cannot alias
Chris@49:   
Chris@49:   if(is_vec)
Chris@49:     {
Chris@49:     (n_cols == 1) ? out.set_size(N_user, 1) : out.set_size(1, N_user);
Chris@49:     
Chris@49:     if( (out.n_elem == 0) || (N_orig == 0) )
Chris@49:       {
Chris@49:       out.zeros();
Chris@49:       return;
Chris@49:       }
Chris@49:     
Chris@49:     if( (N_user == 1) && (N_orig >= 1) )
Chris@49:       {
Chris@49:       out[0] = out_eT( P[0] );
Chris@49:       return;
Chris@49:       }
Chris@49:     
Chris@49:     podarray<out_eT> data(N_user);
Chris@49:     
Chris@49:     out_eT* data_mem = data.memptr();
Chris@49:     
Chris@49:     if(N_user > N_orig)  { arrayops::inplace_set( &data_mem[N_orig], out_eT(0), (N_user - N_orig) ); }
Chris@49:     
Chris@49:     const uword N = (std::min)(N_user, N_orig);
Chris@49:     
Chris@49:     if(Proxy<T1>::prefer_at_accessor == false)
Chris@49:       {
Chris@49:       typename Proxy<T1>::ea_type X = P.get_ea();
Chris@49:       
Chris@49:       for(uword i=0; i < N; ++i)  { data_mem[i] = out_eT( X[i], in_eT(0) ); }
Chris@49:       }
Chris@49:     else
Chris@49:       {
Chris@49:       if(n_cols == 1)
Chris@49:         {
Chris@49:         for(uword i=0; i < N; ++i)  { data_mem[i] = out_eT( P.at(i,0), in_eT(0) ); }
Chris@49:         }
Chris@49:       else
Chris@49:         {
Chris@49:         for(uword i=0; i < N; ++i)  { data_mem[i] = out_eT( P.at(0,i), in_eT(0) ); }
Chris@49:         }
Chris@49:       }
Chris@49:     
Chris@49:     worker.run( out.memptr(), data_mem );
Chris@49:     }
Chris@49:   else
Chris@49:     {
Chris@49:     // process each column seperately
Chris@49:     
Chris@49:     out.set_size(N_user, n_cols);
Chris@49:     
Chris@49:     if( (out.n_elem == 0) || (N_orig == 0) )
Chris@49:       {
Chris@49:       out.zeros();
Chris@49:       return;
Chris@49:       }
Chris@49:     
Chris@49:     if( (N_user == 1) && (N_orig >= 1) )
Chris@49:       {
Chris@49:       for(uword col=0; col < n_cols; ++col)  { out.at(0,col) = out_eT( P.at(0,col) ); }
Chris@49:       
Chris@49:       return;
Chris@49:       }
Chris@49:     
Chris@49:     podarray<out_eT> data(N_user);
Chris@49:     
Chris@49:     out_eT* data_mem = data.memptr();
Chris@49:     
Chris@49:     if(N_user > N_orig)  { arrayops::inplace_set( &data_mem[N_orig], out_eT(0), (N_user - N_orig) ); }
Chris@49:     
Chris@49:     const uword N = (std::min)(N_user, N_orig);
Chris@49:     
Chris@49:     for(uword col=0; col < n_cols; ++col)
Chris@49:       {
Chris@49:       for(uword i=0; i < N; ++i)  { data_mem[i] = P.at(i, col); }
Chris@49:       
Chris@49:       worker.run( out.colptr(col), data_mem );
Chris@49:       }
Chris@49:     }
Chris@49:   }
Chris@49: 
Chris@49: 
Chris@49: 
Chris@49: //
Chris@49: // op_fft_cx
Chris@49: 
Chris@49: 
Chris@49: template<typename T1>
Chris@49: inline
Chris@49: void
Chris@49: op_fft_cx::apply(Mat<typename T1::elem_type>& out, const Op<T1,op_fft_cx>& in)
Chris@49:   {
Chris@49:   arma_extra_debug_sigprint();
Chris@49:   
Chris@49:   typedef typename T1::elem_type eT;
Chris@49:   
Chris@49:   const Proxy<T1> P(in.m);
Chris@49:   
Chris@49:   if(P.is_alias(out) == false)
Chris@49:     {
Chris@49:     op_fft_cx::apply_noalias<T1,false>(out, P, in.aux_uword_a, in.aux_uword_b);
Chris@49:     }
Chris@49:   else
Chris@49:     {
Chris@49:     Mat<eT> tmp;
Chris@49:     
Chris@49:     op_fft_cx::apply_noalias<T1,false>(tmp, P, in.aux_uword_a, in.aux_uword_b);
Chris@49:     
Chris@49:     out.steal_mem(tmp);
Chris@49:     }
Chris@49:   }
Chris@49:   
Chris@49: 
Chris@49: 
Chris@49: template<typename T1, bool inverse>
Chris@49: inline
Chris@49: void
Chris@49: op_fft_cx::apply_noalias(Mat<typename T1::elem_type>& out, const Proxy<T1>& P, const uword a, const uword b)
Chris@49:   {
Chris@49:   arma_extra_debug_sigprint();
Chris@49:   
Chris@49:   typedef typename T1::elem_type eT;
Chris@49:   
Chris@49:   const uword n_rows = P.get_n_rows();
Chris@49:   const uword n_cols = P.get_n_cols();
Chris@49:   const uword n_elem = P.get_n_elem();
Chris@49:   
Chris@49:   const bool is_vec = ( (n_rows == 1) || (n_cols == 1) );
Chris@49:   
Chris@49:   const uword N_orig = (is_vec) ? n_elem : n_rows;
Chris@49:   const uword N_user = (b == 0) ? a      : N_orig;
Chris@49:   
Chris@49:   fft_engine<eT,inverse> worker(N_user);
Chris@49:   
Chris@49:   if(is_vec)
Chris@49:     {
Chris@49:     (n_cols == 1) ? out.set_size(N_user, 1) : out.set_size(1, N_user);
Chris@49:     
Chris@49:     if( (out.n_elem == 0) || (N_orig == 0) )
Chris@49:       {
Chris@49:       out.zeros();
Chris@49:       return;
Chris@49:       }
Chris@49:     
Chris@49:     if( (N_user == 1) && (N_orig >= 1) )
Chris@49:       {
Chris@49:       out[0] = P[0];
Chris@49:       return;
Chris@49:       }
Chris@49:     
Chris@49:     if( (N_user > N_orig) || (is_Mat<typename Proxy<T1>::stored_type>::value == false) )
Chris@49:       {
Chris@49:       podarray<eT> data(N_user);
Chris@49:       
Chris@49:       eT* data_mem = data.memptr();
Chris@49:       
Chris@49:       if(N_user > N_orig)  { arrayops::inplace_set( &data_mem[N_orig], eT(0), (N_user - N_orig) ); }
Chris@49:       
Chris@49:       op_fft_cx::copy_vec( data_mem, P, (std::min)(N_user, N_orig) );
Chris@49:       
Chris@49:       worker.run( out.memptr(), data_mem );
Chris@49:       }
Chris@49:     else
Chris@49:       {
Chris@49:       const unwrap< typename Proxy<T1>::stored_type > tmp(P.Q);
Chris@49:       
Chris@49:       worker.run( out.memptr(), tmp.M.memptr() );
Chris@49:       }
Chris@49:     }
Chris@49:   else
Chris@49:     {
Chris@49:     // process each column seperately
Chris@49:     
Chris@49:     out.set_size(N_user, n_cols);
Chris@49:     
Chris@49:     if( (out.n_elem == 0) || (N_orig == 0) )
Chris@49:       {
Chris@49:       out.zeros();
Chris@49:       return;
Chris@49:       }
Chris@49:     
Chris@49:     if( (N_user == 1) && (N_orig >= 1) )
Chris@49:       {
Chris@49:       for(uword col=0; col < n_cols; ++col)  { out.at(0,col) = P.at(0,col); }
Chris@49:       
Chris@49:       return;
Chris@49:       }
Chris@49:     
Chris@49:     if( (N_user > N_orig) || (is_Mat<typename Proxy<T1>::stored_type>::value == false) )
Chris@49:       {
Chris@49:       podarray<eT> data(N_user);
Chris@49:       
Chris@49:       eT* data_mem = data.memptr();
Chris@49:       
Chris@49:       if(N_user > N_orig)  { arrayops::inplace_set( &data_mem[N_orig], eT(0), (N_user - N_orig) ); }
Chris@49:       
Chris@49:       const uword N = (std::min)(N_user, N_orig);
Chris@49:       
Chris@49:       for(uword col=0; col < n_cols; ++col)
Chris@49:         {
Chris@49:         for(uword i=0; i < N; ++i)  { data_mem[i] = P.at(i, col); }
Chris@49:         
Chris@49:         worker.run( out.colptr(col), data_mem );
Chris@49:         }
Chris@49:       }
Chris@49:     else
Chris@49:       {
Chris@49:       const unwrap< typename Proxy<T1>::stored_type > tmp(P.Q);
Chris@49:       
Chris@49:       for(uword col=0; col < n_cols; ++col)
Chris@49:         {
Chris@49:         worker.run( out.colptr(col), tmp.M.colptr(col) );
Chris@49:         }
Chris@49:       }
Chris@49:     }
Chris@49:     
Chris@49:   
Chris@49:   // correct the scaling for the inverse transform
Chris@49:   if(inverse == true)
Chris@49:     {
Chris@49:     typedef typename get_pod_type<eT>::result T;
Chris@49:     
Chris@49:     const T k = T(1) / T(N_user);
Chris@49:     
Chris@49:     eT* out_mem = out.memptr();
Chris@49:     
Chris@49:     const uword out_n_elem = out.n_elem;
Chris@49:     
Chris@49:     for(uword i=0; i < out_n_elem; ++i)  { out_mem[i] *= k; }
Chris@49:     }
Chris@49:   }
Chris@49: 
Chris@49: 
Chris@49: 
Chris@49: template<typename T1>
Chris@49: arma_hot
Chris@49: inline
Chris@49: void
Chris@49: op_fft_cx::copy_vec(typename Proxy<T1>::elem_type* dest, const Proxy<T1>& P, const uword N)
Chris@49:   {
Chris@49:   arma_extra_debug_sigprint();
Chris@49:   
Chris@49:   if(is_Mat< typename Proxy<T1>::stored_type >::value == true)
Chris@49:     {
Chris@49:     op_fft_cx::copy_vec_unwrap(dest, P, N);
Chris@49:     }
Chris@49:   else
Chris@49:     {
Chris@49:     op_fft_cx::copy_vec_proxy(dest, P, N);
Chris@49:     }
Chris@49:   }
Chris@49: 
Chris@49: 
Chris@49: 
Chris@49: template<typename T1>
Chris@49: arma_hot
Chris@49: inline
Chris@49: void
Chris@49: op_fft_cx::copy_vec_unwrap(typename Proxy<T1>::elem_type* dest, const Proxy<T1>& P, const uword N)
Chris@49:   {
Chris@49:   arma_extra_debug_sigprint();
Chris@49:   
Chris@49:   const unwrap< typename Proxy<T1>::stored_type > tmp(P.Q);
Chris@49:   
Chris@49:   arrayops::copy(dest, tmp.M.memptr(), N);
Chris@49:   }
Chris@49: 
Chris@49: 
Chris@49: 
Chris@49: template<typename T1>
Chris@49: arma_hot
Chris@49: inline
Chris@49: void
Chris@49: op_fft_cx::copy_vec_proxy(typename Proxy<T1>::elem_type* dest, const Proxy<T1>& P, const uword N)
Chris@49:   {
Chris@49:   arma_extra_debug_sigprint();
Chris@49:   
Chris@49:   if(Proxy<T1>::prefer_at_accessor == false)
Chris@49:     {
Chris@49:     typename Proxy<T1>::ea_type X = P.get_ea();
Chris@49:     
Chris@49:     for(uword i=0; i < N; ++i)  { dest[i] = X[i]; }
Chris@49:     }
Chris@49:   else
Chris@49:     {
Chris@49:     if(P.get_n_cols() == 1)
Chris@49:       {
Chris@49:       for(uword i=0; i < N; ++i)  { dest[i] = P.at(i,0); }
Chris@49:       }
Chris@49:     else
Chris@49:       {
Chris@49:       for(uword i=0; i < N; ++i)  { dest[i] = P.at(0,i); }
Chris@49:       }
Chris@49:     }
Chris@49:   }
Chris@49: 
Chris@49: 
Chris@49: 
Chris@49: //
Chris@49: // op_ifft_cx
Chris@49: 
Chris@49: 
Chris@49: template<typename T1>
Chris@49: inline
Chris@49: void
Chris@49: op_ifft_cx::apply(Mat<typename T1::elem_type>& out, const Op<T1,op_ifft_cx>& in)
Chris@49:   {
Chris@49:   arma_extra_debug_sigprint();
Chris@49:   
Chris@49:   typedef typename T1::elem_type eT;
Chris@49:   
Chris@49:   const Proxy<T1> P(in.m);
Chris@49:   
Chris@49:   if(P.is_alias(out) == false)
Chris@49:     {
Chris@49:     op_fft_cx::apply_noalias<T1,true>(out, P, in.aux_uword_a, in.aux_uword_b);
Chris@49:     }
Chris@49:   else
Chris@49:     {
Chris@49:     Mat<eT> tmp;
Chris@49:     
Chris@49:     op_fft_cx::apply_noalias<T1,true>(tmp, P, in.aux_uword_a, in.aux_uword_b);
Chris@49:     
Chris@49:     out.steal_mem(tmp);
Chris@49:     }
Chris@49:   }
Chris@49:   
Chris@49: 
Chris@49: 
Chris@49: //! @}