Abstract | ||
---|---|---|
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 ... |
Year | DOI | Venue |
---|---|---|
2011 | 10.1109/TWC.2011.092011.100110 | IEEE Transactions on Wireless Communications |
Keywords | Field | DocType |
Receiving antennas,Complexity theory,Maximum likelihood decoding,WiMAX,MIMO | Matrix (mathematics),MIMO,Real-time computing,Communication complexity,Viterbi decoder,Soft-decision decoder,Decoding methods,List decoding,Mathematics,Computational complexity theory | Journal |
Volume | Issue | ISSN |
10 | 11 | 1536-1276 |
Citations | PageRank | References |
2 | 0.44 | 4 |
Authors | ||
2 |
Name | Order | Citations | PageRank |
---|---|---|---|
Young Gil Kim | 1 | 152 | 18.48 |
Norman C. Beaulieu | 2 | 2259 | 260.64 |