1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
|
/* -*- c++ -*- */
/*
* Copyright 2004 Free Software Foundation, Inc.
*
* This file is part of GNU Radio
*
* GNU Radio 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 2, or (at your option)
* any later version.
*
* GNU Radio 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 GNU Radio; see the file COPYING. If not, write to
* the Free Software Foundation, Inc., 59 Temple Place - Suite 330,
* Boston, MA 02111-1307, USA.
*/
#ifdef HAVE_CONFIG_H
#include "config.h"
#endif
#include <@NAME@.h>
#include <gr_io_signature.h>
#include <assert.h>
#include <iostream>
static const float INF = 1.0e9;
@SPTR_NAME@
trellis_make_@BASE_NAME@ (
const fsm &FSM,
int K,
int S0,
int SK)
{
return @SPTR_NAME@ (new @NAME@ (FSM,K,S0,SK));
}
@NAME@::@NAME@ (
const fsm &FSM,
int K,
int S0,
int SK)
: gr_block ("@BASE_NAME@",
gr_make_io_signature (1, -1, sizeof (float)),
gr_make_io_signature (1, -1, sizeof (@TYPE@))),
d_FSM (FSM),
d_K (K),
d_S0 (S0),
d_SK (SK)//,
//d_trace(FSM.S()*K)
{
set_relative_rate (1.0 / ((double) d_FSM.O()));
set_output_multiple (d_K);
}
void
@NAME@::forecast (int noutput_items, gr_vector_int &ninput_items_required)
{
assert (noutput_items % d_K == 0);
int input_required = d_FSM.O() * noutput_items ;
unsigned ninputs = ninput_items_required.size();
for (unsigned int i = 0; i < ninputs; i++) {
ninput_items_required[i] = input_required;
}
}
void viterbi_algorithm(int I, int S, int O,
const std::vector<int> &NS,
const std::vector<int> &OS,
const std::vector<int> &PS,
const std::vector<int> &PI,
int K,
int S0,int SK,
const float *in, @TYPE@ *out)//,
//std::vector<int> &trace)
{
std::vector<int> trace(S*K);
std::vector<float> alpha(S*2);
int alphai;
float norm,mm,minm;
int minmi;
int st;
if(S0<0) { // initial state not specified
for(int i=0;i<S;i++) alpha[0*S+i]=0;
}
else {
for(int i=0;i<S;i++) alpha[0*S+i]=INF;
alpha[0*S+S0]=0.0;
}
alphai=0;
for(int k=0;k<K;k++) {
norm=INF;
for(int j=0;j<S;j++) { // for each next state do ACS
minm=INF;
minmi=0;
for(int i=0;i<I;i++) {
int i0 = j*I+i;
if((mm=alpha[alphai*S+PS[i0]]+in[k*O+OS[PS[i0]*I+PI[i0]]])<minm)
minm=mm,minmi=i;
}
trace[k*S+j]=minmi;
alpha[((alphai+1)%2)*S+j]=minm;
if(minm<norm) norm=minm;
}
for(int j=0;j<S;j++)
alpha[((alphai+1)%2)*S+j]-=norm; // normalize total metrics so they do not explode
alphai=(alphai+1)%2;
}
if(SK<0) { // final state not specified
minm=INF;
minmi=0;
for(int i=0;i<S;i++)
if((mm=alpha[alphai*S+i])<minm) minm=mm,minmi=i;
st=minmi;
}
else {
st=SK;
}
for(int k=K-1;k>=0;k--) { // traceback
int i0=st*I+trace[k*S+st];
out[k]= (@TYPE@) PI[i0];
st=PS[i0];
}
}
int
@NAME@::general_work (int noutput_items,
gr_vector_int &ninput_items,
gr_vector_const_void_star &input_items,
gr_vector_void_star &output_items)
{
assert (input_items.size() == output_items.size());
int nstreams = input_items.size();
assert (noutput_items % d_K == 0);
int nblocks = noutput_items / d_K;
for (int m=0;m<nstreams;m++) {
const float *in = (const float *) input_items[m];
@TYPE@ *out = (@TYPE@ *) output_items[m];
for (int n=0;n<nblocks;n++) {
viterbi_algorithm(d_FSM.I(),d_FSM.S(),d_FSM.O(),d_FSM.NS(),d_FSM.OS(),d_FSM.PS(),d_FSM.PI(),d_K,d_S0,d_SK,&(in[n*d_K*d_FSM.O()]),&(out[n*d_K]));//,d_trace);
}
}
consume_each (d_FSM.O() * noutput_items );
return noutput_items;
}
|
