CN106470445A - Buffer status report generation method and device - Google Patents

Buffer status report generation method and device Download PDF

Info

Publication number
CN106470445A
CN106470445A CN201510514740.1A CN201510514740A CN106470445A CN 106470445 A CN106470445 A CN 106470445A CN 201510514740 A CN201510514740 A CN 201510514740A CN 106470445 A CN106470445 A CN 106470445A
Authority
CN
China
Prior art keywords
bsr
index
filling
bit
mac
Prior art date
Legal status (The legal status 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 status listed.)
Pending
Application number
CN201510514740.1A
Other languages
Chinese (zh)
Inventor
张新
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
ZTE Corp
Original Assignee
ZTE Corp
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 ZTE Corp filed Critical ZTE Corp
Priority to CN201510514740.1A priority Critical patent/CN106470445A/en
Priority to PCT/CN2016/081320 priority patent/WO2017032059A1/en
Publication of CN106470445A publication Critical patent/CN106470445A/en
Pending legal-status Critical Current

Links

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W72/00Local resource management
    • H04W72/12Wireless traffic scheduling
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W28/00Network traffic management; Network resource management
    • H04W28/02Traffic management, e.g. flow control or congestion control
    • H04W28/0278Traffic management, e.g. flow control or congestion control using buffer status reports
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W28/00Network traffic management; Network resource management
    • H04W28/02Traffic management, e.g. flow control or congestion control
    • H04W28/10Flow control between communication endpoints
    • H04W28/14Flow control between communication endpoints using intermediate storage

Abstract

The invention discloses a kind of Buffer Status Report generation method and device.The method includes:Buffer size according to each logic channel group and BSR form generate BSR MAC CE;Each BSR index to filling in BSR MAC CE, calculates this BSR and indexes position in the indicated scope of data of this BSR index for the corresponding logic channel group buffer data size, obtain the secondary size instruction of BSR index;The order indexing according to the BSR of filling in BSR MAC CE in the remaining filling bit of MAC PDU, inserts the bit information of secondary size instruction.By means of technical scheme, it is possible to increase the precision of BSR, contribute to base station and more accurately dispatched, thus saving ascending wireless resource.

Description

Buffer Status Report generation method and device
Technical field
The present invention relates to field of computer technology, more particularly to a kind of Buffer Status Report generation method and Device.
Background technology
In existing Long Term Evolution (Long Term Evolution, abbreviation LTE) communication system, Yi Jigao In level Long Term Evolution (LTE-Advanced, abbreviation LTE-A) communication system, user equipment (User Equipment, abbreviation UE) data that is sent to base station is by Physical Uplink Shared Channel (Physical Uplink Shared Channel, abbreviation PUSCH) transmit.The ascending resource that PUSCH uses is by BS Distribute to UE.In order to reduce the waste of ascending wireless resource as far as possible, UE needs by sending logic channel group Buffer Status Report (Buffer Status Report, abbreviation BSR) give base station so that base station is known UE needs the size of data by PUSCH transmission, and then can make rational decision-making, to UE's PUSCH distributes suitable ascending wireless resource.
In prior art, the BSR that UE reports base station is in media access control layer (Medium Access Control, abbreviation MAC) protocol Data Unit (Protocol Data Unit, abbreviation PDU) insert Bit information, each MAC PDU at most inserts the MAC control element (Control of a BSR Element, abbreviation CE), the MAC CE of each BSR is mounted with 1 according to the difference of BSR form Or multiple BSR index.Each BSR index is one of 0~63 index value set index value, uses 6 Bit transfer, each index value corresponds to a data volume scope, before this corresponding relation is for version 10 LTE and lte-a system, are to be given by protocol definition form;For version 10 and afterwards The LTE of version and lte-a system, two forms of protocol definition, need to determine UE by high-level signaling Which form used with base station.BSR is offered behind base station by UE, and this can only be known according to index value in base station The quantitative range of the buffer data size of the logic channel group of BSR corresponding UE, therefore can not be carried out very Accurate scheduling.
In the prior art, base station not always meets UE's just according to the resource that BSR distributes to UE Need, when base station is more than when needing of UE for the ascending resource that UE distributes, this resource can have been piled by UE After effect data, remaining part is filled with.The part of filling does not have effective information, it is only for fill up institute The ascending resource using.Using filling after, do not increase upstream data rate, can waste ascending resource and The transmission power of UE.
Content of the invention
In view of the logic channel group of this BSR corresponding UE can only be known in base station according to index value in prior art The quantitative range of buffer data size thus can not carry out exactly accurate scheduling problem it is proposed that this Bright to provide a kind of buffer state report overcoming the problems referred to above or solving the above problems at least in part Accuse generation method and device.
The present invention provides a kind of Buffer Status Report generation method, including:
Buffer size according to each logic channel group and Buffer Status Report BSR form generate buffering Zone state reporting media access control layer control element BSR MAC CE;
Each BSR index to filling in BSR MAC CE, calculates this BSR index corresponding logic letter Position in the indicated scope of data of this BSR index for the road group buffer data size, obtains BSR rope The secondary size instruction drawn;
According to BSR in the remaining filling bit of medium access control layer protocol data cell MAC PDU The order of the BSR index of filling in MAC CE, inserts the bit information of secondary size instruction.
Present invention also offers a kind of Buffer Status Report generating means, including:
Generation module, for the buffer size according to each logic channel group and Buffer Status Report BSR Form generates Buffer Status Report media access control layer control element BSR MAC CE;
Computing module, for each BSR index to filling in BSR MAC CE, calculates this BSR rope Draw position in the indicated scope of data of this BSR index for the corresponding logic channel group buffer data size Put, obtain the secondary size instruction of BSR index;
Fill in module, for the remaining packing ratio in medium access control layer protocol data cell MAC PDU The order indexing according to the BSR of filling in BSR MAC CE in spy, inserts the bit of secondary size instruction Information.
The present invention has the beneficial effect that:
By means of the technical scheme of the embodiment of the present invention, solving base station in prior art can only according to index value Know the quantitative range of the buffer data size of the logic channel group of this BSR corresponding UE thus can not carry out The problem of exactly accurate scheduling, it is possible to increase the precision of BSR, contributes to base station and is more accurately adjusted Degree, thus save ascending wireless resource.
Described above is only the general introduction of technical solution of the present invention, in order to better understand the technology of the present invention Means, and being practiced according to the content of description, and in order to allow above and other objects of the present invention, Feature and advantage can become apparent, below especially exemplified by the specific embodiment of the present invention.
Brief description
By reading the detailed description of hereafter preferred implementation, various other advantages and benefit are for ability Domain those of ordinary skill will be clear from understanding.Accompanying drawing is only used for illustrating the purpose of preferred implementation, and simultaneously It is not considered as limitation of the present invention.And in whole accompanying drawing, it is denoted by the same reference numerals identical Part.In the accompanying drawings:
Fig. 1 is the flow chart of the Buffer Status Report generation method of the embodiment of the present invention;
Fig. 2 is the schematic diagram of the MAC PDU structure of the embodiment of the present invention;
Fig. 3 is the structural representation of the Buffer Status Report generating means of the embodiment of the present invention.
Specific embodiment
It is more fully described the exemplary embodiment of the disclosure below with reference to accompanying drawings.Although showing in accompanying drawing The exemplary embodiment of the disclosure it being understood, however, that may be realized in various forms the disclosure and should be by Embodiments set forth here is limited.On the contrary, these embodiments are provided to be able to be best understood from this Open, and complete for the scope of the present disclosure can be conveyed to those skilled in the art.
The logic channel of this BSR corresponding UE can only be known to solve base station in prior art according to index value The quantitative range of the buffer data size of group is thus the problem of exactly accurate scheduling, the present invention can not be carried out Provide a kind of Buffer Status Report generation method and device, UE is according to each logic channel group relief area Size and BSR form composition BSR MAC CE;UE each BSR to filling in BSR MAC CE Index, calculates this index counterlogic channel group buffer data size in the indicated number of this BSR index According to the position in scope, the i.e. secondary size instruction of this index;In the remaining filling bit of MAC PDU According to the BSR indexed sequential of filling in BSR MAC CE, insert the bit information of secondary size instruction. Below in conjunction with accompanying drawing and embodiment, the present invention will be described in further detail.It should be appreciated that this place The specific embodiment of description, only in order to explain the present invention, does not limit the present invention.
Embodiment of the method
According to embodiments of the invention, there is provided a kind of Buffer Status Report generation method, Fig. 1 is this The flow chart of the Buffer Status Report generation method of bright embodiment, as shown in figure 1, implement according to the present invention The Buffer Status Report generation method of example includes processing as follows:
Step 101, the buffer size according to each logic channel group and Buffer Status Report BSR form Generate Buffer Status Report media access control layer control element BSR MAC CE;
Step 101 specifically includes following process:B (n) is loaded in BSR MAC CE, wherein, b (n) Represent the BSR index value of n-th relief area, fs (n) represents the lower limit of the corresponding scope of data of b (n), fb (n) Represent the higher limit of b (n) corresponding scope of data, then the corresponding scope of data of b (n) be (fs (n), fb (n)], n Be more than or equal to 1 and less than or equal to N integer, N represent in BSR MAC CE BSR index number.
Step 102, each BSR index to filling in BSR MAC CE, calculate this BSR index right Position in the indicated scope of data of this BSR index for the logic channel group buffer data size answered, Obtain the secondary size instruction of BSR index;
Step 102 specifically includes following process:For index b (n), according to formula 1, formula 2 or Formula 3 obtains secondary size instruction p (n) of BSR index, and wherein, K (n) represents n-th BSR index Corresponding actual buffering area size, symbolExpression rounds up;
Formula 1;
Formula 2;
Formula 3.
Step 103, in the remaining filling bit of medium access control layer protocol data cell MAC PDU According to the order of the BSR index of filling in BSR MAC CE, insert the bit information of secondary size instruction.
Step 103 specifically includes following process:
Secondary size instruction p (n) of pass-through mode one, mode two or mode three computation index b (n) is corresponding The instruction of secondary size bit information z (n), wherein, J represents for filling each secondary size instruction Bit number, the index set that J bit can represent is { 0,1 ..., 2J-1};
Mode one:OrderWherein α s is greater than 0 and the decimal less than or equal to 1, If there is q, meet 0<q≤2J- 1 and meet fs (n)+(q-1) w (n)<P (n)≤fs (n)+q w (n), then Z (n)=q-1, if fs (n)+(2J-1)·w(n)<P (n)≤fb (n), then z (n)=2J-1;
Mode two:OrderWherein α b is greater than 0 and the decimal less than or equal to 1, If there is q, meet 0<q≤2J- 1 and meet fs (n)+(q-1) w (n)<P (n)≤fs (n)+q w (n), then Z (n)=q-1;If fs (n)+(2J-1)·w(n)<P (n)≤fb (n), then z (n)=2J-1;
Mode three:OrderWherein α c is greater than 0 and is less than or equal to 1 Decimal, if there is q, meet 0<q≤2J- 1 and meet fs(n)+(q-1)·w(n)<P (n)≤fs (n)+q w (n), then z (n)=q-1;If fs(n)+(2J-1)·w(n)<P (n)≤fb (n), then z (n)=2J-1.
It should be noted that in embodiments of the present invention, if MAC PDU remaining filling bit number is little In J bit, then do not carry out the filling of the bit information of secondary size instruction, wherein, J represents for filling The bit number of each secondary size instruction;If MAC PDU remaining filling bit number is more than or equal to L J bit and be less than (L+1) J bit, then can be corresponding secondary with the individual BSR index value of front min (L, N) The bit information of size instruction replaces the filling bit of same bits, inserts secondary size in MAC PDU Indicate bit information, wherein, L be MAC PDU remaining filling bit number divided by J backward under round The numerical value obtaining afterwards.For example, if remaining filling bit is 35, J is 6, then L is 5.
Below in conjunction with example, the technique scheme of the embodiment of the present invention is described in detail.
Embodiment 1
In this example, it is assumed that UE needs to send out BSR in present sub-frame, and each logic channel group degree pair The BSR index value only one of which answered, then UE complete the filling of BSR according to step described in Fig. 1:
Step 1, UE forms BSR MAC according to each logic channel group buffer size and BSR form CE.
Represent the BSR index number in this BSR MAC CE with N, represent n-th BSR with K (n) Index corresponding UE actual buffering area size, represent the BSR index value of n-th relief area with b (n), use Fs (n) represents the lower limit of the corresponding scope of data of b (n), represents the upper of the corresponding scope of data of b (n) with fb (n) Limit value, n is the integer of 1~N, then the corresponding scope of data of b (n) be (fs (n), fb (n)], represent this data Scope is greater than fs (n) and the integer less than or equal to fb (n).
Step 2, each BSR index to filling in BSR MAC CE for the UE, calculate this index correspondence and patrol Collect position in the indicated scope of data of this BSR index for the channel group buffer data size, i.e. this rope The secondary size instruction drawn.
For index b (n), p (n) is made to represent its secondary size instruction.
The method preferably calculating the secondary size instruction of each index has following 3 kinds:
Method 1:For index b (n),
Method 2:For index b (n),
Method 3:For index b (n),
In said method 1,2 and 3, symbolRepresent that rounding mode is to round up.Implement when Time can only use a kind of method, and the method should UE and base station be aware that.
Step 3, according to the BSR of filling in BSR MAC CE in the remaining filling bit of MAC PDU Indexed sequential, inserts the bit information of secondary size instruction.
J is made to represent the bit number for filling each secondary size instruction.The indexed set that then J bit can represent Conjunction is { 0,1 ..., 2J-1}.
The value of J is greater than 0 integer, is preferably worth for J=4 or J=5 or J=8.In one system, excellent The value only one of which of the J of choosing, and be UE and base station both knows about.
For index b (n), its secondary size is designated as p (n), makes the corresponding secondary size instruction of p (n) Bit information is denoted as z (n).
The method preferably calculating z (n) has following 3 kinds:
Method 1:OrderWherein α s is greater than 0 decimal being less than or equal to 1, preferably Value be 0.16 or 0.17 or 0.23 or 0.32.If there is q, meet 0<q≤2J- 1 and meet fs(n)+(q-1)·w(n)<P (n)≤fs (n)+q w (n), then z (n)=q-1;If fs(n)+(2J-1)·w(n)<P (n)≤fb (n), then z (n)=2J-1.
Method 2:OrderWherein α b is greater than 0 decimal being less than or equal to 1, preferably Value be 0.15 or 0.16 or 0.19 or 0.32.If there is q, meet 0<q≤2J- 1 and meet fs(n)+(q-1)·w(n)<P (n)≤fs (n)+q w (n), then z (n)=q-1;If fs(n)+(2J-1)·w(n)<P (n)≤fb (n), then z (n)=2J-1.
Method 3:OrderWherein α c is greater than 0 decimal being less than or equal to 1, Preferably value is 1.If there is q, meet 0<q≤2J- 1 and meet fs(n)+(q-1)·w(n)<P (n)≤fs (n)+q w (n), then z (n)=q-1;If fs(n)+(2J-1)·w(n)<P (n)≤fb (n), then z (n)=2J-1.
It should be noted that in embodiments of the present invention, if step 2 calculating p (n) is method 1, Then step 3 calculates z (n) method for optimizing 1;If what step 2 calculated p (n) is method 2, step 3 Calculate z (n) method for optimizing 2;If what step 2 calculated p (n) is method 3, step 3 calculates z (n) Method for optimizing 3.
MAC PDU structure is as shown in Fig. 2 include MAC effective information and filling bit, if MAC PDU remaining filling bit number is less than J bit, then do not carry out the bit information filling of secondary size instruction. If MAC PDU remaining filling bit number is more than or equal to L J bit, and it is less than (L+1) J bit, then Can be replaced mutually on year-on-year basis with the bit information of the corresponding secondary size instruction of the individual BSR index value of front min (L, N) Special filling bit, inserts the bit information of secondary size instruction in MAC PDU.
Embodiment 2
In this example, it is assumed that UE needs to send out BSR in present sub-frame, and each logic channel group degree pair The BSR index value answered has multiple, then in UE multiple BSR indexes corresponding to each logic channel group Minima carry out the bit information filling of secondary size instruction, i.e. the only BSR to each logic channel group Index minima is according to step operation described in Fig. 1:
Step 1, UE forms BSR MAC according to each logic channel group buffer size and BSR form CE.
Represent the BSR index number in this BSR MAC CE with N, represent n-th BSR with K (n) Index corresponding UE actual buffering area size, represent the BSR index value of n-th relief area with b (n), use Fs (n) represents the lower limit of the corresponding scope of data of b (n), represents the upper of the corresponding scope of data of b (n) with fb (n) Limit value, n is the integer of 1~N, then the corresponding scope of data of b (n) be (fs (n), fb (n)], represent this data Scope is greater than fs (n) and the integer less than or equal to fb (n).
Step 2, each BSR index to filling in BSR MAC CE for the UE, calculate this index correspondence and patrol Collect position in the indicated scope of data of this BSR index for the channel group buffer data size, i.e. this rope The secondary size instruction drawn.
For index b (n), p (n) is made to represent its secondary size instruction.
The method preferably calculating the secondary size instruction of each index has following 3 kinds:
Method 1:For index b (n),
Method 2:For index b (n),
Method 3:For index b (n),
In said method 1,2 and 3, symbolRepresent that rounding mode is to round up.Implement when Time can only use a kind of method, and the method should UE and base station be aware that.
Step 3, according to the BSR of filling in BSR MAC CE in the remaining filling bit of MAC PDU Indexed sequential, inserts the bit information of secondary size instruction.
J is made to represent the bit number for filling each secondary size instruction.The indexed set that then J bit can represent Conjunction is { 0,1 ..., 2J-1}.
The value of J is greater than 0 integer, is preferably worth for J=4 or J=5 or J=8.In one system, excellent The value only one of which of the J of choosing, and be UE and base station both knows about.
For index b (n), its secondary size is designated as p (n), makes the corresponding secondary size instruction of p (n) Bit information is denoted as z (n).
The method preferably calculating z (n) has following 3 kinds:
Method 1:OrderWherein α s is greater than 0 decimal being less than or equal to 1, preferably Value be 0.16 or 0.17 or 0.23 or 0.32.If there is q, meet 0<q≤2J- 1 and meet fs(n)+(q-1)·w(n)<P (n)≤fs (n)+q w (n), then z (n)=q-1;If fs(n)+(2J-1)·w(n)<P (n)≤fb (n), then z (n)=2J-1.
Method 2:OrderWherein α b is greater than 0 decimal being less than or equal to 1, preferably Value be 0.15 or 0.16 or 0.19 or 0.32.If there is q, meet 0<q≤2J- 1 and meet fs(n)+(q-1)·w(n)<P (n)≤fs (n)+q w (n), then z (n)=q-1;If fs(n)+(2J-1)·w(n)<P (n)≤fb (n), then z (n)=2J-1.
Method 3:OrderWherein α c is greater than 0 decimal being less than or equal to 1, Preferably value is 1.If there is q, meet 0<q≤2J- 1 and meet fs(n)+(q-1)·w(n)<P (n)≤fs (n)+q w (n), then z (n)=q-1;If fs(n)+(2J-1)·w(n)<P (n)≤fb (n), then z (n)=2J-1.
It should be noted that if step 2 calculating p (n) is method 1, it is excellent that step 3 calculates z (n) Choosing method 1;If what step 2 calculated p (n) is method 2, step 3 calculates z (n) method for optimizing 2; If what step 2 calculated p (n) is method 3, step 3 calculates z (n) method for optimizing 3.
MAC PDU structure is as shown in Fig. 2 include MAC effective information and filling bit, if MAC PDU remaining filling bit number is less than J bit, then do not carry out the bit information filling of secondary size instruction. If MAC PDU remaining filling bit number is more than or equal to L J bit, and it is less than (L+1) J bit, then Can be replaced mutually on year-on-year basis with the bit information of the corresponding secondary size instruction of the individual BSR index value of front min (L, N) Special filling bit, inserts the bit information of secondary size instruction in MAC PDU.
In sum, by means of the technical scheme of the embodiment of the present invention, solve in prior art base station according to Index value can only know the quantitative range of the buffer data size of the logic channel group of this BSR corresponding UE from And the problem of exactly accurate scheduling can not be carried out, it is possible to increase and the precision of BSR, contribute to base station and carry out More accurately dispatch, thus saving ascending wireless resource.
Device embodiment
According to embodiments of the invention, there is provided a kind of Buffer Status Report generating means, Fig. 3 is this The structural representation of the Buffer Status Report generating means of bright embodiment, as shown in figure 3, according to the present invention The Buffer Status Report generating means of embodiment include:Generation module 30, computing module 32 and fill out The modules of the embodiment of the present invention are described in detail by writing module 34 below.
Generation module 30, for the buffer size according to each logic channel group and Buffer Status Report BSR form generates Buffer Status Report media access control layer control element BSR MAC CE;Generate Module 30 specifically for:
B (n) is loaded in BSR MAC CE, wherein, b (n) represents the BSR rope of n-th relief area Draw value, fs (n) represents the lower limit of the corresponding scope of data of b (n), fb (n) represents the corresponding scope of data of b (n) Higher limit, then the corresponding scope of data of b (n) be (fs (n), fb (n)], n is more than or equal to 1 and to be less than or equal to The integer of N, N represents the BSR index number in BSR MAC CE.
Computing module 32, for each BSR index to filling in BSR MAC CE, calculates this BSR Index corresponding logic channel group buffer data size in the indicated scope of data of this BSR index Position, obtains the secondary size instruction of BSR index;
Computing module 32 specifically for:
For index b (n), the secondary big of BSR index is obtained according to formula 1, formula 2 or formula 3 Little instruction p (n), wherein, K (n) represents that n-th BSR indexes corresponding actual buffering area size, symbol Expression rounds up;
Formula 1;
Formula 2;
Formula 3.
Fill in module 34, for the residue filling in medium access control layer protocol data cell MAC PDU The order indexing according to the BSR of filling in BSR MAC CE in bit, inserts the ratio of secondary size instruction Special information.Fill in module 34 specifically for:
Secondary size instruction p (n) of pass-through mode one, mode two or mode three computation index b (n) is corresponding The instruction of secondary size bit information z (n), wherein, J represents for filling each secondary size instruction Bit number, the index set that J bit can represent is { 0,1 ..., 2J-1};
Mode one:OrderWherein α s is greater than 0 and the decimal less than or equal to 1, If there is q, meet 0<q≤2J- 1 and meet fs (n)+(q-1) w (n)<P (n)≤fs (n)+q w (n), then Z (n)=q-1, if fs (n)+(2J-1)·w(n)<P (n)≤fb (n), then z (n)=2J-1;
Mode two:OrderWherein α b is greater than 0 and the decimal less than or equal to 1, If there is q, meet 0<q≤2J- 1 and meet fs (n)+(q-1) w (n)<P (n)≤fs (n)+q w (n), then Z (n)=q-1;If fs (n)+(2J-1)·w(n)<P (n)≤fb (n), then z (n)=2J-1;
Mode three:OrderWherein α c is greater than 0 and is less than or equal to 1 Decimal, if there is q, meet 0<q≤2J- 1 and meet fs(n)+(q-1)·w(n)<P (n)≤fs (n)+q w (n), then z (n)=q-1;If fs(n)+(2J-1)·w(n)<P (n)≤fb (n), then z (n)=2J-1.
Fill in module 34 to be further used for:
If MAC PDU remaining filling bit number is less than J bit, do not carry out secondary size instruction The filling of bit information, wherein, J represents the bit number for filling each secondary size instruction;
If MAC PDU remaining filling bit number is more than or equal to L J bit and is less than (L+1) J ratio Spy, then can be replaced with the bit information of the corresponding secondary size instruction of the individual BSR index value of front min (L, N) The filling bit of same bits, inserts the bit information of secondary size instruction in MAC PDU, wherein, The numerical value that L obtains after rounding under backward divided by J for MAC PDU remaining filling bit number.
The modules of the embodiment of the present invention can be understood according to the corresponding description of embodiment of the method, here Repeat no more.
In sum, by means of the technical scheme of the embodiment of the present invention, solve in prior art base station according to Index value can only know the quantitative range of the buffer data size of the logic channel group of this BSR corresponding UE from And the problem of exactly accurate scheduling can not be carried out, it is possible to increase and the precision of BSR, contribute to base station and carry out More accurately dispatch, thus saving ascending wireless resource.
Obviously, those skilled in the art can carry out various changes and modification without deviating from this to the present invention Bright spirit and scope.So, if the present invention these modification and modification belong to the claims in the present invention and Within the scope of its equivalent technologies, then the present invention is also intended to comprise these changes and modification.
Algorithm and display be not intrinsic with any certain computer, virtual system or miscellaneous equipment provided herein Related.Various general-purpose systems can also be used together with based on teaching in this.As described above, structure It is obvious for making the structure required by this kind of system.Additionally, the present invention is also not for any certain programmed Language.It is understood that, it is possible to use various programming languages realize the content of invention described herein, and The description above language-specific done is the preferred forms in order to disclose the present invention.
In description mentioned herein, illustrate a large amount of details.It is to be appreciated, however, that this Bright embodiment can be put into practice in the case of not having these details.In some instances, not in detail Known method, structure and technology are shown, so as not to obscure the understanding of this description.
Similarly it will be appreciated that in order to simplify the disclosure helping understand one of each inventive aspect or Multiple, in the description to the exemplary embodiment of the present invention above, each feature of the present invention is sometimes by one Rise and be grouped in single embodiment, figure or descriptions thereof.However, should not be by the method for the disclosure It is construed to reflect following intention:I.e. the present invention for required protection requires than institute in each claim clearly The more feature of feature recorded.More precisely, as the following claims reflect, sending out Bright aspect is all features less than single embodiment disclosed above.Therefore, it then follows specific embodiment Claims be thus expressly incorporated in this specific embodiment, wherein each claim conduct itself The separate embodiments of the present invention.
Those skilled in the art are appreciated that and the module in the client in embodiment can be carried out certainly Adaptively change and they are arranged in one or more clients different from this embodiment.Permissible Block combiner in embodiment is become a module, and multiple submodule or son can be divided in addition Unit or sub-component.Except such feature and/or at least some of process or unit exclude each other it Outward, can be using any combinations to public in this specification (including adjoint claim, summary and accompanying drawing) The all features opened and all processes of so disclosed any method or client or unit carry out group Close.Unless expressly stated otherwise, public in this specification (including adjoint claim, summary and accompanying drawing) Each feature opened can be replaced by the alternative features providing identical, equivalent or similar purpose.
Although additionally, it will be appreciated by those of skill in the art that some embodiments described herein include other Included some features rather than further feature in embodiment, but the group of the feature of different embodiment is desirable Taste and is within the scope of the present invention and is formed different embodiments.For example, in following claim In book, embodiment required for protection one of arbitrarily can in any combination mode using.
The all parts embodiment of the present invention can be realized with hardware, or with one or more processor The software module of upper operation is realized, or is realized with combinations thereof.It will be understood by those of skill in the art that Can be realized real according to the present invention in practice using microprocessor or digital signal processor (DSP) Apply some or all functions of some or all parts in the client being loaded with sequence network address of example. The present invention be also implemented as some or all equipment for executing method as described herein or Person's program of device (for example, computer program and computer program).Such journey realizing the present invention Sequence can store on a computer-readable medium, or can have the form of one or more signal.This The signal of sample can be downloaded from internet website and obtain, or provides on carrier signal, or with any Other forms provide.
It should be noted that above-described embodiment the present invention will be described rather than limits the invention, and And those skilled in the art can design replacement enforcement without departing from the scope of the appended claims Example.In the claims, any reference markss between bracket should not be configured to claim Limit.Word "comprising" does not exclude the presence of element not listed in the claims or step.Before element Word "a" or "an" do not exclude the presence of multiple such elements.If the present invention can be by means of including The hardware of dry different elements and being realized by means of properly programmed computer.If listing equipment for drying In unit claim, several in these devices can be embodied by same hardware branch. The use of word first, second, and third does not indicate that any order.These words can be explained and run after fame Claim.

Claims (10)

1. a kind of Buffer Status Report generation method is it is characterised in that include:
Buffer size according to each logic channel group and Buffer Status Report BSR form generate buffering Zone state reporting media access control layer control element BSR MAC CE;
Each BSR index to filling in described BSR MAC CE, calculates this BSR and indexes corresponding patrolling Collect position in the indicated scope of data of this BSR index for the channel group buffer data size, obtain institute State the secondary size instruction of BSR index;
According to described in the remaining filling bit of medium access control layer protocol data cell MAC PDU The order of the BSR index of filling in BSR MAC CE, inserts the bit information of described secondary size instruction.
2. the method for claim 1 is it is characterised in that buffering according to each logic channel group Area's size and Buffer Status Report BSR form generate Buffer Status Report media access control layer and control Element B SR MAC CE specifically includes:
B (n) is loaded in BSR MAC CE, wherein, b (n) represents the BSR rope of n-th relief area Draw value, fs (n) represents the lower limit of the corresponding scope of data of b (n), fb (n) represents the corresponding scope of data of b (n) Higher limit, then the corresponding scope of data of b (n) be (fs (n), fb (n)], n is more than or equal to 1 and to be less than or equal to The integer of N, N represents the BSR index number in described BSR MAC CE.
3. method as claimed in claim 2 is it is characterised in that fill in described BSR MAC CE Each BSR index, calculate this BSR index corresponding logic channel group buffer data size in this BSR Position in the indicated scope of data of index, the secondary size obtaining described BSR index indicates concrete bag Include:
For index b (n), obtain the two of described BSR index according to formula 1, formula 2 or formula 3 Secondary size instruction p (n), wherein, K (n) represents that n-th BSR indexes corresponding actual buffering area size, symbol NumberExpression rounds up;
Formula 1;
Formula 2;
Formula 3.
4. method as claimed in claim 2 is it is characterised in that in medium access control layer protocol data According to the BSR index of filling in described BSR MAC CE in the remaining filling bit of unit MAC PDU Order, the bit information inserting described secondary size instruction specifically includes:
Secondary size instruction p (n) of pass-through mode one, mode two or mode three computation index b (n) is corresponding The instruction of secondary size bit information z (n), wherein, J represents for filling each secondary size instruction Bit number, the index set that J bit can represent is
Mode one:OrderWherein α s is greater than 0 and the decimal less than or equal to 1, If there is q, meet 0<q≤2J- 1 and meet fs (n)+(q-1) w (n)<P (n)≤fs (n)+q w (n), then Z (n)=q-1, if fs (n)+(2J-1)·w(n)<P (n)≤fb (n), then z (n)=2J-1;
Mode two:OrderWherein α b is greater than 0 and the decimal less than or equal to 1, If there is q, meet 0<q≤2J- 1 and meet fs (n)+(q-1) w (n)<P (n)≤fs (n)+q w (n), then Z (n)=q-1;If fs (n)+(2J-1)·w(n)<P (n)≤fb (n), then z (n)=2J-1;
Mode three:OrderWherein α c is greater than 0 and is less than or equal to 1 Decimal, if there is q, meet 0<q≤2J- 1 and meet fs(n)+(q-1)·w(n)<P (n)≤fs (n)+q w (n), then z (n)=q-1;If fs(n)+(2J-1)·w(n)<P (n)≤fb (n), then z (n)=2J-1.
5. the method for claim 1 is it is characterised in that methods described further includes:
If MAC PDU remaining filling bit number is less than J bit, do not carry out secondary size instruction The filling of bit information, wherein, J represents the bit number for filling each secondary size instruction;
If MAC PDU remaining filling bit number is more than or equal to L J bit and is less than (L+1) J ratio Spy, then can be replaced with the bit information of the corresponding secondary size instruction of the individual BSR index value of front min (L, N) The filling bit of same bits, inserts the bit information of secondary size instruction in MAC PDU, wherein, The numerical value that L obtains after rounding under backward divided by J for MAC PDU remaining filling bit number.
6. a kind of Buffer Status Report generating means it is characterised in that
Generation module, for the buffer size according to each logic channel group and Buffer Status Report BSR Form generates Buffer Status Report media access control layer control element BSR MAC CE;
Computing module, for each BSR index to filling in described BSR MAC CE, calculates this BSR Index corresponding logic channel group buffer data size in the indicated scope of data of this BSR index Position, obtains the secondary size instruction of described BSR index;
Fill in module, for the remaining packing ratio in medium access control layer protocol data cell MAC PDU The order indexing according to the BSR of filling in described BSR MAC CE in spy, inserts described secondary big little finger of toe The bit information showing.
7. device as claimed in claim 6 it is characterised in that described generation module specifically for:
B (n) is loaded in BSR MAC CE, wherein, b (n) represents the BSR rope of n-th relief area Draw value, fs (n) represents the lower limit of the corresponding scope of data of b (n), fb (n) represents the corresponding scope of data of b (n) Higher limit, then the corresponding scope of data of b (n) be (fs (n), fb (n)], n is more than or equal to 1 and to be less than or equal to The integer of N, N represents the BSR index number in described BSR MAC CE.
8. device as claimed in claim 7 it is characterised in that computing module specifically for:
For index b (n), obtain the two of described BSR index according to formula 1, formula 2 or formula 3 Secondary size instruction p (n), wherein, K (n) represents that n-th BSR indexes corresponding actual buffering area size, symbol NumberExpression rounds up;
Formula 1;
Formula 2;
Formula 3.
9. device as claimed in claim 7 it is characterised in that described fill in module specifically for:
Secondary size instruction p (n) of pass-through mode one, mode two or mode three computation index b (n) is corresponding The instruction of secondary size bit information z (n), wherein, J represents for filling each secondary size instruction Bit number, the index set that J bit can represent is
Mode one:OrderWherein α s is greater than 0 and the decimal less than or equal to 1, If there is q, meet 0<q≤2J- 1 and meet fs (n)+(q-1) w (n)<P (n)≤fs (n)+q w (n), then Z (n)=q-1, if fs (n)+(2J-1)·w(n)<P (n)≤fb (n), then z (n)=2J-1;
Mode two:OrderWherein α b is greater than 0 and the decimal less than or equal to 1, If there is q, meet 0<q≤2J- 1 and meet fs (n)+(q-1) w (n)<P (n)≤fs (n)+q w (n), then Z (n)=q-1;If fs (n)+(2J-1)·w(n)<P (n)≤fb (n), then z (n)=2J-1;
Mode three:OrderWherein α c is greater than 0 and is less than or equal to 1 Decimal, if there is q, meet 0<q≤2J- 1 and meet fs(n)+(q-1)·w(n)<P (n)≤fs (n)+q w (n), then z (n)=q-1;If fs(n)+(2J-1)·w(n)<P (n)≤fb (n), then z (n)=2J-1.
10. device as claimed in claim 6 is it is characterised in that described module of filling in is further used for:
If MAC PDU remaining filling bit number is less than J bit, do not carry out secondary size instruction The filling of bit information, wherein, J represents the bit number for filling each secondary size instruction;
If MAC PDU remaining filling bit number is more than or equal to L J bit and is less than (L+1) J ratio Spy, then can be replaced with the bit information of the corresponding secondary size instruction of the individual BSR index value of front min (L, N) The filling bit of same bits, inserts the bit information of secondary size instruction in MAC PDU, wherein, The numerical value that L obtains after rounding under backward divided by J for MAC PDU remaining filling bit number.
CN201510514740.1A 2015-08-21 2015-08-21 Buffer status report generation method and device Pending CN106470445A (en)

Priority Applications (2)

Application Number Priority Date Filing Date Title
CN201510514740.1A CN106470445A (en) 2015-08-21 2015-08-21 Buffer status report generation method and device
PCT/CN2016/081320 WO2017032059A1 (en) 2015-08-21 2016-05-06 Buffer status report generation method and device

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201510514740.1A CN106470445A (en) 2015-08-21 2015-08-21 Buffer status report generation method and device

Publications (1)

Publication Number Publication Date
CN106470445A true CN106470445A (en) 2017-03-01

Family

ID=58099531

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201510514740.1A Pending CN106470445A (en) 2015-08-21 2015-08-21 Buffer status report generation method and device

Country Status (2)

Country Link
CN (1) CN106470445A (en)
WO (1) WO2017032059A1 (en)

Cited By (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN107360591A (en) * 2017-06-15 2017-11-17 电信科学技术研究院 A kind of method and apparatus of reporting buffer status report
WO2019056828A1 (en) * 2017-09-25 2019-03-28 电信科学技术研究院有限公司 Method and device for reporting cache state and allocating resources
WO2023010513A1 (en) * 2021-08-06 2023-02-09 Zte Corporation Method, device, and system for buffer status report

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109565897B (en) * 2017-06-16 2020-12-04 Oppo广东移动通信有限公司 Method and device for transmitting information

Family Cites Families (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102783234B (en) * 2010-05-03 2015-11-25 上海贝尔股份有限公司 For sending the method and apparatus of buffer status reporting in wireless network
US9413498B2 (en) * 2010-05-26 2016-08-09 Innovative Sonic Corporation Method and apparatus for handling buffer status reporting in a wireless communication system
CN102291771B (en) * 2010-06-21 2015-08-12 中兴通讯股份有限公司 A kind of method and system realizing buffer region state reporting
CN102781096B (en) * 2011-05-09 2015-05-27 华为技术有限公司 Method and user equipment for resource scheduling
CN102547669B (en) * 2012-02-10 2014-12-10 大唐移动通信设备有限公司 Data buffer status report and uplink resource scheduling methods and equipment

Cited By (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN107360591A (en) * 2017-06-15 2017-11-17 电信科学技术研究院 A kind of method and apparatus of reporting buffer status report
CN107360591B (en) * 2017-06-15 2020-01-14 电信科学技术研究院 Method and equipment for reporting buffer status report
WO2019056828A1 (en) * 2017-09-25 2019-03-28 电信科学技术研究院有限公司 Method and device for reporting cache state and allocating resources
CN109561464B (en) * 2017-09-25 2020-11-24 电信科学技术研究院 Method and equipment for reporting buffer state and allocating resources
WO2023010513A1 (en) * 2021-08-06 2023-02-09 Zte Corporation Method, device, and system for buffer status report

Also Published As

Publication number Publication date
WO2017032059A1 (en) 2017-03-02

Similar Documents

Publication Publication Date Title
CN106559198B (en) A kind of uplink control information transmission method and device based on PUCCH
CN103580825B (en) UCI transmission method and device
CN106465378B (en) Method and apparatus for transmitting uplink data
CN106160971B (en) A kind of method and apparatus that data are transmitted, receive signal detection
JP5569652B2 (en) Method for determining scheduled component carrier, user terminal, base station, and system
CN102158326B (en) Acknowledgement ACK/negative acknowledgement (NACK) feedback information transmission method and equipment
CN106470445A (en) Buffer status report generation method and device
CN110401472A (en) A kind of 3D MIMO transmission method and device
CN111147189B (en) Method, device and system for sending and receiving uplink control information
CN102215085A (en) Method, system, user equipment and base station for transmitting uplink control information
CN104601303B (en) The sending method and device and method of reseptance and device of ascending control information
CN106170957B (en) A kind of resource allocation methods and equipment
CN105594273A (en) Physical downlink data channel transmission method, base station and user equipment
CN102457854A (en) Method, device and system for solving channel conflict
CN105025576A (en) Method and device for resource allocation in D2D communication
CN111406431B (en) Method, apparatus and computer readable medium for indicating contiguous resource allocation
CN109802749A (en) A kind of PUCCH resource indicating means, terminal device and base station
CN103476120A (en) Sending method, sending device, processing method and processing device for physical uplink control channels
CN105208664A (en) Scheduling method and apparatus for TDD D2D
CN103222325B (en) Descending and the implementation method of uplink baseband resource pool and base station
CN101675636B (en) Method and device for allocating resources in OFDM network
CN111435893A (en) HARQ-ACK codebook, and information determination method and device
CN106063145B (en) For emitting the method and apparatus and method and apparatus for receiving data of data
TW201906385A (en) Uplink control channel transmission method and device
CN105356980A (en) Response message sending method and device

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
WD01 Invention patent application deemed withdrawn after publication
WD01 Invention patent application deemed withdrawn after publication

Application publication date: 20170301