Residual Data Usage in LDPC Codes LDPC Kodlarinda Artik Veri Kullanimi


Creative Commons License

KAYA E., Pourmandi M., Haytaoglu E., Arslan S. S.

30th Signal Processing and Communications Applications Conference, SIU 2022, Safranbolu, Türkiye, 15 - 18 Mayıs 2022 identifier

  • Yayın Türü: Bildiri / Tam Metin Bildiri
  • Doi Numarası: 10.1109/siu55565.2022.9864789
  • Basıldığı Şehir: Safranbolu
  • Basıldığı Ülke: Türkiye
  • Anahtar Kelimeler: caching, device-to-device communication, distributed systems, erasure codes
  • Ankara Üniversitesi Adresli: Evet

Özet

© 2022 IEEE.In distributed storage systems/coded caching systems, padding operations should be performed when the encoded data cannot be divided by the number of storage nodes evenly. Thus, extra zero values are stored in one of the nodes to balance each node's storage content. In this study, distribution of data to storage nodes with no padding was investigated for distributed caching context in which a base station and devices both store the coded data. In other words, no redundancy (no-padding) is included into the encoded data. This approach is named as residual data distribution. LDPC codes are selected as the erasure code due to their low complexity encode/decode operations. Moreover, performance comparisons were conducted between using traditional data distribution approach (with padding) and using residual data (use of no-padding) (standard) in terms of repair time. In our work, the effect of no-padding data usage on the repair time and the ratios of storage savings have been also demonstrated.