Robust critical data recovery for MPEG-4 AAC encoded bitstreams

Hu, Ruijing; Huang, Xucen; Kieffer, Michel; Derrien, Olivier; Duhamel, Pierre

doi:10.1109/icassp.2010.5495793

Cited by 4 publications

(2 citation statements)

References 21 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In this work, all headers were assumed error-free. This may be obtained by using strong FEC for the headers or JSC decoding techniques for the reliable estimation of headers, such as those presented in [23].…”

Section: Discussionmentioning

confidence: 99%

Robust decoding of a 3D-ESCOT bitstream transmitted over a noisy channel

Abid

Kieffer

Cagnazzo

et al. 2010

2010 IEEE International Conference on Image Processing

View full text Add to dashboard Cite

In this paper, we propose a joint source-channel (JSC) decoding scheme for 3D ESCOT-based video coders, such as Vidwav. The embedded bitstream generated by such coders is very sensitive to transmission errors unavoidable on wireless channels. The proposed JSC decoder employs the residual redundancy left in the bitstream by the source coder combined with bit reliability information provided by the channel or channel decoder to correct transmission errors. When considering an AWGN channel, the performance gains are in average 4 dB in terms of PSNR of the reconstructed frames, and 0.7 dB in terms of channel SNR. When considering individual frames, the obtained gain is up to 15 dB in PSNR.

show abstract

Section: Discussionmentioning

confidence: 99%

Robust decoding of a 3D-ESCOT bitstream transmitted over a noisy channel

Abid

Kieffer

Cagnazzo

et al. 2010

2010 IEEE International Conference on Image Processing

View full text Add to dashboard Cite

show abstract

“…The trellis computation originates from a work led at Alcatel Lucent [13,14]. It consists of a rewrite in C of a portion of C++ code whose purpose is to compute the checksum of AAC packet headers coming from an unreliable network.…”

Section: A 40% Improvement With Trellis Computationmentioning

confidence: 99%

An Improvement of OpenMP Pipeline Parallelism with the BatchQueue Algorithm

Preud'Homme

Sopena

Thomas

et al. 2012

2012 IEEE 18th International Conference on Parallel and Distributed Systems

View full text Add to dashboard Cite

In the context of multicore programming, pipeline parallelism is a solution to easily transform a sequential program into a parallel one without requiring a whole rewriting of the code. The OpenMP stream-computing extension presented by Pop and Cohen proposes an extension of OpenMP to handle pipeline parallelism. However, their communication algorithm relies on Multiple-producer-Multiple-Consumer queues, while pipelined applications mostly deal with linear chains of communication, i.e., with only a single producer and a single consumer.To improve the performance of the OpenMP streamextension, we propose to add a more specialized SingleProducer-Single-Consumer communication algorithm called BatchQueue and to select it for one-to-one communication. Our evaluation shows that BatchQueue is then able to improve the throughput up to a factor 2 on an 8-core machine both for example application and real applications. Our study shows therefore that using specialized and efficient communication algorithms can have a significant impact on the overall performance of pipelined applications.

show abstract

Joint Source-Channel Coding and Decoding

Kieffer

Duhamel

2014

Academic Press Library in Mobile and Wireless Communications

View full text Add to dashboard Cite

Robust critical data recovery for MPEG-4 AAC encoded bitstreams

Cited by 4 publications

References 21 publications

Robust decoding of a 3D-ESCOT bitstream transmitted over a noisy channel

Robust decoding of a 3D-ESCOT bitstream transmitted over a noisy channel

An Improvement of OpenMP Pipeline Parallelism with the BatchQueue Algorithm

Joint Source-Channel Coding and Decoding

Contact Info

Product

Resources

About