Abstract
The delivery of video over wireless, error-prone transmission channels requires careful allocation of channel and source code rates, given the available bandwidth. In this paper, we present a theoretical framework to find an optimal joint channel and source code rate allocation, by considering an intra-coded video compression standard such as Motion JPEG 2000 and an error-prone wireless transmission channel. Lagrangian optimization is used to find the optimal code rate allocation, from a PSNR perspective, starting from commonly available source coding outputs, such as intermediate rate-distortion traces. The algorithm is simple and adaptive both on the available bandwidth and on the transmission channel conditions, and it has a low computational complexity. Simulation results, using Reed-Solomon (R-S) coding, show that the achieved performance, in terms of PSNR and MSSIM, is comparable with that of other methods reported in literature. In addition, a simplified and sub-optimal expression for determining the channel code assignment is also provided.
Highlights
Many multimedia devices are being turned into complete entertainment centers, by taking profit of wireless transmission
Forward error correction (FEC) is generally adopted, and the channel code rate may be matched to compressed data error sensitivity, performing unequal error protection (UEP) [11,12,13]
We show how the algorithm can be practically applied, using JPEG 2000 source coding and R-S channel coding, and present some performance results expressed in terms of either PSNR or MSSIM
Summary
Many multimedia devices are being turned into complete entertainment centers, by taking profit of wireless transmission. Further details on this approximation are given in Appendix A.1 This approximation is correct when the channel error probability is lower than 10−1, as for higher values, the log-linear relationship does not prove to be valid; in such cases, any practical rate allocation/FEC method is hardly operational without increasing the channel coding redundancy to a limit beyond which the video quality is severely impaired by the high decoding latency and the low source code rate. Upon looking carefully at the solution (3) proposed in Lemma 1, it can be noticed that an additional condition to be satisfied is that ni ≥ k, 0 ≤ i < Nk, meaning that we cannot overprotect the pieces at the beginning, since there would be not enough bits to allocate for the last pieces, not even the source coding bits; especially at high symbol error probabilities, the protection profile, given the total bit budget, could be extremely unbalanced and might provide values lower than k.
Sign-in/Register to view highlights & summary Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
