| AbstractShiftRegisterBinary(int inbitsPerStep, const simth::checkedVector< int > &octalPolynomials, int recursivePolynomial=0) | simthlib::AbstractShiftRegisterBinary | |
| bitsPerSymbol() const | simthlib::ShiftRegister | [inline, protected] |
| computeMemoryLength(const simth::checkedVector< int > &polynomials, int recursivePolynomial=0) | simthlib::ShiftRegister | [static] |
| computeMemoryLength(int polynomial) | simthlib::ShiftRegister | [static] |
| computeNumOutputBits(int numPolynomials, int symbolsPerStep, int bitsPerSymbol, bool systematic) | simthlib::ShiftRegister | [static] |
| getBestPolynomials(int mem, int inbits, int outbits, simth::checkedVector< int > *genPolynomials) | simthlib::ShiftRegister | [static] |
| getNextState(int inputPattern, int oldState) const | simthlib::AbstractShiftRegisterBinary | [virtual] |
| getOutput(int input, int state) const | simthlib::AbstractShiftRegisterBinary | [virtual] |
| getRecursive(int newState) const | simthlib::AbstractShiftRegisterBinary | [virtual] |
| M() const | simthlib::ShiftRegister | [inline, protected] |
| memoryLength() const | simthlib::ShiftRegister | [inline] |
| polynomials | simthlib::ShiftRegister | [protected] |
| print(std::ostream &os) const | simthlib::ShiftRegister | [virtual] |
| recursivePolynomial | simthlib::ShiftRegister | [protected] |
| ShiftRegister(int symbolsPerStep, int bitsPerSymbol, const simth::checkedVector< int > &octalPolynomials, int recursivePolynomial=0) | simthlib::ShiftRegister | |
| symbolsPerStep() const | simthlib::ShiftRegister | [inline, protected] |
| tailsteps() const | simthlib::AbstractShiftRegisterBinary | [virtual] |
| ~AbstractShiftRegisterBinary()=0 | simthlib::AbstractShiftRegisterBinary | [inline, pure virtual] |
| ~ShiftRegister()=0 | simthlib::ShiftRegister | [inline, pure virtual] |
