CN110875794B

CN110875794B - Multi-access method and device, and terminal

Info

Publication number: CN110875794B
Application number: CN201810917176.1A
Authority: CN
Inventors: 严春林; 袁志锋
Original assignee: ZTE Corp
Current assignee: ZTE Corp
Priority date: 2018-08-13
Filing date: 2018-08-13
Publication date: 2022-04-15
Anticipated expiration: 2038-08-13
Also published as: WO2020034942A1; CN110875794A

Abstract

The invention provides a multiple access method, a device and a terminal, wherein the method comprises the following steps: the input signal is processed by a plurality of paths of signals to obtain a plurality of paths of corresponding signals; wherein the multipath signal processing process comprises: adopting a bit randomization process for each path of signals; mapping a plurality of signal resources into one output signal; and transmitting the output signal. By the scheme of the invention, for the bit randomization of the multi-path signals, when high-order modulation is used, because the bit position adjustment is carried out, the bits are mapped to modulation symbols at the high-reliability positions of some signals, and at the low-reliability positions of other signals, modulation gain can be obtained when the signals are combined; in addition, in order to simplify the design of the interleaver, the interleaver function can be realized by using bit cyclic shift, and the cyclic shift randomizes the interference and reduces the signal processing delay.

Description

Multi-access method and device, and terminal

Technical Field

The present invention relates to the field of wireless communications, and in particular, to a multiple access method and apparatus, and a terminal.

Background

The multiple access technology is one of the key technologies for wireless communication. In the 5G era, the Internet of things will have great development, and 100 hundred million objects will be linked in the future. To support such a large number of object links, a new multiple access scheme needs to be employed. Through research, it is well known that non-orthogonal multiple access will be used to increase the number of users that can be accessed simultaneously.

Currently, the non-orthogonal multiple access techniques proposed by domestic companies mainly include a Multi-user shared access (MUSA) Multi-user shared access method, a Sparse Code Multiple Access (SCMA) access method, a Pattern Division Multiple Access (PDMA) access method, and an inter-division multiple access (IDMA) Multi-user access method.

The MUSA uses a large number of multi-element short spread spectrum sequences to spread user data and then shares the same resource block to transmit the user data. And by using the short spread spectrum sequence, the user channel matrix dimension is lower, and the processing complexity is lower. Conventional spreading sequences use 2-ary spreading sequences, i.e., spreading sequence elements of 1 and-1. The 2-ary sequences limit the number of sequences that produce low cross-correlation, thus making it difficult to support access to a large number of users. The complex spread spectrum sequence is used, a large number of spread spectrum sequences with low cross correlation are easy to generate, and the spread spectrum sequences with low cross correlation reduce the interference among multiple users, so that the access of a large number of users can be supported. Shown in fig. 1 is a schematic block diagram of the MUSA.

Where the spreading sequence is a complex number with real and imaginary values taken from the set {1,0, -1 }. User data is modulated after binary channel coding, and the modulated symbols are subjected to complex spreading.

Each user in interleaved multiple access uses a different interleaver, which is used to distinguish between users, and the schematic block diagram is shown in fig. 2.

User data is repeated for many times after binary sequence coding, then different users use different interleavers to carry out bit interleaving on the coded and repeated sequences, and the interleaved data enters a multiple access channel after being modulated. Repetition can be considered as a kind of spreading, but a sequence of [1, -1,1, -1. ] is used for spreading. According to the data in the prior literature, the interleaving multiple access supports the access of a large number of users, the maximum supportable user number can reach 64, and the interleaving multiple access method is a very excellent non-orthogonal multiple access method. Interlace multiple access uses an interleaver to distinguish users. This makes it easy to design a large number of interleavers, since the length of the interleavers is long. After passing through these interleavers, the interference is randomized and the useful signal is extracted.

SCMA uses sparse spreading and different bit to symbol mappings in the modulation. When using high order modulation, the reliability of each bit is not the same. Some bit reliabilities are high and some bit reliabilities are low. By using different bit-to-symbol mappings, the bits that need to be transmitted are transmitted on both the high and low reliability bits. When signals are combined, the combination of the high-reliability bit and the low-reliability bit effectively improves the system performance.

MUSA generally employs the same bit-to-symbol mapping when using higher order modulation. Some bits are always mapped to low reliable positions. When signals are combined, the reliability of the signals after combination is not high, and the system performance is reduced in some cases.

SCMA performs well, but generally uses MPA receivers, which are more complex. The use of EPA receivers can reduce complexity, but MMSE-SIC receivers and ESE receivers are generally incompatible, resulting in less flexibility. In addition, the spread spectrum length cannot be flexibly adjusted, and the multi-user support is not good under the low spectrum efficiency.

Therefore, it is desirable to obtain a solution that can remedy and improve the above-mentioned problems.

Disclosure of Invention

In order to solve the above problems, the present invention provides a multiple access method and apparatus, and a terminal, which can obtain modulation gain when signals are combined.

The invention provides a multiple access method, which comprises the following steps:

the input signal is processed by a plurality of paths of signals to obtain a plurality of paths of corresponding signals; wherein the multipath signal processing process comprises: adopting a bit randomization process for each path of signals;

mapping a plurality of signal resources into one output signal;

and transmitting the output signal.

The invention also provides a multiple access device, which is arranged on a terminal, and the device comprises:

the multi-path processing unit is used for executing a multi-path signal processing process on the input signal and acquiring a corresponding multi-path signal; wherein the multi-path processing unit comprises a bit randomization module: the bit randomization module is used for adopting a bit randomization process for each path of signals;

the resource mapping unit is used for mapping the multi-path signals into one path of output signals;

a transmitting unit for transmitting the output signal.

The invention also provides a terminal, which comprises a memory, a processor and a computer program stored on the memory and capable of running on the processor, wherein the processor executes the computer program to realize the processing of any multiple access method provided by the invention.

The invention also proposes a computer-readable storage medium on which a computer program is stored which, when being executed by a processor, carries out the processing of any one of the multiple access methods provided by the invention.

Compared with the prior art, the technical scheme provided by the invention comprises the following steps: the input signal is processed by a plurality of paths of signals to obtain a plurality of paths of corresponding signals; wherein the multipath signal processing process comprises: adopting a bit randomization process for each path of signals; mapping a plurality of signal resources into one output signal; and transmitting the output signal. By the scheme of the invention, for the bit randomization of the multi-path signals, when high-order modulation is used, because the bit position adjustment is carried out, the bits are mapped to modulation symbols at the high-reliability positions of some signals, and at the low-reliability positions of other signals, modulation gain can be obtained when the signals are combined; in addition, in order to simplify the design of the interleaver, the interleaver function can be realized by using bit cyclic shift, and the cyclic shift randomizes the interference and reduces the signal processing delay.

Drawings

The accompanying drawings in the embodiments of the present invention are described below, and the drawings in the embodiments are provided for further understanding of the present invention, and together with the description serve to explain the present invention without limiting the scope of the present invention.

Fig. 1 is a schematic block diagram of a MUSA in the related art;

FIG. 2 is a schematic block diagram of an interleaver in the related art;

fig. 3 is a flowchart illustrating a multiple access method according to an embodiment of the present invention.

Fig. 4 is a schematic block diagram illustrating a multiple access according to an embodiment of the present invention;

fig. 5 is a schematic block diagram of another multiple access according to an embodiment of the present invention;

FIG. 6 is a schematic illustration of the bit-to-symbol mapping defined by the 5G NR;

fig. 7 is a schematic diagram of performing orthogonal resource mapping on each channel of signals to obtain one channel of output signals according to an embodiment of the present invention.

Detailed Description

The following further description of the present invention, in order to facilitate understanding of those skilled in the art, is provided in conjunction with the accompanying drawings and is not intended to limit the scope of the present invention. In the present application, the embodiments and various aspects of the embodiments may be combined with each other without conflict.

In order to improve the weaknesses existing in the MUSA and SCMA, the embodiment of the invention provides a non-orthogonal multiple access method, in the technical scheme, information bits are coded by using different channel coders to obtain the same information bits and different check bits. This can also be achieved by using a low rate channel coding, using different check bits in the multiple data. The new method can obtain extra coding gain when the receiver performs signal combination, wherein the extra coding gain is obtained due to different check bits of multi-channel data of the transmitter. And carrying out bit randomization and scrambling operation on the coded bits. The bit randomization may be performed before or after the scrambling. Using bit randomization the benefits of interleaved multiple access, i.e. an ESE receiver can be used, while iterative decoding can achieve very good performance. One of the bit randomization realization modes is bit cyclic shift, and the other is block interleaving and bit position change in the symbol. The bit cyclic shift is simple to realize, and the cyclic processing time delay is small. When the bit cyclic shift is used, different paths of signals use different shift values, and the cyclic shift values of the signals meet a certain relation, so that some bits mapped to high-reliability positions are mapped to low-reliability positions on the other path of data when high-order modulation is used. Thus, the combining of multiple signals may improve system performance. Block interleaving means block interleaving of a plurality of bits in succession, rather than conventional bit-based interleaving. A block contains bits that are contained by one modulation symbol or bits that are contained by an integer number of symbols. The block length is large, which can reduce the signal processing delay, but reduce the gain brought by the interleaver. The block length is small, which increases the signal processing delay, but increases the gain brought by the interleaver. The actual system needs to be flexibly configured according to requirements. The principle of bit position change within a block is that bits previously mapped to high reliable positions are mapped to low reliable positions on another way of data.

For BPSK and QPSK, there are no high reliable bits and no low reliable bits. In order to make the related designs compatible with BPSK and QPSK, the same method as the high-order modulation can be used for these low-order modulations in the technical solution of the present invention, which unifies and simplifies the system design on the premise of not deteriorating the performance as much as possible.

Referring to fig. 3, the present invention provides a data transmission method, including:

step 100, the input signal is processed by a plurality of paths of signals to obtain a plurality of paths of corresponding signals;

the input signal Data stream can represent a path of signal, and the path of signal is respectively input to K encoders; or the signal is divided into K paths of same or different signals, and the K paths of signals are respectively input into K encoders;

in the embodiment of the invention, the number of the multi-path signals is K paths for explanation; k is an integer greater than 1;

wherein the multipath signal processing process comprises: different bit randomization processes are applied to each signal.

Step 200, mapping a plurality of signal resources into one output signal;

for example, mapping a plurality of signals into one output signal; for example, multiple signals are combined into one output signal.

And step 300, sending the output signal.

The multipath signal processing process comprises the following steps: processing of channel coding, bit randomization, bit scrambling, modulation, and spreading is performed on each signal;

the step 100 comprises:

step 110, performing channel coding on one path of input signal A1 to obtain a channel-coded signal A2;

wherein the channel coding the input signal a1 comprises:

mode 1-1, using the same coding matrix to perform channel coding on input signals respectively; when the input information bits before encoding are the same, the generated encoding bits are also the same; or the like, or, alternatively,

mode 1-2, channel coding is performed on an input signal by using different channel coding matrixes; when all paths of input information bits before coding are the same, the generated coding bits are not completely the same;

mode 1-3, an encoder is used to perform channel coding on an input signal to generate a path of coded bits.

For example, if each channel encoder inputs the same information bit, the encoded result of each channel encoder is the same;

for example, if each channel encoder inputs the same information bit, the encoded result of each channel encoder is different;

in the method 1-3, after encoding, the encoded bits need to be divided into K channels of signals, and there are various dividing methods;

dividing the coded bits into K paths of signals, wherein the bits of the signals of all paths have no common part; or the like, or, alternatively,

dividing the coded bits into K paths of signals, wherein the bits of each path of signals are completely the same; or the like, or, alternatively,

and copying the coded bits into K paths of signals, wherein the bits of all the paths of signals are completely the same.

Step 120, performing bit randomization on the signal a2 to obtain a bit-randomized signal A3;

step 130, performing bit scrambling on the signal A3 to obtain a bit scrambled signal A4;

wherein the order of step 120 and step 130 can be changed, that is, the bit randomization can be operated before the bit scrambling; bit randomization may also operate after bit scrambling.

Step 140, modulating the signal A4 to obtain a modulated signal A5;

step 150, spreading the signal a5 to obtain a spread signal a 6;

the signal A6 obtained through the above process is one of the multiple paths of signals;

in one example, the bit randomization process in step 120 includes:

step 121, block interleaving is carried out on the signals;

the length of the block is F times the number of bits contained in each symbol; f is a positive integer;

in step 121, the same block interleaving method is used for each path of signal;

step 122, after block interleaving, block interleaving is performed for each block, where the block interleaving includes interleaving of FX bits in the block, and X is the number of bits included in each symbol.

Wherein the principle of FX bit in-block interleaving in the block is that the average block error rate after combining each path of signals is minimum;

wherein, the interleaving in each signal block follows the following principle:

dividing bit positions into a first reliable position area and a second reliable position area, wherein in the first path of signals, part of the bit positions are located in the first reliable position area; part of bit numbers are located in a second reliable position area;

in the second path of signal, there are two cases:

mode 1: relative to the first path of signals, converting the bit number which is positioned in the first reliable position area to a second reliable position area, and converting the bit number which is positioned in the second reliable position area to the first reliable position area;

mode 2: relative to the first path of signal, the bit number in the first reliable position area still locates in the first reliable position area, but the relative order of each bit number in the area changes; the bit number in the second reliable position area still locates in the second reliable position area, but the relative order of each bit number in the area changes;

preferentially selecting a mode 1, if the number of signal paths is large, and signals with enough paths cannot be obtained through the regional alternation of the mode 1, obtaining more signals after bit randomization by adopting a mode 2;

the following is described with reference to two specific examples:

taking 16QAM as an example, 4 bits are mapped to one symbol, e.g., a1a2a3a 4. The 4 bits have a high bit reliability of two bits, such as a1a2, and a low bit reliability of two bits, such as a3a 4.

If the transmitter has two paths of data to be transmitted, the first path of signal is at the bit of the high-reliability position, and the other paths of signals are at the low-reliability position. If the information bit is a1a2a3a4, the first signal is bit randomized to obtain "a 1a2a3a 4" or "a 2a1a4a 3", and the second signal is bit randomized to obtain "a 3a4a1a 2" or "a 4a3a2a 1". Wherein the positions of a1 and a2 can be interchanged, and the positions of a3 and a4 can be interchanged.

If the transmitter has four channels of data to transmit, the four channels of signals may be as follows: the first signal "a 1a2a3a 4", the second signal "a 2a1a4a 3", the third signal "a 3a41a1a 2", and the fourth signal "a 4a3a2a 1". Wherein the positions of a1 and a2 can be interchanged, and the positions of a3 and a4 can be interchanged.

In the above example, the bit is divided into the first reliable location area and the second reliable location area, and the reliable locations may be divided into more than two levels, for example, when S reliable location areas are included, S is an integer greater than 1;

the interleaving of FX bits in each signal block follows the following principle:

under the condition that the bit is divided into S reliable position areas, in the first path of signal, each bit is respectively positioned in the S reliable position areas;

in the mode 1, in the second path of signals, relative to the first path of signals, the bit number which is located in a certain reliable position area before is converted into another reliable position area;

for example, the number of bits previously located in the first reliable location area is converted to the second reliable location area; the bit number which is positioned in the S-1 reliable position area before is converted into the S reliable position area;

mode 2: relative to the first path of signals, the bit number in a certain reliable position area still locates in the same reliable position area, but the relative order of each bit number in the area changes;

for example, the number of bits previously located in the first reliable location area still lies in the first reliable location area; the bit number previously located in the S-th reliable location area is still located in the S-th reliable location area.

In one example, the bit randomization process in step 120 includes:

and step 125, realizing bit randomization through cyclic shift.

For example, in the case that there are K channels of data to be transmitted, the ith channel of data may be cyclically shifted by x_iSub, i is an integer of 1 to K, x_iWhen i has different values, x_iThe values of (a) are also different.

The multiple access method provided by the embodiment of the invention can use different channel codes. Additional coding gain can be obtained when the signals are combined; bit randomization is used; when high-order modulation is used, because bit position adjustment is carried out, the bits are mapped to high-reliability positions of some signals when modulation symbols are mapped, and modulation gain can be obtained when signals are combined at low-reliability positions of other signals; additional code domain gain can be achieved using different spreading codes.

In the embodiment of the invention, for the bit randomization of the multi-path signals, when high-order modulation is used, because the bit position adjustment is carried out, the bits are mapped to the high-reliability positions of some signals when modulation symbols are mapped, and the modulation gain can be obtained when the signals are combined at the low-reliability positions of other signals; in addition, in order to simplify the design of the interleaver, the interleaver function can be realized by using bit cyclic shift, and the cyclic shift randomizes the interference and reduces the signal processing delay. In addition, different channel coding matrixes can be used for coding, and extra coding gain can be obtained when signals are combined; the multipath signals can be subjected to different phase rotations and power scaling; phase rotation and power scaling can reduce PAPR (peak-to-average ratio) of the superimposed signal.

The following description is made with reference to specific embodiments.

Example 1

The bit randomization of each signal is achieved by bit cyclic shifting. The bit cyclic shift values of the multi-path signals meet a certain relation to ensure that when high-order modulation is used, some bits mapped to high-reliability positions are mapped to low-reliability positions on the other path of data. Thus, the combining of multiple signals may improve system performance.

Taking 16QAM as an example, when using the bit-to-symbol mapping defined by 5G NR, 4 bits are mapped to one symbol. Of the 4 bits, the first two are high reliable bits and the last two are low reliable bits. When K is 2, the number of cyclic shifts of the two signals can be shown in the following table (a and B are integers):

TABLE 1 Cyclic Shift count of two signals

The bit relative displacement values of the two paths of signals meet 4X +2(X is an integer).

Taking 64QAM as an example, when using the bit-to-symbol mapping defined by 5G NR, 6 bits are mapped to one symbol. Of the 6 bits, the first two are high reliable bits, the middle two are medium reliable bits, and the last two are low reliable bits. When K is 2, the number of cyclic shifts of the two signals can be shown in the following table (a and B are integers):

TABLE 2 Cyclic Shift count of two signals

The bit relative displacement values of the two paths of signals meet 6X +3(X is an integer).

When BPSK or QPSK modulation is used, the number of cyclic shifts of the multiplexed data can be any integer since the bit reliabilities are the same.

TABLE 3 Cyclic Shift value of two signals

For simplicity of system design, the 16QAM or 64QAM cyclic shift values can also be used for multiple signals using BPSK or QPSK.

Example 2

Bit randomization of each path of signal is firstly carried out block interleaving, and then position interleaving of every X bits (X bits are mapped into a symbol) in the block is carried out;

the position interleaving principle of X bits (X bits are mapped into a symbol) of the multi-path signal is that the block error rate is minimum;

one method of minimum block error rate after combination is that on some signals, the bit is at the high reliable position, and on other signals, the bit is at the low reliable position;

the bit positions at the bit high reliable position can be interchanged, and the bit positions at the bit low reliable position can be interchanged;

block interleaving is performed on the coded bits. It is assumed here that X bits are mapped to one symbol. The relationship between modulation scheme and X is shown in table 4:

modulation	X
		BPSK
	1
		QPSK	2
16QAM	4
		64QAM	6
256QAM	8

TABLE 4 relationship between modulation scheme and X

The block size is an integer multiple of X, and the block size is mX (m is a positive integer). After block interleaving, the same operation is performed every X bits within the block. Taking 16QAM as an example, 4 bits are mapped to one symbol, e.g., a1a2a3a 4. The 4 bits have a high bit reliability of two bits, such as a1a2, and a low bit reliability of two bits, such as a3a 4. If the transmitter has two paths of data to be transmitted, the first path of signal is at the bit of the high-reliability position, and the other paths of signals are at the low-reliability position. If the information bit is a1a2a3a4, the first signal is bit randomized to obtain "a 1a2a3a 4" or "a 2a1a4a 3", and the second signal is bit randomized to obtain "a 3a4a1a 2" or "a 4a3a2a 1". Wherein the positions of a1 and a2, a3 and a4 can be interchanged.

If there are 4 paths in total, the signal can be as follows:

the first signal "a 1a2a3a 4", the second signal "a 2a1a4a 3", the third signal "a 3a41a1a 2", and the fourth signal "a 4a3a2a 1". Wherein the positions of a1 and a2, a3 and a4 can be interchanged.

Taking 64QAM as an example, 6 bits are mapped to one symbol, e.g., a1a2a3a4a5a 6. The 6 bits have two bits with higher reliability, such as a1a2, and the two bits with lower reliability, such as a5a6, such as a3a 4. If the transmitter has two paths of data to be transmitted, the first path of signal is at the bit of the high-reliability position, and the other paths of signals are at the low-reliability position. If the information bit is a1a2a3a4a5a6, the first signal is bit-randomized to obtain "a 1a2a3a4a5a 6" or "a 2a1a4a3a6a 5", and the second signal is bit-randomized to obtain "a 6a5a4a3a2a 1" or "a 5a6a3a4a1a 2".

If the transmitter has two paths of data to be transmitted, the first path of signal is at the bit of the high-reliability position, and the other paths of signals are at the low-reliability position. If the information bit is a1a2a3a4a5a6, the first signal is bit-randomized to obtain "a 1a2a3a4a5a 6" or "a 2a1a4a3a6a 5", and the second signal is bit-randomized to obtain "a 6a5a4a3a2a 1" or "a 5a6a3a4a1a 2". Wherein the positions of a1 and a2, a3 and a4, and a5 and a6 can be interchanged.

If there are 3 paths, the signal can be as follows:

the first signal "a 1a2a3a4a5a 6", the second signal "a 3a4a5a6a1a 2", and the third signal "a 5a6a1a2a3a 4". Wherein the positions of a1 and a2, a3 and a4, and a5 and a6 can be interchanged.

Example 3

The user cyclic shift value may be uniquely bound with the UE ID. The cyclic shift of the first path of data of each user has a corresponding relation with the UE ID, and the ith path of data has a fixed relation with the 1 st path of data cyclic shift. Thus, when the UE ID is known, the cyclic shift value of each signal of all users can be uniquely obtained, so as to facilitate cyclic detection by the receiver.

So that different users can be distinguished by the phase-varying interleaver, which shifts the sequence.

Example 4

Bit block interleaving of each signal can be realized by cyclic shift;

each path of signal cyclic shift value of each user can be bound with the UE ID;

therefore, the cyclic shift times of all paths of the user are uniquely determined after the UE ID is determined, and the equivalent interleavers used by different paths of information of different users are different.

The block interleaving of each path of signals can obtain a new block interleaver through the cyclic shift of a mother interleaver;

the parent interleaver may be [1,2, 3. ], i.e., no changes are made to the input signal.

Bit interleaving in the block is related to the modulation order and the number of paths of signal transmission;

the block interleaving of each path of signal can be used for randomizing the bits by using the cyclic shift of the bits after channel coding;

example 5

The bit randomization of each signal path may be a combination of the above methods.

For example, cyclic shift may be performed first, followed by block interleaving. The general principle is that the block error rate is minimum after the bit randomization and the combination of the multipath signals.

The block interleaver is bound to the UEID and is generated by a parent interleaver.

Each path of signal is subjected to coding, bit randomization, scrambling and modulation, and then spread spectrum is carried out, and when the number of signal paths is not more than the length of a spread spectrum code, spread spectrum is carried out by using the spread spectrum code in orthogonal design;

the spreading sequence may be selected from the sequence [1, -1,1, -1,1, -1,1], which is a repeat of [1, -1 ]. When the length is 1, the spreading sequence is [1 ]; when the length is 2, the spreading sequence is [1, -1 ]; when the length is 3, the spreading sequence is [1, -1,1 ]; when the length is 4, the spreading sequence is [1, -1,1, -1 ]; when the length is 5, the spreading sequence is [1, -1,1, -1,1 ]; when the length is 6, the spreading sequence is [1, -1,1, -1,1, -1 ]. Spreading sequences of other lengths, and so on.

There may be a plurality of spreading sequences of the same length. If it is a two-way signal, the spreading sequence is 2, then the selected spreading sequence may be (where j is²＝-1)

[1,1]

[1-1]

[1j]

[1-j]

If two signals are used and the spreading sequence is 3, the selected spreading sequence may be

[1,0,j]

[1,0,-j]

[1,j,0]

[0,1,-1]

[1,0,1]

[1,1,0]

[1,-j,0]

[0,1,j]

[1,0,-1]

[1,-1,0]

[0,1,1]

[0,1,-j]

If two signals are used and the spreading sequence is 4, the selected spreading sequence may be

[1 1 0 0]

[1-1 0 0]

[1j 0 0]

[1-j 0 0]

[1 0 1 0]

[1 0-1 0]

[1 0j 0]

[1 0-j 0]

[1 0 0 1]

[1 0 0-1]

[1 0 0 j]

[1 0 0-j]

[1 0 1 0]

[1 0-1 0]

[1 0 j 0]

[1 0-j 0]

[1 0 0 1]

[1 0 0-1]

[1 0 0 j]

[1 0 0-j]

[0,1,1,0]

[0,1,-1,0]

[0,1,j,0]

[0,1,-j,0]

[0,0,1,1]

[0,0,1,-1]

[0,0,1,-j]

[0,0,1,j]

[0,1,0,1]

[0,1,0,-1]

[0,1,0,j]

[0,1,0,-j]

If the spread spectrum sequence is [ 1-1 ] and two paths of signals, the sequence [ 1-1 ] is divided into two small sequences to obtain [1] and [ -1], and the two small sequences are respectively used for spreading the two paths of signals. And mapping the two paths of spread signals to the final signal in an orthogonal manner through resource mapping.

If the spread spectrum sequence is [1,0, -1] and two paths of signals, the sequence [1,0, -1] is divided into two small sequences to obtain [1,0] and [ -1], and the two small sequences are respectively used for spreading the two paths of signals. And mapping the two paths of spread signals to the final signal in an orthogonal manner through resource mapping.

If the spread spectrum sequence is [0,0,1, -1] and two paths of signals, the sequence [0,0,1, -1] is divided into two small sequences, each small sequence has a non-zero value, and [0,1] and [0, -1] are obtained, and the two small sequences are respectively used for spreading the two paths of signals. And mapping the two paths of spread signals to the final signal in an orthogonal manner through resource mapping.

If the spreading sequence is [1,0,0,1, -1], three-way signal, the sequence [1,0,0,1, -1] is divided into three small sequences, each of which has a non-zero value, resulting in [1,0], [0,1] and [ -1], and the three small sequences are used for three-way signal spreading, respectively. And mapping the three paths of spread signals to final signals in an orthogonal manner through resource mapping.

In the case of two signals, the non-zero values of each sequence of the spreading sequences of different lengths are at least two. One of the benefits of using non-zero values is to reduce inter-user interference. When the multiplex signal is K paths, the nonzero values of each sequence of the spreading sequences with different lengths are at least K. The spreading sequence is divided into K small sequences, each having a non-zero value for processing the input signal.

Each path of signal is subjected to coding, bit randomization, scrambling and modulation and then is subjected to spread spectrum, when the number of signal paths is greater than the length of a spread spectrum code, the spread spectrum code of a spread spectrum code set is used for spreading spectrum, the spread spectrum code selection principle is that the spread spectrum codes are sorted from small to large according to the correlation, the front sequence is an orthogonal sequence, and the correlation of the rear sequence is gradually increased. The sequences with small cross-correlation are selected first, and then the spread spectrum sequences with large cross-correlation are selected.

And respectively carrying out channel coding on the user information to obtain different check bits. The coded bits are bit randomized separately. After bit randomization, bit scrambling, modulation and spreading are carried out. Different channels of signals are spread using different spreading codes (a common K channel signal).

The core is 1. different channel encoders are used, different encoding bits are obtained after encoding, and encoding gain can be obtained after signals at a receiving end are combined. In some cases, such as high overload, the encoder may be the same. When the encoders are the same, the signal modulated by the two paths of signals can be regarded as 4-length spread spectrum used by the transmitter after being spread by two-length spread spectrum codes, and signal detection is facilitated.

Bit randomization is used. The bit information bits after the multi-channel signal coding are the same, and the check bits can be the same or different. The bit randomization principle is that after the multi-path data is combined by the receiver through bit randomization, the block error rate is minimum. When high-order modulation is used, when the bit of one path of data is modulated to be in a high-reliability position, the bit of the other path of data is in a low-reliability position.

Bit randomization may improve block interleaving and bit position re-alignment within a symbol within a block.

Based on the same or similar concept as the above embodiments, the embodiment of the present invention further provides a multiple access apparatus, referring to fig. 4, the multiple access apparatus provided by the present invention includes:

a transmitting unit for transmitting the output signal.

In the embodiment of the invention, the number of the multipath signals is K paths;

the multi-path processing unit further comprises:

the encoding module is connected with the bit randomization module, the output of the encoding module is connected to the input end of the bit randomization module, and the encoding module is used for encoding the signal input by the input end of the encoding module;

the bit scrambling module is connected with the bit randomizing module, the output of the bit scrambling module is connected to the input end of the bit randomizing module, or the input end of the bit scrambling module is connected to the output end of the bit randomizing module, and the bit scrambling module is used for carrying out bit scrambling on a signal input by the input end of the bit scrambling module;

a modulation module and a spread spectrum module; the modulation module is used for modulating the signal input by the input end of the modulation module; the spread spectrum module is used for spreading the spectrum of the signal input by the input end; modulation and spreading are performed after bit randomization.

In the embodiment of the invention, the number of the channel coding modules is K, and each channel coding module processes one channel of K channels of signals respectively;

the K channel coding modules respectively carry out channel coding on input signals by using the same coding matrix; when the input information bits of each channel coding module are the same, the generated coding bits are also the same; or the like, or, alternatively,

the K channel coding modules use different channel coding matrixes to perform channel coding on the input signals; when the input information bits of the channel coding modules are the same, the generated code bits are not completely the same.

In the embodiment of the present invention, the number of the channel coding modules is 1, and the output ends of the channel coding modules are respectively connected to K bit randomization modules: the channel coding module performs channel coding on one input signal at the input end to generate one coded bit.

In the embodiment of the invention, the multiple access device further comprises a splitter, wherein the splitter is used for splitting the coded bits into K paths of signals;

the splitter divides the coded bits into K paths of signals, and the bits of the signals have no common part; or the like, or, alternatively,

the splitter divides the coded bits into K paths of signals, and the bits of each path of signals have partial bits which are completely the same; or the like, or, alternatively,

the splitter copies the coded bits into K paths of signals, and the bits of the signals of all paths are completely the same.

In this embodiment of the present invention, the bit randomizing module is configured to:

block interleaving the signal; the length of the block is F times the number of bits contained in each symbol; f is a positive integer;

after block interleaving, block interleaving is performed for each block, where the block interleaving includes interleaving FX bits in the block, and X is the number of bits included in each symbol.

In the embodiment of the invention, the same block interleaver is used in the K-path signal processing; or the like, or, alternatively,

different block interleavers are used in the K paths of signal processing; or the like, or, alternatively,

random interleavers are used as block interleavers in the K-path signal processing.

In the embodiment of the present invention, before the block interleaving, cyclic shift is performed.

In the embodiment of the invention, the relative value of the cyclic shift value of the ith signal and the cyclic shift value of the (i-1) th signal is m_iX+y，m_iAnd y is an integer; i is an integer greater than 1 and less than or equal to K. m is_iThe role of y is to make the bits mapped to the positions with different reliabilities during modulation to improve the system performance.

In the embodiment of the present invention, a specific example is m_iAnd y is 0. The spread symbols are identical, which is beneficial for processing by using CDMA techniques, such as MMSE-SIC receiver, or suppressing the interference between users by using MMSE.

In the embodiment of the invention, the principle of the intra-block interleaving is that after bits are modulated to symbols, received signals are demodulated, and the block error rate is the minimum after K paths of signals are combined.

In the embodiment of the invention, each path of signal is circularly shifted, and the selection principle of the circular shift value is to demodulate the received signal, so that the block error rate is minimum after the K paths of signals are combined.

In the embodiment of the present invention, the length of a block is FX bits, and every X bits are processed as follows: x bits are mapped to one symbol, and the X bits have different reliabilities.

Under the condition that the bit is divided into S reliable position areas, in the first path of signal, each bit is respectively positioned in the S reliable position areas; wherein S is an integer greater than 1;

in the ith path of signals, relative to the first path of signals and other paths of signals, the bit number which is positioned in a certain reliable position area before is converted into another reliable position area; or, relative to the first path signal and other paths of signals, the bit number in a certain reliable position area is still in the same reliable position area, but the relative sequence of each bit number in the area changes; i is an integer greater than 1 and less than or equal to K.

In the embodiment of the present invention, the first and second substrates,

when BPSK modulation is used, X is 1;

when QPSK modulation is used, X is 2;

when 16QAM is used, X is 4;

when 64QAM is used, X is 6;

when 256QAM is used, X is 8.

In the embodiment of the present invention, intra-block interleaving is performed as follows:

when BPSK modulation is used, bits in the block are subjected to random position transformation or cyclic shift;

when the modulation order is greater than BPSK, the blocks have FX bits in total, and every X bits are operated as follows:

when QPSK modulation is used, the bit reliabilities are the same; when two paths of signals exist, two bits of the first path of signals are mutually exchanged or unchanged at the position of the second path of signals;

when using 16QAM modulation, the bit-to-symbol mapping defined by the 5G NR is shown in fig. 6. The first two bits map to high reliable positions and the last two bits map to low reliable positions. When there are two paths of signals, the first path is located at two bits with high reliability, and the second path is located at a position with low reliability. This can be achieved by that the bit cyclic shift value relative value of the two encoded signals is 4X + y, and y is 2;

when 64QAM modulation is used, the first two bits are mapped to high-reliability positions, the middle two bits are in medium-reliability positions, and the last two bits are mapped to low-reliability bits; when there are two paths of signals, the first path of signal is located at two high-reliability bits and at the position of the second path of low-reliability bits. The first path of signal is positioned at two bits with low reliability and is positioned at the position of a high-reliability bit of the second path of signal; the first path of signal is located at two bits with medium reliability and is located at a position with medium reliability of the second path of signal; two high-reliability bits, two medium-reliability bits and two low-reliability bits can be interchanged at two bits with the same reliability;

when 256QAM modulation is used, the bit reliability is divided into 4 levels, namely c1, c2, c3, c4, reliability c1> c2> c3> c 4; when two paths of signals exist, two bits of the first path of signals located at the reliability c1 are located at the position of the second path of signals reliability c 4; two bits of the first path of signal located at reliability c2 are located at the position of reliability c3 of the second path of signal; two bits of the first path of signal located at reliability c3 are located at the position of reliability c2 of the second path of signal; two bits of the first path of signal located at reliability c4 are located at the position of reliability c1 of the second path of signal; two bit positions that are equally reliable can be interchanged.

In the embodiment of the invention, bit randomization in the block is realized through bit position conversion, and the bit position conversion of each path of signal is related to the number and the modulation mode of a plurality of paths of signals.

In the embodiment of the invention, each path of signal block interleaver can be set to [1,2, 3. ], so that the interleaver does not change the position of the input bit.

In the embodiment of the invention, a multi-channel signal block interleaver, bit randomization in a block, the number of multi-channel signal paths, a modulation mode and a code rate are predefined and bound with a UE ID, or are informed by a control channel or a wireless resource control signaling.

In the embodiment of the invention, the bit randomization of each path of signal is carried out by a corresponding block interleaver; and acquiring a block interleaver corresponding to any channel of signal by the master interleaver.

In the embodiment of the invention, the mother interleaver is an interleaver acquired by each user.

In an embodiment of the present invention, the parent interleaver may be set to [1,2, 3. ], such that the parent interleaver does not change the position of the input bits. The parent interleaver may also be arranged as an interleaver that changes the input bit positions.

In the embodiment of the invention, each path of signal block interleaver of each user is obtained by circularly shifting a mother interleaver.

In the embodiment of the present invention, the number of cyclic shifts may be uniquely generated by the UE ID.

In this embodiment of the present invention, the spreading module is further configured to: the spreading sequence contains a large number of zero elements. When using iterative detection, these zero elements can break short loops to improve system performance. When MMSE is used for suppressing interference between users, zero elements can reduce the computational complexity.

In this embodiment of the present invention, the spreading module is further configured to: the spreading sequence is selected from the group consisting of [1, -1,1, -1,1, -1,. ].

In this embodiment of the present invention, the spreading module is further configured to set the spreading sequence as follows:

the number of elements in the spreading sequence with the length of m is set to be m;

for example, a spreading sequence of length 1 is [1 ]; the spreading sequence of length 2 is [1, -1 ]; the spreading sequence of length 3 is [1, -1,1 ]; the spreading sequence of length 4 is [1, -1,1, -1 ].

In this embodiment of the present invention, the spreading module is further configured to, when the length is 2, set the spreading sequence to include at least one of the following sequences:

[1,1]

[1-1]

[1j]

[1-j]

when the length is 3, the spreading sequence is set to include at least one of the following sequences:

[1,0,j]

[1,0,-j]

[1,j,0]

[0,1,-1]

[1,0,1]

[1,1,0]

[1,-j,0]

[0,1,j]

[1,0,-1]

[1,-1,0]

[0,1,1]

[0,1,-j]

the length is 4, the spreading sequence is set to be the length of 2, and the principle of the combination is as follows: and traversing all possible combinations, and selecting K sequences with minimum cross correlation.

The length is 4, and the spreading sequence comprises at least one of the following sequences:

[1 1 0 0]

[1-1 0 0]

[1j 0 0]

[1-j 0 0]

[1 0 1 0]

[1 0-1 0]

[1 0j 0]

[1 0-j 0]

[1 0 0 1]

[1 0 0-1]

[1 0 0 j]

[1 0 0-j]

[1 0 1 0]

[1 0-1 0]

[1 0 j 0]

[1 0-j 0]

[1 0 0 1]

[1 0 0-1]

[1 0 0 j]

[1 0 0-j]

[0,1,1,0]

[0,1,-1,0]

[0,1,j,0]

[0,1,-j,0]

[0,0,1,1]

[0,0,1,-1]

[0,0,1,-j]

[0,0,1,j]

[0,1,0,1]

[0,1,0,-1]

[0,1,0,j]

[0,1,0,-j]

when the length of the other spread spectrum sequences is equal, a plurality of nonzero elements are arranged in the spread spectrum sequences, the nonzero elements are selected from the set {1, -1, j, -j }, and other elements are zero. For example, the 5 long spreading sequences may be [1,0,0, j, -1] or [1,0,0, -j,0 ].

In this embodiment of the present invention, the mapping the multiple channels of signals into one output signal by the resource mapping unit includes:

and performing phase rotation and power scaling on each path of signal, and then adding the signals to obtain the path of output signal.

Wherein the power factor and the phase factor are set so that a peak-to-average power ratio (PAPR) of the addition signal is minimized in performing the power scaling and the phase rotation.

In an embodiment of the present invention, the power scaling includes:

after the power of the multipath signals is scaled, the average power of the added signals is 1.

In an embodiment of the present invention, the power scaling includes:

the power scaling factor size is determined by the control channel, or radio resource control signaling.

In an embodiment of the present invention, the power scaling includes:

the power scaling factor is used for determining the transmission power of the uplink signal reversely according to the average downlink received signal power.

In this embodiment of the present invention, the mapping the multiple channels of signals into one output signal by the resource mapping unit includes: and carrying out orthogonal resource mapping on each path of signal to obtain the path of output signal. Fig. 7 is an exemplary schematic diagram of performing orthogonal resource mapping on each path of signals to obtain one path of output signals, which is used to illustrate that two paths of signals before resource mapping, one path of 3 signals and one path of 2 signals, are subjected to orthogonal mapping on 5 resources after resource mapping.

Based on the same or similar conception as the above embodiment, the embodiment of the present invention further provides a terminal, including a memory, a processor, and a computer program stored on the memory and executable on the processor, where the processor executes the computer program to implement the processing of any one of the methods provided by the embodiment of the present invention.

Based on the same or similar concepts as those of the above embodiments, the embodiments of the present invention also provide a computer-readable storage medium on which a computer program is stored, the computer program, when executed by a processor, implementing the processing of any one of the methods provided by the embodiments of the present invention.

It should be noted that the above-mentioned embodiments are only for facilitating the understanding of those skilled in the art, and are not intended to limit the scope of the present invention, and any obvious substitutions, modifications, etc. made by those skilled in the art without departing from the inventive concept of the present invention are within the scope of the present invention.

Claims

1. A multiple access method, the method comprising:

mapping a plurality of signal resources into one output signal;

transmitting the output signal; the number of the multi-path signals is K paths; the multipath signal processing process further comprises: further comprising channel coding prior to said bit randomization; k is an integer greater than 1; the bit randomization process comprises: carrying out cyclic shift on the coded bits of each channel;

the bit randomization process comprises: the relative values of the cyclic shift value of the ith signal and the cyclic shift value of the (i-1) th signal are

，

And

is an integer; i is an integer greater than 1 and less than or equal to K;

the cyclic shift includes:

the value of (A) is set according to the modulation order and the size of K; when a QPSK modulation is used, the signal quality,

set to any integer; when 16QAM modulation is used, K is 2,

2; when the K is equal to 4, the reaction solution is,

=1 or

= 2; when 64QAM modulation is used, K is 2,

= 3; when the K is 3, the reaction solution is,

= 2; when 256QAM modulation is used, K is 2,

= 4; when the K is equal to 4, the reaction solution is,

=2。

2. the multiple access method of claim 1, wherein the multipath signal processing procedure further comprises:

further comprising bit scrambling before or after said bit randomization;

modulation and spreading are also included after the bit randomization.

3. The multiple access method of claim 2, wherein the channel coding comprises:

respectively carrying out channel coding on input signals by using the same coding matrix; when the input information bits before encoding are the same, the generated encoding bits are also the same; or the like, or, alternatively,

performing channel coding on an input signal by using different channel coding matrixes; when the input information bits before encoding are all the same, the generated encoding bits are not completely the same.

4. The multiple access method of claim 2, wherein the channel coding comprises:

an encoder is used for carrying out channel coding on an input signal to generate a path of coded bits.

5. The multiple access method of claim 4,

6. The multiple access method of claim 2, wherein the bit randomization process is performed in at least one of the following ways:

block interleaving the signal; the length of the block is F times the number of bits contained in each symbol; f is a positive integer; after block interleaving is carried out, block interleaving of each block is respectively carried out, wherein the block interleaving comprises interleaving of FX bits in the block, and X is the number of bits contained in each symbol;

carrying out cyclic shift on the coded bits of each channel; block interleaving the signal after the cyclic shift; the length of the block is F times the number of bits contained in each symbol; f is a positive integer; after block interleaving, block interleaving is performed for each block, where the block interleaving includes interleaving FX bits in the block, and X is the number of bits included in each symbol.

7. The multiple access method of claim 1, wherein the cyclic shift comprises:

in cyclic shift

The value of (a) is such that the average block error rate after the combining of the multipath signals is minimized.

8. The multiple access method of claim 1,

=0，

=0。

9. the multiple access method of claim 6,

the same block interleaver is used in the K-path signal processing; or the like, or, alternatively,

10. The multiple access method of claim 6 wherein the principle of intra-block interleaving is that bits are modulated into symbols, and then the received signals are demodulated, and the average block error rate is minimized after combining the K-way signals.

11. The multiple access method of claim 6,

the block length is FX bits, and intra-block interleaving is performed as follows: every X bits are processed as follows: mapping X bits into a symbol, wherein the reliability of the X bits is different;

12. The multiple access method of claim 6, wherein,

with BPSK modulation, X = 1;

when QPSK modulation is used, X = 2;

when 16QAM is used, X = 4;

when 64QAM is used, X = 6;

with 256QAM, X = 8.

13. The multiple access method of claim 10,

intra-block interleaving is performed as follows:

when 16QAM modulation is used, the first two bits are mapped to high-reliability positions, and the second two bits are mapped to low-reliability positions; when two paths of signals exist, the first path of signals are positioned at the high-reliability position, and the two bits are positioned at the low-reliability position of the second path of signals;

when 64QAM modulation is used, the first two bits are mapped to high-reliability positions, the middle two bits are in medium-reliability positions, and the last two bits are mapped to low-reliability bits; when two paths of signals exist, the first path of signals are positioned at the high-reliability position, and the two bits are positioned at the low-reliability position of the second path of signals; the first path of signal is positioned at the position where two bits with low reliability are positioned at the position where the second path of signal is positioned with high reliability; the first path of signal is located at the position with medium reliability, and the two bits with medium reliability are located at the position with medium reliability of the second path of signal; two high-reliability bits, two medium-reliability bits and two low-reliability bits can be interchanged at two bits with the same reliability;

when using 256AM modulation, the bit reliability is divided into 4 levels, c1, c2, c3, c4, reliability c1> c2> c3> c 4; when two paths of signals exist, two bits of the first path of signals located at the reliability c1 are located at the position of the second path of signals reliability c 4; two bits of the first path of signal located at reliability c2 are located at the position of reliability c3 of the second path of signal; two bits of the first path of signal located at reliability c3 are located at the position of reliability c2 of the second path of signal; two bits of the first path of signal located at reliability c4 are located at the position of reliability c1 of the second path of signal; two bit positions that are equally reliable can be interchanged.

14. The multiple access method of claim 6,

the bit position conversion of each signal is related to the number of multi-path signals and the modulation mode.

15. The multiple access method of claim 6,

each path signal block interleaver is set to [1,2, 3. ], so that the interleaver does not change the position of the input bits.

16. The multiple access method of claim 6,

presetting multi-channel signal block interleaver, bit randomization in block, multi-channel signal path number, modulation mode and code rate

The multi-channel signal block interleaver, bit randomization in the block, the number of multi-channel signal paths, modulation mode, code rate and UE ID binding, and notifying through control channel or wireless resource control signaling.

17. The multiple access method of claim 2,

the bit randomization of each path of signal is carried out by a corresponding block interleaver; and acquiring a block interleaver corresponding to any channel of signal by the master interleaver.

18. The multiple access method of claim 17, wherein the parent interleaver is an interleaver known to the respective user.

19. The multiple access method according to claim 18, wherein for the known interleaver, it is set to [1,2, 3. ], so that the interleaver does not change the position of the input bits.

20. The multiple access method of claim 19 wherein each channel signal block interleaver for each user is cyclically shifted by a parent interleaver.

21. The multiple access method of claim 20, wherein the number of cyclic shifts is uniquely generated by the UE ID.

22. The multiple access method of claim 2, wherein the spreading comprises:

the spreading sequence is arranged to include at least two non-zero values, and the sequence elements are arranged to contain one or more zeros when the length of the spreading sequence is greater than 2.

23. The multiple access method according to claim 2, wherein the spreading is set as follows:

the spreading sequence is selected from the group consisting of [1, -1,1, -1,1, -1,. ].

24. The multiple access method of claim 22, wherein the spreading sequence is set as follows:

the number of elements in the spreading sequence with the length of m is m;

wherein, the spreading sequence with the length of 1 is [1 ]; the spreading sequence of length 2 is [1, -1 ]; the spreading sequence of length 3 is [1, -1,1 ]; the spreading sequence of length 4 is [1, -1,1, -1 ].

25. The multiple access method according to claim 22, wherein the number of paths in the multipath signal is 2, and the spreading sequence is set as follows:

the spreading sequence includes at least one of a sequence having a length of 2,

：

[1,1]

[1 -1]

[1 j]

[1 -j]

the spreading sequence comprises at least one of the following sequences when the length is 3:

[1,0,j]

[1,0,-j]

[1,j,0]

[0,1,-1]

[1,0,1]

[1,1,0]

[1,-j,0]

[0,1,j]

[1,0,-1]

[1,-1,0]

[0,1,1]

[0,1,-j]

length 4, the spreading sequences are arranged to be combined according to the sequence in the spreading sequences with length 2, and the principle of the combination is as follows: traversing all the possible combinations, and selecting K sequences with minimum cross-correlation;

[1 1 0 0]

[1 -1 0 0]

[1 j 0 0]

[1 -j 0 0]

[1 0 1 0]

[1 0 -1 0]

[1 0 j 0]

[1 0 -j 0]

[1 0 0 1]

[1 0 0 -1]

[1 0 0 j]

[1 0 0 -j]

[1 0 1 0]

[1 0 -1 0]

[1 0 j 0]

[1 0 -j 0]

[1 0 0 1]

[1 0 0 -1]

[1 0 0 j]

[1 0 0 -j]

[0,1,1,0]

[0,1,-1,0]

[0,1,j,0]

[0,1,-j,0]

[0,0,1,1]

[0,0,1,-1]

[0,0,1,-j]

[0,0,1,j]

[0,1,0,1]

[0,1,0,-1]

[0,1,0,j]

[0,1,0,-j]

when the length of the spread spectrum sequence is other spread spectrum sequences, two nonzero elements are arranged in the spread spectrum sequence, the nonzero elements are selected from the set {1, -1, j, -j }, and other elements are zero;

each sequence in the spread spectrum sequence has two nonzero values, and for two paths of signals of a multi-path signal, the spread spectrum sequence of each path of signal is divided into two small sequences, and each small sequence contains one nonzero value.

26. The multiple access method of claim 22 wherein when the number of signal paths equals a (a >2 integer), the spreading sequence has a non-zero values, and each signal spreading sequence divides the spreading sequence into a small sequences, each small sequence having a non-zero value.

27. The multiple access method of claim 1, wherein the mapping the multiple signal resources into one output signal comprises:

28. The multiple access method of claim 27, wherein the phase rotation comprises:

the phase factor is chosen to minimize the peak-to-average power ratio (PAPR) of the summed signal.

29. The multiple access method of claim 27, wherein the power scaling is performed in at least one of the following ways:

after the power of the multi-channel signals is scaled, the average power of the added signals is 1;

the size of the power scaling factor is determined by a control channel or radio resource control signaling;

30. The multiple access method of claim 1, wherein the mapping the multiple signal resources into one output signal comprises:

and carrying out orthogonal resource mapping on each path of signal to obtain the path of output signal.

31. A multiple access apparatus provided in a terminal, the apparatus comprising:

a transmitting unit for transmitting the output signal;

the number of the multi-path signals is K paths; the multi-path processing unit further comprises: the encoding module is connected with the bit randomization module, the output of the encoding module is connected to the input end of the bit randomization module, and the encoding module is used for encoding the signal input by the input end of the encoding module;

the bit randomization module, when configured to employ a bit randomization process, is specifically configured to: carrying out cyclic shift on the coded bits of each channel; the bit randomization process comprises: the relative values of the cyclic shift value of the ith signal and the cyclic shift value of the (i-1) th signal are

，

And

is an integer; i is an integer greater than 1 and less than or equal to K;

the cyclic shift includes:

set to any integer; when in use16QAM modulation, when K is 2,

2; when the K is equal to 4, the reaction solution is,

=1 or

= 2; when 64QAM modulation is used, K is 2,

= 3; when the K is 3, the reaction solution is,

= 2; when 256QAM modulation is used, K is 2,

= 4; when the K is equal to 4, the reaction solution is,

=2。

32. a terminal comprising a memory, a processor and a computer program stored on the memory and executable on the processor, wherein the processor when executing the computer program implements the process of the method of any one of claims 1 to 30.

33. A computer-readable storage medium, on which a computer program is stored, which, when being executed by a processor, carries out the processing of the method according to any one of claims 1 to 30.