![]() |
![]() |
|
![]() |
![]() |
Encyclopedia :
C :
CO :
COD :
Code division multiple access |
|
|
Code division multiple accessGeneral informationGenerically (as a multiplexing scheme), code division multiple access (CDMA) is any use of any form of spread spectrum by multiple transmitters to send to the same receiver on the same frequency channel at the same time without harmful interference. Other widely used multiple access techniques are Time Division Multiple Access (TDMA) and Frequency Division Multiple Access (FDMA). In these three schemes, receivers discriminate among various signals by the use of different codes, time slots and frequency channels, respectively. The term CDMA is also widely (but perhaps too liberally) used to refer to a family of specific implementations of CDMA pioneered by Qualcomm for use in digital cellular telephony. These include IS-95 (aka cdmaOne) and IS-2000 (aka cdma2000). The two different uses of this term can be confusing. To lessen confusion, the Qualcomm brand name cdmaOne may be used to refer to the 2G CDMA standard, instead of using more confusing generic term CDMA, or the technical term IS-95. Also frequently confused with CDMA is W-CDMA. Here are a few quick facts:
Technical detailsAll forms of CDMA use spread spectrum process gain to allow receivers to partially discriminate against unwanted signals. Signals with the desired spreading code and timing are received, while signals with different spreading codes (or the same spreading code but a different timing offset) appear as wideband noise reduced by the process gain. The way this works is that each station is assigned a spreading code or chip sequence. Such chip sequences are expressed as a sequence of −1 and +1 values. The dot product of each chip sequence with itself is +1 (and the dot product with its complement is −1), whereas the dot product of two different chip sequences is 0. E.g. if C1 = (−1, −1, −1, −1) and C2 = (+1,−1,+1,−1) C1 . C1 = (−1, −1, −1, −1) . (−1, −1, −1, −1) = +1
C1 . −C1 = (−1, −1, −1, −1) . (+1,+1,+1,+1) = −1
C1 . C2 = (−1, −1, −1, −1) . (+1,−1,+1,−1) = 0
C1 . −C2 = (−1, −1, −1, −1) . (−1,+1,−1,+1) = 0
This property is called orthogonality. A station sends out its chip sequence to send a 1, and its inverse to send a 0 (or +1 and a −1; zero being silence). When multiple chip codes are sent by multiple stations, the signals add up in the air. For example the chip sequences (−1, −1, −1, −1) and (+1,−1,+1,−1) add up to (0,−2,0,−2). A TDMA or FDMA receiver can in theory completely reject arbitrarily strong signals on other time slots or frequency channels. This is not true for CDMA; rejection of unwanted signals is only partial. If any or all of the unwanted signals are much stronger than the desired signal, they will overwhelm it. This leads to a general requirement in any CDMA system to approximately match the various signal power levels as seen at the receiver. In CDMA cellular, the base station uses a fast closed-loop power control scheme to tightly control each mobile's transmit power. The need for power control can be deduced neatly from the above calculations; if some stations would broadcast +0.8 and −0.8 and others +1.2 and −1.2, this would wreak havoc with the calculations. Forward error correction (FEC) coding is also vital in any CDMA scheme to reduce the required signal-to-interference ratio and thereby maximize channel capacity. CDMA's main advantage over TDMA and FDMA is that the number of available CDMA codes is essentially infinite. This makes CDMA ideally suited to large numbers of transmitters each generating a relatively small amount of traffic at irregular intervals, as it avoids the overhead of continually allocating and deallocating a limited number of orthogonal time slots or frequency channels to individual transmitters. CDMA transmitters simply send when they have something to say, and go off the air when they don't. See alsoExternal linkFurther reading
|
|
|
This article is from Wikipedia. All text is available under the terms of the GNU Free Documentation License. |
|
| © 2008 Chamas Enterprises Inc. |