In a broadband uplink code-division multiple-access transmission, the interference among users, depending on the correlation of specific channels and codes, may be significant. Hence, when successive interference cancellation (SIC) is performed at the base station, the minimization of power consumption at the mobile terminals is achieved if a joint optimization of power control and ordering (JOPCO) of user detection is carried out. In this paper, we first investigate a closed-form solution to JOPCO, based on the assumption of perfect interference cancellation and complete knowledge of channel correlation among users. By describing the JOPCO problem as an optimization on a suitable graph, it is seen that the optimum solution is NP-hard, and we approximate it by a greedy algorithm. For a practical implementation, we then model JOPCO as a discrete stochastic optimization problem, and we derive a discrete stochastic approximation (DSA) algorithm that iteratively adapts the transmit powers and the SIC detection order. The DSA solution removes the hypothesis on perfect cancellation and explicit knowledge of the users' correlation. Moreover, by a suitable description of the problem, we obtain a simplified DSA algorithm having reduced requirements in both computational complexity and memory. Performance of the various algorithms is assessed by simulations in a universal mobile telecommunications system scenario.

Joint Power Control and Receiver Optimization of CDMA Transceivers using Successive Interference Cancellation

BENVENUTO, NEVIO;TOMASIN, STEFANO
2007

Abstract

In a broadband uplink code-division multiple-access transmission, the interference among users, depending on the correlation of specific channels and codes, may be significant. Hence, when successive interference cancellation (SIC) is performed at the base station, the minimization of power consumption at the mobile terminals is achieved if a joint optimization of power control and ordering (JOPCO) of user detection is carried out. In this paper, we first investigate a closed-form solution to JOPCO, based on the assumption of perfect interference cancellation and complete knowledge of channel correlation among users. By describing the JOPCO problem as an optimization on a suitable graph, it is seen that the optimum solution is NP-hard, and we approximate it by a greedy algorithm. For a practical implementation, we then model JOPCO as a discrete stochastic optimization problem, and we derive a discrete stochastic approximation (DSA) algorithm that iteratively adapts the transmit powers and the SIC detection order. The DSA solution removes the hypothesis on perfect cancellation and explicit knowledge of the users' correlation. Moreover, by a suitable description of the problem, we obtain a simplified DSA algorithm having reduced requirements in both computational complexity and memory. Performance of the various algorithms is assessed by simulations in a universal mobile telecommunications system scenario.
File in questo prodotto:
Non ci sono file associati a questo prodotto.
Pubblicazioni consigliate

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/11577/2471570
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 13
  • ???jsp.display-item.citation.isi??? 12
social impact