The information on the code to be simulated must be input in the definition
file "def.h" in addition to using the corresponding generator matrix
Example:
A BCH(32,6,16) is to be simulated.
(1) The "def.h" file should contain the following three lines:
#define N 32
#define K 6
#define D_H 16
(2) Assume that order-5 decoding is to be simulated. Then compile (linux) as:
gcc -O2 osd_order5.c order5.c -lm
(3) Execution of the simulation program:
a.out genmat.32.06.16 ber.data -5 -2 1 100000 12344567
Simulation of soft-decision decoding with ordered statistics
This is a (32,6,16) linear code with generator matrix:
(IMPORTANT NOTE: The matrix MUST be in systematic form)
10000011100100010101111011010011
01000010010110011111000110111010
00100010101111011010011000001111
00010010110011111000110111010100
00001001011001111100011011101010
00000111001000101011110110100111
-5.000 1.2875000e-02
-4.000 3.7500000e-03
-3.000 8.9000000e-04
-2.000 8.0000000e-05
R.H. Morelos-Zaragoza, The Art of Error Correcting Coding, Wiley, 2002.
------------------------------------------------------------------------
ECC.rar_ecc code_ecc error code_error correction_hd dvd
版权申诉
29 浏览量
2022-09-23
07:14:27
上传
评论
收藏 239KB RAR 举报
ECC.rar （98个子文件） 
www.pudn.com.txt 218B
ECC (Source Codes) Linear block codes 
pe313_rayleigh.c 2KB WD_linear_code.c 3KB bound_313.c 2KB pe_std_array.c 3KB bound_rate12_bsc.c 2KB bound_hdd_awgn.c 3KB pe_313_hd_awgn.c 3KB WER_Chernoff.c 3KB WER_MC_union.c 4KB prob_dec_error_rs.c 3KB BER_MC_union.c 4KB simulation313.c 3KB hamming_wd.c 3KB genmat_ebch2.c 8KB prob_error_RScode.c 3KB bound_pe.c 2KB BER_Chernoff.c 3KB 633_awgn_hdd.c 6KB find_weights.c 3KB bound_rate12_bsc_best.c 3KB bound_undetect_422.c 2KB pe_hdd_awgn.c 4KB 633_awgn.c 6KB bound_rate12_bsc_meeberg.c 2KB bound_awgn_ebno.c 3KB 633_rayleigh.c 6KB Hamming, Golay and Reed-Muller codes rm13_awgn.c 5KB hamming.c 3KB golay24.c 5KB golay23.c 10KB Soft-decision decoding README.txt 1KB order3.c 21KB osd_order2.c 4KB order4.c 25KB rm31_awgn.c 5KB rm31_chase.c 10KB osd_order5.c 4KB osd_order1.c 4KB osd_order4.c 4KB osd_order0.c 4KB order0.c 9KB osd_order3.c 4KB order1.c 15KB order5.c 30KB order2.c 18KB def.h 222B Binary convolutional codes viterbi_binary_hard.c 4KB generate_trellis_nsc.c 3KB viterbi_binary_rsc.c 11KB generate_trellis_rsc.c 3KB viterbi_binary_punct.c 13KB viterbi_binary_nsc.c 12KB Soft-input soft-output (SISO) algorithms turbo_MAP_punc.cpp 25KB random.h 812B random.cpp 2KB random_punc.cpp 2KB random_punc.h 812B turbo_MAP.cpp 25KB Reed-Solomon codes rs_eedec_bm.c 19KB rs_eedec_euc.c 19KB Iteratively decodable codes ranint.c 2KB diagint.c 2KB bitf.c 10KB random.h 812B helint.c 2KB shannon2.c 2KB primint.c 3KB README_1998_turbo_cpp.txt 4KB cyclint.c 3KB random.cpp 2KB pearl_BP.c 11KB bitf.c.bak 10KB shannon.c 2KB turbo.cpp 24KB capacity.c 8KB blockint.c 2KB llr_pearl_BP.c 13KB random_punc.cpp 2KB random_punc.h 812B turbo_punc.cpp 25KB log_pearl_BP.c 15KB Binary cyclic codes and BCH codes bch4836.c 9KB RBDS.c 7KB bch_bm.c 15KB bch_awgn.c 16KB bch_erasures.c 15KB bch_euc.c 14KB Coded modulation tc-8psk-iq.c 21KB order4_code1.c 24KB order2_code2.c 17KB tc-8psk-sect.c 20KB main_4_2_0.c 14KB gen_trellis_ungerboeck.c 3KB tcm_8psk.c 18KB order0_code3.c 8KB qpsk_rm31.c 6KB def3.h 248B资源评论
