Optimization of computational resource allocation for soft MIMO detection

We consider soft MIMO detection for the case of block fading. That is, the transmitted codeword spans over several independent channel realizations and several instances of the detection problem must be solved for each such realization. We develop methods that adaptively allocate the computational resources to the detection problems of each channel realization, under a total per-codeword complexity constraint. Our main results are a formulation of the problem as a mathematical optimization problem and a greedy algorithm to approximate it in a computationally feasible fashion.