A generalized branch and bound decoder for asymmetrical space-time communication architecture

This paper presents the generalized version of the Branch and Bound decoder for asymmetrical space-time communication architecture. The branch and bound algorithm gives the ML solution to the rank deficiency problem. The algorithm will do an exhaustive search on the last component of the vector. Simulations are also performed for different configurations of the system.