Loading...

Almost-optimum signature matrices in binary-input synchronous overloaded CDMA

Khoozani, M. H ; Sharif University of Technology | 2011

539 Viewed
  1. Type of Document: Article
  2. DOI: 10.1109/CTS.2011.5898917
  3. Publisher: 2011
  4. Abstract:
  5. The everlasting bandwidth limitations in wireless communication networks has directed the researchers' thrust toward analyzing the prospect of overloaded Code Division Multiple Access (CDMA). In this paper, we have proposed a Genetic Algorithm in search of optimum signature matrices for binary-input synchronous CDMA. The main measure of optimality considered in this paper, is the per-user channel capacity of the overall multiple access system. Our resulting matrices differ from the renowned Welch Bound Equality (WBE) codes, regarding the fact that our attention is specifically aimed at binary, rather than Gaussian, input distributions. Since design based on channel capacity is computationally expensive, we have focused on introducing a set of alternative criteria that not only speed up the matrix formation procedure, but also maintain optimality. The Bit Error Rate (BER) and Constellation measures are our main criteria propositions. Simulation results also verify our analytical justifications
  6. Keywords:
  7. Optimum Capacity Signature Matrices ; Bandwidth limitation ; Gaussians ; Matrix formation ; Multiple access systems ; Optimality ; Optimum capacity ; Overloaded CDMA ; Simulation result ; Speed-ups ; Synchronous CDMA ; Welch bound equalities ; Wireless communication network ; Bit error rate ; Channel capacity ; Information technology ; Optical communication ; Wireless telecommunication systems ; Code division multiple access
  8. Source: 2011 18th International Conference on Telecommunications, ICT 2011, 8 May 2011 through 11 May 2011, Ayia Napa ; 2011 , Pages 195-200 ; 9781457700248 (ISBN)
  9. URL: http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=5898917