A branching process analysis of the stack algorithm for variable channel conditions
Marie‐José Montpetit, David Haccoun, Gilles Deslauriers · IEEE Transactions on Information Theory · 1992
A branching process analysis in a random environment is presented for bounding the average number of computations of sequential decoding over a finite state channel. Closed-form expressions applicable to specific cases are derived and evaluated. These unique bounds substantially reduce the need for lengthy simulations.>