Looking for breakthrough ideas for innovation challenges? Try Patsnap Eureka!

Fast joint resource allocation method based on partition numbers in virtual MIMO system

A technology of resource allocation and splitting, applied in the field of communication, can solve the problems that the algorithm cannot be realized, the computational complexity is not considered, and the system spectrum utilization rate is not high, so as to achieve efficient user pairing and resource allocation, overcome the high complexity of repeated traversal, The effect of reducing the computational complexity of the system

Active Publication Date: 2017-05-31
XIDIAN UNIV
View PDF2 Cites 4 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

The main problem is that existing methods do not take computational complexity into account
Especially as the number of users gradually increases, the running time of the system will be significantly improved, resulting in low efficiency of the system, and when the number of users reaches a certain value, the existing algorithm can hardly achieve
[0004] To sum up, with the increase of mobile users and user services, the user pairing and resource allocation algorithms of the existing virtual multiple-input multiple-output MIMO system do not consider the non-stationary user pairing, resulting in low system spectrum utilization; and Excessive pursuit of algorithm optimization leads to high computational complexity and low system efficiency

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Fast joint resource allocation method based on partition numbers in virtual MIMO system
  • Fast joint resource allocation method based on partition numbers in virtual MIMO system
  • Fast joint resource allocation method based on partition numbers in virtual MIMO system

Examples

Experimental program
Comparison scheme
Effect test

Embodiment 1

[0042] With the increase of the number of communication users and the increasing shortage of spectrum resources, the existing technology can no longer achieve more efficient use of spectrum for user selection and resource block allocation. Therefore, the present invention proposes a user pairing and A scheme for resource allocation. The base station is involved, and the multi-users and resource blocks associated with the base station are implemented in the virtual MIMO system.

[0043] The present invention is a fast joint resource allocation method based on split number in a virtual MIMO system, see figure 1 , including the following steps,

[0044] (1) The base station obtains basic parameters

[0045] The base station obtains the set l of users to be paired in the current time slot of the cell, the number Nu of users to be paired, the set r of resource blocks, the number N of resource blocks, and the number Nr of receiving antennas. Prepare for the subsequent formation o...

Embodiment 2

[0073] The fast joint resource allocation method based on the number of splits in the virtual MIMO system is the same as in Embodiment 1, wherein in step (3.1) according to the number Nu of users to be paired, a user group split number set G is formed, taking Nu=5 as an example, including There are the following steps:

[0074] 3.1a) Generate an initial user integer split matrix Q whose elements are all 0 0 .

[0075] 3.1b) The number of users Nu=5 is divided into integers, that is, the positive integer 5 is expressed as the sum of several positive integers, regardless of the order of their summation. Separate the number of users into the result vectors (1,1,1,1,1), (2,1,1,1,0), (2,2,1,0,0), (3,1,1 ,0,0), (3,2,0,0,0), (4,1,0,0,0), (5,0,0,0,0) as row vectors into the user integer split Matrix Q 0 middle.

[0076] 3.1c) Remove the zero elements in the result vector of splitting the number of users to get (1,1,1,1,1), (2,1,1,1), (2,2,1), (3,1 ,1), (3,2), (4,1), (5), get the...

Embodiment 3

[0085] The fast joint resource allocation method based on the number of splits in the virtual MIMO system is the same as in embodiment 1-2, wherein the generation of the user pairing pattern matrix B in step (3.2) is to generate the user pairing pattern matrix B according to the optional user pair set G, Including the following steps:

[0086] 3.2a) Generate an initial user pairing pattern matrix B with Nu=5 rows, Na columns, and all elements are 0 0 , where Na is equal to the number of elements in the user group split number set G, namely

[0087] 3.2b) Determine whether the pth element of the user group split number set G contains a number equal to l i users, if so, let the user pairing pattern matrix B 0 the first l i The elements of row and column p are equal to 1, otherwise, set them equal to 0.

[0088] 3.2c) The initial user pairing mode matrix B with element values 0 As the final user pairing pattern matrix B.

[0089] The above completes the user pairing mode ...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

PUM

No PUM Login to View More

Abstract

The invention discloses a fast joint resource allocation method based on partition numbers in a virtual MIMO system in the field of wireless communication. The problems of non-fixed user pairing and resource allocation when the number of users is large are mainly solved. The technical scheme is as follows: constructing a complete resource block allocation set and a user group partition number set; constructing a fast joint resource allocation model based on the partition numbers in the virtual MIMO system, and solving the fast joint resource allocation model by using a Hungary algorithm based on a greedy algorithm to obtain a user pairing and resource allocation result; modulating user information according to the result and a user modulation matrix; and sending the information to a receiver on resources allocated to the user to accomplish user pairing and resource allocation. According to the fast joint resource allocation method disclosed by the invention, multi-user pairing of a non fixed number is carried out quickly based on the user paring based on the partition numbers, and the local optimum to the global optimum in the allocation model is resolved. By adoption of the fast joint resource allocation method disclosed by the invention, under the condition of low computation complexity, the utilization rate of the system frequency is maximized, and the communication quality of the system is improved. The fast joint resource allocation method is applied to the communication of the virtual MIMO system.

Description

technical field [0001] The invention belongs to the technical field of communication, and further relates to a virtual multiple-input multiple-output MIMO resource allocation method, in particular to a fast resource allocation method based on split numbers. Used in the uplink of virtual MIMO systems. Background technique [0002] Multiple-input multiple-output MIMO technology has been widely used in various wireless communication systems to improve spectrum efficiency. However, due to practical operational difficulties such as cost and size of user equipment, the application of MIMO technology in uplink is limited. In order to solve this problem, the researchers proposed the method of virtual multiple-input multiple-output MIMO, which effectively solves the problem of cost and size constraints of the user equipment, that is, the uplink pairs two or more users, in the same Deploy a single transmit antenna for each paired user in the frequency band and time slot. Compared wi...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

Application Information

Patent Timeline
no application Login to View More
Patent Type & Authority Applications(China)
IPC IPC(8): H04W72/04H04B7/0413H04W24/02
CPCH04B7/0413H04W24/02H04W72/0453
Inventor 卢小峰郭惠范宁李文娜刘博文赵丹萍
Owner XIDIAN UNIV
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Patsnap Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Patsnap Eureka Blog
Learn More
PatSnap group products

Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com