Font Size: a A A

A Study On Realtime Beam Resource Allocation Algorithm For Antenna Arrays

Posted on:2020-06-13Degree:MasterType:Thesis
Country:ChinaCandidate:Z Y LuFull Text:PDF
GTID:2428330590996007Subject:Electronic and communication engineering
Abstract/Summary:PDF Full Text Request
The beam resource allocation algorithm proposed in this thesis is suitable for antenna arrays that can achieve hemispherical beam coverage,and can be used to solve the problem of beam transmitting front selection in overlapping areas of different front beams.The antenna array is composed of several planar antenna arrays,each of which has its own beams covering the space.It can provide enough power for multiple targets in different directions at the same time.The trajectory of the target is known.The realtime location of the target of each time node is taken as the input parameter,and the beam allocation scheme is calculated in the interval time to realize the realtime allocation of antenna arrays beam resources.In this thesis,the beam resource parameters required by the resource allocation algorithm are quickly calculated by realtime spatial domain judgment,global coordinate and local coordinate transformation and fast estimation of antenna array gain.Then it is transformed into a mathematical model of knapsack problem,and a tree structure is constructed to describe the solution space of the problem.Using the idea of divide and conquer algorithm,the problem is divided into several independent sub-problems.Then the backtracking algorithm is used for each sub-problem.The tree structure is pruned according to the definition function.Through the preorder traversal and scheme comparison,the feasible solution of each sub-problem is calculated within the limited time.Finally,the beam allocation scheme of the whole antenna array is combined.In this thesis,a polyhedral array model and parameters composed of sixteen planar antenna arrays are presented,and the calculation process of the above design is realized by programming.By calculating a number of examples of different characteristic targets,the advantages of the proposed algorithm in computational performance are shown.Finally,two sets of examples of known target trajectories are given,and the realtime performance and effectiveness of the proposed method are proved by calculation.
Keywords/Search Tags:Antenna arrays, Resource allocation, Divide and conquer algorithm, Backtracking algorithm
PDF Full Text Request
Related items