A tradeoff method between complexity and performance for Iterative asymmetrical poly-diagonalization and trellis decoding

Multiple-Input Multiple-Output (MIMO) spatial multiplexing is a promising technique to increase the channel capacity without increasing bandwidth. One of the key to successful application of this technique is in receiver design. A low complexity receiver algorithm, based on asymmetrical poly-diagonalization and trellis decoding, is investigated. It can provide a trade-off between performance and complexity. Recently, the iterative scheme was proposed. Based on the properties, in this paper, as shown in the simulation result, we obtain the trade-off behavior between performance and complexity, which shows that relative to MAP can be achieved with much less computational cost.