CN116234032A - PUCCH resource allocation processing method, device, processor and storage medium for improving concurrence number of users per TTI of cell - Google Patents

PUCCH resource allocation processing method, device, processor and storage medium for improving concurrence number of users per TTI of cell Download PDF

Info

Publication number
CN116234032A
CN116234032A CN202310330829.7A CN202310330829A CN116234032A CN 116234032 A CN116234032 A CN 116234032A CN 202310330829 A CN202310330829 A CN 202310330829A CN 116234032 A CN116234032 A CN 116234032A
Authority
CN
China
Prior art keywords
pucch
per tti
resource allocation
pucch resource
cell
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Pending
Application number
CN202310330829.7A
Other languages
Chinese (zh)
Inventor
王艳芳
逯利军
钱培专
许闱帷
季利军
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Beijing Certusnet Information Technology Co ltd
Shanghai Certusnet Inc
CERTUSNET CORP
Original Assignee
Beijing Certusnet Information Technology Co ltd
Shanghai Certusnet Inc
CERTUSNET CORP
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Beijing Certusnet Information Technology Co ltd, Shanghai Certusnet Inc, CERTUSNET CORP filed Critical Beijing Certusnet Information Technology Co ltd
Priority to CN202310330829.7A priority Critical patent/CN116234032A/en
Publication of CN116234032A publication Critical patent/CN116234032A/en
Pending legal-status Critical Current

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W72/00—Local resource management
    • H04W72/12—Wireless traffic scheduling
    • H04W72/121—Wireless traffic scheduling for groups of terminals or users
    • 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
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W72/00—Local resource management
    • H04W72/04—Wireless resource allocation
    • H04W72/044—Wireless resource allocation based on the type of the allocated resource
    • H04W72/0446—Resources in time domain, e.g. slots or frames
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W72/00—Local resource management
    • H04W72/04—Wireless resource allocation
    • H04W72/044—Wireless resource allocation based on the type of the allocated resource
    • H04W72/0453—Resources in frequency domain, e.g. a carrier in FDMA
    • Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
    • Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
    • Y02D30/00—Reducing energy consumption in communication networks
    • Y02D30/70—Reducing energy consumption in communication networks in wireless communication networks

Abstract

The invention relates to a method, a device, a processor and a computer readable storage medium method thereof, comprising the following steps: configuring BWP parameters and PUCCH parameter configuration shared by multiple terminals of a 5G NR TDD system base station; initializing a PUCCH resource of the dedicated BWP; establishing a resource allocation algorithm of a PUCCH Format1 long Format for improving the concurrence number of users per TTI of a base station cell; and establishing a resource allocation algorithm of a PUCCH Format3 long Format for improving the concurrence number of users per TTI of a base station cell. The invention also relates to a method, a device, a processor and a computer readable storage medium device, a processor and a storage medium thereof. The method, the device, the processor and the computer readable storage medium thereof flexibly apply the PUCCH resource multiplexing protocol and utilize the multi-user resource allocation mode of grouping according to the resource types and grouping according to the users, and can effectively improve the capacity of the base station system cell and support the performance of the concurrent number of the users in the PUCCH resource allocation scheme of the base station cell.

Description

PUCCH resource allocation processing method, device, processor and storage medium for improving concurrence number of users per TTI of cell
Technical Field
The invention relates to the technical field of wireless communication networks, in particular to the field of PUCCH channels, and specifically relates to a PUCCH resource allocation processing method, device, processor and computer readable storage medium thereof for improving the concurrence number of users per TTI of a cell.
Background
The PUCCH channel is used for carrying independent UCI (uplink control information) of the UE and its combined information, where the UCI information includes uplink scheduling request information SR of the UE, feedback information of an analysis result of a downlink traffic channel PDSCH of the UE, and measurement result information of the UE on a downlink reference signal CSI-RS, and feedback quality information of a current downlink traffic channel of the UE, so as to provide reference and basis for downlink scheduling of the UE by the base station. Whether the base station reasonably distributes PUCCH resources carrying the SR affects the number of accessible users of the base station; whether the base station reasonably distributes PUCCH resources carrying the CSI resources affects whether the downlink scheduling parameters of the base station can be timely and accurately adjusted or not, and affects the downlink throughput of a cell; whether the base station reasonably distributes PUCCH resources carrying HARQ feedback information directly influences the block error rate and throughput of downlink service and the concurrency quantity of users in each TTI which can be supported by the base station. Therefore, whether PUCCH resource allocation is reasonably an important factor affecting cell capacity, throughput and supportable number of concurrency per TTI user, especially the number of concurrency per TTI user supportable by the base station is one of important indicators for measuring processing performance of the base station, and is one of the difficult problems that the base station system must solve.
Disclosure of Invention
The invention aims to overcome the defects of the prior art and provide a PUCCH resource allocation processing method, a device, a processor and a computer readable storage medium thereof, wherein the PUCCH resource allocation processing method, the device, the processor and the computer readable storage medium can be used for improving the concurrence number of users per TTI of a cell, and the PUCCH resource allocation processing method, the device, the processor and the computer readable storage medium can be used for realizing good processing performance, reasonable resource allocation and wide application range.
In order to achieve the above object, a PUCCH resource allocation processing method for increasing the number of concurrence of users per TTI in a cell according to the present invention, a PUCCH resource allocation processing method for increasing the number of concurrence of users per TTI in a cell, a device, a processor, and a computer readable storage medium thereof are as follows:
the PUCCH resource allocation processing method for improving the concurrence number of users per TTI of a cell is mainly characterized by comprising the following steps:
(1) Configuring BWP parameters and PUCCH parameter configuration shared by multiple terminals of a 5G NR TDD system base station;
(2) Initializing a PUCCH resource of the dedicated BWP;
(3) Establishing a resource allocation algorithm of a PUCCH Format1 long Format for improving the concurrence number of users per TTI of a base station cell;
(4) And establishing a resource allocation algorithm of a PUCCH Format3 long Format for improving the concurrence number of users per TTI of a base station cell.
Preferably, the step (1) specifically includes the following steps:
(1.1) configuring BWP parameters;
(1.2) configuring a maximum number of terminals;
(1.3) configuring PUCCH resource parameters.
Preferably, the step (2) specifically includes:
and establishing allocation of a PUCCH resource set of the special BWP, wherein the allocation comprises a first PUCCH resource set and a second PUCCH resource set which bear HARQ feedback, and determining a PUCCH Format used by each resource set, the first PUCCH resource set uses a PUCCH Format1 long Format, and the second PUCCH resource set uses a PUCCH Format3 long Format.
Preferably, the step (3) specifically includes the following steps:
(3.1) confirming the multiplexing cyclic shift number and the cyclic shift configuration of the PUCCH Format1 long Format;
(3.2) confirming the configuration of the number of the multiplexing orthogonal sequences and the index values of the orthogonal sequences in the PUCCH Format1 long Format;
(3.3) calculating the number of resources in the single RB multiplexing PUCCH Format1 long Format;
(3.4) determining a size of the first PUCCH resource set;
(3.5) determining the number of RBs required for the first PUCCH resource set;
(3.6) calculating the maximum number of concurrent users which can be supported per TTI.
Preferably, the step (3.5) specifically includes the following steps:
(3.5.1) determining an HARQ feedback strategy of the PDSCH according to a frame structure supported by the base station;
(3.5.2) determining the maximum PUCCH Format1 long Format resource required for each uplink SLOT;
(3.5.3) calculating the maximum number of concurrent users supportable per TTI.
Preferably, the step (4) specifically includes the following steps:
(4.1) determining the number of the RBs which can be allocated to the uplink SLOT by the PUCCH Format3 long Format;
(4.2) determining the number of PUCCH Format3 long Format resource sets;
(4.3) determining an allocation scheme of the PUCCH Format3 long Format resource set;
(4.4) calculating the maximum number of concurrent users which can be supported per TTI.
The device for realizing PUCCH resource allocation processing for improving the concurrence number of users per TTI of a cell is mainly characterized in that the device comprises:
a processor configured to execute computer-executable instructions;
and a memory storing one or more computer executable instructions which, when executed by the processor, implement the steps of the PUCCH resource allocation processing method for increasing the number of concurrence per TTI user of a cell described above.
The processor for realizing the PUCCH resource allocation processing for improving the concurrency number of users per TTI of a cell is mainly characterized in that the processor is configured to execute computer executable instructions, and when the computer executable instructions are executed by the processor, the steps of the PUCCH resource allocation processing method for improving the concurrency number of users per TTI of the cell are realized.
The computer readable storage medium is mainly characterized in that the computer program is stored thereon, and the computer program can be executed by a processor to implement the steps of the PUCCH resource allocation processing method for improving the concurrence number of users per TTI in a cell.
The PUCCH resource allocation processing method, the device, the processor and the computer readable storage medium thereof for effectively improving the concurrency number of users in each TTI of the cell are adopted to obviously improve the concurrency number of the users which can be supported in each TTI of the base station system cell.
Drawings
Fig. 1 is a flowchart of a PUCCH resource allocation processing method for increasing the number of user concurrences per TTI in a cell according to the present invention.
Fig. 2 is a flowchart illustrating a parameter configuration procedure of a PUCCH resource allocation processing method for increasing the number of user concurrence per TTI in a cell according to the present invention.
Fig. 3 is a flowchart of the steps of the PUCCH Format1 resource allocation algorithm established in the PUCCH resource allocation processing method for increasing the number of concurrency of users per TTI in the cell according to the present invention.
Fig. 4 is a flowchart of the steps of the PUCCH Format3 resource allocation algorithm established in the PUCCH resource allocation processing method for increasing the number of concurrency of users per TTI in the cell according to the present invention.
Detailed Description
In order to more clearly describe the technical contents of the present invention, a further description will be made below in connection with specific embodiments.
The PUCCH resource allocation processing method for improving the concurrence number of users per TTI of a cell comprises the following steps:
(1) Configuring BWP parameters and PUCCH parameter configuration shared by multiple terminals of a 5G NR TDD system base station;
(2) Initializing a PUCCH resource of the dedicated BWP;
(3) Establishing a resource allocation algorithm of a PUCCH Format1 long Format for improving the concurrence number of users per TTI of a base station cell;
(4) And establishing a resource allocation algorithm of a PUCCH Format3 long Format for improving the concurrence number of users per TTI of a base station cell.
As a preferred embodiment of the present invention, the step (1) specifically includes the steps of:
(1.1) configuring BWP parameters;
(1.2) configuring a maximum number of terminals;
(1.3) configuring PUCCH resource parameters.
As a preferred embodiment of the present invention, the step (2) specifically includes:
and establishing allocation of a PUCCH resource set of the special BWP, wherein the allocation comprises a first PUCCH resource set and a second PUCCH resource set which bear HARQ feedback, and determining a PUCCH Format used by each resource set, the first PUCCH resource set uses a PUCCH Format1 long Format, and the second PUCCH resource set uses a PUCCH Format3 long Format.
As a preferred embodiment of the present invention, the step (3) specifically includes the following steps:
(3.1) confirming the multiplexing cyclic shift number and the cyclic shift configuration of the PUCCH Format1 long Format;
(3.2) confirming the configuration of the number of the multiplexing orthogonal sequences and the index values of the orthogonal sequences in the PUCCH Format1 long Format;
(3.3) calculating the number of resources in the single RB multiplexing PUCCH Format1 long Format;
(3.4) determining a size of the first PUCCH resource set;
(3.5) determining the number of RBs required for the first PUCCH resource set;
(3.6) calculating the maximum number of concurrent users which can be supported per TTI.
As a preferred embodiment of the present invention, the step (3.5) specifically includes the steps of:
(3.5.1) determining an HARQ feedback strategy of the PDSCH according to a frame structure supported by the base station;
(3.5.2) determining the maximum PUCCH Format1 long Format resource required for each uplink SLOT;
(3.5.3) calculating the maximum number of concurrent users supportable per TTI.
As a preferred embodiment of the present invention, the step (4) specifically includes the following steps:
(4.1) determining the number of the RBs which can be allocated to the uplink SLOT by the PUCCH Format3 long Format;
(4.2) determining the number of PUCCH Format3 long Format resource sets;
(4.3) determining an allocation scheme of the PUCCH Format3 long Format resource set;
(4.4) calculating the maximum number of concurrent users which can be supported per TTI.
The device for improving the PUCCH resource allocation processing of the concurrence number of the users per TTI of the cell comprises:
a processor configured to execute computer-executable instructions;
and a memory storing one or more computer executable instructions which, when executed by the processor, implement the steps of the PUCCH resource allocation processing method for increasing the number of concurrence per TTI user of a cell described above.
The processor for processing PUCCH resource allocation per TTI user concurrency in the enhanced cell according to the present invention is configured to execute computer executable instructions, where the computer executable instructions when executed by the processor implement the steps of the PUCCH resource allocation processing method for enhancing the per TTI user concurrency in the cell.
The computer readable storage medium of the present invention has a computer program stored thereon, the computer program being executable by a processor to implement the steps of the PUCCH resource allocation processing method for increasing the concurrency number of users per TTI in a cell described above.
In a specific embodiment of the invention, a PUCCH resource allocation method for improving the concurrency number of users in each TTI of a cell of a 5G NR base station is disclosed, so that the schedulable user concurrency number in each TTI of the cell is effectively improved, and the user experience is improved. The method for allocating resources is used for improving the concurrency number of users per TTI of a base station cell of a 5G NR TDD system, effectively improving the processing performance of the base station system and promoting the improvement of user experience.
The invention relates to a resource allocation method for improving the concurrence number of users in each TTI of a base station cell, which focuses on a PUCCH resource allocation method for bearing HARQ feedback information, and comprises the following steps:
(10) Parameter configuration: configuring BWP parameters and PUCCH parameter configurations shared by a multi-user terminal UE of a 5G NR TDD system base station, wherein the BWP parameters and the PUCCH parameter configurations comprise parameter configurations of uplink special BWP of the UE, target UE quantity configurations supportable by the base station and PUCCH resource parameter configurations of the UE;
(20) PUCCH resource initialization of dedicated BWP: establishing a PUCCH resource allocation scheme of the special BWP carrying the HARQ feedback information, and executing a corresponding initialization process;
(30) Establishing a resource allocation algorithm of PUCCHF Format1 with a PUCCH Format1 for improving the concurrence number of users in each TTI of a base station cell;
(40) And establishing a resource allocation algorithm of PUCCHF Format3 with a PUCCH Format3 for improving the concurrence number of users per TTI of the base station cell.
As shown in fig. 1, the resource allocation method for improving the concurrence number of users per TTI in a cell according to the present invention includes the following steps:
(10) Parameter configuration: the BWP parameter and the PUCCH parameter configuration shared by multiple UEs of the 5G NR TDD system base station are configured, wherein the BWP parameter configuration comprises the parameter configuration of the uplink special BWP of the UE, the number configuration of target UEs supportable by the base station and the PUCCH resource parameter configuration of the UE. The 5G NR protocol defines 5 PUCCH formats, of which formats 0 and 2 are short formats. The 5G NR TDD system base station used in the patent uses four formats of formats 0-3, and the PUCCH carrying the HARQ feedback uses long formats of Format1 and Format3.
As shown in fig. 2, the (10) parameter configuration step includes:
(11) BWP parameter configuration: PUCCH is a BWP-level configuration. The base station of the patent only configures one full-bandwidth uplink dedicated BWP.
(12) Maximum UE number configuration: the patent configures the number of target UE which can be supported by the uplink special BWP and the maximum UE number which is scheduled per TTI, and the target UE number is used as one of the basis of PUCCH resource allocation of the BWP UE;
(13) PUCCH resource parameter configuration: the method comprises the steps of configuring index values of a public PUCCH and configuring PUCCH format parameters.
(20) PUCCH resource initialization of dedicated BWP: and (3) establishing a resource allocation scheme for influencing the number of concurrent users of each TTI of the cell, establishing allocation of a PUCCH resource SET of a special BWP, wherein the allocation comprises a PUCCH SET0 resource SET carrying HARQ feedback and a PUCCH SET1 resource SET carrying HARQ feedback, and determining a PUCCH format used by each resource SET. The PUCCH SET0 resource SET is initialized to occupy 14 symbols by using a Format1, and frequency hopping is avoided; the PUCCH SET1 resource SET uses a Format3 Format, is initialized to occupy 14 symbols, and does not hop.
(30) Establishing a resource allocation algorithm of PUCCHF Format1 for improving the concurrence number of users per TTI of a base station cell: according to 38213 protocol, the number of HARQ feedback bits which can be carried by PUCCH Format1 is 1-2 bits, and the method is suitable for a scenario in which users in a cell have basically uniform traffic demands and are not bursty peak traffic demands.
The 14 symbol PUCCH occupies uplink SLOT resources, and the more RBs the PUCCH occupies, the fewer RBs the PUSCH is available, and thus the smaller the cell uplink throughput. Therefore, it is necessary to allocate PUCCH resources according to the maximum UE number of the cell and reduce the use of PUCCH RBs as much as possible while satisfying the cell capacity requirement. The PUCCH Format1 defines two resource multiplexing modes including cyclic shift multiplexing and time domain orthogonal sequence multiplexing according to a 3gpp protocol, and each PUCCH Format1 resource occupies 1 RB.
As shown in fig. 3, the step of (30) establishing a PUCCH Format1 resource allocation algorithm includes:
(301) Confirming the multiplexing cyclic shift number and configuration of the cyclic shift of the PUCCH Format 1: 38.213 the maximum supportable number of cyclic shifts of PUCCH Format1 is 12, and then the algorithm designed in this patent may select 9 cyclic shifts from 0-11.
(302) Configuration of the number of the multiplexing orthogonal sequences and the index values of the orthogonal sequences of the acknowledgement PUCCH Format 1: the PUCCH Format1 configured by the patent is 14 symbols, if frequency hopping is adopted, the maximum can only multiplex 3 orthogonal sequences, as defined by a 38211 table 6.3.2.4.1-1; therefore, in order to increase the cell capacity, the present patent uses PUCCH non-hopping mode, and 7 orthogonal sequences can be multiplexed, as defined in 38211 table 6.3.2.4.1-2.
Table 6.3.2.4.1-1 number of symbol PUCCH and corresponding
Figure BDA0004154910070000074
Figure BDA0004154910070000071
Table 6.3.2.4.1-2 orthogonal sequence of PUCCH Format1 in FIG. 1
Figure BDA0004154910070000073
/>
Figure BDA0004154910070000072
(303) Calculating the number of resources Npucch-RB of the single-RB multiplexing PUCCH Format 1: 9 (CS) X7 (OCC) =63, i.e. 63 PUCCH Format1 resources can be multiplexed per RB, and more RB resources can be reserved for PUSCH traffic channels. Therefore, on one hand, the cell capacity and the number of concurrent users per TTI can be improved, and on the other hand, the cell business swallow amount can be guaranteed.
(304) Determining a size Npucch-SET0 of the PUCCH SET0 resource SET: according to the maximum number Nmax-UE of UEs that the configured cell needs to support, only one special BWP is configured, so that the maximum number of UEs that the BWP needs to support is also the maximum number of UEs that the BWP needs to support, so that the PUCCH SET0 resource SET theory also needs to allocate Nmax-UE resources to the maximum, i.e. Npucch-SET 0=nmax-UE, so that the maximum number of concurrent users that the base station can support per TTI can reach the theoretical maximum.
(305) Determining the number of RBs required by the PUCCH SET0 resource SET: the number of RBs Nrb-set0=npucch-set0/Npucch-RB required for PUCCH SET0 resource SET, assuming Nmax-ue=512, nrb=512/63=9. If it is desired to further reduce the use of RBs, the number of reusable cyclic shifts defined by step (301) may be increased up to 12. The number of RBs occupied by the PUCCH Format1 resources is reduced by an allocation strategy of the PUCCH Format1 resource multiplexing, so that the size of the PUCCH SET0 resource SET reaches the theoretical maximum value as far as possible.
(306) Calculating the maximum number of concurrent users Ntti (allocation based on PUCCH Format1 resource set) which can be supported per TTI:
(3051) Based on a frame structure supported by a base station, determining an HARQ feedback strategy of the PDSCH: taking a mobile 5ms frame format as an example (DDDDDDDSUU), HARQ feedback resources of a PDSCH scheduled by a downlink SLOT of 0-3 are distributed on a first uplink SLOT, and HARQ feedback resources of a downlink SLOT of 4-7 and a PDSCH scheduled by a special SLOT are distributed on a second uplink SLOT, so that uniform and reasonable distribution of resource distribution is achieved;
(3052) Determining the maximum PUCCH Format1 resource required by each uplink SLOT: based on a 3051 scheduling policy, the maximum PUCCH Format1 resource allocated to each uplink SLOT is required to support 4XNtti users, namely 4XNtti resources are required to the maximum;
(3053) Calculating the maximum number of concurrent users Ntti which can be supported per TTI: as defined in (304), if Nmax-ue=512 resources are allocated to the PUCCH SET0 resource SET, the PUCCH Format1 resource allocable to each uplink SLOT is 512, and the average number of concurrence users supported per TTI is 512/4=128; or if the processing capability of the base station per TTI is strong enough, 2 bits can be loaded according to the maximum PUCCH Format1 resource, then in the case of the maximum downlink 4-stream single codeword of the base station, the number of concurrency users supported per TTI can reach 512/2=256, i.e. 256 users with the same scheduling per 2 downlink SLOTs, and then the PUCCH Format1 resource required by each uplink SLOT is still 512.
(40) Establishing a resource allocation algorithm of PUCCHF Format3 for improving the concurrence number of users per TTI of a base station cell: according to 38213 protocol, the number of HARQ feedback bits that PUCCH Format3 can carry is greater than 2 bits, and is suitable for a scenario in which a user in a cell has a sudden peak traffic demand for traffic.
The PUCCH Format3 is configured to be 14 symbols, and occupies the uplink SLOT. The PUCCH Format3 defines no resource multiplexing manner according to the 3gpp protocol, and the number of bearer bits is greater than 2, so when the number of bearer bits is greater, the number of RBs needs to be increased to meet the requirement of bearing multiple bits. Under the condition that the CSI resource multiplexing is not considered, according to the HARQ feedback design of the mobile 5ms frame Format, the RB occupied by each Format3 resource is still calculated as 1.
As shown in fig. 4, the step of (40) establishing a PUCCH Format3 resource allocation algorithm includes:
(401) Determining the number of the RBs which can be allocated to the uplink SLOT by the PUCCH Format 3: because the Format3 has no resource multiplexing mode and is used for bearing more bits, the Format occupies more RBs and has larger influence on the cell business swallowing amount. Therefore, the number of RBs allocatable by PUCCH Format3 must be defined first. Considering that not all users have a requirement of burst peak traffic, the present patent assumes that the RB of the uplink SLOT reserved by PUCCH Format3 is 32RB at maximum.
(402) Determining the number of PUCCH Format3 resource sets: under the condition that the CSI multiplexing is not considered, each PUCCH Format3 occupies one RB, and then the number of the PUCCH Format3 resource sets can reach 32.
(403) And determining an allocation scheme of the PUCCH Format3 resource set. Each UE is maximally allocated four PUCCH dedicated resource sets according to the definition of the 38331 protocol. This patent only allocates 2 resource sets. The first resource set is the resource set of PUCCH Format0 or Format1, and the present patent defines the resource set of Format 1. The second resource set is a resource set of PUCCH Format3, and each UE is maximally allocated 8 resources according to the definition of the 38331 protocol. Then, the 32 PUCCH Format3 resource sets of the base station may be managed in 4 groups and may be allocated to 32 users in total in 4 groups.
(404) The maximum number of concurrent users (npti) supportable per TTI (allocation based on PUCCH Format3 resource set) is calculated as 32:
(4041) Still based on the mobile 5ms frame format study, the first uplink SLOT may carry PDSCH HARQ feedback for the first 4 downlink SLOTs. If the first 4 SLOTs require downlink SLOT continuous scheduling due to the burst demand of the peak traffic of some users, the HARQ feedback of the some users must select resources from the 4 sets of 32 PUCCH Format3 resources maintained by the base station to carry. Then, 32 concurrent users are scheduled at maximum per SLOT, and the 32 users are also divided into 4 groups, and mapped with 4 PUCCH Format3 resource sets, each group of users can only allocate 8 PUCCH Format3 resources in the mapped resource group.
(4042) The user capacity supportable by the base station is 512, the number of PUCCH Format3 resource sets maintained by the base station is 32, and concurrent users of burst peak flow supportable by each TTI is 32. Then, 512 users of the base station can use 32 PUCCH Format3 resources in a time-sharing manner to meet the requirements of burst traffic peak flows of different users at different times.
(4043) Since PUCCH Format3 cannot be code division multiplexed, if the number of concurrent users that must limit both uplink RBs and increase the peak downlink burst flow per TTI is to be solved, only a time division multiplexing resource allocation method can be used. The method and the device realize the resource multiplexing of the PUCCH Format3 better in a resource grouping and user grouping mode; and the requirements of the base station system for considering the flow and the quantity of concurrent users are flexibly realized by considering different application scenes of the PUCCH Format1 and the Format3 and designing different resource multiplexing allocation methods.
The resource allocation method for improving the downlink concurrency user number of each TTI of the cell can realize using fewer RB resources of the uplink SLOT, and greatly improves the concurrency user number of each TTI of the cell until the theoretical concurrency number. The cell capacity, the concurrent user quantity and the cell swallowing amount can be well considered, the performance index of the base station system is effectively improved, and the cell user experience is effectively improved.
The specific implementation manner of this embodiment may be referred to the related description in the foregoing embodiment, which is not repeated herein.
It is to be understood that the same or similar parts in the above embodiments may be referred to each other, and that in some embodiments, the same or similar parts in other embodiments may be referred to.
It should be noted that in the description of the present invention, the terms "first," "second," and the like are used for descriptive purposes only and are not to be construed as indicating or implying relative importance. Furthermore, in the description of the present invention, unless otherwise indicated, the meaning of "plurality" means at least two.
Any process or method descriptions in flow charts or otherwise described herein may be understood as representing modules, segments, or portions of code which include one or more executable instructions for implementing specific logical functions or steps of the process, and further implementations are included within the scope of the preferred embodiment of the present invention in which functions may be executed out of order from that shown or discussed, including substantially concurrently or in reverse order, depending on the functionality involved, as would be understood by those reasonably skilled in the art of the present invention.
It is to be understood that portions of the present invention may be implemented in hardware, software, firmware, or a combination thereof. In the above embodiments, the various steps or methods may be implemented in software or firmware stored in a memory and executed by a suitable instruction execution device. For example, if implemented in hardware, as in another embodiment, may be implemented using any one or combination of the following techniques, as is well known in the art: discrete logic circuits having logic gates for implementing logic functions on data signals, application specific integrated circuits having suitable combinational logic gates, programmable Gate Arrays (PGAs), field Programmable Gate Arrays (FPGAs), and the like.
Those of ordinary skill in the art will appreciate that all or part of the steps carried out in the method of the above embodiments may be implemented by a program to instruct related hardware, and the corresponding program may be stored in a computer readable storage medium, where the program when executed includes one or a combination of the steps of the method embodiments.
In addition, each functional unit in the embodiments of the present invention may be integrated in one processing module, or each unit may exist alone physically, or two or more units may be integrated in one module. The integrated modules may be implemented in hardware or in software functional modules. The integrated modules may also be stored in a computer readable storage medium if implemented as software functional modules and sold or used as a stand-alone product.
The above-mentioned storage medium may be a read-only memory, a magnetic disk or an optical disk, or the like.
In the description of the present specification, a description referring to terms "one embodiment," "some embodiments," "examples," "specific examples," or "some examples," etc., means that a particular feature, structure, material, or characteristic described in connection with the embodiment or example is included in at least one embodiment or example of the present invention. In this specification, schematic representations of the above terms do not necessarily refer to the same embodiments or examples. Furthermore, the particular features, structures, materials, or characteristics described may be combined in any suitable manner in any one or more embodiments or examples.
The PUCCH resource allocation processing method, the device, the processor and the computer readable storage medium thereof for improving the concurrency number of users in each TTI of the cell are adopted to obviously improve the concurrency number of the users which can be supported in each TTI of the base station system cell.
In this specification, the invention has been described with reference to specific embodiments thereof. It will be apparent, however, that various modifications and changes may be made without departing from the spirit and scope of the invention. The specification and drawings are, accordingly, to be regarded in an illustrative rather than a restrictive sense.

Claims (9)

1. The PUCCH resource allocation processing method for improving the concurrence number of users per TTI of a cell is characterized by comprising the following steps:
(1) Configuring BWP parameters and PUCCH parameter configuration shared by multiple terminals of a 5G NR TDD system base station;
(2) Initializing a PUCCH resource of the dedicated BWP;
(3) Establishing a resource allocation algorithm of a PUCCH Format1 long Format for improving the concurrence number of users per TTI of a base station cell;
(4) And establishing a resource allocation algorithm of a PUCCH Format3 long Format for improving the concurrence number of users per TTI of a base station cell.
2. The PUCCH resource allocation processing method for increasing the concurrence number of users per TTI in a cell according to claim 1, wherein the step (1) specifically includes the steps of:
(1.1) configuring BWP parameters;
(1.2) configuring a maximum number of terminals;
(1.3) configuring PUCCH resource parameters.
3. The PUCCH resource allocation processing method for increasing the concurrence number of users per TTI in a cell according to claim 1, wherein the step (2) specifically includes:
and establishing allocation of a PUCCH resource set of the special BWP, wherein the allocation comprises a first PUCCH resource set and a second PUCCH resource set which bear HARQ feedback, and determining a PUCCH Format used by each resource set, the first PUCCH resource set uses a PUCCH Format1 long Format, and the second PUCCH resource set uses a PUCCH Format3 long Format.
4. The PUCCH resource allocation processing method for increasing the concurrence number of users per TTI in a cell according to claim 1, wherein the step (3) specifically includes the steps of:
(3.1) confirming the multiplexing cyclic shift number and the cyclic shift configuration of the PUCCH Format1 long Format;
(3.2) confirming the configuration of the number of the multiplexing orthogonal sequences and the index values of the orthogonal sequences in the PUCCH Format1 long Format;
(3.3) calculating the number of resources in the single RB multiplexing PUCCH Format1 long Format;
(3.4) determining a size of the first PUCCH resource set;
(3.5) determining the number of RBs required for the first PUCCH resource set;
(3.6) calculating the maximum number of concurrent users which can be supported per TTI.
5. The PUCCH resource allocation processing method for increasing the number of concurrence of users per TTI in a cell according to claim 4, wherein the step (3.5) specifically includes the steps of:
(3.5.1) determining an HARQ feedback strategy of the PDSCH according to a frame structure supported by the base station;
(3.5.2) determining the maximum PUCCH Format1 long Format resource required for each uplink SLOT;
(3.5.3) calculating the maximum number of concurrent users supportable per TTI.
6. The PUCCH resource allocation processing method for increasing the concurrence number of users per TTI in a cell according to claim 1, wherein the step (4) specifically includes the steps of:
(4.1) determining the number of the RBs which can be allocated to the uplink SLOT by the PUCCH Format3 long Format;
(4.2) determining the number of PUCCH Format3 long Format resource sets;
(4.3) determining an allocation scheme of the PUCCH Format3 long Format resource set;
(4.4) calculating the maximum number of concurrent users which can be supported per TTI.
7. An apparatus for improving PUCCH resource allocation processing of a concurrence number of users per TTI in a cell, the apparatus comprising:
a processor configured to execute computer-executable instructions;
a memory storing one or more computer-executable instructions which, when executed by the processor, perform the steps of the PUCCH resource allocation processing method for increasing the number of concurrence per TTI user of a cell as claimed in any one of claims 1 to 6.
8. A processor for improving PUCCH resource allocation processing per TTI user concurrency of a cell, wherein the processor is configured to execute computer executable instructions that, when executed by the processor, implement the steps of the PUCCH resource allocation processing method for improving per TTI user concurrency of a cell according to any one of claims 1 to 6.
9. A computer readable storage medium having stored thereon a computer program executable by a processor to perform the steps of the PUCCH resource allocation processing method for increasing the number of concurrence per TTI user of a cell according to any one of claims 1 to 6.
CN202310330829.7A 2023-03-30 2023-03-30 PUCCH resource allocation processing method, device, processor and storage medium for improving concurrence number of users per TTI of cell Pending CN116234032A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202310330829.7A CN116234032A (en) 2023-03-30 2023-03-30 PUCCH resource allocation processing method, device, processor and storage medium for improving concurrence number of users per TTI of cell

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202310330829.7A CN116234032A (en) 2023-03-30 2023-03-30 PUCCH resource allocation processing method, device, processor and storage medium for improving concurrence number of users per TTI of cell

Publications (1)

Publication Number Publication Date
CN116234032A true CN116234032A (en) 2023-06-06

Family

ID=86589257

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202310330829.7A Pending CN116234032A (en) 2023-03-30 2023-03-30 PUCCH resource allocation processing method, device, processor and storage medium for improving concurrence number of users per TTI of cell

Country Status (1)

Country Link
CN (1) CN116234032A (en)

Similar Documents

Publication Publication Date Title
JP7254776B2 (en) Method of resource allocation in wireless communication system and apparatus utilizing said method
JP7155166B2 (en) Method for resource allocation related signaling in wireless communication system and apparatus using the method
US8073062B2 (en) Method and apparatus for downlink resource allocation in an orthogonal frequency division multiplexing communication system
CN108631987B (en) Method and device for processing reference signal
JP6018649B2 (en) Resource allocation signaling scheme to adjust the density in cellular multi-carrier systems
RU2556883C2 (en) Method and apparatus for reconfiguring mapping of carrier indicator field to component carrier
US8848682B2 (en) Method for sub-channelization and resource mapping of wireless resources
CN110583071B (en) Method for receiving downlink signal in wireless communication system and terminal using the same
KR20190105227A (en) Methods, apparatuses, and systems for transmitting and receiving reference signals and data channels in wireless communication systems
CN111567117A (en) Resource allocation method, device and system for wireless communication system
US11632222B2 (en) Telecommunications apparatus and methods
US11902193B2 (en) Search space configuration for short transmission time interval
US8391173B2 (en) Method and apparatus for radio resource allocation in an orthogonal frequency division multiplexing communication system
CN109906654B (en) Wireless resource allocation system and method
CN116234032A (en) PUCCH resource allocation processing method, device, processor and storage medium for improving concurrence number of users per TTI of cell
KR20100095129A (en) Method and apparatus for signaling channel resource allocation information in wireless communication system
CN116938416A (en) Wireless communication method and related equipment

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