|
| 1 | +/* K=7 r=1/2 Viterbi decoder in portable C |
| 2 | + * Copyright Feb 2004, Phil Karn, KA9Q |
| 3 | + * May be used under the terms of the GNU Lesser General Public License (LGPL) |
| 4 | + */ |
| 5 | + |
| 6 | +#include <stdlib.h> |
| 7 | +#include "fec.h" |
| 8 | + |
| 9 | +static union branchtab27 Branchtab27[2] __attribute__ ((aligned(16))); |
| 10 | + |
| 11 | +void set_viterbi27_polynomial(int polys[2]) |
| 12 | +{ |
| 13 | + int state; |
| 14 | + |
| 15 | + for(state = 0; state < 32; state++) { |
| 16 | + Branchtab27[0].c[state] = (polys[0] < 0) ^ parity((2*state) & abs(polys[0])) ? 255 : 0; |
| 17 | + Branchtab27[1].c[state] = (polys[1] < 0) ^ parity((2*state) & abs(polys[1])) ? 255 : 0; |
| 18 | + } |
| 19 | +} |
| 20 | + |
| 21 | +/* Create a new instance of a Viterbi decoder */ |
| 22 | +void init_viterbi27(struct v27 *vp, int starting_state) |
| 23 | +{ |
| 24 | + int i; |
| 25 | + int polys[2] = { V27POLYA, V27POLYB }; |
| 26 | + |
| 27 | + set_viterbi27_polynomial(polys); |
| 28 | + |
| 29 | + for(i = 0; i < 64; i++) |
| 30 | + vp->metrics1.w[i] = 63; |
| 31 | + |
| 32 | + vp->old_metrics = &vp->metrics1; |
| 33 | + vp->new_metrics = &vp->metrics2; |
| 34 | + vp->dp = vp->decisions; |
| 35 | + vp->old_metrics->w[starting_state & 63] = 0; /* Bias known start state */ |
| 36 | +} |
| 37 | + |
| 38 | +/* Viterbi chainback */ |
| 39 | +int chainback_viterbi27( |
| 40 | + struct v27 *vp, |
| 41 | + unsigned char *data, /* Decoded output data */ |
| 42 | + unsigned int nbits, /* Number of data bits */ |
| 43 | + unsigned int endstate) /* Terminal encoder state */ |
| 44 | +{ |
| 45 | + decision_t *d; |
| 46 | + |
| 47 | + if(vp == NULL) |
| 48 | + return -1; |
| 49 | + |
| 50 | + d = vp->decisions; |
| 51 | + /* Make room beyond the end of the encoder register so we can |
| 52 | + * accumulate a full byte of decoded data |
| 53 | + */ |
| 54 | + endstate %= 64; |
| 55 | + endstate <<= 2; |
| 56 | + |
| 57 | + /* The store into data[] only needs to be done every 8 bits. |
| 58 | + * But this avoids a conditional branch, and the writes will |
| 59 | + * combine in the cache anyway |
| 60 | + */ |
| 61 | + d += 6; /* Look past tail */ |
| 62 | + while(nbits-- != 0) { |
| 63 | + int k; |
| 64 | + |
| 65 | + k = (d[nbits].w[(endstate>>2)/32] >> ((endstate>>2)%32)) & 1; |
| 66 | + data[nbits>>3] = endstate = (endstate >> 1) | (k << 7); |
| 67 | + } |
| 68 | + |
| 69 | + return 0; |
| 70 | +} |
| 71 | + |
| 72 | +/* C-language butterfly */ |
| 73 | +#define BFLY(i) {\ |
| 74 | +unsigned int metric,m0,m1,decision;\ |
| 75 | + metric = (Branchtab27[0].c[i] ^ sym0) + (Branchtab27[1].c[i] ^ sym1);\ |
| 76 | + m0 = vp->old_metrics->w[i] + metric;\ |
| 77 | + m1 = vp->old_metrics->w[i+32] + (510 - metric);\ |
| 78 | + decision = (signed int)(m0-m1) > 0;\ |
| 79 | + vp->new_metrics->w[2*i] = decision ? m1 : m0;\ |
| 80 | + d->w[i/16] |= decision << ((2*i)&31);\ |
| 81 | + m0 -= (metric+metric-510);\ |
| 82 | + m1 += (metric+metric-510);\ |
| 83 | + decision = (signed int)(m0-m1) > 0;\ |
| 84 | + vp->new_metrics->w[2*i+1] = decision ? m1 : m0;\ |
| 85 | + d->w[i/16] |= decision << ((2*i+1)&31);\ |
| 86 | +} |
| 87 | + |
| 88 | +/* Update decoder with a block of demodulated symbols |
| 89 | + * Note that nbits is the number of decoded data bits, not the number |
| 90 | + * of symbols! |
| 91 | + */ |
| 92 | +int update_viterbi27_blk(struct v27 *vp, const unsigned char *syms, int nbits) |
| 93 | +{ |
| 94 | + void *tmp; |
| 95 | + decision_t *d; |
| 96 | + |
| 97 | + if(vp == NULL) |
| 98 | + return -1; |
| 99 | + |
| 100 | + d = (decision_t *)vp->dp; |
| 101 | + |
| 102 | + while(nbits--) { |
| 103 | + unsigned char sym0,sym1; |
| 104 | + |
| 105 | + d->w[0] = d->w[1] = 0; |
| 106 | + sym0 = *syms++; |
| 107 | + sym1 = *syms++; |
| 108 | + |
| 109 | + BFLY(0); |
| 110 | + BFLY(1); |
| 111 | + BFLY(2); |
| 112 | + BFLY(3); |
| 113 | + BFLY(4); |
| 114 | + BFLY(5); |
| 115 | + BFLY(6); |
| 116 | + BFLY(7); |
| 117 | + BFLY(8); |
| 118 | + BFLY(9); |
| 119 | + BFLY(10); |
| 120 | + BFLY(11); |
| 121 | + BFLY(12); |
| 122 | + BFLY(13); |
| 123 | + BFLY(14); |
| 124 | + BFLY(15); |
| 125 | + BFLY(16); |
| 126 | + BFLY(17); |
| 127 | + BFLY(18); |
| 128 | + BFLY(19); |
| 129 | + BFLY(20); |
| 130 | + BFLY(21); |
| 131 | + BFLY(22); |
| 132 | + BFLY(23); |
| 133 | + BFLY(24); |
| 134 | + BFLY(25); |
| 135 | + BFLY(26); |
| 136 | + BFLY(27); |
| 137 | + BFLY(28); |
| 138 | + BFLY(29); |
| 139 | + BFLY(30); |
| 140 | + BFLY(31); |
| 141 | + d++; |
| 142 | + |
| 143 | + /* Swap pointers to old and new metrics */ |
| 144 | + tmp = vp->old_metrics; |
| 145 | + vp->old_metrics = vp->new_metrics; |
| 146 | + vp->new_metrics = tmp; |
| 147 | + } |
| 148 | + |
| 149 | + vp->dp = d; |
| 150 | + return 0; |
| 151 | +} |
| 152 | + |
| 153 | + |
| 154 | +void set_decisions_viterbi27(struct v27 *vp, decision_t *dec) |
| 155 | +{ |
| 156 | + vp->decisions = dec; |
| 157 | +} |
0 commit comments