CN108093483A - Multi-subscriber dispatching and resource allocation process method and system in extensive antenna system - Google Patents
Multi-subscriber dispatching and resource allocation process method and system in extensive antenna system Download PDFInfo
- Publication number
- CN108093483A CN108093483A CN201711436254.8A CN201711436254A CN108093483A CN 108093483 A CN108093483 A CN 108093483A CN 201711436254 A CN201711436254 A CN 201711436254A CN 108093483 A CN108093483 A CN 108093483A
- Authority
- CN
- China
- Prior art keywords
- matched group
- resource block
- resource
- piecemeal
- joint
- 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.)
- Granted
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W72/00—Local resource management
- H04W72/50—Allocation or scheduling criteria for wireless resources
- H04W72/53—Allocation or scheduling criteria for wireless resources based on regulatory allocation policies
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04B—TRANSMISSION
- H04B7/00—Radio transmission systems, i.e. using radiation field
- H04B7/02—Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas
- H04B7/04—Diversity systems; Multi-antenna system, i.e. transmission or reception using multiple antennas using two or more spaced independent antennas
- H04B7/0413—MIMO systems
- H04B7/0452—Multi-user MIMO systems
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
The present invention provides multi-subscriber dispatching and resource allocation process method in a kind of extensive antenna system, including：According to the measure definitions of system, corresponding metric matrix is calculated；According to metric matrix, according to the measurement maximum principle between single resource block and single matched group, a matched group is selected for each resource block；Determine the matched group of local optimum and the joint of resource block；Match group selection resource block；Screen feasible matched group；Whether the whole resource blocks of detection are assigned, if being assigned, are transferred to next step, into the metric matrix that construction is new if unallocated finish；Construct new metric matrix；It repeats the above steps until whole resource blocks are assigned；Export the mapping relations of resource block and user's matched group.The present invention proposes the technology of user's pairing and resource allocation Combined Treatment, while may be selected in entire user group to carry out Combined Treatment in space and allowable resource space, can be obtained with limited implementation complexity than the prior art more preferably performance.
Description
Technical field
The invention belongs to wireless communication technology fields, and in particular to multi-subscriber dispatching and money in a kind of extensive antenna system
Source allocation processing method and system.
Background technology
In 5G communication systems, the extensive multiple antennas configuration of base station end generally use may be used also while antenna gain is obtained
Multiple users to be supported to be carried out at the same time signal transmission.But since the size of terminal device limits, the antenna number of usual terminal configuration
It is very limited.Therefore, in order to improve the transmission rate of user, usually in a time slot scheduling, multiple user's compositions one are dispatched
A matched group carries out concurrent transmission on identical running time-frequency resource.How to dispatch user and form suitable matched group, be system reality
One of problem needed to be considered during now.
Further, since the finiteness of running time-frequency resource, in each time slot scheduling, in addition to the selection of above-mentioned user's matched group,
Also need to be required according to system metrics (measure definitions can be transmission rate, system energy efficiency, user fairness or more than certain
Weighted array of several measurements etc.), the resource distribution mode of design optimization, by limited transfer resource in multiple users or user
Reasonable distribution is carried out between matched group, to obtain optimal or suboptimum the system performance under certain Measure Indexes.
For the demand, in traditional multiaerial system, there are some specific distribution methods, but applied to big rule
During mould multiaerial system, there is certain limitation, for example, scalability, complexity, performance of method etc. in some aspects.
The content of the invention
In view of the foregoing deficiencies of prior art, it is an object of the invention to provide more in a kind of extensive antenna system
User dispatches and the combination treatment method of resource allocation, and this method in entire user group by may be selected space and resource space simultaneously
Interior carry out Combination selection can be obtained than the prior art more preferably performance.
In order to achieve the above objects and other related objects, the present invention provides multi-subscriber dispatching in a kind of extensive antenna system
With resource allocation process method, the described method comprises the following steps：S1 calculates corresponding measurement square according to the measure definitions of system
Battle array, the element value of metric matrix are metric when single resource block distributes to single matched group；S2 is pressed according to metric matrix
According to the measurement maximum principle between single resource block and single matched group, a matched group is selected for each resource block；S3 is determined
The matched group of local optimum and the joint of resource block；S4 obtains corresponding part most for the matched group of local optimum
Excellent resource block piecemeal simultaneously empties other resource blocks；Users of the S5 in different matched groups cannot have the requirement of repetition, will
Other matched groups for having non-zero same subscriber with local optimum matched group are rejected from entire matched group space, remaining pairing
Group echo is feasible matched group；Whether the whole resource blocks of S6 detections are assigned, if being assigned, are transferred to step S9, if
It is unallocated to finish, enter step S7；S7 constructs new metric matrix, and construction rule is：Retain it is last round of in do not have pairing money
The corresponding whole elements of source block, the corresponding whole elements of feasible matched group during reservation is last round of；S8 repeat step S2~S6 until
Whole resource blocks are assigned；S9 exports the mapping relations of resource block and user's matched group, is combined dispatching result.
Preferably, the matched group of the definite local optimum and combining for resource block specifically include：Calculate matched group and money
The joint measure value of source block；Compare the joint measure value of each matched group and resource block；Wherein maximum combined metric is corresponding
Labeled as the matched group of local optimum and the joint of resource block, matched group is local optimum matched group, is provided for matched group and resource block
Source block is the resource block of local optimum.
Preferably, the joint measure value of the calculating matched group and resource block specifically includes：If matched group is assigned to single
Resource block, then the joint measure value of matched group and the resource block is the element that the resource block distributes to the matched group in metric matrix
Value；If matched group is assigned to multiple resource blocks, multiple resource blocks are divided into the piecemeal of multiple resource blocks；Matched group and resource
The joint measure value of block piecemeal is that the single or multiple resource blocks from resource block piecemeal distribute to the matched group in metric matrix
Element value or the sum of element value.
Preferably, the screening technique of feasible matched group is：User in different matched groups cannot have the requirement of repetition,
Other matched groups for having non-zero same subscriber with local optimum matched group are rejected from entire matched group space, it is remaining to match somebody with somebody
It is feasible matched group to group.
Preferably, the matched group of the N+1 times definite local optimum and specifically include combining for resource block piecemeal：Calculate pairing
The joint measure value of group and resource block；Compare the joint measure value of each matched group and resource block；If maximum combined metric pair
The matched group and resource block answered meet the resource allocation constraint of system, then corresponding matched group and resource block are labeled as part most
Excellent matched group and the joint of resource block, matched group are local optimum matched group, and resource block is the resource block of local optimum；If most
The corresponding matched group of joint measure value and resource block are discontented with the resource allocation constraint of pedal system greatly, if the matched group and resource block point
The joint measure value of block is more than the joint measure value of other matched groups and resource block piecemeal for hindering resource allocation, then system makes
The resource block of resource allocation is hindered to make the selection for meeting system resource allocation again；Maximum combined measurement after reselecting
It is worth corresponding matched group and resource block labeled as the matched group of local optimum and the joint of resource block, matched group is matched somebody with somebody for local optimum
To group, resource block is the resource block of local optimum；Otherwise, the matched group and resource corresponding to the maximum joint measure value are rejected
The joint of block piecemeal, judges the joint of remaining matched group and resource block successively, and wherein N is the integer more than or equal to 1.
Preferably, if the matched group has obtained one or more resource block, by newly assigned resource block
The piecemeal for being divided into multiple resource blocks together with acquired resource block specifically includes：If resource block piecemeal contains the matched group
Acquired resource block then rejects the acquired resource block of matched group from the resource block piecemeal, forms new resource block point
Block；The joint measure value of matched group and the new resource block piecemeal is from the single or more of the resource block piecemeal in metric matrix
A resource block distributes to the sum of element value or element value of the matched group；It is acquired that if resource block piecemeal does not include the matched group
Resource block, then the joint measure value of matched group and resource block piecemeal is single or multiple in resource block piecemeal to be come from metric matrix
Resource block distributes to the sum of element value or element value of the matched group.
In order to achieve the above objects and other related objects, the present invention provides multi-user's tune in also a kind of extensive antenna system
Degree and resource allocation process system, the system include：Metric matrix builds module, for the measure definitions according to system, calculates
Corresponding metric matrix, the element value of metric matrix are metric when single resource block distributes to single matched group；Resource
Block distribution module, for being every according to the measurement maximum principle between single resource block and single matched group according to metric matrix
A resource block selects a matched group；The joint determining module of matched group and resource block, for determining the matched group of local optimum
With the joint of resource block；Feasible matched group mark module, cannot there is the requirement of repetition for the user in different matched groups,
Other matched groups for having non-zero same subscriber with local optimum matched group are rejected from entire matched group space, it is remaining to match somebody with somebody
It is feasible matched group to group echo；Resource block distributes detection module, for detecting whether whole resource blocks are assigned；Mapping
Relation output module is combined dispatching result for exporting the mapping relations of resource block and user's matched group.
In order to achieve the above objects and other related objects, the present invention also provides a kind of Combined Treatment terminal, including processor
And memory, the memory storage have program instruction, foregoing extensive antenna is realized in the processor operation program instruction
Multi-subscriber dispatching and resource allocation process method in system.
In order to achieve the above objects and other related objects, the present invention also provides a kind of storage medium, it is stored thereon with calculating
Machine program, which is characterized in that the computer program realizes multi-user in foregoing extensive antenna system when being executed by processor
Scheduling and resource allocation process method.
As described above, multi-subscriber dispatching and resource allocation process method in a kind of extensive antenna system of the present invention, tool
There is following advantageous effect：In view of the deficiencies of the prior art, the present invention proposes a kind of user's pairing and resource allocation Combined Treatment
Technology, while may be selected in entire user group to carry out Combined Treatment in space and allowable resource space, it can be with limited reality
Existing complexity is obtained than the prior art more preferably performance.
Description of the drawings
Fig. 1 is shown as the schematic diagram of extensive antenna system of the invention.
Fig. 2 is shown as multi-subscriber dispatching and resource allocation process method flow in a kind of extensive antenna system of the present invention
Figure.
Specific embodiment
Illustrate embodiments of the present invention below by way of specific specific example, those skilled in the art can be by this specification
Disclosed content understands other advantages and effect of the present invention easily.The present invention can also pass through in addition different specific realities
The mode of applying is embodied or practiced, the various details in this specification can also be based on different viewpoints with application, without departing from
Various modifications or alterations are carried out under the spirit of the present invention.It should be noted that in the case where there is no conflict, following embodiment and implementation
Feature in example can be mutually combined.
It should be noted that the diagram provided in following embodiment only illustrates the basic structure of the present invention in a schematic way
Think, then only the display component related with the present invention rather than component count, shape and size during according to actual implementation in schema
It draws, kenel, quantity and the ratio of each component can be a kind of random change during actual implementation, and its assembly layout kenel
It is likely more complexity.
In extensive world system, base station side usually configures up to a hundred antennas, and receiving terminal is due to size and power consumption etc.
Reason usually configures few root or several antennas.In order to which the spatial reuse that the extensive aerial band of base station side is made full use of increases
It benefit and promotes the factors such as transmission rate of user and considers, it is necessary to preferably suitable user forms matched group from multiple users,
Realize the concurrent transmission of multi-user.In addition, in order to transfer resource it is limited, it is necessary to reasonably by transfer resource multiple matched groups it
Between be allocated, therefore system realize when, it is necessary to consider simultaneously user scheduling and resource allocation two fold problem.
In having method, main exemplary process includes：Traverse user and resource；User couple and money are selected stage by stage
Source；Combination selection user couple and resource.The feature of the lower existing treatment technology of surface analysis：
1) traverse user and resource.This method, to all possible user's matching method and all possible resource point
It is traveled through with mode, and calculates the system metric value in the case of each traversal.The matched group and resource allocation of metric maximum
Mode corresponds to final allocation result.It is clear that this method is theoretical optimal, but with the increasing of number of users and number of resources
Add, the implementation complexity trend in exponential increase of this method, therefore complexity is very high, realizes difficult.
2) user couple and resource are selected stage by stage.Such as document [H.Zhao, S.Ma, F.Liu, and Y.Tang, " A
Jointed Resource Allocation and Multiuser Pairing Algorithm with Low
Complexity for SC-FDMA Systems,”Wireless Personal Commun.,no.79,pp.2227-2236,
2014.] RA-MP methods and document [C.Wu, L.Chen the and G.Wei, " Joint User Pairing and mentioned in
Resource Allocation for Virtual MIMO in Uplink SC-FDMA System,”in Proc.WCSP,
Hangzhou, pp.1-6,2013.] in the FuF methods mentioned, using first determine successively in user couple first user and its
The distribution of resource piecemeal, the method for determining each pairing user under measure definitions criterion again afterwards.This method is realized relatively simple
It is single, but to cannot keep system performance optimal for phase in process.RA_MP the and FuF methods carried simultaneously in document are only applicable in
Situation when it is 2 that user is with logarithm, the other algorithm for design of needs in the case of being more than 2.
3) Combination selection user couple and resource.Combination selection is carried out to user's matched group and resource, can be obtained higher
System performance.Document [C.Wu, L.Chen and G.Wei, " Joint User Pairing and Resource
Allocation for Virtual MIMO in Uplink SC-FDMA System,”in Proc.WCSP,Hangzhou,
Pp.1-6,2013. the SubOpt methods proposed in] just belong to such method.This method is in it can entirely match user group set
Matched group is selected, but when selecting resource piecemeal, in order to simplify algorithm, only selects 1 resource piecemeal every time.Hence for more
The co-allocation situation of a resource piecemeal has certain loss in performance.Such method complexity 2) class method higher than above-mentioned the, but
Performance is generally more excellent.In addition, such method is suitable for user with the situation that logarithm is arbitrary value.
In a kind of extensive antenna system of the present invention 3) multi-subscriber dispatching and resource allocation process method belong to
Class, but unlike SubOpt methods, this method may be selected to be joined in space and resource space in entire user group simultaneously
Selection is closed, therefore is better than prior art from performance.
System block diagram is as shown in Figure 1.In base station (BS) coverage, there are multiple active users (UE), Mei Geyong
The channel status of family to base station is random.Base station needs to select one group or several groups of user's matched groups from multiple any active ues, carries out
The concurrent transmission of signal.In addition, the transfer resource of base station is finite value, for the sake of convenient, below with reference to current wireless communication system
In resource block (RB, Resource block) define resource format.Base station needs to distribute to limited a resource block suitably
Match user.The method of salary distribution instructs the performance metric that target is system, which can be transmission rate, system energy
Weighted array of effect, user fairness or certain upper several measurement etc..
Referring to Fig. 2, the present invention proposes a kind of method for distributing user's matched group and resource block to Combined Treatment, this method
By may be selected to carry out Combination selection in space and resource space simultaneously in entire user group, can obtain more excellent than the prior art
Performance.Specific steps are described as follows：
S1 calculates corresponding metric matrix, the element value of metric matrix is single resource according to the measure definitions of system
Block distributes to metric during single matched group；
S2 is according to metric matrix, according to the measurement maximum principle between single resource block and single matched group, for each money
Source block selects a matched group；
S3 determines the matched group of local optimum and the joint of resource block；
S4 obtains the resource block piecemeal of corresponding local optimum and empties other for the matched group of local optimum
Resource block；
Users of the S5 in different matched groups cannot have the requirement of repetition, will there is non-zero phase with local optimum matched group
Other matched groups with user are rejected from entire matched group space, and remaining matched group is labeled as feasible matched group；
Whether the whole resource blocks of S6 detections are assigned, if being assigned, are transferred to step S9, if unallocated finish into
Enter step S7；
S7 constructs new metric matrix, and construction rule is：Retain it is last round of in do not have pairing the corresponding whole of resource block
Element, the corresponding whole elements of feasible matched group during reservation is last round of；
S8 repeats step S2~S6 until whole resource blocks are assigned；
S9 exports the mapping relations of resource block and user's matched group, is combined dispatching result.
In view of the deficiencies of the prior art, a kind of method that the present invention proposes user's pairing and resource allocation Combined Treatment, together
When may be selected to carry out Combined Treatment in space and allowable resource space in entire user group, can be with limited implementation complexity
It obtains than the prior art more preferably performance.
The present invention will be described with specific content for the present embodiment below.The present embodiment carried out twice resource block with matching somebody with somebody
Two-way choice to group.
Step 1. initial phase.According to the measure definitions of system, corresponding metric matrix, the element of metric matrix are calculated
Value distributes to metric during single matched group for single resource block.For example, if resource block total number is Nrb, Yong Hupei
To a total of N of modeueA possibility a, then N can be usedrbRow, Nue(i.e. matrix dimensionality is the matrix of row：Nrb×Nue)
Represent metric matrix, the i-th row jth column element of matrix represents measurement when i-th of resource block distributes to j-th of matched group
Value, wherein i are no more than NrbPositive integer, j be no more than NuePositive integer.
Step 2. starts first round two-way choice.
2.1 resource blocks select matched group.According to the metric matrix of aforementioned definitions, according to single resource block and single matched group
Between measurement maximum principle, for each resource block select a matched group.After the completion of selection, each matched group will be assigned to or
Zero or one or multiple resource blocks.
2.2 determine the joint of the matched group of local optimum and resource block piecemeal
1) the joint measure value of matched group and resource block piecemeal is calculated：
1-1：If matched group is assigned to the connection of single resource block, matched group and the resource block piecemeal (i.e. single resource block)
Right magnitude is the element value that the resource block distributes to the matched group in metric matrix.
1-2:If matched group is assigned to multiple resource blocks, multiple resource blocks are divided into the piecemeal of multiple resource blocks, are made
The piecemeal of each resource block each meets the resource allocation constraints of system, but the joint of resource block and be unsatisfactory for one another
The resource allocation constraints of system.The joint measure value of matched group and resource block piecemeal is from resource block point in metric matrix
The single or multiple resource blocks of block distribute to the sum of element value or element value of the matched group.
2) more each matched group and resource block piecemeal joint measure value, the wherein corresponding matched group of maximum and resource block
Piecemeal is labeled as the matched group of local optimum and the joint of resource block piecemeal.In addition, by matched group therein labeled as part most
Excellent matched group；Correspondingly, the resource block piecemeal of local optimum is marked.
2.3 pairing group selection resource blocks
1) for the matched group of local optimum, by the resource block piecemeal for obtaining corresponding local optimum and it is emptied
His resource block.
2) for other matched groups, its resource block being assigned to is emptied.
The 2.4 feasible matched groups of screening
User in different matched groups cannot have the requirement of repetition, will have the non-zero identical with local optimum matched group
Other matched groups of user are rejected from entire matched group space, and remaining matched group is labeled as feasible matched group.
If after step 2, whole resource blocks are assigned, then are transferred to step 5
Step 3. starts the second wheel two-way choice.
The new metric matrix of 3.1 constructions, construction rule are not have the corresponding whole of resource block of pairing during reservation is last round of
Element, the corresponding whole elements of feasible matched group during reservation is last round of.With the N to illustrate in step 1rb×NueExemplified by metric matrix,
Newly the make of metric matrix is：On the basis of original matrix, retain the corresponding whole row elements of resource block without matching, protect
Stay the corresponding whole column elements of feasible matched group.
3.2 resource blocks select matched group.According to new metric matrix, according between single resource block and single matched group
The maximum principle of measurement, a matched group is selected for each resource block.After the completion of selection, the pairing that is remained in each previous round
Group obtains new distribution or zero or one or multiple resource blocks.
3.3 determine the joint of the matched group of local optimum and resource block piecemeal.
1) if matched group takes turns when selection starts and has obtained one or more resource block herein, by newly assigned money
Source block and acquired resource block are divided into the piecemeal of multiple resource blocks together so that the piecemeal of each resource block, which each meets, is
The resource allocation constraints of system, but the joint of resource block and it is unsatisfactory for the resource allocation constraints of system one another.
If 3.3.1-1 resource block piecemeal contains the acquired resource block of the matched group, by the acquired money of matched group
Source block is rejected from the resource block piecemeal, forms new resource block piecemeal.The joint degree of matched group and the new resource block piecemeal
Measure the element value or element that the matched group is distributed to for the single or multiple resource blocks from the resource block piecemeal in metric matrix
The sum of value.
3.3.1-2 if resource block piecemeal does not include the acquired resource block of the matched group, matched group and resource block piecemeal
Joint measure value for single or multiple resource blocks distribute to the element of the matched group in resource block piecemeal in metric matrix
The sum of value or element value.
2) if matched group takes turns when selection starts and do not obtain any resource block herein, calculated according to the description in step 2.2
The joint measure value of the matched group and resource block piecemeal.
3) the joint measure value of more each matched group and resource block piecemeal
If 3.3.3-1 the corresponding matched group of maximum and resource block piecemeal combine the resource allocation constraint for meeting system,
Then it is marked as the matched group of local optimum and the joint of resource block piecemeal.As step 2.2, matching somebody with somebody for local optimum is marked
To the resource block piecemeal of group and local optimum.
3.3.3-2 if the resource allocation of the discontented pedal system of the joint of the corresponding matched group of maximum and resource block piecemeal is about
Beam, but compared with other matched groups for hindering its resource allocation satisfiability with combining for resource block piecemeal, the matched group
It is more excellent with the joint of resource block resource piecemeal, then it is transferred to step 3.4.In addition, the matched group and resource block piecemeal resource will be destroyed
The resource block piecemeal that the matched group and resource block piecemeal of distribution satisfiability are respectively labeled as the matched group of obstruction and hinder, and incite somebody to action
The matched group and resource block piecemeal are labeled as promising to be the matched group of local optimum and the joint of resource block.
3.3.3-3 otherwise, the joint of the maximum matched group and resource block piecemeal will be rejected, re-executes step 3.3.
3.4 pairing group selection resource blocks
1) if step 3.3 obtains being the matched group of local optimum and the joint of resource block piecemeal, performed according to step 2.3
Match the operation of group selection resource block
If 2) step 3.3 obtain be the matched group and resource block piecemeal that promise to be local optimum joint.
3.4.2-1 the resource block that all matched groups are assigned to is emptied.
3.4.2-2, the resource block piecemeal hindered in metric matrix is assigned to the matched group pair for promising to be local optimum
The element answered is set to a very big value, and is transferred to step 3.2.
The 3.5 feasible matched groups of screening.Feasible matched group is screened according to step 2.4.
If step 4. by step 2 and step 3, still there is still unappropriated resource block, then and so on, according to step 3
Mode, continue more wheel selections, until whole resource blocks are assigned.
Step 5. exports the mapping relations of resource block and user's matched group, is combined dispatching result.
Particularly, during carrying in said program is measured relatively, if there are multiple identical maximums, selected at random
It selects.
It elaborates below to the embodiment of the present invention, the present embodiment is carried out lower based on the technical solution of the present invention
Implement, give detailed embodiment and specific operating process, but protection scope of the present invention is not limited to following implementation
Example.
In this example, it is assumed that the resource allocation constraints of system is to distribute to each user or each matched group
Resource block must be continuous, system performance metric is defined as rate.Assuming that the active users in system are 4, i.e. Nue=
4；Every 2 users are made into one group in transmission process；Available resource block number is 8, i.e. Nrb=8.Convenient, 4 use for subsequent descriptions
Family is referred to respectively with U1, U2, U3, U4, and 8 continuous resource blocks are represented respectively with R1, R2, R3, R4, R5, R6, R7 and R8.
Based on above-mentioned it is assumed that matching method between user, which amounts to, 6 kinds of possible modes, i.e. { U1, U2 }, { U1, U3 }, { U1, U4 },
{U2,U3},{U2,U4},{U3,U4}；It is convenient for subsequent descriptions, it is represented individually below with P1, P2, P3, P4, P5, P6 correspondence
State 6 matched groups.The purpose operated below be by it is a kind of preferably in a manner of complete the two-way choice of combinations of pairs resource block, that is, determine
Surely above-mentioned which or which matched group is selected, while 8 resource blocks are distributed into selected matched group.
Specific implementation steps are given below in the step of according to described in aforementioned schemes.
Step 1：Initialization.It is defined according to system metrics, calculates metric when R1~R8 distributes to P1~P6 respectively, obtain
Assume that result of calculation is to the metric matrix of one 8 × 6, in the present embodiment：
The row of matrix represents the index of resource block, and matrix column represents the index of matched group, and the element value of matrix represents
Corresponding resource block distributes to the metric that corresponding matched group is.It illustrates：The first column element of the first row value is 6, is represented, money
Performance metric when source block R1 distributes to matched group P1 is 6, and the meaning of other elements value is analogized in matrix.
Step 2：First time two-way choice.
Step 2.1：Resource block selects matched group.According to metric matrix (1), according to single resource block and single matched group it
Between measurement maximum principle, for each resource block select a matched group.By taking R1 as an example, it is respectively allocated to matched group P1~P6's
When metric be matrix the first row { 6,5,2,2,3,4 }, wherein maximum is 6, therefore R1 distributes to matched group P1；Class successively
It pushes away, R2, R3, R4, R5, R6, R7, R8 is respectively allocated to matched group P2, P2, P1, P6, P3, P5, P5.
After the completion of selection, matched group P1 obtains 2 resource blocks { R1, R4 }；Matched group P2 obtains 2 resource blocks { R2, R3 }；
Matched group P3 obtains 1 resource block { R6 }；Matched group P4 obtains zero resource block；2 resource blocks of matched group P5 acquisitions R7,
R8}；Matched group P6 obtains 1 resource block { R5 }.
Step 2.2：Determine the matched group of local optimum and the joint of resource block piecemeal
Matched group P1 is assigned to 2 resource blocks { R1, R4 }, the two resource blocks are segmented into two resource block piecemeals { R1 }
{ R4 } so that each meet system resource allocation constraint, but combine and be unsatisfactory for system resource allocation constraint.Then matched group and money
The measurement of the joint { P1, R1 } of source block piecemeal distributes to the element value of P1 for R1 in metric matrix, i.e., and 6；And matched group and resource
The measurement of the joint { P1, R4 } of block piecemeal is 9.Matched group P2 is assigned to 2 resource blocks { R2, R3 }, the two resource blocks can be with
It is divided into a resource block sub-block { R2, R3 }.Therefore, the measurement of the joint of matched group and resource block piecemeal { P2, R2, R3 } is measurement
R2 in matrix, R3 distribute to the sum of element value of P2, i.e. 8+9=17.And so on, the joint of matched group and resource block piecemeal
The measurement of { P3, R6 } is 8, and the measurement of the joint { P5, R7, R8 } of matched group and resource block piecemeal is 7+8=15, matched group and money
The measurement of the joint { P6, R5 } of source block piecemeal is 8.
Therefore, the joint of the matched group of local optimum and resource block piecemeal is { P2, R2, R3 } in epicycle, and metric is
17.The matched group of local optimum is P2, and the resource block piecemeal of local optimum is { R2, R3 }.
Step 2.3：Match group selection resource block
Local optimum matched group P2 obtains local optimum resource block piecemeal { R2, R3 }, empties P1, P3, P4, P5, P6 are at this
Take turns the resource block being assigned to.
Step 2.4：Screen feasible matched group
Since matched group P1, P3, P4, P6 and P2 have same subscriber, therefore remaining { P2, P5 } is feasible matched group.
To sum up, in step 2, selection result is：Matched group P2 obtains 2 resource blocks { R2, R3 }；Unappropriated resource block
For { R1, R4, R5, R6, R7, R8 }；Feasible matched group is { P2, P5 }.
Step 3：Second wheel selection
Step 3.1：Construct new metric matrix
Isosorbide-5-Nitrae in foregoing metric matrix (1), 5,6,7,8 rows, 6 × 2 measurement square of the 2nd, 5 row composition epicycle selection
Battle array is as follows
Step 3.2：Resource block selects matched group
According to new metric matrix (2) and the selection method, obtaining selection result is：Matched group P2 is assigned to 3 moneys
Source block { R1, R5, R6 }；Matched group P5 is assigned to 3 resource blocks { R4, R7, R8 }.
Step 3.3：Determine the matched group of local optimum and the joint of resource block piecemeal
Matched group P2 is newly assigned with 3 resource blocks { R1, R5, R6 }, in addition acquired 2 resource blocks { R2, R3 }, share
5 resource blocks { R1, R2, R3, R5, R6 }.This 5 resource blocks can be divided into 2 resource block piecemeals altogether：{ R1, R2, R3 } and R5,
R6}.Acquired resource block { R2, R3 } is contained in resource block piecemeal { R1, R2, R3 }, { R2, R3 } is rejected and forms new resource
Block { R1 }.The measurement of the joint of matched group and resource block piecemeal { P2, R1 } is 5, and the joint of matched group and resource block piecemeal
The measurement of { P2, R5, R6 } is 6+6=12.And so on, the measurement of the joint { P5, R4 } of matched group and resource block is 8；Pairing
The measurement of group and the joint { P5, R7, R8 } of resource block is 7+8=15.
Compare the joint measure value of each matched group and resource block.Maximum is 15, corresponds to matched group and resource block point
The joint of block together, meets the resource of system for { P5, R7, R8 } and the joint of matched group and resource block piecemeal { P2, R2, R3 }
Assignment constraints.Therefore, the joint of the matched group of local optimum and resource block piecemeal is { P5, R7, R8 } in epicycle, and metric is
15.The matched group of local optimum is P5, and the resource block piecemeal of local optimum is { R7, R8 }.
Step 3.4：Match group selection resource block
Because step 3.3 obtains being the matched group of local optimum and the joint of resource block piecemeal, first directly according to
Step 2.3 carries out selection of the matched group to resource block.As a result obtain resource block { R7, R8 } for matched group P5 and empty other moneys
Source block { R4 }；Matched group P2 empties the resource block { R1, R5, R6 } that this wheel is assigned to.
Step 3.5：Screen feasible matched group.
There are not other matched groups of duplicate customer in epicycle with the matched group of local optimum, so feasible matched group is kept
It is constant.
To sum up, in step 3, selection result is：Matched group P5 obtains resource block { R7, R8 }；Unappropriated resource block
Not { R1, R4, R5, R6 }；Feasible matched group is { P2, P5 }.
Step 4：The selection more taken turns
Third round selects
Step 4.1. constructs new metric matrix.Isosorbide-5-Nitrae in foregoing metric matrix (1), 5,6 rows, the 2nd, 5 row composition is originally
6 × 2 metric matrix for taking turns selection is as follows
Step 4.2. resource blocks select matched group
According to new metric matrix (3) and the selection method, obtaining selection result is：Matched group P2 is assigned to 3 moneys
Source block { R1, R5, R6 }；Matched group P5 is assigned to 3 resource blocks { R4 }.
Step 4.3. determines the matched group of local optimum and the joint of resource block piecemeal
Matched group P2 is newly assigned with 3 resource blocks { R1, R5, R6 }, in addition acquired 2 resource blocks { R2, R3 }, share
5 resource blocks { R1, R2, R3, R5, R6 }.This 5 resource blocks can be divided into 2 resource block piecemeals altogether：{ R1, R2, R3 } and R5,
R6}.Acquired resource block { R2, R3 } is contained in resource block piecemeal { R1, R2, R3 }, { R2, R3 } is rejected and forms new resource
Block { R1 }.The measurement of the joint of matched group and resource block piecemeal { P2, R1 } is 5, and the joint of matched group and resource block piecemeal
The measurement of { P2, R5, R6 } is 6+6=12.And so on, the measurement of the joint { P5, R4 } of matched group and resource block is 8.
Compare the joint measure value of each matched group and resource block.Maximum is 12, corresponds to matched group and resource block point
The joint of block is { P2, R5, R6 } and the joint of matched group and resource block piecemeal { P2, R2, R3 } is together, is discontented with the money of pedal system
Source assignment constraints, because the satisfiability of system resource allocation is paired group and the joint { P5, R4 } of resource block hinders.Compare
The measurement of { P2, R5, R6 } and { P5, R4 }, { P2, R5, R6 } are more excellent, thus { P2, R5, R6 } for promise to be it is local most
Excellent matched group and the joint of resource block, and { P5 } is the matched group hindered, { R4 } is the resource block hindered.
Step 4.4. matches group selection resource block
{ P2, R5, R6 } is the connection of the matched group and resource block that promise to be local optimum because obtained in the previous step
It closes, so empty the resource block that all matched groups are assigned to, and by the joint of the matched group hindered in metric matrix and resource block
Element corresponding to { P5, R4 } is set to infinity.
Step 4.5. resource blocks reselect matched group
According to new metric matrix (4) and the selection method, obtaining selection result is：Matched group P2 is assigned to 4 moneys
Source block { R1, R4, R5, R6 }；Matched group P5 does not assign to resource block.
Step 4.6. determines the matched group of local optimum and the joint of resource block piecemeal
Matched group P2 is newly assigned with 4 resource blocks { R1, R4, R5, R6 }, in addition acquired 2 resource blocks { R2, R3 },
Share 6 resource blocks { R1, R2, R3, R4, R5, R6 }.This 6 resource blocks can be divided into 1 resource block piecemeal altogether：{R1,R2,
R3,R4,R5,R6}.Acquired resource block { R2, R3 } is contained in the resource block piecemeal, { R2, R3 } is rejected and forms new money
Source block { R1, R4, R5, R6 }.The measurement of the joint of matched group and resource block piecemeal { P2, R1, R4, R5, R6 } is 5+2+6+6=
19.Due to the joint of no other matched groups and resource block piecemeal, and the joint of the matched group and resource block piecemeal meets system
Resource allocation of uniting constraint, so the matched group of local optimum and resource block piecemeal are { P2, R1, R4, R5, R6 }, local optimum
Matched group is { P2 }, and the resource block of local optimum is { R1, R4, R5, R6 }.
Step 4.7. matches group selection resource block
Because { P2, R1, R4, R5, R6 } obtained in the previous step is the matched group of local optimum and the joint of resource block, therefore
Matched group P2 obtains resource block { R1, R4, R5, R6 }.
To sum up, in step 4, selection result is：Matched group P2 obtains resource block { R1, R4, R5, R6 }；Do not divide
The resource block matched somebody with somebody.
So far, whole resource blocks are assigned.
The present embodiment also proposes multi-subscriber dispatching and resource allocation process system, the system in a kind of extensive antenna system
Including：
Metric matrix builds module, for the measure definitions according to system, calculates corresponding metric matrix, metric matrix
Element value distributes to metric during single matched group for single resource block；
Resource block distribution module, for according to metric matrix, according to the measurement between single resource block and single matched group
Maximum principle selects a matched group for each resource block；
The joint determining module of matched group and resource block, for determining the joint of the matched group of local optimum and resource block；
Feasible matched group mark module, cannot there is the requirement of repetition for the user in different matched groups, will be with office
Other matched groups that the optimal matched group in portion has non-zero same subscriber are rejected from entire matched group space, remaining matched group mark
It is denoted as feasible matched group；
Resource block distributes detection module, for detecting whether whole resource blocks are assigned；
Mapping relations output module is combined dispatching knot for exporting the mapping relations of resource block and user's matched group
Fruit.
In view of the deficiencies of the prior art, the method for a kind of user pairing proposed by the present invention and resource allocation Combined Treatment and
System, while may be selected in entire user group to carry out Combined Treatment in space and allowable resource space, it can be with limited reality
Existing complexity is obtained than the prior art more preferably performance.
In this present embodiment, the present embodiment also provides a kind of Combined Treatment terminal, described to deposit including processor and memory
Reservoir has program stored therein instruction, and multi-subscriber dispatching in foregoing extensive antenna system is realized in the processor operation program instruction
With resource allocation process method.
In this present embodiment, the present embodiment also provides a kind of storage medium, is stored thereon with computer program, and feature exists
It is realized in, the computer program when being executed by processor in foregoing extensive antenna system at multi-subscriber dispatching and resource allocation
Reason method.
The above-described embodiments merely illustrate the principles and effects of the present invention, and is not intended to limit the present invention.It is any ripe
Know the personage of this technology all can carry out modifications and changes under the spirit and scope without prejudice to the present invention to above-described embodiment.Cause
This, those of ordinary skill in the art is complete without departing from disclosed spirit and institute under technological thought such as
Into all equivalent modifications or change, should by the present invention claim be covered.
Claims (9)
1. multi-subscriber dispatching and resource allocation process method in a kind of extensive antenna system, which is characterized in that the method bag
Include following steps：
S1 according to the measure definitions of system, calculates corresponding metric matrix, the element value of metric matrix is single resource block point
Metric during the single matched group of dispensing；
S2 is each resource block according to the measurement maximum principle between single resource block and single matched group according to metric matrix
Select a matched group；
S3 determines the matched group of local optimum and the joint of resource block；
S4 for the matched group of local optimum, obtains the resource block piecemeal of corresponding local optimum and empties others
Resource block；
S5, the user in different matched groups cannot have the requirement of repetition, will have the non-zero identical with local optimum matched group
Other matched groups of user are rejected from entire matched group space, and remaining matched group is labeled as feasible matched group；
S6, detects whether whole resource blocks are assigned, if being assigned, is transferred to step S9, enters if unallocated finish
Step
S7；
S7, constructs new metric matrix, and construction rule is：Retain it is last round of in do not have pairing resource block it is corresponding all member
Element, the corresponding whole elements of feasible matched group during reservation is last round of；
S8 repeats step S2~S6 until whole resource blocks are assigned；
S9 exports the mapping relations of resource block and user's matched group, is combined dispatching result.
2. multi-subscriber dispatching and resource allocation process method in a kind of extensive antenna system according to claim 1,
It is characterized in that, the matched group of the definite local optimum and combining for resource block specifically include：
Calculate the joint measure value of matched group and resource block；
Compare the joint measure value of each matched group and resource block；The wherein corresponding matched group of maximum combined metric and resource block
The joint of matched group and resource block labeled as local optimum, matched group are local optimum matched group, and resource block is local optimum
Resource block.
3. multi-subscriber dispatching and resource allocation process method in a kind of extensive antenna system according to claim 2,
It is characterized in that, the joint measure value of the calculating matched group and resource block specifically includes：
If matched group is assigned to single resource block, the joint measure value of matched group and the resource block is the resource in metric matrix
Block distributes to the element value of the matched group；
If matched group is assigned to multiple resource blocks, multiple resource blocks are divided into the piecemeal of multiple resource blocks；Matched group and money
The joint measure value of source block piecemeal is that the single or multiple resource blocks from resource block piecemeal distribute to the pairing in metric matrix
The sum of element value or element value of group.
4. multi-subscriber dispatching and resource allocation process method in a kind of extensive antenna system according to Claims 2 or 3,
It is characterized in that, the screening technique of feasible matched group is：User in different matched groups cannot have the requirement of repetition, will be with
Other matched groups that local optimum matched group has non-zero same subscriber are rejected from entire matched group space, remaining matched group
For feasible matched group.
5. multi-subscriber dispatching and resource allocation process method in a kind of extensive antenna system according to claim 4,
It is characterized in that, the matched group of the N+1 times definite local optimum and specifically includes combining for resource block piecemeal：
Calculate the joint measure value of matched group and resource block；
Compare the joint measure value of each matched group and resource block；
If the corresponding matched group of maximum combined metric and resource block meet the resource allocation constraint of system, by corresponding pairing
Group and resource block labeled as local optimum matched group and resource block joint, matched group be local optimum matched group, resource block
For the resource block of local optimum；
If the corresponding matched group of maximum combined metric and resource block be discontented with pedal system resource allocation constraint, if the matched group and
The joint measure value of resource block piecemeal is more than the joint measure value of other matched groups and resource block piecemeal for hindering resource allocation,
Then system makes the resource block of obstruction resource allocation make the selection for meeting system resource allocation again；
The corresponding matched group of maximum combined metric and resource block after reselecting labeled as local optimum matched group and
The joint of resource block, matched group are local optimum matched group, and resource block is the resource block of local optimum；
Otherwise, the joint of the matched group and resource block piecemeal corresponding to the maximum joint measure value is rejected, is judged successively remaining
The joint of matched group and resource block.
6. multi-subscriber dispatching and resource allocation process method in a kind of extensive antenna system according to claim 5,
It is characterized in that, if the matched group has obtained one or more resource block, by newly assigned resource block and has obtained
The piecemeal that the resource block obtained is divided into multiple resource blocks together specifically includes：
If resource block piecemeal contains the acquired resource block of the matched group, by the acquired resource block of matched group from the resource
It is rejected in block piecemeal, forms new resource block piecemeal；The joint measure value of matched group and the new resource block piecemeal is measurement square
The single or multiple resource blocks from the resource block piecemeal distribute to the sum of element value or element value of the matched group in battle array；
If resource block piecemeal does not include the joint measure value of the acquired resource block of the matched group, matched group and resource block piecemeal
For in metric matrix in resource block piecemeal single or multiple resource blocks distribute to the matched group element value or element value it
With.
7. multi-subscriber dispatching and resource allocation process system in a kind of extensive antenna system, it is characterised in that：The system includes：
Metric matrix builds module, for the measure definitions according to system, calculates corresponding metric matrix, the element of metric matrix
Value distributes to metric during single matched group for single resource block；
Resource block distribution module, it is maximum according to the measurement between single resource block and single matched group for according to metric matrix
Principle selects a matched group for each resource block；
The joint determining module of matched group and resource block, for determining the joint of the matched group of local optimum and resource block；
Feasible matched group mark module, cannot there is the requirement of repetition for the user in different matched groups, will be with part most
Other matched groups that excellent matched group has non-zero same subscriber are rejected from entire matched group space, and remaining matched group is labeled as
Feasible matched group；
Resource block distributes detection module, for detecting whether whole resource blocks are assigned；
Mapping relations output module is combined dispatching result for exporting the mapping relations of resource block and user's matched group.
8. a kind of Combined Treatment terminal, including processor and memory, the memory storage has program instruction, and feature exists
In：The processor operation program instruction is realized such as claim 1 to claim 6 any one of them method.
9. a kind of storage medium, is stored thereon with computer program, which is characterized in that when the computer program is executed by processor
It realizes such as claim 1 to claim 6 any one of them method.
Priority Applications (2)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201711436254.8A CN108093483B (en) | 2017-12-26 | 2017-12-26 | Multi-user scheduling and resource allocation processing method and system in large-scale antenna system |
| PCT/CN2018/094952 WO2019128183A1 (en) | 2017-12-26 | 2018-07-27 | Multi-user scheduling and resource allocation processing method and system in large-scale antenna system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201711436254.8A CN108093483B (en) | 2017-12-26 | 2017-12-26 | Multi-user scheduling and resource allocation processing method and system in large-scale antenna system |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN108093483A true CN108093483A (en) | 2018-05-29 |
| CN108093483B CN108093483B (en) | 2020-03-10 |
Family
ID=62179445
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201711436254.8A Expired - Fee Related CN108093483B (en) | 2017-12-26 | 2017-12-26 | Multi-user scheduling and resource allocation processing method and system in large-scale antenna system |
Country Status (2)
| Country | Link |
|---|---|
| CN (1) | CN108093483B (en) |
| WO (1) | WO2019128183A1 (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2019128183A1 (en) * | 2017-12-26 | 2019-07-04 | 上海无线通信研究中心 | Multi-user scheduling and resource allocation processing method and system in large-scale antenna system |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103369688A (en) * | 2012-03-27 | 2013-10-23 | 普天信息技术研究院有限公司 | Resource allocation method for MU-MIMO user pairing |
| CN104702326A (en) * | 2015-03-21 | 2015-06-10 | 西安电子科技大学 | MSE-based (mean square error-based) virtual MIMO (multiple input multiple output) user pairing and resource allocating method |
| WO2016033953A1 (en) * | 2014-09-02 | 2016-03-10 | 中兴通讯股份有限公司 | Resource allocation method and device |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108093483B (en) * | 2017-12-26 | 2020-03-10 | 上海无线通信研究中心 | Multi-user scheduling and resource allocation processing method and system in large-scale antenna system |
-
2017
- 2017-12-26 CN CN201711436254.8A patent/CN108093483B/en not_active Expired - Fee Related
-
2018
- 2018-07-27 WO PCT/CN2018/094952 patent/WO2019128183A1/en active Application Filing
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103369688A (en) * | 2012-03-27 | 2013-10-23 | 普天信息技术研究院有限公司 | Resource allocation method for MU-MIMO user pairing |
| WO2016033953A1 (en) * | 2014-09-02 | 2016-03-10 | 中兴通讯股份有限公司 | Resource allocation method and device |
| CN104702326A (en) * | 2015-03-21 | 2015-06-10 | 西安电子科技大学 | MSE-based (mean square error-based) virtual MIMO (multiple input multiple output) user pairing and resource allocating method |
Non-Patent Citations (2)
| Title |
|---|
| HONGZHI ZHAO等: "A Jointed Resource Allocation and Multiuser Pairing Algorithm with Low Complexity for SC-FDMA Systems", 《SPRING》 * |
| WU,CHUNLIANG等: "Joint User Pairing and Resource Allocation for Virtual MIMO in uplink SC-FDMA System", 《IEEE》 * |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2019128183A1 (en) * | 2017-12-26 | 2019-07-04 | 上海无线通信研究中心 | Multi-user scheduling and resource allocation processing method and system in large-scale antenna system |
Also Published As
| Publication number | Publication date |
|---|---|
| WO2019128183A1 (en) | 2019-07-04 |
| CN108093483B (en) | 2020-03-10 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN109547555B (en) | Non-equilibrium edge cloud network access and resource allocation method based on fairness criterion | |
| CN102781072B (en) | Network selecting method based on multi-attribute decision-making and group decision-making | |
| CN110149646A (en) | A kind of smart grid method for managing resource and system based on time delay and handling capacity | |
| CN109302463A (en) | A kind of group cloud framework and optimization method and system certainly towards edge calculations | |
| Si et al. | Optimal cooperative internetwork spectrum sharing for cognitive radio systems with spectrum pooling | |
| CN106454856A (en) | Spectrum allocation method based on graph coloring and analytic hierarchy process in cognitive radio | |
| CN110463140A (en) | The network Service Level Agreement of computer data center | |
| CN106455078B (en) | A kind of resource allocation methods in the wireless dummy network of combination balance policy | |
| CN109889930A (en) | A kind of virtual optical network mapping method and device for combining energy consumption and load balancing | |
| Malesinska | Graph-theoretical models for frequency assignment problems | |
| Yi et al. | Combinatorial spectrum auction with multiple heterogeneous sellers in cognitive radio networks | |
| CN110446121A (en) | Virtual network function service chaining mapping method based on betweenness center degree | |
| CN110191155A (en) | Parallel job scheduling method, system and storage medium for fat tree interconnection network | |
| Yao et al. | An efficient truthful double spectrum auction design for dynamic spectrum access | |
| CN108093483A (en) | Multi-subscriber dispatching and resource allocation process method and system in extensive antenna system | |
| Zhang et al. | Virtualization of 5G cellular networks: A combinatorial double auction approach | |
| CN102215585B (en) | Method and device for pairing multiple users | |
| CN106254050A (en) | Extensive mimo system dynamic pilot allocation method based on large scale information | |
| CN107493606B (en) | A kind of the timesharing dispatching method and device of user terminal | |
| Li et al. | An efficient multi-model training algorithm for federated learning | |
| CN108833277A (en) | A kind of communication network load balancing max-flow method for routing | |
| Maghsudi et al. | Distributed downlink user association in small cell networks with energy harvesting | |
| Zhou et al. | Virtualized resource sharing in cloud radio access networks: An auction approach | |
| CN107590000A (en) | Secondary random sources management method/system, computer-readable storage medium and equipment | |
| CN108182113A (en) | A kind of wireless cloud computing system resource allocation methods |
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 | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20200310 Termination date: 20201226 |
|
| CF01 | Termination of patent right due to non-payment of annual fee |