/data/development/ViennaCL/dev/viennacl/circulant_matrix.hpp

Go to the documentation of this file.

#ifndef _VIENNACL_CIRCULANT_MATRIX_HPP
#define _VIENNACL_CIRCULANT_MATRIX_HPP

/* =========================================================================
   Copyright (c) 2010-2011, Institute for Microelectronics,
                            Institute for Analysis and Scientific Computing,
                            TU Wien.

                            -----------------
                  ViennaCL - The Vienna Computing Library
                            -----------------

   Project Head:    Karl Rupp                   rupp@iue.tuwien.ac.at
               
   (A list of authors and contributors can be found in the PDF manual)

   License:         MIT (X11), see file LICENSE in the base directory
============================================================================= */

#include "viennacl/forwards.h"
#include "viennacl/vector.hpp"
#include "viennacl/ocl/context.hpp"

#include "viennacl/linalg/circulant_matrix_operations.hpp"

#include "viennacl/fft.hpp"

namespace viennacl 
{
    template<class SCALARTYPE, unsigned int ALIGNMENT>
    class circulant_matrix
    {
      public:     
        explicit circulant_matrix()
        {
          viennacl::linalg::kernels::fft<SCALARTYPE, 1>::init();
        }

        explicit circulant_matrix(std::size_t rows, std::size_t cols) : elements_(rows)
        {
          assert(rows == cols && "Circulant matrix must be square!");
          viennacl::linalg::kernels::fft<SCALARTYPE, 1>::init();
        }

        void resize(size_t sz, bool preserve = true)
        {
            elements_.resize(sz, preserve);
        }

        viennacl::ocl::handle<cl_mem> handle() const { return elements_.handle(); }

        viennacl::vector<SCALARTYPE, ALIGNMENT> & elements() { return elements_; }
        viennacl::vector<SCALARTYPE, ALIGNMENT> const & elements() const { return elements_; }

        std::size_t size1() const { return elements_.size(); }
        
        std::size_t size2() const { return elements_.size(); }

        std::size_t internal_size() const { return elements_.internal_size(); }

        entry_proxy<SCALARTYPE> operator()(std::size_t row_index, std::size_t col_index)
        {
            int index = static_cast<int>(row_index) - static_cast<int>(col_index);

            assert(row_index < size1() && col_index < size2() && "Invalid access");
            
            while (index < 0)
              index += size1();
            return elements_[index];
        }

        circulant_matrix<SCALARTYPE, ALIGNMENT>& operator +=(circulant_matrix<SCALARTYPE, ALIGNMENT>& that)
        {
            elements_ += that.elements();
            return *this;
        }

    private:
        circulant_matrix(circulant_matrix const & t) {}
        circulant_matrix & operator=(circulant_matrix const & t) {}
      
        viennacl::vector<SCALARTYPE, ALIGNMENT> elements_;
    };

    template <typename SCALARTYPE, unsigned int ALIGNMENT>
    void copy(std::vector<SCALARTYPE>& cpu_vec, circulant_matrix<SCALARTYPE, ALIGNMENT>& gpu_mat)
    {
        assert(cpu_vec.size() == gpu_mat.size1() && "Size mismatch");
        copy(cpu_vec, gpu_mat.elements());
    }

    template <typename SCALARTYPE, unsigned int ALIGNMENT>
    void copy(circulant_matrix<SCALARTYPE, ALIGNMENT>& gpu_mat, std::vector<SCALARTYPE>& cpu_vec)
    {
        assert(cpu_vec.size() == gpu_mat.size1() && "Size mismatch");
        copy(gpu_mat.elements(), cpu_vec);
    }

    template <typename SCALARTYPE, unsigned int ALIGNMENT, typename MATRIXTYPE>
    void copy(circulant_matrix<SCALARTYPE, ALIGNMENT>& circ_src, MATRIXTYPE& com_dst) {
        std::size_t size = circ_src.size1();
        assert(size == com_dst.size1() && "Size mismatch");
        assert(size == com_dst.size2() && "Size mismatch");
        std::vector<SCALARTYPE> tmp(size);
        copy(circ_src, tmp);

        for (std::size_t i = 0; i < size; i++) {
            for (std::size_t j = 0; j < size; j++) {
                int index = static_cast<int>(i) - static_cast<int>(j);
                if (index < 0)
                  index = size + index;
                com_dst(i, j) = tmp[index];
            }
        }
    }

    template <typename SCALARTYPE, unsigned int ALIGNMENT, typename MATRIXTYPE>
    void copy(MATRIXTYPE& com_src, circulant_matrix<SCALARTYPE, ALIGNMENT>& circ_dst) {
        std::size_t size = circ_dst.size1();
        assert(size == com_src.size1() && "Size mismatch");
        assert(size == com_src.size2() && "Size mismatch");

        std::vector<SCALARTYPE> tmp(size);

        for(std::size_t i = 0; i < size; i++) tmp[i] = com_src(i, 0);

        copy(tmp, circ_dst);
    }

    /*namespace linalg
    {
      template <typename SCALARTYPE, unsigned int ALIGNMENT, unsigned int VECTOR_ALIGNMENT>
      void prod_impl(circulant_matrix<SCALARTYPE, ALIGNMENT> const & mat,
                      vector<SCALARTYPE, VECTOR_ALIGNMENT> const & vec,
                      vector<SCALARTYPE, VECTOR_ALIGNMENT>& result) {
          viennacl::vector<SCALARTYPE, VECTOR_ALIGNMENT> circ(mat.elements().size() * 2);
          fft::real_to_complex(mat.elements(), circ, mat.elements().size());

          viennacl::vector<SCALARTYPE, VECTOR_ALIGNMENT> tmp(vec.size() * 2);
          viennacl::vector<SCALARTYPE, VECTOR_ALIGNMENT> tmp2(vec.size() * 2);

          fft::real_to_complex(vec, tmp, vec.size());
          fft::convolve(circ, tmp, tmp2);
          fft::complex_to_real(tmp2, result, vec.size());
      }
    }*/

    template<class SCALARTYPE, unsigned int ALIGNMENT>
    std::ostream & operator<<(std::ostream& s, circulant_matrix<SCALARTYPE, ALIGNMENT>& gpu_matrix)
    {
        std::size_t size = gpu_matrix.size1();
        std::vector<SCALARTYPE> tmp(size);
        copy(gpu_matrix, tmp);
        s << "[" << size << "," << size << "](";

        for(std::size_t i = 0; i < size; i++) {
            s << "(";
            for(std::size_t j = 0; j < size; j++) {
                int index = (int)i - (int)j;
                if(index < 0) index = size + index;
                s << tmp[index];
                //s << index;
                if(j < (size - 1)) s << ",";
            }
            s << ")";
        }
        s << ")";
        return s;
    }
}

#endif // _VIENNACL_CIRCULANT_MATRIX_HPP