Partition-Based Hybrid Decoding (PHD): A Class of ML Decoding Schemes for MIMO Signals Based on Tree Partitioning and Combined Depth- and Breadth-First Search
In this paper, we propose a hybrid maximum likelihood (ML) decoding scheme for multiple-input multiple-output(MIMO) systems. After partitioning the searching tree into several stages, the proposed scheme adopts thecombination of depth- and breadth-first search methods in an organized way. Taking the...
| Autores: | , , |
|---|---|
| Tipo de recurso: | artículo |
| Estado: | Versión publicada |
| Fecha de publicación: | 2013 |
| País: | México |
| Institución: | UNIVERSIDAD NACIONAL AUTÓNOMA DE MÉXICO |
| Repositorio: | Journal of Applied Research and Technology |
| Idioma: | inglés |
| OAI Identifier: | oai:ojs2.localhost:article/316 |
| Acceso en línea: | https://jart.icat.unam.mx/index.php/jart/article/view/316 |
| Access Level: | acceso abierto |
| Palabra clave: | Hybrid decoding multiple input multiple output (MIMO) maximum likelihood detection tree partitioning. |
| Sumario: | In this paper, we propose a hybrid maximum likelihood (ML) decoding scheme for multiple-input multiple-output(MIMO) systems. After partitioning the searching tree into several stages, the proposed scheme adopts thecombination of depth- and breadth-first search methods in an organized way. Taking the number of stages, the size ofsignal constellation, and the number of antennas as the parameter of the scheme, we provide extensive simulationresults for various MIMO communication conditions. Numerical results indicate that, when the depth- and breadth-firstsearch methods are employed appropriately, the proposed scheme exhibits substantially lower computationalcomplexity than conventional ML decoders while maintaining the ML bit error performance. |
|---|