Low complexity H.264 list decoder for ...
Type de document :
Communication dans un congrès avec actes
Titre :
Low complexity H.264 list decoder for enhanced quality real-time video over IP
Auteur(s) :
Golaghazadeh, Firouzeh [Auteur]
Ecole de Technologie Supérieure [Montréal] [ETS]
Coulombe, Stephane [Auteur]
Ecole de Technologie Supérieure [Montréal] [ETS]
Coudoux, François-Xavier [Auteur]
Institut d’Électronique, de Microélectronique et de Nanotechnologie - UMR 8520 [IEMN]
COMmunications NUMériques - IEMN [COMNUM - IEMN]
Corlay, Patrick [Auteur]
Institut d’Électronique, de Microélectronique et de Nanotechnologie - UMR 8520 [IEMN]
COMmunications NUMériques - IEMN [COMNUM - IEMN]
Ecole de Technologie Supérieure [Montréal] [ETS]
Coulombe, Stephane [Auteur]
Ecole de Technologie Supérieure [Montréal] [ETS]
Coudoux, François-Xavier [Auteur]
Institut d’Électronique, de Microélectronique et de Nanotechnologie - UMR 8520 [IEMN]
COMmunications NUMériques - IEMN [COMNUM - IEMN]
Corlay, Patrick [Auteur]

Institut d’Électronique, de Microélectronique et de Nanotechnologie - UMR 8520 [IEMN]
COMmunications NUMériques - IEMN [COMNUM - IEMN]
Titre de la manifestation scientifique :
2017 IEEE 30th Canadian Conference on Electrical and Computer Engineering (CCECE)
Ville :
Windsor
Pays :
Canada
Date de début de la manifestation scientifique :
2017-04-30
Éditeur :
IEEE
Mot(s)-clé(s) en anglais :
"Maximum likelihood decoding"
"Receivers"
"IP networks"
"Streaming media"
"Protocols"
"Error correction"
"Receivers"
"IP networks"
"Streaming media"
"Protocols"
"Error correction"
Discipline(s) HAL :
Informatique [cs]
Informatique [cs]/Réseaux et télécommunications [cs.NI]
Informatique [cs]/Intelligence artificielle [cs.AI]
Sciences de l'ingénieur [physics]
Sciences de l'ingénieur [physics]/Traitement du signal et de l'image [eess.SP]
Sciences de l'ingénieur [physics]/Electronique
Informatique [cs]/Réseaux et télécommunications [cs.NI]
Informatique [cs]/Intelligence artificielle [cs.AI]
Sciences de l'ingénieur [physics]
Sciences de l'ingénieur [physics]/Traitement du signal et de l'image [eess.SP]
Sciences de l'ingénieur [physics]/Electronique
Résumé en anglais : [en]
This paper presents a novel list decoding approach exploiting the receiver side user datagram protocol (UDP) checksum. The proposed method identifies the possible locations of errors in the packet by analyzing the calculated ...
Lire la suite >This paper presents a novel list decoding approach exploiting the receiver side user datagram protocol (UDP) checksum. The proposed method identifies the possible locations of errors in the packet by analyzing the calculated UDP checksum value at the receiver side. This makes it possible to considerably reduce the number of candidate bitstreams in comparison to conventional list decoding approaches. When a packet composed of N bits contains a single bit in error, instead of considering N candidate bitstreams, as is the case in conventional list decoding approaches, the proposed approach considers N/32 candidate bitstreams, leading to a 97% reduction in the number of candidates. Our simulation results on H.264 compressed sequences reveal that, on average, the error is corrected perfectly 80% of the time, and thus, the original bitstream is fully recovered when the first valid candidate is considered as the best candidate. In addition, the proposed approach provides, on average, a 2.78 dB gain over the error concealment approach used by the H.264 reference software, as well as 1.31 dB and 1.51 dB gains over the state-of-the-art error concealment and HO-MLD approaches, respectivelyLire moins >
Lire la suite >This paper presents a novel list decoding approach exploiting the receiver side user datagram protocol (UDP) checksum. The proposed method identifies the possible locations of errors in the packet by analyzing the calculated UDP checksum value at the receiver side. This makes it possible to considerably reduce the number of candidate bitstreams in comparison to conventional list decoding approaches. When a packet composed of N bits contains a single bit in error, instead of considering N candidate bitstreams, as is the case in conventional list decoding approaches, the proposed approach considers N/32 candidate bitstreams, leading to a 97% reduction in the number of candidates. Our simulation results on H.264 compressed sequences reveal that, on average, the error is corrected perfectly 80% of the time, and thus, the original bitstream is fully recovered when the first valid candidate is considered as the best candidate. In addition, the proposed approach provides, on average, a 2.78 dB gain over the error concealment approach used by the H.264 reference software, as well as 1.31 dB and 1.51 dB gains over the state-of-the-art error concealment and HO-MLD approaches, respectivelyLire moins >
Langue :
Anglais
Comité de lecture :
Oui
Audience :
Internationale
Vulgarisation :
Non
Source :
Fichiers
- http://espace2.etsmtl.ca/id/eprint/15283/1/Coulombe%20S%202017%2015283.pdf
- Accès libre
- Accéder au document
- Coulombe%20S%202017%2015283.pdf
- Accès libre
- Accéder au document