1 / 21

Jaringan Komputer I

Jaringan Komputer I. Materi 3 Lapis Fisik Sinkronisasi dan Kompresi. Jenis Sinkronisasi. Asynchronous. Synchronous. Isochronous. Sinkronisasi Bit. Sinkronisasi Karakter. Sinkronisasi Karakter. STX. SYN. SYN. ETX. Sinkronisasi. Isi Frame. karakter. SYN. SYN. SYN.

murray
Download Presentation

Jaringan Komputer I

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Jaringan Komputer I Materi 3 Lapis Fisik Sinkronisasi dan Kompresi

  2. JenisSinkronisasi

  3. Asynchronous

  4. Synchronous

  5. Isochronous

  6. Sinkronisasi Bit

  7. SinkronisasiKarakter

  8. Sinkronisasi Karakter STX SYN SYN ETX Sinkronisasi Isi Frame karakter SYN SYN SYN - - - - 0 0|0 1 1 0|1|0|0|0|0 1 1 0|1|0|0|0|0 1 1 0 1 0 0 0|0 1 0 0 0 0 0 0|0 1 1 0 - - - - STX - Memasuki mode Penerima Hunt telah selesai sinkronisasi Deteksi karakter kar. SYN SYN SYN DLE STX DLE ETX Tanda Sinkronisasi Tanda Mulai Isi Frame Berakhir karakter Frame Frame

  9. Table ASCII SYN NUL NUL NUL STXR J G H K L I Y H K L S J H F U Y U W I EETX NUL NUL NUL SYN SYN 16 00 00 00 02 52 4A 47 48 4B 4C 53 …..45 03 00 00 00 16 16

  10. Sinkronisasi Frame

  11. LangkahPengkodean Huffman

  12. Contoh Pengkodean Huffman • A = 00, M = 11, N = 011, I = 100, S = 0101 ,Y = 01000, G = 01001, K = 1010, L= 1011 • SAYA INGIN MAKAN MALAM = 0101000100000100011010011000111100101000011110010110011

  13. Entropi • Nilai yang menyatakankepadatansuatukompresi, ataukepadataninformasi • Nilai rata-rata bit/karakter • Misal ADAAPA  A = 1 D=01 P=00 Entropi = {(4x1) + (1x2) + (1x2)}/6 = 8/6 = 1.33 • NilaiEntropi > 1

  14. Komunikasiberbasis bit • Pengkodean Huffman membawapeluangkomunikasidibawasebagaideretan bit yang bukan n*8 bit, sehinggadiperlukanteknikkomunikasi lain yang disebutkomunikasiberbasis bit • Data : 101010111111011011100000001111111111000001 • Perlutanda (flag) sebagaiawaldanakhir : 01111110 • Dikirim01101000111111010101011111010110111000000011111011111000000101111110101100011

More Related