13.07.2015 Views

View File - University of Engineering and Technology, Taxila

View File - University of Engineering and Technology, Taxila

View File - University of Engineering and Technology, Taxila

SHOW MORE
SHOW LESS

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

tion; that is, log e ð1 þ xÞ x to estimate the total capacity, where 1 x 1.In view <strong>of</strong> (5.13) <strong>and</strong> upon application <strong>of</strong> the well-known power-seriesapproximation, we can writeEC x C b =N oxlog1 þ C x ðl 1ÞE b =N eð5:15ÞoAlternatively,C x log 2 e 1log e 2< 1log e 21E b =N 01E b =N 0ð5:16ÞThe preceding expressions <strong>and</strong> Fig. 5.9 show that the total capacity does notincrease with number <strong>of</strong> users as in FDMA <strong>and</strong> TDMA systems.Case II: Cooperative CDMAIn the cooperative CDMA case, the receiver for each user code or signal doesknow the spreading waveforms <strong>of</strong> the other users. As a consequence, thesystem receiver comprising a bank <strong>of</strong> l single-user receivers knows all l users’spreading waveforms <strong>and</strong> jointly detects <strong>and</strong> demodulates all users’ codes. Ifwe assign each userA transmission rate R ri (where i ¼ 1; 2; ...; l)A codebook containing a set <strong>of</strong> 2 kðL c 1Þ) codewords* <strong>of</strong> carrier powerC I (where k ¼ number <strong>of</strong> input bits <strong>and</strong> L c ¼ constraint length y )then the achievable l-dimensional rate region for the l users may berepresented byR r ¼ PlR ri < B log 2 1 þ lC ið5:17ÞNi¼1Note that this expression assumes equal carrier power C i ¼ C for each user.*A codeword is the number <strong>of</strong> bits transmitted in a block. For example, if we transmit n bits in ablock, which is made up <strong>of</strong> k message bits plus r parity check bits, then the n-bit block is called acodeword.y Constraint length is defined as the number <strong>of</strong> shifts over which a single message bit can influencethe encoder output. This definition becomes clearer in Chap. 6.Copyright © 2002 by Marcel Dekker, Inc. All Rights Reserved.

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!