TY - JOUR
T1 - Iterative transmitter and receiver optimization for CDMA networks
AU - Ulukus, Sennur
AU - Yener, Aylin
N1 - Funding Information:
Manuscript received March 20, 2002; revised January 13, 2003. The editor coordinating the review of this paper and approving it for publication is S. Roy. This work was supported by the National Science Foundation under Grants ANI 02-05330 and CCR 02-37727. This work was presented in part at CISS 2002 [1] and IEEE ISIT 2002 [2].
PY - 2004/11
Y1 - 2004/11
N2 - Optimization of the capacity of a single-cell code-division multiple-access (CDMA) system, both from the perspective of the maximum number of users that can be served at a required quality of service level and from the information theoretic perspective, has been recently shown to be achieved by the same joint transmit and receive strategies. In this paper, we propose an alternating minimization based iterative algorithm that updates the transmitters and the corresponding receivers of the users. The algorithm is suitable for online implementation, and the objective function is suitable for extension to multicell networks, both of which are in contrast with the previously proposed algorithms. We show that the algorithm is provably convergent to the optimum signature sequences and the corresponding receivers.
AB - Optimization of the capacity of a single-cell code-division multiple-access (CDMA) system, both from the perspective of the maximum number of users that can be served at a required quality of service level and from the information theoretic perspective, has been recently shown to be achieved by the same joint transmit and receive strategies. In this paper, we propose an alternating minimization based iterative algorithm that updates the transmitters and the corresponding receivers of the users. The algorithm is suitable for online implementation, and the objective function is suitable for extension to multicell networks, both of which are in contrast with the previously proposed algorithms. We show that the algorithm is provably convergent to the optimum signature sequences and the corresponding receivers.
UR - http://www.scopus.com/inward/record.url?scp=11844249385&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=11844249385&partnerID=8YFLogxK
U2 - 10.1109/TWC.2004.837453
DO - 10.1109/TWC.2004.837453
M3 - Article
AN - SCOPUS:11844249385
SN - 1536-1276
VL - 3
SP - 1879
EP - 1884
JO - IEEE Transactions on Wireless Communications
JF - IEEE Transactions on Wireless Communications
IS - 6
ER -