MPEG Video Compression Standard

Mitchell, Joan L.; Pennebaker, William B.; Fogg, Chad E.; LeGall, Didier J.

doi:10.1007/b115884

Cited by 227 publications

(145 citation statements)

References 0 publications

Supporting

Mentioning

139

Contrasting

Unclassified

Order By: Relevance

“…We simulate approximately one hour of operation for the binary tree network for X=4, 8,12,16,20, 24 and 28 programs, and buffer=1, 2 and 5 ADUs of the maximum length. We present the simulation results for a bandwidth of 12.72 Mbps and for high, medium and low quality video.…”

Section: Experiments With High Medium and Low Quality Mpeg-4 Videosmentioning

confidence: 99%

Performance Evaluation of the Deadline Credit Scheduling Algorithm for Soft-Real-Time Applications in Distributed Video-on-Demand Systems

Alexandraki

Paterakis

2005

Cluster Comput

View full text Add to dashboard Cite

Video-on-Demand (VoD) systems are expected to support a variety of multimedia services to the users, such as tele-education, teleconference, remote working, videotelephony, highdefinition TV, etc. These applications necessitate abundant bandwidth and buffer space as well as appropriate software and hardware for the efficient manipulation of the network's resources.In this work we investigate a promising scheduling algorithm referred to as the Deadline Credit (DC) algorithm, which exploits the available bandwidth and buffer space to serve a diverse class of prerecorded video applications. We provide simulation results when the DC algorithm is applied to a hierarchical architecture distributed VoD network, which fits the existing tree topology used in today's cable TV systems. The issues investigated via the simulations are: the system utilization, the influence of the buffer space on the delivered Quality of Service, and the fairness of the scheduling mechanism. We examine cases with homogenous as well as diverse video streams, and extend our system to support interactive VCR-like functions. We also contribute a modification to the DC algorithm so that in cases when the video applications have different displaying periods, the video streams obtain a fair share of the network's resources. Finally, we validate our results by simulating actual videos encoded in MPEG-4 and H.263 formats.Keywords: Scheduling video applications, distributed VoD systems, MPEG-4, H.263, VCR-like operations. IntroductionTelecommunication networks have lately extended to support a variety of services to the users such as tele-education, teleconference, remote working, videotelephony, high-definition TV, web video streaming, etc. These applications dictate the need for high-speed networks, and also necessitate the appropriate software and hardware for the efficient integration of a diverse class of applications with different characteristics. These demanding requirements led to the concept of broadband integrated digital networks (B-ISDN), which are systems of high capabilities that enable the transmission of several different applications.Several research areas have been developed in order to increase the efficiency of the network and keep the Quality of Services (QoS) at a satisfactory level. One significant area that affects the quality provided by the network is the scheduling process. Since several applications should be concurrently serviced, the role of the scheduling process is to select each time the application that should be served next.The applications that telecommunication networks support are generally classified into two categories based on the delay that they can undergo during connection: the real time and the nonreal time applications. Real time applications involve a kind of interactivity and consequently can tolerate no delay. The characteristic of these applications is that the network's resources which provide the services need to be reserved for the duration of the connection. This necessitates ample bandwi...

show abstract

Section: Experiments With High Medium and Low Quality Mpeg-4 Videosmentioning

confidence: 99%

Performance Evaluation of the Deadline Credit Scheduling Algorithm for Soft-Real-Time Applications in Distributed Video-on-Demand Systems

Alexandraki

Paterakis

2005

Cluster Comput

View full text Add to dashboard Cite

show abstract

“…Many real-world real-time systems, especially embedded systems, are frame-based, such as tasks decoding MPEG video streaming. Decoding MPEG video streaming involves a series of steps: entropy decoding, IDCT (inverse discrete cosine transform), motion compensation, and dithering [13]. Many researches [14]- [20] have been done to cut down the energy bill for frame-based real-time systems.…”

Section: Introductionmentioning

confidence: 99%

Energy-Aware Task Scheduling for Real-Time Systems with Discrete Frequencies

Qian¹,

Zhang²,

Hu³

et al. 2011

IEICE Trans. Inf. & Syst.

View full text Add to dashboard Cite

SUMMARYPower-aware scheduling of periodic tasks in real-time systems has been extensively studied to save energy while still meeting the performance requirement. Many previous studies use the probability information of tasks' execution cycles to assist the scheduling. However, most of these approaches adopt heuristic algorithms to cope with realistic CPU models with discrete frequencies and cannot achieve the globally optimal solution. Sometimes they even show worse results than non-stochastic DVS schemes. This paper presents an optimal DVS scheme for framebased real-time systems under realistic power models in which the processor provides only a limited number of speeds and no assumption is made on power/frequency relation. A suboptimal DVS scheme is also presented in this paper to work out a solution near enough to the optimal one with only polynomial time expense. Experiment results show that the proposed algorithm can save at most 40% more energy compared with previous ones.

show abstract

“…This section presents a method for mapping array-based onto FIFO-based communication in an efficient way. We will use the example of MPEG video [6] communication to explain the basic principles.…”

Section: From Specification To Implementationmentioning

confidence: 99%

“…In our case study, we concentrated on the communication between the frontend and the compressor. The input buffer also performs some reshuffling of the incoming frames (this is part of the MPEG standard for IPB GOPs [6]); in this sense it is not strictly a FIFO.…”

Section: Case Study: Mpeg Encoder's Frontendcompressor Communicationmentioning

confidence: 99%