|
|
|
/**
|
|
|
|
*
|
|
|
|
* \section COPYRIGHT
|
|
|
|
*
|
|
|
|
* Copyright 2013-2014 The libLTE Developers. See the
|
|
|
|
* COPYRIGHT file at the top-level directory of this distribution.
|
|
|
|
*
|
|
|
|
* \section LICENSE
|
|
|
|
*
|
|
|
|
* This file is part of the libLTE library.
|
|
|
|
*
|
|
|
|
* libLTE is free software: you can redistribute it and/or modify
|
|
|
|
* it under the terms of the GNU Lesser General Public License as
|
|
|
|
* published by the Free Software Foundation, either version 3 of
|
|
|
|
* the License, or (at your option) any later version.
|
|
|
|
*
|
|
|
|
* libLTE 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 Lesser General Public License for more details.
|
|
|
|
*
|
|
|
|
* A copy of the GNU Lesser General Public License can be found in
|
|
|
|
* the LICENSE file in the top-level directory of this distribution
|
|
|
|
* and at http://www.gnu.org/licenses/.
|
|
|
|
*
|
|
|
|
*/
|
|
|
|
|
|
|
|
#include <stdio.h>
|
|
|
|
#include <stdlib.h>
|
|
|
|
#include <string.h>
|
|
|
|
#include <strings.h>
|
|
|
|
#include <unistd.h>
|
|
|
|
#include <math.h>
|
|
|
|
#include <time.h>
|
|
|
|
#include <stdbool.h>
|
|
|
|
|
|
|
|
#include "srslte/srslte.h"
|
|
|
|
|
|
|
|
#define MAX_MSE 0.1
|
|
|
|
|
|
|
|
float freq = 0;
|
|
|
|
int num_samples = 1000;
|
|
|
|
|
|
|
|
void usage(char *prog) {
|
|
|
|
printf("Usage: %s -f freq -n num_samples\n", prog);
|
|
|
|
}
|
|
|
|
|
|
|
|
void parse_args(int argc, char **argv) {
|
|
|
|
int opt;
|
|
|
|
while ((opt = getopt(argc, argv, "nf")) != -1) {
|
|
|
|
switch (opt) {
|
|
|
|
case 'n':
|
|
|
|
num_samples = atoi(argv[optind]);
|
|
|
|
break;
|
|
|
|
case 'f':
|
|
|
|
freq = atof(argv[optind]);
|
|
|
|
break;
|
|
|
|
default:
|
|
|
|
usage(argv[0]);
|
|
|
|
exit(-1);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
int main(int argc, char **argv) {
|
|
|
|
int i;
|
|
|
|
cf_t *input, *output;
|
|
|
|
cfo_t cfocorr;
|
|
|
|
float mse;
|
|
|
|
|
|
|
|
if (argc < 5) {
|
|
|
|
usage(argv[0]);
|
|
|
|
exit(-1);
|
|
|
|
}
|
|
|
|
|
|
|
|
parse_args(argc, argv);
|
|
|
|
|
|
|
|
input = malloc(sizeof(cf_t) * num_samples);
|
|
|
|
if (!input) {
|
|
|
|
perror("malloc");
|
|
|
|
exit(-1);
|
|
|
|
}
|
|
|
|
output = malloc(sizeof(cf_t) * num_samples);
|
|
|
|
if (!output) {
|
|
|
|
perror("malloc");
|
|
|
|
exit(-1);
|
|
|
|
}
|
|
|
|
|
|
|
|
for (i=0;i<num_samples;i++) {
|
|
|
|
input[i] = 100 * (rand()/RAND_MAX + I*rand()/RAND_MAX);
|
|
|
|
output[i] = input[i];
|
|
|
|
}
|
|
|
|
|
|
|
|
if (cfo_init(&cfocorr, num_samples)) {
|
|
|
|
fprintf(stderr, "Error initiating CFO\n");
|
|
|
|
return -1;
|
|
|
|
}
|
|
|
|
|
|
|
|
cfo_correct(&cfocorr, output, output, freq);
|
|
|
|
cfo_correct(&cfocorr, output, output, -freq);
|
|
|
|
|
|
|
|
mse = 0;
|
|
|
|
for (i=0;i<num_samples;i++) {
|
|
|
|
mse += cabsf(input[i] - output[i]) / num_samples;
|
|
|
|
}
|
|
|
|
|
|
|
|
cfo_free(&cfocorr);
|
|
|
|
free(input);
|
|
|
|
free(output);
|
|
|
|
|
|
|
|
printf("MSE: %f\n", mse);
|
|
|
|
if (mse > MAX_MSE) {
|
|
|
|
printf("MSE too large\n");
|
|
|
|
exit(-1);
|
|
|
|
} else {
|
|
|
|
printf("Ok\n");
|
|
|
|
exit(0);
|
|
|
|
}
|
|
|
|
}
|