CN114513269B - Processing method and device of resource selection window, terminal and readable storage medium - Google Patents
Processing method and device of resource selection window, terminal and readable storage medium Download PDFInfo
- Publication number
- CN114513269B CN114513269B CN202011288227.2A CN202011288227A CN114513269B CN 114513269 B CN114513269 B CN 114513269B CN 202011288227 A CN202011288227 A CN 202011288227A CN 114513269 B CN114513269 B CN 114513269B
- Authority
- CN
- China
- Prior art keywords
- parameter
- value
- condition
- type
- determining
- 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.)
- Active
Links
- 238000003672 processing method Methods 0.000 title abstract description 6
- 238000000034 method Methods 0.000 claims abstract description 49
- 230000009467 reduction Effects 0.000 claims description 63
- 230000015654 memory Effects 0.000 claims description 54
- 238000004590 computer program Methods 0.000 claims description 46
- 230000005540 biological transmission Effects 0.000 claims description 25
- 238000012545 processing Methods 0.000 claims description 21
- 230000007423 decrease Effects 0.000 claims description 8
- 238000010586 diagram Methods 0.000 description 10
- 230000006870 function Effects 0.000 description 6
- 230000008094 contradictory effect Effects 0.000 description 5
- 230000007774 longterm Effects 0.000 description 4
- 230000007246 mechanism Effects 0.000 description 4
- 230000003287 optical effect Effects 0.000 description 4
- 238000004891 communication Methods 0.000 description 3
- 238000012986 modification Methods 0.000 description 3
- 230000004048 modification Effects 0.000 description 3
- 238000010295 mobile communication Methods 0.000 description 2
- 101000741965 Homo sapiens Inactive tyrosine-protein kinase PRAG1 Proteins 0.000 description 1
- 102100038659 Inactive tyrosine-protein kinase PRAG1 Human genes 0.000 description 1
- 230000009286 beneficial effect Effects 0.000 description 1
- 230000001413 cellular effect Effects 0.000 description 1
- 238000012512 characterization method Methods 0.000 description 1
- 238000013500 data storage Methods 0.000 description 1
- 230000001934 delay Effects 0.000 description 1
- 230000001419 dependent effect Effects 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 238000011156 evaluation Methods 0.000 description 1
- 230000007717 exclusion Effects 0.000 description 1
- 230000000977 initiatory effect Effects 0.000 description 1
- 238000007726 management method Methods 0.000 description 1
- 238000004519 manufacturing process Methods 0.000 description 1
- 238000005259 measurement Methods 0.000 description 1
- 238000012544 monitoring process Methods 0.000 description 1
- 230000008447 perception Effects 0.000 description 1
- 230000002093 peripheral effect Effects 0.000 description 1
- 229920001690 polydopamine Polymers 0.000 description 1
- 230000008569 process Effects 0.000 description 1
- 239000004065 semiconductor Substances 0.000 description 1
- 239000007787 solid Substances 0.000 description 1
- 230000001960 triggered effect Effects 0.000 description 1
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04B—TRANSMISSION
- H04B17/00—Monitoring; Testing
- H04B17/30—Monitoring; Testing of propagation channels
- H04B17/309—Measuring or estimating channel quality parameters
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04B—TRANSMISSION
- H04B17/00—Monitoring; Testing
- H04B17/30—Monitoring; Testing of propagation channels
- H04B17/382—Monitoring; Testing of propagation channels for resource allocation, admission control or handover
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L1/00—Arrangements for detecting or preventing errors in the information received
- H04L1/12—Arrangements for detecting or preventing errors in the information received by using return channel
- H04L1/16—Arrangements for detecting or preventing errors in the information received by using return channel in which the return channel carries supervisory signals, e.g. repetition request signals
- H04L1/18—Automatic repetition systems, e.g. Van Duuren systems
- H04L1/1812—Hybrid protocols; Hybrid automatic repeat request [HARQ]
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L1/00—Arrangements for detecting or preventing errors in the information received
- H04L1/12—Arrangements for detecting or preventing errors in the information received by using return channel
- H04L1/16—Arrangements for detecting or preventing errors in the information received by using return channel in which the return channel carries supervisory signals, e.g. repetition request signals
- H04L1/18—Automatic repetition systems, e.g. Van Duuren systems
- H04L1/1829—Arrangements specially adapted for the receiver end
- H04L1/1832—Details of sliding window management
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L1/00—Arrangements for detecting or preventing errors in the information received
- H04L1/12—Arrangements for detecting or preventing errors in the information received by using return channel
- H04L1/16—Arrangements for detecting or preventing errors in the information received by using return channel in which the return channel carries supervisory signals, e.g. repetition request signals
- H04L1/18—Automatic repetition systems, e.g. Van Duuren systems
- H04L1/1867—Arrangements specially adapted for the transmitter end
- H04L1/187—Details of sliding window management
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Physics & Mathematics (AREA)
- Electromagnetism (AREA)
- Quality & Reliability (AREA)
- Mobile Radio Communication Systems (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
- Detection And Prevention Of Errors In Transmission (AREA)
Abstract
The invention provides a processing method, a device, a terminal and a readable storage medium of a resource selection window, wherein the method comprises the following steps: determining at least one of an upper limit value of a first parameter and a lower limit value of the first parameter according to at least one condition parameter; the first parameter is a boundary parameter corresponding to a termination boundary of the resource selection window; wherein the condition parameters include: service priority of service to be transmitted, channel busy rate CBR, channel occupancy rate CR or hybrid automatic repeat request HARQ maximum retransmission times; when determining the value range of the termination boundary of the resource selection window, the embodiment of the invention determines the upper limit value and/or the lower limit value of the first parameter of the termination boundary of the resource selection window according to at least one of the service priority of the service to be transmitted, the channel busy rate CBR, the channel occupancy rate CR and the maximum retransmission times of the hybrid automatic repeat request HARQ, so that the size of the resource selection window is more reasonable and unnecessary time delay is reduced.
Description
Technical Field
The present invention relates to the field of communications technologies, and in particular, to a method and apparatus for processing a resource selection window, a terminal, and a readable storage medium.
Background
The method for allocating resources based on perception in a direct link (Sidelink, side link, etc.) mainly comprises: resource awareness, resource exclusion, resource selection, resource preemption and reselection. And under the condition that the terminal does not transmit, the terminal continuously performs sensing (monitoring external information), and when the terminal needs to transmit information, the terminal excludes unavailable resources according to the result sensed in a previous period of time and selects the resources capable of transmitting the information for transmission.
For example, by the sequence of the sequences [ n-T0, n-T proc,0 ]The perceived result during this time (where T proc,0 To include the processing time of the decoded perceived resource), a window [ n+T1, n+T2 ] is selected over the resource]Internal selection resource, the starting boundary T1 of the window is less than or equal to Tplc and 1, depending on the terminal capability, tplc and 1 are transmission processing delays, the ending boundary T2 of the window meets T2min less than or equal to T2 less than or equal to PDB (Packet Delay Budget ), the value of T2 depends on the terminal implementation, and T2 min Refers to the minimum value that T2 may take, depending on the priority of the traffic.
In summary, in the prior art, the upper limit of the resource selection window is the remaining packet budget, where the priority is higher, but the packet delay budget is larger, the terminal may select a larger resource selection window, and when the channel is idle, the terminal may actually transmit with a smaller delay, but the delay of transmitting the resource selected according to the existing mechanism is larger. In addition, the minimum range of the existing resource selection window is only related to the priority, and the smaller the window is when the priority is higher, but when the channel is idle, the minimum range of the window of the service with lower priority may be larger, resulting in unnecessary delay.
Disclosure of Invention
The embodiment of the invention aims to provide a processing method, a processing device, a terminal and a readable storage medium of a resource selection window, which are used for solving the problem that the range determination mode of the resource selection window in the prior art is single in condition and cannot meet the low-delay requirement.
In order to solve the above problem, an embodiment of the present invention provides a method for processing a resource selection window, where the method includes:
determining at least one of an upper limit value of a first parameter and a lower limit value of the first parameter according to at least one condition parameter; the first parameter is a boundary parameter corresponding to a termination boundary of the resource selection window;
wherein the condition parameters include: traffic priority of traffic to be transmitted, channel busy rate CBR, channel occupancy CR or hybrid automatic repeat request HARQ maximum number of retransmissions.
Wherein determining the upper limit value of the first parameter according to the at least one condition parameter comprises:
determining a first index value according to the number of the condition parameters, the number of the grades of the condition parameters and the grade value of each condition parameter;
and determining an upper limit value corresponding to the first index value as an upper limit value of the first parameter according to the first index value.
Wherein determining a first index value according to the number of the condition parameters, the number of the grades of the condition parameters and the grade value of each condition parameter comprises:
determining the first index value s according to a first formula; wherein, the first formula is:
wherein s is a first index value; m is the sum of the grade values of all the condition parameters; n1 is the number of conditional parameters; c is the number of levels of the condition parameter.
Wherein determining the upper limit value of the first parameter according to the at least one condition parameter comprises:
acquiring n2 condition parameters reaching the window upper limit reduction threshold; n2 is an integer greater than or equal to 1;
and determining the upper limit value of the first parameter according to the average reduced scale value of the n2 condition parameters, the shortest time required by the initial retransmission resource of one transmission block and the packet delay budget of the service to be transmitted.
Wherein determining the upper limit value of the first parameter according to the average reduced scale value of the n2 condition parameters, the shortest time required by the initial retransmission resource of one transport block and the packet delay budget of the service to be transmitted comprises:
determining an upper limit value T2max of the first parameter according to a second formula; wherein the second formula is:
Wherein T2max is the upper limit value of the first parameter; q is the minimum time required for the initial retransmission resource of one transport block; PDB is packet delay budget of service to be transmitted; r is the average reduction ratio value of n2 condition parameters.
Wherein the method further comprises:
determining a reduction ratio value of each of the n2 condition parameters;
and calculating the average value of the reduction ratio values of the condition parameters, and determining the average reduction ratio value of the n2 condition parameters.
Wherein the method comprises the following steps:
determining a reduced scale value r' of a condition parameter according to a third formula; wherein the third formula is:
wherein r' is a reduced scale value of a conditional parameter; x1 is the value of the condition parameter; y1 is a window upper limit reduction threshold corresponding to the condition parameter; e is a predetermined coefficient.
Wherein determining the upper limit value of the first parameter according to the at least one condition parameter comprises:
determining a first type of condition parameter and a second type of condition parameter in the at least one condition parameter, wherein the increase of the value of the first type of condition parameter increases the upper limit value of the first parameter, and the increase of the value of the second type of condition parameter decreases the upper limit value of the first parameter;
If the value of the first type of condition parameter reaches the threshold value corresponding to the first type of condition parameter and the value of the second type of condition parameter reaches the threshold value corresponding to the second type of condition parameter, determining n3 combinations of the first type of condition parameter and the second type of condition parameter which reach the threshold value; n3 is an integer greater than or equal to 1;
determining the upper limit value of the first parameter corresponding to each second type condition parameter according to the reduced scale value of each second type condition parameter in the n3 second type condition parameters, the shortest time required by the initial retransmission resource of one transmission block and the packet delay budget of the service to be transmitted;
and calculating the average value of the upper limit values of the first parameters corresponding to the second class condition parameters respectively, and determining the upper limit value of the first parameters.
Wherein determining the upper limit value of the first parameter corresponding to each second type condition parameter according to the reduced scale value of each second type condition parameter in the n3 second type condition parameters, the shortest time required by the initial retransmission resource of a transmission block and the packet delay budget of the service to be transmitted, comprises:
according to a fourth formula, determining an upper limit value T2max' of the first parameter corresponding to the second type of condition parameter; wherein the fourth formula is:
Wherein T2max' is the upper limit value of the first parameter corresponding to the second type of condition parameter; q is the minimum time required for the initial retransmission resource of one transport block; PDB is packet delay budget of service to be transmitted; b is a scaled down value of a second type of conditional parameter.
Wherein the method further comprises:
according to a fifth formula, determining a reduction ratio value b of one second type of condition parameters in the n3 second type of condition parameters; wherein the fifth formula is:
b=|y2-x2|*d;
wherein b is a reduced scale value of a second type of condition parameter; x2 is the value of the second type condition parameter; y2 is a threshold value corresponding to the second type of condition parameter; d is the coefficient corresponding to the second class condition parameter.
Wherein determining the lower limit value of the first parameter according to at least one condition parameter comprises:
determining a first index of a candidate lower limit value of the first parameter according to the service priority;
if the value of the existing condition parameter reaches a first threshold value and the difference between the value and the first threshold value is larger than or equal to a second threshold value, subtracting 1 from the first index to obtain a second index;
if the candidate lower limit value of the first parameter corresponding to the second index is larger than or equal to the shortest time required by the initial retransmission resource of one transmission block, determining that the lower limit value of the first parameter is the candidate lower limit value of the first parameter corresponding to the second index; otherwise, adding 1 to the second index to obtain a first index, and determining the lower limit value of the first parameter as a candidate lower limit value of the first parameter corresponding to the first index.
Wherein the method further comprises:
according to a sixth formula, determining a shortest time q required by the initial retransmission resource of one transport block; wherein, the sixth formula is:
q=(Nmax-1)*HARQ RTT+T1+Ts;
wherein q is the shortest time required for the initial retransmission resource of one transport block; nmax is the sum of the initial retransmission times of one transport block; the HARQ RTT is the round trip time of the hybrid automatic repeat request; t1 is a boundary parameter corresponding to the initial boundary of the resource selection window; ts is the sum of the time domain lengths of the reserved resources.
The embodiment of the invention also provides a processing device of the resource selection window, which comprises the following steps:
a determining unit configured to determine at least one of an upper limit value of a first parameter and a lower limit value of the first parameter according to at least one condition parameter; the first parameter is a boundary parameter corresponding to a termination boundary of the resource selection window;
wherein the condition parameters include: traffic priority of traffic to be transmitted, channel busy rate CBR, channel occupancy CR or hybrid automatic repeat request HARQ maximum number of retransmissions.
The embodiment of the invention also provides a terminal, which comprises a memory, a transceiver and a processor:
a memory for storing a computer program; a transceiver for transceiving data under control of the processor; a processor for reading the computer program in the memory and performing the following operations:
Determining at least one of an upper limit value of a first parameter and a lower limit value of the first parameter according to at least one condition parameter; the first parameter is a boundary parameter corresponding to a termination boundary of the resource selection window;
wherein the condition parameters include: traffic priority of traffic to be transmitted, channel busy rate CBR, channel occupancy CR or hybrid automatic repeat request HARQ maximum number of retransmissions.
Wherein the processor is further configured to read the computer program in the memory and perform the following operations:
determining a first index value according to the number of the condition parameters, the number of the grades of the condition parameters and the grade value of each condition parameter;
and determining an upper limit value corresponding to the first index value as an upper limit value of the first parameter according to the first index value.
Wherein the processor is further configured to read the computer program in the memory and perform the following operations:
determining the first index value s according to a first formula; wherein, the first formula is:
wherein s is a first index value; m is the sum of the grade values of all the condition parameters; n1 is the number of conditional parameters; c is the number of levels of the condition parameter.
Wherein the processor is further configured to read the computer program in the memory and perform the following operations:
acquiring n2 condition parameters reaching the window upper limit reduction threshold; n2 is an integer greater than or equal to 1;
and determining the upper limit value of the first parameter according to the average reduced scale value of the n2 condition parameters, the shortest time required by the initial retransmission resource of one transmission block and the packet delay budget of the service to be transmitted.
Wherein the processor is further configured to read the computer program in the memory and perform the following operations:
determining an upper limit value T2max of the first parameter according to a second formula; wherein the second formula is:
wherein T2max is the upper limit value of the first parameter; q is the minimum time required for the initial retransmission resource of one transport block; PDB is packet delay budget of service to be transmitted; r is the average reduction ratio value of n2 condition parameters.
Wherein the processor is further configured to read the computer program in the memory and perform the following operations:
determining a reduction ratio value of each of the n2 condition parameters;
and calculating the average value of the reduction ratio values of the condition parameters, and determining the average reduction ratio value of the n2 condition parameters.
Wherein the processor is further configured to read the computer program in the memory and perform the following operations:
determining a reduced scale value r' of a condition parameter according to a third formula; wherein the third formula is:
wherein r' is a reduced scale value of a conditional parameter; x1 is the value of the condition parameter; y1 is a window upper limit reduction threshold corresponding to the condition parameter; e is a predetermined coefficient.
Wherein the processor is further configured to read the computer program in the memory and perform the following operations:
determining a first type of condition parameter and a second type of condition parameter in the at least one condition parameter, wherein the increase of the value of the first type of condition parameter increases the upper limit value of the first parameter, and the increase of the value of the second type of condition parameter decreases the upper limit value of the first parameter;
if the value of the first type of condition parameter reaches the threshold value corresponding to the first type of condition parameter and the value of the second type of condition parameter reaches the threshold value corresponding to the second type of condition parameter, determining n3 combinations of the first type of condition parameter and the second type of condition parameter which reach the threshold value; n3 is an integer greater than or equal to 1;
Determining the upper limit value of the first parameter corresponding to each second type condition parameter according to the reduced scale value of each second type condition parameter in the n3 second type condition parameters, the shortest time required by the initial retransmission resource of one transmission block and the packet delay budget of the service to be transmitted;
and calculating the average value of the upper limit values of the first parameters corresponding to the second class condition parameters respectively, and determining the upper limit value of the first parameters.
Wherein the processor is further configured to read the computer program in the memory and perform the following operations:
according to a fourth formula, determining an upper limit value T2max' of the first parameter corresponding to the second type of condition parameter; wherein the fourth formula is:
wherein T2max' is the upper limit value of the first parameter corresponding to the second type of condition parameter; q is the minimum time required for the initial retransmission resource of one transport block; PDB is packet delay budget of service to be transmitted; b is a scaled down value of a second type of conditional parameter.
Wherein the processor is further configured to read the computer program in the memory and perform the following operations:
according to a fifth formula, determining a reduction ratio value b of one second type of condition parameters in the n3 second type of condition parameters; wherein the fifth formula is:
b=|y2-x2|*d;
Wherein b is a reduced scale value of a second type of condition parameter; x2 is the value of the second type condition parameter; y2 is a threshold value corresponding to the second type of condition parameter; d is the coefficient corresponding to the second class condition parameter.
Wherein the processor is further configured to read the computer program in the memory and perform the following operations:
determining a first index of a candidate lower limit value of the first parameter according to the service priority;
if the value of the existing condition parameter reaches a first threshold value and the difference between the value and the first threshold value is larger than or equal to a second threshold value, subtracting 1 from the first index to obtain a second index;
if the candidate lower limit value of the first parameter corresponding to the second index is larger than or equal to the shortest time required by the initial retransmission resource of one transmission block, determining that the lower limit value of the first parameter is the candidate lower limit value of the first parameter corresponding to the second index; otherwise, adding 1 to the second index to obtain a first index, and determining the lower limit value of the first parameter as a candidate lower limit value of the first parameter corresponding to the first index.
Wherein the processor is further configured to read the computer program in the memory and perform the following operations:
according to a sixth formula, determining a shortest time q required by the initial retransmission resource of one transport block; wherein, the sixth formula is:
q-(Nmax-1)*HARQ RTT+T1+Ts;
Wherein q is the shortest time required for the initial retransmission resource of one transport block; nmax is the sum of the initial retransmission times of one transport block; the HARQ RTT is the round trip time of the hybrid automatic repeat request; t1 is a boundary parameter corresponding to the initial boundary of the resource selection window; ts is the sum of the time domain lengths of the reserved resources.
Embodiments of the present invention also provide a processor-readable storage medium storing a computer program for causing the processor to perform the method as described above.
The technical scheme of the invention has at least the following beneficial effects:
in the processing method, the device, the terminal and the readable storage medium of the resource selection window, when the value range of the termination boundary of the resource selection window is determined, the upper limit value and/or the lower limit value of the first parameter of the termination boundary of the resource selection window are determined according to at least one of the service priority of the service to be transmitted, the channel busy rate CBR, the channel occupancy rate CR and the maximum retransmission times of the hybrid automatic repeat request HARQ, so that the size of the resource selection window is more reasonable, and unnecessary time delay is reduced.
Drawings
FIG. 1 is a schematic diagram illustrating steps of a method for processing a resource selection window according to an embodiment of the present invention;
FIG. 2 is a schematic diagram illustrating an example one of a method for processing a resource selection window according to an embodiment of the present invention;
FIG. 3 is a schematic diagram of a processing device for a resource selection window according to an embodiment of the present invention;
fig. 4 shows a schematic structural diagram of a terminal according to an embodiment of the present invention.
Detailed Description
In order to make the technical problems, technical solutions and advantages to be solved more apparent, the following detailed description will be given with reference to the accompanying drawings and specific embodiments.
In the embodiment of the invention, the term "and/or" describes the association relation of the association objects, which means that three relations can exist, for example, a and/or B can be expressed as follows: a exists alone, A and B exist together, and B exists alone. The character "/" generally indicates that the context-dependent object is an "or" relationship.
The term "plurality" in the embodiments of the present application means two or more, and other adjectives are similar thereto.
The following description of the technical solutions in the embodiments of the present application will be made clearly and completely with reference to the accompanying drawings in the embodiments of the present application, and it is apparent that the described embodiments are only some embodiments of the present application, but not all embodiments. All other embodiments, which can be made by one of ordinary skill in the art without undue burden from the present disclosure, are within the scope of the present disclosure.
The technical scheme provided by the embodiment of the application can be suitable for various systems, in particular to a 5G system. For example, suitable systems may be global system for mobile communications (global system of mobile communication, GSM), code division multiple access (code division multiple access, CDMA), wideband code division multiple access (Wideband Code Division Multiple Access, WCDMA) universal packet Radio service (general packet Radio service, GPRS), long term evolution (long term evolution, LTE), LTE frequency division duplex (frequency division duplex, FDD), LTE time division duplex (time division duplex, TDD), long term evolution-advanced (long term evolution advanced, LTE-a), universal mobile system (universal mobile telecommunication system, UMTS), worldwide interoperability for microwave access (worldwide interoperability for microwave access, wiMAX), 5G New air interface (New Radio, NR), and the like. Terminal devices and network devices are included in these various systems. Core network parts such as evolved packet system (Evloved Packet System, EPS), 5G system (5 GS) etc. may also be included in the system.
The terminal according to the embodiments of the present application may be a device that provides voice and/or data connectivity to a user, a handheld device with a wireless connection function, or other processing device connected to a wireless modem, etc. The names of the terminal devices may also be different in different systems, for example in a 5G system, the terminal devices may be referred to as User Equipment (UE). The wireless terminal device may communicate with one or more Core Networks (CNs) via a radio access Network (Radio Access Network, RAN), which may be mobile terminal devices such as mobile phones (or "cellular" phones) and computers with mobile terminal devices, e.g., portable, pocket, hand-held, computer-built-in or vehicle-mounted mobile devices that exchange voice and/or data with the radio access Network. Such as personal communication services (Personal Communication Service, PCS) phones, cordless phones, session initiation protocol (Session Initiated Protocol, SIP) phones, wireless local loop (Wireless Local Loop, WLL) stations, personal digital assistants (Personal Digital Assistant, PDAs), and the like. The wireless terminal device may also be referred to as a system, subscriber unit (subscriber unit), subscriber station (subscriber station), mobile station (mobile), remote station (remote station), access point (access point), remote terminal device (remote terminal), access terminal device (access terminal), user terminal device (user terminal), user agent (user agent), user equipment (user device), and the embodiments of the present application are not limited.
As shown in fig. 1, an embodiment of the present invention provides a method for processing a resource selection window, which is executed by a terminal, where the method includes:
Wherein, the measurement of CBR (Channel Busy Ratio, channel busy rate) mainly measures the channel occupation ratio in one resource pool within a period of history time window, and is used as a characterization parameter of the current resource pool congestion degree.
The evaluation of CR (Channel Occupation Ratio, channel occupancy) is that the terminal itself evaluates the proportion of the resource occupancy of the terminal transmission or the expected transmission in a time window including the past and future, and calculates the granularity of sub-channels.
The maximum retransmission times of the HARQ (Hybrid Automatic Repeat Request ) are determined according to feedback ACK/NACK (correct/incorrect) information, whether data retransmission is needed, and the maximum retransmission times can range from 1 to 32, and are specifically configured by a higher layer.
Let n be the current time, T1 be the start boundary parameter of the resource selection window, and T2 be the end boundary parameter (i.e. the first parameter) of the resource selection window, assuming that the resource selection window is [ n+t1, n+t2 ]. Step 101 of the embodiment of the present invention is used to determine an upper limit value T2max of T2 and/or a lower limit value T2min of T2, i.e. T2min is less than or equal to T2max.
As an optional embodiment, the terminal determines the upper limit value T2max of the first parameter according to at least one of the service priority, CBR, CR, and HARQ maximum retransmission number of the service to be transmitted.
As another alternative embodiment, the terminal determines the lower limit T2min of the first parameter according to the traffic priority of the traffic to be transmitted and at least one of CBR, CR and HARQ maximum number of retransmissions.
The embodiment of the present invention provides at least three ways of determining the upper limit value T2max of the first parameter, and each way is described in detail below.
Mode one, step 101, includes:
determining a first index value according to the number of the condition parameters, the number of the grades of the condition parameters and the grade value of each condition parameter;
and determining an upper limit value corresponding to the first index value as an upper limit value of the first parameter according to the first index value.
In the embodiment of the invention, the number of the condition parameters is greater than or equal to 1 and less than or equal to 4. The terminal also divides the size of the upper limit of the resource selection window into c grades from small to large according to the size of the upper limit of the resource selection window under each condition parameter, namely, each condition parameter takes a value in the sequence 1,2, … … and c (c is a positive integer).
Optionally, the embodiment of the present invention further presets a value list of T2max, where the list includes a plurality of index values and values of T2max corresponding to the index values respectively.
Specifically, determining the first index value according to the number of the condition parameters, the number of the grades of the condition parameters and the grade value of each condition parameter includes:
determining the first index value s according to a first formula; wherein, the first formula is:
wherein s is a first index value; m is the sum of the grade values of all the condition parameters; n1 is the number of conditional parameters; c is the number of levels of the condition parameter.
Example one
Set the value list of T2max as table 1:
TABLE 1
According to the size of the resource selection window under each condition parameter, the resource selection window is divided into 4 grades from small to large, namely, each condition parameter takes a value in {1,2,3,4 }; the size of T2max is determined by three condition parameters of priority, CBR, CR, set to A, B, C.
And comparing the value list of the T2max, and determining that the value of the upper limit value T2max of the first parameter is 150 if the value corresponding to the index value of 7 is 150.
Example two
Set the value list of T2max as table 2:
TABLE 2
According to the size of the resource selection window under each condition parameter, the resource selection window is divided into 3 grades from small to large, namely, each condition parameter takes a value in {1,2,3 }; the size of T2max is determined by 4 condition parameters including priority and CBR, CR, HARQ maximum retransmission times, and is set to A, B, C, D.
Assuming a=2, b=2, c=1, d=3, then m=a+b+c+d=8, n1=4, c=3; thenAnd comparing the value list of the T2max, and determining that the value of the upper limit value T2max of the first parameter is 100 if the value corresponding to the index value of 6 is 100.
Example three
Set the value list of T2max as table 3:
TABLE 3 Table 3
According to the size of the resource selection window under each condition parameter, the resource selection window is divided into 5 grades from small to large, namely, each condition parameter takes a value in {1,2,3,4,5 }; the size of T2max is determined by 2 parameters of priority and CBR, and set to A, B.
Let a=4, b=1; then m=a+b=5, n1=2, c=5, then And comparing the value list of the T2max, and determining that the value of the upper limit value T2max of the first parameter is 300 if the value corresponding to the index value of 12 is 300.
Example four
Set the value list of T2max as table 4:
|
1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 |
T2max takes on value | 10 | 15 | 50 | 100 | 175 | 200 | 250 | 275 |
TABLE 4 Table 4
According to the size of the resource selection window under each condition parameter, the resource selection window is divided into 2 grades of 1 and 2 from small to large, namely each condition parameter takes a value in {1,2 }; the size of T2max is determined by the 1 parameters CBR, set to a.
Assuming a=2, then m=a=2, n1=1, c=2; thenAnd comparing the value list of the T2max, and determining that the value of the upper limit value T2max of the first parameter is 100 if the value corresponding to the index value of 4 is 100.
Mode two, step 101, includes:
acquiring n2 condition parameters reaching the window upper limit reduction threshold; n2 is an integer greater than or equal to 1; the above reaching of the window upper limit reduction threshold can be understood as: the value of the condition parameter is larger than or equal to the window upper limit reduction threshold, or the value of the condition parameter is smaller than or equal to the window upper limit reduction threshold, and can be specifically determined according to the condition parameter;
and determining the upper limit value of the first parameter according to the average reduced scale value of the n2 condition parameters, the shortest time required by the initial retransmission resource of one transmission block and the packet delay budget of the service to be transmitted.
In this method, the upper limit value T2max of the first parameter is determined based on one or more conditions of the priority and the maximum retransmission number of CBR, CR, HARQ on the basis of the packet delay budget (Packet Delay Budget, PDB) of the determined traffic. It should be noted that this mode is generally triggered when the value of PDB of the traffic to be transmitted is greater than a specific threshold w, and there is a condition parameter that reaches the window upper limit reduction threshold.
Specifically, determining the upper limit value of the first parameter according to the average reduced scale value of the n2 condition parameters, the shortest time required by the initial retransmission resource of one transport block, and the packet delay budget of the service to be transmitted, includes:
determining an upper limit value T2max of the first parameter according to a second formula; wherein the second formula is:
wherein T2max is the upper limit value of the first parameter; q is the minimum time required for the initial retransmission resource of one transport block; PDB is packet delay budget of service to be transmitted; r is the average reduction ratio value of n2 condition parameters.
If n2 is greater than or equal to 2, the method further comprises:
determining a reduction ratio value of each of the n2 condition parameters;
And calculating the average value of the reduction ratio values of the condition parameters, and determining the average reduction ratio value of the n2 condition parameters.
Wherein the method comprises the following steps:
determining a reduced scale value r' of a condition parameter according to a third formula; wherein the third formula is:
wherein r' is a reduced scale value of a conditional parameter; x1 is the value of the condition parameter; y1 is a window upper limit reduction threshold corresponding to the condition parameter; e is a predetermined coefficient.
Optionally, the method further comprises:
according to a sixth formula, determining a shortest time q required by the initial retransmission resource of one transport block; wherein, the sixth formula is:
q=(Nmax-1)*HARQ RTT+T1+Ts;
wherein q is the shortest time required for the initial retransmission resource of one transport block; nmax is the sum of the initial retransmission times of one transport block; the HARQ RTT is the round trip time of the hybrid automatic repeat request; t1 is a boundary parameter corresponding to the initial boundary of the resource selection window; ts is the sum of the time domain lengths of reserved resources
Example five
The value of the window reduction upper limit is determined by 4 condition parameters of priority and CBR, CR, HARQ maximum retransmission times and is set to A, B, C, D; assume that the x1 values and y1 values of the 4 condition parameters are shown in table 5.
Conditions (conditions) | A | B | | D |
x1 | ||||
2 | 1 | 600 | 7 | |
|
4 | 3 | 500 | 8 |
TABLE 5
Where B, C, D reaches a threshold y1 that meets the upper limit of the shrink window. Assuming that w=300, the PDB of the actual traffic is 450, and window upper limit reduction can be performed. Let r (B) =0.2, r (C) =0.1, and r (D) =0.15 after multiplying the coefficient. R= (r (B) +r (C) +r (D))/3= (0.2+0.1+0.15)/3=0.15.
Let q=50; then:
example six
The value of the window reduction upper limit is determined by the 3 condition parameters of priority, CR and HARQ maximum retransmission times, and is set as A, B, C, and the values of x1 and y1 of 3 conditions are assumed to be as shown in Table 6:
conditions (conditions) | A | B | C |
x1 | 5 | 400 | 7 |
|
4 | 500 | 8 |
TABLE 6
Where A, C reaches a threshold y1 that meets the upper limit of the shrink window. Assuming that w=300, the PDB of the actual traffic is 500, and window upper limit reduction can be performed.
Assuming that r (a) =0.5 and r (C) =0.4, r= (r (a) +r (C))/2= (0.5+0.4)/2=0.45 can be obtained.
Assuming q=100, then:
example seven
The value of the window reduction upper limit is determined by the priority and the maximum retransmission number of the HARQ 2 condition parameters, and is set as A, B, and the values of x1 and y1 of 2 conditions are assumed to be as shown in table 7:
conditions (conditions) | A | |
x1 | ||
2 | 7 | |
|
4 | 8 |
TABLE 7
Wherein A, B reaches a threshold y1 that meets the upper limit of the shrink window; assuming that w=200, the PDB of the actual traffic is 300, and window upper limit reduction can be performed.
Assuming that r (a) =0.4, r (B) =0.2, r= (r (a) +r (B))/2= (0.4+0.2)/2=0.3 is obtained.
Assuming q=50, then:
example eight
The upper limit of window reduction is determined by the 1 parameters CR, and is set as A, and the values of x1 and y1 of the assumed conditions are as shown in Table 8:
conditions (conditions) | A |
x1 | 200 |
|
400 |
TABLE 8
Wherein A reaches a threshold y1 that meets the upper limit of the shrink window; assuming that w=200, the PDB of the actual traffic is 300, and window upper limit reduction can be performed.
Let r=r (a) =0.5 after multiplying the coefficient.
Assuming q=60, then:
mode three, step 101, includes:
determining a first type of condition parameter and a second type of condition parameter in the at least one condition parameter, wherein the increase of the value of the first type of condition parameter increases the upper limit value of the first parameter, and the increase of the value of the second type of condition parameter decreases the upper limit value of the first parameter; for example, the service priority and the maximum number of HARQ retransmissions are the first type of condition parameters; CBR and CR are second class condition parameters;
if the value of the first type of condition parameter reaches the threshold value corresponding to the first type of condition parameter and the value of the second type of condition parameter reaches the threshold value corresponding to the second type of condition parameter, determining n3 combinations of the first type of condition parameter and the second type of condition parameter which reach the threshold value; n3 is an integer greater than or equal to 1; for example, on the basis of the determined PDB, the value of the first type of condition parameter reaches the threshold value corresponding to the first type of condition parameter, and the value of the second type of condition parameter is greater than the threshold value corresponding to the second type of condition parameter, which may be called that the value of the second type of condition parameter contradicts the value of the first type of condition parameter;
Determining the upper limit value of the first parameter corresponding to each second type condition parameter according to the reduced scale value of each second type condition parameter in the n3 second type condition parameters, the shortest time required by the initial retransmission resource of one transmission block and the packet delay budget of the service to be transmitted;
and calculating the average value of the upper limit values of the first parameters corresponding to the second class condition parameters respectively, and determining the upper limit value of the first parameters.
Wherein determining the upper limit value of the first parameter corresponding to each second type condition parameter according to the reduced scale value of each second type condition parameter in the n3 second type condition parameters, the shortest time required by the initial retransmission resource of a transmission block and the packet delay budget of the service to be transmitted, comprises:
according to a fourth formula, determining an upper limit value T2max' of the first parameter corresponding to the second type of condition parameter; wherein the fourth formula is:
wherein T2max' is the upper limit value of the first parameter corresponding to the second type of condition parameter; q is the minimum time required for the initial retransmission resource of one transport block; PDB is packet delay budget of service to be transmitted; b is a scaled down value of a second type of conditional parameter. Then T2max is equal to the average of n 3T 2 max'.
Wherein the method further comprises:
according to a fifth formula, determining a reduction ratio value b of one second type of condition parameters in the n3 second type of condition parameters; wherein the fifth formula is:
b=|y2-x2|*d;
wherein b is a reduced scale value of a second type of condition parameter; x2 is the value of the second type condition parameter; y2 is a threshold value corresponding to the second type of condition parameter; d is the coefficient corresponding to the second class condition parameter. d varies depending on the condition parameters.
Wherein the method further comprises:
according to a sixth formula, determining a shortest time q required by the initial retransmission resource of one transport block; wherein, the sixth formula is:
q=(Nmax-1)*HARQ RTT+T1+Ts;
wherein q is the shortest time required for the initial retransmission resource of one transport block; nmax is the sum of the initial retransmission times of one transport block; the HARQ RTT is the round trip time of the hybrid automatic repeat request; t1 is a boundary parameter corresponding to the initial boundary of the resource selection window; ts is the sum of the time domain lengths of the reserved resources.
For example, there may be contradictory terms as shown in table 9 under the original conditions of the terminal configuration:
index value | First class condition parameters | Second class of |
1 | Priority value is greater than threshold v | CBR has a value smaller than the |
2 | Priority value is greater than threshold v | CR is greater than the threshold x |
3 | The maximum number of HARQ retransmissions is less than the threshold y | CBR has a value smaller than the |
4 | The maximum number of HARQ retransmissions is less than the threshold y | CR is greater than the threshold x |
5 | PDB value is larger than threshold value z | CBR has a value smaller than the threshold value w |
6 | PDB value is larger than threshold value z | CR is greater than the threshold x |
TABLE 9
Example nine
The configuration of the terminal is shown in table 10:
condition parameters | Priority level | CBR | CR | HARQ maximum retransmission times | PDB |
|
4 | 2 | 600 | 6 | 400 |
|
4 | 3 | 500 | 8 | 300 |
Table 10
According to the condition values of the terminal configuration, contradiction items with index values of 3, 4, 5 and 6 can be obtained according to table 9. The absolute value of the difference between the actual value of the second type of condition parameter and the threshold value thereof is a_3=1, a_5=1, a_4=100 and a_6=100;
multiplying a by a coefficient to obtain b_3=0.5, b_5=0.5, b_4=0.3 and b_6=0.3;
assuming q is 50, the value of the traffic PDB is 400;
T2max_3=225,T2max_5=225,T2max_4=313,T2max_6=313。
t2max takes the average of the t2max_n corresponding to the 4 contradictory terms, t2max=269.
Example ten
The configuration of the terminal is shown in table 11:
condition parameters | Priority level | CBR | CR | HARQ maximum retransmission times | PDB |
Actual value | 5 | 2 | 600 | 9 | 300 |
|
4 | 3 | 500 | 8 | 300 |
TABLE 11
According to the condition values configured by the terminal, contradiction items with index values of 1 and 2 can be obtained according to the table 9; the absolute value of the difference between the actual value of the second type of condition parameter and the threshold value is a_1=1, a_2=100;
Multiplying a by a coefficient to obtain b_1=0.5 and b_2=0.4;
assuming q is 40, the value of the traffic PDB is 300
Then, t2max_3=170, t2max_2=196, t2max takes the average of t2max_n corresponding to the 2 contradictory terms, t2max=183.
Example eleven
The configuration of the terminal is shown in table 12:
condition parameters | Priority level | CBR | CR | HARQ maximum retransmission times | PDB |
Actual value | 5 | 2 | 600 | 6 | 400 |
|
4 | 3 | 500 | 8 | 300 |
Table 12
According to the condition values configured by the terminal, contradiction items with index values of 1, 2, 3, 4, 5 and 6 can be obtained according to the table 9; the absolute value of the difference between the actual value of the second type of condition parameter and the threshold value thereof is a_1=1, a_3=1, a_5=1, a_2=100, a_4=100, a_6=100;
multiplying a by a coefficient to obtain b_1=0.3, b_3=0.4, b_5=0.5, b_2=0.3, b_4=0.3 and b_6=0.2; assuming q is 100, the value of the traffic PDB is 400.
T2max_1=310, t2max_3=280, t2max_5=250, t2max_2=310, t2max_4=310, t2max_6=340. T2max takes the average of the corresponding t2max_n of the 6 contradictory terms, t2max=300.
Example twelve
The configuration of the terminal is shown in table 13:
condition parameters | Priority level | CBR | CR | HARQ maximum retransmission times | PDB |
Actual value | 5 | 2 | 500 | 6 | 400 |
|
4 | 3 | 500 | 8 | 300 |
TABLE 13
According to the condition values configured by the terminal, contradiction items with index values of 1, 3 and 5 can be obtained according to the table 9; the absolute value of the difference between the actual value of the second type of condition parameter and the threshold value is a_1=1, a_3=1 and a_5=1;
Multiplying a by a coefficient to obtain b_1=0.3, b_3=0.4 and b_5=0.5;
assuming q is 100, the value of the traffic PDB is 400.
T2max_1=310, t2max_3=280, t2max_5=250; t2max takes the average of the corresponding t2max_n of the 3 contradictory terms, t2max=280.
The embodiment of the present invention further provides a method for determining the lower limit value T2min of the first parameter, that is, step 101 includes:
determining a first index of a candidate lower limit value of the first parameter according to the service priority;
if the value of the existing condition parameter reaches a first threshold value and the difference between the value and the first threshold value is larger than or equal to a second threshold value, subtracting 1 from the first index to obtain a second index;
if the candidate lower limit value of the first parameter corresponding to the second index is larger than or equal to the shortest time required by the initial retransmission resource of one transmission block, determining that the lower limit value of the first parameter is the candidate lower limit value of the first parameter corresponding to the second index; otherwise, adding 1 to the second index to obtain a first index, and determining the lower limit value of the first parameter as a candidate lower limit value of the first parameter corresponding to the first index.
Wherein the method further comprises:
according to a sixth formula, determining a shortest time q required by the initial retransmission resource of one transport block; wherein, the sixth formula is:
q=(Nmax-1)*HARQ RTT+T1+Ts;
Wherein q is the shortest time required for the initial retransmission resource of one transport block; nmax is the sum of the initial retransmission times of one transport block; the HARQ RTT is the round trip time of the hybrid automatic repeat request; t1 is a boundary parameter corresponding to the initial boundary of the resource selection window; ts is the sum of the time domain lengths of the reserved resources.
For example, the candidate lower limit value of the first parameter includes: {1*2 μ ,5*2 μ ,10*2 μ ,20*2 μ -a }; wherein, the corresponding mu values are respectively 0,1,2 and 3 when the subcarriers are 15,30,60 and 120 KHz. The index values of the candidate lower limit values are {0,1,2,3} in order.
Example thirteen
Obtaining a value t=20 of T2min by the existing mechanism, wherein a first index i=3;
the configuration of the maximum retransmission number of the condition parameter CBR, CR, HARQ is shown in table 14 (corresponding to a, B, C, respectively):
condition parameters | A | B | C |
w (actual value) | 2 | 900 | 3 |
x (first threshold) | 4 | 600 | 7 |
y (second threshold) | 2 | 500 | 4 |
TABLE 14
Conditions a and B reach the threshold x, but only condition a exceeds the threshold y, the second index value=3-1=2, yielding a corresponding candidate value of 10×2 μ Let q=30, and assuming that the current subcarrier spacing is 60KHz, t2min=40, 40 can be obtained>q, the index value is unchanged, i.e. the second index value=2, resulting in a final candidate value of 10×2 μ The method comprises the steps of carrying out a first treatment on the surface of the The final value of T2min is 10×4=40.
Example fourteen
Obtaining a value t=10 of T2min by the existing mechanism, wherein a first index i=2;
The configuration of the maximum retransmission number of the condition parameter CBR, CR, HARQ is shown in table 15 (corresponding to a, B, C, respectively):
condition parameters | A | B | C |
w (actual value) | 2 | 900 | 3 |
x (first threshold) | 4 | 600 | 7 |
y (second threshold) | 2 | 300 | 4 |
TABLE 15
Obtaining condition parameters A and B reaching a threshold value x and exceeding the threshold value y, and obtaining a corresponding candidate value 5*2 by a second index value of=2-1=1 μ The method comprises the steps of carrying out a first treatment on the surface of the Let q=30, let t2min=20, 20 be available assuming the current subcarrier spacing is 60KHz<q, the second index value is added with 1, i.e. the final index value i=1+1=2, to obtain the final candidate value 10×2 μ The method comprises the steps of carrying out a first treatment on the surface of the The final value of T2min is 10×4=40.
Example fifteen
Obtaining a value t=20 of T2min by the existing mechanism, wherein a first index i=3;
the configuration of the maximum retransmission number of the condition parameter CBR, CR, HARQ is shown in table 16 (corresponding to a, B, C, respectively):
condition parameters | A | B | C |
w (actual value) | 2 | 900 | 12 |
x (first threshold) | 4 | 600 | 7 |
y (second threshold) | 2 | 300 | 4 |
Table 16
Obtaining conditions A and B to reach a threshold value x, and exceeding the threshold value y, and obtaining corresponding candidate values 10 x 2 with index values i=3-1=2 μ The method comprises the steps of carrying out a first treatment on the surface of the Let q=30, assuming the current subcarrier spacing is 60KHz, t2min=40, 40 can be obtained>q, indexThe value is unchanged, i.e. i=2, resulting in the final candidate value 10×2 μ The method comprises the steps of carrying out a first treatment on the surface of the The final value of T2min is 10×4=40.
In summary, when determining the value range of the termination boundary of the resource selection window, the embodiment of the invention determines the upper limit value and/or the lower limit value of the first parameter of the termination boundary of the resource selection window according to at least one of the service priority, the channel busy rate CBR, the channel occupancy rate CR and the maximum retransmission times of the hybrid automatic repeat request HARQ of the service to be transmitted, so that the size of the resource selection window is more reasonable, and unnecessary time delay is reduced when the priority is high and the time delay requirement is low.
As shown in fig. 3, an embodiment of the present invention further provides a processing apparatus for a resource selection window, including:
a determining unit 301 configured to determine at least one of an upper limit value of a first parameter and a lower limit value of the first parameter according to at least one condition parameter; the first parameter is a boundary parameter corresponding to a termination boundary of the resource selection window;
wherein the condition parameters include: traffic priority of traffic to be transmitted, channel busy rate CBR, channel occupancy CR or hybrid automatic repeat request HARQ maximum number of retransmissions.
As an alternative embodiment, the determining unit comprises:
a first subunit, configured to determine a first index value according to the number of condition parameters, the number of levels of the condition parameters, and the level values of the condition parameters;
and the second subunit is used for determining the upper limit value corresponding to the first index value as the upper limit value of the first parameter according to the first index value.
As an alternative embodiment, the first subunit is further configured to:
determining the first index value s according to a first formula; wherein, the first formula is:
wherein s is a first index value; m is the sum of the grade values of all the condition parameters; n1 is the number of conditional parameters; c is the number of levels of the condition parameter.
As an alternative embodiment, the determining unit comprises:
a third subunit, configured to obtain n2 condition parameters that reach a window upper limit reduction threshold; n2 is an integer greater than or equal to 1;
and a fourth subunit, configured to determine an upper limit value of the first parameter according to the average reduced scale value of the n2 condition parameters, a shortest time required by an initial retransmission resource of one transport block, and a packet delay budget of a service to be transmitted.
As an alternative embodiment, the fourth subunit is further configured to:
determining an upper limit value T2max of the first parameter according to a second formula; wherein the second formula is:
wherein T2max is the upper limit value of the first parameter; q is the minimum time required for the initial retransmission resource of one transport block; PDB is packet delay budget of service to be transmitted; r is the average reduction ratio value of n2 condition parameters.
As an alternative embodiment, the apparatus further comprises:
a first ratio determining unit, configured to determine a reduction ratio value of each of the n2 condition parameters;
and the second proportion determining unit is used for calculating the average value of the reduction proportion values of the condition parameters and determining the average reduction proportion value of the n2 condition parameters.
As an alternative embodiment, the apparatus comprises:
a third proportion determining unit for determining a reduced proportion value r' of a condition parameter according to a third formula; wherein the third formula is:
wherein r' is a reduced scale value of a conditional parameter; x1 is the value of the condition parameter; y1 is a window upper limit reduction threshold corresponding to the condition parameter; e is a predetermined coefficient.
As an alternative embodiment, the determining unit comprises:
a fifth subunit, configured to determine a first type of condition parameter and a second type of condition parameter in the at least one condition parameter, where an increase in the value of the first type of condition parameter increases an upper limit value of the first parameter, and an increase in the value of the second type of condition parameter decreases the upper limit value of the first parameter;
a sixth subunit, configured to determine, if the value of the first type of condition parameter reaches a threshold value corresponding to the first type of condition parameter and the value of the second type of condition parameter reaches a threshold value corresponding to the second type of condition parameter, n3 combinations of the first type of condition parameter and the second type of condition parameter that reach the threshold value; n3 is an integer greater than or equal to 1;
a seventh subunit, configured to determine an upper limit value of the first parameter corresponding to each second type condition parameter according to the reduced scale value of each second type condition parameter in the n3 second type condition parameters, a shortest time required by an initial retransmission resource of a transport block, and a packet delay budget of a service to be transmitted;
And the eighth subunit is used for calculating the average value of the upper limit values of the first parameters corresponding to the second type condition parameters respectively and determining the upper limit value of the first parameters.
As an alternative embodiment, the seventh subunit is further configured to:
according to a fourth formula, determining an upper limit value T2max' of the first parameter corresponding to the second type of condition parameter; wherein the fourth formula is:
wherein T2max' is the upper limit value of the first parameter corresponding to the second type of condition parameter; q is the minimum time required for the initial retransmission resource of one transport block; PDB is packet delay budget of service to be transmitted; b is a scaled down value of a second type of conditional parameter.
As an alternative embodiment, the apparatus further comprises:
a fifth proportion determining unit, configured to determine a reduced proportion value b of one second type condition parameter of the n3 second type condition parameters according to a fifth formula; wherein the fifth formula is:
b=|y2-x2|*d;
wherein b is a reduced scale value of a second type of condition parameter; x2 is the value of the second type condition parameter; y2 is a threshold value corresponding to the second type of condition parameter; d is the coefficient corresponding to the second class condition parameter.
As an alternative embodiment, the determining unit comprises:
A ninth subunit, configured to determine, according to the service priority, a first index of a candidate lower limit value of the first parameter;
a tenth subunit, configured to subtract 1 from the first index to obtain a second index if the value of the existing condition parameter reaches a first threshold and the difference between the first value and the first threshold is greater than or equal to a second threshold;
an eleventh subunit, configured to determine, if a candidate lower limit value of the first parameter corresponding to the second index is greater than or equal to a shortest time required for an initial retransmission resource of one transport block, the lower limit value of the first parameter is a candidate lower limit value of the first parameter corresponding to the second index; otherwise, adding 1 to the second index to obtain a first index, and determining the lower limit value of the first parameter as a candidate lower limit value of the first parameter corresponding to the first index.
As an alternative embodiment, the apparatus further comprises:
a time determining unit, configured to determine, according to a sixth formula, a shortest time q required for an initial retransmission resource of one transport block; wherein, the sixth formula is:
q=(Nmax-1)*HARQ RTT+T1+Ts;
wherein q is the shortest time required for the initial retransmission resource of one transport block; nmax is the sum of the initial retransmission times of one transport block; the HARQ RTT is the round trip time of the hybrid automatic repeat request; t1 is a boundary parameter corresponding to the initial boundary of the resource selection window; ts is the sum of the time domain lengths of the reserved resources.
When determining the value range of the termination boundary of the resource selection window, the embodiment of the invention determines the upper limit value and/or the lower limit value of the first parameter of the termination boundary of the resource selection window according to at least one of the service priority, the channel busy rate CBR, the channel occupancy rate CR and the maximum retransmission times of the hybrid automatic repeat request HARQ of the service to be transmitted, so that the size of the resource selection window is more reasonable, and unnecessary time delay is reduced when the priority is high and the time delay requirement is low.
The method and the device are based on the same application, and because the principles of solving the problems by the method and the device are similar, the implementation of the device and the method can be referred to each other, and the repetition is not repeated.
It should be noted that, in the embodiment of the present application, the division of the units is schematic, which is merely a logic function division, and other division manners may be implemented in actual practice. In addition, each functional unit in each embodiment of the present application may be integrated in one processing unit, or each unit may exist alone physically, or two or more units may be integrated in one unit. The integrated units may be implemented in hardware or in software functional units.
The integrated units, if implemented in the form of software functional units and sold or used as stand-alone products, may be stored in a processor-readable storage medium. Based on such understanding, the technical solution of the present application may be embodied in essence or a part contributing to the prior art or all or part of the technical solution, in the form of a software product stored in a storage medium, including several instructions to cause a computer device (which may be a personal computer, a server, or a network device, etc.) or a processor (processor) to perform all or part of the steps of the methods described in the embodiments of the present application. And the aforementioned storage medium includes: a U-disk, a removable hard disk, a Read-Only Memory (ROM), a random access Memory (Random Access Memory, RAM), a magnetic disk, or an optical disk, or other various media capable of storing program codes.
As shown in fig. 4, an embodiment of the present invention further provides a terminal, which includes a memory 420, a transceiver 410, and a processor 400:
a memory 420 for storing a computer program; a transceiver 410 for transceiving data under the control of the processor; a processor 400 for reading the computer program in the memory and performing the following operations:
Determining at least one of an upper limit value of a first parameter and a lower limit value of the first parameter according to at least one condition parameter; the first parameter is a boundary parameter corresponding to a termination boundary of the resource selection window;
wherein the condition parameters include: traffic priority of traffic to be transmitted, channel busy rate CBR, channel occupancy CR or hybrid automatic repeat request HARQ maximum number of retransmissions.
Wherein in fig. 4, a bus architecture may comprise any number of interconnected buses and bridges, and in particular one or more processors represented by processor 400 and various circuits of memory represented by memory 420, linked together. The bus architecture may also link together various other circuits such as peripheral devices, voltage regulators, power management circuits, etc., which are well known in the art and, therefore, will not be described further herein. The bus interface provides an interface. The transceiver 410 may be a number of elements, i.e., including a transmitter and a receiver, providing a means for communicating with various other apparatus over transmission media, including wireless channels, wired channels, optical cables, and the like. The user interface 430 may also be an interface capable of interfacing with an inscribed desired device for a different user device, including but not limited to a keypad, display, speaker, microphone, joystick, etc.
The processor 400 is responsible for managing the bus architecture and general processing, and the memory 420 may store data used by the processor 400 in performing operations.
Alternatively, the processor 400 may be a CPU (Central processing Unit), ASIC (Application Specific Integrated Circuit ), FPGA (Field-Programmable Gate Array, field programmable Gate array) or CPLD (Complex Programmable Logic Device ), and the processor may also employ a multicore architecture.
The processor 400 is operable to perform any of the methods provided by the embodiments of the present application in accordance with the obtained executable instructions by invoking a computer program stored in a memory. The processor 400 and the memory 420 may also be physically separate.
As an alternative embodiment, the processor 400 is further configured to read the computer program in the memory and perform the following operations:
determining a first index value according to the number of the condition parameters, the number of the grades of the condition parameters and the grade value of each condition parameter;
and determining an upper limit value corresponding to the first index value as an upper limit value of the first parameter according to the first index value.
As an alternative embodiment, the processor 400 is further configured to read the computer program in the memory and perform the following operations:
Determining the first index value s according to a first formula; wherein, the first formula is:
wherein s is a first index value; m is the sum of the grade values of all the condition parameters; n1 is the number of conditional parameters; c is the number of levels of the condition parameter.
As an alternative embodiment, the processor 400 is further configured to read the computer program in the memory and perform the following operations:
acquiring n2 condition parameters reaching the window upper limit reduction threshold; n2 is an integer greater than or equal to 1;
and determining the upper limit value of the first parameter according to the average reduced scale value of the n2 condition parameters, the shortest time required by the initial retransmission resource of one transmission block and the packet delay budget of the service to be transmitted.
As an alternative embodiment, the processor 400 is further configured to read the computer program in the memory and perform the following operations:
determining an upper limit value T2max of the first parameter according to a second formula; wherein the second formula is:
wherein T2max is the upper limit value of the first parameter; q is the minimum time required for the initial retransmission resource of one transport block; PDB is packet delay budget of service to be transmitted; r is the average reduction ratio value of n2 condition parameters.
As an alternative embodiment, the processor 400 is further configured to read the computer program in the memory and perform the following operations:
determining a reduction ratio value of each of the n2 condition parameters;
and calculating the average value of the reduction ratio values of the condition parameters, and determining the average reduction ratio value of the n2 condition parameters.
As an alternative embodiment, the processor 400 is further configured to read the computer program in the memory and perform the following operations:
determining a reduced scale value r' of a condition parameter according to a third formula; wherein the third formula is:
wherein r' is a reduced scale value of a conditional parameter; x1 is the value of the condition parameter; y1 is a window upper limit reduction threshold corresponding to the condition parameter; e is a predetermined coefficient.
As an alternative embodiment, the processor 400 is further configured to read the computer program in the memory and perform the following operations:
determining a first type of condition parameter and a second type of condition parameter in the at least one condition parameter, wherein the increase of the value of the first type of condition parameter increases the upper limit value of the first parameter, and the increase of the value of the second type of condition parameter decreases the upper limit value of the first parameter;
If the value of the first type of condition parameter reaches the threshold value corresponding to the first type of condition parameter and the value of the second type of condition parameter reaches the threshold value corresponding to the second type of condition parameter, determining n3 combinations of the first type of condition parameter and the second type of condition parameter which reach the threshold value; n3 is an integer greater than or equal to 1;
determining the upper limit value of the first parameter corresponding to each second type condition parameter according to the reduced scale value of each second type condition parameter in the n3 second type condition parameters, the shortest time required by the initial retransmission resource of one transmission block and the packet delay budget of the service to be transmitted;
and calculating the average value of the upper limit values of the first parameters corresponding to the second class condition parameters respectively, and determining the upper limit value of the first parameters.
As an alternative embodiment, the processor 400 is further configured to read the computer program in the memory and perform the following operations:
according to a fourth formula, determining an upper limit value T2max' of the first parameter corresponding to the second type of condition parameter; wherein the fourth formula is:
wherein T2max' is the upper limit value of the first parameter corresponding to the second type of condition parameter; q is the minimum time required for the initial retransmission resource of one transport block; PDB is packet delay budget of service to be transmitted; b is a scaled down value of a second type of conditional parameter.
As an alternative embodiment, the processor 400 is further configured to read the computer program in the memory and perform the following operations:
according to a fifth formula, determining a reduction ratio value b of one second type of condition parameters in the n3 second type of condition parameters; wherein the fifth formula is:
b=|y2-x2|*d;
wherein b is a reduced scale value of a second type of condition parameter; x2 is the value of the second type condition parameter; y2 is a threshold value corresponding to the second type of condition parameter; d is the coefficient corresponding to the second class condition parameter.
As an alternative embodiment, the processor 400 is further configured to read the computer program in the memory and perform the following operations:
determining a first index of a candidate lower limit value of the first parameter according to the service priority;
if the value of the existing condition parameter reaches a first threshold value and the difference between the value and the first threshold value is larger than or equal to a second threshold value, subtracting 1 from the first index to obtain a second index;
if the candidate lower limit value of the first parameter corresponding to the second index is larger than or equal to the shortest time required by the initial retransmission resource of one transmission block, determining that the lower limit value of the first parameter is the candidate lower limit value of the first parameter corresponding to the second index; otherwise, adding 1 to the second index to obtain a first index, and determining the lower limit value of the first parameter as a candidate lower limit value of the first parameter corresponding to the first index.
As an alternative embodiment, the processor 400 is further configured to read the computer program in the memory and perform the following operations:
according to a sixth formula, determining a shortest time q required by the initial retransmission resource of one transport block; wherein, the sixth formula is:
q=(Nmax-1)*HARQ RTT+T1+Ts;
wherein q is the shortest time required for the initial retransmission resource of one transport block; nmax is the sum of the initial retransmission times of one transport block; the HARQ RTT is the round trip time of the hybrid automatic repeat request; t1 is a boundary parameter corresponding to the initial boundary of the resource selection window; ts is the sum of the time domain lengths of the reserved resources.
When determining the value range of the termination boundary of the resource selection window, the embodiment of the invention determines the upper limit value and/or the lower limit value of the first parameter of the termination boundary of the resource selection window according to at least one of the service priority, the channel busy rate CBR, the channel occupancy rate CR and the maximum retransmission times of the hybrid automatic repeat request HARQ of the service to be transmitted, so that the size of the resource selection window is more reasonable, and unnecessary time delay is reduced when the priority is high and the time delay requirement is low.
Because the principle of solving the problem by the terminal provided by the embodiment of the invention is similar to that of the processing method of the resource selection window in the embodiment of the invention, the implementation of the terminal can be referred to the implementation of the method, and the repetition is not described any more.
Embodiments of the present invention also provide a processor-readable storage medium storing a computer program for causing the processor to perform the method as described above.
The processor-readable storage medium may be any available medium or data storage device that can be accessed by a processor, including, but not limited to, magnetic memories (e.g., floppy disks, hard disks, magnetic tape, magneto-optical disks (MOs), etc.), optical memories (e.g., CD, DVD, BD, HVD, etc.), semiconductor memories (e.g., ROM, EPROM, EEPROM, nonvolatile memories (NAND FLASH), solid State Disks (SSDs)), etc.
It will be appreciated by those skilled in the art that embodiments of the present application may be provided as a method, system, or computer program product. Accordingly, the present application may take the form of an entirely hardware embodiment, an entirely software embodiment, or an embodiment combining software and hardware aspects. Furthermore, the present application may take the form of a computer program product embodied on one or more computer-usable storage media (including, but not limited to, magnetic disk storage, optical storage, and the like) having computer-usable program code embodied therein.
The present application is described with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems) and computer program products according to embodiments of the application. It will be understood that each flow and/or block of the flowchart illustrations and/or block diagrams, and combinations of flows and/or blocks in the flowchart illustrations and/or block diagrams, can be implemented by computer-executable instructions. These computer-executable instructions may be provided to a processor of a general purpose computer, special purpose computer, embedded processor, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
These processor-executable instructions may also be stored in a processor-readable memory that can direct a computer or other programmable data processing apparatus to function in a particular manner, such that the instructions stored in the processor-readable memory produce an article of manufacture including instruction means which implement the function specified in the flowchart flow or flows and/or block diagram block or blocks.
These processor-executable instructions may also be loaded onto a computer or other programmable data processing apparatus to cause a series of operational steps to be performed on the computer or other programmable apparatus to produce a computer implemented process such that the instructions which execute on the computer or other programmable apparatus provide steps for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
It will be apparent to those skilled in the art that various modifications and variations can be made in the present application without departing from the spirit or scope of the application. Thus, if such modifications and variations of the present application fall within the scope of the claims and the equivalents thereof, the present application is intended to cover such modifications and variations.
Claims (12)
1. A method of processing a resource selection window, the method comprising:
determining at least one of an upper limit value of a first parameter and a lower limit value of the first parameter according to at least one condition parameter; the first parameter is a boundary parameter corresponding to a termination boundary of the resource selection window;
wherein the condition parameters include: service priority of service to be transmitted, channel busy rate CBR, channel occupancy rate CR or hybrid automatic repeat request HARQ maximum retransmission times;
Wherein determining the upper limit value of the first parameter according to the at least one condition parameter comprises:
determining a first index value according to the number of the condition parameters, the number of the grades of the condition parameters and the grade value of each condition parameter;
according to a first index value, determining an upper limit value corresponding to the first index value as an upper limit value of the first parameter;
alternatively, determining the upper limit value of the first parameter according to the at least one condition parameter includes:
acquiring n2 condition parameters reaching the window upper limit reduction threshold; n2 is an integer greater than or equal to 1;
determining an upper limit value of the first parameter according to the average reduced scale value of the n2 condition parameters, the shortest time required by the initial retransmission resource of one transmission block and the packet delay budget of the service to be transmitted;
alternatively, determining the upper limit value of the first parameter according to the at least one condition parameter includes:
determining a first type of condition parameter and a second type of condition parameter in the at least one condition parameter, wherein the increase of the value of the first type of condition parameter increases the upper limit value of the first parameter, and the increase of the value of the second type of condition parameter decreases the upper limit value of the first parameter;
If the value of the first type of condition parameter reaches the threshold value corresponding to the first type of condition parameter and the value of the second type of condition parameter reaches the threshold value corresponding to the second type of condition parameter, determining n3 combinations of the first type of condition parameter and the second type of condition parameter which reach the threshold value; n3 is an integer greater than or equal to 1;
determining the upper limit value of the first parameter corresponding to each second type condition parameter according to the reduced scale value of each second type condition parameter in the n3 second type condition parameters, the shortest time required by the initial retransmission resource of one transmission block and the packet delay budget of the service to be transmitted;
calculating the average value of the upper limit values of the first parameters corresponding to each second class of condition parameters respectively, and determining the upper limit value of the first parameters;
wherein determining the lower limit value of the first parameter according to at least one condition parameter comprises:
determining a first index of a candidate lower limit value of the first parameter according to the service priority;
if the value of the existing condition parameter reaches a first threshold value and the difference between the value and the first threshold value is larger than or equal to a second threshold value, subtracting 1 from the first index to obtain a second index;
if the candidate lower limit value of the first parameter corresponding to the second index is larger than or equal to the shortest time required by the initial retransmission resource of one transmission block, determining that the lower limit value of the first parameter is the candidate lower limit value of the first parameter corresponding to the second index; otherwise, adding 1 to the second index to obtain a first index, and determining the lower limit value of the first parameter as a candidate lower limit value of the first parameter corresponding to the first index;
Wherein determining a first index value according to the number of the condition parameters, the number of the grades of the condition parameters and the grade value of each condition parameter comprises:
determining the first index value s according to a first formula; wherein, the first formula is:
wherein s is a first index value; m is the sum of the grade values of all the condition parameters; n1 is the number of conditional parameters; c is the number of grades of the condition parameter;
wherein determining the upper limit value of the first parameter according to the average reduced scale value of the n2 condition parameters, the shortest time required by the initial retransmission resource of one transport block and the packet delay budget of the service to be transmitted comprises:
determining an upper limit value T2max of the first parameter according to a second formula; wherein the second formula is:
wherein T2max is the upper limit value of the first parameter; q is the minimum time required for the initial retransmission resource of one transport block; PDB is packet delay budget of service to be transmitted; r is the average reduction ratio value of n2 condition parameters;
wherein determining the upper limit value of the first parameter corresponding to each second type condition parameter according to the reduced scale value of each second type condition parameter in the n3 second type condition parameters, the shortest time required by the initial retransmission resource of a transmission block and the packet delay budget of the service to be transmitted, comprises:
According to a fourth formula, determining an upper limit value T2max' of the first parameter corresponding to the second type of condition parameter; wherein the fourth formula is:
wherein T2max' is the upper limit value of the first parameter corresponding to the second type of condition parameter; q is the minimum time required for the initial retransmission resource of one transport block; PDB is packet delay budget of service to be transmitted; b is a scaled down value of a second type of conditional parameter.
2. The method according to claim 1, wherein the method further comprises:
determining a reduction ratio value of each of the n2 condition parameters;
and calculating the average value of the reduction ratio values of the condition parameters, and determining the average reduction ratio value of the n2 condition parameters.
3. The method according to claim 2, characterized in that the method comprises:
determining a reduced scale value r' of a condition parameter according to a third formula; wherein the third formula is:
wherein r' is a reduced scale value of a conditional parameter; x1 is the value of the condition parameter; y1 is a window upper limit reduction threshold corresponding to the condition parameter; e is a predetermined coefficient.
4. The method according to claim 1, wherein the method further comprises:
According to a fifth formula, determining a reduction ratio value b of one second type of condition parameters in the n3 second type of condition parameters; wherein the fifth formula is:
b=|y2-x2|*d;
wherein b is a reduced scale value of a second type of condition parameter; x2 is the value of the second type condition parameter; y2 is a threshold value corresponding to the second type of condition parameter; d is the coefficient corresponding to the second class condition parameter.
5. The method according to claim 1, wherein the method further comprises:
according to a sixth formula, determining a shortest time q required by the initial retransmission resource of one transport block; wherein, the sixth formula is:
q=(Nmax-1)*HARQ RTT+T1+Ts;
wherein q is the shortest time required for the initial retransmission resource of one transport block; nmax is the sum of the initial retransmission times of one transport block; the HARQ RTT is the round trip time of the hybrid automatic repeat request; t1 is a boundary parameter corresponding to the initial boundary of the resource selection window; ts is the sum of the time domain lengths of the reserved resources.
6. A processing apparatus for a resource selection window, comprising:
a determining unit configured to determine at least one of an upper limit value of a first parameter and a lower limit value of the first parameter according to at least one condition parameter; the first parameter is a boundary parameter corresponding to a termination boundary of the resource selection window;
Wherein the condition parameters include: service priority of service to be transmitted, channel busy rate CBR, channel occupancy rate CR or hybrid automatic repeat request HARQ maximum retransmission times;
wherein the determining unit includes:
a first subunit, configured to determine a first index value according to the number of condition parameters, the number of levels of the condition parameters, and the level values of the condition parameters; the second subunit is used for determining the upper limit value corresponding to the first index value as the upper limit value of the first parameter according to the first index value;
or,
a third subunit, configured to obtain n2 condition parameters that reach a window upper limit reduction threshold; n2 is an integer greater than or equal to 1; a fourth subunit, configured to determine an upper limit value of the first parameter according to the average reduced scale value of the n2 condition parameters, a shortest time required by an initial retransmission resource of one transport block, and a packet delay budget of a service to be transmitted;
or,
a fifth subunit, configured to determine a first type of condition parameter and a second type of condition parameter in the at least one condition parameter, where an increase in the value of the first type of condition parameter increases an upper limit value of the first parameter, and an increase in the value of the second type of condition parameter decreases the upper limit value of the first parameter; a sixth subunit, configured to determine, if the value of the first type of condition parameter reaches a threshold value corresponding to the first type of condition parameter and the value of the second type of condition parameter reaches a threshold value corresponding to the second type of condition parameter, n3 combinations of the first type of condition parameter and the second type of condition parameter that reach the threshold value; n3 is an integer greater than or equal to 1; a seventh subunit, configured to determine an upper limit value of the first parameter corresponding to each second type condition parameter according to the reduced scale value of each second type condition parameter in the n3 second type condition parameters, a shortest time required by an initial retransmission resource of a transport block, and a packet delay budget of a service to be transmitted; an eighth subunit, configured to calculate an average value of upper limit values of first parameters corresponding to each second class condition parameter, and determine the upper limit value of the first parameter;
Wherein the determining unit includes:
a ninth subunit, configured to determine, according to the service priority, a first index of a candidate lower limit value of the first parameter;
a tenth subunit, configured to subtract 1 from the first index to obtain a second index if the value of the existing condition parameter reaches a first threshold and the difference between the first value and the first threshold is greater than or equal to a second threshold;
an eleventh subunit, configured to determine, if a candidate lower limit value of the first parameter corresponding to the second index is greater than or equal to a shortest time required for an initial retransmission resource of one transport block, the lower limit value of the first parameter is a candidate lower limit value of the first parameter corresponding to the second index; otherwise, adding 1 to the second index to obtain a first index, and determining the lower limit value of the first parameter as a candidate lower limit value of the first parameter corresponding to the first index;
wherein the first subunit is further configured to:
determining the first index value s according to a first formula; wherein, the first formula is:
wherein s is a first index value; m is the sum of the grade values of all the condition parameters; n1 is the number of conditional parameters; c is the number of grades of the condition parameter;
wherein the fourth subunit is further configured to:
Determining an upper limit value T2max of the first parameter according to a second formula; wherein the second formula is:
wherein T2max is the upper limit value of the first parameter; q is the minimum time required for the initial retransmission resource of one transport block; PDB is packet delay budget of service to be transmitted; r is the average reduction ratio value of n2 condition parameters;
wherein the seventh subunit is further configured to:
according to a fourth formula, determining an upper limit value T2max' of the first parameter corresponding to the second type of condition parameter; wherein the fourth formula is:
wherein T2max' is the upper limit value of the first parameter corresponding to the second type of condition parameter; q is the minimum time required for the initial retransmission resource of one transport block; PDB is packet delay budget of service to be transmitted; b is a scaled down value of a second type of conditional parameter.
7. A terminal comprising a memory, a transceiver, and a processor:
a memory for storing a computer program; a transceiver for transceiving data under control of the processor; a processor for reading the computer program in the memory and performing the following operations:
determining at least one of an upper limit value of a first parameter and a lower limit value of the first parameter according to at least one condition parameter; the first parameter is a boundary parameter corresponding to a termination boundary of the resource selection window;
Wherein the condition parameters include: service priority of service to be transmitted, channel busy rate CBR, channel occupancy rate CR or hybrid automatic repeat request HARQ maximum retransmission times;
wherein the processor is further configured to read the computer program in the memory and perform the following operations:
determining a first index value according to the number of the condition parameters, the number of the grades of the condition parameters and the grade value of each condition parameter;
according to a first index value, determining an upper limit value corresponding to the first index value as an upper limit value of the first parameter;
alternatively, the processor is further configured to read the computer program in the memory and perform the following operations:
acquiring n2 condition parameters reaching the window upper limit reduction threshold; n2 is an integer greater than or equal to 1;
determining the upper limit value of the first parameter according to the average reduced scale value of the n2 condition parameters, the shortest time required by the initial retransmission resource of one transport block and the packet delay budget of the service to be transmitted
Alternatively, the processor is further configured to read the computer program in the memory and perform the following operations:
determining a first type of condition parameter and a second type of condition parameter in the at least one condition parameter, wherein the increase of the value of the first type of condition parameter increases the upper limit value of the first parameter, and the increase of the value of the second type of condition parameter decreases the upper limit value of the first parameter;
If the value of the first type of condition parameter reaches the threshold value corresponding to the first type of condition parameter and the value of the second type of condition parameter reaches the threshold value corresponding to the second type of condition parameter, determining n3 combinations of the first type of condition parameter and the second type of condition parameter which reach the threshold value; n3 is an integer greater than or equal to 1;
determining the upper limit value of the first parameter corresponding to each second type condition parameter according to the reduced scale value of each second type condition parameter in the n3 second type condition parameters, the shortest time required by the initial retransmission resource of one transmission block and the packet delay budget of the service to be transmitted;
calculating the average value of the upper limit values of the first parameters corresponding to each second class of condition parameters respectively, and determining the upper limit value of the first parameters;
wherein the processor is further configured to read the computer program in the memory and perform the following operations:
determining a first index of a candidate lower limit value of the first parameter according to the service priority;
if the value of the existing condition parameter reaches a first threshold value and the difference between the value and the first threshold value is larger than or equal to a second threshold value, subtracting 1 from the first index to obtain a second index;
if the candidate lower limit value of the first parameter corresponding to the second index is larger than or equal to the shortest time required by the initial retransmission resource of one transmission block, determining that the lower limit value of the first parameter is the candidate lower limit value of the first parameter corresponding to the second index; otherwise, adding 1 to the second index to obtain a first index, and determining the lower limit value of the first parameter as a candidate lower limit value of the first parameter corresponding to the first index;
Wherein the processor is further configured to read the computer program in the memory and perform the following operations:
determining the first index value s according to a first formula; wherein, the first formula is:
wherein s is a first index value; m is the sum of the grade values of all the condition parameters; n1 is the number of conditional parameters; c is the number of grades of the condition parameter;
wherein the processor is further configured to read the computer program in the memory and perform the following operations:
determining an upper limit value T2max of the first parameter according to a second formula; wherein the second formula is:
wherein T2max is the upper limit value of the first parameter; q is the minimum time required for the initial retransmission resource of one transport block; PDB is packet delay budget of service to be transmitted; r is the average reduction ratio value of n2 condition parameters;
wherein the processor is further configured to read the computer program in the memory and perform the following operations:
according to a fourth formula, determining an upper limit value T2max' of the first parameter corresponding to the second type of condition parameter; wherein the fourth formula is:
wherein T2max' is the upper limit value of the first parameter corresponding to the second type of condition parameter; q is the minimum time required for the initial retransmission resource of one transport block; PDB is packet delay budget of service to be transmitted; b is a scaled down value of a second type of conditional parameter.
8. The terminal of claim 7, wherein the processor is further configured to read the computer program in the memory and perform the following:
determining a reduction ratio value of each of the n2 condition parameters;
and calculating the average value of the reduction ratio values of the condition parameters, and determining the average reduction ratio value of the n2 condition parameters.
9. The terminal of claim 8, wherein the processor is further configured to read the computer program in the memory and perform the following:
determining a reduction ratio r of a condition parameter according to a third formula ′ The method comprises the steps of carrying out a first treatment on the surface of the Wherein the third formula is:
wherein r' is a reduced scale value of a conditional parameter; x1 is the value of the condition parameter; y1 is a window upper limit reduction threshold corresponding to the condition parameter; e is a predetermined coefficient.
10. The terminal of claim 7, wherein the processor is further configured to read the computer program in the memory and perform the following:
according to a fifth formula, determining a reduction ratio value b of one second type of condition parameters in the n3 second type of condition parameters; wherein the fifth formula is:
b=|y2-x2|*d;
Wherein b is a reduced scale value of a second type of condition parameter; x2 is the value of the second type condition parameter; y2 is a threshold value corresponding to the second type of condition parameter; d is the coefficient corresponding to the second class condition parameter.
11. The terminal of claim 7, wherein the processor is further configured to read the computer program in the memory and perform the following:
according to a sixth formula, determining a shortest time q required by the initial retransmission resource of one transport block; wherein, the sixth formula is:
q=(Nmax-1)*HARQ RTT+T1+Ts;
wherein q is the shortest time required for the initial retransmission resource of one transport block; nmax is the sum of the initial retransmission times of one transport block; the HARQ RTT is the round trip time of the hybrid automatic repeat request; t1 is a boundary parameter corresponding to the initial boundary of the resource selection window; ts is the sum of the time domain lengths of the reserved resources.
12. A processor-readable storage medium, characterized in that the processor-readable storage medium stores a computer program for causing the processor to perform the method of any one of claims 1 to 5.
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN202011288227.2A CN114513269B (en) | 2020-11-17 | 2020-11-17 | Processing method and device of resource selection window, terminal and readable storage medium |
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN202011288227.2A CN114513269B (en) | 2020-11-17 | 2020-11-17 | Processing method and device of resource selection window, terminal and readable storage medium |
Publications (2)
Publication Number | Publication Date |
---|---|
CN114513269A CN114513269A (en) | 2022-05-17 |
CN114513269B true CN114513269B (en) | 2023-05-02 |
Family
ID=81547298
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
CN202011288227.2A Active CN114513269B (en) | 2020-11-17 | 2020-11-17 | Processing method and device of resource selection window, terminal and readable storage medium |
Country Status (1)
Country | Link |
---|---|
CN (1) | CN114513269B (en) |
Citations (4)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN108271209A (en) * | 2016-12-30 | 2018-07-10 | 电信科学技术研究院 | A kind of resource selection method, terminal and base station |
WO2019028649A1 (en) * | 2017-08-08 | 2019-02-14 | 华为技术有限公司 | Method and apparatus for transmitting service data |
CN111182639A (en) * | 2020-01-03 | 2020-05-19 | 展讯半导体(南京)有限公司 | Transmission resource determination method and related equipment |
CN111294942A (en) * | 2019-03-29 | 2020-06-16 | 展讯半导体(南京)有限公司 | Method and device for determining and sending sensing window length, storage medium, terminal and base station |
Family Cites Families (1)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
WO2020085854A1 (en) * | 2018-10-25 | 2020-04-30 | 엘지전자 주식회사 | Method and device for determining resource selection window on basis of information related to sidelink harq feedback in wireless communication system |
-
2020
- 2020-11-17 CN CN202011288227.2A patent/CN114513269B/en active Active
Patent Citations (4)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN108271209A (en) * | 2016-12-30 | 2018-07-10 | 电信科学技术研究院 | A kind of resource selection method, terminal and base station |
WO2019028649A1 (en) * | 2017-08-08 | 2019-02-14 | 华为技术有限公司 | Method and apparatus for transmitting service data |
CN111294942A (en) * | 2019-03-29 | 2020-06-16 | 展讯半导体(南京)有限公司 | Method and device for determining and sending sensing window length, storage medium, terminal and base station |
CN111182639A (en) * | 2020-01-03 | 2020-05-19 | 展讯半导体(南京)有限公司 | Transmission resource determination method and related equipment |
Non-Patent Citations (1)
Title |
---|
R2-2009407 "CR on L1 parameters for NR sidelink communication";Huawei等;《3GPP tsg_ran\wg2_rl2》;20201023;全文 * |
Also Published As
Publication number | Publication date |
---|---|
CN114513269A (en) | 2022-05-17 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
WO2021062613A1 (en) | Data transmission method and device | |
EP3553980A1 (en) | Method for transmitting data, terminal device and network device | |
US20210021315A1 (en) | Method of transmitting csi report, terminal device and network device | |
CN108964851B (en) | Method, equipment and system for sending and receiving indication information | |
US20190342893A1 (en) | Data Packet Transmission Method and Terminal | |
US20210336727A1 (en) | Harq process id determination method and apparatus, terminal, and medium | |
WO2021012996A1 (en) | Information transmission method and device | |
CN110351844B (en) | Resource determining and resource indicating methods and devices | |
RU2751553C1 (en) | Wireless communication method, terminal device and network device | |
US9072059B2 (en) | Interference control | |
CN111954302B (en) | Information acquisition method and device | |
CN114513269B (en) | Processing method and device of resource selection window, terminal and readable storage medium | |
CN114257331A (en) | Scheduling method, device and storage medium of satellite communication system | |
WO2022156548A1 (en) | Uci multiplexing transmission method and apparatus, and storage medium | |
CN107333336B (en) | Method, base station and terminal for sending leader sequence on random access channel | |
EP3592060B1 (en) | Resource allocation method, determination method and apparatus | |
KR102256449B1 (en) | Signal transmission method, terminal device, and network device | |
WO2022151884A1 (en) | Information processing method, apparatus, and readable storage medium | |
CN114826505B (en) | Information transmission method, terminal equipment and network equipment | |
CN114826477B (en) | Control channel monitoring method, device and storage medium | |
CN115696257A (en) | Information processing method and device, terminal equipment and network equipment | |
CN115942377A (en) | Information processing method, terminal and readable storage medium | |
CN115334580A (en) | Resource allocation method, terminal, network side device and storage medium | |
CN114499746B (en) | Method, device and base station for determining Modulation and Coding Strategy (MCS) level | |
CN112543506A (en) | Resource determination method and device |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
PB01 | Publication | ||
PB01 | Publication | ||
SE01 | Entry into force of request for substantive examination | ||
SE01 | Entry into force of request for substantive examination | ||
GR01 | Patent grant | ||
GR01 | Patent grant |