Title of Invention

METHOD AND APPARATUS FOR FRAME PREDICTION IN HYBRID VIDEO COMPRESSION TO ENABLE TEMPORAL SCALABILITY

Abstract A method of encoding multimedia frames, comprising encoding a removable temporal scaling frame by unidirectionally backward predicting the removable temporal scaling frame with respect to a display order, wherein the removable temporal scaling frame is not used for predicting any other frame. Fig.1
Full Text METHOD AND APPARATUS FOR FRAME PREDICTION IN HYBRID VIDEO COMPRESSION TO ENABLE TEMPORAL
SCALABILITY
Claim of Priority under 35 U.S.C. ยง119
[0001] The present Application for Patent claims priority to Provisional Application No. 60/560,433 entitled "METHOD AND APPARATUS FOR PREDICTION FRAME IN HYBRID VIDEO COMPRESSION TO ENABLE TEMPORAL SCALABILITY" filed April 7, 2004 and Provisional Application No. 60/625,700 entitled "METHOD AND APPARATUS FOR PREDICTION FRAME IN HYBRID VIDEO COMPRESSION TO ENABLE TEMPORAL SCALABILITY" filed November 4, 2004, and assigned to the assignee hereof and hereby expressly incorporated by reference herein.
BACKGROUND Field
[0002] This invention relates to methods, apparatus and systems for distributing digital data encoded in a way to provide temporal scalability.
Background
[0003] Due to the explosive growth and great success of the Internet and wireless communication, as well as increasing demand for multimedia services, streaming media over the Internet and mobile/wireless channels has drawn tremendous attention. In heterogeneous Internet Protocol (IP) networks, video is provided by a server and can be streamed by one or more clients. Wired connections include dial-up, integrated services digital network (ISDN), cable, digital subscriber line protocols (collectively referred to as xDSL), fiber, local area networks (LAN), wide area networks (WAN) and others. The transmission mode can be either uni-cast or multi-cast. The variety of individual client devices, including personal digital assistant (PDA), laptop, desktop, set-top box, TV, HDTV, mobile phone and others, requires bitstreams of different bandwidths simultaneously for the same content. The connection bandwidth could vary quickly with the time (from 9.6kbps to lOOMbps and above), and can be faster than a server's reaction.

[0004] Similar to the heterogeneous IP network is mobile/wireless communication. Transport of multimedia content over mobile/wireless channels is very challenging because these channels are often severely impaired due to multi-path fading, shadowing, inter-symbol interference, and noise disturbances. Some other reasons such as mobility and competing traffic also cause bandwidth variations and loss. The channel noise and the number of users being served determine the time-varying property of channel environments, hi addition to environmental conditions, the destination network can vary from second to third generation cellular networks to broadband data-only networks due to geographic location as well as mobile roaming. All these variables that affect the available bandwidth call for adaptive rate adjustment of the transmission of multimedia content, even on the fly. Thus, successful transmission of video over heterogeneous wired/wireless networks requires efficient coding, as well as adaptability to varying network conditions, device characteristics, and user preferences, while also being resilient to losses.
[0005] To meet different user requirements and to adapt to channel variation, one could generate multiple independent versions of bitstreams, each meeting one class of constraints based on transmission bandwidth, user display and computational capability, but this is not efficient for server storage and multicast application. In scalable coding, where a single macro-bitstream accommodating high-end users is built at the server, the bitstreams for low-end applications are just embedded as subsets of the macro-bitstream. As such, a single bitstream can be adapted to diverse application environments by selectively transmitting sub-bitstreams. Another advantage provided by scalable coding is for robust video transmissions on error prone channels. Error protection and error concealment can be easily handled. A more reliable transmission channel or a better error protection can be applied to base-layer bits that contain the most significant information.
[0006] There are spatial, temporal and signal to noise ratio (SNR) scalabilities in hybrid coders like MPEG-1, MPEG-2, MPEG-4 (collectively referred to as MPEG-x), H.261, H.262, H.263, and H.264 (collectively referred to as H.26x). In hybrid coding, temporal redundancy is removed by motion-compensated prediction (MCP). A video is typically divided into a series of groups of pictures (GOP), where each GOP begins with an intra-coded frame (I) followed by an arrangement of forward predicted frames (P) and bidirectional predicted frames (B). Both P-frames and B-frames are inter-frames.

The B frame is the key to temporal scalability in most MPEG like coders. However, some profiles, such as the MPEG-4 Simple profile and the H.264 Baseline Profile do not support B frames.
[0007] In MPEG-4, profiles and levels provide a means of defining subsets of the syntax and semantics based on the decoder capabilities required to decode a particular bitstream. A profile is a defined sub-set of the entire bitstream syntax. A level is a defined set of constraints imposed on parameters in the bitstream. For any given profile, levels generally correspond to decoder processing load and memory capability. So profiles and levels specify restrictions on bitstreams and hence place limits on the capabilities of decoding the bitstreams. hi general, a decoder shall be deemed to be conformant to a given profile at a given level if it is able to properly decode all allowed values of all syntactic elements as specified by that profile at that level. [0008] It is an object of the present invention to provide a method and apparatus providing simple yet effective temporal scalability that also conforms to the MPEG-4 Simple Profile and the H.264 Baseline Profile. The MPEG-4 standard is described in ISO/IEC 14496-2. The H.264 standard is described in [ISO/IEC 14496-10]
SUMMARY
[0009] A coding scheme for providing temporal scalability in a video compression and delivery scheme such as MPEG-x or H.26x, and for providing temporal scalability for MPEG-4 Simple Profile and H.264 Baseline Profile conforming devices is described. [0010] In one example, an encoder or a transcoder can create a single bitstream that can be adapted to provide for variable data rates and video quality for multiple users. The single bitstream can be created on the fly or stored in memory. Temporal scaling frames can be omitted from the video stream in order, for example, to meet bandwidth requirements, to satisfy channel conditions such as environmental noise or to deliver variable quality video.
[0011] In another example, a decoder can choose to omit decoding of temporal scaling frames to, for example, conserve battery power or decoding time.

BRIEF DESCRIPTION OF THE DRAWINGS
[0012] FIG. 1A is a diagram illustrating a conventional MPEG-4 Simple Profile data
stream,
[0013] FIG. IB is a diagram illustrating a conventional encoded data stream that
enables temporal scalability,
[0014] FIG. 2 is a diagram illustrating an example of a forward predicted temporal
scalability scheme in accordance with the present invention,
[0015] FIG. 3 is a diagram illustrating an example of a backward predicted temporal
scalability scheme in accordance with the present invention,
[0016] FIG. 4 is an illustration of an example of frame ordering for display and
encoding processes using forward predicted unidirectional temporal scaling frames of
the present invention,
[0017] FIG. 5 is a block diagram of a general communications system for encoding
and decoding streaming pictures,
[0018] FIG. 6 is a block diagram of a transcoder device,
[0019] FIG. 7 is a flowchart illustrating one example of an encoding process including
temporal scaling in accordance with the present invention, and
[0020] FIG. 8 is a flowchart of one example of a video delivery process including
temporal scaling in accordance with the present invention.
DETAILED DESCRIPTION
[0021] In several communication systems, the data to be transmitted is compressed so that the available bandwidth is used more efficiently. For example, the Moving Pictures Experts Group (MPEG) has developed several standards relating to digital data delivery systems. The MPEG-4 standard was developed for low to high data rate channels that typically experience high loss of data. A similar Standard is H.264 developed by ITU-T Video Coding Experts Group (VCEG) together with ISO/JEC MPEG. [0022] The MPEG-x and H.26x standards describe data processing and manipulation techniques that are well suited to the compression and delivery of video, audio and other information using fixed or variable length source coding techniques. In particular, the above-referenced standards, and other hybrid coding standards and techniques will compress video information using ultra-frame coding techniques (such as, for example,

run-length coding, Huffman coding and the like) and inter-frame coding techniques (such as, for example, forward and backward predictive coding, motion compensation and the like). Specifically, in the case of video processing systems, hybrid video processing systems are characterized by prediction-based compression encoding of video frames with intra-frame and/or inter-frame motion compensation encoding. [0023] A method, apparatus and system to encode a video stream including intra-coded frames, forward and backward predicted frames and uni-directional predicted temporal scaling frames are described. Temporal scaling may take place at an originating device, at an intermediate device or at a receiving device during video delivery.
[0024] Intra-frame coding refers to encoding a picture (a field or a frame) without reference to any other picture, but the Intra-coded frame can be used as a reference for other frames. The terms "intra-frame", "intra-coded frame" and "I frame" are all examples of video-objects formed with intra-coding that are used throughout this application.
[0025] Inter or predictive coding refers to encoding a picture (a field or a frame) with reference to another picture. Compared to the Intra-coded frame, the Inter-coded or predicted frame may be coded with greater efficiency. Examples of inter-frames that will be used throughout this application are predicted frames (either forward or backward predicted, also referred to as "P frames"), bi-directional predicted frames (also referred to as "B frames") and uni-directional predicted temporal scaling frames (also referred to as "P* frames"). Other terms for inter-coding include high-pass coding, residual coding, motion compensated interpolation and others that are well known to those of ordinary skill in the art.
[0026] In a typical MPEG decoder, predictive coded pixel blocks (i.e., blocks that comprise one or more motion vectors and a residual error component) are decoded with respect to a reference frame (where an intra-frame or another predicted frame can serve as a reference frame). FIG. 1A is a diagram illustrating a conventional MPEG-4 Simple Profile data stream, which depicts frame dependencies for a GOP. GOP 10 is made up of initial I Frame 12, followed by several forward predicted P frames 14. The dependency of P frames on a previous I or P frame can limit the temporal scalability afforded to a system (systems such as those conforming to the MPEG-4 Simple and H.264 Baseline Profiles) that may only support forward predicted frames. Removing

any of the P frames 14 may result in a loss of information that may be crucial in decoding other P frames. P frame removal may result in, for example, video jitter or the inability of the decoder to continue decoding until the next I frame 16, which marks the beginning of the next GOP.
[0027] One solution to the temporal scalability problem is the bi-directional predicted frame used in the prior art. FIG. IB is a diagram illustrating a conventional encoded data stream that enables temporal scalability, which depicts the frame dependencies of a GOP. GOP 20 is made up of I frame 22A, forward predicted P frames 24, and bidirectional predicted B frames 26. Each B frame can combine forward and backward motion vectors and residual errors referenced to I frame 22A or forward predicted P frames 24 (backward predicted P frames could also be used but are not shown in this example). I frame 22B marks the beginning of the next GOP. As shown in Fig. IB, only one B frame 26 is contained between I frame 22A and P frame 24 or between two P frames 24. Several B frames could be inserted between reference frames to allow for greater flexibility in temporal scalability. Since no other frames may depend on the B frame as a reference frame, one could remove B frames 26 without loss of information regarding the decoding of other frames. This characteristic of B frames 26 can allow B frames 26 to be inserted into a bitstream, where the B frames 26 can be removed at the option of an encoder, a transcoder or a decoder to accommodate channel conditions, bandwidth limitations, battery power as well as other considerations. For example, if there are three B frames between reference frames, then one could remove all three B frames and reduce the frame rate by three quarters or one could keep the B frame in the middle and remove the other two to reduce the frame rate by one half. The data rate could decrease accordingly.
[0028] Bi-directional prediction, although providing improved compression over forward (unidirectional) prediction alone, has a down side. Bi-directional prediction requires increased computational requirements. Bi-directional predicted frames can entail extra encoding complexity because macroblock matching (the most computationally intensive encoding process) may have to be performed twice for each target macroblock, once with the past reference frame and once with the future reference frame. Introducing B frames could also increase computational complexity at the decoder side and complicate the scheduling. This increase in complexity is a major reason that the MPEG-4 Simple Profile and H.264 Baseline Profile do not support bi-

directional prediction. These profiles were developed for devices requiring efficient use of battery and processing power such as mobile phones, PDA's and the like. The present invention provides an effective way to offer temporal scalability to such power limited devices.
[0029] The present invention involves a unidirectional predicted temporal scaling frame, providing for temporal scalability without changing any syntax in the Simple Profile of MPEG-4 and the Baseline Profile of H.264. Unidirectional predicted temporal scaling frames use only a forward or backward prediction instead of both types of predictions as used by conventional B frames. In addition, no other predicted frame may be referenced to the unidirectional predicted temporal scaling frame. Since no other frame may depend on the temporal scaling frame, the temporal scaling frames can be removed from the bitstream without influencing the remaining frames. As a result there may be no need to introduce any extra syntax into the Simple Profile of MPEG-4 or the Baseline Profile of H.264. The addition of a single overhead bit can be used to identify a frame as a unidirectional predicted temporal scaling frame as opposed to a normal predicted frame.
[0030] FIG. 2 is a diagram illustrating an example of a forward predicted temporal scalability scheme in accordance with the present invention. GOP 200 includes I frame 210A, P frames 212, and temporal scalability frames 214. As shown in Fig. 2, a single forward predicted frame can be used as the unidirectional predicted temporal scaling P* frame 214 between successive P frames 212. It should be realized that multiple unidirectional temporal scaling frames could depend on a single reference frame. Having multiple temporal scaling frames between successive P frames 212 can allow for more adaptability to satisfy data rate requirements. I frame 21 OB marks the beginning of the next GOP.
[0031] FIG. 3 is a diagram illustrating an example of a backward predicted temporal scalability scheme in accordance with the present invention. GOP 300 includes I frame 310A, P frames 312 and temporal scaling frames 314. As shown in Fig. 3 a single backward predicted frame can be used as the unidirectional predicted temporal scaling P* frame 314 between successive P frames 312. I frame 310B marks the beginning of the next GOP. As seen in both backward and forward cases, no other frames reference the temporal scaling frames 214 and 314 respectively. Since no frames reference them, the temporal scaling frames can be omitted from encoding, transmission, or decoding

without affecting any other frames. This may provide for a gradual reduction in quality and/or data rate, depending on the number of unidirectional predicted temporal scaling frames excluded from transmission/decoding.
[0032] Since the unidirectional predicted temporal scaling frames require less computation than B frames, the unidirectional predicted temporal scaling frames can be advantageous for use in power limited or computationally limited devices. Because a unidirectional predicted temporal scaling frame will not be used to predict following P frames, coding efficiency of P frames can go down compared to using only P frames. This drop in coding efficiency can be tolerated given the added benefit of having temporal scalability. The examples of unidirectional predicted temporal scaling frames presented in Fig. 2 and Fig. 3 reference only one frame. However, it can be recognized that more than one frame can be referenced by a unidirectionally predicted temporal scaling frame. Referencing more than one preceding or succeeding frame will increase the complexity of the computation, but may also reduce the size of the residual error. [0033] In addition to the computational benefits, a shorter delay can be realized when using forward predicted unidirectional temporal scaling frames instead of the bidirectional frames. Bidirectional frames are encoded after the frame from which they are backward predicted from. This may mean that there is additional delay before the B frames can be displayed. FIG. 4 is an illustration of an example of frame ordering for display and encoding processes using forward predicted unidirectional temporal scaling frames of the present invention. As shown in Fig. 4, unlike bidirectional predicted frames, the unidirectionally predicted temporal scaling frames of the present invention can be encoded and transmitted in the same sequence as they will be displayed at the remote device. The ability to encode and transmit forward predicted unidirectional temporal scaling frames in sequence avoids the additional delays encountered when B frames are used, which can be an added benefit for applications such as video conferencing.
[0034] FIG. 5 is a block diagram of a general communications system for encoding and decoding streaming pictures. The system 500 includes encoder device 505 and decoder device 510. Encoder device 505 further includes intra encoding component 515, predictive encoding component 520, temporal scaling component 525 and memory component 530. Encoder device 505 is able to access data from external source 535. External source 535 could be, for example, external memory, the Internet, or a live

video and/or audio feed. The data contained in external source 535 can be in a raw (not encoded) or encoded state. Infra encoding component 515 is used to encode infra-coded frames. Predictive encoding component 520 is used to encode predicted frames of all kinds, including the unidirectional predicted temporal scaling frames. In addition to containing the logic used to encode the predicted frames, predictive encoding component 520 also contains the logic used to choose reference frames and the logic used to exclude temporal scaling frames from being referenced by other frames. Predictive encoding component 520 can access raw or encoded data for encoding. Encoded data can be accessed in order to replace normal P frames or I frames with unidirectional predicted temporal scaling frames. When accessing encoded data (either infra-coded or inter-coded data), the logic contained in infra encoding component 515 and predictive encoding component 520 decodes the encoded data resulting in reconstructed raw data. This reconstructed raw data can then be encoded as a unidirectional predicted temporal scaling frame (or any other type of frame). [0035] After encoding, the encoded frames are stored in memory component 530 or external memory. The external memory can be the same as external source 535 or a separate memory component (not shown). The encoded frames are transmitted (Tx) over network 540. Network 540 can be wired or wireless. Temporal scaling component 525 contains logic to determine if temporal scaling is desired before transmission. Temporal scaling component 525 can also contain logic to identify the temporal scaling frames and to omit them from transmission if it is determined that temporal scaling is desired. The encoding process performed by the encoder device is more fully described below.
[0036] Decoder device 510 contains similar components to encoder device 505, including, infra decoding component 545, predictive decoding component 550, temporal scaling component 555 and memory component 560. Decoder device 510 can receive encoded data that has been transmitted over network 540 or from external storage 565. Infra decoding component 545 is used to decode infra-coded data. Predictive decoding component 550 is used to decode predicted data, including the unidirectional predicted temporal scaling frames. Temporal scaling component 555 contains logic to determine if temporal scaling is desired before decoding. In this example, Temporal scaling component 555 also contains logic to identify the temporal scaling frames and to omit them from decoding if it is determined that temporal scaling is desired. After decoding,

the decoded frames can be displayed on display component 570 or stored in internal memory 560 or external storage 565. Display component 570 can be an integrated part of the decoding device, such as a display screen on a phone or PDA. Display component 570 could also be an external peripheral device. The decoding process performed by the decoder device is more fully described below. [0037] The modifications to provide a decoder device to support unidirectional predicted temporal scaling frames can be minor. Since H.264 supports multi-reference coding, if the baseline decoder can support at lease two reference frames, there may be no need to modify the decoder to support unidirectional predicted temporal scaling frames. The decoder conforming to the simple profile of MPEG-4 may only allow one reference frame in the buffer, so after decoding a unidirectional forward predicted temporal scaling frame, the reference frame in the reference frame buffer would be maintained for the following P frame instead of replacing the reference frame in the buffer with the just decoded temporal scaling frame.
[0038] In addition to encoding and decoding devices, temporal scaling can take place at an intermediate device known as a transcoder. Referring to FIG. 6, there is illustrated a block diagram of a transcoder device. Transcoder device 600 is situated between first network 605 and second network 620. Transcoder device 600 receives encoded data from a device, such as encoder device 505 as depicted in FIG. 5, over first network 605. Transcoder device 600 stores the received data in a memory component 615. Transcoder device 600 also contains a temporal scaling component 610. Temporal scaling component 610 contains logic to determine if temporal scaling is desired before transmission on second network 620. Temporal scaling component 610 can also contain logic to identify the temporal scaling frames and to omit them from transmission if it is determined that temporal scaling is desired. The transcoding process performed by transcoder device 600 is more fully described below. [0039] FIG. 7 is a flowchart illustrating one example of an encoding process including temporal scaling in accordance with the present invention. The encoding process takes place in an encoder such as device 505 depicted in FIG. 5. Digital video data 710 is encoded into GOPs made up of a plurality of frames. A GOP can start with an Intra-coded Frame that is encoded at 720. The Intra-coded frame serves as a reference point for at least some of the inter-frames that follow (or precede in the case of backward prediction with open GOP, where an open GOP can reference frames from another

GOP). The encoding process 700 also includes encoding of predicted frames 730 which can include forward or backward predicted frames. The predicted frames can contain motion compensation data such as motion vectors and residual error that can be referenced to a previous intra-coded or predicted frame. Predicted frames can also serve as reference frames for other predicted frames (both normal and temporal scaling frames). Encoding unidirectional predicted temporal scaling frames 740 enable temporal scalability. These frames can be computed in a manner similar to the predicted frames 730 in that the frames can contain motion compensation referenced to an intra-coded or predicted frame. The temporal scaling frames themselves, however, are excluded from being referenced by another frame (i.e. excluding the temporal scaling frame from being used for predicting any other frame). The temporal scaling frame data may also contain overhead information that identifies the frame as a temporal scaling frame. Because other frames do not depend on the existence of the temporal scaling frames, the temporal scaling frames can be removed without adversely affecting other frames. Encoded frames can be stored into memory 750 for delivery at a later time. Encoded frames could also be delivered after encoding without the storing step 750.
[0040] The encoding process 700 can continue to encode OOP's until the video data 710 is exhausted. The OOP's can be made up of different numbers of frames of different frame types in order to meet different objectives. Encoding a larger number of temporal scaling frames 740 in a GOP provides more flexibility in adjusting the quality or complexity of the delivery or decoding of that GOP.
[0041] FIG. 8 is a flowchart of one example of a video delivery process including temporal scaling in accordance with the present invention. The left side of Fig. 8 corresponds to a process in a video source, such as encoder device 505 depicted in FIG. 5, and the right side corresponds to a process in a destination device such as decoder device 510 depicted in FIG. 5. A wired/wireless network can connect the two sides and can be a combination of wired or wireless networks. Transitioning to new networks can include a transcoder device, such as transcoder device 600 depicted in FIG. 6. The process 800 in FIG. 8 starts by retrieving the video frame data from memory 810. This memory can be permanent memory that was created previously or it could also be dynamic memory to hold frame data that is being computed at the time of transmission.

[0042] A decision is made whether to temporally scale the video data 820. Factors considered in the decision can be, for example, providing a lower level of quality than the maximum, lowering the data rate below a maximum capability of one of the networks, controlling traffic, preserving battery power of a source or a destination device or limiting the time to encode and/or decode. If temporal scaling is to be performed then temporal scaling frames are identified and selectively removed 830 from the data stream. The removal of any of the unidirectional predicted temporal scaling frames will not affect any other frame because no frames are referenced to the temporal scaling frame. Identification can take many forms including, for example, a single overhead bit or flag that, when set equal to one, identifies the frame as a temporal scaling frame. This overhead bit or flag may be coded using standard compliant syntax or in a proprietary fashion. If the bitstream is to be standards (and profile) compliant, the temporal scaling frames could be identified through mutual a priori encoder-server communication (in case of network adaptation) or a mutual a priori encoder-decoder identifier (in case of device complexity/power adaptation). The mutual a priori identifier may be, for example, frame location (e.g. odd or even frame numbers), decoding or presentation timestamps or frame ordering. Another form of identification could involve the decoder using information in the bitstream regarding whether a frame is referenced by another frame. The video frames that are not removed are transmitted over the wired/wireless network(s) 840 to the destination device. There can be multiple destination devices in the case of multi-cast delivery or a single destination device in the case of uni-cast delivery.
[0043] At the destination device, a decoder such as decoder device 510 of Fig. 5, or at an intermediary network device, a router or transcoder such as device 600 of FIG. 6, the encoded video data is acquired from network 850. After acquiring the data, the destination device or the intermediary network device, respectively, can decide whether or not to provide temporal scaling 860. Reasons for temporal scaling can be similar to those at the video source, especially for an intermediate network router, with regard to network capability or network loading. Reasons for temporal scaling can also include, for example, preservation of battery power, especially for resource limited devices such as PDA's, mobile phones and the like. If temporal scaling is elected, then temporal scaling frames are identified and omitted to satisfy a targeted parameter, such as, for example, a data rate, or a decoding time. After omitting temporal scaling frames, the

remaining frames can be decoded 880 in a manner determined by their type (e.g. intra-
coded decoding, forward predicted decoding etc.).
[0044] The temporal scaling decision-making and removal processes discussed above
can be performed at an encoder such as encoder device 505 (Fig.5), a transcoder such as
transcoder device 600 (Fig. 6), or a decoder such as decoder device 510 (Fig.5). One or
more of these three devices can be involved in deciding to remove temporal scaling
frames in the same bitstream.
[0045] While, for the purpose of simplicity of explanation, the methodologies shown
in FIGS. 7-8 are shown and described as a series of acts, it is to be understood and
appreciated that the present invention is not limited by the order of acts, as some acts
may, in accordance with the present invention, occur in different orders and/or
concurrently with other acts from that shown and described herein.
[0046] Although the present invention has been fully described in connection with
utilizing Intra-frames and forward predicted frames as reference frames for the
unidirectional predicted temporal scaling frames, it is clear that other frames, such as
backward predicted frames could serve as reference frames as well.
[0047] Although the present invention has been fully described in connection with
MPEG-x and H.26x type compression schemes, it is clear that other video compression
schemes can implement the methods of the present invention.
[0048] Aspects of the present invention include, but are not limited to, the descriptions
below.
[0049] A method of encoding multimedia frames, comprising encoding a removable
temporal scaling frame by unidirectionally predicting the removable temporal scaling
frame, wherein the removable temporal scaling frame is not used for predicting any
other frame.
[0050] An apparatus for encoding multimedia frames, comprising means for encoding
a removable temporal scaling frame by unidirectionally predicting the removable
temporal scaling frame, wherein the removable temporal scaling frame is not used for
predicting any other frame.
[0051] An electronic device for encoding multimedia frames, the electronic device
configured to encode a removable temporal scaling frame by unidirectionally predicting
the removable temporal scaling frame, wherein the removable temporal scaling frame is
not used to predict any other frame.

[0052] A computer readable medium having instructions for causing a computer to execute a method of encoding multimedia frames, comprising encoding an intra-coded frame, which is not predicted from another frame, encoding a predicted frame, wherein the predicted frame is predicted from at least one intra-coded or predicted frame, and encoding a removable temporal scaling frame by unidirectionally predicting the removable temporal scaling frame, wherein the removable temporal scaling frame is not used for predicting any other frame.
[0053] A method of decoding multimedia frames, comprising receiving encoded frame data, identifying any removable temporal scaling frame that is unidirectionally predicted, wherein the removable temporal scaling frame is not used for the prediction of any other frame, and decoding the received encoded frame data so as to omit at least one removable temporal scaling frame from being decoded.
[0054] An apparatus for decoding multimedia frames, comprising means for receiving encoded frame data, means for identifying any removable temporal scaling frame that is unidirectionally predicted, wherein the removable temporal scaling frame is not used for the prediction of any other frame, and means for decoding the received encoded frame data so as to omit at least one removable temporal scaling frame from being decoded. [0055] An electronic device for decoding multimedia frames, the electronic device configured to receive encoded frame data, to identify any removable temporal scaling frame that is unidirectionally predicted, wherein the removable temporal scaling frame is not used for the prediction of any other frame, and to decode the received encoded frame data so as to omit at least one removable temporal scaling frame from being decoded.
[0056] A computer readable medium having instructions for causing a computer to execute a method of decoding multimedia frames, comprising receiving encoded frame data, identifying any removable temporal scaling frame that is unidirectionally predicted, wherein the removable temporal scaling frame is not used for the prediction of any other frame, and decoding the received encoded frame data so as to omit at least one removable temporal scaling frame from being decoded.
[0057] A method of temporally scaling multimedia frames, comprising receiving an encoded frame over a first network, receiving a removable temporal scaling frame over the first network, wherein the removable temporal scaling frames is unidirectionally predicted from at least one encoded frame and the removable temporal scaling frame is

not used for predicting any other frame, transmitting the received encoded frame over a second network, and omitting the removable temporal scaling frame from transmission. [0058] An apparatus for temporally scaling multimedia frames, comprising means for receiving an encoded frame over a first network, means for receiving a removable temporal scaling frame over the first network, wherein the removable temporal scaling frames is unidirectionally predicted from at least one encoded frame and the removable temporal scaling frame is not used for predicting any other frame, means for transmitting the accessed encoded frame over a second network, and means for omitting the removable temporal scaling frame from transmission.
[0059] Those of ordinary skill in the art would understand that information and signals may be represented using any of a variety of different technologies and techniques. For example, data, instructions, commands, information, signals, bits, symbols, and chips that may be referenced throughout the above description may be represented by voltages, currents, electromagnetic waves, magnetic fields or particles, optical fields or particles, or any combination thereof.
[0060] Those of ordinary skill would further appreciate that the various illustrative logical blocks, modules, and algorithm steps described in connection with the examples disclosed herein may be implemented as electronic hardware, computer software, or combinations of both. To clearly illustrate this interchangeability of hardware and software, various illustrative components, blocks, modules, circuits, and steps have been described above generally in terms of their functionality. Whether such functionality is implemented as hardware or software depends upon the particular application and design constraints imposed on the overall system. Skilled artisans may implement the described functionality in varying ways for each particular application, but such implementation decisions should not be interpreted as causing a departure from the scope of the present invention.
[0061] The various illustrative logical blocks, modules, and circuits described in connection with the examples disclosed herein may be implemented or performed with a general purpose processor, a digital signal processor (DSP), an application specific integrated circuit (ASIC), a field programmable gate array (FPGA) or other programmable logic device, discrete gate or transistor logic, discrete hardware components, or any combination thereof designed to perform the functions described herein. A general purpose processor may be a microprocessor, but in the alternative, the

processor may be any conventional processor, controller, microcontroller, or state machine. A processor may also be implemented as a combination of computing devices, e.g., a combination of a DSP and a microprocessor, a plurality of microprocessors, one or more microprocessors in conjunction with a DSP core, or any other such configuration.
[0062] The steps of a method or algorithm described in connection with the examples disclosed herein may be embodied directly in hardware, in a software module executed by a processor, or in a combination of the two. A software module may reside in RAM memory, flash memory, ROM memory, EPROM memory, EEPROM memory, registers, hard disk, a removable disk, a CD-ROM, or any other form of storage medium known in the art. An exemplary storage medium is coupled to the processor such that the processor can read information from, and write information to, the storage medium. In the alternative, the storage medium may be integral to the processor. The processor and the storage medium may reside in an Application Specific Integrated Circuit (ASJC). The ASIC may reside in a wireless modem. In the alternative, the processor and the storage medium may reside as discrete components in the wireless modem. [0063] The previous description of the disclosed examples is provided to enable any person of ordinary skill in the art to make or use the present invention. Various modifications to these examples will be readily apparent to those skilled in the art, and the principles defined herein may be applied to other examples without departing from the spirit or scope of the invention.
[0064] A method, apparatus and system to encode, transcode and decode a video stream including intra-coded frames, forward and backward predicted frames and unidirectional predicted temporal scaling frames have been described.




















We Claim:
1. A method of encoding multimedia frames, comprising:
encoding a removable temporal scaling frame by unidirectionally backward predicting the removable temporal scaling frame with respect to a display order, wherein the removable temporal scaling frame is not used for predicting any other frame.
2. The method as claimed in claim 1, further comprising: encoding an intra-coded frame, which is not predicted from another frame.
3. The method as claimed in claim 2, further comprising: encoding a predicted frame, wherein the predicted frame is predicted from at least one intra-coded or predicted frame.
4. The method as claimed in claim 3 wherein, the encoding of the predicted frame comprises forward predicting the predicted frame.
5. The method as claimed in claim 1, further comprising: storing the encoded frames in memory.
6. The method as claimed in claim 1, further comprising: encoding the removable temporal sealing frame with overhead data for identification as the removable temporal scaling frame.
7. The method as claimed in claim 3, further comprising: transmitting the encoded frames over a network.
8. The method as claimed in claim 3, further comprising: transmitting the encoded intra-coded frame and the encoded predicted frame over a network, while omitting the encoded removable temporal scaling frame from the transmission.
9. The method as claimed in claim 3, further comprising:
encoding the predicted frame with motion vector and residual error data; and
encoding the removable temporal scaling frame with motion vector and residual error data.
10. The method as claimed in claim 7, further comprising:
receiving the transmitted frames; and
decoding the received frames.
11. The method as claimed in claim 7, further comprising:
receiving the transmitted frames;
decoding the received intra-coded frame and the received predicted frame, while omitting the received removable temporal scaling frame.
12. The method as claimed in claim 7, further comprising:
receiving the transmitted frames; and
identifying the received removable temporal scaling frame with an a priori identifier.
13. The method as claimed in claim 1, wherein the step of encoding the removable temporal
scaling frame comprises forward predicting the removable temporal scaling frame.
14. The method as claimed in claim 1, wherein the step of encoding the removable temporal scaling frame comprises backward predicting the removable temporal scaling frame.
15. An apparatus for encoding multimedia frames, comprising:
means (505) for encoding a removable temporal scaling frame by unidirectionally backward predicting the removable temporal scaling frame with respect to a display order, wherein the removable temporal scaling frame is not used for predicting any other frame.
16. The apparatus as claimed in claim 15, further comprising means (515) for encoding an intra-coded frame, which is not predicted from another frame.
17. The apparatus as claimed in claim 16, further comprising: means (520) for encoding a predicted frame, wherein the predicted frame is predicted from at least one intra-coded or predicted frame.
18. The apparatus as claimed in claim 17 wherein, the means (520) for encoding of the predicted frame comprises means for forward predicting.
19. The apparatus as claimed in claim 15, further comprising: means for storing the encoded frames in memory (530).
20. The apparatus as claimed in claim 15, further comprising: means (525) for encoding the removable temporal scaling frame with overhead data for identification as the removable temporal scaling frame.
21. The apparatus as claimed in claim 17, further comprising: means (Tx) for transmitting the encoded frames over a network.
22. The apparatus as claimed in claim 17, further comprising:
means for transmitting the encoded intra-coded frame and the encoded predicted frame over a network; and
means for omitting the encoded removable temporal scaling frame from the transmission.
23. The apparatus as claimed in claim 17, further comprising:
means for encoding the predicted frame with motion vector and residual error data; and
means for encoding the removable temporal scaling frame with motion vector and residual error data.
24. The apparatus as claimed in claim 15, wherein the means for encoding the removable temporal scaling frame comprises means for forward predicting the removable temporal scaling frame.
25. The apparatus as claimed in claim 15, wherein the means for encoding the removable temporal scaling frames comprises means for backward predicting the removable temporal scaling frame.
26. A method of decoding multimedia frames, comprising:
receiving encoded frame data;
identifying any removable temporal scaling frame that is unidirectionally backward predicted with respect to a display order, wherein the removable temporal scaling frame is not used for the prediction of any other frame; and
decoding the received encoded frame data so as to omit at least one removable temporal scaling frame from being decoded.
27. The method as claimed in claim 26, further comprising:
receiving an intra-coded frame, which is not predicted from another frame; and decoding the intra-coded frame.
28. The method as claimed in claim 27, further comprising:
receiving a predicted frame, wherein the predicted frame is predicted from at least one encoded frame; and
decoding the predicted frame.
29. The method as claimed in claim 26, further comprising: receiving the removable temporal scaling frame that is forward predicted.
30. The method as claimed in claim 26, further comprising:
receiving the removable temporal scaling frame that is backward predicted.
31. The method as claimed in claim 26, wherein the step of receiving comprises receiving over a wireless network.
32. The method as claimed in claim 28, further comprising: receiving the predicted frame that is forward predicted.
33. The method as claimed in claim 26, further comprising: identifying the received removable temporal scaling frame with an a priori identifier.
34. The method as claimed in claim 26, further comprising:
transmitting the encoded frame data over a network; and
omitting the removable temporal scaling frame from transmission.
35. The method as claimed in claim 34, wherein the receiving steps comprise receiving over a wireless network.
36. The method as claimed in claim 34, wherein the transmitting step comprises transmitting over a wireless network.
37. An apparatus for decoding multimedia frames, comprising:
means (510) for receiving encoded frame data;
means (555) for identifying any removable temporal scaling frame that is unidirectionally backward predicted with respect to a display order, wherein the removable temporal scaling frame is not used for the prediction of any other frame; and
means (550) for decoding the received encoded frame data so as to omit at least one removable temporal scaling frame from being decoded.
38. The apparatus as claimed in claim 37, further comprising:
means (510) for receiving an intra-coded frame, which is not predicted from another frame; and
means (545) for decoding the intra-coded frame.
39. The apparatus as claimed in claim 38, further comprising:
means (510) for receiving a predicted frame, wherein the predicted frame is predicted from at least one encoded frame; and
means (550) for decoding the predicted frame.
40. The apparatus as claimed in claim 37, further comprising: means (510) for receiving the
removable temporal scaling frame that is forward predicted.
41. The apparatus as claimed in claim 37, further comprising:
means (510) for receiving the removable temporal scaling frame that is backward predicted.
42. The apparatus as claimed in claim 37, wherein the means (510) for receiving comprises means (510) for receiving over a wireless network.
43. The apparatus as claimed in claim 39, further comprising: means (510) for receiving the predicted frame that is forward predicted.
44. The apparatus as claimed in claim 37, further comprising: means (555) for identifying the received removable temporal scaling frame with a priori identifier.
45. The apparatus as claimed in claim 37, further comprising:
means (600) for transmitting the accessed encoded frame over a second network; and means (610) for omitting the removable temporal scaling frame from transmission.
46. The apparatus as claimed in claim 45, wherein the means (510) for receiving comprise
means for receiving over a wireless network.
47. The apparatus as claimed in claim 45, wherein the means (600) for transmitting comprises means for transmitting over a wireless network.

Documents:

5817-DELNP-2006-Abstract-(08-12-2010).pdf

5817-DELNP-2006-Abstract-(12-07-2010).pdf

5817-delnp-2006-abstract.pdf

5817-DELNP-2006-Claims-(08-12-2010).pdf

5817-DELNP-2006-Claims-(12-07-2010).pdf

5817-delnp-2006-Claims-(17-04-2014).pdf

5817-delnp-2006-claims.pdf

5817-delnp-2006-Correspondence Others-(17-04-2014).pdf

5817-DELNP-2006-Correspondence-Others-(08-12-2010).pdf

5817-DELNP-2006-Correspondence-Others-(12-07-2010).pdf

5817-DELNP-2006-Correspondence-Others-(14-09-2010).pdf

5817-delnp-2006-correspondence-others.pdf

5817-delnp-2006-description (complete).pdf

5817-DELNP-2006-Drawings-(12-07-2010).pdf

5817-delnp-2006-drawings.pdf

5817-delnp-2006-form-1.pdf

5817-delnp-2006-form-18.pdf

5817-delnp-2006-form-2.pdf

5817-DELNP-2006-Form-3-(14-09-2010).pdf

5817-delnp-2006-form-3.pdf

5817-delnp-2006-form-5.pdf

5817-DELNP-2006-GPA-(12-07-2010).pdf

5817-delnp-2006-gpa.pdf

5817-delnp-2006-pct-210.pdf

5817-delnp-2006-pct-220.pdf

5817-delnp-2006-pct-237.pdf

5817-delnp-2006-pct-304.pdf

5817-delnp-2006-Petition-137-(17-04-2014).pdf


Patent Number 260696
Indian Patent Application Number 5817/DELNP/2006
PG Journal Number 21/2014
Publication Date 23-May-2014
Grant Date 17-May-2014
Date of Filing 06-Oct-2006
Name of Patentee QUALCOMM INCORPORATED
Applicant Address 5775 MOREHOUSE DRIVE, SAN DIEGO CALIFORNIA 92121-1714 USA
Inventors:
# Inventor's Name Inventor's Address
1 PEISONG CHEN 10859 CAMINITO ALVAREZ SAN DIEGO CALIFORNIA 92126 USA
2 VIJAYLAKSHMI RAVEENDRAN 4272 CALLE MAR DE BALLENAS, SAN DIEGO, CALIFORNIA 92130 USA
PCT International Classification Number H04N 7/46
PCT International Application Number US05/012132
PCT International Filing date 2005-04-07
PCT Conventions:
# PCT Application Number Date of Convention Priority Country
1 60/625,700 2004-11-04 U.S.A.
2 60/560,433 2004-04-07 U.S.A.
3 11/093,874 2005-03-29 U.S.A.