Loading...

Detecting matrices for random CDMA systems

Sedaghat, M. A ; Sharif University of Technology | 2013

510 Viewed
  1. Type of Document: Article
  2. DOI: 10.1109/ICTEL.2013.6632128
  3. Publisher: IEEE Computer Society , 2013
  4. Abstract:
  5. This paper studies detecting matrices in random dense and sparse Code Division Multiple Access (CDMA) systems. Detecting matrices were originally introduced in the coin weighing problem. Such matrices can be used in CDMA systems in over-loaded scheme where the number of users is greater than the number of chips. We drive some conditions in the large system limit for binary and bipolar random CDMA systems to ensure that any random matrix is a detecting matrix. Furthermore, we extend our results to sparse random ternary matrices that have been using in the sparse CDMA literature. Finally, a construction method for the sparse detecting matrices is introduced
  6. Keywords:
  7. CDMA system ; Coin weighing ; Detecting matrix ; Overloaded scheme ; Sparse CDMA ; Code division multiple access ; Weighing ; Coin weighing problem ; Construction method ; Large system ; Random Matrix ; Sparse codes ; Information technology
  8. Source: 2013 20th International Conference on Telecommunications, ICT 2013 ; 2013
  9. URL: http://ieeexplore.ieee.org/xpl/login.jsp?tp=&arnumber=6632128&url=http%3A%2F%2Fieeexplore.ieee.org%2Fxpls%2Fabs_all.jsp%3Farnumber%3D6632128