kopia lustrzana https://github.com/projecthorus/radiosonde_auto_rx
Add fsk_demod.
Mark Jessop
rodzic
36cffe9b9b
commit
686e297c73
|
|
@ -20,6 +20,14 @@ echo "Building M10 Demodulator."
|
|||
cd ../m10/
|
||||
g++ M10.cpp M10Decoder.cpp M10GeneralParser.cpp M10GtopParser.cpp M10TrimbleParser.cpp AudioFile.cpp -lm -o m10 -std=c++11
|
||||
|
||||
echo "Building fsk-demod utils from codec2"
|
||||
cd ../utils/
|
||||
gcc fsk_demod.c fsk.c modem_stats.c kiss_fftr.c kiss_fft.c -lm -o fsk_demod
|
||||
# Build tsrc
|
||||
|
||||
#gcc tsrc.c -o tsrc -lm -lsamplerate
|
||||
gcc tsrc.c -o tsrc -lm -lsamplerate -I/opt/local/include -L/opt/local/lib
|
||||
|
||||
|
||||
# Copy all necessary files into this directory.
|
||||
echo "Copying files into auto_rx directory."
|
||||
|
|
@ -30,5 +38,7 @@ cp ../demod/rs92ecc .
|
|||
cp ../demod/rs41ecc .
|
||||
cp ../demod/dfm09ecc .
|
||||
cp ../m10/m10 .
|
||||
cp ../utils/fsk_demod .
|
||||
cp ../utils/tsrc .
|
||||
|
||||
echo "Done!"
|
||||
|
|
|
|||
|
|
@ -146,6 +146,19 @@ processing_type = {
|
|||
# "post_process" : "| wc -l",
|
||||
# 'files' : "./generated/m10"
|
||||
# },
|
||||
|
||||
'dfm_fsk_demod': {
|
||||
# cat ./generated/dfm09_96k_float_15.0dB.bin | csdr shift_addition_cc 0.25000 2>/dev/null | csdr convert_f_s16 |
|
||||
#./tsrc - - 1.041666 | ../fsk_demod --cs16 -b 1 -u 45000 2 100000 2500 - - 2>/dev/null |
|
||||
#python ./bit_to_samples.py 50000 2500 | sox -t raw -r 50k -e unsigned-integer -b 8 -c 1 - -r 50000 -b 8 -t wav - 2>/dev/null|
|
||||
#../dfm09ecc -vv --json --dist --auto
|
||||
|
||||
'demod': '| csdr shift_addition_cc 0.25000 2>/dev/null | csdr convert_f_s16 | ./tsrc - - 1.041666 | ../fsk_demod --cs16 -b 1 -u 45000 2 100000 2500 - - 2>/dev/null | python ./bit_to_samples.py 50000 2500 | sox -t raw -r 50k -e unsigned-integer -b 8 -c 1 - -r 50000 -b 8 -t wav - 2>/dev/null| ',
|
||||
'decode': '../dfm09ecc -vv --json --dist --auto 2>/dev/null',
|
||||
"post_process" : " | grep frame | wc -l", # ECC
|
||||
#"post_process" : "| grep -o '\[OK\]' | wc -l", # No ECC
|
||||
'files' : "./generated/dfm*.bin"
|
||||
}
|
||||
}
|
||||
|
||||
|
||||
|
|
|
|||
|
|
@ -0,0 +1,164 @@
|
|||
/*
|
||||
Copyright (c) 2003-2010, Mark Borgerding
|
||||
|
||||
All rights reserved.
|
||||
|
||||
Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met:
|
||||
|
||||
* Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer.
|
||||
* Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution.
|
||||
* Neither the author nor the names of any contributors may be used to endorse or promote products derived from this software without specific prior written permission.
|
||||
|
||||
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
||||
*/
|
||||
|
||||
/* kiss_fft.h
|
||||
defines kiss_fft_scalar as either short or a float type
|
||||
and defines
|
||||
typedef struct { kiss_fft_scalar r; kiss_fft_scalar i; }kiss_fft_cpx; */
|
||||
#include "kiss_fft.h"
|
||||
#include <limits.h>
|
||||
|
||||
#define MAXFACTORS 32
|
||||
/* e.g. an fft of length 128 has 4 factors
|
||||
as far as kissfft is concerned
|
||||
4*4*4*2
|
||||
*/
|
||||
|
||||
struct kiss_fft_state{
|
||||
int nfft;
|
||||
int inverse;
|
||||
int factors[2*MAXFACTORS];
|
||||
kiss_fft_cpx twiddles[1];
|
||||
};
|
||||
|
||||
/*
|
||||
Explanation of macros dealing with complex math:
|
||||
|
||||
C_MUL(m,a,b) : m = a*b
|
||||
C_FIXDIV( c , div ) : if a fixed point impl., c /= div. noop otherwise
|
||||
C_SUB( res, a,b) : res = a - b
|
||||
C_SUBFROM( res , a) : res -= a
|
||||
C_ADDTO( res , a) : res += a
|
||||
* */
|
||||
#ifdef FIXED_POINT
|
||||
#if (FIXED_POINT==32)
|
||||
# define FRACBITS 31
|
||||
# define SAMPPROD int64_t
|
||||
#define SAMP_MAX 2147483647
|
||||
#else
|
||||
# define FRACBITS 15
|
||||
# define SAMPPROD int32_t
|
||||
#define SAMP_MAX 32767
|
||||
#endif
|
||||
|
||||
#define SAMP_MIN -SAMP_MAX
|
||||
|
||||
#if defined(CHECK_OVERFLOW)
|
||||
# define CHECK_OVERFLOW_OP(a,op,b) \
|
||||
if ( (SAMPPROD)(a) op (SAMPPROD)(b) > SAMP_MAX || (SAMPPROD)(a) op (SAMPPROD)(b) < SAMP_MIN ) { \
|
||||
fprintf(stderr,"WARNING:overflow @ " __FILE__ "(%d): (%d " #op" %d) = %ld\n",__LINE__,(a),(b),(SAMPPROD)(a) op (SAMPPROD)(b) ); }
|
||||
#endif
|
||||
|
||||
|
||||
# define smul(a,b) ( (SAMPPROD)(a)*(b) )
|
||||
# define sround( x ) (kiss_fft_scalar)( ( (x) + (1<<(FRACBITS-1)) ) >> FRACBITS )
|
||||
|
||||
# define S_MUL(a,b) sround( smul(a,b) )
|
||||
|
||||
# define C_MUL(m,a,b) \
|
||||
do{ (m).r = sround( smul((a).r,(b).r) - smul((a).i,(b).i) ); \
|
||||
(m).i = sround( smul((a).r,(b).i) + smul((a).i,(b).r) ); }while(0)
|
||||
|
||||
# define DIVSCALAR(x,k) \
|
||||
(x) = sround( smul( x, SAMP_MAX/k ) )
|
||||
|
||||
# define C_FIXDIV(c,div) \
|
||||
do { DIVSCALAR( (c).r , div); \
|
||||
DIVSCALAR( (c).i , div); }while (0)
|
||||
|
||||
# define C_MULBYSCALAR( c, s ) \
|
||||
do{ (c).r = sround( smul( (c).r , s ) ) ;\
|
||||
(c).i = sround( smul( (c).i , s ) ) ; }while(0)
|
||||
|
||||
#else /* not FIXED_POINT*/
|
||||
|
||||
# define S_MUL(a,b) ( (a)*(b) )
|
||||
#define C_MUL(m,a,b) \
|
||||
do{ (m).r = (a).r*(b).r - (a).i*(b).i;\
|
||||
(m).i = (a).r*(b).i + (a).i*(b).r; }while(0)
|
||||
# define C_FIXDIV(c,div) /* NOOP */
|
||||
# define C_MULBYSCALAR( c, s ) \
|
||||
do{ (c).r *= (s);\
|
||||
(c).i *= (s); }while(0)
|
||||
#endif
|
||||
|
||||
#ifndef CHECK_OVERFLOW_OP
|
||||
# define CHECK_OVERFLOW_OP(a,op,b) /* noop */
|
||||
#endif
|
||||
|
||||
#define C_ADD( res, a,b)\
|
||||
do { \
|
||||
CHECK_OVERFLOW_OP((a).r,+,(b).r)\
|
||||
CHECK_OVERFLOW_OP((a).i,+,(b).i)\
|
||||
(res).r=(a).r+(b).r; (res).i=(a).i+(b).i; \
|
||||
}while(0)
|
||||
#define C_SUB( res, a,b)\
|
||||
do { \
|
||||
CHECK_OVERFLOW_OP((a).r,-,(b).r)\
|
||||
CHECK_OVERFLOW_OP((a).i,-,(b).i)\
|
||||
(res).r=(a).r-(b).r; (res).i=(a).i-(b).i; \
|
||||
}while(0)
|
||||
#define C_ADDTO( res , a)\
|
||||
do { \
|
||||
CHECK_OVERFLOW_OP((res).r,+,(a).r)\
|
||||
CHECK_OVERFLOW_OP((res).i,+,(a).i)\
|
||||
(res).r += (a).r; (res).i += (a).i;\
|
||||
}while(0)
|
||||
|
||||
#define C_SUBFROM( res , a)\
|
||||
do {\
|
||||
CHECK_OVERFLOW_OP((res).r,-,(a).r)\
|
||||
CHECK_OVERFLOW_OP((res).i,-,(a).i)\
|
||||
(res).r -= (a).r; (res).i -= (a).i; \
|
||||
}while(0)
|
||||
|
||||
|
||||
#ifdef FIXED_POINT
|
||||
# define KISS_FFT_COS(phase) floorf(.5+SAMP_MAX * cosf (phase))
|
||||
# define KISS_FFT_SIN(phase) floorf(.5+SAMP_MAX * sinf (phase))
|
||||
# define HALF_OF(x) ((x)>>1)
|
||||
#elif defined(USE_SIMD)
|
||||
# define KISS_FFT_COS(phase) _mm_set1_ps( cosf(phase) )
|
||||
# define KISS_FFT_SIN(phase) _mm_set1_ps( sinf(phase) )
|
||||
# define HALF_OF(x) ((x)*_mm_set1_ps(.5))
|
||||
#else
|
||||
# define KISS_FFT_COS(phase) (kiss_fft_scalar) cosf(phase)
|
||||
# define KISS_FFT_SIN(phase) (kiss_fft_scalar) sinf(phase)
|
||||
# define HALF_OF(x) ((x)*.5)
|
||||
#endif
|
||||
|
||||
#define kf_cexp(x,phase) \
|
||||
do{ \
|
||||
(x)->r = KISS_FFT_COS(phase);\
|
||||
(x)->i = KISS_FFT_SIN(phase);\
|
||||
}while(0)
|
||||
|
||||
|
||||
/* a debugging function */
|
||||
#define pcpx(c)\
|
||||
fprintf(stderr,"%g + %gi\n",(double)((c)->r),(double)((c)->i) )
|
||||
|
||||
|
||||
#ifdef KISS_FFT_USE_ALLOCA
|
||||
// define this to allow use of alloca instead of malloc for temporary buffers
|
||||
// Temporary buffers are used in two case:
|
||||
// 1. FFT sizes that have "bad" factors. i.e. not 2,3 and 5
|
||||
// 2. "in-place" FFTs. Notice the quotes, since kissfft does not really do an in-place transform.
|
||||
#include <alloca.h>
|
||||
#define KISS_FFT_TMP_ALLOC(nbytes) alloca(nbytes)
|
||||
#define KISS_FFT_TMP_FREE(ptr)
|
||||
#else
|
||||
#define KISS_FFT_TMP_ALLOC(nbytes) KISS_FFT_MALLOC(nbytes)
|
||||
#define KISS_FFT_TMP_FREE(ptr) KISS_FFT_FREE(ptr)
|
||||
#endif
|
||||
|
|
@ -0,0 +1,113 @@
|
|||
/*---------------------------------------------------------------------------*\
|
||||
|
||||
FILE........: codec2_fdmdv.h
|
||||
AUTHOR......: David Rowe
|
||||
DATE CREATED: April 14 2012
|
||||
|
||||
A 1400 bit/s (nominal) Frequency Division Multiplexed Digital Voice
|
||||
(FDMDV) modem. Used for digital audio over HF SSB. See
|
||||
README_fdmdv.txt for more information, and fdmdv_mod.c and
|
||||
fdmdv_demod.c for example usage.
|
||||
|
||||
The name codec2_fdmdv.h is used to make it unique when "make
|
||||
installed".
|
||||
|
||||
References:
|
||||
|
||||
[1] http://n1su.com/fdmdv/FDMDV_Docs_Rel_1_4b.pdf
|
||||
|
||||
\*---------------------------------------------------------------------------*/
|
||||
|
||||
/*
|
||||
Copyright (C) 2012 David Rowe
|
||||
|
||||
All rights reserved.
|
||||
|
||||
This program is free software; you can redistribute it and/or modify
|
||||
it under the terms of the GNU Lesser General Public License version 2.1, as
|
||||
published by the Free Software Foundation. This program 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 Lesser General Public License
|
||||
along with this program; if not, see <http://www.gnu.org/licenses/>.
|
||||
*/
|
||||
|
||||
#ifndef __FDMDV__
|
||||
#define __FDMDV__
|
||||
|
||||
#ifdef __cplusplus
|
||||
extern "C" {
|
||||
#endif
|
||||
|
||||
/* set up the calling convention for DLL function import/export for
|
||||
WIN32 cross compiling */
|
||||
|
||||
#ifdef __CODEC2_WIN32__
|
||||
#ifdef __CODEC2_BUILDING_DLL__
|
||||
#define CODEC2_WIN32SUPPORT __declspec(dllexport) __stdcall
|
||||
#else
|
||||
#define CODEC2_WIN32SUPPORT __declspec(dllimport) __stdcall
|
||||
#endif
|
||||
#else
|
||||
#define CODEC2_WIN32SUPPORT
|
||||
#endif
|
||||
|
||||
#include "comp.h"
|
||||
#include "modem_stats.h"
|
||||
|
||||
#define FDMDV_NC 14 /* default number of data carriers */
|
||||
#define FDMDV_NC_MAX 20 /* maximum number of data carriers */
|
||||
#define FDMDV_BITS_PER_FRAME 28 /* 20ms frames, for nominal 1400 bit/s */
|
||||
#define FDMDV_NOM_SAMPLES_PER_FRAME 160 /* modulator output samples/frame and nominal demod samples/frame */
|
||||
/* at 8000 Hz sample rate */
|
||||
#define FDMDV_MAX_SAMPLES_PER_FRAME 200 /* max demod samples/frame, use this to allocate storage */
|
||||
#define FDMDV_SCALE 1000 /* suggested scaling for 16 bit shorts */
|
||||
#define FDMDV_FCENTRE 1500 /* Centre frequency, Nc/2 carriers below this, Nc/2 carriers above (Hz) */
|
||||
|
||||
/* 8 to 48 kHz sample rate conversion */
|
||||
|
||||
#define FDMDV_OS 2 /* oversampling rate */
|
||||
#define FDMDV_OS_TAPS_16K 48 /* number of OS filter taps at 16kHz */
|
||||
#define FDMDV_OS_TAPS_8K (FDMDV_OS_TAPS_16K/FDMDV_OS) /* number of OS filter taps at 8kHz */
|
||||
|
||||
/* FDMDV states and stats structures */
|
||||
|
||||
struct FDMDV;
|
||||
|
||||
struct FDMDV * fdmdv_create(int Nc);
|
||||
void fdmdv_destroy(struct FDMDV *fdmdv_state);
|
||||
void fdmdv_use_old_qpsk_mapping(struct FDMDV *fdmdv_state);
|
||||
int fdmdv_bits_per_frame(struct FDMDV *fdmdv_state);
|
||||
float fdmdv_get_fsep(struct FDMDV *fdmdv_state);
|
||||
void fdmdv_set_fsep(struct FDMDV *fdmdv_state, float fsep);
|
||||
|
||||
void fdmdv_mod(struct FDMDV *fdmdv_state, COMP tx_fdm[], int tx_bits[], int *sync_bit);
|
||||
void fdmdv_demod(struct FDMDV *fdmdv_state, int rx_bits[], int *reliable_sync_bit, COMP rx_fdm[], int *nin);
|
||||
|
||||
void fdmdv_get_test_bits(struct FDMDV *fdmdv_state, int tx_bits[]);
|
||||
int fdmdv_error_pattern_size(struct FDMDV *fdmdv_state);
|
||||
void fdmdv_put_test_bits(struct FDMDV *f, int *sync, short error_pattern[], int *bit_errors, int *ntest_bits, int rx_bits[]);
|
||||
|
||||
void fdmdv_get_demod_stats(struct FDMDV *fdmdv_state, struct MODEM_STATS *stats);
|
||||
|
||||
void fdmdv_8_to_16(float out16k[], float in8k[], int n);
|
||||
void fdmdv_8_to_16_short(short out16k[], short in8k[], int n);
|
||||
void fdmdv_16_to_8(float out8k[], float in16k[], int n);
|
||||
void fdmdv_16_to_8_short(short out8k[], short in16k[], int n);
|
||||
|
||||
void fdmdv_freq_shift(COMP rx_fdm_fcorr[], COMP rx_fdm[], float foff, COMP *foff_phase_rect, int nin);
|
||||
|
||||
/* debug/development function(s) */
|
||||
|
||||
void fdmdv_dump_osc_mags(struct FDMDV *f);
|
||||
void fdmdv_simulate_channel(float *sig_pwr_av, COMP samples[], int nin, float target_snr);
|
||||
|
||||
#ifdef __cplusplus
|
||||
}
|
||||
#endif
|
||||
|
||||
#endif
|
||||
|
||||
|
|
@ -0,0 +1,38 @@
|
|||
/*---------------------------------------------------------------------------*\
|
||||
|
||||
FILE........: comp.h
|
||||
AUTHOR......: David Rowe
|
||||
DATE CREATED: 24/08/09
|
||||
|
||||
Complex number definition.
|
||||
|
||||
\*---------------------------------------------------------------------------*/
|
||||
|
||||
/*
|
||||
Copyright (C) 2009 David Rowe
|
||||
|
||||
All rights reserved.
|
||||
|
||||
This program is free software; you can redistribute it and/or modify
|
||||
it under the terms of the GNU Lesser General Public License version 2.1, as
|
||||
published by the Free Software Foundation. This program 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 Lesser General Public License
|
||||
along with this program; if not, see <http://www.gnu.org/licenses/>.
|
||||
*/
|
||||
|
||||
#ifndef __COMP__
|
||||
#define __COMP__
|
||||
|
||||
/* Complex number */
|
||||
|
||||
typedef struct {
|
||||
float real;
|
||||
float imag;
|
||||
} COMP;
|
||||
|
||||
#endif
|
||||
|
|
@ -0,0 +1,141 @@
|
|||
/*---------------------------------------------------------------------------*\
|
||||
|
||||
FILE........: comp_prim.h
|
||||
AUTHOR......: David Rowe
|
||||
DATE CREATED: Marh 2015
|
||||
|
||||
Complex number maths primitives.
|
||||
|
||||
\*---------------------------------------------------------------------------*/
|
||||
|
||||
/*
|
||||
Copyright (C) 2015 David Rowe
|
||||
|
||||
All rights reserved.
|
||||
|
||||
This program is free software; you can redistribute it and/or modify
|
||||
it under the terms of the GNU Lesser General Public License version 2.1, as
|
||||
published by the Free Software Foundation. This program 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 Lesser General Public License
|
||||
along with this program; if not, see <http://www.gnu.org/licenses/>.
|
||||
*/
|
||||
|
||||
#ifndef __COMP_PRIM__
|
||||
#define __COMP_PRIM__
|
||||
|
||||
/*---------------------------------------------------------------------------*\
|
||||
|
||||
FUNCTIONS
|
||||
|
||||
\*---------------------------------------------------------------------------*/
|
||||
|
||||
inline static COMP cneg(COMP a)
|
||||
{
|
||||
COMP res;
|
||||
|
||||
res.real = -a.real;
|
||||
res.imag = -a.imag;
|
||||
|
||||
return res;
|
||||
}
|
||||
|
||||
inline static COMP cconj(COMP a)
|
||||
{
|
||||
COMP res;
|
||||
|
||||
res.real = a.real;
|
||||
res.imag = -a.imag;
|
||||
|
||||
return res;
|
||||
}
|
||||
|
||||
inline static COMP cmult(COMP a, COMP b)
|
||||
{
|
||||
COMP res;
|
||||
|
||||
res.real = a.real*b.real - a.imag*b.imag;
|
||||
res.imag = a.real*b.imag + a.imag*b.real;
|
||||
|
||||
return res;
|
||||
}
|
||||
|
||||
inline static COMP fcmult(float a, COMP b)
|
||||
{
|
||||
COMP res;
|
||||
|
||||
res.real = a*b.real;
|
||||
res.imag = a*b.imag;
|
||||
|
||||
return res;
|
||||
}
|
||||
|
||||
inline static COMP cadd(COMP a, COMP b)
|
||||
{
|
||||
COMP res;
|
||||
|
||||
res.real = a.real + b.real;
|
||||
res.imag = a.imag + b.imag;
|
||||
|
||||
return res;
|
||||
}
|
||||
|
||||
inline static float cabsolute(COMP a)
|
||||
{
|
||||
return sqrtf(powf(a.real, 2.0) + powf(a.imag, 2.0));
|
||||
}
|
||||
|
||||
/*
|
||||
* Euler's formula in a new convenient function
|
||||
*/
|
||||
inline static COMP comp_exp_j(float phi){
|
||||
COMP res;
|
||||
res.real = cosf(phi);
|
||||
res.imag = sinf(phi);
|
||||
return res;
|
||||
}
|
||||
|
||||
/*
|
||||
* Quick and easy complex 0
|
||||
*/
|
||||
inline static COMP comp0(){
|
||||
COMP res;
|
||||
res.real = 0;
|
||||
res.imag = 0;
|
||||
return res;
|
||||
}
|
||||
|
||||
/*
|
||||
* Quick and easy complex subtract
|
||||
*/
|
||||
inline static COMP csub(COMP a, COMP b){
|
||||
COMP res;
|
||||
res.real = a.real-b.real;
|
||||
res.imag = a.imag-b.imag;
|
||||
return res;
|
||||
}
|
||||
|
||||
/*
|
||||
* Compare the magnitude of a and b. if |a|>|b|, return true, otw false.
|
||||
* This needs no square roots
|
||||
*/
|
||||
inline static int comp_mag_gt(COMP a,COMP b){
|
||||
return ((a.real*a.real)+(a.imag*a.imag)) > ((b.real*b.real)+(b.imag*b.imag));
|
||||
}
|
||||
|
||||
/*
|
||||
* Normalize a complex number's magnitude to 1
|
||||
*/
|
||||
inline static COMP comp_normalize(COMP a){
|
||||
COMP b;
|
||||
float av = cabsolute(a);
|
||||
b.real = a.real/av;
|
||||
b.imag = a.imag/av;
|
||||
return b;
|
||||
}
|
||||
|
||||
#endif
|
||||
Plik diff jest za duży
Load Diff
|
|
@ -0,0 +1,204 @@
|
|||
/*---------------------------------------------------------------------------*\
|
||||
|
||||
FILE........: fsk.h
|
||||
AUTHOR......: Brady O'Brien
|
||||
DATE CREATED: 6 January 2016
|
||||
|
||||
C Implementation of 2FSK/4FSK modulator/demodulator, based on octave/fsk_horus.m
|
||||
|
||||
\*---------------------------------------------------------------------------*/
|
||||
|
||||
/*
|
||||
Copyright (C) 2016 David Rowe
|
||||
|
||||
All rights reserved.
|
||||
|
||||
This program is free software; you can redistribute it and/or modify
|
||||
it under the terms of the GNU Lesser General Public License version 2.1, as
|
||||
published by the Free Software Foundation. This program 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 Lesser General Public License
|
||||
along with this program; if not, see <http://www.gnu.org/licenses/>.
|
||||
*/
|
||||
|
||||
|
||||
#ifndef __C2FSK_H
|
||||
#define __C2FSK_H
|
||||
#include <stdint.h>
|
||||
#include "comp.h"
|
||||
#include "kiss_fftr.h"
|
||||
#include "modem_stats.h"
|
||||
|
||||
#define MODE_2FSK 2
|
||||
#define MODE_4FSK 4
|
||||
|
||||
#define MODE_M_MAX 4
|
||||
|
||||
#define FSK_SCALE 16383
|
||||
|
||||
struct FSK {
|
||||
/* Static parameters set up by fsk_init */
|
||||
int Ndft; /* buffer size for freq offset est fft */
|
||||
int Fs; /* sample freq */
|
||||
int N; /* processing buffer size */
|
||||
int Rs; /* symbol rate */
|
||||
int Ts; /* samples per symbol */
|
||||
int Nmem; /* size of extra mem for timing adj */
|
||||
int P; /* oversample rate for timing est/adj */
|
||||
int Nsym; /* Number of symbols spat out in a processing frame */
|
||||
int Nbits; /* Number of bits spat out in a processing frame */
|
||||
int f1_tx; /* f1 for modulator */
|
||||
int fs_tx; /* Space between TX freqs for modulatosr */
|
||||
int mode; /* 2FSK or 4FSK */
|
||||
int est_min; /* Minimum frequency for freq. estimator */
|
||||
int est_max; /* Maximum frequency for freq. estimaotr */
|
||||
int est_space; /* Minimum frequency spacing for freq. estimator */
|
||||
float* hann_table; /* Precomputed or runtime computed hann window table */
|
||||
|
||||
/* Parameters used by demod */
|
||||
COMP phi_c[MODE_M_MAX];
|
||||
|
||||
kiss_fft_cfg fft_cfg; /* Config for KISS FFT, used in freq est */
|
||||
float norm_rx_timing; /* Normalized RX timing */
|
||||
|
||||
COMP* samp_old; /* Tail end of last batch of samples */
|
||||
int nstash; /* How many elements are in there */
|
||||
|
||||
float* fft_est; /* Freq est FFT magnitude */
|
||||
|
||||
/* Memory used by demod but not important between demod frames */
|
||||
|
||||
/* Parameters used by mod */
|
||||
COMP tx_phase_c; /* TX phase, but complex */
|
||||
|
||||
/* Statistics generated by demod */
|
||||
float EbNodB; /* Estimated EbNo in dB */
|
||||
float f_est[MODE_M_MAX];/* Estimated frequencies */
|
||||
float ppm; /* Estimated PPM clock offset */
|
||||
|
||||
/* Parameters used by mod/demod and driving code */
|
||||
int nin; /* Number of samples to feed the next demod cycle */
|
||||
int burst_mode; /* enables/disables 'burst' mode */
|
||||
|
||||
/* modem statistic struct */
|
||||
struct MODEM_STATS *stats;
|
||||
int normalise_eye; /* enables/disables normalisation of eye diagram */
|
||||
};
|
||||
|
||||
/*
|
||||
* Create an FSK config/state struct from a set of config parameters
|
||||
*
|
||||
* int Fs - Sample frequency
|
||||
* int Rs - Symbol rate
|
||||
* int tx_f1 - '0' frequency
|
||||
* int tx_fs - frequency spacing
|
||||
*/
|
||||
struct FSK * fsk_create(int Fs, int Rs, int M, int tx_f1, int tx_fs);
|
||||
|
||||
/*
|
||||
* Create an FSK config/state struct from a set of config parameters
|
||||
*
|
||||
* int Fs - Sample frequency
|
||||
* int Rs - Symbol rate
|
||||
* int tx_f1 - '0' frequency
|
||||
* int tx_fs - frequency spacing
|
||||
*/
|
||||
struct FSK * fsk_create_hbr(int Fs, int Rs, int P, int M, int tx_f1, int tx_fs);
|
||||
|
||||
/*
|
||||
* Set a new number of symbols per processing frame
|
||||
*/
|
||||
void fsk_set_nsym(struct FSK *fsk,int nsym);
|
||||
|
||||
/*
|
||||
* Set the minimum and maximum frequencies at which the freq. estimator can find tones
|
||||
*/
|
||||
void fsk_set_est_limits(struct FSK *fsk,int fmin, int fmax);
|
||||
|
||||
/*
|
||||
* Clear the estimator states
|
||||
*/
|
||||
void fsk_clear_estimators(struct FSK *fsk);
|
||||
|
||||
/*
|
||||
* Fills MODEM_STATS struct with demod statistics
|
||||
*/
|
||||
void fsk_get_demod_stats(struct FSK *fsk, struct MODEM_STATS *stats);
|
||||
|
||||
/*
|
||||
* Destroy an FSK state struct and free it's memory
|
||||
*
|
||||
* struct FSK *fsk - FSK config/state struct to be destroyed
|
||||
*/
|
||||
void fsk_destroy(struct FSK *fsk);
|
||||
|
||||
/*
|
||||
* Modulates Nsym bits into N samples
|
||||
*
|
||||
* struct FSK *fsk - FSK config/state struct, set up by fsk_create
|
||||
* float fsk_out[] - Buffer for N samples of modulated FSK
|
||||
* uint8_t tx_bits[] - Buffer containing Nbits unpacked bits
|
||||
*/
|
||||
void fsk_mod(struct FSK *fsk, float fsk_out[], uint8_t tx_bits[]);
|
||||
|
||||
/*
|
||||
* Modulates Nsym bits into N samples
|
||||
*
|
||||
* struct FSK *fsk - FSK config/state struct, set up by fsk_create
|
||||
* float fsk_out[] - Buffer for N samples of "voltage" used to modulate an external VCO
|
||||
* uint8_t tx_bits[] - Buffer containing Nbits unpacked bits
|
||||
*/
|
||||
void fsk_mod_ext_vco(struct FSK *fsk, float vco_out[], uint8_t tx_bits[]);
|
||||
|
||||
/*
|
||||
* Modulates Nsym bits into N complex samples
|
||||
*
|
||||
* struct FSK *fsk - FSK config/state struct, set up by fsk_create
|
||||
* comp fsk_out[] - Buffer for N samples of modulated FSK
|
||||
* uint8_t tx_bits[] - Buffer containing Nbits unpacked bits
|
||||
*/
|
||||
void fsk_mod_c(struct FSK *fsk, COMP fsk_out[], uint8_t tx_bits[]);
|
||||
|
||||
|
||||
/*
|
||||
* Returns the number of samples needed for the next fsk_demod() cycle
|
||||
*
|
||||
* struct FSK *fsk - FSK config/state struct, set up by fsk_create
|
||||
* returns - number of samples to be fed into fsk_demod next cycle
|
||||
*/
|
||||
uint32_t fsk_nin(struct FSK *fsk);
|
||||
|
||||
|
||||
/*
|
||||
* Demodulate some number of FSK samples. The number of samples to be
|
||||
* demodulated can be found by calling fsk_nin().
|
||||
*
|
||||
* struct FSK *fsk - FSK config/state struct, set up by fsk_create
|
||||
* uint8_t rx_bits[] - Buffer for Nbits unpacked bits to be written
|
||||
* float fsk_in[] - nin samples of modualted FSK
|
||||
*/
|
||||
void fsk_demod(struct FSK *fsk, uint8_t rx_bits[],COMP fsk_in[]);
|
||||
|
||||
/*
|
||||
* Demodulate some number of FSK samples. The number of samples to be
|
||||
* demodulated can be found by calling fsk_nin().
|
||||
*
|
||||
* struct FSK *fsk - FSK config/state struct, set up by fsk_create
|
||||
* float rx_bits[] - Buffer for Nbits soft decision bits to be written
|
||||
* float fsk_in[] - nin samples of modualted FSK
|
||||
*/
|
||||
void fsk_demod_sd(struct FSK *fsk, float rx_bits[],COMP fsk_in[]);
|
||||
|
||||
/* enables/disables normalisation of eye diagram samples */
|
||||
|
||||
void fsk_stats_normalise_eye(struct FSK *fsk, int normalise_enable);
|
||||
|
||||
/* Set the FSK modem into burst demod mode */
|
||||
|
||||
void fsk_enable_burst_mode(struct FSK *fsk,int nsyms);
|
||||
|
||||
#endif
|
||||
|
|
@ -0,0 +1,435 @@
|
|||
/*---------------------------------------------------------------------------*\
|
||||
|
||||
FILE........: fsk_demod.c
|
||||
AUTHOR......: Brady O'Brien
|
||||
DATE CREATED: 8 January 2016
|
||||
|
||||
C test driver for fsk_demod in fsk.c. Reads in a stream of 32 bit cpu endian
|
||||
floats and writes out the detected bits
|
||||
|
||||
|
||||
\*---------------------------------------------------------------------------*/
|
||||
|
||||
/*
|
||||
Copyright (C) 2016 David Rowe
|
||||
|
||||
All rights reserved.
|
||||
|
||||
This program is free software; you can redistribute it and/or modify
|
||||
it under the terms of the GNU Lesser General Public License version 2.1, as
|
||||
published by the Free Software Foundation. This program 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 Lesser General Public License
|
||||
along with this program; if not, see <http://www.gnu.org/licenses/>.
|
||||
*/
|
||||
|
||||
#define TEST_FRAME_SIZE 100 /* must match fsk_get_test_bits.c */
|
||||
|
||||
#include <assert.h>
|
||||
#include <stdio.h>
|
||||
#include <stdlib.h>
|
||||
#include <getopt.h>
|
||||
#include <time.h>
|
||||
#include <signal.h>
|
||||
#include <unistd.h>
|
||||
|
||||
|
||||
#include "fsk.h"
|
||||
#include "codec2_fdmdv.h"
|
||||
#include "modem_stats.h"
|
||||
|
||||
/* cleanly exit when we get a SIGTERM */
|
||||
|
||||
void sig_handler(int signo)
|
||||
{
|
||||
if (signo == SIGTERM) {
|
||||
exit(0);
|
||||
}
|
||||
}
|
||||
|
||||
int main(int argc,char *argv[]){
|
||||
struct FSK *fsk;
|
||||
struct MODEM_STATS stats;
|
||||
int Fs,Rs,M,P,stats_ctr,stats_loop;
|
||||
float loop_time;
|
||||
int enable_stats = 0;
|
||||
int hbr = 1;
|
||||
FILE *fin,*fout;
|
||||
uint8_t *bitbuf = NULL;
|
||||
int16_t *rawbuf;
|
||||
COMP *modbuf;
|
||||
float *sdbuf = NULL;
|
||||
int i,j,Ndft;
|
||||
int soft_dec_mode = 0;
|
||||
stats_loop = 0;
|
||||
int complex_input = 1, bytes_per_sample = 2;
|
||||
int stats_rate = 8;
|
||||
int testframe_mode = 0;
|
||||
P = 0;
|
||||
M = 0;
|
||||
int fsk_lower = -1;
|
||||
int fsk_upper = -1;
|
||||
|
||||
/* -m 2/4 --mode 2/4 - FSK mode
|
||||
* -l --lbr - Low bit rate mode
|
||||
* -p n --conv n - Downconverted symbol size
|
||||
* If p is unspecified, it will default to Ts
|
||||
* -c --cs16 - Complex (signed 16-bit)
|
||||
* -d --cu8 - Complex (unsigned 8-bit)
|
||||
* If neither -c or -d are specified, input will be real valued signed 16-bit
|
||||
* -t --stats - dump demod statistics to stderr
|
||||
* -s --soft-dec - ouput soft decision (float 32-bit)
|
||||
*/
|
||||
/* usage: [-l] [-p P] [-s] [(-c|-d)] [-t] (2|4) SampleRate SymbolRatez InputModemRawFile OutputOneBitPerCharFile */
|
||||
|
||||
int o = 0;
|
||||
int opt_idx = 0;
|
||||
while( o != -1 ){
|
||||
static struct option long_opts[] = {
|
||||
{"help", no_argument, 0, 'h'},
|
||||
{"lbr", no_argument, 0, 'l'},
|
||||
{"conv", required_argument, 0, 'p'},
|
||||
{"cs16", no_argument, 0, 'c'},
|
||||
{"cu8", no_argument, 0, 'd'},
|
||||
{"fsk_lower", optional_argument, 0, 'b'},
|
||||
{"fsk_upper", optional_argument, 0, 'u'},
|
||||
{"stats", optional_argument, 0, 't'},
|
||||
{"soft-dec", no_argument, 0, 's'},
|
||||
{"testframes",no_argument, 0, 'f'},
|
||||
{0, 0, 0, 0}
|
||||
};
|
||||
|
||||
o = getopt_long(argc,argv,"fhlp:cdt::sb:u:",long_opts,&opt_idx);
|
||||
|
||||
switch(o){
|
||||
case 'l':
|
||||
hbr = 0;
|
||||
break;
|
||||
case 'c':
|
||||
complex_input = 2;
|
||||
bytes_per_sample = 2;
|
||||
break;
|
||||
case 'd':
|
||||
complex_input = 2;
|
||||
bytes_per_sample = 1;
|
||||
break;
|
||||
case 'f':
|
||||
testframe_mode = 1;
|
||||
break;
|
||||
case 't':
|
||||
enable_stats = 1;
|
||||
if(optarg != NULL){
|
||||
stats_rate = atoi(optarg);
|
||||
if(stats_rate == 0){
|
||||
stats_rate = 8;
|
||||
}
|
||||
}
|
||||
break;
|
||||
case 's':
|
||||
soft_dec_mode = 1;
|
||||
break;
|
||||
case 'p':
|
||||
P = atoi(optarg);
|
||||
break;
|
||||
case 'b':
|
||||
if (optarg != NULL){
|
||||
fsk_lower = atoi(optarg);
|
||||
}
|
||||
break;
|
||||
case 'u':
|
||||
if (optarg != NULL){
|
||||
fsk_upper = atoi(optarg);
|
||||
}
|
||||
break;
|
||||
case 'h':
|
||||
case '?':
|
||||
goto helpmsg;
|
||||
break;
|
||||
}
|
||||
}
|
||||
int dx = optind;
|
||||
|
||||
if( (argc - dx) < 5){
|
||||
fprintf(stderr, "Too few arguments\n");
|
||||
goto helpmsg;
|
||||
}
|
||||
|
||||
if( (argc - dx) > 5){
|
||||
fprintf(stderr, "Too many arguments\n");
|
||||
helpmsg:
|
||||
fprintf(stderr,"usage: %s [-l] [-p P] [-s] [(-c|-d)] [-t [r]] [-f] (2|4) SampleRate SymbolRate InputModemRawFile OutputFile\n",argv[0]);
|
||||
fprintf(stderr," -lP --conv=P - P specifies the rate at which symbols are down-converted before further processing\n");
|
||||
fprintf(stderr," P must be divisible by the symbol size. Smaller P values will result in faster\n");
|
||||
fprintf(stderr," processing but lower demodulation preformance. If no P value is specified,\n");
|
||||
fprintf(stderr," P will default to it's highes possible value\n");
|
||||
fprintf(stderr," -c --cs16 - The raw input file will be in complex signed 16 bit format.\n");
|
||||
fprintf(stderr," -d --cu8 - The raw input file will be in complex unsigned 8 bit format.\n");
|
||||
fprintf(stderr," If neither -c nor -d are used, the input should be in signed 16 bit format.\n");
|
||||
fprintf(stderr," -f --testframes - Testframe mode, prints stats to stderr when a testframe is detected, if -t (JSON) \n");
|
||||
fprintf(stderr," is enabled stats will be in JSON format\n");
|
||||
fprintf(stderr," -t[r] --stats=[r] - Print out modem statistics to stderr in JSON.\n");
|
||||
fprintf(stderr," r, if provided, sets the number of modem frames between statistic printouts.\n");
|
||||
fprintf(stderr," -s --soft-dec - The output file will be in a soft-decision format, with one 32-bit float per bit.\n");
|
||||
fprintf(stderr," If -s is not used, the output will be in a 1 byte-per-bit format.\n");
|
||||
exit(1);
|
||||
}
|
||||
|
||||
/* Extract parameters */
|
||||
M = atoi(argv[dx]);
|
||||
Fs = atoi(argv[dx + 1]);
|
||||
Rs = atoi(argv[dx + 2]);
|
||||
|
||||
if( P == 0 ){
|
||||
P = Fs/Rs;
|
||||
}
|
||||
|
||||
if( (M!=2) && (M!=4) ){
|
||||
fprintf(stderr,"Mode %d is not valid. Mode must be 2 or 4.\n",M);
|
||||
goto helpmsg;
|
||||
}
|
||||
|
||||
/* Open files */
|
||||
if(strcmp(argv[dx + 3],"-")==0){
|
||||
fin = stdin;
|
||||
}else{
|
||||
fin = fopen(argv[dx + 3],"r");
|
||||
}
|
||||
|
||||
if(strcmp(argv[dx + 4],"-")==0){
|
||||
fout = stdout;
|
||||
}else{
|
||||
fout = fopen(argv[dx + 4],"w");
|
||||
}
|
||||
|
||||
|
||||
/* set up FSK */
|
||||
if(!hbr) {
|
||||
fsk = fsk_create(Fs,Rs,M,1200,400);
|
||||
}
|
||||
else {
|
||||
fsk = fsk_create_hbr(Fs,Rs,P,M,1200,400);
|
||||
if(fsk_lower> 0 && fsk_upper > fsk_lower){
|
||||
fsk_set_est_limits(fsk,fsk_lower,fsk_upper);
|
||||
fprintf(stderr,"Setting estimator limits to %d to %d Hz.\n",fsk_lower, fsk_upper);
|
||||
}
|
||||
}
|
||||
|
||||
if(fin==NULL || fout==NULL || fsk==NULL){
|
||||
fprintf(stderr,"Couldn't open files\n");
|
||||
exit(1);
|
||||
}
|
||||
|
||||
/* set up testframe mode */
|
||||
|
||||
int testframecnt, bitcnt, biterr, testframe_detected;
|
||||
uint8_t *bitbuf_tx = NULL, *bitbuf_rx = NULL;
|
||||
if (testframe_mode) {
|
||||
bitbuf_tx = (uint8_t*)malloc(sizeof(uint8_t)*TEST_FRAME_SIZE); assert(bitbuf_tx != NULL);
|
||||
bitbuf_rx = (uint8_t*)malloc(sizeof(uint8_t)*TEST_FRAME_SIZE); assert(bitbuf_rx != NULL);
|
||||
|
||||
/* Generate known tx frame from known seed */
|
||||
|
||||
srand(158324);
|
||||
for(i=0; i<TEST_FRAME_SIZE; i++){
|
||||
bitbuf_tx[i] = rand()&0x1;
|
||||
bitbuf_rx[i] = 0;
|
||||
}
|
||||
|
||||
testframecnt = 0;
|
||||
bitcnt = 0;
|
||||
biterr = 0;
|
||||
}
|
||||
|
||||
if(enable_stats){
|
||||
loop_time = ((float)fsk_nin(fsk))/((float)Fs);
|
||||
stats_loop = (int)(1/(stats_rate*loop_time));
|
||||
stats_ctr = 0;
|
||||
}
|
||||
|
||||
/* allocate buffers for processing */
|
||||
if(soft_dec_mode){
|
||||
sdbuf = (float*)malloc(sizeof(float)*fsk->Nbits); assert(sdbuf != NULL);
|
||||
}else{
|
||||
bitbuf = (uint8_t*)malloc(sizeof(uint8_t)*fsk->Nbits); assert(bitbuf != NULL);
|
||||
}
|
||||
rawbuf = (int16_t*)malloc(bytes_per_sample*(fsk->N+fsk->Ts*2)*complex_input);
|
||||
modbuf = (COMP*)malloc(sizeof(COMP)*(fsk->N+fsk->Ts*2));
|
||||
|
||||
/* set up signal handler so we can terminate gracefully */
|
||||
|
||||
if (signal(SIGTERM, sig_handler) == SIG_ERR) {
|
||||
printf("\ncan't catch SIGTERM\n");
|
||||
}
|
||||
|
||||
/* Demodulate! */
|
||||
|
||||
while( fread(rawbuf,bytes_per_sample*complex_input,fsk_nin(fsk),fin) == fsk_nin(fsk) ){
|
||||
/* convert input to a buffer of floats. Note scaling isn't really necessary for FSK */
|
||||
|
||||
if (complex_input == 1) {
|
||||
/* S16 real input */
|
||||
for(i=0;i<fsk_nin(fsk);i++){
|
||||
modbuf[i].real = ((float)rawbuf[i])/FDMDV_SCALE;
|
||||
modbuf[i].imag = 0.0;
|
||||
}
|
||||
}
|
||||
else {
|
||||
if (bytes_per_sample == 1) {
|
||||
/* U8 complex */
|
||||
uint8_t *rawbuf_u8 = (uint8_t*)rawbuf;
|
||||
for(i=0;i<fsk_nin(fsk);i++){
|
||||
modbuf[i].real = ((float)rawbuf_u8[2*i]-127.0)/128.0;
|
||||
modbuf[i].imag = ((float)rawbuf_u8[2*i+1]-127.0)/128.0;
|
||||
}
|
||||
}
|
||||
else {
|
||||
/* S16 complex */
|
||||
for(i=0;i<fsk_nin(fsk);i++){
|
||||
modbuf[i].real = ((float)rawbuf[2*i])/FDMDV_SCALE;
|
||||
modbuf[i].imag = ((float)rawbuf[2*i+1]/FDMDV_SCALE);
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
if(soft_dec_mode){
|
||||
fsk_demod_sd(fsk,sdbuf,modbuf);
|
||||
}else{
|
||||
fsk_demod(fsk,bitbuf,modbuf);
|
||||
}
|
||||
|
||||
testframe_detected = 0;
|
||||
if (testframe_mode) {
|
||||
/* attempt to find a testframe and update stats */
|
||||
/* update silding window of input bits */
|
||||
|
||||
int errs;
|
||||
for(j=0; j<fsk->Nbits; j++) {
|
||||
for(i=0; i<TEST_FRAME_SIZE-1; i++) {
|
||||
bitbuf_rx[i] = bitbuf_rx[i+1];
|
||||
}
|
||||
if (soft_dec_mode == 1) {
|
||||
bitbuf_rx[TEST_FRAME_SIZE-1] = sdbuf[j] < 0.0;
|
||||
}
|
||||
else {
|
||||
bitbuf_rx[TEST_FRAME_SIZE-1] = bitbuf[j];
|
||||
}
|
||||
|
||||
/* compare to know tx frame. If they are time aligned, there
|
||||
will be a fairly low bit error rate */
|
||||
|
||||
errs = 0;
|
||||
for(i=0; i<TEST_FRAME_SIZE; i++) {
|
||||
if (bitbuf_rx[i] != bitbuf_tx[i]) {
|
||||
errs++;
|
||||
}
|
||||
}
|
||||
|
||||
if (errs < 0.1*TEST_FRAME_SIZE) {
|
||||
/* OK, we have a valid test frame sync, so lets count errors */
|
||||
testframe_detected = 1;
|
||||
testframecnt++;
|
||||
bitcnt += TEST_FRAME_SIZE;
|
||||
biterr += errs;
|
||||
if (enable_stats == 0) {
|
||||
fprintf(stderr,"errs: %d FSK BER %f, bits tested %d, bit errors %d\n",
|
||||
errs, ((float)biterr/(float)bitcnt),bitcnt,biterr);
|
||||
}
|
||||
}
|
||||
}
|
||||
} /* if (testframe_mode) ... */
|
||||
|
||||
if (enable_stats) {
|
||||
if ((stats_ctr < 0) || testframe_detected) {
|
||||
fsk_get_demod_stats(fsk,&stats);
|
||||
|
||||
/* Print standard 2FSK stats */
|
||||
|
||||
fprintf(stderr,"{");
|
||||
time_t seconds = time(NULL);
|
||||
|
||||
fprintf(stderr,"\"secs\": %ld, \"EbNodB\": %5.1f, \"ppm\": %4d,",seconds, stats.snr_est, (int)fsk->ppm);
|
||||
fprintf(stderr," \"f1_est\":%.1f, \"f2_est\":%.1f",fsk->f_est[0],fsk->f_est[1]);
|
||||
|
||||
/* Print 4FSK stats if in 4FSK mode */
|
||||
|
||||
if(fsk->mode == 4){
|
||||
fprintf(stderr,", \"f3_est\":%.1f, \"f4_est\":%.1f",fsk->f_est[2],fsk->f_est[3]);
|
||||
}
|
||||
|
||||
if (testframe_mode == 0) {
|
||||
/* Print the eye diagram */
|
||||
|
||||
fprintf(stderr,",\t\"eye_diagram\":[");
|
||||
for(i=0;i<stats.neyetr;i++){
|
||||
fprintf(stderr,"[");
|
||||
for(j=0;j<stats.neyesamp;j++){
|
||||
fprintf(stderr,"%f ",stats.rx_eye[i][j]);
|
||||
if(j<stats.neyesamp-1) fprintf(stderr,",");
|
||||
}
|
||||
fprintf(stderr,"]");
|
||||
if(i<stats.neyetr-1) fprintf(stderr,",");
|
||||
}
|
||||
fprintf(stderr,"],");
|
||||
|
||||
/* Print a sample of the FFT from the freq estimator */
|
||||
fprintf(stderr,"\"samp_fft\":[");
|
||||
Ndft = fsk->Ndft/2;
|
||||
for(i=0; i<Ndft; i++){
|
||||
fprintf(stderr,"%f ",(fsk->fft_est)[i]);
|
||||
if(i<Ndft-1) fprintf(stderr,",");
|
||||
}
|
||||
fprintf(stderr,"]");
|
||||
}
|
||||
|
||||
if (testframe_mode) {
|
||||
fprintf(stderr,", \"frames\":%d, \"bits\":%d, \"errs\":%d",testframecnt,bitcnt,biterr);
|
||||
}
|
||||
|
||||
fprintf(stderr,"}\n");
|
||||
|
||||
if (stats_ctr < 0) {
|
||||
stats_ctr = stats_loop;
|
||||
}
|
||||
}
|
||||
if (testframe_mode == 0) {
|
||||
stats_ctr--;
|
||||
}
|
||||
}
|
||||
|
||||
if(soft_dec_mode){
|
||||
fwrite(sdbuf,sizeof(float),fsk->Nbits,fout);
|
||||
}else{
|
||||
fwrite(bitbuf,sizeof(uint8_t),fsk->Nbits,fout);
|
||||
}
|
||||
|
||||
if(fin == stdin || fout == stdin){
|
||||
fflush(fin);
|
||||
fflush(fout);
|
||||
}
|
||||
} /* while(fread ...... */
|
||||
|
||||
if (testframe_mode) {
|
||||
free(bitbuf_tx);
|
||||
free(bitbuf_rx);
|
||||
}
|
||||
|
||||
if(soft_dec_mode){
|
||||
free(sdbuf);
|
||||
}else{
|
||||
free(bitbuf);
|
||||
}
|
||||
|
||||
free(rawbuf);
|
||||
free(modbuf);
|
||||
|
||||
fclose(fin);
|
||||
fclose(fout);
|
||||
fsk_destroy(fsk);
|
||||
|
||||
return 0;
|
||||
}
|
||||
|
||||
|
|
@ -0,0 +1,408 @@
|
|||
/*
|
||||
Copyright (c) 2003-2010, Mark Borgerding
|
||||
|
||||
All rights reserved.
|
||||
|
||||
Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met:
|
||||
|
||||
* Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer.
|
||||
* Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution.
|
||||
* Neither the author nor the names of any contributors may be used to endorse or promote products derived from this software without specific prior written permission.
|
||||
|
||||
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
||||
*/
|
||||
|
||||
|
||||
#include "_kiss_fft_guts.h"
|
||||
/* The guts header contains all the multiplication and addition macros that are defined for
|
||||
fixed or floating point complex numbers. It also delares the kf_ internal functions.
|
||||
*/
|
||||
|
||||
static void kf_bfly2(
|
||||
kiss_fft_cpx * Fout,
|
||||
const size_t fstride,
|
||||
const kiss_fft_cfg st,
|
||||
int m
|
||||
)
|
||||
{
|
||||
kiss_fft_cpx * Fout2;
|
||||
kiss_fft_cpx * tw1 = st->twiddles;
|
||||
kiss_fft_cpx t;
|
||||
Fout2 = Fout + m;
|
||||
do{
|
||||
C_FIXDIV(*Fout,2); C_FIXDIV(*Fout2,2);
|
||||
|
||||
C_MUL (t, *Fout2 , *tw1);
|
||||
tw1 += fstride;
|
||||
C_SUB( *Fout2 , *Fout , t );
|
||||
C_ADDTO( *Fout , t );
|
||||
++Fout2;
|
||||
++Fout;
|
||||
}while (--m);
|
||||
}
|
||||
|
||||
static void kf_bfly4(
|
||||
kiss_fft_cpx * Fout,
|
||||
const size_t fstride,
|
||||
const kiss_fft_cfg st,
|
||||
const size_t m
|
||||
)
|
||||
{
|
||||
kiss_fft_cpx *tw1,*tw2,*tw3;
|
||||
kiss_fft_cpx scratch[6];
|
||||
size_t k=m;
|
||||
const size_t m2=2*m;
|
||||
const size_t m3=3*m;
|
||||
|
||||
|
||||
tw3 = tw2 = tw1 = st->twiddles;
|
||||
|
||||
do {
|
||||
C_FIXDIV(*Fout,4); C_FIXDIV(Fout[m],4); C_FIXDIV(Fout[m2],4); C_FIXDIV(Fout[m3],4);
|
||||
|
||||
C_MUL(scratch[0],Fout[m] , *tw1 );
|
||||
C_MUL(scratch[1],Fout[m2] , *tw2 );
|
||||
C_MUL(scratch[2],Fout[m3] , *tw3 );
|
||||
|
||||
C_SUB( scratch[5] , *Fout, scratch[1] );
|
||||
C_ADDTO(*Fout, scratch[1]);
|
||||
C_ADD( scratch[3] , scratch[0] , scratch[2] );
|
||||
C_SUB( scratch[4] , scratch[0] , scratch[2] );
|
||||
C_SUB( Fout[m2], *Fout, scratch[3] );
|
||||
tw1 += fstride;
|
||||
tw2 += fstride*2;
|
||||
tw3 += fstride*3;
|
||||
C_ADDTO( *Fout , scratch[3] );
|
||||
|
||||
if(st->inverse) {
|
||||
Fout[m].r = scratch[5].r - scratch[4].i;
|
||||
Fout[m].i = scratch[5].i + scratch[4].r;
|
||||
Fout[m3].r = scratch[5].r + scratch[4].i;
|
||||
Fout[m3].i = scratch[5].i - scratch[4].r;
|
||||
}else{
|
||||
Fout[m].r = scratch[5].r + scratch[4].i;
|
||||
Fout[m].i = scratch[5].i - scratch[4].r;
|
||||
Fout[m3].r = scratch[5].r - scratch[4].i;
|
||||
Fout[m3].i = scratch[5].i + scratch[4].r;
|
||||
}
|
||||
++Fout;
|
||||
}while(--k);
|
||||
}
|
||||
|
||||
static void kf_bfly3(
|
||||
kiss_fft_cpx * Fout,
|
||||
const size_t fstride,
|
||||
const kiss_fft_cfg st,
|
||||
size_t m
|
||||
)
|
||||
{
|
||||
size_t k=m;
|
||||
const size_t m2 = 2*m;
|
||||
kiss_fft_cpx *tw1,*tw2;
|
||||
kiss_fft_cpx scratch[5];
|
||||
kiss_fft_cpx epi3;
|
||||
epi3 = st->twiddles[fstride*m];
|
||||
|
||||
tw1=tw2=st->twiddles;
|
||||
|
||||
do{
|
||||
C_FIXDIV(*Fout,3); C_FIXDIV(Fout[m],3); C_FIXDIV(Fout[m2],3);
|
||||
|
||||
C_MUL(scratch[1],Fout[m] , *tw1);
|
||||
C_MUL(scratch[2],Fout[m2] , *tw2);
|
||||
|
||||
C_ADD(scratch[3],scratch[1],scratch[2]);
|
||||
C_SUB(scratch[0],scratch[1],scratch[2]);
|
||||
tw1 += fstride;
|
||||
tw2 += fstride*2;
|
||||
|
||||
Fout[m].r = Fout->r - HALF_OF(scratch[3].r);
|
||||
Fout[m].i = Fout->i - HALF_OF(scratch[3].i);
|
||||
|
||||
C_MULBYSCALAR( scratch[0] , epi3.i );
|
||||
|
||||
C_ADDTO(*Fout,scratch[3]);
|
||||
|
||||
Fout[m2].r = Fout[m].r + scratch[0].i;
|
||||
Fout[m2].i = Fout[m].i - scratch[0].r;
|
||||
|
||||
Fout[m].r -= scratch[0].i;
|
||||
Fout[m].i += scratch[0].r;
|
||||
|
||||
++Fout;
|
||||
}while(--k);
|
||||
}
|
||||
|
||||
static void kf_bfly5(
|
||||
kiss_fft_cpx * Fout,
|
||||
const size_t fstride,
|
||||
const kiss_fft_cfg st,
|
||||
int m
|
||||
)
|
||||
{
|
||||
kiss_fft_cpx *Fout0,*Fout1,*Fout2,*Fout3,*Fout4;
|
||||
int u;
|
||||
kiss_fft_cpx scratch[13];
|
||||
kiss_fft_cpx * twiddles = st->twiddles;
|
||||
kiss_fft_cpx *tw;
|
||||
kiss_fft_cpx ya,yb;
|
||||
ya = twiddles[fstride*m];
|
||||
yb = twiddles[fstride*2*m];
|
||||
|
||||
Fout0=Fout;
|
||||
Fout1=Fout0+m;
|
||||
Fout2=Fout0+2*m;
|
||||
Fout3=Fout0+3*m;
|
||||
Fout4=Fout0+4*m;
|
||||
|
||||
tw=st->twiddles;
|
||||
for ( u=0; u<m; ++u ) {
|
||||
C_FIXDIV( *Fout0,5); C_FIXDIV( *Fout1,5); C_FIXDIV( *Fout2,5); C_FIXDIV( *Fout3,5); C_FIXDIV( *Fout4,5);
|
||||
scratch[0] = *Fout0;
|
||||
|
||||
C_MUL(scratch[1] ,*Fout1, tw[u*fstride]);
|
||||
C_MUL(scratch[2] ,*Fout2, tw[2*u*fstride]);
|
||||
C_MUL(scratch[3] ,*Fout3, tw[3*u*fstride]);
|
||||
C_MUL(scratch[4] ,*Fout4, tw[4*u*fstride]);
|
||||
|
||||
C_ADD( scratch[7],scratch[1],scratch[4]);
|
||||
C_SUB( scratch[10],scratch[1],scratch[4]);
|
||||
C_ADD( scratch[8],scratch[2],scratch[3]);
|
||||
C_SUB( scratch[9],scratch[2],scratch[3]);
|
||||
|
||||
Fout0->r += scratch[7].r + scratch[8].r;
|
||||
Fout0->i += scratch[7].i + scratch[8].i;
|
||||
|
||||
scratch[5].r = scratch[0].r + S_MUL(scratch[7].r,ya.r) + S_MUL(scratch[8].r,yb.r);
|
||||
scratch[5].i = scratch[0].i + S_MUL(scratch[7].i,ya.r) + S_MUL(scratch[8].i,yb.r);
|
||||
|
||||
scratch[6].r = S_MUL(scratch[10].i,ya.i) + S_MUL(scratch[9].i,yb.i);
|
||||
scratch[6].i = -S_MUL(scratch[10].r,ya.i) - S_MUL(scratch[9].r,yb.i);
|
||||
|
||||
C_SUB(*Fout1,scratch[5],scratch[6]);
|
||||
C_ADD(*Fout4,scratch[5],scratch[6]);
|
||||
|
||||
scratch[11].r = scratch[0].r + S_MUL(scratch[7].r,yb.r) + S_MUL(scratch[8].r,ya.r);
|
||||
scratch[11].i = scratch[0].i + S_MUL(scratch[7].i,yb.r) + S_MUL(scratch[8].i,ya.r);
|
||||
scratch[12].r = - S_MUL(scratch[10].i,yb.i) + S_MUL(scratch[9].i,ya.i);
|
||||
scratch[12].i = S_MUL(scratch[10].r,yb.i) - S_MUL(scratch[9].r,ya.i);
|
||||
|
||||
C_ADD(*Fout2,scratch[11],scratch[12]);
|
||||
C_SUB(*Fout3,scratch[11],scratch[12]);
|
||||
|
||||
++Fout0;++Fout1;++Fout2;++Fout3;++Fout4;
|
||||
}
|
||||
}
|
||||
|
||||
/* perform the butterfly for one stage of a mixed radix FFT */
|
||||
static void kf_bfly_generic(
|
||||
kiss_fft_cpx * Fout,
|
||||
const size_t fstride,
|
||||
const kiss_fft_cfg st,
|
||||
int m,
|
||||
int p
|
||||
)
|
||||
{
|
||||
int u,k,q1,q;
|
||||
kiss_fft_cpx * twiddles = st->twiddles;
|
||||
kiss_fft_cpx t;
|
||||
int Norig = st->nfft;
|
||||
|
||||
kiss_fft_cpx * scratch = (kiss_fft_cpx*)KISS_FFT_TMP_ALLOC(sizeof(kiss_fft_cpx)*p);
|
||||
|
||||
for ( u=0; u<m; ++u ) {
|
||||
k=u;
|
||||
for ( q1=0 ; q1<p ; ++q1 ) {
|
||||
scratch[q1] = Fout[ k ];
|
||||
C_FIXDIV(scratch[q1],p);
|
||||
k += m;
|
||||
}
|
||||
|
||||
k=u;
|
||||
for ( q1=0 ; q1<p ; ++q1 ) {
|
||||
int twidx=0;
|
||||
Fout[ k ] = scratch[0];
|
||||
for (q=1;q<p;++q ) {
|
||||
twidx += fstride * k;
|
||||
if (twidx>=Norig) twidx-=Norig;
|
||||
C_MUL(t,scratch[q] , twiddles[twidx] );
|
||||
C_ADDTO( Fout[ k ] ,t);
|
||||
}
|
||||
k += m;
|
||||
}
|
||||
}
|
||||
KISS_FFT_TMP_FREE(scratch);
|
||||
}
|
||||
|
||||
static
|
||||
void kf_work(
|
||||
kiss_fft_cpx * Fout,
|
||||
const kiss_fft_cpx * f,
|
||||
const size_t fstride,
|
||||
int in_stride,
|
||||
int * factors,
|
||||
const kiss_fft_cfg st
|
||||
)
|
||||
{
|
||||
kiss_fft_cpx * Fout_beg=Fout;
|
||||
const int p=*factors++; /* the radix */
|
||||
const int m=*factors++; /* stage's fft length/p */
|
||||
const kiss_fft_cpx * Fout_end = Fout + p*m;
|
||||
|
||||
#ifdef _OPENMP
|
||||
// use openmp extensions at the
|
||||
// top-level (not recursive)
|
||||
if (fstride==1 && p<=5)
|
||||
{
|
||||
int k;
|
||||
|
||||
// execute the p different work units in different threads
|
||||
# pragma omp parallel for
|
||||
for (k=0;k<p;++k)
|
||||
kf_work( Fout +k*m, f+ fstride*in_stride*k,fstride*p,in_stride,factors,st);
|
||||
// all threads have joined by this point
|
||||
|
||||
switch (p) {
|
||||
case 2: kf_bfly2(Fout,fstride,st,m); break;
|
||||
case 3: kf_bfly3(Fout,fstride,st,m); break;
|
||||
case 4: kf_bfly4(Fout,fstride,st,m); break;
|
||||
case 5: kf_bfly5(Fout,fstride,st,m); break;
|
||||
default: kf_bfly_generic(Fout,fstride,st,m,p); break;
|
||||
}
|
||||
return;
|
||||
}
|
||||
#endif
|
||||
|
||||
if (m==1) {
|
||||
do{
|
||||
*Fout = *f;
|
||||
f += fstride*in_stride;
|
||||
}while(++Fout != Fout_end );
|
||||
}else{
|
||||
do{
|
||||
// recursive call:
|
||||
// DFT of size m*p performed by doing
|
||||
// p instances of smaller DFTs of size m,
|
||||
// each one takes a decimated version of the input
|
||||
kf_work( Fout , f, fstride*p, in_stride, factors,st);
|
||||
f += fstride*in_stride;
|
||||
}while( (Fout += m) != Fout_end );
|
||||
}
|
||||
|
||||
Fout=Fout_beg;
|
||||
|
||||
// recombine the p smaller DFTs
|
||||
switch (p) {
|
||||
case 2: kf_bfly2(Fout,fstride,st,m); break;
|
||||
case 3: kf_bfly3(Fout,fstride,st,m); break;
|
||||
case 4: kf_bfly4(Fout,fstride,st,m); break;
|
||||
case 5: kf_bfly5(Fout,fstride,st,m); break;
|
||||
default: kf_bfly_generic(Fout,fstride,st,m,p); break;
|
||||
}
|
||||
}
|
||||
|
||||
/* facbuf is populated by p1,m1,p2,m2, ...
|
||||
where
|
||||
p[i] * m[i] = m[i-1]
|
||||
m0 = n */
|
||||
static
|
||||
void kf_factor(int n,int * facbuf)
|
||||
{
|
||||
int p=4;
|
||||
double floor_sqrt;
|
||||
floor_sqrt = floorf( sqrtf((double)n) );
|
||||
|
||||
/*factor out powers of 4, powers of 2, then any remaining primes */
|
||||
do {
|
||||
while (n % p) {
|
||||
switch (p) {
|
||||
case 4: p = 2; break;
|
||||
case 2: p = 3; break;
|
||||
default: p += 2; break;
|
||||
}
|
||||
if (p > floor_sqrt)
|
||||
p = n; /* no more factors, skip to end */
|
||||
}
|
||||
n /= p;
|
||||
*facbuf++ = p;
|
||||
*facbuf++ = n;
|
||||
} while (n > 1);
|
||||
}
|
||||
|
||||
/*
|
||||
*
|
||||
* User-callable function to allocate all necessary storage space for the fft.
|
||||
*
|
||||
* The return value is a contiguous block of memory, allocated with malloc. As such,
|
||||
* It can be freed with free(), rather than a kiss_fft-specific function.
|
||||
* */
|
||||
kiss_fft_cfg kiss_fft_alloc(int nfft,int inverse_fft,void * mem,size_t * lenmem )
|
||||
{
|
||||
kiss_fft_cfg st=NULL;
|
||||
size_t memneeded = sizeof(struct kiss_fft_state)
|
||||
+ sizeof(kiss_fft_cpx)*(nfft-1); /* twiddle factors*/
|
||||
|
||||
if ( lenmem==NULL ) {
|
||||
st = ( kiss_fft_cfg)KISS_FFT_MALLOC( memneeded );
|
||||
}else{
|
||||
if (mem != NULL && *lenmem >= memneeded)
|
||||
st = (kiss_fft_cfg)mem;
|
||||
*lenmem = memneeded;
|
||||
}
|
||||
if (st) {
|
||||
int i;
|
||||
st->nfft=nfft;
|
||||
st->inverse = inverse_fft;
|
||||
|
||||
for (i=0;i<nfft;++i) {
|
||||
const double pi=3.141592653589793238462643383279502884197169399375105820974944;
|
||||
double phase = -2*pi*i / nfft;
|
||||
if (st->inverse)
|
||||
phase *= -1;
|
||||
kf_cexp(st->twiddles+i, phase );
|
||||
}
|
||||
|
||||
kf_factor(nfft,st->factors);
|
||||
}
|
||||
return st;
|
||||
}
|
||||
|
||||
|
||||
void kiss_fft_stride(kiss_fft_cfg st,const kiss_fft_cpx *fin,kiss_fft_cpx *fout,int in_stride)
|
||||
{
|
||||
if (fin == fout) {
|
||||
//NOTE: this is not really an in-place FFT algorithm.
|
||||
//It just performs an out-of-place FFT into a temp buffer
|
||||
kiss_fft_cpx * tmpbuf = (kiss_fft_cpx*)KISS_FFT_TMP_ALLOC( sizeof(kiss_fft_cpx)*st->nfft);
|
||||
kf_work(tmpbuf,fin,1,in_stride, st->factors,st);
|
||||
memcpy(fout,tmpbuf,sizeof(kiss_fft_cpx)*st->nfft);
|
||||
KISS_FFT_TMP_FREE(tmpbuf);
|
||||
}else{
|
||||
kf_work( fout, fin, 1,in_stride, st->factors,st );
|
||||
}
|
||||
}
|
||||
|
||||
void kiss_fft(kiss_fft_cfg cfg,const kiss_fft_cpx *fin,kiss_fft_cpx *fout)
|
||||
{
|
||||
kiss_fft_stride(cfg,fin,fout,1);
|
||||
}
|
||||
|
||||
|
||||
void kiss_fft_cleanup(void)
|
||||
{
|
||||
// nothing needed any more
|
||||
}
|
||||
|
||||
int kiss_fft_next_fast_size(int n)
|
||||
{
|
||||
while(1) {
|
||||
int m=n;
|
||||
while ( (m%2) == 0 ) m/=2;
|
||||
while ( (m%3) == 0 ) m/=3;
|
||||
while ( (m%5) == 0 ) m/=5;
|
||||
if (m<=1)
|
||||
break; /* n is completely factorable by twos, threes, and fives */
|
||||
n++;
|
||||
}
|
||||
return n;
|
||||
}
|
||||
|
|
@ -0,0 +1,124 @@
|
|||
#ifndef KISS_FFT_H
|
||||
#define KISS_FFT_H
|
||||
|
||||
#include <stdlib.h>
|
||||
#include <stdio.h>
|
||||
#include <math.h>
|
||||
#include <string.h>
|
||||
|
||||
#ifdef __cplusplus
|
||||
extern "C" {
|
||||
#endif
|
||||
|
||||
/*
|
||||
ATTENTION!
|
||||
If you would like a :
|
||||
-- a utility that will handle the caching of fft objects
|
||||
-- real-only (no imaginary time component ) FFT
|
||||
-- a multi-dimensional FFT
|
||||
-- a command-line utility to perform ffts
|
||||
-- a command-line utility to perform fast-convolution filtering
|
||||
|
||||
Then see kfc.h kiss_fftr.h kiss_fftnd.h fftutil.c kiss_fastfir.c
|
||||
in the tools/ directory.
|
||||
*/
|
||||
|
||||
#ifdef USE_SIMD
|
||||
# include <xmmintrin.h>
|
||||
# define kiss_fft_scalar __m128
|
||||
#define KISS_FFT_MALLOC(nbytes) _mm_malloc(nbytes,16)
|
||||
#define KISS_FFT_FREE _mm_free
|
||||
#else
|
||||
#define KISS_FFT_MALLOC malloc
|
||||
#define KISS_FFT_FREE free
|
||||
#endif
|
||||
|
||||
|
||||
#ifdef FIXED_POINT
|
||||
#include <sys/types.h>
|
||||
# if (FIXED_POINT == 32)
|
||||
# define kiss_fft_scalar int32_t
|
||||
# else
|
||||
# define kiss_fft_scalar int16_t
|
||||
# endif
|
||||
#else
|
||||
# ifndef kiss_fft_scalar
|
||||
/* default is float */
|
||||
# define kiss_fft_scalar float
|
||||
# endif
|
||||
#endif
|
||||
|
||||
typedef struct {
|
||||
kiss_fft_scalar r;
|
||||
kiss_fft_scalar i;
|
||||
}kiss_fft_cpx;
|
||||
|
||||
typedef struct kiss_fft_state* kiss_fft_cfg;
|
||||
|
||||
/*
|
||||
* kiss_fft_alloc
|
||||
*
|
||||
* Initialize a FFT (or IFFT) algorithm's cfg/state buffer.
|
||||
*
|
||||
* typical usage: kiss_fft_cfg mycfg=kiss_fft_alloc(1024,0,NULL,NULL);
|
||||
*
|
||||
* The return value from fft_alloc is a cfg buffer used internally
|
||||
* by the fft routine or NULL.
|
||||
*
|
||||
* If lenmem is NULL, then kiss_fft_alloc will allocate a cfg buffer using malloc.
|
||||
* The returned value should be free()d when done to avoid memory leaks.
|
||||
*
|
||||
* The state can be placed in a user supplied buffer 'mem':
|
||||
* If lenmem is not NULL and mem is not NULL and *lenmem is large enough,
|
||||
* then the function places the cfg in mem and the size used in *lenmem
|
||||
* and returns mem.
|
||||
*
|
||||
* If lenmem is not NULL and ( mem is NULL or *lenmem is not large enough),
|
||||
* then the function returns NULL and places the minimum cfg
|
||||
* buffer size in *lenmem.
|
||||
* */
|
||||
|
||||
kiss_fft_cfg kiss_fft_alloc(int nfft,int inverse_fft,void * mem,size_t * lenmem);
|
||||
|
||||
/*
|
||||
* kiss_fft(cfg,in_out_buf)
|
||||
*
|
||||
* Perform an FFT on a complex input buffer.
|
||||
* for a forward FFT,
|
||||
* fin should be f[0] , f[1] , ... ,f[nfft-1]
|
||||
* fout will be F[0] , F[1] , ... ,F[nfft-1]
|
||||
* Note that each element is complex and can be accessed like
|
||||
f[k].r and f[k].i
|
||||
* */
|
||||
void kiss_fft(kiss_fft_cfg cfg,const kiss_fft_cpx *fin,kiss_fft_cpx *fout);
|
||||
|
||||
/*
|
||||
A more generic version of the above function. It reads its input from every Nth sample.
|
||||
* */
|
||||
void kiss_fft_stride(kiss_fft_cfg cfg,const kiss_fft_cpx *fin,kiss_fft_cpx *fout,int fin_stride);
|
||||
|
||||
/* If kiss_fft_alloc allocated a buffer, it is one contiguous
|
||||
buffer and can be simply free()d when no longer needed*/
|
||||
#define kiss_fft_free free
|
||||
|
||||
/*
|
||||
Cleans up some memory that gets managed internally. Not necessary to call, but it might clean up
|
||||
your compiler output to call this before you exit.
|
||||
*/
|
||||
void kiss_fft_cleanup(void);
|
||||
|
||||
|
||||
/*
|
||||
* Returns the smallest integer k, such that k>=n and k has only "fast" factors (2,3,5)
|
||||
*/
|
||||
int kiss_fft_next_fast_size(int n);
|
||||
|
||||
/* for real ffts, we need an even size */
|
||||
#define kiss_fftr_next_fast_size_real(n) \
|
||||
(kiss_fft_next_fast_size( ((n)+1)>>1)<<1)
|
||||
|
||||
#ifdef __cplusplus
|
||||
}
|
||||
#endif
|
||||
|
||||
#endif
|
||||
|
|
@ -0,0 +1,154 @@
|
|||
/*
|
||||
Copyright (c) 2003-2004, Mark Borgerding
|
||||
|
||||
All rights reserved.
|
||||
|
||||
Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met:
|
||||
|
||||
* Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer.
|
||||
* Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution.
|
||||
* Neither the author nor the names of any contributors may be used to endorse or promote products derived from this software without specific prior written permission.
|
||||
|
||||
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
||||
*/
|
||||
|
||||
#include "kiss_fftr.h"
|
||||
#include "_kiss_fft_guts.h"
|
||||
#include "assert.h"
|
||||
|
||||
struct kiss_fftr_state{
|
||||
kiss_fft_cfg substate;
|
||||
kiss_fft_cpx * tmpbuf;
|
||||
kiss_fft_cpx * super_twiddles;
|
||||
#ifdef USE_SIMD
|
||||
void * pad;
|
||||
#endif
|
||||
};
|
||||
|
||||
kiss_fftr_cfg kiss_fftr_alloc(int nfft,int inverse_fft,void * mem,size_t * lenmem)
|
||||
{
|
||||
int i;
|
||||
kiss_fftr_cfg st = NULL;
|
||||
size_t subsize, memneeded;
|
||||
|
||||
if (nfft & 1) {
|
||||
fprintf(stderr,"Real FFT optimization must be even.\n");
|
||||
return NULL;
|
||||
}
|
||||
nfft >>= 1;
|
||||
|
||||
kiss_fft_alloc (nfft, inverse_fft, NULL, &subsize);
|
||||
memneeded = sizeof(struct kiss_fftr_state) + subsize + sizeof(kiss_fft_cpx) * ( nfft * 3 / 2);
|
||||
|
||||
if (lenmem == NULL) {
|
||||
st = (kiss_fftr_cfg) KISS_FFT_MALLOC (memneeded);
|
||||
} else {
|
||||
if (*lenmem >= memneeded)
|
||||
st = (kiss_fftr_cfg) mem;
|
||||
*lenmem = memneeded;
|
||||
}
|
||||
if (!st)
|
||||
return NULL;
|
||||
|
||||
st->substate = (kiss_fft_cfg) (st + 1); /*just beyond kiss_fftr_state struct */
|
||||
st->tmpbuf = (kiss_fft_cpx *) (((char *) st->substate) + subsize);
|
||||
st->super_twiddles = st->tmpbuf + nfft;
|
||||
kiss_fft_alloc(nfft, inverse_fft, st->substate, &subsize);
|
||||
|
||||
for (i = 0; i < nfft/2; ++i) {
|
||||
float phase =
|
||||
-3.14159265358979323846264338327 * ((float) (i+1) / nfft + .5);
|
||||
if (inverse_fft)
|
||||
phase *= -1;
|
||||
kf_cexp (st->super_twiddles+i,phase);
|
||||
}
|
||||
return st;
|
||||
}
|
||||
|
||||
void kiss_fftr(kiss_fftr_cfg st,const kiss_fft_scalar *timedata,kiss_fft_cpx *freqdata)
|
||||
{
|
||||
/* input buffer timedata is stored row-wise */
|
||||
int k,ncfft;
|
||||
kiss_fft_cpx fpnk,fpk,f1k,f2k,tw,tdc;
|
||||
|
||||
assert(st->substate->inverse==0);
|
||||
|
||||
ncfft = st->substate->nfft;
|
||||
|
||||
/*perform the parallel fft of two real signals packed in real,imag*/
|
||||
kiss_fft( st->substate , (const kiss_fft_cpx*)timedata, st->tmpbuf );
|
||||
/* The real part of the DC element of the frequency spectrum in st->tmpbuf
|
||||
* contains the sum of the even-numbered elements of the input time sequence
|
||||
* The imag part is the sum of the odd-numbered elements
|
||||
*
|
||||
* The sum of tdc.r and tdc.i is the sum of the input time sequence.
|
||||
* yielding DC of input time sequence
|
||||
* The difference of tdc.r - tdc.i is the sum of the input (dot product) [1,-1,1,-1...
|
||||
* yielding Nyquist bin of input time sequence
|
||||
*/
|
||||
|
||||
tdc.r = st->tmpbuf[0].r;
|
||||
tdc.i = st->tmpbuf[0].i;
|
||||
C_FIXDIV(tdc,2);
|
||||
CHECK_OVERFLOW_OP(tdc.r ,+, tdc.i);
|
||||
CHECK_OVERFLOW_OP(tdc.r ,-, tdc.i);
|
||||
freqdata[0].r = tdc.r + tdc.i;
|
||||
freqdata[ncfft].r = tdc.r - tdc.i;
|
||||
#ifdef USE_SIMD
|
||||
freqdata[ncfft].i = freqdata[0].i = _mm_set1_ps(0);
|
||||
#else
|
||||
freqdata[ncfft].i = freqdata[0].i = 0;
|
||||
#endif
|
||||
|
||||
for ( k=1;k <= ncfft/2 ; ++k ) {
|
||||
fpk = st->tmpbuf[k];
|
||||
fpnk.r = st->tmpbuf[ncfft-k].r;
|
||||
fpnk.i = - st->tmpbuf[ncfft-k].i;
|
||||
C_FIXDIV(fpk,2);
|
||||
C_FIXDIV(fpnk,2);
|
||||
|
||||
C_ADD( f1k, fpk , fpnk );
|
||||
C_SUB( f2k, fpk , fpnk );
|
||||
C_MUL( tw , f2k , st->super_twiddles[k-1]);
|
||||
|
||||
freqdata[k].r = HALF_OF(f1k.r + tw.r);
|
||||
freqdata[k].i = HALF_OF(f1k.i + tw.i);
|
||||
freqdata[ncfft-k].r = HALF_OF(f1k.r - tw.r);
|
||||
freqdata[ncfft-k].i = HALF_OF(tw.i - f1k.i);
|
||||
}
|
||||
}
|
||||
|
||||
void kiss_fftri(kiss_fftr_cfg st,const kiss_fft_cpx *freqdata,kiss_fft_scalar *timedata)
|
||||
{
|
||||
/* input buffer timedata is stored row-wise */
|
||||
int k, ncfft;
|
||||
|
||||
assert(st->substate->inverse == 1);
|
||||
|
||||
ncfft = st->substate->nfft;
|
||||
|
||||
st->tmpbuf[0].r = freqdata[0].r + freqdata[ncfft].r;
|
||||
st->tmpbuf[0].i = freqdata[0].r - freqdata[ncfft].r;
|
||||
C_FIXDIV(st->tmpbuf[0],2);
|
||||
|
||||
for (k = 1; k <= ncfft / 2; ++k) {
|
||||
kiss_fft_cpx fk, fnkc, fek, fok, tmp;
|
||||
fk = freqdata[k];
|
||||
fnkc.r = freqdata[ncfft - k].r;
|
||||
fnkc.i = -freqdata[ncfft - k].i;
|
||||
C_FIXDIV( fk , 2 );
|
||||
C_FIXDIV( fnkc , 2 );
|
||||
|
||||
C_ADD (fek, fk, fnkc);
|
||||
C_SUB (tmp, fk, fnkc);
|
||||
C_MUL (fok, tmp, st->super_twiddles[k-1]);
|
||||
C_ADD (st->tmpbuf[k], fek, fok);
|
||||
C_SUB (st->tmpbuf[ncfft - k], fek, fok);
|
||||
#ifdef USE_SIMD
|
||||
st->tmpbuf[ncfft - k].i *= _mm_set1_ps(-1.0);
|
||||
#else
|
||||
st->tmpbuf[ncfft - k].i *= -1;
|
||||
#endif
|
||||
}
|
||||
kiss_fft (st->substate, st->tmpbuf, (kiss_fft_cpx *) timedata);
|
||||
}
|
||||
|
|
@ -0,0 +1,46 @@
|
|||
#ifndef KISS_FTR_H
|
||||
#define KISS_FTR_H
|
||||
|
||||
#include "kiss_fft.h"
|
||||
#ifdef __cplusplus
|
||||
extern "C" {
|
||||
#endif
|
||||
|
||||
|
||||
/*
|
||||
|
||||
Real optimized version can save about 45% cpu time vs. complex fft of a real seq.
|
||||
|
||||
|
||||
|
||||
*/
|
||||
|
||||
typedef struct kiss_fftr_state *kiss_fftr_cfg;
|
||||
|
||||
|
||||
kiss_fftr_cfg kiss_fftr_alloc(int nfft,int inverse_fft,void * mem, size_t * lenmem);
|
||||
/*
|
||||
nfft must be even
|
||||
|
||||
If you don't care to allocate space, use mem = lenmem = NULL
|
||||
*/
|
||||
|
||||
|
||||
void kiss_fftr(kiss_fftr_cfg cfg,const kiss_fft_scalar *timedata,kiss_fft_cpx *freqdata);
|
||||
/*
|
||||
input timedata has nfft scalar points
|
||||
output freqdata has nfft/2+1 complex points
|
||||
*/
|
||||
|
||||
void kiss_fftri(kiss_fftr_cfg cfg,const kiss_fft_cpx *freqdata,kiss_fft_scalar *timedata);
|
||||
/*
|
||||
input freqdata has nfft/2+1 complex points
|
||||
output timedata has nfft scalar points
|
||||
*/
|
||||
|
||||
#define kiss_fftr_free free
|
||||
|
||||
#ifdef __cplusplus
|
||||
}
|
||||
#endif
|
||||
#endif
|
||||
|
|
@ -0,0 +1,241 @@
|
|||
/*---------------------------------------------------------------------------*\
|
||||
|
||||
FILE........: modem_probe.c
|
||||
AUTHOR......: Brady O'Brien
|
||||
DATE CREATED: 9 January 2016
|
||||
|
||||
Library to easily extract debug traces from modems during development and
|
||||
verification
|
||||
|
||||
\*---------------------------------------------------------------------------*/
|
||||
|
||||
/*
|
||||
Copyright (C) 2016 David Rowe
|
||||
|
||||
All rights reserved.
|
||||
|
||||
This program is free software; you can redistribute it and/or modify
|
||||
it under the terms of the GNU Lesser General Public License version 2.1, as
|
||||
published by the Free Software Foundation. This program 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 Lesser General Public License
|
||||
along with this program; if not, see <http://www.gnu.org/licenses/>.
|
||||
*/
|
||||
|
||||
#include <string.h>
|
||||
#include <stdio.h>
|
||||
#include <stdlib.h>
|
||||
#include <stdint.h>
|
||||
#include "comp.h"
|
||||
#include "octave.h"
|
||||
|
||||
#define TRACE_I 1
|
||||
#define TRACE_F 2
|
||||
#define TRACE_C 3
|
||||
|
||||
|
||||
typedef struct probe_trace_info_s probe_trace_info;
|
||||
typedef struct datlink_s datlink;
|
||||
|
||||
struct datlink_s{
|
||||
void * data;
|
||||
size_t len;
|
||||
datlink * next;
|
||||
};
|
||||
|
||||
struct probe_trace_info_s{
|
||||
int type;
|
||||
char name[255];
|
||||
datlink * data;
|
||||
datlink * last;
|
||||
probe_trace_info *next;
|
||||
};
|
||||
|
||||
static char *run = NULL;
|
||||
static char *mod = NULL;
|
||||
static probe_trace_info *first_trace = NULL;
|
||||
|
||||
/* Init the probing library */
|
||||
void modem_probe_init_int(char *modname, char *runname){
|
||||
mod = malloc((strlen(modname)+1)*sizeof(char));
|
||||
run = malloc((strlen(runname)+1)*sizeof(char));
|
||||
strcpy(run,runname);
|
||||
strcpy(mod,modname);
|
||||
}
|
||||
|
||||
/*
|
||||
* Gather the data stored in the linked list into a single blob,
|
||||
* freeing links and buffers as it goes
|
||||
*/
|
||||
void * gather_data(datlink * d,size_t * len){
|
||||
size_t size = 0;
|
||||
datlink * cur = d;
|
||||
datlink * next;
|
||||
while(cur!=NULL){
|
||||
size += d->len;
|
||||
cur = cur->next;
|
||||
}
|
||||
cur = d;
|
||||
size_t i = 0;
|
||||
void * newbuf = malloc(size);
|
||||
|
||||
while(cur!=NULL){
|
||||
memcpy(newbuf+i,cur->data,cur->len);
|
||||
i += cur->len;
|
||||
free(cur->data);
|
||||
next = cur->next;
|
||||
free(cur);
|
||||
cur = next;
|
||||
}
|
||||
*len = size;
|
||||
return newbuf;
|
||||
}
|
||||
|
||||
/* Dump all of the traces into a nice octave-able dump file */
|
||||
void modem_probe_close_int(){
|
||||
if(run==NULL)
|
||||
return;
|
||||
|
||||
probe_trace_info *cur,*next;
|
||||
cur = first_trace;
|
||||
FILE * dumpfile = fopen(run,"w");
|
||||
void * dbuf;
|
||||
size_t len;
|
||||
|
||||
while(cur != NULL){
|
||||
dbuf = gather_data(cur->data,&len);
|
||||
switch(cur->type){
|
||||
case TRACE_I:
|
||||
octave_save_int(dumpfile,cur->name,(int32_t*)dbuf,1,len/sizeof(int32_t));
|
||||
break;
|
||||
case TRACE_F:
|
||||
octave_save_float(dumpfile,cur->name,(float*)dbuf,1,len/sizeof(float),10);
|
||||
break;
|
||||
case TRACE_C:
|
||||
octave_save_complex(dumpfile,cur->name,(COMP*)dbuf,1,len/sizeof(COMP),10);
|
||||
break;
|
||||
}
|
||||
next = cur->next;
|
||||
free(cur);
|
||||
free(dbuf);
|
||||
cur = next;
|
||||
}
|
||||
|
||||
fclose(dumpfile);
|
||||
free(run);
|
||||
free(mod);
|
||||
}
|
||||
|
||||
/* Look up or create a trace by name */
|
||||
probe_trace_info * modem_probe_get_trace(char * tracename){
|
||||
probe_trace_info *cur,*npti;
|
||||
|
||||
/* Make sure probe session is open */
|
||||
if(run==NULL)
|
||||
return NULL;
|
||||
|
||||
cur = first_trace;
|
||||
/* Walk through list, find trace with matching name */
|
||||
while(cur != NULL){
|
||||
/* We got one! */
|
||||
if(strcmp( cur->name, tracename) == 0){
|
||||
return cur;
|
||||
}
|
||||
cur = cur->next;
|
||||
}
|
||||
/* None found, open a new trace */
|
||||
|
||||
npti = (probe_trace_info *) malloc(sizeof(probe_trace_info));
|
||||
npti->next = first_trace;
|
||||
npti->data = NULL;
|
||||
npti->last = NULL;
|
||||
strcpy(npti->name,tracename);
|
||||
first_trace = npti;
|
||||
|
||||
return npti;
|
||||
|
||||
}
|
||||
|
||||
|
||||
void modem_probe_samp_i_int(char * tracename,int32_t samp[],size_t cnt){
|
||||
probe_trace_info *pti;
|
||||
datlink *ndat;
|
||||
|
||||
pti = modem_probe_get_trace(tracename);
|
||||
if(pti == NULL)
|
||||
return;
|
||||
|
||||
pti->type = TRACE_I;
|
||||
|
||||
ndat = (datlink*) malloc(sizeof(datlink));
|
||||
ndat->data = malloc(sizeof(int32_t)*cnt);
|
||||
|
||||
ndat->len = cnt*sizeof(int32_t);
|
||||
ndat->next = NULL;
|
||||
memcpy(ndat->data,(void*)&(samp[0]),sizeof(int32_t)*cnt);
|
||||
|
||||
if(pti->last!=NULL){
|
||||
pti->last->next = ndat;
|
||||
pti->last = ndat;
|
||||
} else {
|
||||
pti->data = ndat;
|
||||
pti->last = ndat;
|
||||
}
|
||||
|
||||
}
|
||||
|
||||
void modem_probe_samp_f_int(char * tracename,float samp[],size_t cnt){
|
||||
probe_trace_info *pti;
|
||||
datlink *ndat;
|
||||
|
||||
pti = modem_probe_get_trace(tracename);
|
||||
if(pti == NULL)
|
||||
return;
|
||||
|
||||
pti->type = TRACE_F;
|
||||
|
||||
ndat = (datlink*) malloc(sizeof(datlink));
|
||||
ndat->data = malloc(sizeof(float)*cnt);
|
||||
|
||||
ndat->len = cnt*sizeof(float);
|
||||
ndat->next = NULL;
|
||||
memcpy(ndat->data,(void*)&(samp[0]),sizeof(float)*cnt);
|
||||
|
||||
if(pti->last!=NULL){
|
||||
pti->last->next = ndat;
|
||||
pti->last = ndat;
|
||||
} else {
|
||||
pti->data = ndat;
|
||||
pti->last = ndat;
|
||||
}
|
||||
}
|
||||
|
||||
void modem_probe_samp_c_int(char * tracename,COMP samp[],size_t cnt){
|
||||
probe_trace_info *pti;
|
||||
datlink *ndat;
|
||||
|
||||
pti = modem_probe_get_trace(tracename);
|
||||
if(pti == NULL)
|
||||
return;
|
||||
|
||||
pti->type = TRACE_C;
|
||||
|
||||
ndat = (datlink*) malloc(sizeof(datlink));
|
||||
ndat->data = malloc(sizeof(COMP)*cnt);
|
||||
|
||||
ndat->len = cnt*sizeof(COMP);
|
||||
ndat->next = NULL;
|
||||
memcpy(ndat->data,(void*)&(samp[0]),sizeof(COMP)*cnt);
|
||||
|
||||
if(pti->last!=NULL){
|
||||
pti->last->next = ndat;
|
||||
pti->last = ndat;
|
||||
} else {
|
||||
pti->data = ndat;
|
||||
pti->last = ndat;
|
||||
}
|
||||
}
|
||||
|
|
@ -0,0 +1,129 @@
|
|||
/*---------------------------------------------------------------------------*\
|
||||
|
||||
FILE........: modem_probe.h
|
||||
AUTHOR......: Brady O'Brien
|
||||
DATE CREATED: 9 January 2016
|
||||
|
||||
Library to easily extract debug traces from modems during development
|
||||
|
||||
\*---------------------------------------------------------------------------*/
|
||||
|
||||
/*
|
||||
Copyright (C) 2016 David Rowe
|
||||
|
||||
All rights reserved.
|
||||
|
||||
This program is free software; you can redistribute it and/or modify
|
||||
it under the terms of the GNU Lesser General Public License version 2.1, as
|
||||
published by the Free Software Foundation. This program 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 Lesser General Public License
|
||||
along with this program; if not, see <http://www.gnu.org/licenses/>.
|
||||
*/
|
||||
|
||||
#ifndef __MODEMPROBE_H
|
||||
#define __MODEMPROBE_H
|
||||
#include <stdint.h>
|
||||
#include <stdlib.h>
|
||||
#include <complex.h>
|
||||
#include "comp.h"
|
||||
|
||||
#ifdef MODEMPROBE_ENABLE
|
||||
|
||||
/* Internal functions */
|
||||
void modem_probe_init_int(char *modname, char *runname);
|
||||
void modem_probe_close_int();
|
||||
|
||||
void modem_probe_samp_i_int(char * tracename,int samp[],size_t cnt);
|
||||
void modem_probe_samp_f_int(char * tracename,float samp[],size_t cnt);
|
||||
void modem_probe_samp_c_int(char * tracename,COMP samp[],size_t cnt);
|
||||
|
||||
/*
|
||||
* Init the probe library.
|
||||
* char *modname - Name of the modem under test
|
||||
* char *runname - Name/path of the file data is dumped to
|
||||
*/
|
||||
static inline void modem_probe_init(char *modname,char *runname){
|
||||
modem_probe_init_int(modname,runname);
|
||||
}
|
||||
|
||||
/*
|
||||
* Dump traces to a file and clean up
|
||||
*/
|
||||
static inline void modem_probe_close(){
|
||||
modem_probe_close_int();
|
||||
}
|
||||
|
||||
/*
|
||||
* Save some number of int samples to a named trace
|
||||
* char *tracename - name of trace being saved to
|
||||
* int samp[] - int samples
|
||||
* size_t cnt - how many samples to save
|
||||
*/
|
||||
static inline void modem_probe_samp_i(char *tracename,int samp[],size_t cnt){
|
||||
modem_probe_samp_i_int(tracename,samp,cnt);
|
||||
}
|
||||
|
||||
/*
|
||||
* Save some number of float samples to a named trace
|
||||
* char *tracename - name of trace being saved to
|
||||
* float samp[] - int samples
|
||||
* size_t cnt - how many samples to save
|
||||
*/
|
||||
static inline void modem_probe_samp_f(char *tracename,float samp[],size_t cnt){
|
||||
modem_probe_samp_f_int(tracename,samp,cnt);
|
||||
}
|
||||
|
||||
/*
|
||||
* Save some number of complex samples to a named trace
|
||||
* char *tracename - name of trace being saved to
|
||||
* COMP samp[] - int samples
|
||||
* size_t cnt - how many samples to save
|
||||
*/
|
||||
static inline void modem_probe_samp_c(char *tracename,COMP samp[],size_t cnt){
|
||||
modem_probe_samp_c_int(tracename,samp,cnt);
|
||||
}
|
||||
|
||||
/*
|
||||
* Save some number of complex samples to a named trace
|
||||
* char *tracename - name of trace being saved to
|
||||
* float complex samp[] - int samples
|
||||
* size_t cnt - how many samples to save
|
||||
*/
|
||||
static inline void modem_probe_samp_cft(char *tracename,complex float samp[],size_t cnt){
|
||||
modem_probe_samp_c_int(tracename,(COMP*)samp,cnt);
|
||||
}
|
||||
|
||||
#else
|
||||
|
||||
static inline void modem_probe_init(char *modname,char *runname){
|
||||
return;
|
||||
}
|
||||
|
||||
static inline void modem_probe_close(){
|
||||
return;
|
||||
}
|
||||
|
||||
static inline void modem_probe_samp_i(char *name,int samp[],size_t sampcnt){
|
||||
return;
|
||||
}
|
||||
|
||||
static inline void modem_probe_samp_f(char *name,float samp[],size_t cnt){
|
||||
return;
|
||||
}
|
||||
|
||||
static inline void modem_probe_samp_c(char *name,COMP samp[],size_t cnt){
|
||||
return;
|
||||
}
|
||||
|
||||
static inline void modem_probe_samp_cft(char *name,complex float samp[],size_t cnt){
|
||||
return;
|
||||
}
|
||||
|
||||
#endif
|
||||
|
||||
#endif
|
||||
|
|
@ -0,0 +1,118 @@
|
|||
/*---------------------------------------------------------------------------*\
|
||||
|
||||
FILE........: modem_stats.c
|
||||
AUTHOR......: David Rowe
|
||||
DATE CREATED: June 2015
|
||||
|
||||
Common functions for returning demod stats from fdmdv and cohpsk modems.
|
||||
|
||||
\*---------------------------------------------------------------------------*/
|
||||
|
||||
/*
|
||||
Copyright (C) 2015 David Rowe
|
||||
|
||||
All rights reserved.
|
||||
|
||||
This program is free software; you can redistribute it and/or modify
|
||||
it under the terms of the GNU Lesser General Public License version 2.1, as
|
||||
published by the Free Software Foundation. This program 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 Lesser General Public License
|
||||
along with this program; if not, see <http://www.gnu.org/licenses/>.
|
||||
*/
|
||||
|
||||
#include <assert.h>
|
||||
#include <math.h>
|
||||
#include "modem_stats.h"
|
||||
#include "codec2_fdmdv.h"
|
||||
|
||||
void modem_stats_open(struct MODEM_STATS *f)
|
||||
{
|
||||
int i;
|
||||
|
||||
/* zero out all the stats */
|
||||
|
||||
memset(f, 0, sizeof(struct MODEM_STATS));
|
||||
|
||||
/* init the FFT */
|
||||
|
||||
for(i=0; i<2*MODEM_STATS_NSPEC; i++)
|
||||
f->fft_buf[i] = 0.0;
|
||||
f->fft_cfg = kiss_fft_alloc (2*MODEM_STATS_NSPEC, 0, NULL, NULL);
|
||||
assert(f->fft_cfg != NULL);
|
||||
|
||||
}
|
||||
|
||||
void modem_stats_close(struct MODEM_STATS *f)
|
||||
{
|
||||
KISS_FFT_FREE(f->fft_cfg);
|
||||
}
|
||||
|
||||
/*---------------------------------------------------------------------------*\
|
||||
|
||||
FUNCTION....: modem_stats_get_rx_spectrum()
|
||||
AUTHOR......: David Rowe
|
||||
DATE CREATED: 9 June 2012
|
||||
|
||||
Returns the MODEM_STATS_NSPEC point magnitude spectrum of the rx signal in
|
||||
dB. The spectral samples are scaled so that 0dB is the peak, a good
|
||||
range for plotting is 0 to -40dB.
|
||||
|
||||
Note only the real part of the complex input signal is used at
|
||||
present. A complex variable is used for input for compatability
|
||||
with the other rx signal procesing.
|
||||
|
||||
Successive calls can be used to build up a waterfall or spectrogram
|
||||
plot, by mapping the received levels to colours.
|
||||
|
||||
The time-frequency resolution of the spectrum can be adjusted by varying
|
||||
MODEM_STATS_NSPEC. Note that a 2* MODEM_STATS_NSPEC size FFT is reqd to get
|
||||
MODEM_STATS_NSPEC output points. MODEM_STATS_NSPEC must be a power of 2.
|
||||
|
||||
See octave/tget_spec.m for a demo real time spectral display using
|
||||
Octave. This demo averages the output over time to get a smoother
|
||||
display:
|
||||
|
||||
av = 0.9*av + 0.1*mag_dB
|
||||
|
||||
\*---------------------------------------------------------------------------*/
|
||||
|
||||
void modem_stats_get_rx_spectrum(struct MODEM_STATS *f, float mag_spec_dB[], COMP rx_fdm[], int nin)
|
||||
{
|
||||
int i,j;
|
||||
COMP fft_in[2*MODEM_STATS_NSPEC];
|
||||
COMP fft_out[2*MODEM_STATS_NSPEC];
|
||||
float full_scale_dB;
|
||||
|
||||
/* update buffer of input samples */
|
||||
|
||||
for(i=0; i<2*MODEM_STATS_NSPEC-nin; i++)
|
||||
f->fft_buf[i] = f->fft_buf[i+nin];
|
||||
for(j=0; j<nin; j++,i++)
|
||||
f->fft_buf[i] = rx_fdm[j].real;
|
||||
assert(i == 2*MODEM_STATS_NSPEC);
|
||||
|
||||
/* window and FFT */
|
||||
|
||||
for(i=0; i<2*MODEM_STATS_NSPEC; i++) {
|
||||
fft_in[i].real = f->fft_buf[i] * (0.5 - 0.5*cosf((float)i*2.0*M_PI/(2*MODEM_STATS_NSPEC)));
|
||||
fft_in[i].imag = 0.0;
|
||||
}
|
||||
|
||||
kiss_fft(f->fft_cfg, (kiss_fft_cpx *)fft_in, (kiss_fft_cpx *)fft_out);
|
||||
|
||||
/* FFT scales up a signal of level 1 FDMDV_NSPEC */
|
||||
|
||||
full_scale_dB = 20*log10(MODEM_STATS_NSPEC*FDMDV_SCALE);
|
||||
|
||||
/* scale and convert to dB */
|
||||
|
||||
for(i=0; i<MODEM_STATS_NSPEC; i++) {
|
||||
mag_spec_dB[i] = 10.0*log10f(fft_out[i].real*fft_out[i].real + fft_out[i].imag*fft_out[i].imag + 1E-12);
|
||||
mag_spec_dB[i] -= full_scale_dB;
|
||||
}
|
||||
}
|
||||
|
|
@ -0,0 +1,82 @@
|
|||
/*---------------------------------------------------------------------------*\
|
||||
|
||||
FILE........: modem_stats.h
|
||||
AUTHOR......: David Rowe
|
||||
DATE CREATED: June 2015
|
||||
|
||||
Common structure for returning demod stats from fdmdv and cohpsk modems.
|
||||
|
||||
\*---------------------------------------------------------------------------*/
|
||||
|
||||
/*
|
||||
Copyright (C) 2015 David Rowe
|
||||
|
||||
All rights reserved.
|
||||
|
||||
This program is free software; you can redistribute it and/or modify
|
||||
it under the terms of the GNU Lesser General Public License version 2.1, as
|
||||
published by the Free Software Foundation. This program 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 Lesser General Public License
|
||||
along with this program; if not, see <http://www.gnu.org/licenses/>.
|
||||
*/
|
||||
|
||||
#ifdef __cplusplus
|
||||
extern "C" {
|
||||
#endif
|
||||
|
||||
#ifndef __MODEM_STATS__
|
||||
#define __MODEM_STATS__
|
||||
|
||||
#include "comp.h"
|
||||
#include "kiss_fft.h"
|
||||
|
||||
#define MODEM_STATS_NC_MAX 20
|
||||
#define MODEM_STATS_NR_MAX 8
|
||||
#define MODEM_STATS_ET_MAX 8
|
||||
#define MODEM_STATS_EYE_IND_MAX 160
|
||||
#define MODEM_STATS_NSPEC 512
|
||||
#define MODEM_STATS_MAX_F_HZ 4000
|
||||
#define MODEM_STATS_MAX_F_EST 4
|
||||
|
||||
struct MODEM_STATS {
|
||||
int Nc;
|
||||
float snr_est; /* estimated SNR of rx signal in dB (3 kHz noise BW) */
|
||||
COMP rx_symbols[MODEM_STATS_NR_MAX][MODEM_STATS_NC_MAX+1];
|
||||
/* latest received symbols, for scatter plot */
|
||||
int nr; /* number of rows in rx_symbols */
|
||||
int sync; /* demod sync state */
|
||||
float foff; /* estimated freq offset in Hz */
|
||||
float rx_timing; /* estimated optimum timing offset in samples */
|
||||
float clock_offset; /* Estimated tx/rx sample clock offset in ppm */
|
||||
float sync_metric; /* number between 0 and 1 indicating quality of sync */
|
||||
|
||||
/* eye diagram traces */
|
||||
/* Eye diagram plot -- first dim is trace number, second is the trace idx */
|
||||
float rx_eye[MODEM_STATS_ET_MAX][MODEM_STATS_EYE_IND_MAX];
|
||||
int neyetr; /* How many eye traces are plotted */
|
||||
int neyesamp; /* How many samples in the eye diagram */
|
||||
|
||||
/* optional for FSK modems - est tone freqs */
|
||||
|
||||
float f_est[MODEM_STATS_MAX_F_EST];
|
||||
|
||||
/* Buf for FFT/waterfall */
|
||||
|
||||
float fft_buf[2*MODEM_STATS_NSPEC];
|
||||
kiss_fft_cfg fft_cfg;
|
||||
};
|
||||
|
||||
void modem_stats_open(struct MODEM_STATS *f);
|
||||
void modem_stats_close(struct MODEM_STATS *f);
|
||||
void modem_stats_get_rx_spectrum(struct MODEM_STATS *f, float mag_spec_dB[], COMP rx_fdm[], int nin);
|
||||
|
||||
#endif
|
||||
|
||||
#ifdef __cplusplus
|
||||
}
|
||||
#endif
|
||||
|
|
@ -0,0 +1,111 @@
|
|||
/*
|
||||
tsrc.c
|
||||
David Rowe
|
||||
Sat Nov 3 2012
|
||||
|
||||
Unit test for libresample code.
|
||||
|
||||
build: gcc tsrc.c -o tsrc -lm -lsamplerate
|
||||
|
||||
*/
|
||||
|
||||
#include <assert.h>
|
||||
#include <math.h>
|
||||
#include <string.h>
|
||||
#include <stdlib.h>
|
||||
#include <stdio.h>
|
||||
#include <samplerate.h>
|
||||
#include <unistd.h>
|
||||
|
||||
#define N 10000 /* processing buffer size */
|
||||
|
||||
void display_help(void) {
|
||||
fprintf(stderr, "\nusage: tsrc inputRawFile OutputRawFile OutSampleRatio [-l] [-c]\n");
|
||||
fprintf(stderr, "\nUse - for stdin/stdout\n\n");
|
||||
fprintf(stderr, "-l fast linear resampler\n");
|
||||
fprintf(stderr, "-c complex (two channel) resampling\n\n");
|
||||
}
|
||||
|
||||
int main(int argc, char *argv[]) {
|
||||
FILE *fin, *fout;
|
||||
short in_short[N], out_short[N];
|
||||
float in[N], out[N];
|
||||
SRC_STATE *src;
|
||||
SRC_DATA data;
|
||||
int error, nin, nremaining, i;
|
||||
|
||||
if (argc < 3) {
|
||||
display_help();
|
||||
exit(1);
|
||||
}
|
||||
|
||||
if (strcmp(argv[1], "-") == 0)
|
||||
fin = stdin;
|
||||
else
|
||||
fin = fopen(argv[1], "rb");
|
||||
assert(fin != NULL);
|
||||
|
||||
if (strcmp(argv[2], "-") == 0)
|
||||
fout = stdout;
|
||||
else
|
||||
fout = fopen(argv[2], "wb");
|
||||
assert(fout != NULL);
|
||||
|
||||
data.data_in = in;
|
||||
data.data_out = out;
|
||||
data.end_of_input = 0;
|
||||
data.src_ratio = atof(argv[3]);
|
||||
|
||||
int channels = 1;
|
||||
int resampler = SRC_SINC_FASTEST;
|
||||
int opt;
|
||||
while ((opt = getopt(argc, argv, "lc")) != -1) {
|
||||
switch (opt) {
|
||||
case 'l': resampler = SRC_LINEAR; break;
|
||||
case 'c': channels = 2; break;
|
||||
default:
|
||||
display_help();
|
||||
exit(1);
|
||||
}
|
||||
}
|
||||
|
||||
channels = 2;
|
||||
|
||||
data.input_frames = N/channels;
|
||||
data.output_frames = N/channels;
|
||||
|
||||
src = src_new(resampler, channels, &error);
|
||||
assert(src != NULL);
|
||||
|
||||
int total_in = 0;
|
||||
int total_out = 0;
|
||||
|
||||
nin = data.input_frames;
|
||||
nremaining = 0;
|
||||
while(fread(&in_short[nremaining*channels], sizeof(short)*channels, nin, fin) == nin) {
|
||||
src_short_to_float_array(in_short, in, N);
|
||||
error = src_process(src, &data);
|
||||
assert(error == 0);
|
||||
src_float_to_short_array(out, out_short, data.output_frames_gen*channels);
|
||||
|
||||
fwrite(out_short, sizeof(short), data.output_frames_gen*channels, fout);
|
||||
if (fout == stdout) fflush(stdout);
|
||||
|
||||
nremaining = data.input_frames - data.input_frames_used;
|
||||
nin = data.input_frames_used;
|
||||
//fprintf(stderr, "input frames: %d output_frames %d nremaining: %d\n",
|
||||
// (int)data.input_frames_used, (int)data.output_frames_gen, nremaining);
|
||||
for(i=0; i<nremaining*channels; i++)
|
||||
in_short[i] = in_short[i+nin*channels];
|
||||
|
||||
total_in += data.input_frames_used;
|
||||
total_out += data.output_frames_gen;
|
||||
}
|
||||
|
||||
//fprintf(stderr, "total_in: %d total_out: %d\n", total_in, total_out);
|
||||
|
||||
fclose(fout);
|
||||
fclose(fin);
|
||||
|
||||
return 0;
|
||||
}
|
||||
Ładowanie…
Reference in New Issue