A method for adaptively adjusting user allocation according to channels

By adaptively adjusting the number of users in multi-user channel transmission, the problem of increasing block error rate caused by multi-user interference is solved, adaptive user modulation of the channel is realized, the utilization of transmission power is maximized, and the throughput of the channel is improved. Transmission efficiency.

CN116015568BActive Publication Date: 2024-11-05UNIV OF ELECTRONICS SCI & TECH OF CHINA
View PDF 0 Cites 0 Cited by

Patent Information

Application Number
CN202310005811.X
Authority / Receiving Office
CN · China
Patent Type
Patents(China)
Current Assignee / Owner
Filing Date
2023-01-04
Publication Date
2024-11-05
Estimated Expiration
2043-01-04

AI Technical Summary

Technical Problem

In multi-user channel transmission, multi-user interference leads to an increase in decoding errors, and block error rate performance has not been improved while increasing the signal-to-noise ratio. It is difficult for the prior art to effectively control the user block error rate to maximize throughput.

Method used

By adaptively adjusting the number of users according to channel parameters before sending the signal, using a non-orthogonal multiple access algorithm, iteratively calculates the block error rate to ensure that the block error rate does not exceed the threshold, thereby determining the optimal number of users and realizing channel adaptation User modulation to maximize transmit power utilization.

Benefits of technology

Without changing the traditional transmission and reception process, the waste of antenna transmission power is reduced, the channel throughput and transmission efficiency is improved, the block error rate curve exceeds the maximum allowable value, and the channel adaptive user modulation is realized. Maximizes the utilization of transmit power.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN116015568B_ABST
    Figure CN116015568B_ABST
Patent Text Reader

Abstract

The present invention belongs to the field of wireless communication technology, and more specifically, relates to a method for adaptively adjusting user allocation according to a channel. The channel model is a non-orthogonal multiple access algorithm based on large-scale access. First, a number of users is selected and the block error rate at this time is calculated. If the block error rate does not meet the conditions, the number of users is increased by one and the next iteration is entered. This is repeated until the block error rate exceeds the threshold constraint and the iteration ends. The optimal number of users is calculated according to the iteration, and a serious number of wrong users can be avoided when the number of users is large, that is, the block error rate curve is much larger than the maximum block error rate required by the channel, so that the channel has an adaptive user modulation function, and the increase in the number of users for the existing signal-to-noise ratio can maximize the use of transmission power.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present invention belongs to the field of wireless communication technology, and specifically relates to a method for adaptively adjusting optimal user allocation of multiple users according to a multi-user channel; the present invention relates to technologies such as Successive Interference Cancellation (SIC), Adaptive User Allocation (AUA), Non-Orthogonal Multiple Access (NOMA), and Multi-user random access (MRA). Background Art

[0002] In the field of communications, multiple access (MA) technology has been widely used in multi-user transmission channels. Commonly used multiple access methods include: orthogonal multiple access multiplexing such as optimal multi-user detection (MUD) using code division multiple access (CDMA) technology, frequency division multiple access (FDMA) and time division multiple access (TDMA) technology, and non-orthogonal multiple access (NOMA) technology. Since the channel for transmitting multiple users not only has channel noise, but also interference caused by other users during the decoding process, it is necessary to perform serial interference cancellation (SIC) on these interferences.

[0003] However, multiple access will lead to the finite block length (FBL) effect (Y.Polyanskiy,HVPoor,and S.Verd′u,“Channel coding rate in the finite blocklength regime,”IEEE Trans.Inf.Theory,vol.56,no.5,pp.2307–2359,May 2010). The FBL problem of K-user MAC has been studied by E.MolavianJazi (E.MolavianJazi and JN Laneman,“A second-orderachievable rate region for Gaussian multi-access channels via a central limittheorem for functions,”IEEE Trans.Inf.Theory,vol.61,no.12,pp.6719–6733,2015), but their bounds and normal approximations need to be within 2 KThe probability is evaluated in the dimensional space, so it can only be calculated for very small values ​​of K. Therefore, in the next generation of wireless communication standards, providing large-scale user coexistence on a specified bandwidth is a very hot research challenge, and multiple access is closely related to it. As early as 30 years ago, R. Gallager proposed a coding technology suitable for a group of large transmitters, in which a small and variable subset uses the channel simultaneously (R. Gallager, "A perspective on multiaccess channels," IEEE Trans. Inf. Theory, vol. 31, no. 2, pp. 124–142, 1985). Therefore, in 2017, Yury Polyanskiy proposed the definition of Massive Random-Acces (MRA) (Y. Polyanskiy, "A perspective on massive random-access," 2017 IEEE International Symposium on Information Theory (ISIT), 2017, pp. 2523-2527, doi: 10.1109 / ISIT.2017.8006984). Multiple users should use the same codebook, the decoding process is solved from multiple users and the bit error rate is for a single user. As for the Non-Orthogonal Multiple Access (NOMA) technology, non-orthogonal transmission is adopted at the transmitting end to actively introduce interference information, and then interference cancellation technology is adopted at the receiving end to achieve correct demodulation in order to obtain higher spectrum efficiency.

[0004] In order to prevent the waste of transmission power caused by errors exceeding the threshold, it is particularly important to adaptively select the most appropriate number of users according to the channel parameters. The present invention adopts a multi-user allocation algorithm, which is an optimal decoding process for a limited code length. Under the condition of ensuring the maximum block error rate limit, the maximum throughput of the transmission users is achieved, so that the number of users that can be transmitted is maximized.

[0005] The present invention is an optimization problem of selecting the number of users with the maximum transmission power utilization rate for fixed parameters. The channel model is a non-orthogonal multiple access algorithm based on large-scale access. First, a number of users is selected and the block error rate at this time is calculated. If the block error rate does not meet the conditions, the number of users is increased by one and the next iteration is entered. This is repeated until the block error rate exceeds the threshold constraint and the iteration ends. The optimal number of users is calculated according to the iteration, and serious errors in the number of users can be avoided when the number of users is large, that is, the block error rate curve is much larger than the maximum block error rate required by the channel, so that the channel has an adaptive user modulation function, and the increase in the number of users for the existing signal-to-noise ratio can maximize the transmission power utilization. Summary of the invention

[0006] The problem addressed by the present invention is that when a large number of users transmit on a channel at the same time, the multi-user interference generated will lead to a significant increase in decoding errors, and the block error rate performance is still not improved when the signal-to-noise ratio is increased. The purpose of the present invention is to propose a method that can adjust the number of users according to channel parameters before sending a signal so that the block error rate meets the maximum block error rate required before transmission, while ensuring the maximum throughput under a small block error rate, and can avoid generating an excessively large block error rate before transmission, thereby achieving the effect of controlling the user's block error rate. The calculation method uses the AWGN channel transmission boundary as a reference, and selects the number of users that can be sent at one time and with the highest utilization efficiency by comparing the block error rates of different numbers of users under fixed channel parameters.

[0007] The channel model in the present invention is a non-orthogonal multiple access algorithm based on large-scale access. First, a number of users is selected and the block error rate at that time is calculated. If the block error rate does not meet the condition, the number of users is increased by one and the next iteration is entered. This is repeated until the block error rate exceeds the threshold constraint and the iteration ends.

[0008] The adaptive user deployment of the present invention comprises the following steps:

[0009] The schematic diagram of the adaptive allocation of the number of users according to different signal-to-noise ratios S of the present invention is as follows: Figure 1 As shown, firstly, the channel parameters are given as follows: the signal-to-noise ratio of the channel is S, and the noise of the Gaussian white noise channel is σ 2 , the encoding code length is n, the length of the information bit is k, and the maximum threshold of the total channel block error rate is set to T. According to the signal-to-noise ratio and channel noise, the user power is: P = Sσ 2 ; Initialize N = 1, and determine the number of users N according to the channel parameters, specifically:

[0010] Step 1. Let C = R, where R = k / n;

[0011] After obtaining l, round l upward to obtain L;

[0012] Step 2. Define the equation:

[0013] F(y)=n(P-2ln2·Ry)(-22ln2·Ry 2 +2ln2·R(1-P)y+PP 2 )+16ln2Py 2 =0

[0014] Where y=(Nl)P+1, solve all zero solutions l1≤l2≤l3 of F(y)=0, and take out the second zero solution l2; Step 3. Determine whether L≤1 is true, if so, execute step 31, otherwise go to step 32:

[0015] Step 31. Determine whether l2≥N is true. If so, the block error rate is obtained as P e1 :

[0016]

[0017] Otherwise, the block error rate is P e2 :

[0018]

[0019] Go to step 35;

[0020] Step 32. Determine whether L≥N is true. If so, proceed to step 33; otherwise, proceed to step 34:

[0021] Step 33. The block error rate is P e3 :

[0022]

[0023] Where K1 and K N for:

[0024]

[0025]

[0026] Go to step 35;

[0027] Step 34. The block error rate is P e4 :

[0028] P e4 =max{P e1 ,P e2 ,P e3}

[0029]

[0030]

[0031]

[0032]

[0033]

[0034] Step 35. Compare the obtained block error rate with the threshold T. If the block error rate is less than the threshold T, update N to N+1 and return to step 1 to recalculate the block error rate. Repeat until the obtained block error rate is greater than the threshold T, then update N to N-1 and output the maximum number of users N.

[0035] Step 4. After determining the number of users N, encode the N information with a length of k to be sent to obtain a codeword with a length of n and perform BPSK modulation.

[0036] The transmitter modulates the power, precoding and RF modulation in the same way as the traditional transmitter, and finally sends it to the antenna for transmission. The receiving process at the receiving end is the same as the traditional receiver except that power recovery is required after deprecoding. Power recovery is performed according to step 4. Since they are all routine operations, they will not be repeated here.

[0037] The beneficial effect of the present invention is that, without substantially changing the traditional transmission and reception process, the present invention plans the maximum value of the number of users N under fixed parameters through reasonable calculation before transmission, and satisfies the requirement that the block error rate required by the channel does not exceed the threshold, greatly reducing the waste of antenna transmission power, increasing the throughput of the channel, and improving the efficiency and reliability of transmission. By iteratively calculating the optimal number of users, serious erroneous user numbers can be avoided when the number of users is large, that is, the block error rate curve is much larger than the maximum block error rate required by the channel, thereby enabling the channel to have an adaptive user modulation function, and for the existing signal-to-noise ratio, the increase in the number of users can maximize the use of transmission power. BRIEF DESCRIPTION OF THE DRAWINGS

[0038] Figure 1 It is a schematic diagram of adaptive allocation of the number of users;

[0039] Figure 2 It is a schematic diagram of the process of the present invention. DETAILED DESCRIPTION

[0040] The technical method of the present invention is described in detail below in conjunction with the accompanying drawings and embodiments:

[0041] Example

[0042] The given channel parameters in this example are: the signal-to-noise ratio of the channel is S = 0.03, and the channel noise of the Gaussian white noise channel is σ 2=1, the encoding code length is n=10000, the information bit is k=30, and the channel maximum total block error rate threshold is set to T=10 -2 , so the user power is P = 0.03, assuming that the number of users is N = 1.

[0043] Step 1. Determine the value of l and the rounding point L when C = R: Calculate the channel capacity Equal to bit rate That is, the point at that time l≈-205.6 and rounded up to L=-205;

[0044] Step 2. Find the zero solution l2 of F(y)=0: Find all zero solutions l1≤l2≤l3 of the following equation F(y)=0, and take out the second zero solution l2≈-40, where y=(Nl)P+1.

[0045] F(y)=n(P-2ln2·Ry)(-22ln2·Ry 2 +2ln2·R(1-P)y+PP 2 )+16ln2Py 2 =0

[0046] Step 3. According to the relationship between L and 1, N, solve the block error rate in different situations:

[0047] Because L = -205 satisfies L ≤ 1, we jump to step 31, and because l2 ≤ N, the block error rate is calculated as P e2 =3.2×10 -14 , the block error rate and threshold 10 obtained according to the size of L and N -2 By comparison, we can get P e2 <10 -2 , then change N=1 to N=2 and go back to step 1. Repeat this cycle until the block error rate is just greater than 10 -2 , then subtract one from the number of users, and finally the maximum value of the number of users N is 453.

[0048] Step 4. According to the maximum number of users N calculated in steps 1-3, conventional encoding is performed on N information of length k to be sent to obtain a codeword of length n and perform BPSK modulation.

[0049] The transmitter modulates the power, precoding and RF modulation in the same way as the traditional transmitter, and finally sends it to the antenna for transmission. The receiving process at the receiving end is the same as the traditional receiver except that power recovery is required after deprecoding. Power recovery is performed according to step 4. Since they are all routine operations, they will not be repeated here.

Claims

1. A method for adaptively adjusting user allocation according to a channel, characterized in that: include: Given the following channel parameters: the signal-to-noise ratio of the channel is S, the noise of the Gaussian white noise channel is σ 2 , the encoding code length is n, the length of the information bit is k, the maximum threshold of the total channel block error rate is set to T, and the user power is P = Sσ 2 ; Initialize N=1, determine the number of users N according to the channel parameters and perform coding modulation, specifically: Step 1. Let C = R, where R = k / n; After obtaining l, round l upward to obtain L; Step 2. Define the equation: F(y)=n(P-2ln2·Ry)(-22ln2·Ry 2 +2ln2·R(1-P)y+P-P 2 )+16ln2Py 2 =0 Where y = (Nl)P + 1, find all zero solutions l1≤l2≤l3 of F(y) = 0, and take out the second zero solution l2; Step 3. Determine whether L≤1 holds. If so, proceed to step 31, otherwise proceed to step 32: Step 31. Determine whether l2≥N is true. If so, the block error rate is obtained as P e1 : Otherwise, the block error rate is P e2 : Go to step 35; Step 32. Determine whether L≥N is true. If so, proceed to step 33; otherwise, proceed to step 34: Step 33. The block error rate is P e3 : Where K1 and K2 are: Go to step 35; Step 34. The block error rate is P e4 : P e4 =max{P e1 ,P e2 ,P e3 } Step 35. Compare the obtained block error rate with the threshold T. If the block error rate is less than the threshold T, update N to N+1 and return to step 1 to recalculate the block error rate. Repeat until the obtained block error rate is greater than the threshold T, then update N to N-1 and output the maximum number of users N. Step 4. After determining the number of users N, encode the N information with a length of k to be sent to obtain a codeword with a length of n and perform BPSK modulation.