Design of Finite-Length Precoded EWF Codes for Scalable Video Streaming
Authors: 
Lei Yuan, Keyan Deng, Huaan LiAuthors Info & Claims
Pages 4111 - 4128
Abstract
Expanding window fountain (EWF) codes, which can provide unequal erasure protection property, are used as an efficient application-layer forward error correction solution for scalable multimedia data transmission over packet networks. Similar to Raptor codes, precoded EWF codes can provide linear coding complexity. However, only when the information length is large, the precoded EWF codes in previous literatures can achieve good performance. In this paper, we carefully investigate how to choose code rates of precodes and degree distributions of EWF codes for different information lengths. Our proposed precoded EWF coding scheme can achieve superior performance compared to the previous scheme for small and moderate information lengths. Simulation results for the scalable video coding extension of the H.264/AVC standard show that, compared with the previous scheme, our proposed scheme requires a smaller reception overhead to recover the base layer.
References
[1]
Mirrezaei, S., Faez, K., & Yousefi, S. (2014). Towards fountain codes. Wireless Personal Communications, 77(2), 1533---1562.
[2]
Luby, M. (2002). LT codes. In Proceedings of the 43rd annual IEEE symposium on foundations of computer science (FOCS), Vancouver, BC, Canada, November (pp. 271---280).
[3]
Shokrollahi, A. (2006). Raptor codes. IEEE Transactions on Information Theory, 52(6), 2551---2567.
[4]
Shokrollahi, A., & Luby, M. (2011). Raptor codes. Foundations and trends® in communications and information theory (Vol. 6, 122 p). Boston, MA: Now Publishers Inc.
[5]
Etesami, O., & Shokrollahi, A. (2006). Raptor codes on binary memoryless symmetric channels. IEEE Transactions on Information Theory, 52(5), 2033---2051.
[6]
Sivasubramanian, B., & Leib, H. (2008). Fixed-rate Raptor codes over Rician fading channels. IEEE Transactions on Vehicular Technology, 57(6), 3905---3911.
[7]
Tian, S., Li, Y., Shirvanimoghaddam, M., & Vucetic, B. (2013). A physical-layer rateless code for wireless channels. IEEE Transactions on Communications, 61(6), 2117---2127.
[8]
Taubman, D., & Marcellin, M. (2001). JPEG2000: Image compression fundamentals, standards and practice. Berlin: Kluwer Academic Publishers.
[9]
Schwarz, H., Marpe, D., & Wiegand, T. (2007). Overview of the scalable video coding extension of the H.264/AVC standard. IEEE Transactions on Circuits and Systems for Video Technology, 17(9), 1103---1120.
[10]
Aydinlik, M., & Salehi, M. (2008). Turbo coded modulation for unequal error protection. IEEE Transactions on Communications, 56(4), 555---564.
[11]
Rahnavard, N., Pishro-Nik, H., & Fekri, F. (2007). Unequal error protection using partially regular LDPC codes. IEEE Transactions on Communications, 55(3), 387---391.
[12]
Gong, C., Yue, G., & Wang, X. (2011). Message-wise unequal error protection based on low-density parity-check codes. IEEE Transactions on Communications, 59(4), 1019---1030.
[13]
Arslan, S. S., Cosman, P. C., & Milstein, L. B. (2012). Concatenated block codes for unequal error protection of embedded bit streams. IEEE Transactions on Image Processing, 21(3), 1111---1122.
[14]
Condo, C., Masera, G., & Montuschi, P. (2015). Unequal error protection of memories in LDPC decoders. IEEE Transactions on Computers, 64(10), 2981---2993.
[15]
Rahnavard, N., Vellambi, B. N., & Fekri, F. (2007). Rateless codes with unequal error protection property. IEEE Transactions on Information Theory, 53(4), 1521---1532.
[16]
Hsiao, H.-F., & Ciou, Y.-J. (2014). Layer-aligned multipriority rateless codes for layed video streaming. IEEE Transactions on Multimedia, 24(8), 1395---1404.
[17]
Cataldi, P., Grangetto, M., Tillo, T., Magli, E., & Olmo, G. (2010). Sliding window raptor codes for efficient scalable wireless video broadcasting with unequal loss protection. IEEE Transactions on Image Processing, 19(6), 1491---1503.
[18]
Sejdinović, D., Vukobratović, D., Doufexi, A., ?enk, V., & Piechocki, R. J. (2009). Expanding window fountain codes for unequal error protection. IEEE Transactions on Communications, 57(9), 2510---2516.
[19]
Vukobratović, D., Stanković, V., Sejdinović, D., Stanković, L., & Xiong, Z. (2009). Scalable video multicast using expanding window fountain codes. IEEE Transactions on Multimedia, 11(6), 1094---1104.
[20]
Vukobratović, D., Stanković, V., Stanković, L., & Sejdinović, D. (2009). Precoded EWF codes for unequal error protection of scalable video. In Proceedings of the 5th international ICST mobile multimedia communications conference 2009, London, UK, September.
[21]
Stefanović, Č., Vukobratović, D., Chiti, F., Niccolai, L., Crnojević, V., & Fantacci, R. (2011). Urban infrastructure-to-vehicle traffic data dissemination using UEP rateless codes. IEEE Journal on Selected Area in Communications, 29(1), 94---102.
[22]
Arslan, S. S., Cosman, P. C., & Milstein, L. B. (2012). Generalized unequal error protection LT codes for progressive data transmission. IEEE Transactions on Image Processing, 21(8), 3586---3597.
[23]
Ahmad, S., Hamzaoui, R., & Al-Akaidi, M. (2011). Unequal error protection using fountain codes with applications to video communication. IEEE Transactions on Multimedia, 13(1), 92---101.
[24]
Yen, K.-K., Liao, Y.-C., Chen, C.-L., Zao, J., & Chang, H.-C. (2013). Integrating non-repetitive LT encoders with modifined distribution to achieve unequal erasure protection. IEEE Transactions on Multimedia, 15(8), 2162---2175.
[25]
Yuan, L., & An, J. (2010). Design of UEP-Raptor codes over BEC. European Transactions on Telecommunications, 21, 30---34.
[26]
Talari, A., & Rahnavard, N. (2012). On the intermediate symbol recovery rate of rateless codes. IEEE Transactions on Communications, 60(5), 1237---1242.
[27]
Luby, M., Mitzenmacher, M., & Shokrollahi, A. (1998). Analysis of random processes via and-or tree evaluation. In Proceedings of the 9th annual ACM-SIAM symposium discrete algorithms (SODA), January (pp. 364---373).
[28]
Johnson, S. J. (2009). Iterative error correction: Turbo, low-density parity-check and repeat-accumulate codes. Cambridge: Cambridge University Press.
[29]
Li, H., & Marsland, I.D. (2008). A comparison of rateless codes at short block lengths. In IEEE international conference on communications (ICC) (pp. 4483---4488).
[30]
Deb, K., Pratap, A., Agarwal, S., & Meyarivan, T. (2002). A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Transactions on Evolutionary Computation, 6(2), 182---197.
[31]
Richardson, T., & Urbanke, R. (2008). Modern coding theory. Cambridge: Cambridge University Press.
[32]
Hu, X.-Y., Eleftheriou, E., & Arnold, D. M. (2005). Regular and irregular progressive edge-growth tanner graphs. IEEE Transactions on Information Theory, 51(1), 386---398.
Index Terms
- Design of Finite-Length Precoded EWF Codes for Scalable Video Streaming
Index terms have been assigned to the content through auto-classification.
Recommendations
Precoded EWF codes for unequal error protection of scalable video
Mobimedia '09: Proceedings of the 5th International ICST Mobile Multimedia Communications ConferenceRateless codes are forward error correcting (FEC) codes of linear encoding-decoding complexity and asymptotically capacity-approaching performance over erasure channels with any erasure statistics. They have been recently recognized as a simple and ...
Finite-length rate-compatible LDPC codes: a novel puncturing scheme
In this paper, we study rate-compatible puncturing of finite-length low-density parity-check (LDPC) codes. We present a novel rate-compatible puncturing scheme that is easy to implement. Our scheme uses the idea that the degradation in performance is ...
Distributed SR-LDPC codes over multiple-access relay channel and its applications in cloud storage
Digital fountain techniques have received significant academics and industry attention in the past years because of their rateless, robust, and real-time characteristics used in networks and storage systems such as cloud data storage. Semi-Random low-...
Comments
Please enable JavaScript to view thecomments powered by Disqus.Information & Contributors
Information
Published In
Copyright © Copyright © 2017 Springer Science+Business Media, LLC, part of Springer Nature.
Publisher
Kluwer Academic Publishers
United States
Publication History
Published: 01 December 2017
Author Tags
Qualifiers
- Article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 0Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Reflects downloads up to 11 Dec 2024
Other Metrics
Citations
View Options
View options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in