Abstract
A transmission entity (e.g. user equipment (UE)) is expected to reduce the segmentation of Radio Link Control (RLC) Service Data Units (SDUs) while also minimizing padding. Signaling or provisioning of a constraint value such as a maximum padding amount or minimum segmentation size is employed in a determinative way in the UE to balance these objectives. A receiving entity (e.g. evolved base node (eNB)) benefits from being able to signal these parameters whose application to RLC instances can discriminate between data and signaling radio bearers. Compliance can also be voluntary such as the network entity employing at least a portion of the same approach on the downlink.
| Technology | Declaration Information | Specification Information | Explicitly Disclosed | Patent Type | |||||
|---|---|---|---|---|---|---|---|---|---|
| Declaration Date | Declaration Reference | Declaring Company | Specification Number | ||||||
| 4G | 27/10/2009 | ISLD-200910-017 | QUALCOMM INC | Yes | Basis Patent | ||||
| Not Available | 27/10/2009 | ISLD-200910-017 | QUALCOMM INC | Yes | Basis Patent | ||||
Specification Information
Specification Information
Technologies
Family Information
| All Granted Patents In Patent Family : | ---- |
| All Pending Patents In Patent Family : | ---- |
| Publication No | Technology | Declaration Information | Specification Information | Explicitly Disclosed | Patent Type | |||||
|---|---|---|---|---|---|---|---|---|---|---|
| Declaration Date | Declaration Reference | Declaring Company | Specification Number | |||||||
| US2009252182A1 | 4G | 27/10/2009 | ISLD-200910-017 | QUALCOMM INC | Yes | Basis Patent | ||||
| US2009252182A1 | Not Available | 27/10/2009 | ISLD-200910-017 | QUALCOMM INC | Yes | Basis Patent | ||||
| WO2009124082A1 | 4G | 27/10/2009 | ISLD-200910-017 | QUALCOMM INC | Yes | Family Member | ||||
| WO2009124082A1 | Not Available | 27/10/2009 | ISLD-200910-017 | QUALCOMM INC | Yes | Family Member | ||||
| AU2009231822A1 | 4G | 27/10/2009 | ISLD-200910-017 | QUALCOMM INC | No | Family Member | ||||
| AU2009231822A1 | Not Available | 27/10/2009 | ISLD-200910-017 | QUALCOMM INC | No | Family Member | ||||
| AU2009231822B2 | 4G | 27/10/2009 | ISLD-200910-017 | QUALCOMM INC | No | Family Member | ||||
| AU2009231822B2 | Not Available | 27/10/2009 | ISLD-200910-017 | QUALCOMM INC | No | Family Member | ||||
| CA2718109A1 | 4G | 27/10/2009 | ISLD-200910-017 | QUALCOMM INC | No | Family Member | ||||
| CA2718109A1 | Not Available | 27/10/2009 | ISLD-200910-017 | QUALCOMM INC | No | Family Member | ||||
| CN101983521A | 4G | 27/10/2009 | ISLD-200910-017 | QUALCOMM INC | No | Family Member | ||||
| CN101983521A | Not Available | 27/10/2009 | ISLD-200910-017 | QUALCOMM INC | No | Family Member | ||||
| EP2274928A1 | 4G | 27/10/2009 | ISLD-200910-017 | QUALCOMM INC | No | Family Member | ||||
| EP2274928A1 | Not Available | 27/10/2009 | ISLD-200910-017 | QUALCOMM INC | No | Family Member | ||||
| EP2274928B1 | 4G | 27/10/2009 | ISLD-200910-017 | QUALCOMM INC | No | Family Member | ||||
| EP2274928B1 | Not Available | 27/10/2009 | ISLD-200910-017 | QUALCOMM INC | No | Family Member | ||||
| KR101177639B1 | 4G | 27/10/2009 | ISLD-200910-017 | QUALCOMM INC | No | Family Member | ||||
| KR101177639B1 | Not Available | 27/10/2009 | ISLD-200910-017 | QUALCOMM INC | No | Family Member | ||||
| KR20110002069A | 4G | 27/10/2009 | ISLD-200910-017 | QUALCOMM INC | No | Family Member | ||||
| KR20110002069A | Not Available | 27/10/2009 | ISLD-200910-017 | QUALCOMM INC | No | Family Member | ||||
| MX2010010618A | 4G | 27/10/2009 | ISLD-200910-017 | QUALCOMM INC | No | Family Member | ||||
| MX2010010618A | Not Available | 27/10/2009 | ISLD-200910-017 | QUALCOMM INC | No | Family Member | ||||
| JP2011517904A | 4G | 27/10/2009 | ISLD-200910-017 | QUALCOMM INC | No | Family Member | ||||
| JP2011517904A | Not Available | 27/10/2009 | ISLD-200910-017 | QUALCOMM INC | No | Family Member | ||||
| TW200950419A | 4G | 27/10/2009 | ISLD-200910-017 | QUALCOMM INC | No | Family Member | ||||
| TW200950419A | Not Available | 27/10/2009 | ISLD-200910-017 | QUALCOMM INC | No | Family Member | ||||
| TWI380643B | 4G | 27/10/2009 | ISLD-200910-017 | QUALCOMM INC | No | Family Member | ||||
| TWI380643B | Not Available | 27/10/2009 | ISLD-200910-017 | QUALCOMM INC | No | Family Member | ||||
| RU2010144556A | 4G | 27/10/2009 | ISLD-200910-017 | QUALCOMM INC | No | Family Member | ||||
| RU2010144556A | Not Available | 27/10/2009 | ISLD-200910-017 | QUALCOMM INC | No | Family Member | ||||
| RU2494574C2 | 4G | 27/10/2009 | ISLD-200910-017 | QUALCOMM INC | No | Family Member | ||||
| RU2494574C2 | Not Available | 27/10/2009 | ISLD-200910-017 | QUALCOMM INC | No | Family Member | ||||
| BRPI0909238A2 | 4G | 27/10/2009 | ISLD-200910-017 | QUALCOMM INC | No | Family Member | ||||
| BRPI0909238A2 | Not Available | 27/10/2009 | ISLD-200910-017 | QUALCOMM INC | No | Family Member | ||||
| CN103561425A | 4G | 27/10/2009 | ISLD-200910-017 | QUALCOMM INC | No | Family Member | ||||
| CN103561425A | Not Available | 27/10/2009 | ISLD-200910-017 | QUALCOMM INC | No | Family Member | ||||
| CN103561425B | 4G | 27/10/2009 | ISLD-200910-017 | QUALCOMM INC | No | Family Member | ||||
| CN103561425B | Not Available | 27/10/2009 | ISLD-200910-017 | QUALCOMM INC | No | Family Member | ||||
| HK1153601A1 | 4G | 27/10/2009 | ISLD-200910-017 | QUALCOMM INC | No | Family Member | ||||
| HK1153601A1 | Not Available | 27/10/2009 | ISLD-200910-017 | QUALCOMM INC | No | Family Member | ||||
| JP2013219781A | 4G | 27/10/2009 | ISLD-200910-017 | QUALCOMM INC | No | Family Member | ||||
| JP2013219781A | Not Available | 27/10/2009 | ISLD-200910-017 | QUALCOMM INC | No | Family Member | ||||
| JP5612162B2 | 4G | 27/10/2009 | ISLD-200910-017 | QUALCOMM INC | No | Family Member | ||||
| JP5612162B2 | Not Available | 27/10/2009 | ISLD-200910-017 | QUALCOMM INC | No | Family Member | ||||
| JP2014078955A | 4G | 27/10/2009 | ISLD-200910-017 | QUALCOMM INC | No | Family Member | ||||
| JP2014078955A | Not Available | 27/10/2009 | ISLD-200910-017 | QUALCOMM INC | No | Family Member | ||||
| JP5607229B2 | 4G | 27/10/2009 | ISLD-200910-017 | QUALCOMM INC | No | Family Member | ||||
| JP5607229B2 | Not Available | 27/10/2009 | ISLD-200910-017 | QUALCOMM INC | No | Family Member | ||||
| SG189725A1 | 4G | 27/10/2009 | ISLD-200910-017 | QUALCOMM INC | No | Family Member | ||||
| SG189725A1 | Not Available | 27/10/2009 | ISLD-200910-017 | QUALCOMM INC | No | Family Member | ||||
| UA101834C2 | 4G | 27/10/2009 | ISLD-200910-017 | QUALCOMM INC | No | Family Member | ||||
| UA101834C2 | Not Available | 27/10/2009 | ISLD-200910-017 | QUALCOMM INC | No | Family Member | ||||
| US2014105227A1 | 4G | 27/10/2009 | ISLD-200910-017 | QUALCOMM INC | No | Family Member | ||||
| US2014105227A1 | Not Available | 27/10/2009 | ISLD-200910-017 | QUALCOMM INC | No | Family Member | ||||
| US9055473B2 | 4G | 27/10/2009 | ISLD-200910-017 | QUALCOMM INC | No | Family Member | ||||
| US9055473B2 | Not Available | 27/10/2009 | ISLD-200910-017 | QUALCOMM INC | No | Family Member | ||||
| Publication No | Technology | Declaration Information | Specification Information | Explicitly Disclosed | Patent Type | Status | National Phase Entries | |||||
|---|---|---|---|---|---|---|---|---|---|---|---|---|
| Declaration Date | Declaration Reference | Declaring Company | Specification Information | |||||||||
| ----- | ----- | ----- | ----- | ----- |
S1
|
----- | ----- | ----- | ----- | |||
Technologies
Protocol Stack
Product
Use Cases
Wireless communication
Services
Claim
1. A method for building packet data units (PDUs), comprising: receiving and storing service data units (SDUs); accessing a length value for a PDU to be built and a constraint value; comparing an available grant for a radio link control (RLC) instance to the constraint value; comparing the available grant for a selected one of a data and signaling radio bearer, wherein the constraint value applies to the selected one but not the other of the data and signaling radio bearer; sequentially assembling stored SDUs without exceeding the length value; and determining to perform one of segmenting a last SDU and padding the PDU to reach the length value based upon comparing a remaining portion of the PDU to the constraint value.
2. The method of claim 1, further comprising receiving the constraint value via radio resource control signaling from a network.
3. The method of claim 1, further comprising receiving the constraint value by specified provisioning.
4. The method of claim 1, further comprising voluntarily implementing the determination based upon comparing the remaining portion to the constraint value.
5. The method of claim 1, further comprising accessing at least one constraint value indicating maximum padding allowed and minimum segmenting allowed.
6. The method of claim 1, further comprising padding the PDU in response to determining that an SDU has a segmented payload length that is less than the constraint value.
7. The method of claim 1, further comprising padding the PDU in response to determining that an SDU has a segmented payload length.
8. The method of claim 1, further comprising assembling only complete SDUs or last segment of an SDU in response to determining that the available grant is less than or equal to the constraint value.
9. The method of claim 1, further comprising performing RLC SDU segmentation for a selected one but not the other of a data radio bearer and signaling radio bearer
10. The method of claim 1, wherein the constraint value pertains to a plurality of radio link control (RLC) entities
11. The method of claim 1, wherein the constraint value pertains to a per radio bearer basis
12. The method of claim 1, wherein the constraint value pertains to a segmented fraction of an RLC SDU
13. The method of claim 1, wherein the constraint value pertains to a segmented fraction of an RLC SDU and a maximum padding value
14. The method of claim 1, further comprising considering lower layer header overhead before determining a length for segmenting or padding
15. A method for building packet data units (PDUs), comprising: receiving and storing service data units (SDUs); accessing a length value for a PDU to be built and a constraint value; sequentially assembling stored SDUs without exceeding the length value; determining to perform one of segmenting a last SDU and padding the PDU to reach the length value based upon comparing a remaining portion of the PDU to the constraint value; comparing an available grant for a radio link control (RLC) instance to the constraint value; and performing segmentation according to the available grant without reference to a maximum padding allowed constraint in response to determining that the available grant is less than or equal to the constraint value
16. A method for building packet data units (PDUs), comprising: receiving and storing service data units (SDUs); accessing a length value for a PDU to be built and a constraint value; sequentially assembling stored SDUs without exceeding the length value; determining to perform one of segmenting a last SDU and padding the PDU to reach the length value based upon comparing a remaining portion of the PDU to the constraint value; comparing an available grant for a radio link control (RLC) instance to the constraint value; and performing segmentation according to the available grant without reference to a maximum padding allowed constraint in response to determining that the available grant cannot fit in at least one complete SDU
17. A computer program product for building packet data units (PDUs), comprising: a non-transitory computer-readable storage medium encoded with executable instructions comprising: a first set of codes for causing a computer to receive and store service data units (SDUs); a second set of codes for causing the computer to access a length value for a PDU to be built and a constraint value; a third set of codes for causing the computer to compare an available grant for a radio link control (RLC) instance to the constraint value; a fourth set of codes for causing the computer to compare the available grant for a selected one of a data and signaling radio bearer, wherein the constraint value applies to the selected one but not the other of the data and signaling radio bearer; a fifth set of codes for causing the computer to sequentially assemble stored SDUs without exceeding the length value; and a sixth set of codes for causing the computer to determine to perform one of segmenting a last SDU and padding the PDU to reach the length value based upon comparing a remaining portion of the PDU to the constraint value
18. An apparatus for building packet data units (PDUs), comprising: means for receiving and storing service data units (SDUs); means for accessing a length value for a PDU to be built and a constraint value; means for comparing an available grant for a radio link control (RLC) instance to the constraint value; means for comparing the available grant for a selected one of a data and signaling radio bearer, wherein the constraint value applies to the selected one but not the other of the data and signaling radio bearer; means for sequentially assembling stored SDUs without exceeding the length value; and means for determining to perform one of segmenting a last SDU and padding the PDU to reach the length value based upon comparing a remaining portion of the PDU to the constraint value
19. An apparatus for building packet data units (PDUs), comprising: a memory for receiving and storing service data units (SDUs); and a computing platform for accessing a length value for a PDU to be built and a constraint value, wherein the computing platform is further for comparing an available grant for a radio link control (RLC) instance to the constraint value; wherein the computing platform is further for comparing the available grant for a selected one of a data and signaling radio bearer, wherein the constraint value applies to the selected one but not the other of the data and signaling radio bearer; wherein the computing platform further for sequentially assembling stored SDUs without exceeding the length value; and wherein the computing platform is further for determining to perform one of segmenting a last SDU and padding the PDU to reach the length value based upon comparing a remaining portion of the PDU to the constraint value.
20. The apparatus of claim 19, further comprising a receiver for receiving the constraint value via radio resource control signaling from a network.
21. The apparatus of claim 19, further comprising computer-readable storage medium for receiving the constraint value by specified provisioning.
22. The apparatus of claim 19, wherein the computing platform is further for voluntarily implementing the determination based upon comparing the remaining portion to the constraint value.
23. The apparatus of claim 19, wherein the computing platform is further for accessing at least one constraint value indicating maximum padding allowed and minimum segmenting allowed.
24. The apparatus of claim 19, wherein the computing platform is further for padding the PDU in response to determining that an SDU has a segmented payload length is less than the constraint value.
25. The apparatus of claim 19, wherein the computing platform is further for padding the PDU in response to determining that an SDU has a segmented payload length.
26. The apparatus of claim 19, wherein the computing platform is further for assembling only complete SDUs or last segment of an SDU in response to determining that the available grant is less than or equal to the constraint value.
27. The apparatus of claim 19, wherein the computing platform is further for performing RLC SDU segmentation for a selected one but not the other of a data radio bearer and signaling radio bearer.
28. The apparatus of claim 19, wherein the constraint value pertains to a segmented fraction of an RLC SDU.
29. The apparatus of claim 19, wherein the constraint value pertains to a segmented fraction of an RLC SDU and a maximum padding value.
30. The apparatus of claim 19, wherein the computing platform is further for considering lower layer header overhead before determining a length for segmenting or padding.
31. An apparatus for building packet data units (PDUs), comprising: a memory for receiving and storing service data units (SDUs); and a computing platform for accessing a length value for a PDU to be built and a constraint value, wherein the computing platform further for sequentially assembling stored SDUs without exceeding the length value; wherein the computing platform is further for determining to perform one of segmenting a last SDU and padding the PDU to reach the length value based upon comparing a remaining portion of the PDU to the constraint value; wherein the computing platform is further for comparing an available grant for a radio link control (RLC) instance to the constraint value; and wherein the computing platform is further for performing segmentation according to the available grant without reference to a maximum padding allowed constraint in response to determining that the available grant is less than or equal to the constraint value.
32. An apparatus for building packet data units (PDUs), comprising: a memory for receiving and storing service data units (SDUs); and a computing platform for accessing a length value for a PDU to be built and a constraint value, wherein the computing platform further for sequentially assembling stored SDUs without exceeding the length value; wherein the computing platform is further for determining to perform one of segmenting a last SDU and padding the PDU to reach the length value based upon comparing a remaining portion of the PDU to the constraint value; wherein the computing platform is further for comparing an available grant for a radio link control (RLC) instance to the constraint value; and wherein the computing platform is further for performing segmentation according to the available grant without reference to a maximum padding allowed constraint in response to determining that the available grant cannot fit in at least one complete SDU.
33. A method for decoding packet data units (PDUs), comprising: wirelessly receiving and storing a packet data unit (PDU) from a transmitting entity; and deterministically decoding segmentation and padding of service data units (SDUs) by predicting operation of a transmitting entity, wherein the transmitting entity is known to have built the PDU by, receiving and storing service data units (SDUs), accessing a length value for a PDU to be built and a constraint value, comparing an available grant for a radio link control (RLC) instance to the constraint value, comparing the available grant for a selected one of a data and signaling radio bearer, wherein the constraint value applies to the selected one but not the other of the data and signaling radio bearer, sequentially assembling stored SDUs without exceeding the length value, and determining to perform one of segmenting a last SDU and padding the PDU to reach the length value based upon comparing a remaining portion of the PDU to the constraint value.
34. The method of claim 33, further comprising obtaining the constraint value by a selected one of a group consisting of wirelessly transmitting the constraint value via radio resource control signaling from a network, and
receiving the constraint value by specified provisioning.', 'receiving the constraint value by specified provisioning.
35. The method of claim 33, further comprising voluntarily implementing the determination based upon comparing the remaining portion to the constraint value.
36. The method of claim 33, wherein the constraint value pertains to a segmented fraction of an RLC SDU.
37. The method of claim 33, wherein the constraint value pertains to a segmented fraction of an RLC SDU and a maximum padding value.
38. The apparatus of claim 33, further comprising considering lower layer header overhead before determining a length for segmenting or padding.
39. A computer program product for building packet data units (PDUs), comprising: a non-transitory computer-readable storage medium encoded with executable instructions comprising: a first set of codes for causing a computer to wirelessly receive and store a packet data unit (PDU) from a transmitting entity; and a second set of codes for causing the computer to deterministically decode segmentation and padding of service data units (SDUs) by predicting operation of a transmitting entity, wherein the transmitting entity is known to have built the PDU by, receiving and storing service data units (SDUs), accessing a length value for a PDU to be built and a constraint value, comparing an available grant for a radio link control (RLC) instance to the constraint value, comparing the available grant for a selected one of a data and signaling radio bearer, wherein the constraint value applies to the selected one but not the other of the data and signaling radio bearer, sequentially assembling stored SDUs without exceeding the length value, and determining to perform one of segmenting a last SDU and padding the PDU to reach the length value based upon comparing a remaining portion of the PDU to the constraint value.
40. An apparatus for building packet data units (PDUs), comprising: means for wirelessly receiving and storing a packet data unit (PDU) from a transmitting entity; and means for deterministically decoding segmentation and padding of service data units (SDUs) by predicting operation of a transmitting entity, wherein the transmitting entity is known to have built the PDU by, receiving and storing service data units (SDUs), accessing a length value for a PDU to be built and a constraint value, comparing an available grant for a radio link control (RLC) instance to the constraint value, comparing the available grant for a selected one of a data and signaling radio bearer, wherein the constraint value applies to the selected one but not the other of the data and signaling radio bearer, sequentially assembling stored SDUs without exceeding the length value, and determining to perform one of segmenting a last SDU and padding the PDU to reach the length value based upon comparing a remaining portion of the PDU to the constraint value.
41. An-apparatus for decoding packet data units (PDUs), comprising: a receiver for wirelessly receiving a packet data unit (PDU) from a transmitting entity; a memory for storing the PDU; and a computing platform for deterministically decoding segmentation and padding of service data units (SDUs) by predicting operation of a transmitting entity, wherein the transmitting entity is known to have built the PDU by, receiving and storing service data units (SDUs), accessing a length value for a PDU to be built and a constraint value, comparing an available grant for a radio link control (RLC) instance to the constraint value, comparing the available grant for a selected one of a data and signaling radio bearer, wherein the constraint value applies to the selected one but not the other of the data and signaling radio bearer, sequentially assembling stored SDUs without exceeding the length value, and determining to perform one of segmenting a last SDU and padding the PDU to reach the length value based upon comparing a remaining portion of the PDU to the constraint value.
42. The apparatus of claim 41, wherein the computing platform is further for wirelessly transmitting the constraint value via radio resource control signaling from a network.
43. The apparatus of claim 41, wherein the computing platform is further for receiving the constraint value by specified provisioning.
44. The apparatus of claim 41, wherein the computing platform is further for voluntarily implementing the determination based upon comparing the remaining portion to the constraint value.
45. The apparatus of claim 41, wherein the computing platform is further for accessing at least one constraint value indicating maximum padding allowed and minimum segmenting allowed.']
Associated Portfolios
Licensor Claim Chart
 Claim Chart |
 Technology |
 Creation Date |
 Download |
|---|---|---|---|
|
Claim charts will soon be available!
|
|||
SUMMARY
ClaimChart-US8396083B2-STO
Patent number:US8396083B2
Claim Chart Type : SEP Claim Chart
Price: 200 €
To view claim charts you must become a Gold or Platinum Member.
Upgrade your subscriptionYou have reached the maximum number of patents which can be associated to your account per your subscription. If you wish to associate more patents
Please upgrade your subscription.Note:
The information in blue was extracted from the third parties (Standard Setting Organisation, Espacenet)
The information in grey was provided by the patent holder
The information in purple was extracted from the FrandAvenue
Explicitly disclosed patent:openly and comprehensibly describes all details of the invention in the patent document.
Implicitly disclosed patent:does not explicitly state certain aspects of the invention, but still allows for these to be inferred from the information provided.
Basis patent:The core patent in a family, outlining the fundamental invention from which related patents or applications originate.
Family member:related patents or applications that share a common priority or original filing.