On the error probability of general trellis codes with applications to sequential decoding

Forskningsoutput: TidskriftsbidragArtikel i vetenskaplig tidskriftPeer review

94 Nedladdningar (Pure)

Sammanfattning

An upper bound on the average error probability for maximum-likelihood decoding of the ensemble of randomL-branch binary trellis codes of rateR = 1/nis given which separates the effects of the tail lengthTand the memory lengthMof the code. It is shown that the bound is independent of the lengthLof the information Sequence whenM geq T + [nE_{VU}(R)]^{-1} log_{2} L. The implication that the actual error probability behaves similarly is investigated by computer simulations of sequential decoding utilizing the stack algorithm. These simulations confirm the implication which can thus be taken as a design rule for choosingMso that the error probability is reduced to its minimum value for a givenT.
Originalspråkengelska
Sidor (från-till)609-611
TidskriftIEEE Transactions on Information Theory
Volym23
Nummer5
StatusPublished - 1977

Ämnesklassifikation (UKÄ)

  • Elektroteknik och elektronik

Fingeravtryck

Utforska forskningsämnen för ”On the error probability of general trellis codes with applications to sequential decoding”. Tillsammans bildar de ett unikt fingeravtryck.

Citera det här