Optimal sparse CDMA detection at high load
| dc.creator | Raymond, Jack | |
| dc.date | 2009-03-22 | |
| dc.date | 2009-05-22 | |
| dc.date.accessioned | 2026-07-07T13:17:03Z | |
| dc.date.available | 2026-07-07T13:17:03Z | |
| dc.description | Balancing efficiency of bandwidth use and complexity of detection involves choosing a suitable load for a multi-access channel. In the case of synchronous CDMA, with random codes, it is possible to demonstrate the existence of a threshold in the load beyond which there is an apparent jump in computational complexity. At small load unit clause propagation can determine a jointly optimal detection of sources on a noiseless channel, but fails at high load. Analysis provides insight into the difference between the standard dense random codes and sparse codes, and the limitations of optimal detection in the sparse case. | |
| dc.description | Submitted to physcomnet09, 6 pages 6 figures, pdflatex | |
| dc.identifier | https://arxiv.org/abs/0903.3715 | |
| dc.identifier | http://arxiv.org/abs/0903.3715 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/230987 | |
| dc.subject | Information Theory | |
| dc.title | Optimal sparse CDMA detection at high load | |
| dc.type | text |