Idioma:

Minimum Symbol Error Probability Discrete Symbol Level Precoding for MU-MIMO Systems with PSK Modulation

Lopes, Erico S. P. ; Landau, Lukas T. N. ; Mezghani, Amine

IEEE transactions on communications, 2023-10, Vol.71 (10), p.1-1 [Periódico revisado por pares]

New York: IEEE

Texto completo disponível

Citações Citado por

Enviar para

Título:
Minimum Symbol Error Probability Discrete Symbol Level Precoding for MU-MIMO Systems with PSK Modulation
Autor: Lopes, Erico S. P. ; Landau, Lukas T. N. ; Mezghani, Amine
Assuntos: Algorithms ; Branch and bound methods ; Complexity ; Criteria ; Error probability ; Error reduction ; Low-Resolution Quantization ; MIMO systems ; Minimum Symbol Error Probability ; Minimum Union Bound Symbol Error Probability ; Modulation ; Phase shift keying ; Precoding ; Quality of service ; Signal to noise ratio ; Symbol Level Precoding ; Symbols
É parte de: IEEE transactions on communications, 2023-10, Vol.71 (10), p.1-1
Descrição: This study focuses on the development of low-resolution symbol-level precoding techniques for multiuser MIMO downlink systems with PSK modulation. While for QPSK the established minimum symbol error probability criterion is used, a criterion for PSK modulation, in general, is proposed based on the minimum union-bound symbol-error probability. Based on these criteria different low-resolution precoding approaches are proposed. First, suboptimal solutions are computed via a partial greedy search method. Then the suboptimal solutions are utilized as initialization for a novel branch-and-bound algorithm that can exploit knowledge of the system's quality-of-service demands. Different than existing branch-and-bound approaches the proposed quality-of-service branch-and-bound method searches for a solution that attains a target symbol-error probability while going in the direction of the global optimal solution. In this sense, the proposed branch-and-bound method allows for tunable complexity performance trade-offs. Numerical results confirm that the proposed quality-of-service branch-and-bound algorithm yields reduced symbol-error probability with significantly smaller computational complexity than other state-of-the-art branch-and-bound designs.
Editor: New York: IEEE
Idioma: Inglês

Voltar para lista de resultados

Realização: Logos de Redes Sociais:

Minimum Symbol Error Probability Discrete Symbol Level Precoding for MU-MIMO Systems with PSK Modulation

Lopes, Erico S. P. ; Landau, Lukas T. N. ; Mezghani, Amine

New York: IEEE

Buscando em bases de dados remotas. Favor aguardar.