Main Page | Namespace List | Class Hierarchy | Alphabetical List | Class List | Directories | File List | Namespace Members | Class Members | File Members

simthlib::ConvCodeTrellisShiftRegister Class Reference

#include <trellis.h>

Inheritance diagram for simthlib::ConvCodeTrellisShiftRegister:

Inheritance graph
[legend]
List of all members.

Public Member Functions

 ConvCodeTrellisShiftRegister (int symbolsPerStep, const simth::checkedVector< int > &polynomials, int recursivePolynomial, bool systematic)
 ConvCodeTrellisShiftRegister (int symbolsPerStep, int bitsPerSymbol, StartingMode startingMode, map_type mappMode, const simth::checkedVector< int > &polynomials, int recursivePolynomial, bool systematic=false)
virtual ~ConvCodeTrellisShiftRegister ()
 Destructor.
int symbolsPerStep () const
int bitsPerSymbol () const
virtual void print (std::ostream &os) const

Protected Member Functions

virtual bool isPossibleStartingState (int state) const

Detailed Description

This class represents a convolutional code that is implemented by using a shift register. See class ShiftRegister for further information.


Constructor & Destructor Documentation

simthlib::ConvCodeTrellisShiftRegister::ConvCodeTrellisShiftRegister int  symbolsPerStep,
const simth::checkedVector< int > &  polynomials,
int  recursivePolynomial,
bool  systematic
 

Constructor with fixed mapping mode (NATURAL) and fixed starting mode (ZERO).

simthlib::ConvCodeTrellisShiftRegister::ConvCodeTrellisShiftRegister int  symbolsPerStep,
int  bitsPerSymbol,
StartingMode  startingMode,
map_type  mappMode,
const simth::checkedVector< int > &  polynomials,
int  recursivePolynomial,
bool  systematic = false
 

Constructor that allows to set each parameter explicitly.

The second argument specifies the bits per input symbol. For a conventional binary code this argument equals one. In this case the input symbols are actually input bits. Hence in this case the first parameter sets the number of input bits.

Parameters:
symbolsPerStep The number of input symbols per step (or bits, see above)
bitsPerSymbol The number of bits per input symbol
startingMode For conventional codes the starting mode should be set to 'ZERO'.
mappMode For conventional codes the mapping mode should be set to 'NATURAL'
polynomials The sequence of forward polynomials specifying the code
recursivePolynomial The recursive polynomial (equals 0 for non recursive codes)
systematic If true a systematic part is considered

virtual simthlib::ConvCodeTrellisShiftRegister::~ConvCodeTrellisShiftRegister  )  [virtual]
 

Destructor.


Member Function Documentation

int simthlib::ConvCodeTrellisShiftRegister::bitsPerSymbol  )  const [inline]
 

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

Returns true if the given state is a possible starting state. The result depends on the starting mode set by the constructor argument.

Implements simthlib::ConvCodeTrellis.

virtual void simthlib::ConvCodeTrellisShiftRegister::print std::ostream &  os  )  const [virtual]
 

Reimplemented from simthlib::Trellis.

int simthlib::ConvCodeTrellisShiftRegister::symbolsPerStep  )  const [inline]
 


Generated on Tue Aug 9 14:39:45 2005 for simtheticlib by  doxygen 1.4.1