1. Home
  2. Lainnya

k = 63,45 t=2 Data awal:

B.1

n,k = 63,45 t=1 Data awal:

Columns 1 through 10 : 0 0 1 1 1 0 1 1 0 0 Columns 11 through 20: 0 1 0 1 0 1 0 1 1 1 Columns 21 through 30: 1 1 0 0 0 1 0 1 0 1 Columns 31 through 40: 0 0 0 1 0 0 1 1 1 1 Columns 41 through 45: 0 1 1 0 1 Codeword: Columns 1 through 10 : 0 0 1 1 1 0 1 1 0 0 Columns 11 through 20: 0 1 0 1 0 1 0 1 1 1 Columns 21 through 30: 1 1 0 0 0 1 0 1 0 1 Columns 31 through 40: 0 0 0 1 0 0 1 1 1 1 Columns 41 through 50: 0 1 1 0 1 1 0 1 1 1 Columns 51 through 60: 1 0 0 1 0 1 1 1 0 1 Columns 61 through 63: 0 0 0 Codeword terkena error : Columns 1 through 10 : 0 0 1 0 1 0 1 1 0 0 Columns 11 through 20: 0 1 0 1 0 1 0 1 1 1 Columns 21 through 30: 1 1 0 0 0 1 0 1 0 1 Columns 31 through 40: 0 0 0 1 0 0 1 1 1 1 Columns 41 through 50: 0 1 1 0 1 1 0 1 1 1 Columns 51 through 60: 1 0 0 1 0 1 1 1 0 1 Columns 61 through 63: 0 0 0 Codeword error setelah proses pendekodean : Columns 1 through 10: 0 0 1 1 1 0 1 1 0 0 Columns 11 through 20: 0 1 0 1 0 1 0 1 1 1 Columns 21 through 30: 1 1 0 0 0 1 0 1 0 1 Columns 31 through 40: 0 0 0 1 0 0 1 1 1 1 Columns 41 through 50: 0 1 1 0 1 1 0 1 1 1 Columns 51 through 60: 1 0 0 1 0 1 1 1 0 1 Columns 61 through 63: 0 0 0 Dibagi dengan polinomial generator: Columns 1 through 10 0 0 1 1 1 0 1 1 0 0 Columns 11 through 20 0 1 0 1 0 1 0 1 1 1 Columns 21 through 30 1 1 0 0 0 1 0 1 0 1 Columns 31 through 40 0 0 0 1 0 0 1 1 1 1 Columns 41 through 45 0 1 1 0 1 Diperoleh data yang sama dengan data awal.

n,k = 63,45 t=2 Data awal:

Columns 1 through 10 0 0 0 1 0 0 1 0 0 0 Columns 11 through 20 0 0 1 1 1 0 0 0 1 0 Columns 21 through 30 0 0 1 1 1 0 1 0 1 0 Columns 31 through 40 1 0 0 1 1 0 1 1 0 0 Columns 41 through 45 0 0 1 1 1 Codeword : Columns 1 through 10 0 0 0 1 0 0 1 0 0 0 Columns 11 through 20 0 0 1 1 1 0 0 0 1 0 Columns 21 through 30 0 0 1 1 1 0 1 0 1 0 Columns 31 through 40 1 0 0 1 1 0 1 1 0 0 B.2 Columns 41 through 50 0 0 1 1 1 0 0 1 0 1 Columns 51 through 60 1 0 0 0 0 1 0 0 1 1 Columns 61 through 63 0 0 0 Codewrord terkena error: Columns 1 through 10 0 0 0 1 0 0 1 0 0 0 Columns 11 through 20 0 0 1 1 1 0 0 0 1 0 Columns 21 through 30 0 0 1 1 0 0 1 0 1 0 Columns 31 through 40 1 0 0 1 1 0 1 1 0 0 Columns 41 through 50 0 0 1 1 1 0 1 1 0 1 Columns 51 through 60 1 0 0 0 0 1 0 0 1 1 Columns 61 through 63 0 0 0 Codeword error setelah proses pendekodean : Columns 1 through 10 0 0 0 1 0 0 1 0 0 0 Columns 11 through 20 0 0 1 1 1 0 0 0 1 0 Columns 21 through 30 0 0 1 1 1 0 1 0 1 0 Columns 31 through 40 1 0 0 1 1 0 1 1 0 0 Columns 41 through 50 0 0 1 1 1 0 0 1 0 1 Columns 51 through 60 1 0 0 0 0 1 0 0 1 1 Columns 61 through 63 0 0 0 Dibagi dengan polinomial generator : Columns 1 through 10 0 0 0 1 0 0 1 0 0 0 Columns 11 through 20 0 0 1 1 1 0 0 0 1 0 Columns 21 through 30 0 0 1 1 1 0 1 0 1 0 Columns 31 through 40 1 0 0 1 1 0 1 1 0 0 Columns 41 through 45 0 0 1 1 1 Diperoleh data yang sama dengan data awal.

n,k = 63,45 t=3 Data awal:

Dokumen yang terkait

Analisis Perbandingan Kinerja Teknik Pengkodean Hamming Dan BCH Pada Sistem Komunikasi Digital

3 39 82

Kinerja Sistem Pengkodean Dengan Menggunakan Kode Inner Dan Kode Outer

0 18 6

Simulasi Teknik Pengkodean Regular Low Density Parity Check Code Pada Sistem MC-CDMA

6 35 83

Analisis Kinerja Kode BCH

0 43 100

SIMULASI KODE HAMMING, KODE BCH, DAN KODE REED-SOLOMON Simulasi Kode Hamming, Kode Bch, Dan Kode Reed-Solomon Untuk Optimalisasi Forward Error Correction.

0 2 15

PENDAHULUAN Simulasi Kode Hamming, Kode Bch, Dan Kode Reed-Solomon Untuk Optimalisasi Forward Error Correction.

0 3 5

SIMULASI KODE HAMMING, Simulasi Kode Hamming, Kode Bch, Dan Kode Reed-Solomon Untuk Optimalisasi Forward Error Correction.

1 2 18

Simulasi Pendekodean Error dan Erasure Menggunakan Algoritma Berlekamp Massey Untuk Kode Reed Solomon.

1 7 13

Evaluasi Kompleksitas Pendekodean MAP pada Kode BCH Berdasarkan Trellis Terbagi

0 0 8

SIMULASI PENYANDI DAN PENGAWASANDI SANDI BCH (15,7) DENGAN VISUAL C++ TUGAS AKHIR - Simulasi penyandi dan pengawasandi sandi BCH [15,7] dengan visual C++ - USD Repository

0 0 125