1
0
mirror of https://github.com/gnss-sdr/gnss-sdr synced 2024-12-16 05:00:35 +00:00
gnss-sdr/src/tests/unit-tests/arithmetic/code_generation_test.cc

183 lines
5.6 KiB
C++
Raw Normal View History

2015-05-03 08:50:57 +00:00
/*!
* \file code_generation_test.cc
* \brief This file implements tests for the generation of complex exponentials.
* \author Carles Fernandez-Prades, 2014. cfernandez(at)cttc.es
*
*
* -------------------------------------------------------------------------
*
* Copyright (C) 2010-2015 (see AUTHORS file for a list of contributors)
*
* GNSS-SDR is a software defined Global Navigation
* Satellite Systems receiver
*
* This file is part of GNSS-SDR.
*
* GNSS-SDR 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 of the License, or
* (at your option) any later version.
*
* GNSS-SDR 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 GNSS-SDR. If not, see <http://www.gnu.org/licenses/>.
*
* -------------------------------------------------------------------------
*/
#include <complex>
#include <ctime>
#include "gps_sdr_signal_processing.h"
2015-05-05 14:14:46 +00:00
#include "gnss_signal_processing.h"
2015-05-03 08:50:57 +00:00
TEST(CodeGenGPSL1Test, CodeGeneration)
2015-05-03 08:50:57 +00:00
{
std::complex<float>* _dest = new std::complex<float>[1023];
signed int _prn = 1;
unsigned int _chip_shift = 4;
2015-05-10 11:20:52 +00:00
int iterations = 1000;
2015-05-03 08:50:57 +00:00
struct timeval tv;
gettimeofday(&tv, NULL);
long long int begin = tv.tv_sec * 1000000 + tv.tv_usec;
for(int i = 0; i < iterations; i++)
{
gps_l1_ca_code_gen_complex( _dest, _prn, _chip_shift);
}
2015-05-13 14:40:46 +00:00
delete[] _dest;
2015-05-03 08:50:57 +00:00
gettimeofday(&tv, NULL);
long long int end = tv.tv_sec * 1000000 + tv.tv_usec;
ASSERT_LE(0, end - begin);
std::cout << "Generation completed in " << (end - begin) << " microseconds" << std::endl;
2015-05-13 14:40:46 +00:00
2015-05-03 08:50:57 +00:00
/* std::complex<float>* _dest2 = new std::complex<float>[1023];gettimeofday(&tv, NULL);
long long int begin2 = tv.tv_sec * 1000000 + tv.tv_usec;
for(int i = 0; i < iterations; i++)
{
gps_l1_ca_code_gen_complex2( _dest2, _prn, _chip_shift);
}
gettimeofday(&tv, NULL);
long long int end2 = tv.tv_sec * 1000000 + tv.tv_usec;
std::cout << "Generation 2 completed in " << (end2 - begin2) << " microseconds" << std::endl;
for (int j=0; j<1023;j++)
{
if(_dest[j] != _dest2[j]) std::cout << "Error!" << std::endl;
}
delete _dest2; */
}
2015-05-05 11:00:24 +00:00
TEST(CodeGenGPSL1SampledTest, CodeGeneration)
2015-05-05 11:00:24 +00:00
{
signed int _prn = 1;
unsigned int _chip_shift = 4;
2015-05-13 14:40:46 +00:00
double _fs = 8000000;
2015-05-05 11:00:24 +00:00
const signed int _codeFreqBasis = 1023000; //Hz
const signed int _codeLength = 1023;
2015-05-13 14:40:46 +00:00
int _samplesPerCode = round(_fs / (double)(_codeFreqBasis / _codeLength));
2015-05-05 11:00:24 +00:00
std::complex<float>* _dest = new std::complex<float>[_samplesPerCode];
2015-05-10 11:20:52 +00:00
int iterations = 1000;
2015-05-05 11:00:24 +00:00
struct timeval tv;
gettimeofday(&tv, NULL);
long long int begin = tv.tv_sec * 1000000 + tv.tv_usec;
for(int i = 0; i < iterations; i++)
{
gps_l1_ca_code_gen_complex_sampled( _dest, _prn, _fs, _chip_shift);
}
gettimeofday(&tv, NULL);
long long int end = tv.tv_sec * 1000000 + tv.tv_usec;
2015-05-13 14:40:46 +00:00
delete[] _dest;
2015-05-05 11:00:24 +00:00
ASSERT_LE(0, end - begin);
std::cout << "Generation completed in " << (end - begin) << " microseconds" << std::endl;
2015-05-13 14:40:46 +00:00
2015-05-05 11:00:24 +00:00
/* std::complex<float>* _dest2 = new std::complex<float>[_samplesPerCode];
gettimeofday(&tv, NULL);
long long int begin2 = tv.tv_sec * 1000000 + tv.tv_usec;
for(int i = 0; i < iterations; i++)
{
gps_l1_ca_code_gen_complex_sampled2( _dest2, _prn, _fs, _chip_shift);
}
gettimeofday(&tv, NULL);
long long int end2 = tv.tv_sec * 1000000 + tv.tv_usec;
std::cout << "Generation completed in " << (end2 - begin2) << " microseconds (New)" << std::endl;
for (int j=0; j<_samplesPerCode;j++)
{
if(_dest[j] != _dest2[j]) std::cout << "Error!" << std::endl;
}
delete[] _dest2; */
}
2015-05-05 14:14:46 +00:00
TEST(ComplexCarrierTest, CodeGeneration)
2015-05-05 14:14:46 +00:00
{
double _fs = 8000000;
double _f = 4000;
const signed int _codeFreqBasis = 1023000; //Hz
const signed int _codeLength = 1023;
2015-05-13 14:40:46 +00:00
int _samplesPerCode = round(_fs / (double)(_codeFreqBasis / _codeLength));
2015-05-05 14:14:46 +00:00
std::complex<float>* _dest = new std::complex<float>[_samplesPerCode];
2015-05-10 11:20:52 +00:00
int iterations = 1000;
2015-05-05 14:14:46 +00:00
struct timeval tv;
gettimeofday(&tv, NULL);
long long int begin = tv.tv_sec * 1000000 + tv.tv_usec;
for(int i = 0; i < iterations; i++)
{
complex_exp_gen_conj( _dest, _f, _fs, _samplesPerCode);
}
gettimeofday(&tv, NULL);
long long int end = tv.tv_sec * 1000000 + tv.tv_usec;
2015-05-13 14:40:46 +00:00
delete[] _dest;
2015-05-05 14:14:46 +00:00
ASSERT_LE(0, end - begin);
std::cout << "Carrier generation completed in " << (end - begin) << " microseconds" << std::endl;
/* std::complex<float>* _dest2 = new std::complex<float>[_samplesPerCode];
gettimeofday(&tv, NULL);
long long int begin2 = tv.tv_sec * 1000000 + tv.tv_usec;
for(int i = 0; i < iterations; i++)
{
complex_exp_gen_conj2( _dest2, _f, _fs, _samplesPerCode);
}
gettimeofday(&tv, NULL);
long long int end2 = tv.tv_sec * 1000000 + tv.tv_usec;
std::cout << "Carrier generation completed in " << (end2 - begin2) << " microseconds (New)" << std::endl;
for (int j=0; j<_samplesPerCode;j++)
{
if(std::abs(_dest[j] - _dest2[j]) > 0.1) std::cout << "Error!" << std::endl;
}
std::cout << _dest[10] << "and " << _dest2[10] << std::endl;
delete[] _dest2;*/
2015-05-13 14:40:46 +00:00
2015-05-05 14:14:46 +00:00
}