Abstract
An analytical procedure is presented for generating the computational distribution for the Zigangirov-Jelinek stack algorithm. Multitype branching processes are employed to develop a procedure for estimating sequential decoding computation, without the need for simulation, but with sufficient accuracy to be a valid design tool. At information rates about the cutoff rateR_{o}the calculated computational performance is virtually Identical to that obtained by time consuming simulations.
| Original language | English |
|---|---|
| Pages (from-to) | 323-331 |
| Journal | IEEE Transactions on Information Theory |
| Volume | 25 |
| Issue number | 3 |
| Publication status | Published - 1979 |
Subject classification (UKÄ)
- Electrical Engineering, Electronic Engineering, Information Engineering