We consider the uplink of a multicarrier code-division multiple-access (MC-CDMA) network and assume that the base station is endowed with a uniform linear array. Transmission takes place over a multipath channel and the goal is the estimation of the directions of arrival (DOAs) of the signal from the active users. In a multiuser scenario, difficulties are primarily due to the large number of parameters involved in the estimation of the DOAs which makes this problem much more challenging than in single- user transmissions. The solution we propose allows estimating the DOAs of different users independently, thereby leading to a significant reduction in the system complexity. In the presence of multipath propagation, however, estimating the DOAs of a given user through maximum-likelihood methods remains a formidable task since it involves a search over a multidimensional domain. Therefore, we look for simpler solutions and discuss two alternative schemes based on the SAGE and ESPRIT algorithms.

DOA estimation in the uplink of multicarrier CDMA systems

D'AMICO, ANTONIO ALBERTO;MORELLI, MICHELE;SANGUINETTI, LUCA
2008-01-01

Abstract

We consider the uplink of a multicarrier code-division multiple-access (MC-CDMA) network and assume that the base station is endowed with a uniform linear array. Transmission takes place over a multipath channel and the goal is the estimation of the directions of arrival (DOAs) of the signal from the active users. In a multiuser scenario, difficulties are primarily due to the large number of parameters involved in the estimation of the DOAs which makes this problem much more challenging than in single- user transmissions. The solution we propose allows estimating the DOAs of different users independently, thereby leading to a significant reduction in the system complexity. In the presence of multipath propagation, however, estimating the DOAs of a given user through maximum-likelihood methods remains a formidable task since it involves a search over a multidimensional domain. Therefore, we look for simpler solutions and discuss two alternative schemes based on the SAGE and ESPRIT algorithms.
2008
D'Amico, ANTONIO ALBERTO; Morelli, Michele; Sanguinetti, Luca
File in questo prodotto:
Non ci sono file associati a questo prodotto.

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11568/194971
 Attenzione

Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo

Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 7
  • ???jsp.display-item.citation.isi??? 5
social impact