simthlib::AdachiTrellis Class Reference

Trellis of a differential modulation scheme. More...

#include <trellis.h>

Inheritance diagram for simthlib::AdachiTrellis:

[legend]List of all members.

Public Member Functions
	AdachiTrellis (const DiffDemodulator &demod)
	~AdachiTrellis ()
	destructor
Protected Member Functions
virtual int	getNextState (int state, int input, size_t step, size_t path_length) const
virtual int	getNextOut (int state, int input, size_t step, size_t path_length) const
virtual int	getPrevState (int state, int index, size_t step, size_t path_length) const
virtual int	getPrevOut (int state, int index, size_t step, size_t path_length) const
virtual int	getPrevIn (int state, int index, size_t step, size_t path_length) const
virtual const Trellis::TrellisStatesArray &	getPrevTrellisArray (size_t time_step, size_t path_length) const
virtual bool	isPossibleStartingState (int state) const
virtual int	terminationInput (int state) const

---

Detailed Description

Trellis of a differential modulation scheme.

---

Constructor & Destructor Documentation

simthlib::AdachiTrellis::AdachiTrellis (  const DiffDemodulator &  demod  )

Class constructor.

simthlib::AdachiTrellis::~AdachiTrellis (   )  [inline]

destructor

---

Member Function Documentation

int simthlib::AdachiTrellis::getNextOut (  int  state, int  input, size_t  step, size_t  path_length )  const [inline, protected, virtual]

Does the same as getNextState Implements simthlib::Trellis.

int simthlib::AdachiTrellis::getNextState (  int  state, int  input, size_t  step, size_t  path_length )  const [inline, protected, virtual]

Returns the next modulation state according to a given previous state and input. The parameter step is required because of the corresponding virtual function in Trellis. However, the result is independent of step here. Implements simthlib::Trellis.

int simthlib::AdachiTrellis::getPrevIn (  int  state, int  index, size_t  step, size_t  path_length )  const [inline, protected, virtual]

Returns the previous modulator input according to a given current modulation state and number of the trellis branch leading to this state in the previous step. Implements simthlib::Trellis.

int simthlib::AdachiTrellis::getPrevOut (  int  state, int  index, size_t  step, size_t  path_length )  const [inline, protected, virtual]

Does the same as getPrevState Implements simthlib::Trellis.

int simthlib::AdachiTrellis::getPrevState (  int  state, int  index, size_t  step, size_t  path_length )  const [inline, protected, virtual]

Returns the previous modulation state according to a given current state and number of the trellis branch leading to this state in the previous modulation step. Implements simthlib::Trellis.

const Trellis::TrellisStatesArray & simthlib::AdachiTrellis::getPrevTrellisArray (  size_t  time_step, size_t  path_length )  const [inline, protected, virtual]

Returns the argument to getPrevArray_state() according to the given time step and path length. Implements simthlib::Trellis.

virtual bool simthlib::AdachiTrellis::isPossibleStartingState (  int  state  )  const [protected, virtual]

Implements simthlib::Trellis.

virtual int simthlib::AdachiTrellis::terminationInput (  int  state  )  const [protected, virtual]

Returns in order to a definite state of the trellis the termination input. If the recursive polynom is zero, the termination input is zero independent from the state of the trellis. Since the number of tailsteps of an AdachiTrellis equals zero, this function will never be called. Due to that, the funcion throws an error if called. Implements simthlib::Trellis.

---