morse-wip/src/trprob.cxx

89 wiersze
2.6 KiB
C++

// ----------------------------------------------------------------------------
// trprob.c -- bayesian morse code decoder
//
// Copyright (C) 2012-2014
// (C) Mauri Niininen, AG1LE
//
// This file is part of Bayesian Morse code decoder
// bmorse is free software: you can redistribute it and/or modify
// it under the terms of the GNU General Public License as published by
// the Free Software Foundation, either version 3 of the License, or
// (at your option) any later version.
//
// bmorse is distributed in the hope that it will be useful,
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
// GNU General Public License for more details.
//
// You should have received a copy of the GNU General Public License
// along with bmorse. If not, see <http://www.gnu.org/licenses/>.
// ----------------------------------------------------------------------------
#include "bmorse.h"
#include <stdio.h>
int morse::trprob_(long int ip, long int lambda, float dur, long int ilrate)
{
long int i, k, n;
float pint[30];
long int kelm;
float psum, ptrx;
long int ielem, irate;
/* THIS SUBROUTINE COMPUTES THE TRANSITION PROBABILITY */
/* FROM SAVED PATH IP TO EACH STATE N AND STORES THE */
/* RESULT IN P(IP, N). */
/* VARIABLES: */
/* IP - INPUT SAVED PATH IDENTITY */
/* LAMBDA INPUT SAVED LTR STATE IDENTITY */
/* DUR - INPUT SAVED ELEMENT DURATION */
/* ILRATE INPUT SAVED DATA RATE IDENTITY */
/* P - OUTPUT TRANSITION PROBABILITY MATRIX */
/* THE FOLLOWING FUNCTION SUBROUTINES ARE USED: */
/* XTRANS RETURNS THE KEYSTATE TRANSITION PROBABILITY */
/* CONDITIONED ON ELEMENT TYPE AND DATA RATE */
/* PTRANS RETURNS THE PATH-CONDITIONAL STATE TRANSITION PROB */
/* LOOK UP ELEMENT TYPE FOR LTR STATE LAMBDA: */
if (lambda == 0) {
for (n = 1; n <= 30; ++n) {
pin[n-1][ip] = 0.f;
}
return 0;
}
/* COMPUTE KEYSTATE TRANSITION PROBABILITY: */
ielem = ilami[ielmst[lambda - 1] - 1];
ptrx = xtrans_(&ielem, dur, ilrate);
/* FOR EACH STATE, COMPUTE STATE TRANSITION PROBABILITY: */
psum = 0.f;
for (k = 1; k <= 6; ++k) { // 6 element states 1=dit,2=dah, 3=e-spc, 4=chr-s, 5=wrd-s, 6=pause
for (i = 1; i <= 5; ++i) { // 5 speed (rate) states -2 -1 0 1 2
n = (i - 1) * 6 + k;
kelm = k;
irate = i;
ptrans_(kelm, irate, lambda, ilrate, ptrx, &psum, pint, n);
}
}
if (psum ==0.0) {
perror("\ntrprob: psum = 0");
return 0;
}
// Normalize with psum
for (n = 1; n <= 30; ++n) {
pin[n-1][ip] = pint[n - 1] / psum;
}
return 0;
} /* trprob_ */