/* -*- c++ -*- */
/*
 * Copyright 2018 hcab14@mail.com.
 *
 * This 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 3, or (at your option)
 * any later version.
 *
 * This software 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 software; see the file COPYING.  If not, write to
 * the Free Software Foundation, Inc., 51 Franklin Street,
 * Boston, MA 02110-1301, USA.
 */

#ifdef HAVE_CONFIG_H
#include "config.h"
#endif

#include <boost/format.hpp>

#include <gnuradio/math.h>
#include <gnuradio/expj.h>
#include <gnuradio/io_signature.h>
#include <gnuradio/logger.h>

#include <volk/volk.h>

#include "viterbi27_impl.h"

namespace gr {
namespace digitalhf {

viterbi27::sptr
viterbi27::make(std::uint32_t pol0, std::uint32_t pol1)
{
  return sptr(new viterbi27_impl(pol0, pol1));
}

viterbi27_impl::viterbi27_impl(std::uint32_t pol0, std::uint32_t pol1)
  : _v({pol0, pol1})
  , _quality(0)
  , _num_bits(0)
  , _bits()
{
}

viterbi27_impl::~viterbi27_impl()
{
}

void viterbi27_impl::reset() {
  _v.reset();
  _quality = 0;
}


const std::vector<std::uint8_t>& viterbi27_impl::udpate(const std::vector<float>& soft_dec) {
  size_t symb_len = soft_dec.size();
  float const *sd = &soft_dec[0];

  size_t const num_bits = symb_len/2;
  _bits.resize(num_bits);
  std::vector<uint8_t>::iterator iterator_bits = _bits.begin();

  size_t bits_per_frame = 5*7; // 5 times constraint length
  _v.resize(bits_per_frame);

  size_t num_frames = num_bits/bits_per_frame;

  _quality = 0;
  int i = 0;
  for (; i<num_frames; ++i) {
    for (int j=0; j<bits_per_frame; ++j) {
      std::array<std::uint8_t, 2> const symb = {
        table_lookup(sd[2*(i*bits_per_frame+j)  ]),
        table_lookup(sd[2*(i*bits_per_frame+j)+1])
      };
      _v.update(j, symb);
    }
    _quality      += _v.chainback(iterator_bits, iterator_bits+bits_per_frame);
    iterator_bits += bits_per_frame;
  }

  size_t remaining_bits = num_bits - bits_per_frame*num_frames;
  _v.resize(remaining_bits);
  for (int j=0; j<remaining_bits; ++j) {
    std::array<std::uint8_t, 2> const symb = {
      table_lookup(sd[2*(i*bits_per_frame+j)  ]),
      table_lookup(sd[2*(i*bits_per_frame+j)+1])
    };
    _v.update(j, symb);
  }
  _quality += _v.chainback(iterator_bits, iterator_bits+remaining_bits);
  return _bits;
}

float viterbi27_impl::quality() {
  return _quality;
}

} // namespace digitalhf
} // namespace gr