Abstract: Systems and methods preserve application identification information on handover in a communication network. End user quality of experience is improved by determining applications associated with communications to and from the end user. The applications may include application classes and specific applications. The application information is used to schedule packets such that the end user quality of experience is improved for that application. When the end user is handed over between wireless access nodes, the access nodes transfer application information so that the improved end user quality of experience is maintained.

Abstract: A method for coding refinement coefficients in a signal-to-noise ratio (SNR) scalable enhancement layer of a compressed video sequence is disclosed. A video sequence is received. A prediction of an original video signal in a current frame is constructed from the video sequence. A residual signal is formed by subtracting the prediction of the original video signal from the original video signal in the current frame. A transform is applied to the residual signal. A plurality of transform coefficients is quantized. A refinement coefficient is mapped to a ternary refinement symbol. Refinement symbols are grouped in a certain coding order. The refinement symbol groups are coded using variable length codes.

Abstract: Systems and methods provide a parameterized scheduling system that incorporates congestion detection and end-user application awareness and can be used with scheduling groups that contain data streams from heterogeneous applications. Congestion can be detected at multiple domains. Congestions can be detected using demand for communications, measure of resource usage in the communication device, or performance of the communication device. Congestions can also be detected using measures of protocol delay. The detected information can be used for scheduling transmission of the packets. Quality of Experience (QoE) for users can be maximized by efficient control responses to detected congestion.

Abstract: The disclosure is directed to video coding techniques that support spatial scalability using a generalized fine granularity scalability (FGS) approach. Various degrees of spatial scalability can be achieved by sending spatially scalable enhancement layers in a generalized FGS format. Spatially scalable enhancement bitstreams can be arbitrarily truncated to conform to network conditions, channel conditions and/or decoder capabilities. Coding coefficients and syntax elements for spatial scalability can be embedded in a generalized FGS format. For good network or channel conditions, and/or enhanced decoder capabilities, additional bits received via one or more enhancement layers permit encoded video to be reconstructed with increased spatial resolution and continuously improved video quality across different spatial resolutions. The techniques permit spatial scalability layers to be coded as FGS layers, rather than discrete layers, permitting arbitrary scalability.

Abstract: Systems and methods provide a parameterized scheduling system that incorporates end-user application awareness and can be used with scheduling groups that contain data streams from heterogeneous applications. Data packets are analyzed at multiple protocol levels to detect characteristics associated with communicating the packets. The data packets are filtered so that detecting the characteristics is efficiently performed. The detected characteristics can be used for scheduling transmission of the packets. The detected characteristics can be used to dynamically change scheduling parameters. The dynamic scheduling parameters can maximize user Quality of Experience (QoE) in response to recurring network patterns, one-time events, application characteristics, protocol characteristics, device characteristics, service level agreements, or combinations thereof.

Abstract: Adaptive variable length coding techniques may be used for entropy coding of residual block coefficients produced by predictive video coding. The techniques may be applied to schemes that code positions of nonzero transform coefficients using zero runs. Coding parameters such as end of block (EOB) shift and VLC codebook selection tables may be maintained as internal states, instead of sending them with coded video slice data. Table entries may be periodically updated based on statistics collected during a coding pass. A special EOB shift table may adapt the position of a special EOB symbol in a symbol set to probability of significant coefficients with magnitude greater than one for a coding condition, such as a coding cycle. Chroma blocks may be coded independently of luma blocks using separate EOB shift, special EOB shift, and VLC codebook selection tables.

Abstract: The disclosure is directed to video coding techniques that support spatial scalability using a generalized fine granularity scalability (FGS) approach. Various degrees of spatial scalability can be achieved by sending spatially scalable enhancement layers in a generalized FGS format. Spatially scalable enhancement bitstreams can be arbitrarily truncated to conform to network conditions, channel conditions and/or decoder capabilities. Coding coefficients and syntax elements for spatial scalability can be embedded in a generalized FGS format. For good network or channel conditions, and/or enhanced decoder capabilities, additional bits received via one or more enhancement layers permit encoded video to be reconstructed with increased spatial resolution and continuously improved video quality across different spatial resolutions. The techniques permit spatial scalability layers to be coded as FGS layers, rather than discrete layers, permitting arbitrary scalability.

Abstract: The disclosure describes FGS video coding techniques that use cycle-aligned fragments (CAFs). The techniques may perform cycle-based coding of FGS video data block coefficients and syntax elements, and encapsulate cycles in fragments for transmission. The fragments may be cycle-aligned such that a start of a payload of each of the fragments substantially coincides with a start of one of the cycles. In this manner, cycles can be readily accessed via individual fragments. Some cycles may be controlled with a vector mode to scan to a predefined position within a block before moving to another block. In this manner, the number of cycles can be reduced, reducing the number of fragments and associated overhead. The CAFs may be entropy coded independently of one another so that each fragment may be readily accessed and decoded without waiting for decoding of other fragments. Independent entropy coding may permit parallel decoding and simultaneous processing of fragments.

Abstract: Decoding systems and methods are disclosed. In a particular embodiment, a video decoder system includes a first decoding path and a second decoding path configured to decode at a slower average rate than the first decoding path. The video decoder system includes a dynamic switch configured to provide a first portion of the encoded video signal to the first decoding path or to the second decoding path. The dynamic switch is further configured to provide a subsequent portion of the encoded video signal to the first decoding path or to the second decoding path in response to a value of a decoding metric associated with decode processing of the first portion.

Abstract: This disclosure describes techniques for coding information in a scalable video coding (SVC) scheme that supports spatial scalability. In one example, a method for coding video data with spatial scalability comprises upsampling base layer residual video data to a spatial resolution of enhancement layer residual video data, and coding the enhancement layer residual video data based on the upsampled base layer residual video data. In accordance with this disclosure, upsampling base layer residual video data includes interpolating values for one or more pixel locations of the upsampled base layer residual video data that correspond to locations between different base layer residual video data blocks.

Abstract: Systems and methods provide a parameterized scheduling system that incorporates end-user application awareness and can be used with scheduling groups that contain data streams from heterogeneous applications. Individual data queues within a scheduling group can be created based on application class, specific application, individual data streams or some combination thereof. Application information and Application Factors (AF) are used to modify scheduler parameters such as weights and credits to differentiate between data streams assigned to a scheduling group. Dynamic AF settings may adjust relative importance of user applications to maximize user Quality of Experience (QoE) in response to recurring network patterns, one-time events, application characteristics, protocol characteristics, device characteristics, service level agreements, or combinations thereof.

Abstract: A method for decoding significance coefficients in an encoded video sequence is described. An encoded video bitstream is received. Codebook table information is retrieved from the bitstream. Significance symbols are decoded using the retrieved codebook table information. Significance coefficients are decoded using the significance symbols. A plurality of transform coefficients is dequantized. An inverse transform is applied to a residual signal. A video sequence is constructed. A method for coding significance coefficients in a video sequence is also described.

Abstract: Capacity and spectrum constrained, multiple-access communication systems optimize performance by selectively discarding packets. Changes in the communication systems may be driven using control responses. Control responses include intelligent discard of network packets under capacity constrained conditions. Packets are prioritized and discard decisions are made based on the prioritization. Various embodiments provide an interactive response by selectively discarding packets to enhance perceived and actual system throughput, provide a reactive response by selectively discarding data packets based on their relative impact to service quality to mitigate oversubscription, provide a proactive response by discarding packets based on predicted oversubscription, or provide a combination thereof. Packets may be prioritized for discard using correlations between discards and bandwidth reduction and quality degradation. The quality degradation for video packets may be measured objectively.

Abstract: Systems and methods provide a weight-based scheduling system that incorporates end-user application awareness and can be used with scheduling groups that contain data streams from heterogeneous applications. Individual data queues within a scheduling group can be created based on application class, specific application, individual data streams or some combination thereof. Application information and Application Factors (AF) are used to modify scheduler weights to differentiate between data streams assigned to a scheduling group. Dynamic AF settings may adjust relative importance of user applications to maximize user Quality of Experience (QoE) in response to recurring network patterns, one-time events, application characteristics, protocol characteristics, device characteristics, service level agreements, or combinations thereof.

Abstract: Techniques for optimizing the Context-based Adaptive Binary Arithmetic Coding (CABAC) bitstream decoding are disclosed. In one configuration, a device has a first processing circuit operative to decode a Context-based Adaptive Binary Arithmetic Coding (CABAC) bitstream into an intermediate signal having a CABAC decoded standard format and a decoded order. A second processing circuit decodes the intermediate signal using a non-CABAC decoding standard. A buffer is provided between the first and second processing circuits to improve processing speeds.

Abstract: A method for decoding significance coefficients in an encoded video sequence is described. An encoded video bitstream is received. Codebook table information is retrieved from the bitstream. Significance symbols are decoded using the retrieved codebook table information. Significance coefficients are decoded using the significance symbols. A plurality of transform coefficients is dequantized. An inverse transform is applied to a residual signal. A video sequence is constructed. A method for coding significance coefficients in a video sequence is also described.

Abstract: A method for decoding significance coefficients in an encoded video sequence is described. An encoded video bitstream is received. Codebook table information is retrieved from the bitstream. Significance symbols are decoded using the retrieved codebook table information. Significance coefficients are decoded using the significance symbols. A plurality of transform coefficients is dequantized. An inverse transform is applied to a residual signal. A video sequence is constructed. A method for coding significance coefficients in a video sequence is also described.

Abstract: Techniques for decoding the run_before fields in a CAVLC encoded bitstream for H.264 are disclosed. In one aspect, the codewords corresponding to a plurality of consecutive initial zero-value run_before codewords are stored in a look-up table, allowing the decoding of such a plurality of run_before codewords in a single computation cycle. In another aspect, the look-up table is additionally configured to decode the next non-zero run_before value after the initial zero-value run_before codewords in the same computation cycle.

Abstract: A system and method for providing improved FGS identification in scalable video coding. According to the present invention, each FGS enhancement layer is assigned a unique dependency identifier and contains only FGS enhancement information. For subsequent enhancement layers, the base dependency identifier for the subsequent enhancement layers will point to either a base-quality layer or an FGS enhancement layer.

Abstract: An apparatus performs efficient coding techniques to more efficiently locate motion vector data within neighboring video data units. The apparatus comprises a motion vector (MV) location unit that includes a look-up table (LUT), where the MV location unit obtains video data defining a plurality of video data units and processes the plurality of video data units. The apparatus further includes a geometric resolution unit that determines, while processing a current one of the plurality of video data units, which of the plurality of video data units neighbor the current video data unit. The MV location unit then accesses, for each of the neighboring video data units, the LUT to determine a location of a motion vector within a section of the video data to which the neighboring video data unit is associated.