Abstract
One of the most challenging tasks in the multimedia domain is the full high definition (FHD) video decoding. A high level data parallelization technique using group of pictures (GOP) concept is proposed in this paper for the implementation of the FHD video decoder. Though GOP level parallelism has advantages such as higher scalability and independent frame decoding possibility, its requirement of higher memory resources remains its main drawback. In order to solve the short comings related to the problem of memory issues, a new dynamic memory scheduling algorithm for GOP level parallelism is proposed. This paper focuses on techniques for optimizing the memory requirements and speedup of FHD video decoding with GOP level parallelism. Experimental results show that the proposed dynamic memory scheduling technique reduces elapsed time significantly making real time FHD video decoding possible. Further, the results show that the proposed technique does not result in frame skipping and degradation in video quality. With the proposed technique, speedup values of 1.96, 3.96 and 7.95 are obtained for 2, 4 and 8 core processors respectively which are almost equal to the theoretical values.
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.
