Komunikasi Baseband

Dr. Suherman
T.Elektro-USU

Diadaptasi dari:
 NRZ–L Non-return-to-zero level. This is the standard positive logic forces a high level forces a low level
signal format used in digital circuits.

NRZ–M Non-return-to-zero mark forces a transition does nothing (keeps

sending the previous
level)
NRZ–S Non-return-to-zero space does nothing (keeps sending forces a transition
the previous level)

RZ Return to zero goes high for half the bit stays low for the entire
period and returns to low period

Biphase–L Manchester. Two consecutive bits of the same type force a forces a negative transition forces a positive
transition at the beginning of a bit period. in the middle of the bit transition in the middle
of the bit

Biphase–M Variant of Differential Manchester. There is always a forces a transition keeps level constant
transition halfway between the conditioned transitions.

Biphase–S Differential Manchester used in Token Ring. There is always keeps level constant forces a transition
a transition halfway between the conditioned transitions.

Differential Need a Clock, always a transition in the middle of the clock is represented by no is represented by a
Manchester period transition. transition at the
(Alternative) beginning of the clock
period.
Bipolar The positive and negative pulses alternate. forces a positive or negative keeps a zero level during
pulse for half the bit period bit period

10.2
10.3
Setelah lapisan fisik dapat menjamin bit 1
dan bit 0 dapat dikirim dari 1 titik ke titik
Lain, muncul masalah lain:
- Bagaimana membedakan penggalan infor-
masi dari urutan bit: 0101011111000100111
- Bagaimana jika 1 atau lebih bit error (dise-
babkan pelemahan sinyal, distorsi, noise
dan interferensi).
- Bagaimana memperbaiki error tersebut.
 Solusi membedakan simbol 1 dengan yg lain:
1. Bit start dan stop

10.5
 Solusi membedakan simbol 1 dengan yg lain:
2. Mendeteksi error: parity bit

7 bits of data 8 bits including parity

bit
(number of 1s)
Even Odd

0000000 (0) 00000000 10000000

1010001 (3) 11010001 01010001

1101001 (4) 01101001 11101001

1111111 (7) 11111111 01111111

10.6
Error single vs burst

Parity hanya dapat mendeteksi 1 error

Redundant generation
Hamming distance

Minimum Hamming distance

Untuk menjamin s error terdeteksi, maka minimum Hamming distance harus

dmin >= s + 1.
Untuk menjamin s error terkoreksi, maka minimum Hamming distance harus
dmin >= 2s + 1.
Sebuah kode memiliki Hamming distance d min = 4. Berapa kemampuan deteksi error dan
koreksi error kode ini?
Sebuah kode memiliki Hamming distance d min = 4. Berapa kemampuan deteksi error dan
koreksi error kode ini?

Jawaban
Memiliki kemampuan deteksi error 3 dan kemampuan koreksi 1

Catatan:
Kemampuan kode terbuang, karena 3 yang terdeteksi, hanya 1 dapat dikoreksi.

Rekomendasi
Minimum distance harus ganjil 3, 5, 7, . . . dst
Kode Blok Linier
- Hasil modulo 2 codeword non zero menghasilkan
codeword juga. Contoh: 011101=110
- Agar codeword berikut merupakan kode blok linier, maka
000 harus dihilangkan
- Hamming distance is the number of 1s in the nonzero valid
codeword with the smallest number of 1s.
Parity-check code C(5, 4)
 Two-dimensional parity-check code

10.14
 Two-dimensional parity-check code

10.15
Two-dimensional parity-check code

Dapat mendeteksi 3 error, hanya mampu mengoreksi 1 error

Hamming code C(7, 4) C(n,k) dmin=3
Hamming Code
 Parity checks
 r0 = a2  a1  a0

 r1 = a3  a2  a1

 r2 = a1  a0  a3
Hamming Code
 The checker in the decoder creates a 3-bit syndrome
(s2s1s0).
 In which each bit is the parity check for 4 out of the 7
bits in the received codeword:
 s0 = b2 + b1 + b0 + q0
 s1 = b3 + b2 + b1 + q1
 s2 = b1 + b0 + b3 + q2
 The equations used by the checker are the same as
those used by the generator with the parity-check bits
added to the right-hand side of the equation.
 Table 10.5 Logical decision made by the correction logic analyzer

Hamming code C(7, 4) can :

• detect up to 2-bit error (dmin -1)
• can correct up to 1 bit error (dmin-1)/2

10.20
Burst error correction using Hamming code

Split burst error between multiple codewords

Kode Siklik
- Kode siklik adalah kode blok linier dengan pergeseran rotasi
Cyclic Redundancy Check (CRC) code with C(7, 4)
CRC encoder and decoder
Division in CRC encoder
 Figure 10.16 Division in the CRC decoder for two cases

10.26
 Data: 1000 Divisor: 1011
What is the codeword?

10.27
 Data: 1010 Divisor: 10111
What is the codeword?

10.28
 Data: 1010 Divisor: 10111
What is the codeword?

10.29
The CRC encoder design using shift registers

Divisor: 1011
Dataword: 1001
General design of encoder and decoder of a CRC code
Divisor/generator polynomial/generator.
Standard polynomials
Checksum
- Checksum adalah kode cek kesalahan dengan menjumlah
kan blok data dalam lipatan tertentu.
- Contoh: data panjang dikonversi menjadi desimal:
(7, 11, 12, 0, 6). Yang dikirim (7, 11, 12, 0, 6, -36), angka 36
adalah hasil penjumlahan data, yang kemudian dikomplimen
kan menjadi -36.
- Di penerima, data dijumlahkan kembali (36), jika dijumlahkan
dengan redundant hasilnya 0, maka data valid.
Data wrapping, melipat data
- Jika data dilipat 4 bit. Data 21 (10101), dilipat 4 bit menjadi
- (0101 + 1) = 0110 atau 6.

Data compliment:
- jika data 0110 maka complimentnya 1001.
 1 1
1 0
Internet Checksum
- Panjang wrap/lipatan 16-bit.
- Nilai checksum diset 0.
- Semua data termasuk checksum ditambah dengan
tambahan satu komplimen
- Jumlahnya dikomplimenkan dan menjadi checksum.
- Checkcum dikirim bersama data

- Pada penerima, proses diulang, jika hasilnya 0, maka data

valid.
 Internet Checksum Di pengirim
 Contoh data 32 bit. Dibagi menjadi 2 penggalan 16
bit, kemudian dijumlahkan. Kelebihan 1 bit di wrap
dijumlahkan kembali.
1 1 1 1 0 0 1 1 0 0 1 1 0 0 1 1 0
1 1 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1

wraparound 11 0 1 1 1 0 1 1 1 0 1 1 1 0 1 1
2 1

sum 1 1 0 1 1 1 0 1 1 1 0 1 1 1 1 0 0
checksum 1 0 1 0 0 0 1 0 0 0 1 0 0 0 0 1 1
 Internet Checksum Di penerima
 Contoh data 32 bit. Dibagi menjadi 2 penggalan 16
bit, kemudian dijumlahkan. Kelebihan 1 bit di wrap
dijumlahkan kembali.
1 1 1 1 0 0 1 1 0 0 1 1 0 0 1 1 0
1 1 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1

wraparound 11 0 1 1 1 0 1 1 1 0 1 1 1 0 1 1
2 1

Jumlah data1 1 0 1 1 1 0 1 1 1 0 1 1 1 1 0 0
checksum 1 0 1 0 0 0 1 0 0 0 1 0 0 0 0 1 1

Data + checksum 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1
Compliment 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0