You cannot select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.

99 lines
2.8 KiB
C

/**
11 years ago
*
* \section COPYRIGHT
11 years ago
*
* 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,
11 years ago
* 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/.
*
11 years ago
*/
11 years ago
#include <stdlib.h>
#include <string.h>
#include "liblte/phy/utils/dft.h"
#include "liblte/phy/utils/vector.h"
#include "liblte/phy/utils/convolution.h"
11 years ago
int conv_fft_cc_init(conv_fft_cc_t *q, uint32_t input_len, uint32_t filter_len) {
q->input_len = input_len;
q->filter_len = filter_len;
q->output_len = input_len+filter_len;
q->input_fft = vec_malloc(sizeof(cf_t)*q->output_len);
q->filter_fft = vec_malloc(sizeof(cf_t)*q->output_len);
q->output_fft = vec_malloc(sizeof(cf_t)*q->output_len);
if (!q->input_fft || !q->filter_fft || !q->output_fft) {
return LIBLTE_ERROR;
}
if (dft_plan(&q->input_plan,q->output_len,FORWARD,COMPLEX)) {
return LIBLTE_ERROR;
}
if (dft_plan(&q->filter_plan,q->output_len,FORWARD,COMPLEX)) {
return LIBLTE_ERROR;
}
if (dft_plan(&q->output_plan,q->output_len,BACKWARD,COMPLEX)) {
return LIBLTE_ERROR;
}
return LIBLTE_SUCCESS;
11 years ago
}
void conv_fft_cc_free(conv_fft_cc_t *q) {
if (q->input_fft) {
free(q->input_fft);
}
if (q->filter_fft) {
free(q->filter_fft);
}
if (q->output_fft) {
free(q->output_fft);
}
dft_plan_free(&q->input_plan);
dft_plan_free(&q->filter_plan);
dft_plan_free(&q->output_plan);
11 years ago
}
uint32_t conv_fft_cc_run(conv_fft_cc_t *q, cf_t *input, cf_t *filter, cf_t *output) {
11 years ago
dft_run_c(&q->input_plan, input, q->input_fft);
dft_run_c(&q->filter_plan, filter, q->filter_fft);
11 years ago
vec_prod_ccc(q->input_fft,q->filter_fft,q->output_fft,q->output_len);
11 years ago
dft_run_c(&q->output_plan, q->output_fft, output);
11 years ago
return q->output_len;
11 years ago
}
uint32_t conv_cc(cf_t *input, cf_t *filter, cf_t *output, uint32_t input_len, uint32_t filter_len) {
uint32_t i,j;
uint32_t output_len;
output_len=input_len+filter_len-1;
memset(output,0,output_len*sizeof(cf_t));
for (i=0;i<input_len;i++) {
for (j=0;j<filter_len;j++) {
output[i+j]+=input[i]*filter[j];
}
}
return output_len;
11 years ago
}