No abstract

In this paper, we present eflcient bidirectional sequential decoding (BSD) techniques. With BSD, the code tree is searched from the root and end states of the encoded tree simultaneously. It is shown by analysis as well as computer simulations that with BSD, the computational variability per decoded block can be substantially &creased. In fact it is shown that the Pareto exponent of the distribution of the block computational effort with BSD is twice that with unidirectional sequential decoding (U!iD). Good codes suitable for BSD are found. Also, an ejjcient bidirectional multiple stack algorithm (BMSA) is proposed and analyzed. This BMSA offers a good trade-off between computational effort and error performance.the Dewding of Convolutional Codes," I990 IEEE Book Of