Rahul Singh 66 Expt 6

DON BOSCO INSTITTUTE OF TECHNOLOGY, DEPARTMENT OF
ELECTRONICS AND TELECOMMUNICATION
MOBILE COMMUNICATION
Name: Rahul Singh Batch: B DOP: 04/10/2021
Roll no: 66 DOS: 07/10/2021
EXPERIMENT: 6
Aim:
To design CDMA transceiver system.
Objective:
Students will understand concept of CDMA.
Learning Outcome:
Students will design CDMA transceiver system.
Theory:
Code Division Multiple Access (CDMA) is a method of multiplexing that does not divide a
channel by time as in TDMA or frequency as in FDMA. Instead all active users use the same
frequency at the same time. Separation of channels is now achieved by code. This scheme
encodes data using special code associated with each channel called chipping sequence (or
Pseudo random Noise sequence). The codes used here are orthogonal and has good
autocorrelation property. CDMA multiples the data being transmitted by a "noise" signal
(chipping sequence). This noise signal is a pseudo random sequence of 1 and −1 values, at
a frequency much higher than that of the original signal, thereby spreading the energy of the
original signal into a much wider band. De spreading requires the receiver to apply the same
PN sequence on the received signal to recover data.
Spread Spectrum: In Spread Spectrum communication occupancy of bandwidth is high, as

a result power spectral density is lower and in the channel the signal looks like noise. The
Spreading is done by combining the data signal with a code (code division multiple access)
Page 1 of 4
which is independent of the transmitted data message. Spread Spectrum communication is

secure communication, without knowing the spreading code, it is (nearly) impossible to
recover the transmitted data. There are a couple of Spread Spectrum Techniques which can
be used.
Direct Sequence Spread Spectrum: In a DS-SS scheme, the original message symbol (+1 or
-1) is multiplied by sequence of codes. These are referred to as the spreading codes. A PN
sequence is a binary sequence that exhibits randomness properties but has a finite length and
is therefore deterministic. Synchronization is achieved using PN sequence between
transmitter and receiver. PN generators are based on Linear Feedback Shift Registers
(LFSR).
Algorithm:
1. Start
2. Enter sender A's data: Ad, Convert into bipolar.
3. Enter sender B's data: Bd, Convert into bipolar.
4. Enter A's PN sequence: code A [ ] and Convert into bipolar.
5. Enter B's PN sequence: code B [ ] and Convert into bipolar.
6. Spread A's data: As [ ] = Ad * code A [ ]
7. Spread B's data: Bs [ ] = Bd * code B [ ]
8. Add As [ ] and B [ ]: c [ ] = As [ ] + Bs [ ]
9. De spread A's signals Result A [ ] = c [ ] * code A [ ] Add values of Result A [ ] If sum
> 0 then A's transmitted data is 1 else 0.
10. De spread B's signals Result B [ ] = c [ ] * code B [ ] Add values of Result B [ ] If sum
> 0 then A's transmitted data is 1 else 0.
Example:
1. Sender A's data Ad = 1 => Bipolar Ad = +1 Sender B's data Bd = 0 => Bipolar Bd = -1
2. A's Chip code is code A []: 0 0 1 1 0 0 1 1 => Bipolar conversion is: -1 -1 +1 +1 -1-1 +1 +1
3. B's Chip code is code B []: 0 1 1 0 0 1 1 0 =>Bipolar conversion is: -1 +1 +1 -1 -1 +1 +1 -1
4. Spread A's data As = 1 * (-1 -1 +1 +1 -1 -1 +1 +1) = (-1 -1 +1 +1 -1 -1 +1 +1)
5. Spread B's data Bs = -1 * (-1 +1 +1 -1 -1 +1 +1 -1) = (+1 -1 -1 +1 +1 -1 -1 +1)
6. Send the sum of As + Bs, Cs = As + Bs = (0 -2 0 2 0 -2 0 2)
7. Recover As Data from received signal Cs
Cs * codeA[ ] = ( 0 -2 0 2 0 -2 0 2 ) * (-1 -1 +1 +1 -1-1 +1 +1) = (0 2 0 2 0 2 0 2) Sum
= 8 > 0 hence A's transmitted data was Ad=1
8. Recover B's Data from received signal Cs
Cs * code B [ ] = (0 -2 0 2 0 -2 0 2) * (-1 +1 +1 -1 -1 +1 +1 -1) = (0 -2 0 -2 0 -2 0 -2)
, if Sum = -8 < 0
, hence B's transmitted data was Bd = 0
Page 2 of 4
Scilab Code:
//66_Rahul Singh_ Batch-B
clc; clear;
A=input('Enter A data: ');

C1=input('Enter code1: ');
B=input('Enter B data: ');
C2=input('Enter code2: ');
a=2*A-1;
disp(a)
c1=2*C1-1;
disp(c1) b=2*B-
1; disp(b)
c2=2*C2-1;
disp(c2)
As=[a]'*[c1];
Bs=[b]'*[c2];
Cs=[As]+[Bs];
Cs1=[Cs]*[c1]';
Cs2=[Cs]*[c2]';
m=length(Cs1) n=length(Cs2)
for i=1:m if
Cs1(i)>0 a1(i)=1;
else a1(i)=0; end
end
disp(a1')
for i=1:n if
Cs2(i)>0 b1(i)=1;
else b1(i)=0; end
end
disp(b1')
Page 3 of 4
Output:
Conclusion:
In this experiment, we studied and understood the concept of CDMA. Code Division Multiple
Access (CDMA) is a sort of multiplexing that facilitates various signals to occupy a single
transmission channel. It optimizes the use of available bandwidth. We implemented CDMA
using Scilab. We successfully converted the binary values to bipolar values. We also
successfully received the transmitted code.
Page 4 of 4

Rahul Singh 66 Expt 6

Uploaded by

Copyright:

Available Formats

Rahul Singh 66 Expt 6

Uploaded by

Document Information

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Rahul Singh 66 Expt 6

Uploaded by

Copyright:

Available Formats

DON BOSCO INSTITTUTE OF TECHNOLOGY, DEPARTMENT OF

ELECTRONICS AND TELECOMMUNICATION

Spread Spectrum: In Spread Spectrum communication occupancy of bandwidth is high, as

which is independent of the transmitted data message. Spread Spectrum communication is

A=input('Enter A data: ');

You might also like