Branch and Bound Method for Design of Recurrent Signal Reception Algorithms

Two algorithms of recurrent-signal reception (for the maximum likelihood metric and that of Fano) are synthesized with the branch and bound technique. These two algorithms require a moderate amount of memory. In their computational performance they are inferior only to the stack-algorithm of Zigangirov.