Method for solving complementary geometric programming problem based on NOMA technology

A technology for solving problems and problems, applied in wireless communication, power management, electrical components, etc.

Pending Publication Date: 2020-04-28
NO 20 RES INST OF CHINA ELECTRONICS TECH GRP
View PDF3 Cites 0 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0006] In order to overcome the deficiencies of the prior art, the present invention provides a solution based on complementary geometric programming in NOMA technology

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
  • Method for solving complementary geometric programming problem based on NOMA technology
  • Method for solving complementary geometric programming problem based on NOMA technology
  • Method for solving complementary geometric programming problem based on NOMA technology

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0042] The present invention will be further described below in conjunction with the accompanying drawings and embodiments.

[0043] A specific infinite iterative algorithm is used to continuously approximate the complementary geometric programming problem in NOMA technology, so that the complementary geometric programming problem can be transformed into geometric programming at each iteration, that is, the non-convex optimization problem in the NOMA model is transformed into It is a convex optimization problem, so that the problem can be solved with the help of convex optimization tools (such as CVX), and provides a solution algorithm for the complementary geometric programming problem with high computational complexity in the 5G communication model.

[0044] The concrete steps of embodiment are as follows:

[0045] [Step 1] Suppose the bandwidth is B, divided into N sub-channels B={1,...N}, user k assigned to sub-channel n of subnet s s The resulting channel gain of the bas...

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 provides a method for solving a complementary geometric programming problem based on an NOMA technology. The method comprises the steps: carrying out continuous convex approximation in an infinite iteration mode, so that a non-convex problem can be converted into a convex optimization problem in each iteration; calculating the absolute value of the difference value with the last result; when the difference value is smaller than a certain value, acquiring the optimal solution of complementary geometric programming under the precision. A new solution is provided for the non-convexproblem with high complexity in a communication system.

Description

technical field [0001] The invention relates to the field of 5G communication, in particular to a NOMA technology solution. Background technique [0002] Assuming that 5G communication is a single base station downlink transmission system, there is a set S of packet subnets, and each subnet s(s∈S) has K s users. The total number of users in the entire system K=∑ s∈S K s . In order to ensure the independence of each subnet, the minimum transmission rate requirement for each subnet s in the virtual wireless network (VWN) is recorded as The VWN transmission mode is non-orthogonal multiple access technology (NOMA), that is, the entire frequency band is shared by all users. [0003] When using NOMA technology, each subnet has a required minimum transmission rate of the subnet to ensure the quality of service, and the optimization problem of the minimum transmit power can be expressed as: [0004] [0005] At this time, the optimization problem of the minimum transmit po...

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
IPC IPC(8): H04W52/24H04W52/26
CPCH04W52/241H04W52/243H04W52/265H04W52/267
Inventor 王洋轩赵应涛冯腾
Owner NO 20 RES INST OF CHINA ELECTRONICS TECH GRP
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products