Cart (Loading....) | Create Account
Close category search window
 

Reduced Complexity Algorithm for Spreading Sequence Design

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Lacatus, C. ; Dept. of Electr. & Comput. Eng., Univ. of Texas at San Antonio, San Antonio, TX ; Akopian, D. ; Shadaram, M.

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.

Published in:

Circuits and Systems II: Express Briefs, IEEE Transactions on  (Volume:55 ,  Issue: 12 )

Date of Publication:

Dec. 2008

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.