written 8.4 years ago by | • modified 8.4 years ago |
Mumbai University > Electronics and Telecommunication > Sem 7 > Mobile Communication
Marks: 10 M
Year: Dec 2014, May 2015
written 8.4 years ago by | • modified 8.4 years ago |
Mumbai University > Electronics and Telecommunication > Sem 7 > Mobile Communication
Marks: 10 M
Year: Dec 2014, May 2015
written 8.4 years ago by |
A brief description of the various operations involved is given below:
Convolution Encoder:
Symbol Repetition:
Interleaver: - Communication over a radio channel are characterised by deep fades that can cause a large number of consecutive errors. - Most coding schemes perform better on random data errors than on blocks of errors. - bit interleaving data no two adjacent bits are transmitted near to each other , and the data errors are randomised
Orthogonal modulation using walsh codes [64-ary orthogonal modulator]: - The data coming out of the block interleaver are grouped in units of 6 bits. - Each 6 bit units serves as an index to select a row of the 6464 walsh matrix (26 =64),and that row is substituted for the input. Thus the data rate is expanded by a factor 64/6 to 307.2 kbps[28.864/6]i.e walsh chips are transmitted at rate 307.2 kbps.
Data Burst Randomiser:
Direct sequence spreading
Quudrature modulation
The reverse link uses offset quadrature phase shift keying [OQPSK] modulation technique. OQPSK involves the following operation: - The digital bit streams at 1.2288 Mbps is separated into two bit streams called I and Q (In phase and quadrature) - The I streams is Ex-Ored with I channel pilot PN sequence and Q streams is Ex-Ored with Q channel pilot PN sequence which is delayed by half a chip with respect to the I channel pilot PN sequence. This delay is used for improved spectral shaping and synchronisation - Both streams are 1.2288 Mbps quadrature PN binary signals of 15 bits.
The resulting quadrature signals at the output are then weighted and transmitted
The 64 by 64 Walsh function matrix (also called a Hadamard matrix) is generated by the following recursive procedure: