White Papers

Achievable Information Rates and the Coding-Spreading Tradeoff in Finite-Sized Synchronous CDMA Systems

Overview This paper computes achievable rates for synchronous Code-Division Multiple-Access (CDMA) systems and studies the associated coding-spreading tradeoff problem using these results. Random spreading sequences are assumed and the computed achievable rates are averaged over ensembles of spreading sequences. Unlike most prior work which analyzed the spectral efficiency of large CDMA systems under Gaussianity assumptions (inputs and multi-user interference), no such assumptions are made. In order to display the coding-spreading tradeoff, the required minimum SNR are plotted for reliable transmission as a function of information rate.

Further White Paper Details
PublisherUniversity of Arizona File FormatPDF
Date PublishedOctober 2003
FormatWhite Papers   
Topics
    N/A
E4 embraces web 2.0 audience

E4 embraces web 2.0 audience

Case study: How the Channel 4's teen channel put its mind to building a community website... more

Cheat Sheet: Cloud computing

Cheat Sheet: Cloud computing

A tech storm is brewing...  more


Quick Sitemap Links: