1. A method of configuring multiple per user access connections, the method comprising:
receiving, by an access gateway (AG) from an access point (AP), a first extensible authentication protocol (EAP) message comprising a first capability of a user equipment (UE);
transmitting, by the AG to an authentication, authorization and accounting (AAA) server, a second EAP message comprising the first capability of the UE and indication of a second capability of the AG;
receiving, by the AG from the AAA server, and a first AAA message comprising a negotiated connection capability version; and
transmitting, by AG to the AP, a third EAP message comprising the negotiated connection capability version.
2. The method of claim 1, further comprising:
receiving, by the AG from the AP, a fourth EAP message comprising a first access point name (APN) and a second APN; and
transmitting, by the AG to the AAA server, a second AAA message comprising the first APN, the second APN, a first gateway interface, and a second gateway interface.
3. The method of claim 2, wherein the first APN is associated with a first internet protocol (IP) address.
4. The method of claim 2, further comprising:
receiving, by the AG from the AAA server, a third AAA message comprising a first association between the first APN and the first gateway interface, a second association between the second APN and the second gateway interface, and AAA message parameters; and
transmitting, by the AG to the AP, a fifth EAP message comprising the first association between the first APN and the first gateway interface, and the second association between the second APN and the second gateway interface.
5. The method of claim 4, wherein the fourth EAP message is an EAP-Response, the second AAA message is an EAP-Response, the third AAA message is an EAP-Success, and the fifth EAP message is an EAP-Success.
6. The method of claim 4, wherein the second AAA message is a general packet radio service (GPRS) tunneling protocol (GTP) Create Session Request and the third AAA message is a GTP Create Session Response.
7. The method of claim 2, further comprising initiating a release of a first connection between the first APN and the first gateway interface.
8. The method of claim 2, further comprising:
transmitting, by the AG to the AP, a first echo request; and
releasing a first connection between the first APN and the first gateway interface.
9. The method of claim 1, wherein the first EAP message is an EAP-Response, the second EAP message is an EAP-Response, the first AAA message is an EAP-Request, and the third EAP message is an EAP-Request.
10. The method of claim 1, wherein the first EAP message further comprises an identity of the AP, and wherein the second message further comprises the identity of the AP.
11. The method of claim 1, wherein the AG comprises an EAP proxy.
12. A method of configuring multiple per user connections, the method comprising:
transmitting, by a user equipment (UE) to an access point (AP), a first extensible authentication protocol (EAP) message destined for an AG, wherein the first EAP message comprises a first plurality of access point names (APNs);
receiving, by the UE from the AP, a second EAP message comprising an association between the first plurality of APNs and a second plurality of gateway interfaces; and
determining a third plurality of router interface addresses in accordance with the second EAP message.
13. The method of claim 12, further comprising:
transmitting, by the UE to the AP, a third EAP message comprising a capability of the UE; and
receiving, by the UE from the AP, a fourth EAP message comprising a negotiated connection version.
14. The method of claim 13, further comprising receiving, by the UE from the AP, a fifth EAP message comprising an identity of the AP.
15. The method of claim 12, wherein the first EAP message is an EAP request with an access context protocol (ACP), and wherein the second EAP message is an EAP Response ACP.
16. The method of claim 15, further comprising:
transmitting, by the UE to the AP, an EAP Success Message; and
receiving, by the UE from the AP, a Router Advertisement.
17. The method of claim 12, wherein the first EAP message further comprises an IP version.
18. The method of claim 17, wherein the IP version is IP version 4 (IPv4).
19. The method of claim 17, wherein the IP version is IP version 6 (IPv6).
20. The method of claim 12, further comprising:
transmitting, by the UE to the AP, destined for the AG, a first echo request;
transmitting, by the UE to the AP, destined for the AG, a second echo request when the UE does not receive a response from the AP within a first time interval of transmitting the first echo request; and
releasing a connection context when the UE does not receive a response from the AP within a second time interval of transmitting the second echo request.
21. An access gateway (AG) comprising:
a processor; and
a computer readable storage medium storing programming for execution by the processor, the programming including instructions to
receive, from an access point (AP), a first extensible authentication protocol (EAP) message comprising a first capability of a user equipment (UE),
transmit, to an authentication, authorization and accounting (AAA) server, a second EAP message comprising the first capability of the UE and indication second capability of the AG,
receive, from the AAA server, and an AAA message comprising a negotiated connection capability version, and
transmit, to the AP, a third EAP message comprising the negotiated connection capability version.
22. A user equipment (UE) comprising:
a processor; and
a computer readable storage medium storing programming for execution by the processor, the programming including instructions to
transmit, to an access point (AP), a first extensible authentication protocol (EAP) message destined for an AG, wherein the first EAP message comprises a first plurality of access point names (APNs),
receive, from the AP, a second EAP message comprising an association between the first plurality of APNs and a second plurality of gateway interfaces, and
determine a third plurality of router interface addresses in accordance with the second EAP message.
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 method for reading code symbols by deinterleaving to decode an encoder packet in a receiver for a mobile communication system supporting interleaving, wherein an interleaved encoder packet has (2m*J+R) bits, a bit shift value m, an up-limit value J and a remainder R, wherein the code symbols are written in the format of a 2m*J matrix and R is the number of remaining bits in the last column J, the method comprising the steps of:
generating an interim address by bit reversal order (BRO) operation on an index of a code symbol by excluding the last column when the number of the code symbols of the last column is less than a half of 2m code symbols, and generating the interim address by including the last column when the number of the code symbols of the last column is more than or equal to a half of 2m code symbols;
calculating an address compensation factor for compensating the interim address based on the real number of R code symbols written in the last column J by increasing the address compensation factor by one each time a code symbol appears in the last column when the last column has less than a half of 2m code symbols, and decreasing the address compensation factor by one each time a code symbol is excluded from the last column when the last column has more than or equal to a half of 2m code symbols;
generating a read address by adding the interim address and the address compensation factor for the code symbol,
reading the code symbol written in the generated read address; and
decoding the code symbol read from the generated read address.
2. The method of claim 1, wherein if a size of the subblock is 408, the read address is generated in accordance with the equation
A
k
=
\u2062
3
\xb7
BRO
7
\u2061
(
k
\u2062
\u2062
mod
\u2062
\u2062
128
)
+
\u230a
k
128
\u230b
+
\u2062
\u230a
BRO
7
\u2061
(
k
\u2062
\u2062
mod
\u2062
\u2062
128
)
+
3
4
\u230b
–
\u230a
BRO
7
\u2061
(
k
\u2062
\u2062
mod
\u2062
\u2062
128
)
+
3
16
\u230b
where Ak is the read address, k is an index of the code symbol, BRO means a BRO operation, mod means a modulo operation, and \u2514\u2022\u2518 means a maximum integer not exceeding an input \u201c\u2022\u201d.
3. The method of claim 1, wherein if a size of the subblock is 792, the read address is generated in accordance with the equation
A
k
=
\u2062
3
\xb7
BRO
8
\u2061
(
k
\u2062
\u2062
mod
\u2062
\u2062
256
)
+
\u230a
k
256
\u230b
+
\u2062
\u230a
BRO
8
\u2061
(
k
\u2062
\u2062
mod
\u2062
\u2062
256
)
+
7
8
\u230b
–
\u230a
BRO
8
\u2061
(
k
\u2062
\u2062
mod
\u2062
\u2062
256
)
+
7
32
\u230b
where Ak is the read address, k is an index of the code symbol, BRO means a BRO operation, mod means a modulo operation, and \u2514\u2022\u2518 means a maximum integer not exceeding an input \u201c\u2022\u201d.
4. The method of claim 1, wherein if a size of the subblock is 1560, the read address is generated in accordance with the equation
A
k
=
\u2062
3
\xb7
BRO
9
\u2061
(
k
\u2062
\u2062
mod
\u2062
\u2062
512
)
+
\u230a
k
512
\u230b
+
\u2062
\u230a
BRO
9
\u2061
(
k
\u2062
\u2062
mod
\u2062
512
)
+
15
16
\u230b
–
\u230a
BRO
9
\u2061
(
k
\u2062
\u2062
mod
\u2062
\u2062
512
)
+
15
64
\u230b
where Ak is the read address, k is an index of the code symbol, BRO means a BRO operation, mod means a modulo operation, and \u2514\u2022\u2518 means a maximum integer not exceeding an input \u201c\u2022\u201d.
5. The method of claim 1, wherein if a size of the subblock is 3096, the read address is generated in accordance with the equation
A
k
=
\u2062
3
\xb7
BRO
10
\u2061
(
k
\u2062
\u2062
mod
\u2062
\u2062
1024
)
+
\u230a
k
1024
\u230b
+
\u2062
\u230a
BRO
10
\u2061
(
k
\u2062
\u2062
mod
\u2062
\u2062
1024
)
+
31
32
\u230b
–
\u230a
BRO
10
\u2061
(
k
\u2062
\u2062
mod
\u2062
\u2062
1024
)
+
31
128
\u230b
where Ak is the read address, k is an index of the code symbol, BRO means a BRO operation, mod means a modulo operation, and \u2514\u2022\u2518 means a maximum integer not exceeding an input \u201c\u2022\u201d.
6. The method of claim 1, wherein if a size of the subblock is 6168, the read address is generated in accordance with the equation
A
k
=
\u2062
3
\xb7
BRO
11
\u2061
(
k
\u2062
\u2062
mod
\u2062
\u2062
2048
)
+
\u230a
k
2048
\u230b
+
\u2062
\u230a
BRO
11
\u2061
(
k
\u2062
\u2062
mod
\u2062
\u2062
2048
)
+
63
64
\u230b
–
\u230a
BRO
11
\u2061
(
k
\u2062
\u2062
mod
\u2062
\u2062
2048
)
+
63
256
\u230b
where Ak is the read address, k is an index of the code symbol, BRO means a BRO operation, mod means a modulo operation, and \u2514\u2022\u2518 means a maximum integer not exceeding an input \u201c\u2022\u201d.
7. The method of claim 1, wherein if a size of the subblock is 12312, the read address is generated in accordance with the equation
A
k
=
\u2062
3
\xb7
BRO
12
\u2061
(
k
\u2062
\u2062
mod
\u2062
\u2062
4096
)
+
\u230a
k
4096
\u230b
+
\u2062
\u230a
BRO
12
\u2061
(
k
\u2062
\u2062
mod
\u2062
\u2062
4096
)
+
127
128
\u230b
–
\u230a
BRO
12
\u2061
(
k
\u2062
\u2062
mod
\u2062
\u2062
4096
)
+
127
512
\u230b
where Ak is the read address, k is an index of the code symbol, BRO means a BRO operation, mod means a modulo operation, and \u2514\u2022\u2518 means a maximum integer not exceeding an input \u201c\u2022\u201d.
8. The method of claim 1, wherein if a size of the subblock is 2328, the read address is generated in accordance with the equation
A
k
=
\u2062
2
\xb7
BRO
10
\u2061
(
k
\u2062
\u2062
mod
\u2062
\u2062
2
10
)
+
\u230a
k
2
10
\u230b
+
\u230a
BRO
10
\u2061
(
k
\u2062
\u2062
mod
\u2062
\u2062
2
10
)
+
3
4
\u230b
+
\u2062
\u230a
BRO
10
\u2061
(
k
\u2062
\u2062
mod
\u2062
\u2062
2
10
)
+
29
32
\u230b
–
\u230a
BRO
10
\u2061
(
k
\u2062
\u2062
mod
\u2062
\u2062
2
10
)
+
29
128
\u230b
where Ak is the read address, k is an index of the code symbol, BRO means a BRO operation, mod means a modulo operation, and \u2514\u2022\u2518 means a maximum integer not exceeding an input \u201c\u2022\u201d.
9. The method of claim 1, wherein if a size of the subblock is 3864, the read address is generated in accordance with the equation
A
k
=
\u2062
2
\xb7
BRO
11
\u2061
(
k
\u2062
\u2062
mod
\u2062
\u2062
2
11
)
+
\u230a
k
2
11
\u230b
–
\u230a
BRO
11
\u2061
(
k
\u2062
\u2062
mod
\u2062
\u2062
2
11
)
8
\u230b
+
\u2062
\u230a
BRO
11
\u2061
(
k
\u2062
\u2062
mod
\u2062
\u2062
2
11
)
+
56
64
\u230b
–
\u230a
BRO
11
\u2061
(
k
\u2062
\u2062
mod
\u2062
\u2062
2
11
)
+
56
256
\u230b
where Ak is the read address, k is an index of the code symbol, BRO means a BRO operation, mod means a modulo operation, and \u2514\u2022\u2518 means a maximum integer not exceeding an input \u201c\u2022\u201d.
10. The method of claim 1, wherein if a size of the subblock is 4632, the read address is generated in accordance with the equation
A
k
=
\u2062
2
\xb7
BRO
11
\u2061
(
k
\u2062
\u2062
mod
\u2062
\u2062
2
11
)
+
\u230a
k
2
11
\u230b
+
\u230a
BRO
11
\u2061
(
k
\u2062
\u2062
mod
\u2062
\u2062
2
11
)
+
3
4
\u230b
+
\u2062
\u230a
BRO
11
\u2061
(
k
\u2062
\u2062
mod
\u2062
\u2062
2
11
)
+
61
64
\u230b
–
\u230a
BRO
11
\u2061
(
k
\u2062
\u2062
mod
\u2062
\u2062
2
11
)
+
61
256
\u230b
where Ak is the read address, k is an index of the code symbol, BRO means a BRO operation, mod means a modulo operation, and \u2514\u2022\u2518 means a maximum integer not exceeding an input \u201c\u2022\u201d.
11. The method of claim 1, wherein if a size of the subblock is 9240, the read address is generated in accordance with the equation
A
k
=
\u2062
2
\xb7
BRO
12
\u2061
(
k
\u2062
\u2062
mod
\u2062
\u2062
2
12
)
+
\u230a
k
2
12
\u230b
+
\u230a
BRO
12
\u2061
(
k
\u2062
\u2062
mod
\u2062
\u2062
2
12
)
+
3
4
\u230b
+
\u2062
\u230a
BRO
12
\u2061
(
k
\u2062
\u2062
mod
\u2062
\u2062
2
12
)
+
125
128
\u230b
–
\u230a
BRO
12
\u2061
(
k
\u2062
\u2062
mod
\u2062
\u2062
2
12
)
+
125
512
\u230b
where Ak is the read address, k is an index of the code symbol, BRO means a BRO operation, mod means a modulo operation, and \u2514\u2022\u2518 means a maximum integer not exceeding an input \u201c\u2022\u201d.
12. The method of claim 1, wherein if a size of the subblock is 15384, the read address is generated in accordance with the equation
A
k
=
\u2062
2
\xb7
BRO
13
\u2061
(
k
\u2062
\u2062
mod
\u2062
\u2062
2
13
)
+
\u230a
k
2
13
\u230b
–
\u230a
BRO
13
\u2061
(
k
\u2062
\u2062
mod
\u2062
\u2062
2
13
)
8
\u230b
+
\u2062
\u230a
BRO
13
\u2061
(
k
\u2062
\u2062
mod
\u2062
\u2062
2
13
)
+
248
256
\u230b
–
\u230a
BRO
13
\u2061
(
k
\u2062
\u2062
mod
\u2062
\u2062
2
13
)
+
248
1024
\u230b
where Ak is the read address, k is an index of the code symbol, BRO means a BRO operation, mod means a modulo operation, and \u2514\u2022\u2518 means a maximum integer not exceeding an input \u201c\u2022\u201d.
13. The method of claim 1, wherein the address compensation factor calculation step comprises the step of calculating an address compensation factor by the following equation when the last column has less than a half of 2m code symbols;
C
d
+
\u2061
(
r
k
)
=
\u230a
r
k
+
d
–
(
r
+
+
1
)
d
\u230b
where \u201cd\u201d is a value determined by dividing the total number of rows by the number of code symbols to be inserted, \u201cr+\u201d is an index of a row where a first inserted code symbol is located among the remaining code symbols inserted in the last column, and \u201c+\u201d in a address compensation factor Cd+ indicates that a code symbol is \u201cinserted\u201d in the last column.
14. The method of claim 1, wherein the address compensation factor calculation step comprises the step of calculating an address compensation factor by the following equation when the last column has more than or equal to a half of 2m code symbols;
C
d
–
\u2061
(
r
k
)
=
–
\u230a
r
k
+
d
–
(
r
–
+
1
)
d
\u230b
where \u201cd\u201d is a value determined by dividing the total number of rows by the number of code symbols to be excluded, \u201cr31\u201d is an index of a row where a first excluded code symbol is located, and \u201c\u2212\u201d in Cd\u2212 indicates that a code symbol is \u201cexcluded\u201d from the last column.
15. The method of claim 1 wherein, when the number of code symbols of the last column is less than half of 2m code symbols, the step of generating the interim address further comprises:
performing BRO operation on a column index of the code symbol;
multiplying the BRO operated column index by the integer determined by (J\u22121); and
adding a column index of the code symbol to the product determined in the multiplying step; wherein
the column index of the code symbol is a quotient generated by dividing the code symbol index k into 2m.
16. The method of claim 1 wherein, when the number of code symbols of the last column is equal to or more than half of 2m code symbols, the step of generating the interim address further comprises:
performing BRO operation on a column index of the code symbol;
multiplying the BRO operated column index by the integer represented by J; and
adding a column index of the code symbol to the product determined in the multiplying step; wherein
the column index of the code symbol is a quotient generated by dividing the code symbol index k into 2m.