Description: Computes BER v EbNo curve for convolutional encoding / soft decision
Viterbi decoding scheme assuming BPSK.
Brute force Monte Carlo approach is unsatisfactory (takes too long)
to find the BER curve.
The computation uses a quasi-analytic (QA) technique that relies on the
estimation (approximate one) of the information-bits Weight Enumerating
Function (WEF) using
A simulation of the convolutional encoder. Once the WEF is estimated, the analytic formula for the BER is used. Platform: |
Size: 6200 |
Author:joy |
Hits:
Description: Computes BER v EbNo curve for convolutional encoding / soft decision
Viterbi decoding scheme assuming BPSK.
Brute force Monte Carlo approach is unsatisfactory (takes too long)
to find the BER curve.
The computation uses a quasi-analytic (QA) technique that relies on the
estimation (approximate one) of the information-bits Weight Enumerating
Function (WEF) using
A simulation of the convolutional encoder. Once the WEF is estimated, the analytic formula for the BER is used.-Computes BER v EbNo curve for convolutional encoding/soft decision Viterbi decoding scheme assuming BPSK. Brute force Monte Carlo approach is unsatisfactory (takes too long) to find the BER curve.The computation uses a quasi-analytic (QA) technique that relies on theestimation (approximate one) of the information-bits Weight Enumerating Function (WEF) usingA simulation of the convolutional encoder. Once the WEF is estimated, the analytic formula for the BER is used. Platform: |
Size: 6144 |
Author:joy |
Hits:
Search - BERcurve_CV_soft2_QA