A new algorithm which is called pseudo-sequential decoding of block codes is presented

whose complexity is reduced by employing of branching and bounding strategy for a binary directed tree.The new decoder can complete soft-decision decoding without hard-decision decoding

it is simpler in structure than the Chase decoder.The computer simulation shows that the performance of the new decoder approaches to that of the Viterbi decoder and superior to over that of the Chase Ⅱ decoder.