Description: a communication system consists of binary source, 3 error-correcting BCH code of length 15 over GF(24) (i.e, BCH (15,5,7 code), the primitive polynomial is p(x)=1+x+x4), BPSK modulator, AWGN channel, coherent demodulator, decoder (either BMA or EA could be utilized to solve the error locator polynomial) and sink. Simulate and draw its error performance with and without BCH coding, together with the theoretical no-coding curve, i.e. two BER-EbNo curves.
To Search:
File list (Check if you may need any files):
bch\bch.asv
...\bch0.asv
...\bch0.m
...\bch1.m
...\bch155.m
...\BCHdecode.asv
...\bchded155.asv
...\bchded155.m
...\bch_ber.asv
...\bch_ber.m
...\ber_err.m
...\comb.m
...\compconv.m
...\compoversamp.m
...\delay.m
...\gaussf.m
...\gf2dec.m
...\hrollfcoef.m
...\oversamp.m
...\oversamp2.m
...\readme-chap3.txt
...\sefade.m
bch
Download