[go: up one dir, main page]
More Web Proxy on the site http://driver.im/

WO2015117453A1 - 一种lte制式下逻辑信道的组操作方法及装置 - Google Patents

一种lte制式下逻辑信道的组操作方法及装置 Download PDF

Info

Publication number
WO2015117453A1
WO2015117453A1 PCT/CN2014/091327 CN2014091327W WO2015117453A1 WO 2015117453 A1 WO2015117453 A1 WO 2015117453A1 CN 2014091327 W CN2014091327 W CN 2014091327W WO 2015117453 A1 WO2015117453 A1 WO 2015117453A1
Authority
WO
WIPO (PCT)
Prior art keywords
logical channel
array
token bucket
value
logical
Prior art date
Application number
PCT/CN2014/091327
Other languages
English (en)
French (fr)
Inventor
陈伟
Original Assignee
深圳市中兴微电子技术有限公司
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by 深圳市中兴微电子技术有限公司 filed Critical 深圳市中兴微电子技术有限公司
Priority to US15/326,565 priority Critical patent/US20170208606A1/en
Publication of WO2015117453A1 publication Critical patent/WO2015117453A1/zh

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W72/00—Local resource management
    • H04W72/12—Wireless traffic scheduling
    • H04W72/1263—Mapping of traffic onto schedule, e.g. scheduled allocation or multiplexing of flows
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W72/00—Local resource management
    • H04W72/50—Allocation or scheduling criteria for wireless resources
    • H04W72/56—Allocation or scheduling criteria for wireless resources based on priority criteria
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L5/00—Arrangements affording multiple use of the transmission path
    • H04L5/003—Arrangements for allocating sub-channels of the transmission path
    • H04L5/0078—Timing of allocation
    • H04L5/0082—Timing of allocation at predetermined intervals
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W72/00—Local resource management
    • H04W72/04—Wireless resource allocation
    • H04W72/044—Wireless resource allocation based on the type of the allocated resource
    • H04W72/0446—Resources in time domain, e.g. slots or frames
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W72/00—Local resource management
    • H04W72/04—Wireless resource allocation
    • H04W72/044—Wireless resource allocation based on the type of the allocated resource
    • H04W72/0453—Resources in frequency domain, e.g. a carrier in FDMA

Definitions

  • the present invention relates to the field of Long Term Evolution (LTE) service data transmission technologies, and in particular, to a group operation method and apparatus for a logical channel in an LTE system.
  • LTE Long Term Evolution
  • service data transmission includes transmission of uplink data and reception of downlink data.
  • the data transmission function is implemented by three layers: Media Access Control (MAC), Radio Link Control (RLC), and Packet Data Convergence Protocol (PDCP).
  • MAC Media Access Control
  • RLC Radio Link Control
  • PDCP Packet Data Convergence Protocol
  • the MAC service data unit (SDU) on multiple logical channels is multiplexed into the transport block (referred to as a group operation) to form a MAC data unit (Protocol Data Unit, PDU); afterwards, transmitted to the physical layer and sent on the air interface; and when the downlink receives data, the MAC SDUs on the plurality of logical channels in the transport block are demultiplexed and transmitted to the RLC layer for subsequent processing; wherein the MAC SDU It is a data set of user services that contains various types of data.
  • the logical channel priority processing is required, and the logical channel priority processing is as follows:
  • Step a Define a priority value for each logical channel, and maintain a B value for each logical channel, where B value is the token bucket value of the logical channel; B j is the B value of the jth logical channel, j Natural number;
  • Step b Allocating a data space to a logical channel whose B j is greater than 0 in the order of logical channel priority. If the priority bit rate (PBR) is set to be infinite, allocate sufficient resources for the logical channel. Enabling grouping of all data on the logical channel;
  • Step c Subtract the B j value of each logical channel by the MAC SDU size grouped in step b;
  • Step d If there is still data space, the data space is allocated to the logical channel in order of priority from high to low; enough resources are allocated for each logical channel, so that all data on the logical channel can be grouped. .
  • the logical operation of the logical channel with B j greater than 0 is performed in step a, and the logical channel is grouped in the order of priority from high to low.
  • the group operation is performed in both steps a and d. In this way, two groups of operations are performed on the same logical channel in the same cycle, and two groups of operations result in an increase in the number of segments and a more complicated process.
  • B j is less than or equal to 0 and a logical channel with a low priority. It is possible that no group operations are performed in the same cycle, which results in inefficient data processing.
  • the embodiments of the present invention are directed to providing a group operation method and device for a logical channel in an LTE system, which can solve the defect of performing two group operations on the same logical channel in the same period in the existing logical channel group operation method.
  • An embodiment of the present invention provides a group operation method for a logical channel in an LTE system, where the method includes:
  • the size of the data space is the sum of all data sizes on a logical channel corresponding to the data space.
  • the data space is allocated to the logical channels in the first array in sequence, so that before the logical channel in the first array completes the group operation, the method further includes:
  • the logical channel that satisfies the set condition is placed in the first array, and the remaining logical channels are placed in the second array.
  • the setting condition is that the token bucket value of the logical channel is greater than 0 and/or the priority bit rate of the logical channel is infinite.
  • the method comprises updating the token bucket value of the logical channel before the arrival time of the transmission time interval:
  • the bucket value updates the token bucket value of the next logical channel.
  • the set value is a priority bit rate of the current logical channel.
  • An embodiment of the present invention further provides a group operation device for a logical channel in an LTE system, where the device includes:
  • a first group of operation units configured to sequentially allocate data spaces for logical channels in the first array, such that logical channels in the first array complete group operations
  • a second group of operation units configured to sequentially allocate data spaces for logical channels in the second array, such that logical channels in the second array complete group operations; wherein, the size of the data space The sum of all data sizes on the logical channel corresponding to the data space.
  • the device comprises:
  • a logical channel allocation unit configured to put a logical channel that satisfies the set condition into the first array, and put a logical channel that does not satisfy the set condition into the second array;
  • the logical channel allocation unit comprises:
  • a limiting module configured to group the logical channels by setting conditions; the setting condition is that a token bucket value of the logical channel is greater than 0 and/or a priority bit rate of the logical channel is infinite.
  • the device comprises:
  • an update unit configured to update a token bucket value of the logical channel before a time of arrival of the transmission time interval.
  • the update unit comprises:
  • An information reading module configured to read a token bucket value of the logical channel
  • An incremental module configured to add a set value to a token bucket value of the logical channel
  • An update module configured to determine whether the token bucket value of the logical channel is less than a threshold value, and if yes, update a token bucket value of the next logical channel; otherwise, the threshold value is used as the The token bucket value of the logical channel updates the token bucket value of the next logical channel.
  • the group operation method and device for logical channels in the LTE system provided by the present invention divides logical channels into two groups according to setting conditions, and then performs group operations on logical channels included in each group, so that the same logical channel is in the same cycle. Only one group operation is performed, which avoids multiple group operations or group operations on the same logical channel, which improves the efficiency of data processing.
  • FIG. 1 is a schematic flowchart of implementing a group operation method of a logical channel in an LTE system according to Embodiment 1 of the present invention
  • FIG. 2 is a composition diagram of a group operation device for a logical channel in an LTE system according to Embodiment 2 of the present invention.
  • FIG. 3 is a flowchart of updating a B value of a logical channel according to Embodiment 3 of the present invention.
  • FIG. 5 is a flowchart of a group operation of a service data unit in Embodiment 3 of the present invention.
  • FIG. 6 is a flowchart of performing logical channel priority processing on each carrier resource cycle in Embodiment 3 of the present invention.
  • FIG. 7 is a flowchart of performing logical channel priority processing by combining each carrier resource in Embodiment 3 of the present invention.
  • this embodiment provides a group operation method for a logical channel in an LTE system. As shown in FIG. 1 , the method includes:
  • S101 sequentially allocate a data space for the logical channel in the first array, so that the logical channel in the first array completes a group operation;
  • S102 sequentially allocate a data space for the logical channel in the second array, so that the logical channel in the second array completes a group operation;
  • the size of the data space is the sum of all data sizes on the logical channel corresponding to the data space.
  • the logical channels are divided into two groups according to the set conditions, and then the logical channels included in each group are grouped, so that only one group operation is performed on the same logical channel in the same period, thereby avoiding multiple groups of the same logical channel. Operation or no group operation improves the efficiency of data processing.
  • Step S100 is further included before step S101: placing a logical channel that satisfies the set condition into the first In an array, a logical channel that does not satisfy the set condition is placed in the second array;
  • the logical channel satisfying the set condition may be put into the first array according to the priority of the logical channel from high to low, where the priority of the logical channel is automatically allocated by the network side;
  • the logical channels that need to perform group operations are grouped according to the same standard, and the same logical channel can be prevented from performing multiple group operations or group operations.
  • step S100 determines the setting condition as: the token bucket value of the logical channel is greater than 0 and/or the priority bit rate of the logical channel is infinite; thus, the priority is high and the token bucket value is greater than 0.
  • the logical channel is prioritized; and the logical channel with an infinite bit rate is capable of providing sufficient processing power for a single data processing.
  • the token bucket value of the logical channel whose priority bit rate is infinite may be less than or equal to 0. Therefore, the setting conditions of the present embodiment are more advantageous for efficient processing of data than the prior art methods.
  • step S101 the data space is allocated to the logical channels in the first array in sequence, so that the logical channel completion group operation in the first array includes:
  • S1011 Read a logical channel from the first array in descending order of priority of logical channels
  • reading the logical channel in order of priority of the logical channel from high to low enables the logical channel with a high priority of the logical channel to preferentially process the data.
  • S1012 allocate a data space for the logical channel; the size of the data space is the sum of all data sizes on the logical channel corresponding to the data space in the first array;
  • S1013 Perform group operations on service data units on the logical channel.
  • S1014 Construct a service data unit subheader for the service data unit that completes the group operation
  • the service data unit subheader includes information such as the size of the SDU and the logical channel number, and is used to indicate the size of the SDU and the like.
  • S1015 Subtract the value of the service data unit on the logical channel by using a token bucket value of the logical channel to obtain a token bucket value of the current logical channel.
  • step S102 is performed.
  • Step S102 is a step performed after the logical channel completion group operation of step S101, if there is still a service data unit that needs to perform a group operation; the specific operation steps are similar to step S101, and include:
  • S1022 allocate a data space for the logical channel; at this time, a size of the data space is a sum of all data sizes on a logical channel corresponding to the data space in the second array;
  • S1023 Perform group operations on service data units on the logical channel.
  • S1024 construct a service data unit subheader for each service data unit that completes the group operation
  • S1025 Subtract the value of the service data unit on the logical channel by using a token bucket value of the logical channel to obtain a token bucket value of the current logical channel.
  • the above steps S101 to S102 are group operation steps performed in one cycle. Before the start time of the next cycle (that is, the arrival time of the transmission time interval), the token bucket value needs to be updated, including:
  • the token bucket value at this time is the token bucket value after the group operation in step S101 and step S102;
  • the set value is a priority bit rate of the current logical channel, and the priority bit rate can reflect a group operation capability of the single logical channel to the service data unit;
  • S3 determining whether the token bucket value of the logical channel is less than a threshold value, and if yes, updating a token bucket value of the next logical channel; otherwise, using the threshold value as the logical channel The token bucket value updates the token bucket value of the next logical channel.
  • N is the threshold value
  • PBR j is the priority bit rate of the jth logical channel
  • BSD j is the duration parameter of the jth logical channel
  • j is a natural number.
  • the logical channel can be grouped only once in the same cycle, which avoids multiple group operations of the logical channel, and improves the efficiency of data processing.
  • the embodiment provides a resource allocation device for a logical channel in an LTE system. As shown in FIG. 2, the device includes:
  • a first group of operation units 201 configured to sequentially allocate data spaces for logical channels in the first array, so that logical channels in the first array complete group operations;
  • the first group of operating units 201 further includes:
  • a first reading module configured to read the logical channel from the first array in descending order of priority of the logical channel; and read the logical channel in a high-to-low order according to the priority of the logical channel The logical channel with higher priority is processed first.
  • a first allocation module configured to allocate a data space for the logical channel; at this time, a size of the data space is a sum of all data sizes on a logical channel corresponding to the data space in the first array;
  • a first group of manipulation modules configured to perform group operations on service data units on the logical channel
  • a first service data unit subheader construction module for using the service data for completing a group operation Unit construction service data unit subheader
  • a first token bucket value processing module configured to subtract a value of a service data unit on the logical channel by a token bucket value of the logical channel, to obtain a token bucket value of the current logical channel;
  • a first data space processing module configured to subtract the value of the service data unit and the value of the service data unit subhead through the data space to obtain a current remaining data space.
  • a second group of operating units 202 configured to sequentially allocate data spaces for logical channels in the second array, such that the service data units on the logical channels in the second array complete group operations; wherein the size of the data space is The sum of all data sizes on the logical channel corresponding to the data space;
  • the second group of operating units 202 further includes:
  • a second reading module configured to read the logical channel from the second array in descending order of priority of the logical channel; and read the logical channel in a high-to-low order according to the priority of the logical channel
  • the logical channel with higher priority is processed first.
  • a second allocation module configured to allocate a data space for the logical channel; at this time, a size of the data space is a sum of all data sizes on a logical channel corresponding to the data space in the second array;
  • a second group of manipulation modules configured to perform group operations on the service data units on the logical channel
  • a second service data unit subheader construction module configured to construct a service data unit subheader for the service data unit that completes the group operation
  • a second token bucket value processing module configured to subtract a value of a service data unit on the logical channel by a token bucket value of the logical channel, to obtain a token bucket value of the current logical channel;
  • a second data space processing module configured to subtract the service data sheet from the data space The value of the element and the value of the subhead of the service data unit get the current remaining data space.
  • the device of this embodiment further includes:
  • the updating unit 203 is configured to update the token bucket value of the logical channel before the arrival time of the transmission time interval;
  • the updating unit 203 further includes:
  • An information reading module 2031 configured to read a token bucket value of the logical channel
  • An increment module 2032 configured to add a set value to a token bucket value of the logical channel
  • the update module 2033 is configured to determine whether the token bucket value of the logical channel is less than a threshold value, and if yes, update a token bucket value of the next logical channel; otherwise, the threshold value is used as a The token bucket value of the logical channel is updated, and the token bucket value of the next logical channel is updated.
  • N is the threshold value
  • PBR j is the priority bit rate of the jth logical channel
  • BSD j is the duration parameter of the jth logical channel
  • j is a natural number.
  • the apparatus of this embodiment may further include a logical channel allocating unit 200, configured to put the logical channel that meets the set condition into the first array, and put the logical channel that does not satisfy the set condition into the second array;
  • the logical channel satisfying the set condition may be put into the first array according to the priority of the logical channel from high to low; wherein the priority of the logical channel is automatically allocated by the network side.
  • the logical channels that need to perform group operations are grouped according to the same standard, and the same logical channel can be prevented from performing multiple group operations or group operations.
  • the logical channel allocation unit 200 further includes:
  • a defining module 2001 configured to group the logical channels by setting conditions
  • the setting condition is that the token bucket value of the logical channel is greater than 0 and/or the priority bit rate of the logical channel is infinite; thus, the logical channel with a high priority and a token bucket value greater than 0 can be prioritized. Processing; logical channels with an infinite priority bit rate can be single data The processing provides sufficient processing capability.
  • the token bucket value of the logical channel whose priority bit rate is infinite may be less than or equal to 0. Therefore, the setting conditions of the present embodiment are more advantageous for efficient processing of data than the prior art methods.
  • the logical channel can be grouped only once in the same cycle, which avoids multiple group operations of the logical channel, and improves the efficiency of data processing.
  • This embodiment describes the present invention in detail through an actual scenario.
  • the B value Before performing the logical channel priority processing, the B value needs to be updated first.
  • the process of updating the B value is as shown in FIG. 3, and the B value of each logical channel is set to 0 when the logical channel is initially established, and an increase operation is performed on each Transmission Time Interval (TTI), including:
  • B j j increase the size of the PBR, the PBR priority j is the j-th bit rate of the logical channel, the predetermined amount of increase B j at each TTI.
  • PBR j is configured by the network to the user equipment;
  • logical channels having a B value greater than 0 and/or a priority bit rate of infinity are stored in an array ActiveLchB[] in descending order of logical channel priority.
  • the RLC module is notified to group the MAC SDUs, and the group MAC SDUs are arranged in the array.
  • the order of storage is performed in sequence.
  • the RLC module group is a MAC SDU on a logical channel, all the currently available data spaces are used to group the data on this logical channel.
  • the B value of each logical channel is decremented by the actual MAC SDU size, and if there is still data space remaining, the third step is performed.
  • the remaining logical channels are stored in the array ActiveLch[] in descending order of logical channel priority.
  • group MAC SDUs are also performed in the order of storage, when grouping one logical channel, all the remaining data spaces currently available are used to group the service data units on the logical channel. As shown in Figure 4, it includes:
  • S402 Store the remaining logical channels in an array ActiveLch[] according to the logical channel priority from high to low.
  • the processing of the MAC SDU on the group logical channel is as follows:
  • step S506 determining whether the current data space is still capable of grouping the next MAC SDU; if Then, the process goes to step S501, otherwise the process ends.
  • the carrier aggregation is introduced in the evolved Evolved-UMTS Terrestrial Radio Access (E-UTRA) version 10.
  • E-UTRA evolved Evolved-UMTS Terrestrial Radio Access
  • the above logical channel priority processing method can also be used under carrier aggregation.
  • the B value is also updated first, and the B value update process is as shown in FIG.
  • the available data space on multiple carriers needs to be considered under carrier aggregation.
  • the first method is to perform logical channel priority processing on each carrier resource cycle, as shown in Figure 6:
  • S601 Acquire a next carrier resource, and perform a logical channel priority processing process on the carrier resource.
  • S602 A logical channel with a B value greater than 0 and/or a priority bit rate being infinite, according to Logical channel priorities are stored in high-to-low order into the array ActiveLchB[];
  • S603 storing the remaining logical channels in an array ActiveLch[] according to a logical channel priority from highest to lowest;
  • the second method is to combine the carrier resources for a logical channel priority processing, as shown in Figure 7:
  • S701 The logical channel with the B value greater than 0 and/or the priority bit rate being infinite is stored in the array ActiveLchB[] according to the logical channel priority from highest to lowest;
  • S702 storing all remaining logical channels in an array ActiveLch[] according to a logical channel priority from highest to lowest;
  • the disclosed apparatus and method may be implemented in other manners.
  • the device embodiments described above are merely illustrative.
  • the division of the unit is only a logical function division.
  • there may be another division manner such as: multiple units or components may be combined, or Can be integrated into another system, or some features can be ignored or not executed.
  • the coupling, or direct coupling, or communication connection of the various components shown or discussed may be indirect coupling or communication connection through some interface, device or unit, and may be electrical, mechanical or otherwise. Form.
  • the units described above as separate components may or may not be physically separated, and the components displayed as the unit may or may not be physical units, that is, may be located in one place or distributed to multiple network units; Some or all of the units may be selected according to actual needs to achieve the purpose of the solution of the embodiment.
  • each functional unit in each embodiment of the present invention may be integrated into one processing module, or each unit may be separately used as one unit, or two or more units may be integrated into one unit; the above integration
  • the unit can be implemented in the form of hardware or in the form of hardware plus software functional units.
  • the foregoing program may be stored in a computer readable storage medium, and the program is executed when executed.
  • the foregoing storage medium includes: a mobile storage device, a read-only memory (ROM), a random access memory (RAM), a magnetic disk, or an optical disk.
  • ROM read-only memory
  • RAM random access memory
  • magnetic disk or an optical disk.
  • optical disk A medium that can store program code.
  • the invention discloses a group operation method and device for logical channels in the LTE system, which can divide logical channels into two groups according to setting conditions, and then perform group operations on logical channels included in each group respectively, so that the same cycle is performed in the same cycle.
  • the logical channel performs only one group operation, which avoids multiple group operations or group operations on the same logical channel, which improves the efficiency of data processing.

Landscapes

  • Engineering & Computer Science (AREA)
  • Signal Processing (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Mobile Radio Communication Systems (AREA)

Abstract

本发明公开了一种LTE制式下逻辑信道的组操作方法，包括：依次为第一数组中的逻辑信道分配数据空间，使得所述第一数组中的逻辑信道完成组操作；依次为第二数组中的逻辑信道分配数据空间，使得所述第二数组中的逻辑信道完成组操作；其中，所述数据空间的大小为与所述数据空间对应的逻辑信道上的全部数据大小之和。本发明还同时公开了一种LTE制式下逻辑信道的组操作装置。

Description

一种LTE制式下逻辑信道的组操作方法及装置 技术领域
本发明涉及长期演进(Long Term Evolution，LTE)业务数据传输技术领域，尤其涉及一种LTE制式下逻辑信道的组操作方法及装置。
背景技术
LTE业务数据传输的场景中，业务数据传输包括上行数据的发送和下行数据的接收。在协议中，数据传输功能由媒体接入控制(Media Access Control，MAC)、无线链路控制(Radio Link Control，RLC)和分组数据聚合(Packet Data Convergence Protocol，PDCP)这三层实现。其中，MAC层上行发送数据时，将多个逻辑信道上的MAC服务数据单元(Service Data Unit，SDU)复用到传输块中(简称为组操作)，组成MAC协议数据单元(Protocol Data Unit，PDU)；之后，传输给物理层并在空口上发送；而下行接收数据时，解复用传输块中多个逻辑信道上的MAC SDU，传输给RLC层进行后续处理；其中，所述MAC SDU是用户服务的数据集，包含有各种类型的数据。
在MAC层上行复用MAC SDU时，需要进行逻辑信道优先级处理，进行逻辑信道优先级处理的方法如下：
步骤a.为每个逻辑信道定义一个优先级值，同时每个逻辑信道维护一个B值，其中，B值是逻辑信道的令牌桶值；Bj为第j个逻辑信道的B值，j为自然数；
步骤b.按逻辑信道优先级的顺序给Bj大于0的逻辑信道分配数据空间，如果优先级比特速率(Prioritised Bit Rate，PBR)设置成无限大，则为 该逻辑信道分配足够多的资源，使得能够组完该逻辑信道上的所有数据；
步骤c.把每个逻辑信道的Bj值减去在步骤b中所组的MAC SDU大小；
步骤d.如果还有数据空间，那么，按照优先级从高到低的顺序来给逻辑信道分配数据空间；为每个逻辑信道分配足够多的资源，使得能够组完该逻辑信道上的所有数据。
采用以上方法进行逻辑信道组操作时，在步骤a中对Bj大于0的逻辑信道进行组操作，步骤d中又按照优先级从高到低的顺序来对逻辑信道进行组操作。当有逻辑信道同时满足Bj大于0和优先级高的条件时，会在步骤a和步骤d中都进行组操作。这样，就导致在同一周期内对同一逻辑信道进行两次组操作，而两次组操作会导致分段数目的增加，过程也更复杂；同时，Bj小于等于0和优先级低的逻辑信道的可能在同一个周期内没有进行组操作，这样，就导致数据处理效率低下。
现有技术中，有方法将同一个逻辑信道在步骤a和步骤d中分配的资源结合起来，对同一个逻辑信道只做一次组操作，但该方法需要增加资源结合的处理；并且，对Bj的递减操作过程也很复杂。
发明内容
有鉴于此，本发明实施例期望提供一种LTE制式下逻辑信道的组操作方法及装置，能够解决现有逻辑信道组操作方法中在同一周期内对同一逻辑信道进行两次组操作的缺陷。
为达到上述目的，本发明实施例的技术方案是这样实现的：
本发明实施例提供了一种LTE制式下逻辑信道的组操作方法，所述方法包括：
依次为第一数组中的逻辑信道分配数据空间，使得所述第一数组中的 逻辑信道完成组操作；
依次为第二数组中的逻辑信道分配数据空间，使得所述第二数组中的逻辑信道完成组操作；
其中，所述数据空间的大小为与所述数据空间对应的逻辑信道上的全部数据大小之和。
优选地，在依次为所述第一数组中的逻辑信道分配数据空间，使得所述第一数组中的逻辑信道完成组操作之前还包括：
将满足设定条件的逻辑信道放入第一数组中，将剩余的逻辑信道放入第二数组中。
优选地，所述设定条件为：逻辑信道的令牌桶值大于0和/或逻辑信道的优先级比特速率为无限大。
优选地，所述方法包括在传输时间间隔到来时刻之前，对所述逻辑信道的令牌桶值进行更新：
读取所述逻辑信道的令牌桶值；
为所述逻辑信道的令牌桶值增加设定值；
判断此时所述逻辑信道的令牌桶值是否小于门限值，若是，则更新下一个所述逻辑信道的令牌桶值；否则，将所述门限值作为所述逻辑信道的令牌桶值，更新下一个所述逻辑信道的令牌桶值。
优选地，所述设定值为当前所述逻辑信道的优先级比特速率。
本发明实施例还提供了一种LTE制式下逻辑信道的组操作装置，所述装置包括：
第一组操作单元，用于依次为第一数组中的逻辑信道分配数据空间，使得所述第一数组中的逻辑信道完成组操作；
第二组操作单元，用于依次为第二数组中的逻辑信道分配数据空间，使得所述第二数组中的逻辑信道完成组操作；其中，所述数据空间的大小 为与所述数据空间对应的逻辑信道上的全部数据大小之和。
优选地，所述装置包括：
逻辑信道分配单元，用于将满足设定条件的逻辑信道放入第一数组中，将不满足设定条件的逻辑信道放入第二数组中；
优选地，所述逻辑信道分配单元包括：
限定模块，用于通过设定条件对所述逻辑信道进行分组；所述设定条件为逻辑信道的令牌桶值大于0和/或逻辑信道的优先级比特速率为无限大的。
优选地，所述装置包括：
更新单元，用于在传输时间间隔到来时刻之前，对所述逻辑信道的令牌桶值进行更新。
优选地，所述更新单元包括：
信息读取模块，用于读取所述逻辑信道的令牌桶值；
增量模块，用于为所述逻辑信道的令牌桶值增加设定值；
更新模块，用于判断此时所述逻辑信道的令牌桶值是否小于门限值，若是，则更新下一个所述逻辑信道的令牌桶值；否则，将所述门限值作为所述逻辑信道的令牌桶值，更新下一个所述逻辑信道的令牌桶值。
本发明所提供的LTE制式下逻辑信道的组操作方法及装置，根据设定条件将逻辑信道分成两组，然后对每组包含的逻辑信道分别进行组操作，使得在同一周期内对同一逻辑信道只进行一次组操作，避免了同一逻辑信道进行多次组操作或没有进行组操作，提高了数据处理的效率。
附图说明
图1为本发明实施例1中LTE制式下逻辑信道的组操作方法的实现流程示意图；
图2为本发明实施例2中LTE制式下逻辑信道的组操作装置的组成结 构示意图；
图3为本发明实施例3中逻辑信道的B值的更新流程图；
图4为本发明实施例3中逻辑信道优先级处理的流程图；
图5为本发明实施例3中服务数据单元的组操作流程图；
图6为本发明实施例3中对各载波资源循环进行逻辑信道优先级处理的流程图；
图7为本发明实施例3中组合各载波资源进行一次逻辑信道优先级处理的流程图。
具体实施方式
以下结合说明书附图及具体实施例对本发明的技术方案做进一步的详细阐述。
实施例1
为了解决现有技术存在的技术问题，本实施例提供了一种LTE制式下逻辑信道的组操作方法，如图1所示，该方法包括：
S101：依次为第一数组中的逻辑信道分配数据空间，使得所述第一数组中的逻辑信道完成组操作；
S102：依次为第二数组中的逻辑信道分配数据空间，使得所述第二数组中的逻辑信道完成组操作；
上述步骤S101到S102中，所述数据空间的大小为与所述数据空间对应的逻辑信道上的全部数据大小之和。
本实施例根据设定条件将逻辑信道分成两组，然后对每组包含的逻辑信道进行组操作，使得在同一周期内对同一逻辑信道只进行一次组操作，避免了同一逻辑信道进行多次组操作或没有进行组操作，提高了数据处理的效率。
在步骤S101之前还包括步骤S100：将满足设定条件的逻辑信道放入第 一数组中，将不满足设定条件的逻辑信道放入第二数组中；
本步骤中，可以按照逻辑信道的优先级由高到低将满足设定条件的逻辑信道放入第一数组中，这里，逻辑信道的优先级是由网络侧自动分配；
本实施例中，按照同一标准对需要进行组操作的逻辑信道进行分组，能够避免同一逻辑信道进行多次组操作或没有进行组操作。
具体的，步骤S100将设定条件确定为：逻辑信道的令牌桶值大于0和/或逻辑信道的优先级比特速率为无限大；这样，就能对优先级高且令牌桶值大于0的逻辑信道优先处理；而优先级比特速率为无限大的逻辑信道能够为单次数据处理提供足够的处理能力。这里，优先级比特速率为无限大的逻辑信道的令牌桶值可以是小于等于0。因此，本实施例的设定条件比现有方法更有利于数据的有效处理。
步骤S101中，依次为所述第一数组中的逻辑信道分配数据空间，使得所述第一数组中的逻辑信道完成组操作包括：
S1011：按逻辑信道的优先级由高到低的顺序从所述第一数组中读取逻辑信道；
这里，按逻辑信道的优先级由高到低的顺序读取逻辑信道能够让逻辑信道优先级高的逻辑信道优先处理数据。
S1012：为所述逻辑信道分配数据空间；此时数据空间的大小为第一数组中与所述数据空间对应的逻辑信道上的全部数据大小之和；
S1013：对所述逻辑信道上的服务数据单元进行组操作；
S1014：为完成组操作的所述服务数据单元构造服务数据单元子头；
其中，所述服务数据单元子头包含SDU的大小及逻辑信道编号等信息，用于指示SDU的大小等。
S1015：通过所述逻辑信道的令牌桶值减去所述逻辑信道上的服务数据单元的值，得到当前所述逻辑信道的令牌桶值；
S1016：通过所述数据空间减去所述服务数据单元的值和服务数据单元子头的值，得到当前的剩余数据空间。
如果现有的数据空间已经全部分配给第一数组中的逻辑空间了，或逻辑信道上的服务数据单元已经全部完成组操作了，此时就可以结束了；否则，就要进行步骤S102。
步骤S102是在步骤S101的逻辑信道完成组操作后，如果还有服务数据单元需要进行组操作时才进行的步骤；其具体操作步骤和步骤S101类似，包括：
S1021：按逻辑信道的优先级由高到低的顺序从所述第二数组中读取逻辑信道；
S1022：为所述逻辑信道分配数据空间；此时数据空间的大小为第二数组中与所述数据空间对应的逻辑信道上的全部数据大小之和；
S1023：对所述逻辑信道上的服务数据单元进行组操作；
S1024：为每个完成组操作的所述服务数据单元构造服务数据单元子头；
S1025：通过所述逻辑信道的令牌桶值减去所述逻辑信道上的服务数据单元的值，得到当前所述逻辑信道的令牌桶值；
S1026：通过所述数据空间减去所述服务数据单元的值和服务数据单元子头的值，得到当前的剩余数据空间。
上述的步骤S101到S102是在一个周期内进行的组操作步骤，在下一个周期开始时刻(即，传输时间间隔到来时刻)之前，还需要对令牌桶值进行更新，包括：
S1：读取所述逻辑信道的令牌桶值；
这里，此时的令牌桶值是步骤S101和步骤S102中组操作后的令牌桶值；
S2：为所述逻辑信道的令牌桶值增加设定值；
其中，设定值为当前所述逻辑信道的优先级比特速率，优先级比特速率能反映单次逻辑信道对服务数据单元的组操作能力；
S3：判断此时所述逻辑信道的令牌桶值是否小于门限值，若是，则更新下一个所述逻辑信道的令牌桶值；否则，将所述门限值作为所述逻辑信道的令牌桶值，更新下一个所述逻辑信道的令牌桶值。
这里，所述门限值通过N＝PBRj×BSDj计算；
其中，N为门限值；PBRj为第j个逻辑信道的优先级比特速率；BSDj为第j个逻辑信道的持续时间参量，j为自然数。
通过上述步骤，能够使逻辑信道在同一周期内只进行一次组操作，避免了逻辑信道的多次组操作，提高了数据处理的效率。
实施例2
本实施例和实施例1属于同一发明构思。本实施例提供了一种LTE制式下逻辑信道的资源分配装置，如图2所示，所述装置包括：
第一组操作单元201，用于依次为第一数组中的逻辑信道分配数据空间，使得所述第一数组中的逻辑信道完成组操作；
具体的，所述第一组操作单元201进一步包括：
第一读取模块，用于按逻辑信道的优先级由高到低的顺序从所述第一数组中读取逻辑信道；按逻辑信道的优先级由高到低的顺序读取逻辑信道能够对优先级高的逻辑信道优先处理。
第一分配模块，用于为所述逻辑信道分配数据空间；此时数据空间的大小为第一数组中与所述数据空间对应的逻辑信道上的全部数据大小之和；
第一组操纵模块，用于对所述逻辑信道上的服务数据单元进行组操作；
第一服务数据单元子头构造模块，用于为完成组操作的所述服务数据 单元构造服务数据单元子头；
第一令牌桶值处理模块，用于通过所述逻辑信道的令牌桶值减去所述逻辑信道上的服务数据单元的值，得到当前所述逻辑信道的令牌桶值；
第一数据空间处理模块，用于通过所述数据空间减去所述服务数据单元的值和服务数据单元子头的值，得到当前的剩余数据空间。
如果现有的数据空间已经全部分配给第一数组中的逻辑空间了，或逻辑信道上的服务数据单元已经全部完成组操作了，此时就可以结束了。否则就要通过第二组操作单元202进行数据处理。
第二组操作单元202，用于依次为第二数组中的逻辑信道分配数据空间，使得所述第二数组中的逻辑信道上的服务数据单元完成组操作；其中，所述数据空间的大小为与所述数据空间对应的逻辑信道上的全部数据大小之和；
具体的，所述第二组操作单元202进一步包括：
第二读取模块，用于按逻辑信道的优先级由高到低的顺序从所述第二数组中读取逻辑信道；按逻辑信道的优先级由高到低的顺序读取逻辑信道能够对优先级高的逻辑信道优先处理。
第二分配模块，用于为所述逻辑信道分配数据空间；此时数据空间的大小为第二数组中与所述数据空间对应的逻辑信道上的全部数据大小之和；
第二组操纵模块，用于对所述逻辑信道上的服务数据单元进行组操作；
第二服务数据单元子头构造模块，用于为完成组操作的所述服务数据单元构造服务数据单元子头；
第二令牌桶值处理模块，用于通过所述逻辑信道的令牌桶值减去所述逻辑信道上的服务数据单元的值，得到当前所述逻辑信道的令牌桶值；
第二数据空间处理模块，用于通过所述数据空间减去所述服务数据单 元的值和服务数据单元子头的值，得到当前的剩余数据空间。
此外，本实施例装置还包括：
更新单元203，用于在传输时间间隔到来时刻之前，对所述逻辑信道的令牌桶值进行更新；
具体的，所述更新单元203进一步包括：
信息读取模块2031，用于读取所述逻辑信道的令牌桶值；
增量模块2032，用于为所述逻辑信道的令牌桶值增加设定值；
更新模块2033，用于判断此时所述逻辑信道的令牌桶值是否小于门限值，若是，则更新下一个所述逻辑信道的令牌桶值；否则，将所述门限值作为所述逻辑信道的令牌桶值，更新下一个所述逻辑信道的令牌桶值。
这里，所述门限值通过N＝PBRj×BSDj计算；
其中，N为门限值；PBRj为第j个逻辑信道的优先级比特速率；BSDj为第j个逻辑信道的持续时间参量，j为自然数。
本实施例装置还可以包括逻辑信道分配单元200，用于将满足设定条件的逻辑信道放入第一数组中，将不满足设定条件的逻辑信道放入第二数组中；
这里，可以按照逻辑信道的优先级由高到低将满足设定条件的逻辑信道放入第一数组中；其中，逻辑信道的优先级是由网络侧自动分配。
本实施例中，按照同一标准对需要进行组操作的逻辑信道进行分组，能够避免同一逻辑信道进行多次组操作或没有进行组操作。
具体的，所述逻辑信道分配单元200进一步包括：
限定模块2001，用于通过设定条件对所述逻辑信道进行分组；
其中，所述设定条件为逻辑信道的令牌桶值大于0和/或逻辑信道的优先级比特速率为无限大；这样，就能对优先级高且令牌桶值大于0的逻辑信道优先处理；而优先级比特速率为无限大的逻辑信道能够为单次数据处 理提供足够的处理能力，这里，优先级比特速率为无限大的逻辑信道的令牌桶值可以是小于等于0。因此，本实施例的设定条件比现有方法更有利于数据的有效处理。
通过上述步骤，能够使逻辑信道在同一周期内只进行一次组操作，避免了逻辑信道的多次组操作，提高了数据处理的效率。
实施例3
本实施例通过一个实际的场景对本发明进行详细说明。
在进行逻辑信道优先级处理过程之前，首先需要更新B值。B值更新的流程如图3所示，每个逻辑信道的B值在逻辑信道初始建立时设置为0，在每个传输时间间隔(Transmission Time Interval，TTI)上做增加操作，包括：
S301：判断所有逻辑信道的B值是否更新完成，如果是，则结束流程，否则继续下一步；
S302：读取需要更新B值的下一逻辑信道，逻辑信道的编号设为j；
S303：Bj增加PBRj的大小，PBRj为第j个逻辑信道的优先级比特速率，规定了Bj在每个TTI上增加的量。PBRj由网络配置到用户设备；
S304：判断Bj是否小于门限值N，所述门限值N通过N＝PBRj×BSDj计算；BSDj为第j个逻辑信道的持续时间参量(Bucket Size Duration，BSD)，规定了逻辑信道Bj值的上限。该值由网侧配置到终端侧。若是，则跳转至步骤1，否则继续下一步；
S305：设置Bj为门限值N。
B值更新之后，在每个TTI上进行如下的逻辑信道优先级处理过程：
第一步，按逻辑信道优先级由高到低的顺序把B值大于0和/或优先级比特速率为无限大的逻辑信道存储到数组ActiveLchB[]中。
然后，通知RLC模块去组MAC SDU，组MAC SDU时，按照数组中 存储的顺序依次进行。RLC模块组一个逻辑信道上的MAC SDU时，利用当前可用的所有剩余数据空间去组这个逻辑信道上的数据。第一步完成之后，把每个逻辑信道的B值递减实际所组的MAC SDU大小，如果还有数据空间剩余，则进行第三步。
第三步，剩余的逻辑信道按逻辑信道优先级由高到低的顺序存储到数组ActiveLch[]中。组MAC SDU时，同样按照存储的顺序进行，在组一个逻辑信道时，还是利用当前可用的所有剩余数据空间去组这个逻辑信道上的服务数据单元。如图4所示，包括：
S401：把B值大于0和/或优先级比特速率为无限大的所有逻辑信道，按照逻辑信道优先级由高到低的顺序存储到数组ActiveLchB[]中。
S402：把剩余逻辑信道，按照逻辑信道优先级由高到低的顺序存储到数组ActiveLch[]中。
S403：使用当前可用的数据空间来组各个逻辑信道上的MAC SDU，直到当前可用的数据空间全部用完，或者所有逻辑信道上的数据均已经组完为止。具体流程如图5所示。
组逻辑信道上MAC SDU的处理过程如下所示：
S501：判断数组ActiveLchB[]中的逻辑信道是否取完，如果取完，则跳转至步骤S507，否则继续下一步；
S502：从数组ActiveLchB[]中取下一个逻辑信道j；
S503：组逻辑信道j上MAC SDU，每组出一个MAC SDU之后，构造相应的MAC SDU子头；
S504：Bj减去已组出的所有MAC SDU大小；
S505：可用数据空间减去已组出的所有MAC SDU和MAC SDU子头大小；
S506：判断当前数据空间是否还能够去组下一个MAC SDU；如果能组， 则跳转至步骤S501，否则结束流程；
S507：判断数组ActiveLch[]中的逻辑信道是否取完，如果取完，则结束流程，否则继续下一步；
S508：从数组ActiveLch[]中取下一逻辑信道k；
S509：组逻辑信道k上MAC SDU。每组出一个MAC SDU之后，构造相应的MAC SDU子头；
S510：Bk减去已组出的所有MAC SDU大小；
S511：可用数据空间减去已组出的所有MAC SDU和MAC SDU子头大小；
S512：判断当前数据空间是否还能够去组MAC SDU。是则跳转至步骤S507，否则结束流程。
在演进的通用陆地无线接入(Evolved-UMTS Terrestrial Radio Access，E-UTRA)版本10中引入载波聚合，在载波聚合下，用户设备聚合可供使用的多个载波来进行上下行的数据传输，从而提高传输速率。由于引入了载波聚合，在每一个1毫秒的TTI上，各个可用载波都可以分配数据空间，假设分配了n(n>＝0)个上行资源，用户设备根据这n个上行资源进行逻辑信道优先级处理从而组出n个MAC PDU。
以上的逻辑信道优先级处理方法也可用在载波聚合下。在载波聚合下进行逻辑信道优先级处理时，也是要先更新B值，B值更新流程如图3所示。同时载波聚合下需考虑多个载波上的可用数据空间。有两种方法对这些载波上的可用数据空间进行处理，第一种方法是对各载波资源循环进行逻辑信道优先级处理，方法如图6所示：
S601：获取下一载波资源，对该载波资源进行逻辑信道优先级处理过程；
S602：把B值大于0和/或优先级比特速率为无限大的逻辑信道，按照 逻辑信道优先级由高到低的顺序存储到数组ActiveLchB[]中；
S603：把剩余逻辑信道，按照逻辑信道优先级由高到低的顺序存储到数组ActiveLch[]中；
S604：进行组逻辑信道MAC SDU处理，组逻辑信道MAC SDU处理的方法如图3所示；
S605:判断所有载波资源是否处理完成，是则流程结束，否则跳转至步骤S601。
第2种方法是组合各载波资源进行一次逻辑信道优先级处理，方法如图7所示：
S701：把B值大于0和/或优先级比特速率为无限大的逻辑信道，按照逻辑信道优先级由高到低的顺序存储到数组ActiveLchB[]中；
S702：把剩余所有逻辑信道，按照逻辑信道优先级由高到低的顺序存储到数组ActiveLch[]中；
S703：获取下一载波资源，使用该载波资源组各逻辑信道MAC SDU；
S704：进行组逻辑信道MAC SDU处理，组逻辑信道MAC SDU处理的方法如图5所示；
S705:判断所有载波资源是否处理完成，是，则结束流程，否则跳转至步骤S703。
在本申请所提供的几个实施例中，应该理解到，所揭露的设备和方法，可以通过其它的方式实现。以上所描述的设备实施例仅仅是示意性的，例如，所述单元的划分，仅仅为一种逻辑功能划分，实际实现时可以有另外的划分方式，如：多个单元或组件可以结合，或可以集成到另一个系统，或一些特征可以忽略，或不执行。另外，所显示或讨论的各组成部分相互之间的耦合、或直接耦合、或通信连接可以是通过一些接口，设备或单元的间接耦合或通信连接，可以是电性的、机械的或其它 形式的。
上述作为分离部件说明的单元可以是、或也可以不是物理上分开的，作为单元显示的部件可以是、或也可以不是物理单元，即可以位于一个地方，也可以分布到多个网络单元上；可以根据实际的需要选择其中的部分或全部单元来实现本实施例方案的目的。
另外，在本发明各实施例中的各功能单元可以全部集成在一个处理模块中，也可以是各单元分别单独作为一个单元，也可以两个或两个以上单元集成在一个单元中；上述集成的单元既可以采用硬件的形式实现，也可以采用硬件加软件功能单元的形式实现。
本领域普通技术人员可以理解：实现上述方法实施例的全部或部分步骤可以通过程序指令相关的硬件来完成，前述的程序可以存储于一计算机可读取存储介质中，该程序在执行时，执行包括上述方法实施例的步骤；而前述的存储介质包括：移动存储设备、只读存储器(Read-Only Memory，ROM)、随机存取存储器(Random Access Memory，RAM)、磁碟或者光盘等各种可以存储程序代码的介质。
以上所述，仅为本发明的具体实施方式，但本发明的保护范围并不局限于此，任何熟悉本技术领域的技术人员在本发明揭露的技术范围内，可轻易想到变化或替换，都应涵盖在本发明的保护范围之内。因此，本发明的保护范围应以所述权利要求的保护范围为准。
工业实用性
本发明公开了一种LTE制式下逻辑信道的组操作方法及装置，能够根据设定条件将逻辑信道分成两组，然后对每组包含的逻辑信道分别进行组操作，使得在同一周期内对同一逻辑信道只进行一次组操作，避免了同一逻辑信道进行多次组操作或没有进行组操作，提高了数据处理的效率。

Claims (10)

  1. 一种LTE制式下逻辑信道的组操作方法，所述方法包括：
    依次为第一数组中的逻辑信道分配数据空间，使得所述第一数组中的逻辑信道完成组操作；
    依次为第二数组中的逻辑信道分配数据空间，使得所述第二数组中的逻辑信道完成组操作；
    其中，所述数据空间的大小为与所述数据空间对应的逻辑信道上的全部数据大小之和。
  2. 根据权利要求1所述的方法，其中，依次为所述第一数组中的逻辑信道分配数据空间，使得所述第一数组中的逻辑信道完成组操作之前，所述方法还包括：
    将满足设定条件的逻辑信道放入第一数组中，将剩余的逻辑信道放入第二数组中。
  3. 根据权利要求2所述的方法，其中，所述设定条件为：
    逻辑信道的令牌桶值大于0和/或逻辑信道的优先级比特速率为无限大。
  4. 根据权利要求1所述的方法，其中，所述方法包括在传输时间间隔到来时刻之前，对所述逻辑信道的令牌桶值进行更新：
    读取所述逻辑信道的令牌桶值；
    为所述逻辑信道的令牌桶值增加设定值；
    判断此时所述逻辑信道的令牌桶值是否小于门限值，若是，则更新下一个所述逻辑信道的令牌桶值；否则，将所述门限值作为所述逻辑信道的令牌桶值，更新下一个所述逻辑信道的令牌桶值。
  5. 根据权利要求4所述的方法，其中，所述设定值为当前所述逻辑信道的优先级比特速率。
  6. 一种LTE制式下逻辑信道的组操作装置，所述装置包括：
    第一组操作单元，配置为依次为第一数组中的逻辑信道分配数据空间，使得所述第一数组中的逻辑信道完成组操作；
    第二组操作单元，配置为依次为第二数组中的逻辑信道分配数据空间，使得所述第二数组中的逻辑信道完成组操作；其中，所述数据空间的大小为与所述数据空间对应的逻辑信道上的全部数据大小之和。
  7. 根据权利要求6所述的装置，其中，所述装置包括：
    逻辑信道分配单元，配置为将满足设定条件的逻辑信道放入第一数组中，将不满足设定条件的逻辑信道放入第二数组中；
  8. 根据权利要求7所述的装置，其中，所述逻辑信道分配单元包括：
    限定模块，配置为通过设定条件对所述逻辑信道进行分组；所述设定条件为逻辑信道的令牌桶值大于0和/或逻辑信道的优先级比特速率为无限大的。
  9. 根据权利要求7所述的装置，其中，所述装置包括：
    更新单元，配置为在传输时间间隔到来时刻之前，对所述逻辑信道的令牌桶值进行更新。
  10. 根据权利要求9所述的装置，其中，所述更新单元包括：
    信息读取模块，配置为读取所述逻辑信道的令牌桶值；
    增量模块，配置为为所述逻辑信道的令牌桶值增加设定值；
    更新模块，配置为判断此时所述逻辑信道的令牌桶值是否小于门限值，若是，则更新下一个所述逻辑信道的令牌桶值；否则，将所述门限值作为所述逻辑信道的令牌桶值，更新下一个所述逻辑信道的令牌桶值。
PCT/CN2014/091327 2014-07-16 2014-11-17 一种lte制式下逻辑信道的组操作方法及装置 WO2015117453A1 (zh)

Priority Applications (1)

Application Number Priority Date Filing Date Title
US15/326,565 US20170208606A1 (en) 2014-07-16 2014-11-17 Group operation method and device for logical channels in lte system

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN201410339995.4 2014-07-16
CN201410339995.4A CN105262572A (zh) 2014-07-16 2014-07-16 一种lte制式下逻辑信道的组操作方法及装置

Publications (1)

Publication Number Publication Date
WO2015117453A1 true WO2015117453A1 (zh) 2015-08-13

Family

ID=53777262

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2014/091327 WO2015117453A1 (zh) 2014-07-16 2014-11-17 一种lte制式下逻辑信道的组操作方法及装置

Country Status (3)

Country Link
US (1) US20170208606A1 (zh)
CN (1) CN105262572A (zh)
WO (1) WO2015117453A1 (zh)

Families Citing this family (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US11800397B2 (en) * 2018-05-08 2023-10-24 Interdigital Patent Holdings, Inc. Methods for logical channel prioritization and traffic shaping in wireless systems
US20210168854A1 (en) * 2018-06-18 2021-06-03 Lg Electronics Inc. Method for allocating resources to logical channels by transmission end in wireless communication system and an apparatus therefor
CN111669831B (zh) * 2020-05-22 2022-09-09 中国联合网络通信集团有限公司 一种资源分配方法及装置

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102118858A (zh) * 2009-12-31 2011-07-06 电信科学技术研究院 分配逻辑信道号和确定逻辑信道的方法、系统和装置
CN102415187A (zh) * 2009-04-23 2012-04-11 松下电器产业株式会社 用于生成多个上行链路传输块的逻辑信道优先级排序过程
CN103313396A (zh) * 2012-03-07 2013-09-18 普天信息技术研究院有限公司 一种lte系统中的逻辑信道分组方法

Family Cites Families (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US8750124B2 (en) * 2007-12-13 2014-06-10 Innovative Sonic Limited Method of radio resource allocation and related communication apparatus
CN101933385B (zh) * 2008-02-01 2013-11-13 交互数字专利控股公司 用于优先化逻辑信道的方法和设备
CN101867871B (zh) * 2009-04-17 2013-02-13 电信科学技术研究院 一种选择逻辑信道进行数据处理的方法、系统和设备
TW201039664A (en) * 2009-04-24 2010-11-01 Htc Corp Method for allocating uplink resources to logical channels in a wireless communication system and related communication device
US8638815B2 (en) * 2010-01-08 2014-01-28 Blackberry Limited Method and apparatus for logical channel prioritization for uplink carrier aggregation
US8514703B2 (en) * 2010-11-11 2013-08-20 Qualcomm Incorporated Scheduling of logical channels in a wireless communication system

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102415187A (zh) * 2009-04-23 2012-04-11 松下电器产业株式会社 用于生成多个上行链路传输块的逻辑信道优先级排序过程
CN102118858A (zh) * 2009-12-31 2011-07-06 电信科学技术研究院 分配逻辑信道号和确定逻辑信道的方法、系统和装置
CN103313396A (zh) * 2012-03-07 2013-09-18 普天信息技术研究院有限公司 一种lte系统中的逻辑信道分组方法

Also Published As

Publication number Publication date
CN105262572A (zh) 2016-01-20
US20170208606A1 (en) 2017-07-20

Similar Documents

Publication Publication Date Title
US20210337557A1 (en) Method and apparatus for processing priority in d2d communication system
US11051322B2 (en) Data processing method, apparatus, and system
JP6938643B2 (ja) データ伝送方法及び装置
JP6383433B2 (ja) バッファ状態報告（ｂｓｒ）のトリガー方法及び装置
CN107920390B (zh) 上行逻辑信道调度方法、装置及用户设备
JP7344963B2 (ja) 端末、基地局、通信システム、及び通信方法
CN101621369B (zh) 执行分组的传输及优先次序的方法
WO2015044771A2 (en) Method, apparatus, and system for performing data transmission and processing via dual connectivity
CN109952733A (zh) 灵活的无线电资源分配
CN103096488B (zh) 多载波调度的方法和设备
JP2009147941A (ja) 無線リソース割当方法及び関連通信装置
CN103945540A (zh) 一种逻辑信道优先级处理方法及装置
CN108811140A (zh) 一种数据业务传输方法及系统
CN110830955A (zh) 用户设备的控制方法、基站的控制方法以及用户设备
CN107113821A (zh) 上行数据传输的方法和装置
CN103052071B (zh) 一种资源分配方法和设备
WO2015117453A1 (zh) 一种lte制式下逻辑信道的组操作方法及装置
WO2018082467A1 (zh) 一种调度方法、终端及基站
US10375703B2 (en) Resource allocation apparatus, system and method
CN108811142B (zh) 资源分配方法、相关装置及系统
CN107431901A (zh) 蜂窝网络中的调度
WO2018227482A1 (zh) 一种逻辑信道的资源调度方法和装置
TW201816623A (zh) 資料傳輸的優先級排序方法、資料塊的準備方法及通信裝置與非揮發性電腦可讀介質
CN104427630A (zh) 一种分组调度方法及装置
CN104519574B (zh) 一种增强传输时间间隔集束传输方法及装置

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 14881879

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

WWE Wipo information: entry into national phase

Ref document number: 15326565

Country of ref document: US

122 Ep: pct application non-entry in european phase

Ref document number: 14881879

Country of ref document: EP

Kind code of ref document: A1