Ekleme ve silme kanallarında birleştirilmiş kodlar için derin öğrenme tabanlı kod çözücüler
Bu tez size mi ait?
Bu kayıt toplu arşivden geldi. Sizinse profilinize bağlayın.
Özet (EN)
Channels with synchronization errors, including insertion/deletion channels, are of significant importance, as they are encountered in various systems, such as communication networks and various storage technologies, including DNA data storage. Serially concatenated codes where the outer code is a powerful channel code, such as a low-density parity-check (LDPC) or convolutional code, and the inner code is a watermark or marker code, are shown to be effective solutions over such channels. In particular, the use of marker codes, referring to insertion of preselected sequences in the transmitted data stream periodically, are shown to work well in regaining synchronization at the receiver and achieving improved error rate performance compared to other alternatives. In the current literature, maximum a posteriori (MAP) detector realized by the well-known forward-backward algorithm is commonly employed to decode the inner marker code and estimate the log-likelihood ratios (LLRs) of the bits encoded by the outer code, and the resulting log-likelihood estimates are fed to the outer decoder to estimate the transmitted data. Alternative to the MAP detector, this thesis proposes deep learning-based solutions to estimate the LLRs of the coded bits in the paradigm of concatenated codes, exploiting the marker information and addressing some limitations of conventional methods. Bit-level deep learning-based detectors offer good alternatives when the channel statistics are not perfectly available at the decoder, degrading of the performance of the MAP detector. They can also be employed for one-shot decoding when the outer code is a convolutional code. Also developed are symbol-level deep learning-based detectors to exploit the correlations among adjacent bits at the detector output. Contrary to the existing symbol-level decoders for insertion/deletion channels, the newly proposed approaches can go beyond the case of combining three bits, offering further enhancements in performance while keeping the complexity tolerable. As a final contribution, deep learning-based detectors are developed for insertion and deletion channels that are further exacerbated by inter-symbol interference, e.g., modeling bit-patterned media recording channels, and their performance is studied via numerical examples.
Yazar
Eksal Uras Kargı
Kurum
Bu Yayına Nasıl Atıf Yapılır
Eksal Uras Kargı (Master Thesis). Ekleme ve silme kanallarında birleştirilmiş kodlar için derin öğrenme tabanlı kod çözücüler, 2025, İhsan Doğramacı Bilkent University.
Anahtar Kelimeler
Lisans
Tüm Hakları Saklıdır
Bu eser belirtilen lisans koşulları altında paylaşılmaktadır.
İhsan Doğramacı Bilkent University tezlerinden daha fazlası
- Osmanlı Devletinde vergi ve vergi etrafında oluşan ilişkiler üzerine bir çalışma (16.-17. yüzyıllar)(2019)
- Rastsal kümeler ve choquet-tip temsiller(2021)
- Petrol fiyatları ve getiri eğrisi(2024)
- Yalnız yaşamak: Yollar, deneyimler ve gelecek beklentileri(2025)
- Detente dönemine doğru: Johnson Mektubunun ardından Türk dış politikası(2021)
- Geç Antik Çağ'da Aşağı Tuna: Histria örneği(2023)
