The basis of branch and bound algorithms is a ranking function. The ranking function assigns a value to each node in the graph. At each step, a branch and bound algorithm uses the ranking function to decide which node to expand next. In contrast, the

This contribution considers semi-blind adaptive equalization for communication systems that employ high-throughput quadrature amplitude modulation signalling. A minimum number of training symbols, approximately equal to the dimension of the equal