New decoding strategy for underdetermined mimo transmission sparse decomposition - Archive ouverte HAL Access content directly
Conference Papers Year : 2013

New decoding strategy for underdetermined mimo transmission sparse decomposition

Abstract

In this paper we address the problem of large dimension decoding in MIMO systems. The complexity of the optimal maximum likelihood detection makes it unfeasible in practice when the number of antennas, the channel impulse response length or the source constellation size become too high. We consider a MIMO system with finite constellation and model it as a system with sparse signal sources. We formulate the decoding problem as an underdetermined sparse source recovering problem and apply the L1-minimization to solve it. The resulting decoding scheme is applied to large MIMO systems and to frequency selective channel . We also review the computational cost of some L1-minimization algorithms. Simulation results show significant improvement compared to other existing receivers.
Fichier principal
Vignette du fichier
EUSIPCO2013.pdf (98.64 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-00937815 , version 1 (28-01-2014)

Identifiers

  • HAL Id : hal-00937815 , version 1

Cite

Yasser Fadlallah, Abdeldjalil Aissa El Bey, Karine Amis Cavalec, Dominique Pastor, Ramesh Pyndiah. New decoding strategy for underdetermined mimo transmission sparse decomposition. EUSIPCO 2013 : 21st European Signal Processing Conference, Sep 2013, Marrakech, Morocco. ⟨hal-00937815⟩
163 View
275 Download

Share

Gmail Facebook Twitter LinkedIn More