Name
Abstract | ||
|---|---|---|
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. |
Year | DOI | Venue |
|---|---|---|
2013 | 10.1109/ICTEL.2013.6632128 | 2013 20TH INTERNATIONAL CONFERENCE ON TELECOMMUNICATIONS (ICT) |
Keywords | Field | DocType |
detecting matrix, CDMA system, overloaded scheme, sparse CDMA, coin weighing | Cdma systems,Computer science,Matrix (mathematics),Sparse approximation,Algorithm,Theoretical computer science,Real-time computing,Decoding methods,Code division multiple access,Sparse matrix,Random matrix,Binary number | Conference |
Citations | PageRank | References |
0 | 0.34 | 6 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Mohammad Ali Sedaghat | 1 | 72 | 12.19 |
| F. Bateni | 2 | 0 | 0.34 |
| Farrokh Marvasti | 3 | 113 | 13.55 |