On the Decoding of Matrix C in the WiMAX Standard

The decoding of Matrix C in the WiMAX standard is investigated. We propose an exhaustive search and zero-forcing (ES-ZF) decoder and an exhaustive search and nulling canceling (ES-NC) decoder for uncoded systems. The computational complexity of the ES-ZF decoder for Matrix C decoding is shown to be the same as the complexity of the ZF decoder for Matrix B decoding with twice the number of receive antennas times the complexity of the maximum likelihood (ML) decoder for Matrix B decoding with twice the number of receive antennas. Matrix C can be implemented in a 2 x 2 multiple-input multiple-output (MIMO) system using the ES-NC decoder with reduced complexity compared to ML decoding with no performance loss. For coded systems, double pruned trees using a zero-forcing (DPT-ZF) algorithm or nulling canceling (DPT-NC) algorithm are proposed. The DPT-NC decoder is shown to be implemented in a 2 x 2 MIMO coded system with reduced complexity compared to the Max-Log decoding, with no performance loss, by computer simulations.