Reduced Complexity Algorithm for Spreading Sequence Design

This paper describes a novel gradient descent algorithm for the constrained optimization of spreading sequence design in the uplink of CDMA systems that use codeword adaptation. We prove that the proposed algorithm converges to the optimal sequence. In addition, the paper demonstrates the convergenc...

Full description

Saved in:
Bibliographic Details
Published inIEEE transactions on circuits and systems. II, Express briefs Vol. 55; no. 12; pp. 1309 - 1313
Main Authors Lacatus, C., Akopian, D., Shadaram, M.
Format Journal Article
LanguageEnglish
Published New York IEEE 01.12.2008
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects
Adaptation
Additive white noise
Algorithm design and analysis
Algorithms
CDMA
Circuits
Computational modeling
Computer simulation
constrained optimization
Constraint optimization
Convergence
Cost function
Covariance matrix
Design engineering
distributed algorithm
Distributed algorithms
Interference
Optimization
Signal processing algorithms
Spreading
spreading sequence
Online AccessGet full text

Cover

More Information
Summary:This paper describes a novel gradient descent algorithm for the constrained optimization of spreading sequence design in the uplink of CDMA systems that use codeword adaptation. We prove that the proposed algorithm converges to the optimal sequence. In addition, the paper demonstrates the convergence of the parallel distributed optimization which is confirmed by simulations. Parallel optimization ensures faster convergence and thus reduces computational load. The performance of the parallel algorithm is improved as the number of active users increases.
Bibliography:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISSN:1549-7747
1558-3791
DOI:10.1109/TCSII.2008.2008056