WO2020034942A1 - 一种多址接入方法和装置、及终端 - Google Patents

一种多址接入方法和装置、及终端 Download PDF

Info

Publication number
WO2020034942A1
WO2020034942A1 PCT/CN2019/100346 CN2019100346W WO2020034942A1 WO 2020034942 A1 WO2020034942 A1 WO 2020034942A1 CN 2019100346 W CN2019100346 W CN 2019100346W WO 2020034942 A1 WO2020034942 A1 WO 2020034942A1
Authority
WO
WIPO (PCT)
Prior art keywords
signal
bits
channel
signals
block
Prior art date
Application number
PCT/CN2019/100346
Other languages
English (en)
French (fr)
Inventor
严春林
袁志锋
Original Assignee
中兴通讯股份有限公司
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by 中兴通讯股份有限公司 filed Critical 中兴通讯股份有限公司
Publication of WO2020034942A1 publication Critical patent/WO2020034942A1/zh

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00—Arrangements for detecting or preventing errors in the information received
    • H04L1/004—Arrangements for detecting or preventing errors in the information received by using forward error control
    • H04L1/0056—Systems characterized by the type of code used
    • H04L1/0071—Use of interleaving
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04B—TRANSMISSION
    • H04B1/00—Details of transmission systems, not covered by a single one of groups H04B3/00 - H04B13/00; Details of transmission systems not characterised by the medium used for transmission
    • H04B1/69—Spread spectrum techniques
    • H04B1/707—Spread spectrum techniques using direct sequence modulation
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00—Arrangements for detecting or preventing errors in the information received
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00—Arrangements for detecting or preventing errors in the information received
    • H04L1/004—Arrangements for detecting or preventing errors in the information received by using forward error control
    • H04L1/0041—Arrangements at the transmitter end
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00—Arrangements for detecting or preventing errors in the information received
    • H04L1/004—Arrangements for detecting or preventing errors in the information received by using forward error control
    • H04L1/0041—Arrangements at the transmitter end
    • H04L1/0043—Realisations of complexity reduction techniques, e.g. use of look-up tables
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00—Arrangements for detecting or preventing errors in the information received
    • H04L1/004—Arrangements for detecting or preventing errors in the information received by using forward error control
    • H04L1/0045—Arrangements at the receiver end
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00—Arrangements for detecting or preventing errors in the information received
    • H04L1/004—Arrangements for detecting or preventing errors in the information received by using forward error control
    • H04L1/0045—Arrangements at the receiver end
    • H04L1/0052—Realisations of complexity reduction techniques, e.g. pipelining or use of look-up tables
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00—Arrangements for detecting or preventing errors in the information received
    • H04L1/004—Arrangements for detecting or preventing errors in the information received by using forward error control
    • H04L1/0056—Systems characterized by the type of code used
    • H04L1/0061—Error detection codes

Definitions

  • the present application relates to the field of wireless communications, and in particular, to a multiple-access method and device, and a terminal.
  • Non-orthogonal multiple access technologies mainly include multi-user shared access (MUSA) method, sparse code-based multiple access (SCMA) method, pattern division multiple access (Pattern division multiple access, PDMA) method, and IDMA (Interleaver-division multiple access) method.
  • MUSA multi-user shared access
  • SCMA sparse code-based multiple access
  • PDMA pattern division multiple access
  • IDMA Interleaver-division multiple access
  • MUSA uses a large number of multivariate short-spreading sequences to spread user data and then share the same resource block to transmit user data.
  • short spreading sequences the user channel matrix has a lower dimension and less processing complexity.
  • the conventional spreading sequence uses a two-ary spreading sequence, that is, the spreading sequence elements are 1 and -1.
  • the two-ary spreading sequence limits the number of low cross-correlation sequences generated. In this way, it is difficult to support a large number of users.
  • the use of complex spreading sequences can easily generate a large number of low cross-correlation spreading sequences.
  • the low cross-correlation spreading sequences reduce interference between multiple users, which can support a large number of user access.
  • Figure 1 shows the principle block diagram of MUSA.
  • the spreading sequence in FIG. 1 is a complex number, and the real and imaginary values are taken from the set ⁇ 1, 0, -1 ⁇ .
  • the user data is subjected to data modulation after binary channel coding, and the modulated symbols are subjected to complex spreading.
  • Each user in interleaving multiple access uses a different interleaver.
  • the interleaver is used to distinguish users.
  • the schematic block diagram is shown in Figure 2.
  • the user data is repeated multiple times after being encoded by the binary sequence, and then different users use different interleavers to bit-interleave the encoded and repeated sequences.
  • the interleaved data is modulated into a multiple-access channel.
  • repetition can be regarded as a kind of spread spectrum, but a sequence of [1, -1, 1, -1, ...] is used for spread spectrum.
  • Interleaved multiple access supports a large number of users, and the maximum number of users that can be supported is up to 64. It is an excellent non-orthogonal multiple access method.
  • Interleaving multiple access uses an interleaver to distinguish users. Due to the long length of the interleaver, it is easy to design a large number of interleavers. After different user data passes these interleavers, the interference is randomized, and the useful signals are extracted.
  • SCMA uses sparse spread spectrum, and modulation uses different bit-to-symbol mapping.
  • the reliability of each bit is different. Some bits have higher reliability, and some bits have lower reliability.
  • bit-to-symbol mappings the bits that need to be transmitted are transmitted on both the highly reliable bits and the low-reliable bits.
  • MUSA generally uses the same bit-to-symbol mapping when using higher-order modulation. Some bits are always mapped to low reliability locations. When signals are combined, their combined reliability is not high, which reduces system performance in some cases.
  • SCMA has better performance, but generally uses a message passing algorithm (MPA) receiver, and its complexity is large.
  • MPA message passing algorithm
  • EPA Expanded Polytope Algorithm
  • MMSE-SIC Minimum Mean Squared Error-Successive Interference Cancellation
  • ESE Simple Signal Estimator
  • This application proposes a multiple-access method and device, and a terminal, which can obtain modulation gain when signals are combined.
  • This application proposes a multiple-access method, which includes:
  • the input signal undergoes a multi-channel signal processing process to obtain a corresponding multi-channel signal, wherein the multi-channel signal processing process includes: using a bit randomization process for each signal;
  • This application also proposes a multiple-access device, which is arranged on a terminal, and the device includes:
  • a multi-path processing unit is configured to perform a multi-path signal processing process on an input signal to obtain a corresponding multi-path signal; wherein the multi-path processing unit includes a bit randomization module: the bit randomization module is used for each signal Using a bit randomization process;
  • a resource mapping unit configured to map multiple signals into one output signal
  • a sending unit configured to send the output signal.
  • This application also proposes a terminal, which includes a memory, a processor, and a computer program stored on the memory and executable on the processor.
  • a terminal which includes a memory, a processor, and a computer program stored on the memory and executable on the processor.
  • the processor executes the computer program, any task provided in the application is implemented A multiple access method.
  • the present invention also proposes a computer-readable storage medium on which a computer program is stored, and the computer program, when executed by a processor, implements any of the multiple-access methods provided in this application.
  • the technical solution provided by the present application includes: input signals are subjected to multiple signal processing processes to obtain corresponding multiple signals; wherein the multiple signal processing processes include: using a bit randomization process for each signal Mapping multiple signal resources into one output signal; sending the output signal.
  • bit randomization process for bit randomization of multiple signals, when high-order modulation is used, because bit positions are adjusted, these bits are mapped to modulation symbols at high-reliability positions of some signals and at low-reliability of other signals. Position, you can obtain the modulation gain when combining signals; in addition, to simplify the design of the interleaver, you can use the bit cyclic shift to implement the interleaver function. The cyclic shift both randomizes the interference and reduces the signal processing delay .
  • FIG. 1 is a schematic block diagram of MUSA in the related art
  • FIG. 2 is a schematic block diagram of an interleaver in the related art
  • FIG. 3 is a schematic flowchart of a multiple-access method according to an embodiment of the present invention.
  • FIG. 4 is a schematic block diagram of multiple access according to an embodiment of the present invention.
  • FIG. 5 is a schematic block diagram of still another type of multiple access according to an embodiment of the present invention.
  • FIG. 6 is a schematic diagram of bit-to-symbol mapping defined by 5G New Radio Access Technology (NR);
  • FIG. 7 is a schematic diagram of obtaining an output signal by performing orthogonal resource mapping on each signal according to an embodiment of the present invention.
  • an embodiment of the present invention provides a non-orthogonal multiple access method.
  • information bits are encoded using different channel encoders to obtain the same information bits and different Check bits. This can also be achieved by using low bit rate channel coding and using different check bits for multiple channels of data.
  • the method provided by the embodiment of the present invention can obtain additional coding gain.
  • the additional coding gain is obtained because the multi-channel data of the transmitter uses different check bits.
  • the encoded bits are subjected to bit randomization and scrambling operations. Bit randomization can be performed before or after scrambling.
  • bit randomization With bit randomization, the benefits of interleaving multiple access can be obtained, that is, an ESE receiver can be used, and at the same time, iterative decoding can achieve good performance.
  • One implementation of bit randomization is bit cyclic shifting, and the other implementation of bit randomization is block interleaving and bit position change in symbols.
  • the bit cyclic shift is simple to implement and the cyclic processing delay is also small.
  • bit cyclic shifting is used, different channels of signals use different shift values, and the cyclic shift values of each signal meet a certain relationship to ensure that when using high-order modulation, some bits mapped to highly reliable positions are on the other channel of data. Maps to a low-reliability location. In this way, system performance can be improved when multiple signals are combined.
  • Block interleaving means that multiple consecutive bits are used for block interleaving, instead of the traditional bit-based interleaving.
  • a block contains the bits contained by one modulation symbol or the bits contained by an integer number of symbols.
  • the block length is relatively large, the signal processing delay can be reduced, but the gain brought by the interleaver is also reduced.
  • the block length is relatively 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 changing the bit position in a block is that the bits that were previously mapped to the highly reliable position are mapped to the low-reliability position on another channel of data.
  • BPSK Binary Phase Shift Keying
  • QPSK Quadrature Phase Shift Keying
  • this application proposes a data transmission method.
  • the method includes:
  • Step 100 The input signal undergoes a multi-channel signal processing process to obtain a corresponding multi-channel signal.
  • the input signal Data stream can be expressed as a signal, which is input to K encoders respectively; it can also be expressed that this signal is divided into K channels of the same or different signals, and these K signals are input to K encoders respectively .
  • the number of multi-channel signals is described as K channels; K is an integer greater than 1.
  • the multi-channel signal processing process includes: using different bit randomization processes for each signal.
  • Step 200 Map multiple signal resources into one output signal.
  • mapping multiple signals into one output signal for example, combining multiple signals into one output signal.
  • Step 300 Send the output signal.
  • the multi-channel signal processing process includes: performing channel coding, bit randomization, bit scrambling, modulation, and spreading on each signal.
  • Step 100 includes:
  • Step 110 Channel-encode an input signal A1 to obtain a channel-encoded signal A2.
  • the channel coding of the input signal A1 includes:
  • Method 1-1 Use the same coding matrix to perform channel coding on the input signals respectively; where the input information bits before coding are the same, the generated coding bits are also the same; or,
  • Mode 1-2 Use different channel coding matrices to perform channel coding on the input signal; where the input information bits before coding are the same, the generated coding bits are not completely the same; or,
  • Modes 1-3 Use an encoder to perform channel coding on the input signal to generate a coded bit.
  • the encoding result is the same for each channel encoder.
  • each channel encoder For example, if the same information bits are input for each signal, the encoding result of each channel encoder is different.
  • the encoded bits need to be divided into K-channel signals, and there are multiple division methods.
  • the encoded bits are divided into K-channel signals, and the bits of each signal have no common part; or, the encoded bits are divided into K-channel signals, and the bits of each signal are partially the same; or, after encoding, The bits are copied into K signals, and the bits of each signal are exactly the same.
  • Step 120 Perform bit randomization on the signal A2 to obtain a bit randomized signal A3.
  • Step 130 Perform bit scrambling on the signal A3 to obtain a bit scrambled signal A4.
  • steps 120 and 130 can be changed, that is, bit randomization can be operated before bit scrambling; bit randomization can also be operated after bit scrambling.
  • Step 140 Modulate the signal A4 to obtain a modulated signal A5.
  • Step 150 Spread the signal A5 to obtain a spread signal A6.
  • the signal A6 obtained through the above process is one of multiple signals.
  • bit randomization process in step 120 includes:
  • Step 121 Perform block interleaving on the signal.
  • the block length is F times the number of bits contained in each symbol; F is a positive integer.
  • step 121 the same block interleaving method is used for each signal.
  • Step 122 After performing block interleaving, perform intra-block interleaving of each block, wherein the intra-block interleaving includes interleaving of FX bits in the block, and X is the number of bits included in each symbol.
  • the principle of intra-block interleaving of FX bits in a block is that the average block error rate after the signals of each channel are combined is the smallest.
  • the bits are divided into a first reliable position area and a second reliable position area.
  • first signal part of the bits are located in the first reliable position area; part of the bits are located in the second reliable position area.
  • Method 1 With respect to the first signal, the number of bits previously located in the first reliable position area is transformed into the second reliable location area, and the number of bits previously located in the second reliable position area is transformed into the first reliable location area.
  • Method 2 Relative to the first signal, the number of bits located in the first reliable position area is still located in the first reliable position area, but the relative order of the bits in the area changes; the number of bits located in the second reliable position area It is still located in the second reliable position region, but the relative order of the number of bits in the region changes.
  • Method 1 is preferentially selected. If there are a large number of signal paths, and a sufficient number of signals cannot be obtained through the regional rotation of method 1, then method 2 is used to obtain more randomized signals.
  • quadrature amplitude modulation 4 bits are mapped to a symbol, such as a1a2a3a4. Two of these four bits have higher reliability, such as a1 and a2, and the two bits have lower reliability, such as a3 and a4.
  • the bits in the first channel at a highly reliable position are in a low reliability position on the other channels.
  • the information bits are a1a2a3a4
  • the first signal is bit-randomized to obtain "a1a2a3a4" or "a2a1a4a3”
  • the second signal is bit-randomized to obtain "a3a4a1a2" or "a4a3a2a1”.
  • the positions of a1 and a2 can be interchanged, and the positions of a3 and a4 can be interchanged.
  • the transmitter has four channels of data to transmit, the four channels can be as follows: the first channel is "a1a2a3a4", the second channel is “a2a1a4a3", the third channel is “a3a41a1a2”, and the fourth channel is "a4a3a2a1".
  • the positions of a1 and a2 can be interchanged, and the positions of a3 and a4 can be interchanged.
  • the bit is divided into the first reliable position area and the second reliable position area as an example.
  • the reliable position may be divided into two or more levels. For example, when S reliable position areas are included, S is an integer greater than 1.
  • each bit number is located in each of the S reliable position regions.
  • Method 1 In the second signal, compared with the first signal, the number of bits previously located in one reliable position area is transformed to another reliable position area.
  • the number of bits previously located in the first reliable position area is transformed into the second reliable position area; the number of bits previously located in the S-1th reliable position area is transformed into the S-th reliable position area.
  • Method 2 Relative to the first signal, the number of bits located in a certain reliable location area is still located in the same reliable location area, but the relative order of the bits in the area changes.
  • the number of bits previously located in the first reliable position area is still located in the first reliable position area.
  • the number of bits previously located in the S-th reliable position area is still in the S-th reliable position area.
  • bit randomization process in step 120 includes:
  • Step 125 Realize bit randomization through cyclic shift.
  • the i-th path data may cyclic shift times x i, i is greater than or equal K and an integer less than or equal to 1, x i is not the same value, the value of x i in the i Not the same.
  • different channel codes can be used. Additional coding gain can be obtained when signals are combined; bit randomization is used; when high-order modulation is used, due to the bit position adjustment, these bits are mapped to modulation symbols at highly reliable positions in some signals, Low-reliability position. When combining signals, modulation gain can be obtained. Using different spreading codes, additional code-domain gain can be obtained.
  • bit randomization of multiple signals when high-order modulation is used, because bit positions are adjusted, these bits are mapped to modulation symbols at high-reliability positions of some signals and low-reliability of other signals. Position, you can obtain the modulation gain when combining signals; in addition, to simplify the design of the interleaver, you can use the bit cyclic shift to implement the interleaver function. The cyclic shift both randomizes the interference and reduces the signal processing delay .
  • different channel coding matrices can be used for coding, and additional coding gain can be obtained when signals are combined; multiple signals can be subjected to different phase rotation and power scaling; phase rotation and power scaling can reduce the PAPR (peak-to-average ratio) of the superimposed signal .
  • the bit randomization of each signal is realized by bit cyclic shift.
  • the bit cyclic shift value of the multi-channel signal satisfies a certain relationship to ensure that when using high-order modulation, some bits mapped to a highly reliable position are mapped to a low-reliable position on another channel of data. In this way, system performance can be improved when multiple signals are combined.
  • bit shift values of these two signals satisfy 4X + 2 (X is an integer).
  • the number of cyclic shifts of the multiplexed data can be any integer.
  • multiple signals can also use the cyclic shift value in 16QAM or 64QAM.
  • each signal first performs block interleaving, and then performs position interleaving every X bits (X bits are mapped to one symbol) in the block.
  • the principle of position interleaving of X bits in a multiplex signal is the minimum block error rate.
  • One method to achieve the minimum block error rate after merging is to use bits that are located at highly reliable positions on some signals and to be located in low reliability positions on other signals.
  • the positions of the bits in the highly reliable position can be interchanged, and the positions of the bits in the low reliable position can be interchanged.
  • the block size is an integer multiple of X. Let the block size be mX (m is a positive integer). After block interleaving, the same operation is performed every X bits in the block. Take 16QAM as an example, 4 bits are mapped to a symbol, such as a1a2a3a4. Two of these four bits have higher reliability, such as a1a2, and the two bits have lower reliability, such as a3a4. If the transmitter has two channels of data to be transmitted, the bit in the first channel signal is in a highly reliable position, and the other channel signals are in a low reliability position.
  • the first signal is bit-randomized to obtain “a1a2a3a4" or “a2a1a4a3”
  • the second signal is bit-randomized to obtain “a3a4a1a2” or "a4a3a2a1”.
  • a1 and a2, a3 and a4 positions can be interchanged.
  • the signals can be as follows:
  • 6 bits are mapped to a symbol, such as a1a2a3a4a5a6.
  • Two of the six bits have higher reliability, such as a1a2, and two bits have a higher reliability, such as a3a4, and two bits have lower reliability, such as a5a6. If the transmitter has two channels of data to be transmitted, the bit in the first channel signal is in a highly reliable position, and the other channel signals are in a low reliability position.
  • the first signal is bit-randomized to get “a1a2a3a4a5a6” or “a2a1a4a3a6a5"
  • the second signal is bit-randomized to get “a6a5a4a3a2a1” or "a5a6a3a4a1a2".
  • the bit in the first channel signal is in a highly reliable position, and the other channel signals are in a low reliability position.
  • the information bits are a1a2a3a4a5a6, the first signal is bit-randomized to get “a1a2a3a4a5a6" or "a2a1a4a3a6a5", and the second signal is bit-randomized to get “a6a5a4a3a2a1" or "a5a6a3a4a1a2".
  • a1 and a2, a3 and a4, a5 and a6 positions can be interchanged.
  • the signals can be as follows: the first signal "a1a2a3a4a5a6", the second signal “a3a4a5a6a1a2”, and the third signal "a5a6a1a2a3a4".
  • a1 and a2, a3 and a4, a5 and a6 positions can be interchanged.
  • the user's cyclic shift value can be uniquely bound to the user equipment identity (User Equipment Identity) UE ID.
  • the cyclic shift value of the first channel data of each user has a corresponding relationship with the UE ID, and the ith channel data has a fixed relationship with the cyclic shift value of the first channel data. In this way, when the UE ID is known, the cyclic shift value of each signal of all users can be uniquely obtained, which is beneficial for the receiver to perform cyclic detection.
  • the bit block interleaving of each signal can be realized by cyclic shift.
  • the cyclic shift value of each signal of each user can be bound to the UE ID.
  • the equivalent interleaver used by the different channel information of different users is different.
  • the block interleaving of each signal can be obtained by cyclic shift of a mother interleaver.
  • the mother interleaver can be [1, 2, 3, ...], that is, the input signal is not changed.
  • Intra-block bit interleaving is related to the number of modulation orders and the number of signal transmissions.
  • the block interleaving of each signal can cyclically shift the channel-coded bits as a bit randomization process.
  • the bit randomization of each signal can be a combination of the above methods.
  • cyclic shift can be performed before block interleaving.
  • the general principle is that the bit error rate is the smallest after the bits are randomized and the multiple signals are combined.
  • the block interleaver is bound to the UE ID and is generated by a mother interleaver.
  • Each signal is coded, bits are randomized, scrambled, and spread after modulation.
  • the spreading code is orthogonally designed for spreading.
  • the spreading sequence can be selected from the sequence [1, -1, 1, -1, 1, -1, ...], which is a repeat of [1, -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];
  • 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 At this time, the spreading sequence is [1, -1, 1, -1, 1, -1].
  • the selected spreading sequence can 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].
  • the selected spreading sequence can be: [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]; [1,0,0,1] [1,0,0, -1]; [1,0,0, j]; [1,0,0, -j]; [0,1,
  • the sequence [1, -1] is divided into two small sequences to obtain [1] and [-1]. These two small sequences are used for two Signal spread spectrum.
  • the two-channel spread-spectrum signals are orthogonally mapped to the final signal through resource mapping.
  • the spreading sequence is [1, 0, -1] and two signals
  • the sequence [1, 0, -1] is divided into two small sequences, and [1, 0] and [-1] are obtained. Small sequences are used for spreading the two signals.
  • the two-channel spread-spectrum signals are orthogonally mapped to the final signal through resource mapping.
  • the spreading sequence is [0, 0, 1, -1]
  • the sequence [0, 0, 1, -1] is divided into two small sequences, each of which has a non-zero value, [0,1] and [0, -1] are obtained, and these two small sequences are respectively used for spreading of two signals.
  • the two-channel spread-spectrum signals are orthogonally mapped to the final signal through resource mapping.
  • the spreading sequence is [1, 0, 0, 1, -1] and three signals
  • the sequence [1, 0, 0, 1, -1] is divided into three small sequences, each of which has one Non-zero values, [1, 0], [0, 1], and [-1] are obtained. These three small sequences are used for three-way signal spreading.
  • the three-way spread-spectrum signals are orthogonally mapped to the final signal through resource mapping.
  • the non-zero value of each of the spreading sequences of different lengths is at least two.
  • One of the benefits of using a non-zero value is to reduce interference between users.
  • the multi-channel signals are K channels, there are at least K non-zero values of each sequence in the spreading sequences of different lengths.
  • the spreading sequence is divided into K small sequences, each of which has a non-zero value for processing the input signal.
  • Each channel is coded, bits are randomized, scrambled, and spread after modulation.
  • the spreading code using the spreading code set is used for spreading.
  • the principle of spreading code selection The spreading codes are sorted in descending order according to the correlation.
  • the preceding sequence is an orthogonal sequence, and the subsequent sequence has a gradually increasing correlation. First select the sequence with small cross-correlation, and then select the spreading sequence with large cross-correlation.
  • User information is channel-coded separately to obtain different check bits.
  • the encoded bits are each bit randomized. After the bits are randomized, the bits are scrambled, modulated, and spread. Different channels of signals are spread using different spreading codes (a total of K signals).
  • the core of this embodiment is: different channel encoders are used to obtain different encoded bits after encoding, and the receiving end signals can be combined to obtain the encoding gain. In some cases, such as high overload, the encoder can be the same. When the encoders are the same, the signals modulated by the two signals are spread with a 2-long spreading code, and it can be considered that the transmitter uses 4-long spreading, which is conducive to signal detection.
  • bit randomization The information bits of the multiplexed signals are the same, and the check bits may be the same or different.
  • the principle of bit randomization is that the multi-channel data undergoes bit randomization after the receivers are combined, and the block error rate is the smallest.
  • high-order modulation when the bits of one channel of data are in a highly reliable position after being modulated, then they are located in a low-reliability position on the other channel.
  • Bit randomization can be obtained by block interleaving and readjusting the bit position within a symbol within a block.
  • a multiple-access device provided by this application includes: a multi-path processing unit, configured to: The input signal performs a multi-channel signal processing process to obtain a corresponding multi-channel signal; wherein the multi-channel processing unit includes a bit randomization module: the bit randomization module is used to apply a bit randomization process to each signal; resource mapping A unit for mapping multiple signals into one output signal; and a sending unit for sending the output signal.
  • the number of the multi-channel signals is K channels.
  • the multi-channel processing unit further includes: an encoding module, the encoding module is connected to the bit randomization module, and the output of the encoding module is connected to the input of the bit randomization module, and the encoding module is configured to encode the signal input at its input.
  • Bit scramble module the bit scramble module is connected with the bit randomization module, the output of the bit scramble module is connected to the input of the bit randomization module, or the input of the bit scramble module is connected to the output of the bit randomization module End, the bit scrambling module is used to bit scramble the signal input at its input; the modulation module and the spread spectrum module; the modulation module is used to modulate the signal input at its input; the spread spectrum module is used at its input The input signal is spread-spectrum; modulation and spread-spectrum are performed after bit randomization.
  • the number of the channel coding modules is K, and each channel coding module processes one of the K signals.
  • the K channel coding modules use the same coding matrix to perform channel coding on the input signal. Among them, when the input information bits of each channel coding module are the same, the generated coding bits are also the same; or, the K channel coding modules use different The channel coding matrix performs channel coding on the input signal; wherein, when the input information bits of each channel coding module are the same, the generated coding bits are not completely the same.
  • the number of the channel coding modules is one, and the output ends of the channel coding modules are respectively connected to K bit randomization modules: wherein the one channel coding module performs channel coding on an input signal of an input terminal. To generate a single encoded bit.
  • the multiple-access device further includes a splitter, and the splitter is configured to divide the encoded bits into K-channel signals. After the splitter divides the encoded bits into K-channel signals, the bits of each signal have no common part; or, after the splitter divides the encoded bits into K-channel signals, the bits of each signal have some bits Exactly the same; or, the splitter copies the encoded bits into K-channel signals, and the bits of each channel are exactly the same.
  • the bit randomization module is used to: block interleave signals; the length of the block is F times the number of bits included in each symbol; F is a positive integer; after block interleaving, each Intra-block interleaving of a block, where inter-block interleaving includes interleaving of FX bits in the block, and X is the number of bits included in each symbol.
  • the same block interleaver is used in the K-channel signal processing; or, different block interleavers are used in the K-channel signal processing; or, a random interleaver is used as the block interleaver in the K-channel signal processing.
  • the cyclic shift is performed before the block interleaving.
  • the relative value of the cyclic shift value of the i-th signal and the cyclic shift value of the i-1th signal is m i X + y, where m i and y are integers; i is greater than 1 and less than Or an integer equal to K.
  • mi is to randomize the bits
  • y is to make the bits mapped to different locations with different reliability during modulation to improve system performance.
  • CDMA Code Division Multiple Access
  • the principle of inter-block interleaving is that after the bit is modulated to a symbol, the received signal is demodulated, and the K-channel signal is combined with the smallest block error rate.
  • the signals of each channel are cyclically shifted, and the principle of selecting the cyclic shift value is to demodulate the received signal, and the K-channel signals are combined to minimize the block error rate.
  • the length of the block is FX bits, and each X bit is processed as follows: X bits are mapped to one symbol, and the reliability of the X bits is different.
  • each bit number is located in each of the S reliable position areas, where S is an integer greater than 1.
  • the number of bits previously located in a certain reliable position area is changed to another reliable position area; or, relative to the first signal and other signals, it is located in The number of bits in a certain reliable location area is still in the same reliable location area, but the relative order of the bits in the area changes; i is an integer greater than 1 and less than or equal to K.
  • X 1 when using BPSK modulation
  • X 2 when using QPSK modulation
  • X 4 when using 16QAM
  • X 6 when using 64QAM
  • X 8 when using 256QAM.
  • intra-block interleaving is performed as follows:
  • the bits in the block undergo random position transformation or cyclic shift.
  • each X bit performs the following operations:
  • bit-to-symbol mapping defined by 5GNR is shown in Figure 6.
  • the first two bits are mapped to a highly reliable position, and the last two bits are mapped to a low reliability position.
  • the first two bits are mapped to a highly reliable position, the middle two bits are mapped to a moderately reliable position, and the last two bits are mapped to a low-reliable position; when there are two signals, the first signal is It is located in the two bits with high reliability, and in the position of the second low reliability bit.
  • the first signal is located in two low-reliable bits, and the second signal is in high-reliable bits; the first signal is located in two moderate-reliable bits, in the middle-reliable position of the second signal;
  • the two bit positions are interchangeable.
  • the bit reliability is divided into 4 levels, which are c1, c2, c3, and c4, and the reliability is c1> c2> c3> c4; when there are two signals, they are located in the first signal.
  • the two bits of the property c1 are located in the reliability c4 of the second signal; the two bits of the reliability c2 in the first signal are located in the reliability c3 of the second signal; the first signal is reliably
  • the two bits of the property c3 are located in the reliability c2 of the second signal; the two bits of the reliability c4 in the first signal are located in the reliability c1 of the second signal; the two bits are equally reliable Positions are interchangeable.
  • bit randomization within a block is achieved through bit position transformation.
  • the bit position transformation of each signal is related to the number of multi-channel signals and the modulation method.
  • the interleaver of each signal block may be set to [1, 2, 3, ...], so that the interleaver does not change the position of the input bit.
  • a multi-channel signal block interleaver randomization of bits within a block, a number of multi-channel signals, a modulation method, and a code rate are defined in advance, and are bound to a UE ID, or controlled by a control channel or a radio resource Signaling.
  • the bit randomization of each channel signal is performed by a corresponding block interleaver; wherein, the block interleaver corresponding to any channel signal is obtained through a mother interleaver.
  • the mother interleaver is an interleaver that each user has obtained.
  • the mother interleaver may be set to [1, 2, 3, ...], so that the mother interleaver does not change the position of the input bit.
  • the mother interleaver can also be set as an interleaver that changes the position of the input bit.
  • the block interleaver of each signal of each user is obtained by cyclic shifting of the mother interleaver.
  • the number of cyclic shifts may be uniquely generated by the UE ID.
  • the spread spectrum module is further configured to include a large number of zero elements in a spread spectrum sequence.
  • these zero elements can break short loops to improve system performance.
  • zero elements can reduce the computational complexity.
  • the spreading module is further configured to: select a spreading sequence from a sequence of [1, -1, 1, -1, 1, -1, ...].
  • the spreading module is further configured to set the spreading sequence as follows: the number of elements in the spreading sequence of length m is set to m.
  • a spreading sequence of length 1 is [1]; a spreading sequence of length 2 is [1, -1]; a spreading sequence of length 3 is [1, -1, 1]; and a length of 4 is The spreading sequence is [1, -1,1, -1].
  • the spreading module is further configured to set the spreading sequence to include at least one of the following sequences when the length is 2: [1, 1]; [1, -1]; [ 1, j]; [1, -j.
  • 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 and the spreading sequence is set to be a combination of the sequences in the spreading sequence with a length of 2.
  • the principle of the combination is: traverse all combinations possible, and select the K sequences with the smallest cross-correlation.
  • the length is 4 and the spreading sequence includes at least one of the following sequences: [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]; [1,0,0, j]; [1,0,0, -1
  • the 5-long spreading sequence can be [1, 0, 0, j, -1] or [1, 0, 0, -j, 0].
  • the mapping of the multiple signals into one output signal by the resource mapping unit includes: performing phase rotation and power scaling of the signals on each channel and adding them to obtain the one output signal.
  • the power factor and the phase factor are set to minimize the peak-to-average power ratio (PAPR) of the added signal.
  • PAPR peak-to-average power ratio
  • the power scaling includes: after power scaling of multiple signals, the average power of the added signals is 1.
  • the power scaling includes: a power scaling factor is determined by a control channel or radio resource control signaling.
  • the power scaling includes: the magnitude of the power scaling factor is determined inversely by the downlink average received signal power and the uplink signal transmission power.
  • the mapping of the multiple signals into one output signal by the resource mapping unit includes: performing orthogonal resource mapping on each signal to obtain the one output signal.
  • FIG. 7 is an exemplary schematic diagram of orthogonal signal mapping of each signal to obtain an output signal, which is used to describe the first two signals of the resource mapping, one is three signals, and the other is two signals. Orthogonal mapping on 5 resources.
  • an 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.
  • the processor When the computer program is executed, any multiple-access method provided by an embodiment of the present invention is implemented.
  • an embodiment of the present invention further provides a computer-readable storage medium on which a computer program is stored, and when the computer program is executed by a processor, any one of the embodiments provided by the present invention is implemented. Multiple access method.

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Error Detection And Correction (AREA)

Abstract

本文提供一种多址接入方法和装置、及终端，该方法包括：对输入信号执行多路信号处理过程，获取对应的多路信号；其中，所述多路信号处理过程包括：对每路信号采用比特随机化过程；将所述多路信号资源映射为一路输出信号；发送所述输出信号。

Description

一种多址接入方法和装置、及终端
本申请要求在2018年08月13日提交中国专利局、申请号为201810917176.1的中国专利申请的优先权，该申请的全部内容通过引用结合在本申请中。
技术领域
本申请涉及无线通信领域，尤指一种多址接入方法和装置、及终端。
背景技术
多址接入技术是无线通信技术中的关键技术之一。在第五代移动通信系统(the 5th Generation mobile communication system，5G)时代，物联网将有很大的发展，未来将有100亿的物物链接。为支持如此大数量的物物链接，需要采用新的多址方案。经过研究，业界已达成共识，将采用非正交多址接入以提高同时可接入的用户数。
非正交多址技术主要有多用户共享多址接入(Multi-user shared access，MUSA)方法，基于稀疏码的多址接入(Sparse code multiple access，SCMA)方法，图样分割多址接入(Pattern division multiple access，PDMA)方法，以及交织多址接入IDMA(Interleaver-division multiple access)方法。
MUSA使用大量多元短扩频序列将用户数据扩频后，共享相同资源块传输用户数据。使用短扩频序列，用户信道矩阵维度较低，处理复杂度较小。常规扩频序列使用2元扩频序列，即扩频序列元素为1和-1。2元序列限制了产生低互相关序列的数目，这样，难以支持大量用户接入。使用复数扩频序列，容易产生大量低互相关的扩频序列，低互相关的扩频序列降低了多用户间的干扰，这样可以支持大量用户接入。如图1所示是MUSA的原理框图。
图1中的扩频序列是复数，其实部和虚部值取自集合{1，0，-1}。用户数据经过二元信道编码后进行数据调制，调制后的符号进行复数扩频。
交织多址中每个用户使用不同的交织器，交织器被用来区分用户，其原理框图如图2所示。
用户数据经过二元序列编码后进行多次重复，然后不同用户使用不同的交织器对编码和重复后的序列进行比特交织，交织后的数据调制后进入多址信道。这里重复(repetition)可以看作是一种扩频，只不过使用的是[1，-1，1，-1，...]的序列进行扩频。交织多址支持大量用户接入，最大可支持用户数可达64，是一种非常优秀的非正交多址接入方法。交织多址使用交织器区分用户。由于交 织器的长度很长，这样很容易设计出大量交织器。不同用户数据经过这些交织器后干扰被随机化，同时有用信号被提取。
SCMA使用稀疏扩频，调制中使用不同的比特bit到符号的映射。当使用高阶调制时，每个比特的可靠性不一样。一些比特的可靠性比较高，一些比特的可靠性比较低。通过使用不同的比特到符号的映射，需要传输的比特在高可靠比特和低可靠的比特上都进行了传输。在信号合并时，高可靠比特和低可靠比特合并有效提高了系统性能。
MUSA在使用高阶调制时，一般采用相同的比特到符号映射。一些比特总是被映射到低可靠的位置。信号合并时其合并后可靠性不高，在某些情况下降低了系统性能。
SCMA性能较好，但一般要使用消息传递算法(Message Passing Algorithm，MPA)接收机，其复杂度较大。使用扩张多面体算法(Expanding Polytope Algorithm，EPA)接收机可以降低复杂度，但一般不兼容最小均方误差-串行干扰消除(Minimum Mean Squared Error-Successive Interference Cancellation，MMSE-SIC)接收机和初始信息估计(Elementary Signal Estimator，ESE)接收机，导致灵活性不高。另外，SCMA的扩频长度不能灵活调节，低谱效下对多用户支持不是很好。
因此，我们希望获取能够弥补和改善上述问题的方案。
发明内容
本申请提出了一种多址接入方法和装置、及终端，能够在信号合并时获得调制增益。
本申请提出了一种多址接入方法，所述方法包括：
输入信号经过多路信号处理过程，获取对应的多路信号；其中，所述多路信号处理过程包括：对各路信号采用比特随机化过程；
将多路信号资源映射为一路输出信号；
发送所述输出信号。
本申请还提出了一种多址接入装置，设置在终端上，所述装置包括：
多路处理单元，用于对输入信号执行多路信号处理过程，获取对应的多路信号；其中，所述多路处理单元包括比特随机化模块：所述比特随机化模块用于对各路信号采用比特随机化过程；
资源映射单元，用于将多路信号映射为一路输出信号；
发送单元，用于发送所述输出信号。
本申请还提出了一种终端，包括存储器、处理器及存储在所述存储器上并可在所述处理器上运行的计算机程序，所述处理器执行所述计算机程序时实现本申请提供的任一多址接入方法。
本还提出了一种计算机可读存储介质，其上存储有计算机程序，所述计算机程序被处理器执行时实现本申请提供的任一多址接入方法。
与相关技术相比，本申请提供的技术方案包括：输入信号经过多路信号处理过程，获取对应的多路信号；其中，所述多路信号处理过程包括：对各路信号采用比特随机化过程；将多路信号资源映射为一路输出信号；发送所述输出信号。通过本申请的方案，对于多路信号的比特随机化，使用高阶调制时，由于进行了比特位置调整，这些比特映射为调制符号时在一些信号的高可靠位置，在另外一些信号的低可靠位置，在进行信号合并时，可以获得调制增益；此外，为简化交织器的设计，可以使用比特循环移位实现交织器功能，通过循环移位既随机化了干扰，又可以降低信号处理时延。
附图说明
下面对本发明实施例中的附图进行说明，实施例中的附图是用于对本申请的进一步理解，与说明书一起用于解释本申请，并不构成对本申请保护范围的限制。
图1为相关技术中MUSA的原理框图；
图2为相关技术中交织器的原理框图示意图；
图3为本发明实施例提供的多址接入方法的流程示意图；
图4为本发明实施例提供的一种多址接入的原理框图示意图；
图5为本发明实施例提供的又一种多址接入的原理框图示意图；
图6为5G新无线接入技术(New Radio Access Technology，NR)定义的比特到符号映射的示意图；
图7为本发明实施例提供的对各路信号进行正交资源映射得到一路输出信号的示意图。
具体实施方式
为了便于本领域技术人员的理解，下面结合附图对本申请作进一步的描述，并不能用来限制本申请的保护范围。需要说明的是，在不冲突的情况下，本申 请中的实施例及实施例中的各种方式可以相互组合。
为了改善MUSA和SCMA中存在的弱点，本发明实施例提供了一种非正交多址接入方法，该技术方案中，信息比特使用不同的信道编码器编码，以得到相同的信息比特和不同的校验比特。这也可以通过使用低码率信道编码，对多路数据使用不同校验比特来实现。在接收机进行信号合并时，本发明实施例提供的方法可以得到额外的编码增益，这里额外的编码增益是由于发射机的多路数据使用不同校验比特而获得。编码后的比特进行比特随机化和扰码操作。比特随机化可以在扰码前进行，也可以在扰码后进行。使用比特随机化，可以获得交织多址的好处，即可以使用ESE接收机，同时，迭代译码可以取得很好的性能。比特随机化实现方式之一是比特循环移位，比特随机化实现方式之二是进行块交织和符号内比特进行位置变化。比特循环移位实现简单，循环处理时延也小。使用比特循环移位时，不同路信号使用不同的移位值，且各路信号的循环移位值满足一定的关系，以确保使用高阶调制时一些映射到高可靠位置的比特在另外一路数据上映射到低可靠的位置。这样，多路信号进行合并时可以提高系统性能。块交织的意思是连续多个比特进行块交织，而不是传统的基于比特的交织。一个块内含一个调制符号包含的比特或整数个符号包含的比特。块的长度比较大时，可以降低信号处理时延，但也降低了交织器带来的增益。块的长度比较小时，增大了信号处理时延，但提高了交织器带来的增益。实际系统需要根据要求进行灵活配置。块内比特位置变化的原则是之前映射到高可靠位置的比特在另外一路数据上映射到低可靠的位置。
对二进制相移键控(Binary Phase Shift Keying，BPSK)和正交相移键控(Quadrature Phase Shift Keying，QPSK)而言，不存在高可靠比特和低可靠比特。为使相关的设计兼容BPSK和QPSK，本申请的技术方案中可以使用与高阶调制相同的方法，应用于这些低阶调制，这样做在尽量不恶化性能的前提下，统一和简化了系统设计。
参见图3，本申请提出了一种数据传输方法，所述方法包括：
步骤100、输入信号经过多路信号处理过程，获取对应的多路信号。
其中，输入信号Data stream可以表示是一路信号，该一路信号分别输入到K个编码器；也可以表示这一路信号分为K路相同或不同的信号，这K路信号分别输入到K个编码器。
本发明实施例中，以多路信号的数目为K路进行说明；K为大于1的整数。
其中，所述多路信号处理过程包括：对各路信号采用不同的比特随机化过程。
步骤200、将多路信号资源映射为一路输出信号。
例如，将多路信号映射为一路输出信号；例如，将多路信号合并为一路输出信号。
步骤300、发送所述输出信号。
所述多路信号处理过程包括：对每路信号执行信道编码，比特随机化，比特加扰，调制和扩频的处理。
步骤100包括：
步骤110、对一路输入信号A1进行信道编码，得到信道编码后的信号A2。
其中，对输入信号A1进行信道编码包括：
方式1-1、使用相同的编码矩阵对输入信号分别进行信道编码；其中，当编码前的输入信息比特都相同时，产生的编码比特也都相同；或，
方式1-2、使用不同的信道编码矩阵对输入信号进行信道编码；其中，当编码前的各路输入信息比特都相同时，产生的编码比特不完全相同；或，
方式1-3、使用一个编码器对输入信号进行信道编码，生成一路编码后的比特。
例如，如果每路信号输入相同信息比特，每路信道编码器编码后的结果一样。
例如，如果每路信号输入相同信息比特，每路信道编码器编码后的结果不一样。
方式1-3中，在编码之后，需要将编码后的比特分割为K路信号，有多种分割的方式。
将编码后的比特分割为K路信号，各路信号的比特没有共同的部分；或，将编码后的比特分割为K路信号，各路信号的比特有部分比特完全相同；或，将编码后的比特复制为K路信号，各路信号的比特完全相同。
步骤120、对信号A2进行比特随机化，得到比特随机化后的信号A3。
步骤130、对信号A3进行比特加扰，得到比特加扰后的信号A4。
其中，步骤120和步骤130的顺序可以更换，也就是说，比特随机化可以在比特加扰前操作；比特随机化也可以在比特加扰后操作。
步骤140、对信号A4进行调制，得到调制后的信号A5。
步骤150、对信号A5进行扩频，得到扩频后的信号A6。
通过上述过程得到的信号A6为多路信号中的一路。
在一个示例中，步骤120中的比特随机化过程包括：
步骤121、对信号进行块交织。
块的长度是每个符号包含的比特数的F倍；F为正整数。
在步骤121中，各路信号采用相同的块交织方法。
步骤122、在进行块交织之后，分别进行各个块的块内交织，其中，块内交织包括块内FX个比特的交织，X为每个符号包含的比特数。
其中，块内FX个比特的块内交织的原则是各路信号合并后平均误块率最小。
其中，各路信号块内交织遵循如下原则：
将比特位分为第一可靠位置区域和第二可靠位置区域，在第一路信号中，部分比特数位于第一可靠位置区域；部分比特数位于第二可靠位置区域。
在第二路信号中，存在两种情况：
方式1：相对于第一路信号，之前位于第一可靠位置区域的比特数变换至第二可靠位置区域，之前位于第二可靠位置区域的比特数变换至位于第一可靠位置区域。
方式2：相对于第一路信号，位于第一可靠位置区域的比特数依然位于该第一可靠位置区域，但该区域中各个比特数的相对顺序发生变化；位于第二可靠位置区域的比特数依然位于该第二可靠位置区域，但该区域中各个比特数的相对顺序发生变化。
优先选择方式1，如果信号路数较多，通过方式1的区域轮换不能得到足够路数的信号，则采用方式2得到更多的比特随机化后的信号。
下面结合两个具体的例子进行说明：
以16正交振幅调制(uadrature Amplitude Modulation，QAM)为例，4个比特映射为一个符号，如a1a2a3a4。这4个比特有两个比特的可靠性比较高，如a1和a2，两个比特的可靠性比较低，如a3和a4。
如果发射机有两路数据需要传输，则第一路信号中处于高可靠位置的比特，在其它路信号上处于低可靠位置。如果信息比特是a1a2a3a4，第一路信号进行比特随机化后得到“a1a2a3a4”或“a2a1a4a3”，第二路信号进行比特随机化后得到“a3a4a1a2”或“a4a3a2a1”。其中，a1和a2的位置可以互换，a3和a4的位置可以互换。
如果发射机有四路数据需要传输，则四路信号可以如下：第一路信号“a1a2a3a4”，第二路信号“a2a1a4a3”，第三路信号“a3a41a1a2”，第四路信号“a4a3a2a1”。其中，a1和a2的位置可以互换，a3和a4的位置可以互换。
上述示例中，以将比特位分为第一可靠位置区域和第二可靠位置区域为例进行说明，此外可靠位置也可以划分为两个以上的等级，例如在包括S个可靠位置区域的时候，S为大于1的整数。
各路信号块内FX个比特的交织遵循如下原则：
在比特位分为S个可靠位置区域的情况下，在第一路信号中，各个比特数分别位于S个可靠位置区域中。
方式1、在第二路信号中，相对于第一路信号，之前位于某一个可靠位置区域的比特数变换至另一个可靠位置区域。
例如，之前位于第一可靠位置区域的比特数变换至第二可靠位置区域；之前位于第S-1可靠位置区域的比特数变换至第S可靠位置区域。
方式2：相对于第一路信号，位于某一个可靠位置区域的比特数依然位于相同的可靠位置区域，但该区域中各个比特数的相对顺序发生变化。
例如，之前位于第一可靠位置区域的比特数依然位于第一可靠位置区域。之前位于第S可靠位置区域的比特数依然位于第S可靠位置区域。
在一个示例中，步骤120中的比特随机化过程包括：
步骤125、通过循环位移实现比特随机化。
例如，在有K路数据需要传输的情况下，第i路数据可以循环移位x i次，i为大于等于且1小于等于K的整数，x i在i取值不同时，x i的值也不相同。
通过本发明实施例提供的多址接入方法，可以使用不同的信道编码。在信号合并时可以获得额外的编码增益；使用了比特随机化；使用高阶调制时，由于进行了比特位置调整，这些比特映射为调制符号时在一些信号的高可靠位置，在另外一些信号的低可靠位置，在进行信号合并时，可以获得调制增益；使用不同的扩频码，可以取得额外的码域增益。
本发明实施例中，对于多路信号的比特随机化，使用高阶调制时，由于进行了比特位置调整，这些比特映射为调制符号时在一些信号的高可靠位置，在另外一些信号的低可靠位置，在进行信号合并时，可以获得调制增益；此外，为简化交织器的设计，可以使用比特循环移位实现交织器功能，通过循环移位既随机化了干扰，又可以降低信号处理时延。另外可以使用不同的信道编码矩阵进行编码，信号合并时可以获得额外的编码增益；多路信号可以进行不同的 相位旋转和功率缩放；相位旋转和功率缩放可以降低叠加信号的PAPR(峰均比)。
下面结合具体的实施场景进行说明。
实施例1
每一路信号的比特随机化通过比特循环移位实现。多路信号的比特循环移位值满足一定的关系以保证使用高阶调制时一些映射到高可靠位置的比特在另外一路数据上映射到低可靠的位置。这样，多路信号进行合并时可以提高系统性能。
以16QAM为例，当使用5G NR定义的比特到符号映射时，4个比特映射为一个符号。4个比特中，前两个是高可靠比特，后两个是低可靠比特。当K＝2时，两路信号的循环移位次数可以如下表所示(A和B为整数)：
Figure PCTCN2019100346-appb-000001
这两路信号的比特相对位移值满足4X+2(X为整数)。
以64QAM为例，当使用5G NR定义的比特到符号映射时，6个比特映射为一个符号。6个比特中，前两个是高可靠比特，中间两个是中等可靠的比特，后两个是低可靠比特。当K＝2时，两路信号的循环移位次数可以如下表所示(A和B为整数)：
表2两路信号的循环移位次数
Figure PCTCN2019100346-appb-000002
Figure PCTCN2019100346-appb-000003
这两路信号的比特相对位移值满足6X+3(X为整数)。
当使用BPSK或QPSK调制时，由于比特的可靠性是一样的，则多路数据的循环移位次数可为任意整数。
表3两路信号的循环移位值
Figure PCTCN2019100346-appb-000004
为简化系统设计，采用BPSK或QPSK时多路信号也可以使用16QAM或64QAM里的循环移位值。
实施例2
每一路信号的比特随机化先进行块交织，再进行块内每X个比特(X个比特映射为一个符号)的位置交织。
多路信号中X个比特(X个比特映射为一个符号)的位置交织原则是误块率最小。
实现合并后误块率最小的一个方法是在某些信号上比特位于高可靠位置的比特，其在另外路信号上处于低可靠的位置。
处于高可靠的位置的比特之间的位置可以互换，处于低可靠位置的比特之间的位置可以互换。
对编码后的比特进行块交织。假设这里X个比特映射为一个符号。调制方式和X的关系如表4所示：
表4调制方式和X的关系
调制 X
BPSK 1
QPSK 2
16QAM 4
64QAM 6
256QAM 8
块的大小是X的整数倍，设块的大小是mX(m为正整数)。块交织后，块内每X个比特进行相同的操作。以16QAM为例，4个比特映射为一个符号，如a1a2a3a4。这4个比特有两个比特的可靠性比较高，如a1a2，两个比特的可靠性比较低，如a3a4。如果发射机有两路数据需要传输，则在第一路信号中处于高可靠位置的比特，在其它路信号中处于低可靠位置。如果信息比特是a1a2a3a4，第一路信号进行比特随机化后得到“a1a2a3a4”或“a2a1a4a3”，第二路信号进行比特随机化后得到“a3a4a1a2”或“a4a3a2a1”。其中，a1和a2，a3和a4位置可以互换。
如果一共有4路，则信号可以如下：
第一路信号“a1a2a3a4”，第二路信号“a2a1a4a3”，第三路信号“a3a41a1a2”，第四路信号“a4a3a2a1”。其中a1和a2，a3和a4位置可以互换。
以64QAM为例，6个比特映射为一个符号，如a1a2a3a4a5a6。这6个比特有两个比特的可靠性比较高，如a1a2，有两个比特的可靠性一般，如a3a4，有两个比特的可靠性比较差，如a5a6。如果发射机有两路数据需要传输，则在第一路信号中处于高可靠位置的比特，在其它路信号中处于低可靠位置。如果信息比特是a1a2a3a4a5a6，第一路信号进行比特随机化后得到“a1a2a3a4a5a6”或“a2a1a4a3a6a5”，第二路信号进行比特随机化后得到“a6a5a4a3a2a1”或“a5a6a3a4a1a2”。
如果发射机有两路数据需要传输，则在第一路信号中处于高可靠位置的比特，在其它路信号上处于低可靠位置。如果信息比特是a1a2a3a4a5a6，第一路信号进行比特随机化后得到“a1a2a3a4a5a6”或“a2a1a4a3a6a5”，第二路信号进行比特随机化后得到“a6a5a4a3a2a1”或“a5a6a3a4a1a2”。其中，a1和a2，a3和a4，a5和a6位置可以互换。
如果一共有3路，则信号可以如下：第一路信号“a1a2a3a4a5a6”，第二路信号“a3a4a5a6a1a2”，第三路信号“a5a6a1a2a3a4”。其中，a1和a2，a3和a4，a5和a6位置可以互换。
实施例3
用户的循环移位值可以与用户设备标识(User Equipment Identity)UE ID唯一绑定。每个用户的第一路数据的循环移位值与UE ID有对应关系，第i路数据又与第1路数据的循环移位值成固定关系。这样，当UE ID已知，所有用户的 每路信号的循环移位值都可以唯一得到，以利于接收机进行循环检测。
这样不同用户可以通过移位序列这种变相的交织器得到区分。
实施例4
每一路信号的比特块交织可以通过循环移位来实现。
每个用户的每一路信号的循环移位值可与UE ID绑定。
这样UE ID确定后，用户的所有路的循环移位次数就唯一确定，同时，不同用户的不同路信息使用的等价交织器都不一样。
每一路信号的块交织可以通过一个母交织器的循环移位得到。
母交织器可以是[1，2，3，...]，即对输入信号不做改变。
块内比特交织与调制阶数和信号传输的路数相关。
每一路信号的块交织可以对信道编码后的比特进行循环移位，作为比特的随机化处理。
实施例5
每一路信号的比特随机化可以是以上方法的结合。
例如，可以先循环移位，再块交织。总的原则是比特随机化后多路信号合并后误块率最小。
块交织器与UE ID绑定，由一个母交织器生成得到。
每路信号经过编码，比特随机化，加扰，调制后进行扩频，当多路信号的数目不大于扩频码长度时，使用正交设计的扩频码进行扩频。
扩频序列可以选取自序列[1，-1，1，-1，1，-1，...]，此序列是[1，-1]的重复。当长度为1时，扩频序列为[1]；当长度为2时，扩频序列为[1，-1]；当长度为3时，扩频序列为[1，-1，1]；当长度为4时，扩频序列为[1，-1，1，-1]；当长度为5时，扩频序列为[1，-1，1，-1，1]；当长度为6时，扩频序列为[1，-1，1，-1，1，-1]。其它长度扩频序列，以此类推。
相同长度的扩频序列也可以有多个。如果是两路信号，扩频序列的长度是2，则选择的扩频序列可以是(这里j 2＝-1)：[1，1]；[1，-1]；[1，j]；[1，-j]。
如果是两路信号，扩频序列的长度是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]。
如果是两路信号，扩频序列的长度是4，则选择的扩频序列可以是：[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]。
如果扩频序列是[1，-1]，两路信号，则序列[1，-1]分割为两个小序列，得到[1]和[-1]，这两个小序列分别用于两路信号扩频。二路扩频后的信号通过资源映射正交映射到最终的信号。
如果扩频序列是[1，0，-1]，两路信号，则序列[1，0，-1]分割为两个小序列，得到[1，0]和[-1]，这两个小序列分别用于两路信号扩频。二路扩频后的信号通过资源映射正交映射到最终的信号。
如果扩频序列是[0，0，1，-1]，两路信号，则序列[0，0，1，-1]分割为两个小序列，每个小序列都有一个非零值，得到[0，1]和[0，-1]，这两个小序列分别用于两路信号扩频。二路扩频后的信号通过资源映射正交映射到最终的信号。
如果扩频序列是[1，0，0，1，-1]，三路信号，则序列[1，0，0，1，-1]分割为三个小序列，每个小序列都有一个非零值，得到[1，0]，[0，1]和[-1]，这三个小序列分别用于三路信号扩频。三路扩频后的信号通过资源映射正交映射到最终的信号。
如果是两路信号，不同长度的扩频序列中的每个序列的非零值至少是两个。使用非零值的好处之一是降低用户间干扰。当多路信号为K路，不同长度的扩频序列中的每个序列的非零值至少是K个。扩频序列被分割为K个小序列，每个小序列都有一个非零值用于对输入信号进行处理。
每路信号经过编码，比特随机化，加扰，调制后进行扩频，当多路信号的数目大于扩频码长度时，使用扩频码集合的扩频码进行扩频，扩频码选择原则是扩频码按照相关性进行从小到大的顺序排序，前面的序列为正交序列，后面的序列相关性逐渐增大。先选择互相关小的序列，再选择互相关大的扩频序列。
用户信息分别进行信道编码，得到不同的校验比特。编码后的比特分别进行比特随机化。比特随机化后进行比特加扰，调制，扩频。不同路信号使用不同的扩频码(一共有K路信号)进行扩频。
本实施例的核心是：使用不同的信道编码器，编码后得到不同的编码比特，接收端信号合并后可以取得编码增益。在某些情况下，如高过载，编码器可以相同。编码器相同时，两路信号调制后的信号使用2长扩频码扩频后可以认为 发射机使用的是4长扩频，利于信号检测。
使用比特随机化。多路信号编码后的信息比特是一样的，校验比特可以一样，也可以不一样。比特随机化原则是多路数据经过比特随机化在接收机合并后，误块率最小。当使用高阶调制时，当一路数据的比特调制后处于高可靠的位置，则其在另外路比特位于低可靠的位置。
比特随机化可以通过块交织和块内一个符号内的比特位置重新调整得到。
基于与上述实施例相同或相似的构思，本发明实施例还提供一种多址接入装置，参见图4，本申请提出的一种多址接入装置包括：多路处理单元，用于对输入信号执行多路信号处理过程，获取对应的多路信号；其中，所述多路处理单元包括比特随机化模块：所述比特随机化模块用于对各路信号采用比特随机化过程；资源映射单元，用于将多路信号映射为一路输出信号；发送单元，用于发送所述输出信号。
本发明实施例中，所述多路信号的数目为K路。
所述多路处理单元还包括：编码模块，编码模块与比特随机化模块相连接，且编码模块的输出连接至比特随机化模块的输入端，编码模块用于对其输入端输入的信号进行编码；比特加扰模块，比特加扰模块与比特随机化模块相连接，比特加扰模块的输出连接至比特随机化模块的输入端，或者比特加扰模块的输入端连接至比特随机化模块的输出端，比特加扰模块用于对其输入端输入的信号进行比特加扰；调制模块和扩频模块；调制模块用于对其输入端输入的信号进行调制；扩频模块用于对其输入端输入的信号进行扩频；调制和扩频在比特随机化之后执行。
本发明实施例中，所述信道编码模块的数目为K，各个信道编码模块分别处理K路信号中的一路。
K个信道编码模块使用相同的编码矩阵对输入信号进行信道编码；其中，当各个信道编码模块的输入信息比特都相同时，产生的编码比特也都相同；或，K个信道编码模块使用不同的信道编码矩阵对输入信号进行信道编码；其中，当各个信道编码模块的输入信息比特都相同时，产生的编码比特不完全相同。
本发明实施例中，所述信道编码模块的数目为1个，该信道编码模块的输出端分别连接至K个比特随机化模块：其中，该一个信道编码模块对输入端的一路输入信号进行信道编码，生成一路编码后的比特。
本发明实施例中，所述多址接入装置还包括分路器，所述分路器用于将编码后的比特分割为K路信号。分路器将编码后的比特分割为K路信号后，各路信号的比特没有共同的部分；或，分路器将编码后的比特分割为K路信号后， 各路信号的比特有部分比特完全相同；或，分路器将编码后的比特复制为K路信号，各路信号的比特完全相同。
本发明实施例中，所述比特随机化模块用于：对信号进行块交织；块的长度是每个符号包含的比特数的F倍；F为正整数；在进行块交织之后，分别进行各个块的块内交织，其中，块内交织包括块内FX个比特的交织，X为每个符号包含的比特数。
本发明实施例中，K路信号处理中使用相同的块交织器；或，K路信号处理中使用不同的块交织器；或，K路信号处理中分别使用随机交织器作为块交织器。
本发明实施例中，在所述块交织之前，先执行循环移位。
本发明实施例中，第i路信号的循环移位值和第i-1路信号的循环移位值的相对值是m iX+y，m i和y是整数；i为大于1且小于或等于K的整数。m i的作用是比特随机化，y的作用是使得调制时比特映射到可靠性不同的位置以提高系统性能。
本发明实施例中，一个特例是m i＝0，y＝0。此时扩频后的符号完全相同，有利于使用码分多址(Code Division Multiple Access，CDMA)的技术进行处理，如MMSE-SIC接收机，或使用MMSE抑制用户间的干扰。
本发明实施例中，所述块内交织的原则是比特调制到符号后，对接收信号进行解调，K路信号合并后误块率最小。
本发明实施例中，所述各路信号循环移位，循环移位值选取原则是对接收信号进行解调，K路信号合并后误块率最小。
本发明实施例中，块的长度为FX个比特，每X个比特进行如下处理：X个比特映射为一个符号，这X个比特的可靠性不同。
在比特位分为S个可靠位置区域的情况下，在第一路信号中，各个比特数分别位于S个可靠位置区域中；其中，S为大于1的整数。
在第i路信号中，相对于第一路信号和其它路信号，之前位于某一个可靠位置区域的比特数变换至另一个可靠位置区域；或，相对于第一路信号和其它路信号，位于某一个可靠位置区域的比特数依然位于相同的可靠位置区域，但该区域中各个比特数的相对顺序发生变化；i为大于1且小于或等于K的整数。
本发明实施例中，使用BPSK调制时，X＝1；使用QPSK调制时，X＝2；使用16QAM时，X＝4；使用64QAM时，X＝6；使用256QAM时，X＝8。
本发明实施例中，块内交织按照如下方式执行：
当使用BPSK调制，块内比特进行随机位置变换或循环移位。
调制阶数大于BPSK时，块内共有FX个比特，每X个比特进行如下操作：
当使用QPSK调制，比特的可靠性相同；在有两路信号时，第一路信号两个比特在第二路信号的位置互相交换或不变。
当使用16QAM调制，5G NR定义的比特到符号映射如图6所示。前两个比特映射到高可靠的位置，后两个比特映射到低可靠的位置。在有两路信号时，则在第一路信号位于高可靠的两个比特，位于第二路信号的低可靠的位置。这可以通过编码后的两路信号的比特循环移位值的相对值是4X+y，y＝2实现。
当使用64QAM调制，前两个比特映射到高可靠的位置，中间两个比特处于中等可靠的位置，后两个比特映射到低可靠的位置；在有两路信号时，则在第一路信号位于高可靠的两个比特，位于第二路低可靠比特的位置。第一路信号位于低可靠的两个比特，位于第二路信号高可靠比特的位置；第一路信号位于中等可靠的两个比特，位于第二路信号的中等可靠的位置；处于同等可靠的两个比特位置可以互换。
当使用256QAM调制，比特的可靠性分为4级，分别为c1，c2，c3和c4，可靠性c1>c2>c3>c4；在有两路信号时，则在第一路信号中位于可靠性c1的两个比特位于第二路信号的可靠性c4的位置；第一路信号中位于可靠性c2的两个比特位于第二路信号的可靠性c3的位置；第一路信号中位于可靠性c3的两个比特位于第二路信号的可靠性c2的位置；第一路信号中位于可靠性c4的两个比特位于第二路信号的可靠性c1的位置；处于同等可靠的两个比特位置可以互换。
本发明实施例中，通过比特位置变换实现块内比特随机化，每一路信号的比特位置变换与多路信号的数目，调制方式有关。
本发明实施例中，每路信号块交织器可以设置为[1，2，3，...]，从而使得交织器不改变输入比特的位置。
本发明实施例中，多路信号块交织器，块内比特随机化，多路信号路数，调制方式，码率预先定义好，并与UE ID绑定，或由控制信道，或无线资源控制信令进行通知。
本发明实施例中，每一路信号的比特随机化通过对应的块交织器进行；其中，通过母交织器获取任一路信号对应的块交织器。
本发明实施例中，所述母交织器为各个用户已经获取的交织器。
本发明实施例中，母交织器可以设置为[1，2，3，...]，从而使得母交织器不改变输入比特的位置。母交织器也可以设置为改变输入比特位置的交织器。
本发明实施例中，每个用户的每一路信号的块交织器由母交织器循环移位得到。
本发明实施例中，循环移位次数可以由UE ID唯一生成。
本发明实施例中，所述扩频模块还用于：扩频序列中含有大量零元素。在使用迭代检测时，这些零元素可以破环短环，以提高系统性能。使用MMSE抑制用户间干扰时，零元素可以降低计算复杂度。
本发明实施例中，所述扩频模块还用于：扩频序列选取自[1，-1，1，-1，1，-1，...]的序列。
本发明实施例中，所述扩频模块还用于将所述扩频序列按如下方式设置：长度为m的扩频序列中的元素个数设置为为m个。
例如，长度为1的扩频序列是[1]；长度为2的扩频序列是[1，-1]；长度为3的扩频序列是[1，-1，1]；长度为4的扩频序列是[1，-1，1，-1]。
本发明实施例中，所述扩频模块还用于在长度为2时，将所述扩频序列设置为包括如下序列中的至少一个：[1，1]；[1，-1]；[1，j]；[1，-j。
长度为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]。
长度为4，扩频序列设置为长度为2的扩频序列中的序列组合而成，组合的原则为：遍历所有组合可能，选取互相关最小的K个序列。
长度为4，扩频序列包括如下序列中的至少一个：[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]。
当为其他扩频序列长度时，里面有多个非零元素，取自集合{1，-1，j，-j}，其它元素为零。如5长扩频序列可以是[1，0，0，j，-1]或[1，0，0，-j，0]。
本发明实施例中，所述资源映射单元将多路信号映射为一路输出信号包括：将各路信号进行相位旋转和功率缩放后相加得到所述一路输出信号。
其中，在执行功率缩放和相位旋转过程中，功率因子和相位因子设置为使得相加信号峰均比(PAPR，peak-to-average power ratio)最小。
本发明实施例中，所述功率缩放包括：多路信号功率缩放后，相加后的信号平均功率为1。
本发明实施例中，所述功率缩放包括：功率缩放因子大小由控制信道，或无线资源控制信令确定。
本发明实施例中，所述功率缩放包括：功率缩放因子大小由下行平均接收信号功率来反向决定上行信号发射功率。
本发明实施例中，所述资源映射单元将多路信号映射为一路输出信号包括：将各路信号进行正交资源映射得到所述一路输出信号。图7是一个示例性的各路信号进行正交资源映射得到一路输出信号的示意图，用于说明资源映射前两路信号，一路是3个信号，一路是2个信号，经过资源映射后，在5个资源上正交映射。
基于与上述实施例相同或相似的构思，本发明实施例还提供一种终端，包括存储器、处理器及存储在所述存储器上并可在所述处理器上运行的计算机程序，所述处理器执行所述计算机程序时实现本发明实施例提供的任一多址接入方法。
基于与上述实施例相同或相似的构思，本发明实施例还提供一种计算机可读存储介质，其上存储有计算机程序，所述计算机程序被处理器执行时实现本发明实施例提供的任一多址接入方法。
需要说明的是，以上所述的实施例仅是为了便于本领域的技术人员理解而已，并不用于限制本申请的保护范围，在不脱离本申请的构思的前提下，本领域技术人员对本申请所做出的任何替换和改进等均在本申请的保护范围之内。

Claims (35)

  1. 一种多址接入方法，包括：
    对输入信号执行多路信号处理，获取对应的多路信号；其中，所述多路信号处理包括：对每路信号采用比特随机化；
    将所述多路信号映射为一路输出信号；
    发送所述输出信号。
  2. 根据权利要求1所述的方法，其中，所述多路信号的路数为K路，其中，K为大于1的整数；
    所述多路信号处理还包括：
    在所述比特随机化之前还包括信道编码；
    在所述比特随机化之前或者之后还包括比特加扰；
    在所述比特随机化之后还包括调制和扩频。
  3. 根据权利要求2所述的方法，其中，所述信道编码包括：
    分别使用相同的信道编码矩阵对所述输入信号进行信道编码；其中，在编码前的K路输入信息比特都相同的情况下，产生的编码后的比特都相同；或，
    分别使用不同的信道编码矩阵对所述输入信号进行信道编码；其中，在编码前的K路输入信息比特都相同的情况下，产生的编码后的比特不完全相同。
  4. 根据权利要求2所述的方法，其中，所述信道编码包括：
    使用一个编码器对所述输入信号进行信道编码，生成一路编码后的比特。
  5. 根据权利要求4所述的方法，在所述生成一路编码后的比特之后，还包括：
    将所述编码后的比特分割为K路信号，所述K路信号的比特没有共同的部分；或，
    将所述编码后的比特分割为K路信号，所述K路信号的比特有部分比特相同；或，
    将所述编码后的比特复制为K路信号，所述K路信号的比特完全相同。
  6. 根据权利要求2所述的方法，其中，所述比特随机化按照如下方式中的至少一种执行：
    对每路信道编码后的比特进行循环移位；
    对每路信道编码后的比特进行块交织；其中，块的长度是每个符号包含的比特数的F倍；F为正整数；在进行所述块交织之后，进行每个块的块内交织， 其中，所述块内交织包括块内FX个比特的交织，X为每个符号包含的比特数；
    对每路信道编码后的比特进行循环移位；在所述循环移位之后，对每路循环移位后的比特进行块交织；其中，块的长度是每个符号包含的比特数的F倍；F为正整数；在进行所述块交织之后，进行每个块的块内交织，其中，所述块内交织包括块内FX个比特的交织，X为每个符号包含的比特数。
  7. 根据权利要求6所述的方法，其中，所述比特随机化包括：
    第i路信号的循环移位值和第i-1路信号的循环移位值的相对值是m iX+y，m i和y是整数；i为大于1且小于或等于K的整数。
  8. 根据权利要求7所述的方法，其中，所述循环移位包括：
    y的取值根据调制阶数和K进行设置；在使用正交相移键控QPSK调制的情况下，y设置为任意整数；在使用16正交振幅调制QAM调制，K＝2的情况下，y＝2；在使用16QAM调制，K＝4时，y＝1或y＝2；在使用64QAM调制，K＝2的情况下，y＝3；在使用64QAM调制，K＝3的情况下，y＝2；在使用256QAM调制，K＝2的情况下，y＝4；在使用256QAM调制，K＝4的情况下，y＝2。
  9. 根据权利要求7所述的方法，其中，所述循环移位包括：
    循环移位中y的取值是使得所述多路信号合并后误块率average block error rate最小。
  10. 根据权利要求7所述的方法，其中，m i＝0，y＝0。
  11. 根据权利要求6所述的方法，其中，
    在对K路信号进行处理的过程中使用相同的块交织器；或，
    在对K路信号进行处理的过程中使用不同的块交织器；或，
    在对K路信号进行处理的过程中分别使用随机交织器作为块交织器。
  12. 根据权利要求6所述的方法，其中，所述块内交织的原则是比特调制到符号后，对接收信号进行解调，使K路信号合并后误块率最小。
  13. 根据权利要求6所述的方法，其中，
    块的长度为FX个比特，所述块内交织按照如下方式执行：每X个比特进行如下处理：
    X个比特映射为一个符号，所述X个比特的可靠性不同；
    在比特位分为S个可靠位置区域的情况下，在第一路信号中，多个比特位于S个可靠位置区域中；其中，S为大于1的整数；
    在第i路信号中，相对于其它路信号，位于一个可靠位置区域的比特变换至另一个可靠位置区域；或，相对于其它路信号，位于一个可靠位置区域的比特依然位于相同的可靠位置区域，但所述可靠位置区域中多个比特的相对顺序发生变化；i为大于1且小于或等于K的整数。
  14. 根据权利要求6所述的方法，其中，
    在使用二进制相移键控BPSK调制的情况下，X＝1；
    在使用QPSK调制的情况下，X＝2；
    在使用16QAM调制的情况下，X＝4；
    在使用64QAM调制的情况下，X＝6；
    在使用256QAM调制的情况下，X＝8。
  15. 根据权利要求12所述的方法，其中，
    所述块内交织按照如下方式执行：
    在使用BPSK调制的情况下，块内比特进行随机位置变换或循环移位；
    在调制阶数大于BPSK的情况下，块内共有FX个比特，每X个比特进行如下操作：
    在使用QPSK调制的情况下，X个比特的可靠性相同；在所述多路信号包括两路信号的情况下，两个比特在第二路信号中的位置相对于在第一路信号中的位置互相交换或不变；
    在使用16QAM调制的情况下，前两个比特映射到高可靠的位置，后两个比特映射到低可靠的位置；在所述多路信号包括两路信号的情况下，在第一路信号中位于高可靠的位置的两个比特位于第二路信号中的低可靠的位置；
    在使用64QAM调制的情况下，前两个比特映射到高可靠的位置，中间两个比特处于中等可靠的位置，后两个比特映射到低可靠的位置；在所述多路信号包括两路信号的情况下，在第一路信号位于高可靠的位置的两个比特位于第二路信号的低可靠的位置；第一路信号位于低可靠的位置的两个比特位于第二路信号的高可靠的位置；第一路信号位于中等可靠的位置的两个比特位于第二路信号的中等可靠的位置；处于同等可靠的位置的两个比特的位置支持互换；
    在使用256AM调制的情况下，比特的可靠性分为4级，分别为c1，c2，c3和c4，可靠性关系为c1>c2>c3>c4；在所述多路信号包括两路信号的情况下，在第一路信号中位于可靠性c1的位置的两个比特位于第二路信号的可靠性c4的位置；第一路信号中位于可靠性c2的位置的两个比特位于第二路信号的可靠性c3的位置；第一路信号中位于可靠性c3的位置的两个比特位于第二路信号的可靠 性c2的位置；第一路信号中位于可靠性c4的位置的两个比特位于第二路信号的可靠性c1的位置；处于同等可靠性等级的位置中的两个比特的位置支持互换。
  16. 根据权利要求6所述的方法，其中，
    通过比特位置变换实现块内比特随机化，每路信号的比特位置变换与所述多路信号的路数和调制方式有关。
  17. 根据权利要求6所述的方法，其中，
    每路信号的块交织器包括[1，2，3，...]，使得所述每路信号的块交织器不改变输入比特的位置。
  18. 根据权利要求6所述的方法，还包括：
    预先设置所述多路信号的块交织器，块内比特随机化，所述多路信号的路数，调制方式和码率。
    其中，所述多路信号的块交织器，所述块内比特随机化，所述多路信号的路数，所述调制方式和所述码率分别与用户设备标识UE ID绑定，或，通过控制信道或无线资源控制信令通知所述多路信号的块交织器，所述块内比特随机化，所述多路信号的路数，所述调制方式，和所述码率。
  19. 根据权利要求2所述的方法，其中，
    每路信号的比特随机化通过所述每路信号对应的块交织器进行；其中，任一路信号对应的块交织器通过母交织器获取。
  20. 根据权利要求19所述的方法，其中，所述母交织器为多个用户设备已经获取的交织器。
  21. 根据权利要求20所述的方法，其中，所述母交织器包括[1，2，3，...]，使得所述母交织器不改变输入比特的位置。
  22. 根据权利要求20所述的方法，其中，每个用户设备的每路信号的块交织器由所述母交织器循环移位得到。
  23. 根据权利要求22所述的方法，其中，循环移位次数由UE ID唯一生成。
  24. 根据权利要求2所述的方法，其中，所述扩频包括：
    将扩频序列设置为包括至少两个非零值，在所述扩频序列的长度大于2的情况下，序列元素设置为含有至少一个零。
  25. 根据权利要求2所述的方法，其中，所述扩频按照如下方式设置：
    扩频序列选取自序列[1，-1，1，-1，1，-1，...]。
  26. 根据权利要求24所述的方法，其中，所述扩频序列按如下方式设置：
    长度为m的扩频序列中的元素个数为m个；
    其中，长度为1的扩频序列是[1]；长度为2的扩频序列是[1，-1]；长度为3的扩频序列是[1，-1，1]；长度为4的扩频序列是[1，-1，1，-1]。
  27. 根据权利要求24所述的方法，其中，在所述多路信号的路数为2的情况下，所述扩频序列按照如下方式设置：
    在所述扩频序列的长度为2的情况下，所述扩频序列包括如下序列中的至少一个：
    [1，1]；
    [1，-1]；
    [1，j]；
    [1，-j]；其中，j 2＝-1；
    在所述扩频序列的长度为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]；
    在所述扩频序列的长度为4的情况下，所述扩频序列设置为按照长度为2的扩频序列中的序列组合而成，所述组合的原则为：遍历所有组合，选取互相关最小的K个序列；或，在所述扩频序列的长度为4的情况下，所述扩频序列 包括如下序列中的至少一个：
    [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]；
    在所述扩频序列的长度为其他长度的情况下，所述扩频序列包括两个非零元素，取自集合{1，-1，j，-j}，其它元素为零；
    所述扩频序列包括两个非零值，将所述扩频序列分割为两个小序列，所述两个小序列分别用于两路信号扩频，每个小序列含有一个非零值。
  28. 根据权利要求24所述的方法，其中，在所述多路信号的路数等于A的情况下，所述扩频序列含有A个非零值，将所述扩频序列分割为A个小序列，所述A个小序列分别用于A路信号扩频，其中，每个小序列含有一个非零值，A为大于2的整数。
  29. 根据权利要求1所述的方法，其中，所述将所述多路信号映射为一路输出信号包括：
    将多路信号进行相位旋转和功率缩放后相加得到所述一路输出信号。
  30. 根据权利要求29所述的方法，其中，所述相位旋转包括：
    选取相位因子，使得相加后的信号的峰均比PAPR最小。
  31. 根据权利要求29所述的方法，其中，所述功率缩放按如下方式中的至少一种执行：
    对所述多路信号进行功率缩放后，使得相加后的信号的平均功率为1；
    功率缩放因子的值由控制信道或无线资源控制信令确定；
    由下行平均接收信号功率来反向决定上行信号发射功率。
  32. 根据权利要求1所述的方法，其中，所述将所述多路信号映射为一路输出信号包括：
    将所述多路信号进行正交资源映射得到所述一路输出信号。
  33. 一种多址接入装置，设置在终端上，包括：
    多路处理单元，设置为对输入信号执行多路信号处理过程，获取对应的多路信号；其中，所述多路处理单元包括比特随机化模块：所述比特随机化模块设置为对每路信号采用比特随机化过程；
    资源映射单元，设置为将所述多路信号映射为一路输出信号；
    发送单元，设置为发送所述输出信号。
  34. 一种终端，包括存储器、处理器及存储在所述存储器上并可在所述处理器上运行的计算机程序，所述处理器执行所述计算机程序时实现如权利要求1至32中任一权项所述的多址接入方法。
  35. 一种计算机可读存储介质，存储有计算机程序，所述计算机程序被处理器执行时实现如权利要求1至32中任一权项所述的多址接入方法。
PCT/CN2019/100346 2018-08-13 2019-08-13 一种多址接入方法和装置、及终端 WO2020034942A1 (zh)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN201810917176.1A CN110875794B (zh) 2018-08-13 2018-08-13 一种多址接入方法和装置、及终端
CN201810917176.1 2018-08-13

Publications (1)

Publication Number Publication Date
WO2020034942A1 true WO2020034942A1 (zh) 2020-02-20

Family

ID=69525196

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2019/100346 WO2020034942A1 (zh) 2018-08-13 2019-08-13 一种多址接入方法和装置、及终端

Country Status (2)

Country Link
CN (1) CN110875794B (zh)
WO (1) WO2020034942A1 (zh)

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1490949A (zh) * 2002-10-19 2004-04-21 ���ǵ�����ʽ���� 能够改善接收性能的多载波发射系统及其信号处理方法
CN1735079A (zh) * 2004-08-09 2006-02-15 皇家飞利浦电子股份有限公司 用于实现多路并行传输的空间信道编、解码方法及装置
CN101047393A (zh) * 2006-05-12 2007-10-03 华为技术有限公司 一种产生交织器/解交织器的方法及其应用
US20100310065A1 (en) * 2009-06-04 2010-12-09 Mediatek Singapore Pte. Ltd. System and apparatus for integrated video/image encoding/decoding and encryption/decryption

Family Cites Families (11)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP1775869A1 (en) * 2005-10-17 2007-04-18 NTT DoCoMo, Inc. Receiver and method with reduced complexity for IDMA (interleave division multiple access)
CN101060381A (zh) * 2006-05-23 2007-10-24 华为技术有限公司 信号收发方法及其装置
CN101141169A (zh) * 2006-09-08 2008-03-12 华为技术有限公司 一种多址接入方法及系统
CN101090305B (zh) * 2007-07-31 2012-04-18 中兴通讯股份有限公司 一种无线物理层信道编码链路处理方法
KR100917201B1 (ko) * 2007-12-11 2009-09-16 엘지전자 주식회사 신호 송수신 방법 및 신호 송수신 장치
CN105406948B (zh) * 2014-09-12 2020-03-06 中兴通讯股份有限公司 一种实现并行多用户数据传输的方法及主节点
CN105591994B (zh) * 2014-10-21 2019-08-02 中兴通讯股份有限公司 码分多址接入的多用户通信方法及装置
CN107070541B (zh) * 2016-02-05 2021-07-09 北京三星通信技术研究有限公司 多址接入方法及相应的发射方法、接收机和发射机
CN108306707B (zh) * 2017-01-12 2024-02-20 中兴通讯股份有限公司 一种多址接入的方法、装置和通讯系统
CN107171770B (zh) * 2017-05-25 2020-01-07 深圳清华大学研究院 上行多用户非正交多址接入方法
CN108123786B (zh) * 2017-12-18 2020-11-06 中国电子科技集团公司第五十四研究所 基于交织多址的tdcs多址接入方法

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1490949A (zh) * 2002-10-19 2004-04-21 ���ǵ�����ʽ���� 能够改善接收性能的多载波发射系统及其信号处理方法
CN1735079A (zh) * 2004-08-09 2006-02-15 皇家飞利浦电子股份有限公司 用于实现多路并行传输的空间信道编、解码方法及装置
CN101047393A (zh) * 2006-05-12 2007-10-03 华为技术有限公司 一种产生交织器/解交织器的方法及其应用
US20100310065A1 (en) * 2009-06-04 2010-12-09 Mediatek Singapore Pte. Ltd. System and apparatus for integrated video/image encoding/decoding and encryption/decryption

Also Published As

Publication number Publication date
CN110875794B (zh) 2022-04-15
CN110875794A (zh) 2020-03-10

Similar Documents

Publication Publication Date Title
CN106576024B (zh) 生成在各复数维有小投影的码本的系统和方法及其应用
US10103862B2 (en) Method, apparatus, and system for transmitting and receiving information of an uncoded channel in an orthogonal frequency division multiplexing system
US6731668B2 (en) Method and system for increased bandwidth efficiency in multiple input—multiple output channels
EP3509264B1 (en) Method and apparatus for transmitting data
AU2017219105A9 (en) System and method for designing and using multidimensional constellations
EP3434000B1 (en) Method for flexible sparse code multiple access codebook design, transmission and detection
CN107370702B (zh) 一种通信系统中的信号发射、接收方法和装置
CN101218845B (zh) 多载波通信中的无线通信基站装置、无线通信移动台装置和导频信号序列分配方法
CN108737307B (zh) 一种多址接入的方法、发射机及接收机
JP2022177284A (ja) 送信装置及び受信装置
WO2007108474A1 (ja) 無線送信装置および無線送信方法
US10581556B1 (en) Uplink multiple access method based on frozen bit patterns of polar codes
US8588153B2 (en) Method and apparatus for transmitting uplink control channel in a mobile communication system
KR20040065470A (ko) 직교 주파수 분할 다중 시스템의 피크전력 대 평균전력 비 감소를 위한 장치 및 방법
JP3745692B2 (ja) マルチキャリア−ｃｄｍａ変調方式用送信装置およびマルチキャリア−ｃｄｍａ変調方式用受信装置
WO2020034942A1 (zh) 一种多址接入方法和装置、及终端
CN109981511B (zh) 基于非正交多址的数据传输
CN112534787B (zh) 无线通信的方法、无线通信装置、计算机可读介质
KR100761669B1 (ko) 유사직교부호화 송신 및 수신 시스템
Block et al. Frequency-hop multiple-access systems with limited per-hop multi-user detection
CN109962751B (zh) 一种数据处理方法及装置
Bossert On Coding for OFDM and the Broadcast Channel
IES20011015A2 (en) Data communication
WO2001020834A1 (en) Method and apparatus for encoding of trellis coded direct sequence spread spectrum communication signals

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 19850675

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

32PN Ep: public notification in the ep bulletin as address of the adressee cannot be established

Free format text: NOTING OF LOSS OF RIGHTS PURSUANT TO RULE 112(1) EPC (EPO FORM 1205 DATED 25.06.2021)

122 Ep: pct application non-entry in european phase

Ref document number: 19850675

Country of ref document: EP

Kind code of ref document: A1