Enumerations | |
enum | simth::ConversionFlag { simth::CUT, simth::FILL, simth::FIT } |
Functions | |
unsigned | simth::bits2value (BitSeq::const_iterator first, BitSeq::const_iterator behindLast) |
bool | simth::value2bit (unsigned index, size_t bitPos) |
void | simth::value2bits (unsigned index, BitSeq::iterator first, BitSeq::iterator behindLast) |
double | simth::llrValue2llvValue (LlrType llrValue, bool bitValue) |
bool | simth::llrValue2bit (LlrType llrValue) |
LlvType | simth::bit2llvValue (bool bit, bool index) |
LlrType | simth::bit2llrValue (bool bit) |
void | simth::bitSeq2llvSeq (const BitSeq &bits, LlvSeq &llv) |
void | simth::bitSeq2llvSeq (const BitSeq &bits, LlvSeq *llv) |
void | simth::llrSeq2bitLlvSeq (const LlrSeq &llr, LlvSeq &llv) |
void | simth::llrSeq2bitLlvSeq (const LlrSeq &llr, LlvSeq *llv) |
void | simth::llrSeq2bitSeq (const LlrSeq &from, BitSeq &bits) |
void | simth::llrSeq2bitSeq (const LlrSeq &from, BitSeq *bits) |
void | simth::llvSeq2bitLlvSeq (const LlvSeq &from, LlvSeq &bitLlv) |
void | simth::llvSeq2bitLlvSeq (const LlvSeq &from, LlvSeq *bitLlv) |
void | simth::llvSeq2llrSeq (const LlvSeq &from, LlrSeq &to, size_t outputLength=0) |
void | simth::llvSeq2llrSeq (const LlvSeq &from, LlrSeq *to, size_t outputLength=0) |
void | simth::bitLlvSeq2llvSeq (const LlvSeq &from, LlvSeq &to, unsigned bitsPerState=0) |
void | simth::bitLlvSeq2llvSeq (const LlvSeq &from, LlvSeq *to, unsigned bitsPerState=0) |
void | simth::bitSeq2IntSeq (const simth::BitSeq &bs, simth::checkedVector< int > &IntSeq, int numBits) |
size_t | simth::getSymSeqLength (size_t bitSeqLen, unsigned bitsPerSym, ConversionFlag flag=FIT) |
E.g: a LlrSeq can be converted to a LlvSeq with llrSeq2llvSeq().
|
|
|
Converts a certain number of bits to its integer value, i.e. 101 to 5. |
|
Returns the bit at the position bitPos from the bit representation of the given value. |
|
Returns the x leftmost bits of the binary representation of the decimal value passed by index, where x=behindLast-first. |
|
Converts an LLR to an LLV for the specified bit, i.e. the return value corresponds to the log propability that the given bitValue is 'correct' depending on the given LLR value. The following equation between LLR and LLV holds: LLR = LLV[0] - LLV[1], where LLV[0] is the LLV for the bit value 0 and LLV[1] is the LLV for the bit value 1. |
|
Converts an LLR value to the 'hard' estimated bit decision. A negative LLR value belongs to the bit 1, a positve LLR value belongs to 0. |
|
Converts a bit value to the (bit)LLV value. If bit==index, 1.0 is returned, else -1.0. |
|
Converts a bit to an LLR. The bit 1 is converted to -2.0, the bit 0 is converted to 2.0. Thus LLV[0]-LLV[1] = LLR as described in the documentation of llrValue2llvValue() holds. |
|
Convert a BitSeq into a LlvSeq. |
|
Convert a BitSeq into a LlvSeq. |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Convert a BitSeq into an integer sequence
|
|
|