/shared/development/google_code/rssoft/library/lib/RR_Factorization.h

Go to the documentation of this file.

/*
 Copyright 2013 Edouard Griffiths <f4exb at free dot fr>

 This file is part of RSSoft. A Reed-Solomon Soft Decoding library

 This program is free software; you can redistribute it and/or modify
 it under the terms of the GNU General Public License as published by
 the Free Software Foundation; either version 2 of the License, or
 (at your option) any later version.

 This program is distributed in the hope that it will be useful,
 but WITHOUT ANY WARRANTY; without even the implied warranty of
 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 GNU General Public License for more details.

 You should have received a copy of the GNU General Public License
 along with this program; if not, write to the Free Software
 Foundation, Inc., 51 Franklin Street, Boston, MA  02110-1301  USA

 Roth-Ruckenstein factorization class for soft decision decoding
 Optimized recursive strategy

 */
#ifndef __RR_FACTORIZATION_H__
#define __RR_FACTORIZATION_H__

#include "GFq_Polynomial.h"
#include "GFq_Element.h"
#include <vector>
#include <set>

namespace rssoft
{

namespace gf
{
class GFq;
class GFq_BivariatePolynomial;
}

class RR_Node
{
public:
        RR_Node(RR_Node *_parent,
                        const gf::GFq_BivariatePolynomial& _Q,
            const gf::GFq_Element& _coeff,
                        unsigned int _id);

        unsigned int get_id() const
        {
                return id;
        }

        int get_degree() const
        {
                return degree;
        }

        const gf::GFq_BivariatePolynomial& getQ() const
        {
                return Q;
        }

        const gf::GFq_Element& get_coeff() const
        {
                return coeff;
        }

        void add_ry(const gf::GFq_Element& root_y)
        {
                ry_set.insert(root_y);
        }

        bool is_in_ry_set(const gf::GFq_Element& root_y) const
        {
                std::set<gf::GFq_Element>::const_iterator e_it = ry_set.find(root_y);
                return e_it != ry_set.end();
        }

protected:
        RR_Node *parent; 
        const gf::GFq_BivariatePolynomial& Q; 
    const gf::GFq_Element& coeff; // !< Coefficient on the arc towards this node
        unsigned int id; 
        int degree; 
        std::set<gf::GFq_Element> ry_set; 

};

class RR_Factorization
{
public:
        RR_Factorization(const gf::GFq& _gf, unsigned int _k);

        ~RR_Factorization();

        void init();
    
    void set_verbosity(unsigned int _verbosity)
    {
        verbosity = _verbosity;
    }

        std::vector<gf::GFq_Polynomial>& run(const gf::GFq_BivariatePolynomial& polynomial);

protected:
        gf::GFq_Polynomial node_run(RR_Node& rr_node);

        const gf::GFq& gf; 
        unsigned int k;    
    unsigned int verbosity; 
    
        unsigned int t;    
        std::vector<gf::GFq_Polynomial> F; 
};

} // namespace rssoft

#endif // __RR_FACTORIZATION_H__