1. A network apparatus in a core network, comprising:
one or more interfaces configured to communicate with user equipments (UEs) via a wireless network and to communicate with a policy charging rules function (PCRF) node; and
a processor in communication with the interface;
the network apparatus configured to
receive a first indication of congestion information related to a first user equipment (UE) during a time period;
receive a second indication of congestion information relating to a second UE during that same time period;
generate a message aggregating the congestion information comprising at least the first and second indications of congestion information; and
send the message comprising the aggregated congestion information to the PCRF node over one of the interfaces.
2. The network apparatus of claim 1, further comprising the PCRF node, wherein the PCRF node further sends the message to an Application Function (AF) node.
3. The network apparatus of claim 1, further comprising the PCRF node, wherein the PCRF node further sends the message to a Traffic Detection Function (TDF) node.
4. The network apparatus of claim 1, wherein the message comprises a Node-Info-Push message.
5. The network apparatus of claim 1, wherein the network apparatus is a packet data network gateway (PGW) and the first and second indications are received from one or more radio access networks.
6. The network apparatus of claim 5, wherein the network apparatus collects congestion information for multiple UEs over a time period t.
7. The network apparatus of claim 5, wherein the apparatus is configured to negotiate whether or not the network apparatus will aggregate the message prior to use.
8. The network apparatus of claim 5, wherein the aggregated congestion information is piggybacked onto an existing message.
9. A method for providing congestion information in a network system, comprising:
a network apparatus in communication with multiple user equipments (UEs) via radio access networks (RANs) receiving a first indication of congestion information relating to a first UE;
receiving a second indication of congestion information relating to a second UE;
generating a message indicating aggregated congestion information including at least the first and second indications of congestion information; and
sending the aggregated congestion information message to a policy charging rules function (PCRF) node.
10. The method of claim 8, further comprising sending the message from the PCRF node to an Application Function (AF) node.
11. The method of claim 8, further comprising sending the message from the PCRF node to a Traffic Detection Function (TDF) node.
12. The method of claim 8, wherein the message comprises a Node-Info-Push message.
13. The method of claim 8, wherein the network apparatus includes a packet data network gateway (PGW), and receives information generated by RANs.
14. The method of claim 13, wherein the network apparatus collects congestion information for multiple UEs over a time period t.
15. The method of claim 13, further comprising determining whether the network apparatus will aggregate the congestion information or provide separate messages for the first and second congestion information.
16. The method of claim 13, further comprising piggybacking the aggregated congestion information onto an existing another message.
17. A method for relieving congestion in a network system, comprising:
receiving at a Policy Rules Charging Function (PCRF) node, from a Packet Data Network (PDN) gateway, a first message comprising congestion information, wherein the message comprises aggregated congestion information including at least a first indication of congestion information and a second indication of congestion information relating to first and a second user equipment (UE);
generating a policy enforcement decision to relieve congestion in the network; and
sending a second message to the PGW, wherein the second message comprises control message for relieving congestion in the network.
18. The method of claim 17, wherein the PCRF forwards the message to an Application Function (AF) node.
19. The method of claim 17, wherein the PCRF forwards the message to a Traffic Detection Function (TDF) node.
20. The method of claim 17, further comprising determining whether to receive congestion information relating to multiple UEs in aggregate form.
The claims below are in addition to those above.
All refrences to claim(s) which appear below refer to the numbering after this setence.
1. A system for generating improved 4:2:2 chroma pixels comprising:
a 4:2:2 to 4:2:0 chroma regenerator for converting 4:2:2 chroma to 4:2:0 chroma; and
a 4:2:0 to 4:2:2 chroma generator that weaves pixels from top and bottom fields of 4:2:0 chroma to generate a 4:2:0 chroma frame, said 4:2:0 chroma frame subsequently used for interpolating one or more pixels to generate an adjusted 4:2:2 chroma frame.
2. The system of claim 1 wherein said 4:2:2 to 4:2:0 chroma regenerator employs an algorithm implemented using a 2-tap linear interpolator.
3. The system of claim 1 wherein said 4:2:2 to 4:2:0 chroma regenerator generates chroma values of top field 4:2:0 chroma pixels, \u03b1 and \u03b2, using corresponding chroma values from top field 4:2:2 chroma pixels, A and B, by way of solving the following simultaneous equations:
A
=
5
8
\u2062
\u03b1
+
3
8
\u2062
\u03b2
,
\u2062
B
=
1
8
\u2062
\u03b1
+
7
8
\u2062
\u03b2
to yield the following equations:
\u03b1
=
7
4
\u2062
A
–
3
4
\u2062
B
,
\u2062
\u03b2
=
5
4
\u2062
B
–
1
4
\u2062
A
.
4. The system of claim 1 wherein said 4:2:2 to 4:2:0 chroma regenerator generates chroma values of bottom field 4:2:0 chroma pixels, \u03b5 and \u03c6, using corresponding chroma values from bottom field 4:2:2 chroma pixel values, C and D, by way of solving the following simultaneous equations:
C
=
7
8
\u2062
\u025b
+
1
8
\u2062
\u03d5
,
\u2062
D
=
3
8
\u2062
\u025b
+
5
8
\u2062
\u03d5
to yield the following equations:
\u025b
=
5
4
\u2062
C
–
1
4
\u2062
D
,
\u2062
\u03d5
=
7
4
\u2062
D
–
3
4
\u2062
C
.
5. The system of claim 1 wherein said 4:2:2 to 4:2:0 chroma regenerator generates chroma values from top field 4:2:0 chroma pixels \u03b1 and \u03b2, using corresponding top field 4:2:2 chroma pixel values associated with pixels A, A+1, B, and B\u22121 by way of utilizing the following equations:
\u03b1
=
3
4
\u2062
B
–
1
+
1
4
\u2062
A
\u03b2
=
3
4
\u2062
B
+
1
4
\u2062
A
+
1
,
wherein said B\u22121 denotes a pixel with spatial relationship corresponding to B, said B\u22121 vertically positioned at one AB pixel pair above B, and said A+1 denotes a pixel with spatial relationship corresponding to A, said A+1 vertically positioned at one AB pixel pair below A.
6. The system of claim 1 wherein said 4:2:2 to 4:2:0 chroma regenerator generates chroma values from bottom field 4:2:0 chroma pixels \u03b5 and \u03c6, using corresponding top field 4:2:2 chroma pixel values associated with pixels C, C+1, D, and D\u22121 by utilizing the following equations:
\u025b
=
1
4
\u2062
D
–
1
+
3
4
\u2062
C
\u03d5
=
1
4
\u2062
D
+
3
4
\u2062
C
+
1
,
wherein said D\u22121 denotes a pixel with spatial relationship corresponding to D, said D\u22121 vertically positioned at one CD pixel pair above D, and said C+1 denotes a pixel with the spatial relationship corresponding to C, said C+1 vertically positioned at one CD pixel pair below C.
7. The system of claim 1 further comprising a hardware andor software used for blending said adjusted 4:2:2 chroma to said 4:2:2 chroma, said blending used to generate an improved 4:2:2 chroma.
8. The system of claim 7 wherein said hardware andor software is controlled by way of an input, said input indicating the level of motion present in said 4:2:2 chroma.
9. The system of claim 8 wherein said input indicates the level of motion present in said 4:2:2 chroma.
10. The method of claim 1 wherein said 4:2:0 to 4:2:2 chroma generator computes said adjusted 4:2:2 chroma by using the following equations:
A
new
=
1
4
\u2062
\u025b
+
3
4
\u2062
\u03b1
,
\u2062
C
new
=
3
4
\u2062
\u03b1
+
1
4
\u2062
\u03d5
,
\u2062
B
new
=
1
4
\u2062
\u03b1
+
3
4
\u2062
\u03d5
,
\u2062
D
new
=
3
4
\u2062
\u03d5
+
1
4
\u2062
\u03b2
,
wherein said values Anew, Bnew, Cnew, and Dnew correspond to said adjusted 4:2:2 chroma, said values Anew, Bnew, Cnew, and Dnew vertically interpolated from said values \u03b1, \u03b2, \u03b5, and \u03c6.
11. A method of generating an improved 4:2:2 chroma comprising:
receiving a 4:2:2 chroma;
inputting said 4:2:2 chroma into a 4:2:2 to 4:2:0 chroma regenerator;
selecting an algorithm to be used by said 4:2:2 to 4:2:0 chroma regenerator;
using said algorithm to regenerate 4:2:0 chroma;
weaving pixels from top and bottom fields of said 4:2:0 chroma to generate a 4:2:0 chroma frame;
interpolating values provided by said 4:2:0 chroma frame to generate an adjusted 4:2:2 chroma;
inputting said adjusted 4:2:2 chroma and said 4:2:2 chroma into a blending system used for blending two inputs;
determining a first amount of said adjusted 4:2:2 chroma and a second amount of said 4:2:2 chroma for said blending; and
adding said first and second amounts to generate an improved 4:2:2 chroma.
12. The method of claim 11 wherein said algorithm utilizes the following equations for regenerating said 4:2:0 chroma:
A
=
5
8
\u2062
\u03b1
+
3
8
\u2062
\u03b2
,
\u2062
B
=
1
8
\u2062
\u03b1
+
7
8
\u2062
\u03b2
,
\u2062
C
=
7
8
\u2062
\u025b
+
1
8
\u2062
\u03d5
,
\u2062
D
=
3
8
\u2062
\u025b
+
5
8
\u2062
\u03d5
,
wherein A, B, C, and D represent 4:2:2 chroma pixel values, and \u03b1, \u03b2, \u03b5, and \u03c6 represent 4:2:0 chroma pixel values.
13. The method of claim 12 wherein said equations are used if said 4:2:2 chroma was generated using a 2-tap linear interpolator.
14. The method of claim 11 wherein said algorithm utilizes the following equations for regenerating said 4:2:0 chroma:
\u03b1
=
3
4
\u2062
B
–
1
+
1
4
\u2062
A
\u03b2
=
3
4
\u2062
B
+
1
4
\u2062
A
+
1
,
\u2062
\u025b
=
1
4
\u2062
D
–
1
+
3
4
\u2062
C
,
\u2062
\u03d5
=
1
4
\u2062
D
+
3
4
\u2062
C
+
1
,
wherein A, A+1, B, B\u22121, C, C+1, and D, D\u22121, represent 4:2:2 chroma pixel values, and \u03b1, \u03b2, \u03b5, and \u03c6 represent 4:2:0 chroma pixel values.
15. The method of claim 11 wherein said determining is based on an input signal to said hardware andor software, said input signal indicating the level of motion present in said 4:2:2 chroma.
16. A method of processing a received 4:2:2 chroma formatted video comprising substituting a chroma value associated with an undesirable pixel using a weighted average of one or more chroma values associated with one or more desirable pixels.
17. The method of claim 16 wherein a weight of one or more weights of said weighted average is inversely proportional to the vertical distance between said undesirable pixel and a pixel of said one or more desirable pixels.
18. A method of generating an improved 4:2:2 chroma comprising:
regenerating 4:2:0 chroma from a 4:2:2 chroma;
weaving said 4:2:0 chroma to produce a 4:2:0 chroma frame;
interpolating said 4:2:0 chroma frame to generate said adjusted 4:2:2 chroma; and
adding a determined first level of said 4:2:2 chroma to a determined second level of said adjusted 4:2:2 chroma.
19. The method of claim 17 wherein said interpolating is performed by way of using the following equations:
A
new
=
1
4
\u2062
\u025b
+
3
4
\u2062
\u03b1
,
\u2062
C
new
=
3
4
\u2062
\u03b1
+
1
4
\u2062
\u03d5
,
\u2062
B
new
=
1
4
\u2062
\u03b1
+
3
4
\u2062
\u03d5
,
\u2062
D
new
=
3
4
\u2062
\u03d5
+
1
4
\u2062
\u03b2
,
wherein said values Anew, Bnew, Cnew, and Dnew correspond to said adjusted 4:2:2 chroma, said values Anew, Bnew, Cnew, and Dnew vertically interpolated from said values \u03b1, \u03b2, \u03b5, and \u03c6.
20. The method of claim 18 wherein said regenerating is performed using the following equations:
\u03b1
=
7
4
\u2062
A
–
3
4
\u2062
B
,
\u2062
\u03b2
=
5
4
\u2062
B
–
1
4
\u2062
A
,
\u2062
\u025b
=
5
4
\u2062
C
–
1
4
\u2062
D
,
\u2062
\u03d5
=
7
4
\u2062
D
–
3
4
\u2062
C
.
wherein A, B, C, and D represent 4:2:2 chroma pixel values, and \u03b1, \u03b2, \u03b5, and \u03c6 represent 4:2:0 chroma pixel values.
21. The method of claim 18 wherein said regenerating is performed using the following equations:
\u03b1
=
3
4
\u2062
B
–
1
+
1
4
\u2062
A
\u03b2
=
3
4
\u2062
B
+
1
4
\u2062
A
+
1
,
\u2062
\u025b
=
1
4
\u2062
D
–
1
+
3
4
\u2062
C
,
\u2062
\u03d5
=
1
4
\u2062
D
+
3
4
\u2062
C
+
1
,
wherein A, A+1, B, B\u22121, C, C+1, and D, D\u22121, represent 4:2:2 chroma pixel values, and \u03b1, \u03b2, \u03b5, and \u03c6 represent 4:2:0 chroma pixel values.