Bidirectional Sequential Decoding

In this paper, we present efficient 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 decode... View More