Method of allocating resources in wireless communication system
28 claims: 2 independent, 26 dependent
- 1CLAIMS REIVINDICAÇÕES 1. Method for allocating radio resources for each plurality of logical channels in a telecommunications system, each logical channel having a corresponding priority, CHARACTERIZED by the fact that it comprises:1. Método para alocação de recursos de rádio para cada pluralidade de canais lógicos em um sistema de telecomunicações, sendo que cada um dos canais lógicos tem uma prioridade correspondente, CARACTERIZADO pelo fato de que compreende: allocate radio resources to a first amount of data associated with each of the logical channels, the allocation of radio resources being based on the priority corresponding to each of the logical channels;and allocating the remaining radio resources to a second amount of data associated with each of the two or more logical channels, the two or more logical channels have the same priority, with the remaining radio resources being allocated equally to the two or more logical channels. alocar os recursos de rádio para uma primeira quantidade de dados associada a cada um dos canais lógicos, sendo que a alocação de recursos de rádio é baseada na prioridade correspondente a cada um dos canais lógicos;e alocar os recursos de rádio remanescentes para uma segunda quantidade de dados associada a cada um dos dois ou mais canais lógicos, os dois ou mais canais lógicos têm a mesma prioridade, sendo que os recursos de rádio remanescentes são alocados igualmente para os dois ou mais canais lógicos.
- 15Apparatus to allocate radio resources to each plurality of logical channels in a wireless telecommunication system, each logical channel having a corresponding priority, CHARACTERIZED by the fact that it comprises:15. Aparelho para alocar recursos de rádio para cada pluralidade de canais lógicos em um sistema de telecomunicação sem fio, sendo que cada um dos canais lógicos tem uma prioridade correspondente, CARACTERIZADO pelo fato de que compreende: means for allocating radio resources for a first amount of data associated with each of the logical channels, said means for allocating radio resources allocating radio resources based on the priority corresponding to each of the logical channels;and means for allocating the remaining radio resources to a second amount of data associated with each of the two or more logical channels, the two or more logical channels have the same priority, and said means for allocating the remaining radio resources allocate the remaining radio resources equally for the two or more logical channels. meios para alocar os recursos de rádio para uma primeira quantidade de dados associada a cada um dos canais lógicos, sendo os ditos meios para alocação dos recursos de rádio alocam os recursos de rádio baseado na prioridade correspondente a cada um dos canais lógicos;e meios para alocar os recursos de rádio remanescentes para uma segunda quantidade de dados associada a cada um dos dois ou mais canais lógicos, os dois ou mais canais lógicos têm a mesma prioridade, sendo que os ditos meios para alocação dos recursos de rádio remanescentes alocam os recursos de rádio remanescentes igualmente para os dois ou mais canais lógicos.
Independent claims2
130 paragraphs in 1 section, as filed
(54) Title: METHOD FOR ALLOCATION OF (57) Summary:
COMMUNICATION SYSTEM RESOURCES WITHOUT
FIO (30) Unionist Priority: I8 / 06/2007 kr 10-2007-0059524,
06/21/2007 US 60 / 945,580 (73) Owner (s): LG Electronics Inc.
(72) Inventor (s): Seung June Yi, Sung Duck Chun, Sung Jun
Park, Young Dae Lee (74) Attorney (s): Nellie Anne Daniel-Shores (86) International Request: pct KR2008003401 de
17/06/2008 (87) International Publication: wo 2008 / i56275de
24/12/2008
<img file="BRPI0806906A2_D0001.tif" />
“METHOD AND APPARATUS FOR ALLOCATION OF RESOURCES IN A WIRELESS COMMUNICATION SYSTEM”
Technique Field
The present invention relates to a wireless communication process and, more particularly, to a method for allocating resources in a wireless communication system.
Background of the Technique
A mobile system of the third generation partnership project (3GPP) based on a code division multiple access broadband radio access (WCDMA) technology has been widely deployed worldwide. High-speed downlink (HSDPA) access, which is a first step in the evolution of WCDMA, provides 3GPP with a highly competitive radio access technology. However, since radio access technology has been continuously developed in view of the demands and expectations of users and suppliers, the evolution of a new technology in 3GPP is required to increase competitiveness. Reduced cost per bit is required, increased service availability, flexible use of a frequency band, a simple structure and an open interface, and adequate power consumption for user equipment.
A wireless communication system needs to provide several radio services such as a network browsing service, a voice over internet protocol (VolP) service, as well as a voice service. In order to provide various radio services, at least one radio carrier must be established between a base station and user equipment. Radio carriers can be configured with different priorities or with the same properties. For example, even though the voice service uses a relatively small amount of transmission rate, it needs to minimize transmission delay. On the other hand, a navigation service on the network requires a relatively small amount of transmission rate, but it does not pay attention to the transmission delay. The plurality of radio carriers is configured with the purpose of supporting various applications and, at the same time, providing various radio services. The plurality of radio bearers may have different priorities or equal priorities, as in a case where a plurality of network browsers is provided simultaneously.
We are looking for a method for allocating resources effectively in the plurality of radio bearers with priorities.
Disclosure of the Invention
Technical problem
The present invention provides a method for allocating resources to a plurality of radio bearers that have equal priorities.
The present invention also provides a method for allocating resources in a plurality of logical channels that have equal priorities.
Technical Solution
In one respect, a method is provided for allocating resources in a wireless communication system. The method includes setting priorities for a plurality of logical channels according to a first criterion, with each plurality of logical channels having each priority and resource allocation in a subset of the plurality of logical channels according to a second criterion for transferring data through a transport channel, the subset of the plurality of logical channels being configured with the same priority.
In another aspect, a method is provided for transmitting data from an upper layer to a lower layer. The method includes determining transmission priorities for a plurality of logical channels to transmit data for the plurality of logical channels according to one criterion, the plurality of logical channels having the same logical channel priorities, and data transmission for plurality of logical channels based on the given transmission priorities.
In yet another aspect, a method is provided for allocating resources in a wireless communication system. The method includes setting a priority for each logical channel according to a first criterion and allocating resources on a transport channel according to a second criterion, with the transport channel being mapped to a configured plurality of logical channels with the same priority.
In yet another aspect, a method for allocating resources in a wireless communication system is provided. The method includes setting a priority for each logical channel according to a first criterion and allocating resources on a transport channel, the transport channel is mapped to a plurality of logical channels configured with the same priority, the plurality of logical channels have the same amount of transmission data.
Advantageous Effects
According to the development of a communication system, there remains a need to operate multiple applications and simultaneously provide various services. Specifically, when a plurality of radio bearers with equal priorities is concomitantly configured as in a case where a plurality of network browsers are used simultaneously, the quality of service may not be guaranteed, if any efficient method of equal processing priorities is not available. Consequently, it is possible to reliably provide various services through a method of processing radio carriers that have equal priorities.
Brief Description of Drawings
Figure 1 is a block diagram showing a wireless communication system.
Figure 2 is a block diagram showing the functional division between EUTRAN and EPC.
Figure 3 is a block diagram showing key elements of an UE.
Figure 4 is a block diagram showing the architecture of the radio protocol for a user plan.
Figure 5 is a block diagram showing the architecture of the radio protocol for a control plan.
Figure 6 shows the mapping between downlink ionic channels (downlink) and downlink transport channels (downlink).
Figure 7 shows the mapping between uplink logical channels (uplink) and uplink transport channels (uplink).
Figure 8 shows the mapping between downlink transport channels and physical downlink channels.
Figure 9 shows the mapping between uplink transport channels and physical uplink channels.
Figure 10 illustrates an example of a method for transmitting data with different logical channel priorities (LCPs).
Figure 11 illustrates a method for allocating equal amounts of transmission data with the exception of the prioritized bit rate (PBR) allocation.
Figure 12 illustrates a method for allocating equal amounts of transmission data including allocating PBR.
Figure 13 illustrates a method for enabling a RB with a lower PBR to have a higher priority over RBs with equal LCPs.
Figure 14 illustrates a method for allocating amounts of transmission data according to a reason for a criterion with the exception of PBR allocation.
Figure 15 illustrates a method for allocating amounts of transmission data according to a reason for a criterion including PBR allocation.
Mode for the Invention
Figure 1 is a block diagram showing a wireless communication system. This can be a network structure of an E-UMTS (Universal Evolved Mobile Telecommunications System). The E-UMTS system can be called the LTE (Long Term Evolution) system. The wireless communication system can be widely arranged to provide a variety of communication services, such as voices, packet data and the like.
With reference to Figure 1, an E-UTRAN (EUMTS Terrestrial Radio Access Network) includes at least one base station (BS) 20. User equipment (UE) 10 can be fixed or mobile and can be named by other terminology , such as an MS (Mobile Station), a UT (User Terminal), an SS (Subscriber Station), a wireless device or the like. The BS 20 is generally a fixed station that communicates with the user's equipment 10 and can be named by another terminology, such as eNB (E-B-evolved), a BTS (Base Transceiver System), an access point or similar . There are one or more cells in the BS 20 coverage. Interfaces for transmitting user traffic or control traffic can be used between BSs 20. From now on, downlink means communication from BS 20 to UE 10 and uplink means communication from UE 10 to BS 20.
BSs 20 are mutually interconnected via an X2 interface. BSs 20 are also connected via the S1 interface to the EPC (Evolved Packet Core), more specifically, to the MME (Mobility Management Entity) / SAE (Evolution of the System Architecture) communication port. The S1 interface supports a many-to-many relationship between the MME / SAE 30 communication port and BS 20.
Figure 2 is a block diagram showing the functional division between EUTRAN and EPC. The striped boxes illustrate the radio protocol layers and the white boxes illustrate the functional entities of the control plane.
With reference to Figure 2, BS hosts the following functions. (1) Radio Resource Management Functions such as Radio Carrier Control, Radio Admission Control, Connection Mobility Control, Dynamic Resource Assignment of UEs on both uplink and downlink (scaling), (2 ) IP header compression (Internet Protocol) and user data flow encryption, (3) User Plan data routing data facing the S-GW, (4) Scheduling and transmission of paging messages, (5) Scheduling and transmission of broadcasting information and (6) Measurement and configuration of measurement report for mobility and scheduling.
MME hosts the following functions. (1) Scattering of paging messages across the BSs, (2) Security control, (3) inactive state mobility control, (4) SAE carrier control, and (5) Code writing and signaling integrity protection non-access layer (NAS).
An SAE communication port hosts the following functions. (1) Completion of a user plan package in relation to pagination and (2) Switching of a user plan to support UE mobility.
[34] FIG. 3 is a block diagram showing the primary elements of an UE. An UE 50 includes a processor 51, memory 52, an RF unit 53, a display unit 54 and a user interface unit 55. The radio interface protocol layers are implanted in processor 51. Processor 51 provides a plan control and a user plan. The function of each layer can be implemented in processor 51. Memory 52 is coupled to processor 51 and stores an operating system, applications and general files. Display unit 54 displays a variety of UE information and can use a well-known element, such as an LCD (Liquid Crystal Display) or OLED (Organic Light Emitting Diode). User interface unit 55 can be configured with a combination of well-known user interfaces such as a key pad or touch screen. The RF unit 53 is coupled to processor 51 and transmits and / or receives radio signals.
The layers of the radio interface protocol between the user equipment and the base station can be classified into layer L1 (a first layer), layer L2 (a second layer) and layer L3 (a third layer) based on the bottom three layers of the Open Systems Interconnection (OSI) model which is well known in the related art. A physical layer (PHY) belonging to the first layer provides the service of transferring information on a physical channel. A radio resource control layer (RRC) belonging to the third layer acts to control radio resources between the user's equipment and the network. User equipment and RRC network exchange send messages through the RRC layer.
Figure 4 is a block diagram showing a radio protocol architecture for a user plan. Figure 5 is a block diagram showing a radio protocol architecture for a control plan. These figures illustrate the architecture of a radio interface protocol between the UE and E-UTRAN. The data plan is a protocol stack for transmitting user data and the control plan is a protocol stack for transmitting the control signal.
With reference to 4 and 5, a physical layer (PHY) belonging to the first layer offers services for transferring information to upper layers in a physical channel. The PHY layer is coupled to a MAC (Media Access Control) layer, that is, an upper layer of the PHY layer, through a transport channel. Data is transferred between the MAC layer and the PHY layer through the transport channel. Between the different physical layers, that is, the physical layer of a transmitter and the physical layer of a receiver, data is transferred through the physical channel. The physical channel can be modulated through orthogonal frequency division multiplexing (OFDM). The physical channel uses time and frequency as radio resources.
The MAC layer in the second layer provides services to an RLC (Radio Link Control) layer, that is, a layer superior to the MAC layer, through a logical channel. The RLC layer in the second layer supports the transfer of reliable data.
There are three operating modes in the RLC layer, such as TM (Transparent Mode), UM (Unknown Mode) and AM (Known Mode) according to a data transfer method. RLC AM provides a bidirectional data transmission service and supports retransmission when the transfer of an RLC PDU (Protocol Data Unit) fails.
A PDCP (Packet Data Convergence Protocol) belonging to the second layer performs the header compression function. The PDCP layer reduces the size of the Internet Protocol (IP) packet header in order to effectively transmit the IP packet.
A RRC (Radio Resource Control) layer belonging to the third layer is defined only in the control plane. The RRC layer serves to control the logical channel, the transport channel and the physical channel associated with the configuration, reconfiguration and release of radio carriers (RBs). A RB is intended for a service provided by the second layer for data transmission between the user's equipment and the network. When an RRC connection is established between the RRC layer of the user's equipment and the RRC layer of the network, the user's equipment is said to be in RRC connected mode. When an RRC connection is not yet established, it is called that the user's equipment is in the RRC idle mode.
A NAS layer (Non-Access Layer) belonging to the top layer of the RRC layer is used to perform session management and mobility management.
Figure 6 shows the mapping between logical downlink channels and downlink transport channels. Figure 7 shows the mapping between logical uplink channels and uplink transport channels.
With reference to Figures 6 and 7, in a downlink, a paging control channel (PCCH) can be mapped to a paging channel (PCH). A broadcast control channel (BCCH) can be mapped to a broadcast channel (BCD) or a downlink shared channel (DL-SCH). A common control channel (CCCH), a dedicated control channel (DCCH), one (DTCH), a multicast control channel (MCCH) and a multicast traffic channel (MTCH) can be mapped to the DL -SCH. MCCH and MTCH can also be mapped to a multicast channel (MCH). In uplink, a CCCH, a DCCH and a DTCH can be mapped to an uplink shared channel (UL-SCH).
Each type of logical channel is defined by what type of information is transferred. A classification of logical channels is made into two groups: control channels and traffic channels.
Control channels are used to transfer information from the control plan. BCCH is a downlink control channel for the control information of the broadcasting system. The PCCH is a downlink channel that transfers the paging information and is used when the network does not know the UE local cell. The CCCH is a channel for transmitting control information between the UEs and the network and is used for UEs that do not have an RRC connection to the network. MCCH is a point-to-multipoint downlink channel used to transmit control information from the multimedia broadcasting multicast service (MBMS) from the network to the UE, to one or more MTCHs and is only used by UEs receiving MBMS. DCCH is a two-way point-to-point channel that transmits dedicated control information between a UE and the network and is used by the UE that has an RRC connection.
Traffic channels are used to transfer user plan information. The DTCH is a point-to-point channel dedicated to a UE, for the transfer of user information. The DTCH can exist on both the uplink and downlink. MTCH is a point-to-multipoint downlink channel for transmitting traffic data from the network to the UE and is only used by UEs receiving MBMS.
Transport channels are classified by how and with what characteristics the data is transferred over the radio interface. The BCH is broadcast throughout the cell's coverage area and has a predefined fixed transport format. The DL-SCH is characterized by the support for the request of hybrid automatic repetition (HARQ), support for adaptation of dynamic link through the variation of modulation, coding and transmission of energy, possibility to be broadcast throughout the cell, possibility to use formation of beam, support for both dynamic and semi-static resource allocation, support for discontinuous UE reception (DRX) to enable EU energy savings and support for MBMS transmission. The SHP is characterized by the support for discontinuous UE reception (DRX) to allow UE energy savings and by the requirement of broadcasting in the entire cell coverage area. The MCH is characterized by the requirement of broadcasting in the entire cell coverage area, support for MBMS Single Frequency Network (MBSFN) combined with MBMS transmission in multiple cells.
The uplink transport channels are an UL-SCH and a random access channel (RACH). UL-SCH is characterized by support for adapting dynamic enface through varying transmission energy and potential modulation, and coding, support for HARQ and support for both dynamic and semi-static resource allocation. RACH is characterized by limited collision risk and control information.
Figure 8 shows the mapping between the downlink transport channels and the physical downlink channels. Figure 9 shows the mapping between the downlink transport channels and the physical downlink channels.
With reference to Figures 8 and 9, in a downlink, a BCH can be mapped to a physical broadcasting channel (PBCH). An MCH can be mapped to a physical multicast channel (PMCH). A PCH and a DL-SCH can be mapped to a shared physical downlink channel (PDSCH). The PBCH carries the BCH transport block. The PMCH carries the MCH. The PDSCH carries the DL-SCH and the PCH. In uplink, a UL-SCH can be mapped to a shared physical uplink (PUSCH) channel. A RACH can be mapped to a physical random access channel (PRACH). PRACH carries a random access preamble.
There are several physical control channels used at the physical layer. A physical downlink control channel (PDCCH) informs the UE about the allocation of PCH and DL-SCH resources, and HARQ information related to DL-SCH. The PDCCH can carry the uplink scheduling grant that informs the UE about the uplink transmission resource allocation. A physical control format indicator channel (PCFICH) informs the UE about the number of OFDM symbols used for the PDCCHs and is transmitted in each sub-frame. A Physical Hybrid ARQ Indicator Channel (PHICH) carries HARQ ACK / NAK signals in response to uplink transmissions. An uplink control channel (PUCCH) carries uplink control information such as HARQ AC / NAK in responses to uplink transmission, escalation request and channel quality indicator (CQI). The PUCCH is not transmitted simultaneously with the PUSCH of the same UE.
In order to provide various types of services, at least one RB can be configured. The RB is a logical link provided by the first and second layers among the radio protocols between the UE and the network. A logical channel is allocated to an RB. A plurality of logical channels corresponding to a plurality of RBs is multiplexed and transmitted through the transport channel.
Each RB can have different properties of logical priority channel (LCP) or equal LCP.
Later in this document, an LCP-based method of data transmission will be described.
I. In the case of different LCPs:
When a plurality of RBs are multiplexed and transmitted over a transport channel, a MAC layer can determine amounts of transmission data from the RBs using the following rules regarding the radio resources given at any time during data transmission.
(1) The amounts of transmission data are determined in decreasing order of LBs of the RBs. The data that corresponds to the maximum prioritized bit rate (PBR) for each RB is determined as an amount of transmission data.
(2) In a case where radio resources remain, the amounts of data transmission are determined in decreasing order of LCPs, again, in relation to multiplexed RBs.
For example, when the range of LCPs is from 1 to 8, 1 is considered to be the highest priority and 8 the lowest priority. The PBR is the minimum bit rate that is guaranteed by the RB. Even in a case where a wireless environment is very poor, a wireless communication system needs to provide the minimum bit rate. The PBR can range from zero to infinity.
An LCP and / or PBR information from a RB is transmitted from an RRC layer of a network to an RRC layer of a UE through a RB configuration message when it is initially configured. The RRC layer of the UE that receives the configuration message from the RB configures a RB and sends the information in the LCP and the PBR of the RB to the MAC layer of the UE. The MAC layer that receives the information determines the amounts of transmission data from the RB according to the aforementioned rules regarding the radio data resources for transmission time interval (TTI). In the present invention, TTI is referred to as an interval for transmitting data over a transport channel.
Figure 10 illustrates an example of a method for transmitting data with different LCPs.
With reference to Figure 10, the three RBs, RB1 to RB3, are multiplexed in a transport channel. In the present context, LCP1 from RB 1 is 1, LCP2 from RB2 is 3, LCP3 from RB3 is 5, BR1 from RB1 is 300 bit / TTI, PBR2 from RB2 is 400 bit / TTI and PBR3 from RB3 is 100 bit / TTI. The size of a transport block that is allocated to a transport channel is 1700 bits. The size of the transport block is the size of the radio resources allocated to the transport channel and may vary for each TTI according to the condition of the channel.
A buffer occupation BO1 of RB1 is 700 bits, the buffer occupation BO2 of RB2 is 1500 bits and a buffer occupation BO3 of RB3 is 600 bits. A buffer occupation (BO) is an amount of buffer memory currently occupied by the data. The occupied data can be divided into data corresponding to the PBR and other data. Later in this document, the data that correspond to the PBR among the BOs of the RBs are called PBR data and the other data are called remaining data.
First, the MAC layer fills the transport block with the PBR data of the RBs in decreasing order of the LCPs in relation to the radio resources given for the maximum PBR extension. In the example in Figure 10, LCP1 of RB1 is the highest, LCP2 of RB2 is the next highest and LCP3 of RB3 is the lowest. In this way, the amount of transmission data is determined in the order RB1, RB2 and RB3, for the PBR extension. That is, the transport block is filled with 800 bits of PBR data in the order of PBR1 from RB1 300 bits, PBR2 from RB2 400 bits and PBR3 from RB3 100 bits.
Then, in a case where the radio resources remain in the transport block, the transport block is filled with the remaining data from the RBs in decreasing order of the LCPs. In the example in Figure 10, since the amount of RB data is filled according to the 800-bit PBRs in relation to the 1700-bit transport block, the extra 900-bit resources remain. Consequently, the transport block is filled with remaining data in decreasing order of the LCPs. That is, all the remaining 400-bit data from RB1 that has the highest LCP is first filled. Then, the remaining data from RB2 is filled with extra 500-bit resources.
Finally, in this TTI, the determined amounts of RB transmission data are RB1 = 700 bits, RB2 = 900 bits and RB3 = 100 bits. The determined transmission data is carried out by a transport block.
The order of filling the transport block with RB data in the transport block depends on an embedded method. In Figure 10, the transport block is filled with data, according to a rule for determining the amounts of data in order to show a method for determining the amounts of data.
II. In the case of equal LCPs:
In a case where RBs that have equal LCPs are multiplexed, a clear processing method for RBs is required. As a communication system develops, a network needs to provide a plurality of services to the UEs concurrently. Thus, a plurality of RBs with equal priorities can be configured. If an effective method of processing RBs with equal LCPs is not defined, the quality of service for RBs may not be guaranteed. Consequently, it is necessary to effectively determine the amounts of transmission data, so that the quality of service is not deteriorated, even in cases where RBs with equal priorities are multiplexed.
When the RBs with the same LCPs are multiplexed, it is possible to determine the amount of RB transmission data in the following method:
II- 1. Equal Quantity Allocation.
It is possible to allocate equal amounts of transmission data to RBs with the same LCPs. However, since PBRs are configured in RBs, there are two methods based on whether or not to include PBR allocation.
Figure 11 illustrates a method for allocating equal amounts of transmission data, with the exception of PBR allocation. This means the equal allocation of resources d -1
II remaining after PBR allocation. First, the amounts of transmission data are allocated to the extension of the RBs' PBRs. Equal amounts of transmission data are allocated to the RBs in relation to the remaining radio resources. The conditions in Figure 11 are the same as those in Figure 10, except that the LCPs of RB2 and RB3 are 5.
Referring to Figure 11, first, the amounts of transmission data are allocated to the RBs in decreasing order of the LCPs to the extent of the PBRs. That is, RB1 allocates 300-bit PBR1. Since RB2 and RB3 have equal LCPs, RB2 and RB3 allocate 400-bit PBR2 and 100-bit PBR3 in any order. In the example in Figure 11, the amount of transmission data is first allocated to RB2. However, since the RCP2 and RB3 LCPs are the same, the amount of transmission data can be first allocated to RB3.
The amounts of transmission data are first allocated to the extension of the RBs' PBRs. When radio resources remain in the transport block, the remaining radio resources are allocated in decreasing order of LCPs. 800 bits of the 1700-bit transport block are allocated according to the RBs' PBRs and 900 bits remain. Therefore, 400 bits to which the remaining data can be transmitted are allocated to RB1 with the highest priority. Then, 250 bits are allocated respectively to RB2 and RB3 through the equal division of the remaining 500 bits.
In this TTl, the amounts of transmission data determined from the RBs are RB1 = 700 bits, RB2 = 650 bits and RB3 = 350 bits. The determined transmission data is carried by a transport block.
The order of filling the transport block with data from the RBs depends on an embedded method. In Figure 10, the transport block is filled with data according to a rule for determining the amounts of data in order to present a method for determining the amounts of data.
Figure 12 illustrates a method for allocating equal amounts of transmission data that includes PBR allocation. This means an equal allocation of total resources including the allocation of PBR. In this method, all amounts of transmission data allocated to RBs that have equal LCPs are the same without considering the RBs' PBRs. This condition is the same as in Figure 11.
Referring to Figure 12, the amounts of transmission data are allocated to the RBs in decreasing order of LCPs to the extent of the PBRs. That is, 300 bits of PBR1 are allocated to RB1. Since RB2 and RB3 have equal LCPs, 400 bits of PBR2 for RB2 and 100 bits of PBR3 for RB3 are allocated arbitrarily.
Then, upon the permanence of the 900-bit radio resources, the remaining radio resources are allocated in descending order in the 400 bits of LCPs, in which all remaining data that can be transmitted are allocated to the RB 1 that has the highest priority. high. The remaining 500 bits are allocated to RB2 and RB3. At this time, 100 bits and 400 bits are allocated to RB2 and RB3 respectively, so that all amounts of transmission data from RB2 and RB3 are equal.
Finally, in this TTI, the amounts of transmission data determined from the RBs are RB1 = 700 bits, RB2 = 500 bits and RB3 = 500 bits. The determined transmission data is carried by a transport block.
The order of filling the transport block with data from the RBs depends on an embedded method. In Figure 10, the transport block is filled with data according to a rule for determining data quantities, in order to present a method for determining data quantities.
II-2. Prioritization with New Criteria
If the RBs 'LCPs are the same, the RBs' priorities are not determined based on the LCPs. Priorities can be determined based on a new criterion. A new criterion can be a buffer occupation (BO), a PBR, a maximum bit rate (MBR), a buffer latency period or a TTI. Several criteria may be available.
Figure 13 illustrates a method for allowing a RB that has a lower PBR to have a higher priority over RBs with equal LCPs. That is, in RBs with equal LCPs, PBRs are used in place of LCPs.
Referring to Figure 13, first, the MAC layer determines that a RB that has a lower PBR has a higher priority by comparing the PBRs of the RBs that have equal LCPs, when the RBs are configured. In the example in Figure 13, although the LCPs of RB2 and RB3 are 5, PBR2 is 400 bits and PBR3 is 100 bits. Since PBR3 is smaller than PBR2, RB3 has a higher priority than RB2. After determining the priorities of the RBs, the amounts of transmission data are allocated.
First, the amounts of transmission data are allocated to the RBs in decreasing order of priorities that are determined according to the RBs' LCPs or PBRs. That is, 300 bits of PBR1 are allocated to RB1, 100 bits of PBR3 are allocated to RB3 which has the next highest priority and, finally, 400 bits of PBR2 are allocated to RB2.
Then, once the 900-bit radio resources remain, the remaining radio resources are allocated in decreasing order of priorities determined according to the LCPs or PBRs. First, the 400 bits to which all remaining data can be transmitted are allocated to RB 1 with the highest priority and the
500 bits to which all remaining data can be transmitted are allocated to RB 3 with the next highest priority. At the moment, radio resources no longer remain. In this way, a quantity of transmission data is not allocated to the RB2 that has the lowest priority.
Finally, in this TTI, the amounts of transmission data determined from the RBs are RB1 = 700 bits, RB2 = 400 bits and RB3 = 600 bits. The determined transmission data is carried by a transport block.
The order of filling the transport block with data from the RBs depends on an embedded method. In Figure 10, the transport block is filled with data according to a rule for determining data quantities in order to show a method for determining data quantities.
In the present context, although the priorities of the RBs that have equal LCP are determined in the decreasing order of PBRs, the priorities of the RBs can be determined in the increasing order of PBRs. Selectively, the priorities of the RBs can be determined with the use of a new criterion such as a BO, an MBR, a time period of data buffering and the like.
One criterion, PBR, is used to determine the priorities of RBs that have equal LCPs. Alternatively, several criteria or a combination of several criteria can be used. For example, the priorities of RBs that have equal LCPs can be determined in the increasing order of BOs / PBRs. If this criterion is applied to the example in Figure 13, although RB2 and RB3 have equal LCPs, a BO / PBR of RB3 is greater than that of RB2. Consequently, RB3 has a higher priority than RB2. For another example, a TTI can be an alternative to the criterion. For example, for 3 RBs with equal logical channel priorities, it is possible to prioritize them cyclically based on the transmission time, ie RB1> RB2> RB3 for the first TTI, RB2> RB3> RB1 for the second TTI, RB3> RB1> RB2 for the third TTI and so on. An advantage of this method is that, whatever the criterion used, a UE can only consider one RB at a time. In this way, the complexity of the UE is mitigated.
II-3. Method for Allocation of Amounts of Transmission Data of the RBs according to a Reason for a New Criterion by Setting the New Criterion instead of the LCPs.
In this method, the amounts of transmission data are allocated to RBs that have equal LCPs according to a ratio of one criterion. At this time, the amounts of transmission data can be allocated according to the criteria such as a BO, a PBR, an MBR, a data buffer period, a TTI and the like. Several criteria may be available. Selectively, a combination of several criteria can be used. That is, several criteria such as a BO / PBR, an MBR / PBR and the like may be available.
There are two methods that are based on whether the given criterion applied for allocating amounts of transmission data includes allocation of PBR or excludes allocation of PBR.
Figure 14 illustrates a method for allocating amounts of transmission data according to a ratio of a criterion, without allocating PBR. First, the amounts of transmission data are allocated to the extent of the RBs' PBRs. The amounts of transmission data are allocated to the RBs in relation to the remaining radio resources according to the reason for the criterion. In the present context, a BO is used as a criterion.
With reference to Figure 14, the amounts of transmission data are allocated to the RBs in decreasing order of LCPs to the extent of the PBRs. That is, 300 bits of PBR1 are allocated to RB1. Since RB2 and RB3 have equal LCPs, 400 bits from PBR2 to RB2 and 100 bits from PBR3 to RB3 are allocated in any order.
The amounts of transmission data are first allocated to the extension of the PBRs to the RBs. When radio resources remain, the remaining radio resources are allocated in decreasing order of LCPs. 800 bits of the transport block that has 1700 bits are allocated according to the RBs' PBRs and 900 bits per20 remain. Therefore, 400 bits to which all remaining data can be transmitted can be allocated to RB1 which has the highest priority. Then, the remaining 500 bits are allocated to RB2 and RB3. At this time, given that the LCPs of RB2 and RB3 are the same, the extra 500-bit radio resources are allocated to RB2 and RB3 according to a ratio of BOs, with the exception of the PBR allocation.
That is, RB2 has 1100 bits except PBR2 out of 1500 bits, and RB3 has 500 bits except PBR3 out of 600 bits. Thus, a ratio of transmission data quantities is 1100: 500. When this ratio is applied to 500 bits, 344 bits and 156 bits are allocated to RB2 and RB3 respectively.
Finally, in this TTI, the determined amounts of data for transmission of
RBs are RB1 = 700 bits, RB2 = 744 bits and RB3 = 256 bits. The determined transmission data is carried by the transport block.
The order of filling the transport block with RB data depends on an embedded method. In Figure 10, the transport block is filled with data according to a rule to determine the amounts of data, in order to show a method for determining the amounts of data.
Figure 15 illustrates a method for allocating amounts of transmission data according to a ratio of a criterion that includes PBR allocation. In this method15, the amounts of transmission data are allocated to RBs that have equal LCPs according to a reason for the criterion in taking PBRs into consideration. A BO is used as the criterion.
Referring to Figure 15, the amounts of transmission data are allocated to the RBs in decreasing order of LCPs to the extent of the PBRs. That is, the 300 bits of PBR1 are allocated to RB1. Since RB2 and RB3 have equal LCPs, 400 bits from PBR2 to RB2 and 100 bits from PBR3 to RB3 are allocated in any order. Then, upon the permanence of the 900-bit radio resources, the remaining radio resources are allocated in decreasing order of the LCPs.
First, the 400 bits to which all remaining data can be transmitted are allocated to RB1 which has the highest priority, and the remaining 500 bits are allocated to RB2 and RB3. At this time, the amounts of transmission data are allocated to RB2 and RB3 according to a reason for the BOs. All radio resources that can be used by RB2 and RB3 are 1000 bits including the 500 bits allocated to PBRs. When radio resources are divided according to a ratio of 1500: 600, the transmission data amounts of RB2 and RB3 are 714 bits and 286 bits, respectively. When PBR1 already allocated 400 bits and PBR2 100 bits are excluded, the amounts allocated for the remaining 500 bits are 314 bits and 186 bits, respectively.
Finally, in this TTI, the determined amount of RB transmission data is RB1 = 700 bits, RB2 = 714 bits and RB3 = 286 bits. The determined transmission data is carried by a transport block.
The order of filling the transport block with data from the RBs depends on an embedded method. In Figure 10, the transport block is filled with data according to a rule for determining amounts of data, in order to present a method for determining amounts of data.
Each function, as described above, can be performed by a processor such as a microprocessor with software encoded to perform that function, a program code, etc., a controller, a micro-controller, a SIC (Specific Application Integrated Circuit) ) or similar. The planning, development and implementation of such codes may be obvious to the person skilled in the art based on the description of the present invention.
Although the modalities of the present invention have been disclosed for illustrative purposes, those skilled in the art will note that various modifications, additions and substitutions are possible, without departing from the scope of the invention. Consequently, the modalities of the present invention are not limited to the aforementioned modalities, but are defined by the following claims, together with their entire scope of docu1R
I equivalent νζ ments.
12 sheets
Sheet 1 Sheet 2 Sheet 3 Sheet 4 Sheet 5 Sheet 6 Sheet 7 Sheet 8 Sheet 9 Sheet 10 Sheet 11 Sheet 12
26 members in 10 offices
Priority claims14
| Document | Office | Kind | Date |
|---|---|---|---|
| 1020070059524 | Republic of Korea | – | |
| 20070059524 | Republic of Korea | A | |
| 20070059524 | Republic of Korea | A | |
| 60945580 | United States of America | – | |
| 94558007 | United States of America | P | |
| 94558007 | United States of America | P | |
| 2008003401 | Republic of Korea | W | |
| 2008003401 | Republic of Korea | W | |
| 200759524 | – | – | – |
| 2008003401 | – | – | – |
| 60945580 | – | – | – |
| KR20070059524 | – | – | – |
| US20070945580P | – | – | – |
| WO2008KR03401 | – | – | – |
Members26
| Document | Office | Kind | |
|---|---|---|---|
| KR20080111308A | Republic of Korea | A | |
| AU2008264332A1 | Australia | A1 | |
| CA2675412A1 | Canada | A1 | |
| WO2008156275A2 | World Intellectual Property Organization (WIPO) | A2 | |
| WO2008156275A3 | World Intellectual Property Organization (WIPO) | A3 | |
| KR100911304B1 | Republic of Korea | B1 | |
| GB0912396D0 | United Kingdom | D0 | |
| GB2458414A | United Kingdom | A | |
| CN101606336A | China | A | |
| US2010046456A1 | United States of America | A1 | |
| EP2168260A2 | European Patent Office (EPO) | A2 | |
| US2010118796A1 | United States of America | A1 | |
| JP2010519845A | Japan | A | |
| EP2168260A4 | European Patent Office (EPO) | A4 | |
| AU2008264332B2 | Australia | B2 | |
| US7873006B2 | United States of America | B2 | |
| US7894395B2 | United States of America | B2 | |
| GB2458414B | United Kingdom | B | |
| JP4979092B2 | Japan | B2 | |
| EP2635083A1 | European Patent Office (EPO) | A1 | |
| CA2675412C | Canada | C | |
| BRPI0806906A2This record | Brazil | A2 | |
| CN101606336B | China | B | |
| EP2168260B1 | European Patent Office (EPO) | B1 | |
| EP2635083B1 | European Patent Office (EPO) | B1 | |
| BRPI0806906B1 | Brazil | B1 |
4 legal events, as the office reported them to INPADOC
Over the term
Point at a mark for the eventEvents
| Event | Code | |
|---|---|---|
| Decision: intention to grantB09A | B09A | |
| Preliminary requirement: requests with searches performed by other patent offices: suspension of the patent application procedureB06U | B06U | |
| Others concerning applications: alteration of classificationB15K | B15K | |
| Objections, documents and/or translations needed after an examination request according art. 34 industrial property lawB06F | B06F |
Numbers
- Publication
- PI0806906
- Publication, DOCDB
- PI0806906
- Publication, EPODOC
- BRPI0806906
- Application
- 6906
- Application, DOCDB
- PI0806906
- Application, EPODOC
- BR2008PI06906
Titles2
- Portuguese
- MÉTODO PARA ALOCAÇÃO DE RECURSOS EM SISTEMA DE COMUNICAÇÃO SEM FIO
- English
- METHOD FOR ALLOCATING RESOURCES IN WIRELESS COMMUNICATION SYSTEM
Classification
- CPC, 7
- H04W72/56
- H04W72/54
- H04B7/2612
- H04W72/563
- H04W4/00
- H04B7/2637
- H04W72/00
- IPC, 3
- H04B7 26
- H04W72 54
- H04W4 00
