On the Performance of Tanner Graph Based and Viterbi Decoding for Erasure Recovery

Muhammad Moazam Azeem 1 Abdul Baqi Khan Uzma Azeem
1 SYEL - Systèmes Electroniques
LIP6 - Laboratoire d'Informatique de Paris 6
Abstract : We address the utilization of short erasure correcting codes to recover the erased data in opportunistic spectrum access (OSA) due to collisions among multiple users. The main application of using short codes over long codes is to avoid long delays in the network. Various erasure correcting codes are envisioned and their decoding methods are compared to analyze the erasure recovery capability. The decoding performance of Tanner graph based approach is compared with the Exhaustive search based approach that achieves the maximum achievable performance. With the use of extended H matrix there is a huge gain in erasure recovery of lost data and this performance is comparable with Exhaustive search. The Viterbi decoding for erasure recovery is also described with examples and the three techniques are compared to analyze the decoding complexity.
Type de document :
Communication dans un congrès
VTC Fall 2015 - IEEE 82nd Vehicular Technology Conference, Sep 2015, Boston, MA, United States. IEEE, pp.1-5, 2015, 〈10.1109/VTCFall.2015.7391048〉
Liste complète des métadonnées

http://hal.upmc.fr/hal-01657923
Contributeur : Muhammad Moazam Azeem <>
Soumis le : jeudi 7 décembre 2017 - 11:24:48
Dernière modification le : mercredi 21 mars 2018 - 18:58:09

Identifiants

Collections

Citation

Muhammad Moazam Azeem, Abdul Baqi Khan, Uzma Azeem. On the Performance of Tanner Graph Based and Viterbi Decoding for Erasure Recovery. VTC Fall 2015 - IEEE 82nd Vehicular Technology Conference, Sep 2015, Boston, MA, United States. IEEE, pp.1-5, 2015, 〈10.1109/VTCFall.2015.7391048〉. 〈hal-01657923〉

Partager

Métriques

Consultations de la notice

38