3 * Copyright 2002 Free Software Foundation, Inc.
5 * This file is part of GNU Radio
7 * GNU Radio is free software; you can redistribute it and/or modify
8 * it under the terms of the GNU General Public License as published by
9 * the Free Software Foundation; either version 3, or (at your option)
12 * GNU Radio is distributed in the hope that it will be useful,
13 * but WITHOUT ANY WARRANTY; without even the implied warranty of
14 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 * GNU General Public License for more details.
17 * You should have received a copy of the GNU General Public License
18 * along with GNU Radio; see the file COPYING. If not, write to
19 * the Free Software Foundation, Inc., 51 Franklin Street,
20 * Boston, MA 02110-1301, USA.
47 fsm::fsm(const fsm &FSM)
54 d_PS=FSM.PS(); // is this going to make a deep copy?
60 fsm::fsm(int I, int S, int O, const std::vector<int> &NS, const std::vector<int> &OS)
72 //######################################################################
73 //# Read an FSM specification from a file.
74 //# Format (hopefully will become more flexible in the future...):
75 //# I S O (in the first line)
77 //# Next state matrix (S lines, each with I integers separated by spaces)
79 //# output symbol matrix (S lines, each with I integers separated by spaces)
81 //######################################################################
82 fsm::fsm(const char *name)
86 if((fsmfile=fopen(name,"r"))==NULL)
87 throw std::runtime_error ("fsm::fsm(const char *name): file open error\n");
88 //printf("file open error in fsm()\n");
90 fscanf(fsmfile,"%d %d %d\n",&d_I,&d_S,&d_O);
94 for(int i=0;i<d_S;i++) {
95 for(int j=0;j<d_I;j++) fscanf(fsmfile,"%d",&(d_NS[i*d_I+j]));
97 for(int i=0;i<d_S;i++) {
98 for(int j=0;j<d_I;j++) fscanf(fsmfile,"%d",&(d_OS[i*d_I+j]));
107 //######################################################################
108 //# Automatically generate the FSM from the generator matrix
109 //# of a (n,k) binary convolutional code
110 //######################################################################
111 fsm::fsm(int k, int n, const std::vector<int> &G)
114 // calculate maximum memory requirements for each input stream
115 std::vector<int> max_mem_x(k,-1);
117 for(int i=0;i<k;i++) {
118 for(int j=0;j<n;j++) {
121 mem=(int)(log(G[i*n+j])/log(2.0));
129 //printf("max_mem_x\n");
130 //for(int j=0;j<max_mem_x.size();j++) printf("%d ",max_mem_x[j]); printf("\n");
132 // calculate total memory requirements to set S
135 sum_max_mem += max_mem_x[i];
137 //printf("sum_max_mem = %d\n",sum_max_mem);
143 // binary representation of the G matrix
144 std::vector<std::vector<int> > Gb(k*n);
145 for(int j=0;j<k*n;j++) {
146 Gb[j].resize(max_mem+1);
147 dec2base(G[j],2,Gb[j]);
149 //for(int m=0;m<Gb[j].size();m++) printf("%d ",Gb[j][m]); printf("\n");
152 // alphabet size of each shift register
153 std::vector<int> bases_x(k);
154 for(int j=0;j<k ;j++)
155 bases_x[j] = 1 << max_mem_x[j];
156 //printf("bases_x\n");
157 //for(int j=0;j<max_mem_x.size();j++) printf("%d ",max_mem_x[j]); printf("\n");
159 d_NS.resize(d_I*d_S);
160 d_OS.resize(d_I*d_S);
162 std::vector<int> sx(k);
163 std::vector<int> nsx(k);
164 std::vector<int> tx(k);
165 std::vector<std::vector<int> > tb(k);
167 tb[j].resize(max_mem+1);
168 std::vector<int> inb(k);
169 std::vector<int> outb(n);
172 for(int s=0;s<d_S;s++) {
173 dec2bases(s,bases_x,sx); // split s into k values, each representing one of the k shift registers
174 //printf("state = %d \nstates = ",s);
175 //for(int j=0;j<sx.size();j++) printf("%d ",sx[j]); printf("\n");
176 for(int i=0;i<d_I;i++) {
177 dec2base(i,2,inb); // input in binary
178 //printf("input = %d \ninputs = ",i);
179 //for(int j=0;j<inb.size();j++) printf("%d ",inb[j]); printf("\n");
181 // evaluate next state
183 nsx[j] = (inb[j]*bases_x[j]+sx[j])/2; // next state (for each shift register) MSB first
184 d_NS[s*d_I+i]=bases2dec(nsx,bases_x); // collect all values into the new state
186 // evaluate transitions
188 tx[j] = inb[j]*bases_x[j]+sx[j]; // transition (for each shift register)MSB first
189 for(int j=0;j<k;j++) {
190 dec2base(tx[j],2,tb[j]); // transition in binary
191 //printf("transition = %d \ntransitions = ",tx[j]);
192 //for(int m=0;m<tb[j].size();m++) printf("%d ",tb[j][m]); printf("\n");
196 for(int nn=0;nn<n;nn++) {
198 for(int j=0;j<k;j++) {
199 for(int m=0;m<max_mem+1;m++)
200 outb[nn] = (outb[nn] + Gb[j*n+nn][m]*tb[j][m]) % 2; // careful: polynomial 1+D ir represented as 110, not as 011
201 //printf("output %d equals %d\n",nn,outb[nn]);
204 d_OS[s*d_I+i] = base2dec(outb,2);
215 //######################################################################
216 //# Automatically generate an FSM specification describing the
217 //# ISI for a channel
218 //# of length ch_length and a modulation of size mod_size
219 //######################################################################
220 fsm::fsm(int mod_size, int ch_length)
223 d_S=(int) (pow(1.0*d_I,1.0*ch_length-1)+0.5);
226 d_NS.resize(d_I*d_S);
227 d_OS.resize(d_I*d_S);
229 for(int s=0;s<d_S;s++) {
230 for(int i=0;i<d_I;i++) {
232 d_NS[s*d_I+i] = t/d_I;
244 //######################################################################
245 //# Automatically generate an FSM specification describing the
246 //# the trellis for a CPM with h=K/P (relatively prime),
247 //# alphabet size M, and frequency pulse duration L symbols
249 //# This FSM is based on the paper by B. Rimoldi
250 //# "A decomposition approach to CPM", IEEE Trans. Info Theory, March 1988
251 //# See also my own notes at http://www.eecs.umich.edu/~anastas/docs/cpm.pdf
252 //######################################################################
253 fsm::fsm(int P, int M, int L)
256 d_S=(int)(pow(1.0*M,1.0*L-1)+0.5)*P;
257 d_O=(int)(pow(1.0*M,1.0*L)+0.5)*P;
259 d_NS.resize(d_I*d_S);
260 d_OS.resize(d_I*d_S);
262 for(int s=0;s<d_S;s++) {
263 for(int i=0;i<d_I;i++) {
266 int ns1= (i*(int)(pow(1.0*M,1.0*(L-1))+0.5)+s1)/M;
271 d_NS[s*d_I+i] = ns1*P+nv;
272 d_OS[s*d_I+i] = i*d_S+s;
289 //######################################################################
290 //# Automatically generate an FSM specification describing the
291 //# the joint trellis of fsm1 and fsm2
292 //######################################################################
293 fsm::fsm(const fsm &FSM1, const fsm &FSM2)
295 d_I=FSM1.I()*FSM2.I();
296 d_S=FSM1.S()*FSM2.S();
297 d_O=FSM1.O()*FSM2.O();
299 d_NS.resize(d_I*d_S);
300 d_OS.resize(d_I*d_S);
302 for(int s=0;s<d_S;s++) {
303 for(int i=0;i<d_I;i++) {
308 d_NS[s*d_I+i] = FSM1.NS()[s1 * FSM1.I() + i1] * FSM2.S() + FSM2.NS()[s2 * FSM2.I() + i2];
309 d_OS[s*d_I+i] = FSM1.OS()[s1 * FSM1.I() + i1] * FSM2.O() + FSM2.OS()[s2 * FSM2.I() + i2];
320 //######################################################################
321 //# Generate a new FSM representing n stages through the original FSM
323 //######################################################################
324 fsm::fsm(const fsm &FSM, int n)
326 d_I=(int) (pow(1.0*FSM.I(),1.0*n)+0.5);
328 d_O=(int) (pow(1.0*FSM.O(),1.0*n)+0.5);
330 d_NS.resize(d_I*d_S);
331 d_OS.resize(d_I*d_S);
333 for(int s=0;s<d_S;s++ ) {
334 for(int i=0;i<d_I;i++ ) {
335 std::vector<int> ii(n);
336 dec2base(i,FSM.I(),ii);
337 std::vector<int> oo(n);
339 for(int k=0;k<n;k++) {
340 oo[k]=FSM.OS()[ns*FSM.I()+ii[k]];
341 ns=FSM.NS()[ns*FSM.I()+ii[k]];
344 d_OS[s*d_I+i]=base2dec(oo,FSM.O());
360 //######################################################################
361 //# generate the PS and PI tables for later use
362 //######################################################################
363 void fsm::generate_PS_PI()
368 for(int i=0;i<d_S;i++) {
369 d_PS[i].resize(d_I*d_S); // max possible size
370 d_PI[i].resize(d_I*d_S);
372 for(int ii=0;ii<d_S;ii++) for(int jj=0;jj<d_I;jj++) {
373 if(d_NS[ii*d_I+jj]!=i) continue;
384 //######################################################################
385 //# generate the termination matrices TMl and TMi for later use
386 //######################################################################
387 void fsm::generate_TM()
389 d_TMi.resize(d_S*d_S);
390 d_TMl.resize(d_S*d_S);
392 for(int i=0;i<d_S*d_S;i++) {
393 d_TMi[i] = -1; // no meaning
394 d_TMl[i] = d_S; //infinity: you need at most S-1 steps
399 for(int s=0;s<d_S;s++) {
402 while (done == false && attempts < d_S-1) {
407 //throw std::runtime_error ("fsm::generate_TM(): FSM appears to be disconnected\n");
408 printf("fsm::generate_TM(): FSM appears to be disconnected\n");
409 printf("state %d cannot be reached from all other states\n",s);
415 // find a path from any state to the ending state "es"
416 bool fsm::find_es(int es)
419 for(int s=0;s<d_S;s++) {
420 if(d_TMl[s*d_S+es] < d_S)
424 for(int i=0;i<d_I;i++) {
425 if( 1 + d_TMl[d_NS[s*d_I+i]*d_S+es] < minl) {
426 minl = 1 + d_TMl[d_NS[s*d_I+i]*d_S+es];
431 d_TMl[s*d_S+es]=minl;
432 d_TMi[s*d_S+es]=mini;
444 //######################################################################
445 //# generate trellis representation of FSM as an SVG file
446 //######################################################################
447 void fsm::write_trellis_svg( std::string filename ,int number_stages)
449 std::ofstream trellis_fname (filename.c_str());
450 if (!trellis_fname) {std::cout << "file not found " << std::endl ; exit(-1);}
451 const int TRELLIS_Y_OFFSET = 30;
452 const int TRELLIS_X_OFFSET = 20;
453 const int STAGE_LABEL_Y_OFFSET = 25;
454 const int STAGE_LABEL_X_OFFSET = 20;
455 const int STATE_LABEL_Y_OFFSET = 30;
456 const int STATE_LABEL_X_OFFSET = 5;
457 const int STAGE_STATE_OFFSETS = 10;
458 // std::cout << "################## BEGIN SVG TRELLIS PIC #####################" << std::endl;
459 trellis_fname << "<svg viewBox = \"0 0 200 200\" version = \"1.1\">" << std::endl;
461 for( int stage_num = 0;stage_num < number_stages;stage_num ++){
463 for ( int state_num = 0;state_num < d_S ; state_num ++ ) {
464 trellis_fname << "<circle cx = \"" << stage_num * STAGE_STATE_OFFSETS + TRELLIS_X_OFFSET <<
465 "\" cy = \"" << state_num * STAGE_STATE_OFFSETS + TRELLIS_Y_OFFSET << "\" r = \"1\"/>" << std::endl;
467 if(stage_num != number_stages-1){
468 for( int branch_num = 0;branch_num < d_I; branch_num++){
469 trellis_fname << "<line x1 =\"" << STAGE_STATE_OFFSETS * stage_num+ TRELLIS_X_OFFSET << "\" ";
470 trellis_fname << "y1 =\"" << state_num * STAGE_STATE_OFFSETS + TRELLIS_Y_OFFSET<< "\" ";
471 trellis_fname << "x2 =\"" << STAGE_STATE_OFFSETS *stage_num + STAGE_STATE_OFFSETS+ TRELLIS_X_OFFSET << "\" ";
472 trellis_fname << "y2 =\"" << d_NS[d_I * state_num + branch_num] * STAGE_STATE_OFFSETS + TRELLIS_Y_OFFSET << "\" ";
473 trellis_fname << " stroke-dasharray = \"3," << branch_num << "\" ";
474 trellis_fname << " stroke = \"black\" stroke-width = \"0.3\"/>" << std::endl;
480 trellis_fname << "<g font-size = \"4\" font= \"times\" fill = \"black\">" << std::endl;
481 for( int stage_num = 0;stage_num < number_stages ;stage_num ++){
482 trellis_fname << "<text x = \"" << stage_num * STAGE_STATE_OFFSETS + STAGE_LABEL_X_OFFSET <<
483 "\" y = \"" << STAGE_LABEL_Y_OFFSET << "\" >" << std::endl;
484 trellis_fname << stage_num << std::endl;
485 trellis_fname << "</text>" << std::endl;
487 trellis_fname << "</g>" << std::endl;
490 trellis_fname << "<g font-size = \"4\" font= \"times\" fill = \"black\">" << std::endl;
491 for( int state_num = 0;state_num < d_S ; state_num ++){
492 trellis_fname << "<text y = \"" << state_num * STAGE_STATE_OFFSETS + STATE_LABEL_Y_OFFSET <<
493 "\" x = \"" << STATE_LABEL_X_OFFSET << "\" >" << std::endl;
494 trellis_fname << state_num << std::endl;
495 trellis_fname << "</text>" << std::endl;
497 trellis_fname << "</g>" << std::endl;
500 trellis_fname << "</svg>" << std::endl;
501 // std::cout << "################## END SVG TRELLIS PIC ##################### " << std::endl;
502 trellis_fname.close();
510 //######################################################################
511 //# Write trellis specification to a text file,
512 //# in the same format used when reading FSM files
513 //######################################################################
514 void fsm::write_fsm_txt(std::string filename)
516 std::ofstream trellis_fname (filename.c_str());
517 if (!trellis_fname) {std::cout << "file not found " << std::endl ; exit(-1);}
518 trellis_fname << d_I << ' ' << d_S << ' ' << d_O << std::endl;
519 trellis_fname << std::endl;
520 for(int i=0;i<d_S;i++) {
521 for(int j=0;j<d_I;j++) trellis_fname << d_NS[i*d_I+j] << ' ';
522 trellis_fname << std::endl;
524 trellis_fname << std::endl;
525 for(int i=0;i<d_S;i++) {
526 for(int j=0;j<d_I;j++) trellis_fname << d_OS[i*d_I+j] << ' ';
527 trellis_fname << std::endl;
529 trellis_fname << std::endl;
530 trellis_fname.close();