CN105978673B - Based on the pilot distribution method of user distance in large-scale distributed antenna system - Google Patents
Based on the pilot distribution method of user distance in large-scale distributed antenna system Download PDFInfo
- Publication number
- CN105978673B CN105978673B CN201610299285.2A CN201610299285A CN105978673B CN 105978673 B CN105978673 B CN 105978673B CN 201610299285 A CN201610299285 A CN 201610299285A CN 105978673 B CN105978673 B CN 105978673B
- Authority
- CN
- China
- Prior art keywords
- user
- group
- pilot
- key
- users
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L5/00—Arrangements affording multiple use of the transmission path
- H04L5/003—Arrangements for allocating sub-channels of the transmission path
- H04L5/0048—Allocation of pilot signals, i.e. of signals known to the receiver
- H04L5/005—Allocation of pilot signals, i.e. of signals known to the receiver of common pilots, i.e. pilots destined for multiple users or terminals
Landscapes
- Engineering & Computer Science (AREA)
- Signal Processing (AREA)
- Computer Networks & Wireless Communication (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
The invention discloses the pilot distribution methods based on distance between user under a kind of large-scale distributed antenna system, it is characterized in that, after the user being in a disadvantageous position is selected as key user, it excludes and it is apart from P-1 nearest user, remaining users recurrence is divided into P group using this distribution method, best one group is selected and is assigned to the user being in a disadvantageous position under same pilot group, then carry out the distribution of next group of pilot tone, wherein, P is pilot number.The algorithm that pilot distribution method of the present invention uses can be realized with lower complexity approaches the estimation performance for traversing optimal (UPS upper performance score).
Description
Technical field
The invention belongs to wireless communication technology field, in particular to user is based in a kind of large-scale distributed antenna system
The pilot tone dispatching algorithm of distance.
Background technique
Distributing antenna system is a kind of new wireless communication systems structure, it include multiple dispersions on geographical location but
The antenna element being connected by optical fiber or cable etc. with a center processing unit.Compared to centralized antenna system, dropping
Low transmission power, improvement area coverage and reduction outage probability etc. have a clear superiority.Distributing antenna system most starts
It is mainly used for improving the area coverage of indoor wireless communication and reduces outage probability, slowly developed into later outdoor as outdoor
A kind of mainstream communication technology in the regions such as stadium, city.Currently, in conjunction with the cloud access technology (C- of distributing antenna system
RAN more next due to having big advantage in terms of spectrum efficiency and energy efficiency) as a kind of new network architecture form
It is more concerned by people and studies.
As one of multi-input multi-output system, in order to obtain space diversity gain and sky by precoding technique
Between freedom degree and eliminate the common-channel interference between user, the acquisition of channel information is very crucial in distributing antenna system.When
Preceding channel estimation technique is broadly divided into two classes: the estimation based on pilot tone, blind/semi-blind estimation based on subspace etc..Based on son
No need to send pilot frequency sequences for the estimation in space, can effectively improve running time-frequency resource utilization rate, but to reach preferable estimation property
There can be certain constraint condition to antenna configuration etc., current research is mainly for centralized antenna system.In spaced antenna
It is main still the estimation technique based on pilot tone to be utilized to carry out channel estimation in system.
Estimation technique based on pilot tone needs to consume certain running time-frequency resource to send pilot frequency sequence.In order to guarantee time-frequency
The utilization rate of resource, the number of pilots that system allows is limited, therefore generally requires multiple users and share a pilot tone.Using same
Interference (referred to as pilot pollution) can be generated between the user of pilot tone, so that system performance is remarkably decreased.How to be dispatched by pilot tone
So that the pilot pollution problem is as small as possible to be one and of great value studies a question.Ergodic algorithm is to all possible scheduling scheme
It is compared, available optimal scheduling scheme, but complexity is very high, is a np hard problem.In systems in practice, time
Algorithm is gone through not to be available completely.Greedy algorithm complexity is relatively low, but performance is unsatisfactory.Moreover, using greedy algorithm
When being scheduled, the subscriber channel estimation performance of more late distribution can be poorer, this does not meet the principle of fairness.
Summary of the invention
Technical problem: in order to overcome the shortcomings of existing pilot tone dispatching algorithm, the present invention provides one kind to be based on user's spacing
From dispatching algorithm, can reach to approach with lower complexity and traverse optimal scheduling performance.
Technical solution: being found by analysis, carries out the situation of channel estimation using least-mean-square error algorithm in receiving end
Under, when the mutual distance of user for distributing same pilot tone tends to infinity, square evaluated error will be close to zero.Based on this,
This dispatching algorithm reduces square evaluated error by making between the user being assigned under every group of pilot tone distance as big as possible.It adjusts
The basic thought of degree: the user being assigned under every group of pilot tone is successively chosen；In each iteration, distance between each other is chosen to the greatest extent may be used
Can big user while so that remaining user disperses as far as possible.
A kind of pilot distribution method based on distance between user under large-scale distributed antenna system, which is characterized in that choosing
After the user being in a disadvantageous position out is as key user, excludes and it is apart from P-1 nearest user, remaining users recurrence is used
This distribution method is divided into P group, selects best one group and is assigned under same pilot group with the user being in a disadvantageous position, is then carried out down
The distribution of one group of pilot tone, wherein P is pilot number.
The specific steps of pilot tone distribution:
Step 1: choosing key user ukey:
Step 2: distribution includes key user ukeyA pilot group, specific method is:
Exclude U in ukeyApart from P-1 nearest user, by remaining P (Kpilot- 1) a user calls Recursive schedule to calculate
Method is divided into P group, every group of (Kpilot- 1) a user (is P (K by total number of userspilot- 1), pilot number is that the situation of P is divided
Match, specific recurrence executes step and sees below), it is denoted asWherein, KpilotFor the use of every group of pilot tone distribution
Amount；
Select optimal one groupWith ukeyIt is assigned under same group of pilot tone, constitutes together
Step 3: repeating step 1 and step 2, be sequentially completed the distribution of a pilot group.
The choosing method of key user is:
Step 1-1: setting distance threshold dth, the user's cluster for all corresponding to the threshold value in user's set U is obtained, is taken wherein
A most cluster C of number of users, if its number of users is KC；
Step 1-2: if number of users K in clusterCNot less than pilot number P, the central user for choosing cluster C is key user ukey:
In formula, D (C) is the distance matrix in user's cluster C between user, [D (C)]ijRepresent distance matrix the i-th row jth column member
Element, i, j respectively correspond i-th, j user in user's set U；
Otherwise, the central user for choosing entire user's set U is key user ukey:
Optimal one groupAre as follows:
M () indicates square evaluated error when one group of user is assigned to same pilot group.
The execution step of the Recursive schedule algorithm is:
Two user (K are distributed under every group of pilot tonepilot=2) it when, comprises the concrete steps that:
A, key user u is selected according to step 1key, exclude and it be apart from P-1 nearest user, in remaining P user
In select best one and key user ukeyIt is assigned under same group of pilot tone；
B, allocated 2 users are excluded, select key user again in remaining users, repeat step a until will own
User is distributed into P group；
Three user (K are distributed under every group of pilot tonepilot=3) it when, comprises the concrete steps that:
Key user u is selected according to step 1key, exclude and it be apart from P-1 nearest user, remaining 2P user is pressed
According to KpilotAssigning process when=2 is divided into P group, selects best one group and key user ukeyIt is assigned under same group of pilot tone；Row
Except allocated user, this process is repeated until all users are divided into P group.
……
S user (K is distributed under every group of pilot tonepilot=S) when, it comprises the concrete steps that:
Key user u is selected according to step 1key, exclude and it be apart from P-1 nearest user, by remaining (S-1) P use
Family is according to KpilotAssigning process when=S-1 is divided into P group；It selects optimal one group and is assigned to same group of pilot tone with key user
Under；Allocated user is excluded, repeats this process until all users are divided into P group.
The algorithm that pilot distribution method of the present invention uses can realize that approach traversal optimal (in performance with lower complexity
Limit) estimation performance.
Detailed description of the invention
Fig. 1 is based on the flow chart between user apart from dispatching algorithm.
Simulation result when Fig. 2 number of users is pilot number integral multiple (K=12, P=4).
Simulation result when Fig. 3 number of users is not pilot number integral multiple (K=14, P=4).
Obey simulation result when Poisson distribution and K=14, P=4 in the position Fig. 4 .RAU.
Specific embodiment
With reference to the accompanying drawing and specific example, the present invention is furture elucidated, it should be understood that the example is merely to illustrate the present invention
Rather than limit the scope of the invention, after the present invention has been read, those skilled in the art are to various equivalences of the invention
The modification of form falls within the application range as defined in the appended claims.
Following explanation is done first: in distributed extensive mimo system, being shared K single-antenna subscriber, is constituted set U,
Each RAU of base station end is also equipped with single antenna, and RAU number is M.EPIndicate pilot power,It indicates
P-th of pilot frequency sequence, and meethk∈CM×1Indicate channel vector of k-th of user to base station end, Y
∈CM×τIt is receipt signal matrix, N ∈ CM×τIt is noise matrix.
The system model in uplink channel estimation stage:
In receiving end, signal will be received and done to known pilot frequency sequence related, and defined In view of different pilot frequency sequences are mutually orthogonal, then have
WhereinIt is by the MMSE estimated value estimated and corresponding square evaluated error
It is diagonal matrix, and i-th of element r on diagonal linek,iIndicate the user k that i-th of RAU is received
Mean power.The problem of we study is the user how distributed in U to different pilot group { Up, entirety can be made
Square evaluated error is minimum, and mathematical notation is
Collect Distance matrix D (U)=[d of U based on userij]i,j∈UDefine two class users:
User in center:
Due to the location information of not no user, it is contemplated that compared to user and the other users that boundary user is in center
Maximum distance can be smaller, therefore have the definition of the central user above based on distance.
User's cluster.Set a distance threshold dth, for one group of user U, user's cluster C thereon is such a collection
Closing --- the distance between any two user u and u ' is not more than threshold value d in clusterth, in the outer any user of cluster and cluster at least one
The distance between user is greater than threshold value dth.Mathematical notation is
Our algorithm successively chooses the user group being assigned under every group of pilot tone.The user cluster more for number of users, is answered
User in cluster is avoided to be assigned to same pilot group as far as possible, therefore in the presence of such cluster, we preferentially select the center of cluster
User, and select and it apart from farther away one group of user is assigned to same pilot group.And on entire user's collection to be allocated
Central user, due in contrast can be fewer apart from user farther out's number with it, when there is no user's cluster compared with multi-user
Also it should pay the utmost attention to.
First introduce number of users K=| U | it is the situation of pilot number P integral multiple, i.e., every group of pilot tone distributes same number Kpilot=
The user of K/P.For general situation, need only slightly improve on this basis, behind have specific description.
Pilot tone allocation step when number of users is pilot number integral multiple, as shown in Figure 1:
Step 1: obtaining the Distance matrix D (U) between user, and p=1 is set；
Step 2: cluster.Distance threshold d is setth, user's cluster that the threshold value is all corresponded in user's set U is obtained,
The cluster C that wherein number of users is most is taken, if its number of users is KC。
Step 3: choosing key user ukey.Selection standard:
If number of users K in clusterCNot less than pilot number P, the central user for choosing cluster C is key user ukey:
Otherwise, the central user for choosing entire user's set U is key user ukey:
Step 4: selecting one group between each other apart from user farther out and ukeyIt is assigned under same pilot group.It excludes in U
With ukeyApart from P-1 nearest user, by remaining P (Kpilot- 1) a this dispatching algorithm of user's recursive call is divided into P group, often
Group (Kpilot- 1) a user, is denoted as(note: if there are multiple numbers of users to be greater than pilot tone in step 2
Several cluster, then these remaining clusters can gradually be spread out in this step other than selected cluster C)
Select optimal one group and ukeyIt is assigned under pth group pilot tone, constitutes together
M () indicates square evaluated error when one group of user is assigned to same pilot group.
Step 5: excluding the allocated user from user's set UUnallocated pilot number P=P-
1, remaining users number K=K-Kpilot, reacquire Distance matrix D (U), repeat step 2 to 5 and carry out next group of pilot tone p=p+1's
Distribution.
In a practical situation, number of users K may not be the integral multiple of number of pilots P.When this happens, may be used
To be scheduled as follows:
Step 1: takingThen there is P1
+P2=P,
Step 2: distribution P2It is a to containThe pilot group of a user:
A, the user u that boundary is in user's set U is obtainedborder:
B, exclude U in uborderApart from nearest P2- 1 user, will be remainingA user presses the tune of a upper trifle
Degree algorithm is divided into P group, and every groupA user, is denoted as
C, optimal one group and u is selected from P group user obtained in the previous stepborderIt constitutes together
Delete user's set U in andCorresponding user repeats step A, B, C until distributing P2Group user
Step 3: remaining user is divided into P by the dispatching algorithm of a upper trifle1Group, every groupA user.
Actual range between user may be not readily available, we define the concept of " interference distance " to substitute.It examines
Consider the square evaluated error that two users share one of user under a pilot tone situation:
Correspondingly, the square evaluated error when no pilot pollution only has noise is
It is influenced caused by analysis pilot pollution:
Likewise it is possible to obtain pilot pollution to another influence caused by user security risk
DefinitionWe can approximately think, Δ I12Smaller, the pilot pollution between user 1,2 is asked
Topic will be smaller.Define interference distance
So interference distance is bigger, and the pilot pollution problem between user will be smaller, and actual range is to pilot tone dirt between user
As the influence of metachromia energy.
In K=14, P=4, there are 2 groups of pilot tones to distribute 4 users, 2 groups of pilot tones 3 users of distribution.Distribution contains 4 first
The pilot group of user:
Step 1: obtaining the user u that boundary is in user's set Uborder:
Step 2: exclude U in uborderRemaining 12 users, are pressed the tune of a upper trifle by 1 nearest user of distance
Degree algorithm is divided into 4 groups, and every group of 3 users are denoted asCalculate separately this four groups of users and uborderGroup
It is one group and u the smallest to select corresponding square evaluated error for the square evaluated error being combinedborderIt is distributed together at first group
Under pilot tone；
Step 3: excluding allocated user, select the user u for being in boundary in remaining 10 usersborder2, equally will
Remaining 9 users are divided into 3 groups, select best one group and boundary user uborder2It is assigned under second group of pilot tone together；
Then 6 users of residue are divided into two groups, every group of 3 users.
Step 4: selecting the key user u in 6 userskey, exclude user nearest with it, and by remaining 4 use
Press K in familypilotAllocation algorithm when=2 is divided into 2 groups.Calculate separately this two groups of users and ukeyThe side estimation combined misses
Difference selects lesser one group and ukeyIt is assigned under the 3rd group of pilot tone；Remaining 3 users are assigned under the 4th group of pilot tone.
Emulate the distributing antenna system that single antenna is equipped with based on each end RAU.Base station end configures 100 single antenna
RAU, each RAU are uniformly distributed on geographical location, and neighbouring 4 RAU constitute a square, and between adjacent R AU away from
From for 100m, user location generates at random.
Fig. 2 gives simulation result when number of users is pilot number integral multiple (K=12, P=4).Fig. 2 (a), 2 (b) are respectively
Give the relationship between channel estimation errors and average user rate and signal-to-noise ratio.In figure, " Best ", which is represented, traverses optimal calculation
Method is taken wherein after the square evaluated error that different schemes are traversed and compared to all possible pilot allocation scheme
Square evaluated error it is the smallest it is a kind of obtain, this is the upper limit value of performance；" Worst ", which is represented, traverses worst algorithm, is under performance
Limit value；" Greedy " represents greedy algorithm；" Loc " represents the dispatching algorithm proposed in this paper based on distance；" random " is represented
Random schedule.It can be seen that whether channel estimation errors or average user rate, algorithm performance proposed in this paper can be with
Traversal optimal performance is approached, and is better than greedy algorithm and Randomized scheduling algorithm.
The simulation result that Fig. 3 gives number of users not when being pilot number integral multiple (K=14, P=4).In this case,
Greedy algorithm is also the pilot group that all users are divided into 2 groups of 4 users and the pilot group of 2 groups of 3 users, and first distributes 4
The pilot group of 3 users is distributed after the pilot group of user.Since ergodic algorithm is excessively complicated in this case, corresponding emulation knot
Fruit does not provide.It can be seen that location-based dispatching algorithm evaluated error performance in high s/n ratio be still substantially better than it is greedy
Greedy algorithm.
Fig. 4 give the position RAU obey Poisson distribution when simulation result, it can be seen that algorithm performance proposed in this paper according to
It is so optimal.
Claims (4)
1. the pilot distribution method based on distance between user under a kind of large-scale distributed antenna system, which is characterized in that select
After the user being in a disadvantageous position is as key user, excludes and it is apart from P-1 nearest user, remaining users recurrence is used this
Distribution method is divided into P group, selects best one group and is assigned under same pilot group with the user being in a disadvantageous position, is then carried out next
The distribution of group pilot tone, wherein P is pilot number；
The choosing method of key user is:
Step 1-1: setting distance threshold dth, the user's cluster for all corresponding to the threshold value in user's set U is obtained, wherein user is taken
A most cluster C of number, if its number of users is KC；
Step 1-2: if number of users K in clusterCNot less than pilot number P, the central user for choosing cluster C is key user ukey:
In formula, D (C) is the distance matrix in user's cluster C between user, [D (C)]ijRepresent distance matrix the i-th row jth column element, i,
J respectively corresponds i-th, j user in user's set U；
Otherwise, the central user for choosing entire user's set U is key user ukey:
ukey=argminj{maxi[D(U)]ij}；
The specific steps of pilot tone distribution:
Step 1: choosing key user ukey:
Step 2: distribution includes key user ukeyA pilot group, specific method is:
Exclude U in ukeyApart from P-1 nearest user, by remaining P (Kpilot- 1) a this dispatching algorithm of user's recursive call
It is divided into P group, every group of Kpilot- 1 user, is denoted asWherein, KpilotFor the user of every group of pilot tone distribution
Number；
Select optimal one groupWith ukeyIt is assigned under same group of pilot tone, constitutes together
The execution step of the Recursive schedule algorithm is:
Two user K are distributed under every group of pilot tonepilotWhen=2, comprise the concrete steps that:
A, key user u is selected according to step 1key, exclude and it be apart from P-1 nearest user, selected in remaining P user
Best one and key user u outkeyIt is assigned under same group of pilot tone；
B, allocated 2 users are excluded, select key user again in remaining users, repeat step a until by all users
It is distributed into P group；
Three user K are distributed under every group of pilot tonepilotWhen=3, comprise the concrete steps that:
Key user u is selected according to step 1key, exclude and it be apart from P-1 nearest user, by remaining 2P user according to
KpilotAssigning process when=2 is divided into P group, selects best one group and key user ukeyIt is assigned under same group of pilot tone；It excludes
Allocated user repeats this process until all users are divided into P group；
……
S user K is distributed under every group of pilot tonepilotWhen=S, comprise the concrete steps that:
Key user u is selected according to step 1key, exclude and it be apart from P-1 nearest user, residue (S-1) P user is pressed
According to KpilotAssigning process when=S-1 is divided into P group, selects optimal one group and is assigned under same group of pilot tone with key user；Row
Except allocated user, this process is repeated until all users are divided into P group；
Step 3: repeating step 1 and step 2, be sequentially completed the distribution of a pilot group.
2. pilot distribution method according to claim 1, which is characterized in that Distance matrix D (U)=[dij], wherein
dijIndicate the distance between i-th of user and j-th of user in user's set U.
3. pilot distribution method according to claim 2, which is characterized in that the distance matrix available interference distance matrixSubstitution,It indicates the interference distance in U between i-th of user and j-th of user, is defined as
Wherein, ri,n,rj,nRespectively indicate the mean power that n-th of antenna element receives i-th, j user.
4. pilot distribution method according to claim 1, which is characterized in that optimal one groupAre as follows:
M () indicates square evaluated error when one group of user is assigned to same pilot group.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610299285.2A CN105978673B (en) | 2016-05-06 | 2016-05-06 | Based on the pilot distribution method of user distance in large-scale distributed antenna system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610299285.2A CN105978673B (en) | 2016-05-06 | 2016-05-06 | Based on the pilot distribution method of user distance in large-scale distributed antenna system |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN105978673A CN105978673A (en) | 2016-09-28 |
| CN105978673B true CN105978673B (en) | 2019-04-23 |
Family
ID=56992745
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201610299285.2A Active CN105978673B (en) | 2016-05-06 | 2016-05-06 | Based on the pilot distribution method of user distance in large-scale distributed antenna system |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN105978673B (en) |
Families Citing this family (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107872255B (en) * | 2017-11-10 | 2020-07-14 | 中通服咨询设计研究院有限公司 | Pilot frequency scheduling method suitable for large-scale MIMO cellular mobile communication network |
| CN109039498B (en) * | 2018-07-05 | 2021-04-30 | 上海电机学院 | Energy efficiency optimization method based on RAU and user distance relationship in multi-cell large-scale DAS |
| CN109302225B (en) * | 2018-10-24 | 2021-12-03 | 山东大学 | Distributed antenna system based on ROF and application thereof |
| CN111953463B (en) * | 2020-07-08 | 2022-06-10 | 杭州电子科技大学 | Pilot frequency distribution method based on user clustering |
Family Cites Families (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US9455816B2 (en) * | 2014-02-07 | 2016-09-27 | Alcatel Lucent | Interference cancellation in TDD massive MIMO wireless systems |
| CN104393972B (en) * | 2014-11-27 | 2017-11-14 | 山东大学 | A kind of extensive mimo system pilot distribution method based on customer position information |
| CN104410480A (en) * | 2014-11-27 | 2015-03-11 | 山东大学 | Large-scale fading based pilot frequency distribution method in large-scale MIMO (multiple input multiple output) system |
| CN104768162B (en) * | 2015-03-17 | 2019-01-22 | 重庆邮电大学 | A kind of pilot tone dynamic allocation method of the extensive mimo system of multiple cell |
-
2016
- 2016-05-06 CN CN201610299285.2A patent/CN105978673B/en active Active
Also Published As
| Publication number | Publication date |
|---|---|
| CN105978673A (en) | 2016-09-28 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN104640220B (en) | A kind of frequency and power distribution method based on NOMA systems | |
| JP4718269B2 (en) | Subchannel assignment method in wireless network | |
| CN104768162B (en) | A kind of pilot tone dynamic allocation method of the extensive mimo system of multiple cell | |
| CN105978673B (en) | Based on the pilot distribution method of user distance in large-scale distributed antenna system | |
| CN106850173B (en) | Multi-cell pilot frequency distribution method based on large-scale MIMO | |
| CN106341826B (en) | The resource optimal distribution method towards wireless power private network based on virtualization technology | |
| CN104410480A (en) | Large-scale fading based pilot frequency distribution method in large-scale MIMO (multiple input multiple output) system | |
| CN103634244A (en) | Densely-distributed wireless network dynamic pilot multiplexing channel estimation and pilot frequency distribution method | |
| CN103873146B (en) | Resource regulating method in indoor distributed visible light communication system | |
| CN104540139A (en) | Allocation method and allocation system for heterogeneous convergence network resources | |
| CN107547184A (en) | A kind of dynamic pilot allocation method in extensive mimo system | |
| CN112601284A (en) | Downlink multi-cell OFDMA resource allocation method based on multi-agent deep reinforcement learning | |
| CN106231666A (en) | Federated resource distribution method based on efficiency in distributing antenna system | |
| CN105634709A (en) | Pilot frequency distribution method | |
| CN105490794B (en) | The packet-based resource allocation methods of the Femto cell OFDMA double-layer network | |
| CN109451569A (en) | A kind of resource allocation methods wirelessly taken in energy heterogeneous network | |
| CN103269487A (en) | Femtocell network down link dynamic interference management method based on game theory | |
| CN106788812A (en) | Interference alignment schemes based on sub-clustering in a kind of two-tier network | |
| JP5558551B2 (en) | Wireless communication resource management for distributed cellular systems | |
| CN109995496B (en) | Pilot frequency distribution method of large-scale antenna system | |
| CN105163328B (en) | A kind of offsetting pilot position distribution method and device | |
| CN106254050A (en) | Extensive mimo system dynamic pilot allocation method based on large scale information | |
| CN105979589A (en) | Method and system for allocating energy efficient resources of heterogeneous network | |
| CN106385274B (en) | Method and device for pilot frequency distribution in large-scale MIMO system | |
| CN104618912B (en) | Isomery cognition wireless network resource allocation methods based on frequency spectrum perception |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant | ||
| TR01 | Transfer of patent right |
Effective date of registration: 20210330 Address after: 201306 building C, No. 888, Huanhu West 2nd Road, Lingang New Area, Pudong New Area, Shanghai Patentee after: Shanghai Hanxin Industrial Development Partnership (L.P.) Address before: 210096 No. four archway, 2, Jiangsu, Nanjing Patentee before: SOUTHEAST University |
|
| TR01 | Transfer of patent right | ||
| TR01 | Transfer of patent right |
Effective date of registration: 20230913 Address after: 201615 room 301-6, building 6, no.1158, Jiuting Central Road, Jiuting Town, Songjiang District, Shanghai Patentee after: White box (Shanghai) Microelectronics Technology Co.,Ltd. Address before: 201306 building C, No. 888, Huanhu West 2nd Road, Lingang New Area, Pudong New Area, Shanghai Patentee before: Shanghai Hanxin Industrial Development Partnership (L.P.) |
|
| TR01 | Transfer of patent right |