GNU Radio's GSM Package
|
#include <AmrCoder.h>
Classes | |
struct | candStruct |
Derived values. | |
typedef struct ViterbiTCH_AFS12_2::candStruct | vCand |
void | vitClear (vCand &v) |
Survivors and candidates. | |
unsigned | iRate () const |
uint32_t | cMask () const |
uint32_t | stateTable (unsigned g, unsigned i) const |
unsigned | deferral () const |
ViterbiTCH_AFS12_2 () | |
void | initializeStates () |
const vCand & | step (uint32_t inSample, const float *probs, const float *iprobs) |
Additional Inherited Members | |
![]() | |
virtual int | getBEC () |
unsigned | applyPoly (uint64_t val, uint64_t poly) |
unsigned | applyPoly (uint64_t val, uint64_t poly, unsigned order) |
Class to represent recursive systematic convolutional coders/decoders of rate 1/2, memory length 4.
typedef struct ViterbiTCH_AFS12_2::candStruct ViterbiTCH_AFS12_2::vCand |
A candidate sequence in a Viterbi decoder. The 32-bit state register can support a deferral of 6 with a 4th-order coder.
ViterbiTCH_AFS12_2::ViterbiTCH_AFS12_2 | ( | ) |
|
inline |
|
inline |
void ViterbiTCH_AFS12_2::initializeStates | ( | ) |
Set all cost metrics to zero.
|
inline |
|
inline |
const vCand& ViterbiTCH_AFS12_2::step | ( | uint32_t | inSample, |
const float * | probs, | ||
const float * | iprobs | ||
) |
Full cycle of the Viterbi algorithm: branch, metrics, prune, select.
|
inline |
Clear a structure.
References ViterbiTCH_AFS12_2::candStruct::cost, ViterbiTCH_AFS12_2::candStruct::iState, ViterbiTCH_AFS12_2::candStruct::oState, and ViterbiTCH_AFS12_2::candStruct::rState.