Iterative construction of optimum signature sequence sets in synchronous CDMA systems

  • Authors:
  • S. Ulukus;R. D. Yates

  • Affiliations:
  • WINLAB, Rutgers-State Univ. of New Jersey, Piscataway, NJ;-

  • Venue:
  • IEEE Transactions on Information Theory
  • Year:
  • 2006

Quantified Score

Hi-index 754.96

Visualization

Abstract

Optimum signature sequence sets that maximize the capacity of single-cell synchronous code division multiple access (CDMA) systems have been identified. Optimum signature sequences minimize the total squared correlation (TSC); they form a set of orthogonal sequences, if the number of users is less than or equal to the processing gain, and a set of Welch (1994) bound equality (WBE) sequences, otherwise. We present an algorithm where users update their transmitter signature sequences sequentially, in a distributed fashion, by using available receiver measurements. We show that each update decreases the TSC of the set, and produces better signature sequence sets progressively. We prove that the algorithm converges to a set of orthogonal signature sequences when the number of users is less than or equal to the processing gain. We observe and conjecture that the algorithm converges to a WBE set when the number of users is greater than the processing gain. At each step, the algorithm replaces one signature sequence from the set with the normalized minimum mean squared error (MMSE) receiver corresponding to that signature sequence. Since the MMSE filter can be obtained by a distributed algorithm for each user, the proposed algorithm is amenable to distributed implementation