mirror of
https://github.com/gnss-sdr/gnss-sdr
synced 2024-12-14 12:10:34 +00:00
Clean file
This commit is contained in:
parent
4248edc4f3
commit
345646ad7d
@ -1,11 +1,13 @@
|
|||||||
/*!
|
/*!
|
||||||
* \file convolutional.h
|
* \file convolutional.h
|
||||||
* \brief General functions used to implement convolutional encoding.
|
* \brief General functions used to implement convolutional encoding.
|
||||||
* \author Matthew C. Valenti
|
* \author Matthew C. Valenti, 2006-2008.
|
||||||
|
* \author C. Fernandez-Prades, 2019.
|
||||||
*
|
*
|
||||||
* -------------------------------------------------------------------------
|
* -------------------------------------------------------------------------
|
||||||
*
|
*
|
||||||
* Copyright (C) 2006-2008 Matthew C. Valenti
|
* Copyright (C) 2006-2008 Matthew C. Valenti
|
||||||
|
* Copyright (C) 2019 C. Fernandez-Prades
|
||||||
*
|
*
|
||||||
* GNSS-SDR is a software defined Global Navigation
|
* GNSS-SDR is a software defined Global Navigation
|
||||||
* Satellite Systems receiver
|
* Satellite Systems receiver
|
||||||
@ -19,8 +21,6 @@
|
|||||||
*
|
*
|
||||||
* This file is a derived work of the original file, which had this note:
|
* This file is a derived work of the original file, which had this note:
|
||||||
*
|
*
|
||||||
* Last updated on May 22, 2008
|
|
||||||
*
|
|
||||||
* The functions in this file are part of the Iterative Solutions
|
* The functions in this file are part of the Iterative Solutions
|
||||||
* Coded Modulation Library. The Iterative Solutions Coded Modulation
|
* Coded Modulation Library. The Iterative Solutions Coded Modulation
|
||||||
* Library is free software; you can redistribute it and/or modify it
|
* Library is free software; you can redistribute it and/or modify it
|
||||||
@ -248,11 +248,6 @@ inline void Viterbi(int output_u_int[],
|
|||||||
volk_gnsssdr_32f_index_max_32u(&max_index, next_section.data(), states);
|
volk_gnsssdr_32f_index_max_32u(&max_index, next_section.data(), states);
|
||||||
max_val = next_section[max_index];
|
max_val = next_section[max_index];
|
||||||
|
|
||||||
// In modern C++ (not supported by old GCC versions):
|
|
||||||
// prev_section = next_section;
|
|
||||||
// std::transform(prev_section.begin(), prev_section.end(), prev_section.begin(),
|
|
||||||
// [&max_val](const auto& prev_ele) { return (prev_ele - max_val); });
|
|
||||||
// std::fill(next_section.begin(), next_section.end(), -MAXLOG);
|
|
||||||
for (state = 0; state < states; state++)
|
for (state = 0; state < states; state++)
|
||||||
{
|
{
|
||||||
prev_section[state] = next_section[state] - max_val;
|
prev_section[state] = next_section[state] - max_val;
|
||||||
|
Loading…
Reference in New Issue
Block a user