Scribd
Upload
61 views4 pages

Q 3

Uploaded by

Beyza Akçokrak
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF or read online on Scribd
61 views4 pages

Q 3

Uploaded by

Beyza Akçokrak
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF or read online on Scribd
You are on page 1/ 4
Question 3 - in Matlab, the trellis diagram for the 1st row of Table 7.4 (Constraint Length, K = 3 and rate 4 code) can be stated as follows, trellis = poly2trellis(3,{‘1+x1x°2", "1+x°2"1) Plot the simulated BER for the coded BPSK system for rate % convolutionally code with constraint lengths K = 3, K= 5 and K =7 respectively, You can generate 5 Milion information bits, = varies between 2.4B to 8 dB, and the zero mean Gaussian channel noise variance is 1. a) (10 pts) For Hard decision decoding (HDD), plot the coded BER for each value of K and its BER upperbound as given in Fig 5. You can use “bercoding” command to compute the coded BER b) Q upperbound Fora gen sta god dea tous the BER upperbound when the simulated BER not avaliable? Comment on your ests (5 pts) Plot execution time of the Viterbi decoder for 1 million information bits at each value of K similar to Fig 6. Not tht cepending onthe merry and procesig owe of your compute, the exciton times might be different than the oes presented Fig. 6 (20 pts) Now you should seek the performance of soft decision decoding (SDD) instead of HDD. You should partition the interval between -1 and +1 into L intervals. As an example, similar to Question 1, for L=4, you can set the decision thresholds as [-0.5 0 0.5] or for L= 8, you can set the decision thresholds as [-0.75 -0.5 -0.25 0 0.25 0.5 0.75] and so on. Let s; be a soft decision 2 bit (L=4 level) sample, then s; is obtained from the received coded BPSK symbol 7; from, nS -05 -05 <7 <0 0 05 To obtain the quantized soft decisions from the received coded BPSK symbolds, you can use the function “quantiz”. Then, for arate % convolutional code with K = 3, obtain the BER and BER upperbound for SDD. You can also compare your results with BER and its upperbound for HDD as presented in Fig. 7. Comment on your results. Fgue 5 Simoted BER and its upperbaund unde HOD. Foure 6 - Ver decoder encvtontmes onder Ke, Ke and X=? encod wo? a? ot ee Seen noo va|| * BeRuppetoun 800 to*}) 2S gem ono —o—5en BER 3 L800 Sin Bem 40 S00 E,/N, ing ‘Figure 7 Simulated BER and ts upperbound under SDO.

You might also like