WO2017186175A1 - 接入方法及装置、发射机、接收机、终端 - Google Patents

接入方法及装置、发射机、接收机、终端 Download PDF

Info

Publication number
WO2017186175A1
WO2017186175A1 PCT/CN2017/082532 CN2017082532W WO2017186175A1 WO 2017186175 A1 WO2017186175 A1 WO 2017186175A1 CN 2017082532 W CN2017082532 W CN 2017082532W WO 2017186175 A1 WO2017186175 A1 WO 2017186175A1
Authority
WO
WIPO (PCT)
Prior art keywords
sequence
complex
orthogonal
extended
integer
Prior art date
Application number
PCT/CN2017/082532
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 WO2017186175A1 publication Critical patent/WO2017186175A1/zh

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W74/00—Wireless channel access
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W74/00—Wireless channel access
    • H04W74/002—Transmission of channel access control information
    • H04W74/004—Transmission of channel access control information in the uplink, i.e. towards network
    • 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 disclosure relates to the field of communications, and in particular to an access method and apparatus, a transmitter, a receiver, and a terminal.
  • Uplink multi-user access can be through different multiple access technologies such as Time Division Multiple Access (TDMA), Frequency Division Multiple Access (FDMA), Code Division Multiple Access (Code Division). Multiple Access (referred to as CDMA) and Space Division Multiple Access (SDMA).
  • TDMA Time Division Multiple Access
  • FDMA Frequency Division Multiple Access
  • CDMA Code Division Multiple Access
  • SDMA Space Division Multiple Access
  • each access terminal first uses a certain length of the extended sequence (for example, the extended sequence of length L means that the extended sequence consists of L symbols, also It can be said that it is composed of L elements, where L symbols or L elements can be L digital symbols) and the digital amplitude-phase-modulated data symbols are expanded.
  • the expansion process refers to the process of multiplying each modulated data symbol by each symbol of the extended sequence to form a symbol sequence having the same length as the extended sequence used.
  • FIG. 1 is a schematic diagram of data symbol expansion in the related art, as shown in FIG.
  • the data symbol is S k
  • an N-long extended sequence C ⁇ c 1 , c 2 , ... c N ⁇
  • the so-called expansion process is to multiply S k by each element in the extended sequence C
  • the expanded sequence ⁇ S k c 1 , S k c 2 , ... S k c N ⁇ is obtained.
  • Each modulated data symbol in the expansion process (for example, Binary Phase Shift Keying (BPSK)/Quadrature Amplitude Modulation (QAM) modulated constellation point symbol)
  • BPSK Binary Phase Shift Keying
  • QAM Quadrature Amplitude Modulation
  • Each symbol of the spreading sequence is multiplied, and finally each modulated data symbol is expanded into a sequence of symbols of the same length as the spreading sequence used. For example, if a spreading sequence of length L is used, each modulated symbol is expanded to L. For each symbol, it can be said that each modulated data symbol is carried on an extended sequence of length L.
  • the extended symbol sequence of all access terminals can then be transmitted on the same time-frequency resource.
  • the base station receives the combined signals of the extended signals of all the access terminals, and separates the useful information of each terminal from the combined signals by the multi-user receiver technology.
  • the extension sequences used by the access terminals are not orthogonal to each other.
  • the uplink can adopt the non-orthogonal multiple access method. Orthogonal multiple access mode for greater system capacity or edge throughput. Since the spreading sequences of the terminals are not orthogonal to each other, in general, the demodulation performance of each user deteriorates as the number of simultaneous access users increases. When the system is overloaded, interference between multiple users becomes more serious.
  • the mainstream code division multiple access technology is mostly based on a binary pseudo-random real number sequence as an extended sequence. However, due to the binary pseudo-random real number sequence, especially the low cross-correlation between the short pseudo-random real number sequences is not easy to guarantee, which will lead to serious multi-user interference, which will inevitably affect multi-user access. Performance.
  • 5G massive connection scenarios or Massive machine-type communication is a large category of 5G Internet of Things (IoT) services.
  • IoT Internet of Things
  • the traditional orthogonal multiple access has the following disadvantages: strict access process is required, the terminal is complex, the cost is high, and the power consumption is large; and the signaling overhead is too large for the small packet, the spectrum utilization is low; the orthogonal division of resources, the hard capacity, System flexibility and scalability are low.
  • LTE Long-Term Evolution
  • the ALOHA-based transmission access technology can be roughly divided into two types: one is that the design idea is relatively simple, that is, as long as the user has data to send, even if they send, of course, this will cause conflicts and cause frame destruction; Another design idea is to use the clock to unify the user's data transmission.
  • the time is divided into discrete time slices. The user must wait until the next time slice to start sending data, thus avoiding the randomness of the user to send data. The possibility of data conflicts.
  • the data transmission time is not only affected by the user, but also limited by the time slice, that is, the data cannot be transmitted until the next time slice starts.
  • one transmission access technology can save a lot of signaling overhead, its reliability can not be better guaranteed, and for the massive access of machine communication, one transmission access technology will inevitably have more serious conflict problems. .
  • the embodiments of the present disclosure provide an access method and apparatus, a transmitter, a receiver, and a terminal to solve at least the problems in the related art.
  • an access method including:
  • N1 and N are positive integers, and N2 is an integer;
  • the equivalent sequence includes: expanding one of the two extended sequences, and a sequence formed by an extended sequence, where the bit sequence carries first indication information or second indication information, where the first indication information is used to indicate at least a non-orthogonal sequence of the two extended sequences, The second indication information is used to indicate at least a non-orthogonal sequence of the two extended sequences that generate the equivalence sequence;
  • Carrier-modulating the extended symbol to obtain a carrier modulated signal and transmitting the carrier modulated signal.
  • the first indication information or the second indication information at least includes the following information: terminal identity identification information; terminal identity identification information; and one or more bits generated in a specified manner or randomly, where
  • the terminal identity information includes at least one of the following: identifier information that uniquely identifies the terminal; and identifier information that is used to indicate the terminal in the current network.
  • the two extended sequences include: a non-orthogonal sequence and an orthogonal sequence; a non-orthogonal sequence and a non-orthogonal sequence; and the non-orthogonal sequence includes: a complex non-orthogonal sequence.
  • determining the non-orthogonal sequence by using one of the following manners: selecting, according to the first indication information of the bit sequence or the second indication information, from a set that includes multiple non-orthogonal sequences; Generating the first indication information or the second indication information sequence generator;
  • the first indication information or the second indication information further includes indication information indicating an orthogonal sequence, and then according to the first indication information or location of the bit sequence
  • the second indication information is selected from a set including a plurality of orthogonal sequences; and is randomly selected from a set including a plurality of orthogonal sequences.
  • the non-orthogonal sequence is a complex non-orthogonal sequence
  • the non-orthogonal sequence is determined by: each element of the complex non-orthogonal sequence is a complex number, and the complex number is not
  • the values of the real part and the imaginary part of all elements in the orthogonal sequence are derived from a set of M-ary real numbers, where M is an integer greater than or equal to 2;
  • the M-ary real number set is [-(M-1)/2, (M-1)/2] a collection of M integers in the range;
  • the M-ary real number set is a set of M odd numbers in the range of [-(M-1), (M-1)]; or
  • the M-ary real number set is M integers in the range [-(M-1)/2, (M-1)/2] multiplied by the energy corresponding to the M-ary real number set a set of M real numbers obtained by a coefficient; or
  • the M-ary real number set is obtained by multiplying M odd numbers in the range of [-(M-1), (M-1)] by the energy normalization coefficient of the M-ary real number set, respectively.
  • a collection of M real numbers is obtained by multiplying M odd numbers in the range of [-(M-1), (M-1)] by the energy normalization coefficient of the M-ary real number set, respectively.
  • determining the complex non-orthogonal sequence according to the bit sequence includes:
  • the values of all elements of the integer sequence are from a set of M ⁇ M-ary integers, and have the same number of elements as the length of the non-orthogonal sequence, the M
  • the set of ⁇ M-ary integers is a set of all integers in the range of [0, M ⁇ M-1] or [1, M ⁇ M], and M is an integer greater than or equal to 2;
  • the M 2 or 3 or 4.
  • determining, according to the bit sequence, the complex non-orthogonal sequence to be used includes:
  • the value of all elements of the integer sequence is from a set of 8-ary integers, and the number of elements having the same length as the non-orthogonal sequence is [0] a set of all integers in the range of , 7] or [1, 8];
  • the broadcast information sent by the base station determines at least one of: a length of at least one extended sequence of the two extended sequences or a length of the equivalent sequence; and a time-frequency resource available to the terminal.
  • the orthogonal sequence includes at least one of the following: a Walsh Walsh sequence, a Discrete Fourier Transform DFT sequence, and a Zadoff-Chu sequence.
  • the coding and modulating the bit sequence to be transmitted into N symbols comprises: performing coding by using at least one of the following coding modes: cyclic redundancy check CRC coding and channel error correction coding;
  • the bit sequence to be transmitted is modulated by at least one of the following coding modes: binary phase shift keying, quadrature phase shift keying, 16 orthogonal amplitude modulation, 64 quadrature amplitude modulation.
  • sequence length of the orthogonal sequence is 1; the length of the non-orthogonal sequence is 1.
  • the number of pilot symbols N 2 takes a value of zero.
  • an uplink access method including:
  • N1 modulation symbols are added with N2 pilot symbols.
  • the equivalent sequence includes: a sequence in which one of the two extended sequences is extended and formed by another extended sequence, the bit sequence carrying first indication information or second indication information, where the first indication information is used to indicate at least a non-orthogonal sequence of the two extended sequences, where the second indication information is used to indicate at least a non-orthogonal sequence of the two extended sequences of the generated equivalent sequence;
  • an uplink access apparatus including:
  • a coded modulation module configured to code and modulate a bit sequence to be transmitted to form N1 modulation symbols, add N2 pilot symbols to N1 pilot symbols to form N symbols, N1 and N are positive integers, and N2 is an integer. ;
  • An extension module configured to expand the N symbols by using two extended sequences or an equivalent sequence, where the equivalent sequence includes: expanding one of the two extended sequences, and a sequence formed by an extended sequence, where the bit sequence carries first indication information or second indication information, where the first indication information is used to indicate at least a non-orthogonal sequence of the two extended sequences, The second indication information is used to indicate at least a non-orthogonal sequence of the two extended sequences of the equivalent sequence;
  • a carrier modulation module configured to perform carrier modulation on the extended symbol to obtain a carrier modulated signal
  • a sending module configured to send the carrier modulation signal.
  • an uplink access apparatus including:
  • a receiving module configured to receive a carrier modulated signal transmitted by multiple transmitters, where the carrier modulated signal is code modulated by the transmitter to form a N1 modulation symbol, and the N1 modulation symbols are added Forming N symbols after N2 pilot symbols, and expanding the N symbols by using two extended sequences or one equivalent sequence, and performing carrier modulation on the extended symbols, wherein N1 and N are positive
  • N2 is an integer
  • the equivalent sequence includes: a sequence formed by expanding one of the two extended sequences and forming another extended sequence, where the bit sequence carries the first indication information or a second indication information, where the first indication information is used to indicate at least the non-orthogonal sequence of the two extended sequences, and the second indication information is used to indicate at least two extended sequences of the generated equivalent sequence Nonorthogonal sequence;
  • a detecting module configured to perform receiving detection on the received carrier modulated signal.
  • a transmitter comprising:
  • a first processor a first memory for storing processor executable instructions
  • the first processor is configured to code and modulate a bit sequence to be transmitted to form N1 modulation symbols, add N2 pilot symbols to the N2 pilot symbols, and form N symbols, and use two extensions.
  • the sequence or an equivalent sequence expands the N symbols, performs carrier modulation on the extended symbol to obtain a carrier modulated signal, and transmits the carrier modulated signal, where N1 and N are positive integers, and N2 is an integer.
  • the equivalent sequence includes: a sequence formed by expanding one of the two extended sequences and forming a sequence with another extended sequence, where the bit sequence carries first indication information or second indication information,
  • the first indication information is used to indicate at least the non-orthogonal sequence of the two extended sequences
  • the second indication information is used to indicate at least the non-orthogonal sequence of the two extended sequences of the generated equivalent sequence.
  • the transmitter is in a sleep state when there is no data demand.
  • a terminal comprising: the transmitter of any of the above.
  • a receiver comprising:
  • a second processor a second memory for storing second processor executable instructions
  • the second processor is configured to receive a carrier modulated signal that is sent by multiple transmitters, where the carrier modulated signal is code modulated by the transmitter to form a N1 modulation symbol, and the N1 modulation symbols are added to N2 pilot symbols to form N symbols, and the N symbols are expanded by using two extended sequences or one equivalent sequence, and the expanded symbols are formed by carrier modulation, wherein N1 And N is a positive integer, N2 is an integer, and the equivalence sequence includes: a sequence formed by expanding one of the two extended sequences and forming another extended sequence, the bit sequence carrying the first An indication information or a second indication information, where the first indication information is used to indicate at least a non-orthogonal sequence of the two extended sequences, and the second indication information is used to indicate at least the generated equivalence sequence Non-orthogonal sequence.
  • a storage medium comprising a stored program, wherein the program is executed while performing the access method of any of the above.
  • the bit sequence to be transmitted is coded and modulated into modulation symbols, and the modulation symbols are added to the pilot symbols to form N symbols, and the modulation symbols and the reference are included by two extended sequences or one equivalent sequence pair.
  • the N symbols of the frequency symbols are extended, and the extended symbols are subjected to carrier modulation, wherein the bit sequence carries the first indication information or the second indication information, where the first indication information is used to indicate at least the two a non-orthogonal sequence in the extended sequence; the second indication information is used to indicate at least the non-orthogonal sequence in the equivalence sequence, and the foregoing technical solution is used to solve the related art, with the massive access of the machine communication
  • the resulting severe collision and poor reliability of the transmission access technology improves the reliability of the uplink access process and avoids excessive signaling interaction processes in the uplink access process.
  • FIG. 2 is a flowchart of an uplink access method according to an embodiment of the present disclosure
  • FIG. 3 is another flowchart of an uplink access method according to an embodiment of the present disclosure.
  • FIG. 4 is a structural block diagram of an uplink access device according to an embodiment of the present disclosure.
  • FIG. 5 is another structural block diagram of an uplink access device according to an embodiment of the present disclosure.
  • FIG. 6 is a block diagram showing still another structure of an uplink access device according to an embodiment of the present disclosure.
  • FIG. 7 is a structural block diagram of a transmitter according to an embodiment of the present disclosure.
  • FIG. 8 is a structural block diagram of a receiver according to an embodiment of the present disclosure.
  • FIG. 9 is a flowchart of a transmitter side pair signal processing procedure according to a preferred embodiment 1 of the present disclosure.
  • FIG. 10 is a flow chart of signal processing of a transmitter side pair according to a preferred embodiment 2 of the present disclosure
  • FIG. 11 is a flow chart of signal processing of a transmitter side pair according to a preferred embodiment 3 of the present disclosure
  • FIG. 12 is a flow chart of signal processing of a transmitter side pair according to a preferred embodiment 4 of the present disclosure
  • FIG. 13 is a flowchart of a transmitter side uplink access method according to a preferred embodiment 5 of the present disclosure
  • FIG. 14 is a flowchart of determining an L1 long or L2 long spreading sequence based on terminal identity information according to a preferred embodiment of the present disclosure
  • 15 is a schematic diagram of constellations of four complex constellation points in accordance with a preferred embodiment of the present disclosure.
  • 16 is a schematic diagram of constellations of nine complex constellation points in accordance with a preferred embodiment of the present disclosure.
  • 17 is a schematic diagram of a square constellation composed of eight complex constellation points in accordance with a preferred embodiment of the present disclosure
  • FIG. 18 is a schematic diagram of a circular constellation composed of eight complex constellation points in accordance with a preferred embodiment of the present disclosure
  • FIG. 19 is a flowchart (1) of obtaining a L1 long or L2 long sequence according to an additionally added bit sequence, terminal identity information, and the value of the additionally added bit is a random value according to a preferred embodiment of the present disclosure
  • 20 is a flowchart (1) for determining a value of an L1 long or L2 long sequence according to an additionally added bit sequence, terminal identity information, and the value of the additionally added bit is determined by the number of retransmissions according to a preferred embodiment of the present disclosure
  • 21 is a schematic diagram showing the principle of modulation symbols passing through 4 long non-orthogonal extensions and 8 long orthogonal extensions according to a preferred embodiment of the present disclosure
  • FIG. 22 is a schematic diagram of a principle in which modulation symbols are respectively extended by 8 long orthogonal extensions and 4 long non-orthogonal extensions according to a preferred embodiment of the present disclosure
  • 23 is a schematic diagram showing the principle of modulation symbols being extended by L long sequences respectively according to a preferred embodiment of the present disclosure
  • 24 is a schematic diagram showing the principle of generating an L sequence from 4 long non-orthogonal sequences and 8 long orthogonal sequences, respectively, according to a preferred embodiment of the present disclosure
  • 26 is a flowchart of a receiver in accordance with a preferred embodiment of the present disclosure.
  • FIG. 27 is a flow chart (1) of data expansion on the transmitter side when multiple antennas are in accordance with a preferred embodiment of the present disclosure
  • a general idea of the embodiment of the present disclosure is as follows: How to obtain excellent code division multiple access performance? Or more directly, how can the base station accurately separate the useful data information of each terminal from the combined signal? This is the key to the CDMA system. It mainly involves two aspects: the extended sequence and the receiver. The selection of the extended sequence is the performance basis, and the receiver design is the performance guarantee.
  • the extended sequences used by different terminals first need to have good cross-correlation properties. If the spreading sequence is transmitted directly in the wireless multipath channel, such as the single-carrier code division multiplexing technique, the sequence is also required to have good autocorrelation properties to combat the delay multipath expansion of the sequence itself.
  • Direct Sequence-Code Division Multiple Access technology is the most commonly used code division multiple access technology, and has been adopted as multiple uplink users by various wireless communication standards. Access technology, its extension The sequence is based on the simplest binary pseudo-random (Pseudo-Noise, PN for short) real sequence. Due to the simplicity of the sequence, DS-CDMA based on PN sequence is also one of the most important techniques for multi-carrier code division multiplexing. In this technique, each modulated symbol is first extended by a binary pseudo-random real number sequence, and then It is then transmitted through multi-carrier technology.
  • PN binary pseudo-random
  • FIG. 2 is a flowchart of an uplink access method according to an embodiment of the present disclosure. As shown in FIG. 2, the process includes the following steps:
  • Step S202 the modulated coded bit sequence to be transmitted for forming the N 1 modulation symbols, the modulation symbols together with the N 1 symbols form N N 2 pilot symbols, N and N is a positive integer.
  • N 2 is Integer
  • Step S204 expanding N symbols by using two extended sequences or one equivalent sequence, wherein the equivalent sequence includes: extending one extended sequence of the two extended sequences and forming a sequence with another extended sequence
  • the first sequence information carries the first indication information or the second indication information, where the first indication information is used to indicate at least two non-orthogonal sequences in the extended sequence, and the second indication information is used to indicate at least two of the generated equivalent sequences.
  • Step S206 performing carrier modulation on the extended symbol to obtain a carrier modulated signal, and transmitting a carrier modulated signal.
  • the bit sequence to be transmitted is coded and modulated to form a modulation symbol, and then the modulation symbol is added with a pilot symbol to form N symbols, and the modulation symbol and the pilot symbol are included by two extended sequences or one equivalent sequence pair.
  • the N symbols are extended to perform carrier modulation on the extended symbols, where the bit sequence carries first indication information or second indication information, and the first indication information is used to indicate at least two non-orthogonal sequences in the extended sequence.
  • the second indication information is used to indicate at least the non-orthogonal sequence in the two sequences that generate the equivalent sequence, and the foregoing technical solution solves the transmission access technology caused by the massive access of the machine communication in the related art.
  • the serious conflicts and poor reliability problems increase the reliability of the uplink access process and avoid excessive signaling interaction processes in the uplink access process.
  • the two extended sequences are first extended by using a non-orthogonal sequence, and the characters are not extended.
  • the number is then extended by orthogonal expansion.
  • it can be extended by orthogonal sequence first, and then non-orthogonal sequence.
  • the equivalent sequence can be an equivalent sequence in which one sequence of two extended sequences is expanded into another sequence, for example.
  • the above two extended sequences are A and B, respectively, and the equivalent sequence may be a BB sequence formed by expanding A to B, or may be an AA sequence extending B to A, wherein A and B respectively represent non-positive Cross sequence and orthogonal sequence.
  • the two extended sequences in the embodiments of the present disclosure may be non-orthogonal sequences and orthogonal sequences, or both of them may be non-orthogonal sequences, which may be adjusted according to actual conditions.
  • the bit sequence carries not only the non-orthogonal sequence but also the non-orthogonal sequence.
  • the indication information of the orthogonal sequence may also be carried.
  • the indication information of the orthogonal sequence is usually indication information borrowing the non-orthogonal sequence, and it is not desirable to additionally add the indication information to indicate the orthogonal sequence. This is not limited.
  • the non-orthogonal sequence in the embodiment of the present disclosure is determined by at least one of the following manners: from the first indication information or the second indication information in the bit sequence, from the set including multiple non-orthogonal sequences Selecting from the sequence generator according to the first indication information or the second indication information in the bit sequence; the orthogonal sequence is determined by at least one of the following manners: when the first indication information or the second indication information includes When the information of the orthogonal sequence can be indicated, the indication information for indicating the orthogonal sequence in the bit sequence is selected from the set including the plurality of orthogonal sequences; and the selection is performed from the set including the plurality of orthogonal sequences.
  • Non-orthogonal sequences are preferably from different sets.
  • the first indication information or the second indication information may carry at least the following information: terminal identity identification information, terminal identity identification information, and multiple bits generated in a specified manner or randomly. It can be understood that one or more pieces of bit information that are randomly generated are random, and are not necessarily included in the first indication information or the second indication information.
  • the terminal identity identification information in the embodiment of the present disclosure includes at least one of the following: a unique identifier.
  • the identifier information of the terminal which is used to indicate the identity information of the terminal in the current network, and may be UE_ID or C-RNTI.
  • the randomly generated one or more bits are not completely randomly generated, and may be determined according to one of the following parameters: terminal identity information, number of transmissions of the carrier modulated signal, time-frequency position of the transmitted carrier modulated signal, and terminal location Cell configuration information.
  • the embodiment of the present disclosure may further prepare: determining, by using the broadcast information sent by the base station, at least one of: length of at least one extended sequence of the two extended sequences; the length of the equal sequence; the terminal is available Time-frequency resources, that is, the base station in the embodiment of the present disclosure is a resource pool that can inform the terminal of the currently available time-frequency resources through broadcast information, and after knowing the information, the terminal randomly selects an available resource when transmitting the data. .
  • one of the extended sequences mentioned in the embodiments of the present disclosure may be a complex extended sequence, wherein, in various embodiments of the present disclosure, as an example, the complex extended sequence may be a complex non-orthogonal sequence.
  • the embodiment of the present disclosure provides several determination manners, but these determination manners are only used for illustration, and others can be conceived by those skilled in the art under the prompt of the determination manner provided by the embodiments of the present disclosure. The manner in which the complex spreading sequence is determined is within the scope of protection of the embodiments of the present disclosure.
  • each element of the complex extended sequence is a complex number, and the values of the real part and the imaginary part of all elements in the complex extended sequence are derived from one M element a set of real numbers, where M is an integer greater than or equal to 2;
  • the M-ary real number set is a set of M integers in the range [-(M-1)/2, (M-1)/2]; or
  • the M-ary real number set is a set of M odd numbers in the range [-(M-1), (M-1)]; or
  • the M-ary real number set is obtained by multiplying M integers in the range [-(M-1)/2, (M-1)/2] by the energy normalization coefficient corresponding to the M-ary real number set. a collection of M real numbers; or
  • the M-ary real number set is composed of M real numbers obtained by multiplying M odd numbers in the range of [-(M-1), (M-1)] by the energy normalization coefficients of the real set of the M-ary numbers, respectively. Collection.
  • the integer sequence is generated according to the bit sequence, and all the elements of the integer sequence are derived from an M ⁇ M-ary integer set, and the number of elements has the same length as the non-orthogonal sequence, and the M ⁇ M-ary integer set is [0 , M ⁇ M - 1] or a set of all integers in the range [1, M ⁇ M], M is an integer greater than or equal to 2;
  • the complex constellation points corresponding to the elements are selected from a complex constellation of M ⁇ M points according to a preset mapping rule
  • the complex number corresponding to the complex constellation points is determined, and the complex numbers are sequentially combined to obtain a complex extended sequence, or the complex number is multiplied by the complex energy normalization coefficients and sequentially combined to obtain a complex extended sequence.
  • the value of M in the first determination mode and the second determination mode is preferably 2 or 3 or 4.
  • An integer sequence is generated according to the bit sequence.
  • the values of all elements of the integer sequence are from a set of 8-ary integers, and the number of elements has the same length as the non-orthogonal sequence, and the 8-ary integer set is [0, 7] or [1, 8 a collection of all integers in the range;
  • the complex constellation points corresponding to the complex number are selected from the complex constellation of 8 points according to a preset mapping rule
  • the complex number corresponding to the complex constellation points is determined, and the complex numbers are sequentially combined to obtain a complex extended sequence, or the complex number is multiplied by the energy normalization coefficient corresponding to the complex number, and then combined to obtain a complex extended sequence.
  • the encoding is performed by using at least one of the following encoding modes: CRC encoding and channel error correction encoding; Modulation: BPSK, QPSK, 16QAM, 64QAM, preferentially select low-order BPSK and QPSK modulation methods.
  • An optional implementation manner of step S206 may be: performing carrier modulation in at least one of the following manners: OFDM with CP; SC-FDMA modulation with CP; OFDM/SC-FDMA modulation with 1 subcarrier of CP .
  • the two extended sequences include: a complex domain non-orthogonal sequence and an orthogonal sequence; a complex domain non-orthogonal sequence and a non-orthogonal sequence
  • the cross sequence includes at least one of the following: a Walsh Walsh sequence, a Discrete Fourier Transform DFT sequence, and a Zadoff-Chu sequence.
  • the sequence length of the orthogonal sequence may be 1, and the length of the non-orthogonal sequence may also be 1.
  • the orthogonal sequence is for increasing coverage, replacing the traditional simple repetition. For example, when an 8-long orthogonal sequence is despread, it is possible to accumulate 8 times its own energy. The other 7 sequences are orthogonal to this one, and the accumulated energy after despreading is 0. And if each user simply repeats 8 times, it cannot eliminate other users.
  • the number of pilot symbols included in the N symbols may be 0, that is, the pilot symbols are not included, and the embodiment of the present disclosure does not specifically describe this.
  • FIG. 3 is another flowchart of the uplink access method according to an embodiment of the present disclosure. Including the following steps:
  • Step S302 receiving a carrier modulated signal transmitted by a plurality of transmitters, wherein the carrier modulated signal is coded and modulated by a transmitter to form a N 1 modulation symbol, and the N 1 modulation symbols are added by N 2
  • the pilot symbols form N symbols, and are extended by using two extended sequences or one equivalent sequence for N symbols, and carrier modulation of the extended symbols, where N 1 and N are positive integers, N is an integer of 2, an equivalent sequence comprises: the above-described two spreading sequences of a spreading sequence spreading, and the sequence formed with another extension bit sequence carries the first indication information or second indication information, the first The indication information is used to indicate at least two non-orthogonal sequences in the extended sequence; the second indication information is used to indicate at least a non-orthogonal sequence of the two extended sequences of the generated equivalent sequence;
  • Step S304 performing reception detection on the received carrier modulated signal.
  • the carrier modulation signal received in step S302 is sent by multiple transmitters in the same video resource pool, and the step S302 receives a plurality of signals that are superimposed together.
  • An uplink access device is also provided in this embodiment, and the device is used to implement the foregoing embodiments and preferred embodiments, and details are not described herein.
  • the term "module” may implement a combination of software and/or hardware of a predetermined function.
  • the apparatus described in the following embodiments is preferably implemented in software, hardware, or a combination of software and hardware, is also possible and contemplated.
  • FIG. 4 is a structural block diagram of an uplink access device according to an embodiment of the present disclosure. As shown in FIG. 4, the device includes:
  • the coded modulation module 40 is configured to code and modulate a bit sequence to be transmitted to form N 1 modulation symbols, add N 2 pilot symbols to the N 1 modulation symbols to form N symbols, and N 1 and N are positive Integer, N 2 is an integer;
  • the expansion module 42 is configured to expand the N symbols by using two extended sequences or one equivalent sequence, where the equivalent sequence includes: expanding one of the two extended sequences, and expanding with another extended sequence
  • the formed sequence the bit sequence carries first indication information or second indication information, the first indication information is used to indicate at least two non-orthogonal sequences in the extended sequence, and the second indication information is used to indicate at least the generated equivalent sequence a non-orthogonal sequence of two extended sequences;
  • the carrier modulation module 44 is configured to perform carrier modulation on the extended symbol to obtain a carrier modulated signal.
  • the sending module 46 is configured to send a carrier modulated signal.
  • the bit sequence to be transmitted is coded into N symbols, and the N symbols including the modulation symbols and the pilot symbols are extended by two extended sequences or one equivalent sequence, and the extended symbols are extended.
  • the bit sequence carries first indication information or second indication information, where the first indication information is used to indicate at least the non-orthogonal sequence in the two extended sequences;
  • the above technical solution is adopted to solve the problem of serious conflict and poor reliability of the transmission access technology caused by the massive access of the machine communication in the related art.
  • the reliability of the uplink access process is improved, and the excessive signaling interaction process of the uplink access process is avoided.
  • the two extended sequences are first extended by using a non-orthogonal sequence, and the non-positive extended symbols are further orthogonally extended.
  • the orthogonal sequence may be used to expand first, and then the non-orthogonal sequence and the equivalent sequence may be used.
  • the obtained non-orthogonal sequence may be a sequence obtained by extending the orthogonal sequence, or may be a sequence obtained by the equivalent expansion of the two extended sequences.
  • the two extended sequences in the embodiment of the present disclosure may be a non-orthogonal sequence and an orthogonal sequence.
  • the two sequences may be non-orthogonal sequences, and may be adjusted according to actual conditions.
  • the bit sequence may carry indication information of the orthogonal sequence in addition to the indication information indicating the non-orthogonal sequence, and may be orthogonal.
  • the indication information of the sequence is usually the indication information of the non-orthogonal sequence. It is not necessary to additionally add the indication information to indicate the orthogonal sequence, which is not limited by the embodiment of the present disclosure.
  • the non-orthogonal sequence in the embodiment of the present disclosure is determined by at least one of the following manners: from the first indication information or the second indication information in the bit sequence, from the set including multiple non-orthogonal sequences Selecting according to the first indicator information or the second indication information in the bit sequence according to the sequence generator; the orthogonal sequence is determined by at least one of the following manners: when the first indication information or the second indication information includes When the information of the orthogonal sequence can be indicated, the indication information for indicating the orthogonal sequence in the bit sequence is selected from the set including the plurality of orthogonal sequences; and the selection is performed from the set including the plurality of orthogonal sequences. It is within the scope of the embodiments of the present disclosure to determine the manner in which the non-orthogonal sequence and the orthogonal sequence are known to those skilled in the art based on their capabilities.
  • the first indication information or the second indication information may carry the following information: terminal identity information, terminal identity information, and randomly generated multiple bits, which may be understood as randomly generated.
  • the plurality of bit information is random and is not necessarily included in the indication information of the non-orthogonal sequence.
  • the terminal identity identification information in the embodiment of the present disclosure includes at least one of the following: identification information that uniquely identifies the terminal;
  • the identity information in the current network may be UE_ID or C-RNTI.
  • the randomly generated multiple bits are not completely randomly generated, and may be determined according to one of the following parameters: terminal identity information, the number of transmissions of the carrier modulation signal, the time-frequency location of the transmitted carrier modulation signal, and the cell where the terminal is located. Configuration information.
  • FIG. 5 is a block diagram of another structure of an uplink access device according to an embodiment of the present disclosure.
  • the device further includes a determining module 48, configured to determine at least one of the following by using broadcast information sent by the base station:
  • the length of at least one extended sequence in the extended sequence; the sequence length of the equivalent sequence; the time-frequency resource available to the terminal, that is, the base station in the embodiment of the present disclosure is a resource pool that can inform the terminal of the currently available time-frequency resource through broadcast information. After the terminal knows the information, it can randomly select an available resource when sending the data next time.
  • the extended sequence mentioned in the embodiment of the present disclosure may be a complex extended sequence.
  • the embodiment of the present disclosure provides several determining manners, but these determining manners are only used for illustration. Other prompts for determining the manner provided by the embodiments of the present disclosure
  • the manner in which the complex spreading sequences are conceivable by those skilled in the art is within the scope of protection of the embodiments of the present disclosure.
  • the determining module 48 is further configured to: when one of the extended sequences is a complex extended sequence, determine the extended sequence by: each element of the complex extended sequence is a complex number, and the real and imaginary parts of all elements in the complex extended sequence The values are all from a set of M-ary real numbers, where M is an integer greater than or equal to 2;
  • the M-ary real number set is a set of M integers in the range [-(M-1)/2, (M-1)/2]; or
  • the M-ary real number set is a set of M odd numbers in the range [-(M-1), (M-1)]; or
  • the M-ary real number set is obtained by multiplying M integers in the range [-(M-1)/2, (M-1)/2] by the energy normalization coefficient corresponding to the M-ary real number set. a collection of M real numbers; or
  • the M-ary real number set is composed of M real numbers obtained by multiplying M odd numbers in the range of [-(M-1), (M-1)] by the energy normalization coefficients of the real set of the M-ary numbers, respectively. Collection.
  • the determining module 48 is further configured to: when the extended sequence is a complex extended sequence, determine the extended sequence by:
  • the integer sequence is generated according to the bit sequence, and all the elements of the integer sequence are derived from an M ⁇ M-ary integer set, and the number of elements has the same length as the non-orthogonal sequence, and the M ⁇ M-ary integer set is [0 , M ⁇ M - 1] or a set of all integers in the range [1, M ⁇ M], M is an integer greater than or equal to 2;
  • the complex constellation points corresponding to the elements are selected from a complex constellation of M ⁇ M points according to a preset mapping rule
  • the value of M in the first determination mode and the second determination mode is preferably 2 or 3 or 4.
  • the determining module 48 is further configured to: when the extended sequence is a complex extended sequence, determine the extended sequence by:
  • An integer sequence is generated according to the bit sequence.
  • the values of all elements of the integer sequence are from a set of 8-ary integers, and the number of elements has the same length as the non-orthogonal sequence, and the 8-ary integer set is [0, 7] or [1, 8 a collection of all integers in the range;
  • the complex constellation points corresponding to the complex number are selected from the complex constellation of 8 points according to a preset mapping rule
  • the complex number corresponding to the complex constellation points is determined, and the complex numbers are sequentially combined to obtain a complex extended sequence, or the complex number is multiplied by the energy normalization coefficient corresponding to the complex number, and then combined to obtain a complex extended sequence.
  • the code modulation module 40 is further configured to perform coding by using at least one of the following coding modes: CRC coding and channel error correction coding; and is further configured to perform modulation by using at least one of the following coding modes: BPSK, QPSK, 16QAM, 64QAM
  • BPSK, QPSK, 16QAM, 64QAM The lower order BPSK and QPSK modulation modes are preferentially selected.
  • the carrier modulation module 44 is further configured to perform carrier modulation by using at least one of the following methods: OFDM with CP; SC-FDMA modulation with CP; OFDM/ with 1 subcarrier of CP SC-FDMA modulation.
  • the sequence length of the orthogonal sequence may be 1, and the length of the non-orthogonal sequence may also be 1.
  • the orthogonal sequence is for increasing coverage, replacing the traditional simple repetition. For example, when an 8-long orthogonal sequence is despread, it is possible to accumulate 8 times its own energy. The other 7 sequences are orthogonal to this one, and the accumulated energy after despreading is 0. And if each user simply repeats 8 times, it cannot eliminate other users.
  • An uplink access device is also provided in this embodiment, and the device is used to implement the foregoing embodiments and preferred embodiments, and details are not described herein.
  • the term "module” may implement a combination of software and/or hardware of a predetermined function.
  • the apparatus described in the following embodiments is preferably implemented in software, hardware, or a combination of software and hardware, is also possible and contemplated.
  • FIG. 6 is another structural block diagram of an uplink access device according to an embodiment of the present disclosure. As shown in FIG. 6, the device includes:
  • the receiving module 60 is configured to receive a carrier modulated signal transmitted by multiple transmitters, where the carrier modulated signal is code modulated by a transmitter to form a N 1 modulation symbol, and the N 1 modulation symbol is added. After N 2 pilot symbols form N symbols, N symbols are expanded by using two extended sequences or one equivalent sequence, and carrier symbols are formed by performing carrier modulation on the extended symbols, where N 1 and N are positive integers.
  • the equivalence sequence includes: the equivalence sequence includes: a sequence in which one of the two extension sequences is extended and formed by another extension sequence, and the bit sequence carries the first indication information or the Two indication information, where the first indication information is used to indicate at least two non-orthogonal sequences in the extended sequence; the second indication information is used to indicate at least a non-orthogonal sequence in the two sequences that generate the equivalent sequence;
  • the detecting module 62 is configured to perform receiving detection on the received carrier modulated signal.
  • a carrier modulation signal transmitted by a plurality of transmitters, and performing reception detection on the carrier modulation information, wherein the carrier modulation signal is coded and modulated by the transmitter to form a modulation symbol, and the modulation symbol is modulated by the transmitter.
  • the modulation symbol is added to the pilot symbol to form N symbols, and the N symbols are extended by using two extended sequences or one equivalent sequence, and the carrier is modulated by the carrier symbol.
  • FIG. 7 is according to the public.
  • a block diagram of the transmitter of the embodiment, as shown in FIG. 7, includes:
  • the first processor 70 The first processor 70;
  • a first memory 72 for storing processor-executable instructions; wherein, the first processor 70 is configured to code-modulate a bit sequence to be transmitted to form N 1 modulation symbols, and add the N 1 modulation symbols N 2 is formed after the two pilot symbols N pilot symbols using two spreading sequence or an equivalent sequence of N symbols is extended to the extended sign for carrier modulation signal obtained by modulating a carrier, and transmits the modulated carrier signal, wherein, N 1 and N are positive integers, and N 2 is an integer.
  • the equivalent sequence includes: a sequence formed by expanding one of the two extended sequences and forming a sequence with another extended sequence, the bit sequence carrying the first indication Information or second indication information, the first indication information is used to indicate at least two non-orthogonal sequences in the extended sequence; and the second indication information is used to indicate at least a non-orthogonal sequence in the two sequences that generate the equivalent sequence.
  • An optional application scenario of the embodiment of the present disclosure in the case that a large amount of machine communication is required, in many cases, it is necessary to deliver millions of terminals to a certain area, and a transmitter is built in the terminal, if a conventional uplink connection is used.
  • the process of the random access or the handshake is required, which requires a large amount of signaling interaction, which wastes the power of the terminal and increases the cost of the terminal, and the uplink access method of the embodiment of the present disclosure, even if the amount of the terminal is delivered It is very large, but because the uplink access method is simple, it does not require excessive signaling interaction process, thereby reducing the power consumption of the terminal, reducing the terminal cost, and increasing the reliability of the uplink access process.
  • the transmitter In order to better save the terminal power, the transmitter is in a sleep state when there is no data demand.
  • a terminal comprising the transmitter of any of the above.
  • FIG. 8 is a structural block diagram of a receiver, as shown in FIG. 8, according to an embodiment of the present disclosure, including:
  • a second memory 82 for storing second processor executable instructions
  • the second processor 80 is configured to receive a carrier modulated signal transmitted by multiple transmitters, and when the carrier modulated the signal, the bit sequence to be transmitted is code modulated by the transmitter to form N 1 modulation symbols, and the N 1 modulations are used. plus sign form N N 2 symbols are pilot symbols using two spreading sequence or an equivalent sequence of N symbols is extended to the extended sign carrier wave is modulated form, where, N and N.
  • N 2 is an integer
  • the equivalence sequence includes: the equivalence sequence includes: a sequence formed by expanding one of the two extension sequences and forming a sequence with another extension sequence, the bit sequence carrying the first indication Information or second indication information, the first indication information is used to indicate at least two non-orthogonal sequences in the extended sequence; and the second indication information is used to indicate at least a non-orthogonal sequence in the two sequences that generate the equivalent sequence.
  • a sequence determining apparatus configured to determine a real PN sequence or a complex spreading sequence to be used, wherein the L elements of the real PN sequence are from a [-1, +1] set, each element of the complex spreading sequence is a complex number, and the complex number
  • the values of the real part and the imaginary part of all elements in the extended sequence are derived from a set of M-ary real numbers, where M is an integer greater than or equal to 2;
  • the extension device is configured to perform expansion processing on the data symbols to be sent by using the complex extension sequence to generate an extended symbol sequence
  • a signal transmitting device configured to transmit the extended symbol sequence.
  • the values of the real part and the imaginary part of all elements in the complex extended sequence determined by the sequence determining device are derived from a set of real numbers of M elements, wherein:
  • M is an odd number
  • the set of M-ary real numbers is a set of M integers in the range [-(M-1)/2, (M-1)/2]; or
  • M is an even number, and the M-ary real number set is a set of M odd numbers in the range [-(M-1), (M-1)]; or
  • M is an odd number
  • the set of M-ary real numbers is a set of M real numbers obtained by multiplying M integers in the range [-(M-1)/2, (M-1)/2] by the corresponding normalization coefficients, respectively.
  • M is an even number
  • the M-ary real number set is a set of M real numbers obtained by multiplying M odd numbers in the range of [-(M-1), (M-1)] by respective normalization coefficients.
  • sequence determining means determines the complex spreading sequence to be used, including:
  • the values of the real part and the imaginary part of all elements are derived from the M-ary real number set.
  • sequence determining means determines the complex spreading sequence to be used, including:
  • the corresponding L complex constellation points are selected from a complex constellation of M ⁇ M points according to a preset mapping rule
  • the L complex numbers corresponding to the L complex constellation points are determined, and the L complex numbers are sequentially combined to obtain a complex extended sequence, or L complex numbers are multiplied by corresponding energy normalization coefficients and sequentially combined to obtain a complex extended sequence.
  • the signal sending apparatus sends the extended symbol sequence, including: performing OFDM or SC-FDMA multi-carrier modulation with CP on the extended symbol sequence, forming a transmission signal, and transmitting.
  • the signal sending apparatus sends the extended symbol sequence, including: performing single carrier modulation on the extended symbol sequence to form a transmit signal and transmitting.
  • a signal receiving device configured to receive signals transmitted by a plurality of transmitters, wherein the signals transmitted by the plurality of transmitters are respectively extended by respective transmitters using respective complex spreading sequences, and then the generated extensions are expanded.
  • the subsequent symbol sequences are respectively modulated onto the same time-frequency resource;
  • Receiving detection means configured to receive and detect signals received by the plurality of transmitters by using an interference cancellation signal detector, and using a complex extension sequence used by the plurality of transmitters during detection;
  • each element of the complex extension sequence is a complex number
  • the values of the real part and the imaginary part of all elements in the complex extension sequence are derived from a set of M-ary real numbers, where M is an integer greater than or equal to 2.
  • the values of the real part and the imaginary part of all the elements are from a set of real numbers of M elements, wherein:
  • M is an odd number
  • the set of M-ary real numbers is a set of M integers in the range [-(M-1)/2, (M-1)/2]; or
  • M is an even number, and the M-ary real number set is a set of M odd numbers in the range [-(M-1), (M-1)]; or
  • M is an odd number
  • the set of M-ary real numbers is a set of M real numbers obtained by multiplying M integers in the range [-(M-1)/2, (M-1)/2] by the corresponding normalization coefficients, respectively. ;or
  • M is an even number
  • the M-ary real number set is a set of M real numbers obtained by multiplying M odd numbers in the range of [-(M-1), (M-1)] by respective normalization coefficients.
  • FIG. 9 is a flowchart of a transmitter side pair signal processing procedure according to a preferred embodiment 1 of the present disclosure, as shown in FIG.
  • the terminal encodes and modulates the "bit sequence" into CRC + convolutional codes, and then becomes 144 modulation symbols, and then adds 24 pilot symbols (data plus pilot symbols corresponding to LTE 1 physical resource block ( The Physical Resource Block (referred to as the time-frequency resource of the PRB) is used to carry the sequence, and then uses a 4-long complex field extension sequence, and then uses the 8-length (or 4-length) Walsh orthogonal extension sequence to expand (the extended symbol needs LTE 32 (or 16) PRB time-frequency resources are carried), and finally the extended symbols are transmitted to the base station using OFDM/SC-FDMA/DFT-S-OFDM modulation with CP; the base station separates each by using an advanced receiver Terminal information.
  • the terminal encodes and modulates a "bit sequence" into a CRC+ convolutional code, and then becomes 144 modulation symbols.
  • Add 24 pilot symbols data plus pilot symbols corresponding to OFDM 1 PRB time-frequency resources to carry
  • 8 long (or 4 long) Walsh orthogonal spreading sequence to expand
  • 4 long Complex domain spreading sequence the extended symbol requires LTE 32 (or 16) PRB time-frequency resources to carry
  • the extended symbol is modulated using OFDM/SC-FDMA/DFT-S-OFDM with CP, and sent to Base station; the base station uses advanced receivers to separate the information of each terminal.
  • the transmitter side performs signal processing: after the terminal encodes and modulates the "bit sequence" by the CRC+ convolutional code, 144 modulation symbols, and then add 24 pilot symbols (data plus pilot symbols corresponding to OFDM 1 PRB time-frequency resources to carry), and then use a 32-length (or 16-length) extended sequence pair modulation symbols To extend, the 32-length (or 16-length) spreading sequence is extended by 8 long (or 4 long) Walsh orthogonal spreading sequences and 4 long complex domain spreading sequences, and finally the extended symbols are used with CP. OFDM/SC-FDMA/DFT-S-OFDM modulation is transmitted to the base station; the base station uses advanced receivers to separate the information of each terminal.
  • the transmitter side performs signal processing: after the terminal encodes and modulates the "bit sequence" by the CRC+ convolutional code, It becomes 144 modulation symbols, and then adds 24 pilot symbols (data plus pilot symbols corresponding to OFDM 1 PRB time-frequency resources are used to carry), then uses a 4-long complex domain extension sequence, and finally expands the symbols.
  • the OFDM/SC-FDMA/DFT-S-OFDM modulation with CP is transmitted to the base station; the base station separates the information of each terminal using an advanced receiver.
  • FIG. 13 is a flowchart of a transmitter-side uplink access method according to a preferred embodiment 5 of the present disclosure. As shown in FIG. 13, the method includes:
  • Step S1302 determining a 4-long complex spreading sequence or an 8-long (or 4-long) orthogonal spreading sequence based on the bit sequence information.
  • the identification information UE_ID of the terminal itself may be a 40-bit sequence, and the length of the UE_ID is recommended to be greater than 16, C1 is a 4-long complex-domain binary spreading sequence, and C2 is an 8-long Walsh orthogonal spreading sequence.
  • the value of the element in C2 takes a value of ⁇ +1, -1 ⁇ .
  • the bit sequence includes information indicating that the terminal identifies the identity in the network (or information indicating the identity of the terminal, and may be simply referred to as a terminal identity, for example, part or all of the information of the identity information UE_ID of the terminal itself, or a temporary identifier in the network)
  • the bit sequence or an additional bit sequence the length of the additionally added bit sequence, the value and the terminal identity information, or the number of transmissions, or the packet size, or the time-frequency location, or the cell configuration.
  • the 4-length complex spreading sequence or the 8-length (or 4-length) orthogonal spreading sequence is determined according to the bit sequence information, and is divided into the following three schemes according to whether or not to add additional bits and different roles of the added bits:
  • Solution 1 As shown in FIG. 14, determining 4 long complex extensions according to terminal identity information A sequence or an 8-length (or 4 long) orthogonal spreading sequence that does not utilize additional bits to introduce randomness:
  • a method of generating a complex domain binary extension sequence C1 which can be divided into the following three parts:
  • the transmitter Taking a 2 ⁇ 2 integer set as an example, the transmitter generates an index value of an integer sequence, and the values of the elements in the integer sequence are all from a 4-ary integer set ⁇ 0, 1, 2, 3 ⁇ , and the length of the integer sequence Is 4.
  • the bit sequence (a i ... a 0 ) needs to be cyclically shifted 4 times, 0 ⁇ i ⁇ 39, and the step size of each cyclic shift can be 0 bits. Or a positive integer number of bits, and then use the decimal conversion method described above to find the decimal numbers A 1 , A 2 , A 3 , and A 4 of the bit sequence after each cyclic shift.
  • a 1 , A 2 , A 3 and A 4 the values of each element in the integer sequence are determined as: A 1 mod 4, A 2 mod 4, A 3 mod 4 and A 4 mod 4, Where A p mod 4 represents the value of modulo 4, p belongs to ⁇ 1, 2, 3, 4 ⁇ , then the resulting sequence of integers ⁇ A 1 mod 4, A 2 mod 4, A 3 mod 4, A 4 mod 4 ⁇ .
  • the transmitter generates an index value of an integer sequence
  • the element values of the integer sequence are all from a 9-ary integer set ⁇ 0, 1, 2, ..., 8 ⁇ , and the length of the sequence of integers is 4.
  • the bit sequence a i ... a 0 needs to be cyclically shifted 4 times, 0 ⁇ i ⁇ 39, and the step size of each cyclic shift may be 0 bits, or It is a positive integer number of bits, and the decimal numbers A 1 , A 2 , A 3 , and A 4 of the bit sequence after each cyclic shift are obtained by the above-described decimal conversion method.
  • a p mod 9 represents the value of modulo 9 and p belongs to ⁇ 1, 2, 3, 4 ⁇ , then the resulting sequence of integers ⁇ A 1 mod 9, A 2 mod 9, A 3 mod 9, A 4 mod 9 ⁇ . .
  • the transmitter generates an index value of an integer sequence whose element values are derived from an 8-ary integer set ⁇ 0, 1, 2, ..., 7 ⁇ , and the length of the sequence of integers Is 4.
  • the bit sequence a i ... a 0 needs to be cyclically shifted 4 times, 0 ⁇ i ⁇ 39, and the step size of each cyclic shift may be 0 bits, or It is a positive integer number of bits, and the decimal numbers A 1 , A 2 , A 3 and A 4 of the bit sequence after each cyclic shift are obtained by the above-described decimal conversion method.
  • the complex numbers corresponding to the four complex constellation points are -1+j, 1+j, -1-j, 1-j.
  • a constellation map containing nine complex constellation points associated with an index value is constructed.
  • the values of the real and imaginary parts of each constellation point in the complex constellation are derived from a set of 3-ary real numbers, and the set of 3 real numbers is represented as [-1, 0, +1].
  • the complex numbers corresponding to the nine complex constellation points are -1+j, 1+j, -1-j, 1-j, -j, j, -1, +1, 0, respectively.
  • a constellation map containing eight complex constellation points associated with an index value is constructed.
  • the complex number corresponding to each constellation point in the complex constellation diagram is -1+j, 1+j, -1-j, 1-j, -j, j, -1, +1, that is, does not contain 0 points.
  • a constellation map containing eight complex constellation points associated with an index value is constructed.
  • the complex numbers corresponding to each constellation point in the complex constellation diagram are (-1+j)/sqrt(2), (1+j)/sqrt(2), (-1-j)/sqrt(2), (1 -j)/sqrt(2), -j, j, -1, +1, that is, does not contain 0 points.
  • the index value of the integer sequence in (1) is mapped bit by bit to the 4-point complex constellation
  • the complex constellation points (each complex constellation point represents a complex number) generate a complex extension sequence, which is expressed as follows:
  • ComplexSeq p represents the pth element of the complex spreading sequence, which is obtained from the mapping of Ap according to the mapping between the elements in the 4-ary integer set and the complex constellation points of the 4-point complex constellation, and A p represents a pseudo-random integer sequence.
  • the pth element represents the pth element of the complex spreading sequence, which is obtained from the mapping of Ap according to the mapping between the elements in the 4-ary integer set and the complex constellation points of the 4-point complex constellation
  • a p represents a pseudo-random integer sequence. The pth element.
  • the integer sequence index value four complex numbers corresponding to the four complex constellation points are determined, and four complex numbers are sequentially combined to obtain a complex extension sequence, or four complex numbers are multiplied by corresponding energy normalization coefficients and then combined to obtain a complex extension. sequence.
  • the index value of the sequence of integers in (1) is mapped bit by bit according to the mapping relationship between the elements in the 9-ary integer set and the complex constellation points of the 9-point complex constellation (as shown in FIG. 16).
  • the complex constellation points to each of the 9-point complex constellation diagrams (each complex constellation point represents a complex number) generate a complex extension sequence, which is expressed as follows:
  • ComplexSeq p denotes the pth element of the complex spreading sequence, and is mapped from Ap according to the mapping relationship between the elements in the 9-ary integer set and the complex constellation points of the 9-point complex constellation, and A p represents a pseudo-random integer sequence The pth element.
  • the integer sequence index value four complex numbers corresponding to the nine complex constellation points are determined, and four complex numbers are sequentially combined to obtain a complex extension sequence, or four complex numbers are multiplied by corresponding energy normalization coefficients and then combined to obtain a complex extension. sequence.
  • the index value of the sequence of integers in (1) is mapped bit by bit according to the mapping relationship between the elements in the 8-ary integer set and the complex constellation points of the 8-point complex constellation (as shown in FIG. 17).
  • the complex constellation points to the complex constellation of 8 points (each complex constellation point represents a complex number) to generate a complex extension sequence, which is expressed as follows:
  • ComplexSeq p represents the pth element of the complex spreading sequence, and is mapped by A p according to the mapping relationship between the elements in the 8-ary integer set and the complex constellation points of the 8-point complex constellation, and A p represents a pseudo-random integer The pth element of the sequence.
  • integer sequence index value four complex numbers corresponding to eight complex constellation points are determined, and four complex numbers are sequentially combined to obtain a complex extension sequence, or four complex numbers are multiplied by corresponding energy normalization coefficients and then combined to obtain a complex extension. sequence.
  • the index value of the sequence of integers in (1) is mapped bit by bit according to the mapping relationship between the elements in the 8-ary integer set and the complex constellation points of the 8-point complex constellation (as shown in FIG. 18).
  • the complex constellation points to the complex constellation of 8 points (each complex constellation point represents a complex number) to generate a complex extension sequence, which is expressed as follows:
  • ComplexSeq p represents the pth element of the complex spreading sequence, and is mapped by A p according to the mapping relationship between the elements in the 8-ary integer set and the complex constellation points of the 8-point complex constellation, and A p represents a pseudo-random integer The pth element of the sequence.
  • integer sequence index value four complex numbers corresponding to eight complex constellation points are determined, and four complex numbers are sequentially combined to obtain a complex extension sequence, or four complex numbers are multiplied by corresponding energy normalization coefficients and then combined to obtain a complex extension. sequence.
  • index value of an integer is generated according to the UE_ID, the index value is from a set of (2 ⁇ 2) 4- ary integers, and the set of 256-element integers is a set of all integers in the range [0,256-1] or [1,256] ;
  • a decimal number converted by the bit sequence a i ... a 0 is required, and 0 ⁇ i ⁇ 39; then, the above decimal number is modulo-calculated to 256, and the obtained modulus value is obtained. That is the index value.
  • An index value of an integer is generated according to the UE_ID, the index value is from a (3 ⁇ 3) 4- ary integer set, and the 6561-element integer set is a set of all integers in the range [0,6561-1] or [1,6561] ;
  • a decimal number converted by the bit sequence a i ... a 0 is required, and 0 ⁇ i ⁇ 39; then, the above-mentioned decimal number pair 6561 is subjected to a modulo operation, and the obtained modulo value is obtained. That is the index value.
  • a 4-long non-orthogonal spreading sequence is generated, and each element of the non-orthogonal spreading sequence is a complex number, and the real part of all elements in the extended sequence is extended.
  • Both the imaginary and the imaginary parts are derived from a set of 3 real numbers, and the set of 3 real numbers is a set of odd numbers in the range [-1, 0, +1], but the real part of all elements in the extended sequence is required here.
  • the imaginary part cannot be 0 at the same time.
  • An index value of an integer is generated according to the UE_ID, the index value is from a set of 4096-yuan integers, and the set of 4096-yuan integers is all integer groups in the range [0, 4096-1] or [1, 4096] a collection of
  • the index value of the integer In order to generate the index value of the integer, firstly, you need to be a bit sequence a i ?? a 0 decimal conversion, and 0 ⁇ i ⁇ 39; Then, the decimal number 4096 of a modulo operation, the modulo value is obtained That is the index value.
  • the obtained four complex numbers are sequentially combined to obtain a complex extended sequence, or four complex numbers are multiplied by corresponding energy normalization coefficients and sequentially combined to obtain a complex extended sequence.
  • the non-orthogonal sequence set generated at this time has (2 ⁇ 2) 4 sequences.
  • the obtained four complex numbers are sequentially combined to obtain a complex extended sequence, or four complex numbers are multiplied by corresponding energy normalization coefficients and sequentially combined to obtain a complex extended sequence.
  • the non-orthogonal sequence set generated at this time has (3 ⁇ 3) 4 sequences.
  • the obtained four complex numbers are sequentially combined to obtain a complex extended sequence, or four complex numbers are multiplied by corresponding energy normalization coefficients and sequentially combined to obtain a complex extended sequence.
  • the non-orthogonal sequence set generated at this time has (3 ⁇ 3-1) 4 sequences.
  • one of the four long non-orthogonal sequences (tables) including (3 ⁇ 3) 4 pieces in (2) is selected; or
  • one of the four long non-orthogonal sequences (tables) including (3 ⁇ 3-1) 4 pieces in (2) is selected.
  • index value of an integer is generated according to the UE_ID, the index value is from an 8-element (or 4-element) integer set, and the 8-element (or 4-element) integer set is in the range [0, 8-1] or [1, 8] ( Or a set of all integers in the range [0, 4-1] or [1, 4];
  • a decimal number converted by a i ... a 0 is required, and 0 ⁇ i ⁇ 39; then, the above decimal number is modulo 8 and the obtained modulo value is Index value.
  • each row or each column 8 H 8 can be constructed of long Walsh code sequence.
  • each row or each column 8 H 8 can be constructed of long Walsh code sequence.
  • Solution 2 As shown in FIG. 19, a 4-bit complex spreading sequence is determined according to an additional bit sequence (the bit sequence length may be greater than or equal to 0) and a bit sequence of the terminal identity information (the bit sequence length may be greater than or equal to 0). Or an 8-ort (or 4 long) orthogonal spreading sequence. Since the value of the extra bit sequence is randomly valued each time it is retransmitted, this additional bit sequence can be randomized:
  • a method of generating a complex domain binary extension sequence C1 which can be divided into the following three parts:
  • UE_ID is a 40-length 0, 1 binary bit sequence, for example, a 39 a 38 ... a 1 a 0 , this bit sequence is converted into a decimal number, and the decimal conversion method is: a 39 ⁇ 2 39 + a 38 ⁇ 2 38 + ... + a 1 ⁇ 2 1 + a 0 ⁇ 2 0 .
  • the length of the extra bit sequence is greater than or equal to 0, and each element takes a value of ⁇ 0, 1 ⁇ .
  • the transmitter Taking a 2 ⁇ 2 integer set as an example, the transmitter generates an index value of an integer sequence, and the values of the elements in the integer sequence are all from a 4-ary integer set ⁇ 0, 1, 2, 3 ⁇ , and the length of the integer sequence Is 4.
  • the bit sequence (a i ... a 0 + b m ... b 0 ) needs to be performed 4 times.
  • Cyclic shift, 0 ⁇ i ⁇ 39, 0 ⁇ m ⁇ M, and the step size of each cyclic shift can be 0 bits, or a positive integer number of bits, and then use the above decimal conversion method to find The decimal numbers A 1 , A 2 , A 3 and A 4 of the bit sequence after each cyclic shift.
  • the value of the additional Y bits is randomly selected in each retransmission, or the value of the additional Y bits is randomly selected in each cyclic shift;
  • the bit sequence (a i ... a 0 ) needs to be cyclically shifted 4 times, 0 ⁇ i ⁇ 39, and the step size of each cyclic shift may be 0 bits, or a positive integer number of bits, and then use the above decimal conversion method to find the decimal number B of the bit sequence after each cyclic shift. 1 , B 2 , B 3 and B 4 .
  • the bit sequence (b m ??b 0 ) is converted into decimal, 0 ⁇ m ⁇ M, and the result of the operation is added to B 1 , B 2 , B 3 and B 4 to obtain a new 4 decimal numbers A 1 , A 2, A 3 and A 4. And when the transmission fails, the value of the additional Y bits is randomly selected in each retransmission;
  • the bit sequence (a i ... a 0 + b m ... b 0 ) needs to be (b) m togetherb 0 )
  • Perform 4 randomization values 0 ⁇ i ⁇ 39, 0 ⁇ m ⁇ M, and each time contains a randomized bit sequence (a i ... a 0 + b m « b 0 )
  • the sequence is converted to decimal numbers A 1 , A 2 , A 3 and A 4 .
  • the value of the additional Y bits is 4 times randomized each time the retransmission is performed;
  • a 1 , A 2 , A 3 and A 4 the values of each element in the integer sequence are determined as: A 1 mod 4, A 2 mod 4, A 3 mod 4 and A 4 mod 4, Where A p mod 4 represents the value of modulo 4, p belongs to ⁇ 1, 2, 3, 4 ⁇ , then the resulting sequence of integers ⁇ A 1 mod 4, A 2 mod 4, A 3 mod 4, A 4 mod 4 ⁇ .
  • the transmitter generates an index value of an integer sequence
  • the element values of the integer sequence are all from a 9-ary integer set ⁇ 0, 1, 2, ..., 8 ⁇ , and the length of the sequence of integers is 4.
  • the bit sequence (a i ... a 0 + b m ... b 0 ) needs to be performed 4 times.
  • Cyclic shift, 0 ⁇ i ⁇ 39, 0 ⁇ m ⁇ M, and the step size of each cyclic shift can be 0 bits, or a positive integer number of bits, and then use the above decimal conversion method to find The decimal numbers A 1 , A 2 , A 3 and A 4 of the bit sequence after each cyclic shift.
  • the value of the additional Y bits is randomly selected in each retransmission, or the value of the additional Y bits is randomly selected in each cyclic shift;
  • the bit sequence (a i ... a 0 ) needs to be cyclically shifted 4 times, 0 ⁇ i ⁇ 39, and the step size of each cyclic shift may be 0 bits, or a positive integer number of bits, and then use the above decimal conversion method to find the decimal number B of the bit sequence after each cyclic shift. 1 , B 2 , B 3 and B 4 .
  • the bit sequence (b m ??b 0 ) is converted into decimal, 0 ⁇ m ⁇ M, and the result of the operation is added to B 1 , B 2 , B 3 and B 4 to obtain a new 4 decimal numbers A 1 , A 2 , A 3 and A 4 . And when the transmission fails, the value of the additional Y bits is randomly selected in each retransmission;
  • the bit sequence (a i ... a 0 + b m ... b 0 ) needs to be (b) m togetherb 0 )
  • Perform 4 randomization values 0 ⁇ i ⁇ 39, 0 ⁇ m ⁇ M, and each time contains a randomized bit sequence (a i ... a 0 + b m « b 0 )
  • the sequence is converted to decimal numbers A 1 , A 2 , A 3 and A 4 .
  • the value of the additional Y bits is 4 times randomized each time the retransmission is performed;
  • a p mod 9 represents the value of modulo 9 and p belongs to ⁇ 1, 2, 3, 4 ⁇ .
  • the transmitter generates an index value of an integer sequence whose element values are derived from an 8-ary integer set ⁇ 0, 1, 2, ..., 7 ⁇ , and the length of the sequence of integers Is 4.
  • the bit sequence (a i ... a 0 + b m ... b 0 ) needs to be performed 4 times.
  • Cyclic shift, 0 ⁇ i ⁇ 39, 0 ⁇ m ⁇ M, and the step size of each cyclic shift can be 0 bits, or a positive integer number of bits, and then use the above decimal conversion method to find The decimal numbers A 1 , A 2 , A 3 and A 4 of the bit sequence after each cyclic shift.
  • the value of the additional Y bits is randomly selected in each retransmission, or the value of the additional Y bits is randomly selected in each cyclic shift;
  • the bit sequence (a i ... a 0 ) needs to be cyclically shifted 4 times, 0 ⁇ i ⁇ 39, and the step size of each cyclic shift may be 0 bits, or a positive integer number of bits, and then use the above decimal conversion method to find the decimal number B of the bit sequence after each cyclic shift. 1 , B 2 , B 3 and B 4 .
  • the bit sequence (b m ??b 0 ) is converted into decimal, 0 ⁇ m ⁇ M, and the result of the operation is added to B 1 , B 2 , B 3 and B 4 to obtain a new 4 decimal numbers A 1 , A 2 , A 3 and A 4 . And when the transmission fails, the value of the additional Y bits is randomly selected in each retransmission;
  • the bit sequence (a i ... a 0 + b m ... b 0 ) needs to be (b) m togetherb 0 )
  • Perform 4 randomization values 0 ⁇ i ⁇ 39, 0 ⁇ m ⁇ M, and each time contains a randomized bit sequence (a i ... a 0 + b m « b 0 )
  • the sequence is converted to decimal numbers A 1 , A 2 , A 3 and A 4 .
  • the value of the additional Y bits is 4 times randomized each time the retransmission is performed;
  • a 1 , A 2 , A 3 and A 4 the values of each element in the sequence of integers are found as: A 1 mod 8 , A 2 mod 8, A 3 mod 8 and A 4 mod 8.
  • a p mod 8 represents the value of modulo 8 and p belongs to ⁇ 1, 2, 3, 4 ⁇ .
  • the complex numbers corresponding to the four complex constellation points are -1+j, 1+j, -1-j, 1-j.
  • a constellation map containing nine complex constellation points associated with an index value is constructed.
  • the values of the real and imaginary parts of each constellation point in the complex constellation are derived from a set of 3-ary real numbers, and the set of 3 real numbers is represented as [-1, 0, +1].
  • the complex numbers corresponding to the nine complex constellation points are -1+j, 1+j, -1-j, 1-j, -j, j, -1, +1, 0, respectively.
  • a constellation map containing eight complex constellation points associated with an index value is constructed.
  • the complex number corresponding to each constellation point in the complex constellation diagram is -1+j, 1+j, -1-j, 1-j, -j, j, -1, +1, that is, does not contain 0 points.
  • a constellation map containing eight complex constellation points associated with an index value is constructed.
  • the complex numbers corresponding to each constellation point in the complex constellation diagram are (-1+j)/sqrt(2), (1+j)/sqrt(2), (-1-j)/sqrt(2), (1 -j)/sqrt(2), -j, j, -1, +1, that is, does not contain 0 points.
  • the index value of the integer sequence in (1) is mapped bit by bit to the 4-point complex constellation
  • the complex constellation points (each complex constellation point represents a complex number) generate a complex extension sequence, which is expressed as follows:
  • ComplexSeq p represents a p-th element of the complex spreading sequence obtained from A p mapping according to the mapping relation between the elements 4 yuan set of integers and 4:00 plurality of constellation points in the complex constellation
  • a p represents an integer of pseudorandom The pth element of the sequence.
  • the integer sequence index value four complex numbers corresponding to the four complex constellation points are determined, and four complex numbers are sequentially combined to obtain a complex extension sequence, or four complex numbers are multiplied by corresponding energy normalization coefficients and then combined to obtain a complex extension. sequence.
  • the index value of the sequence of integers in (1) is mapped bit by bit according to the mapping relationship between the elements in the 9-ary integer set and the complex constellation points of the 9-point complex constellation (as shown in FIG. 16).
  • the complex constellation points to each of the 9-point complex constellation diagrams (each complex constellation point represents a complex number) generate a complex extension sequence, which is expressed as follows:
  • ComplexSeq p represents the pth element of the complex spreading sequence, and is mapped by A p according to the mapping relationship between the elements in the 9-ary integer set and the complex constellation points of the 9-point complex constellation, and A p represents a pseudo-random integer The pth element of the sequence.
  • the integer sequence index value four complex numbers corresponding to the nine complex constellation points are determined, and four complex numbers are sequentially combined to obtain a complex extension sequence, or four complex numbers are multiplied by corresponding energy normalization coefficients and then combined to obtain a complex extension. sequence.
  • the index value of the sequence of integers in (1) is mapped bit by bit according to the mapping relationship between the elements in the 8-ary integer set and the complex constellation points of the 8-point complex constellation (as shown in FIG. 17).
  • the complex constellation points to the complex constellation of 8 points (each complex constellation point represents a complex number) to generate a complex extension sequence, which is expressed as follows:
  • integer sequence index value four complex numbers corresponding to eight complex constellation points are determined, and four complex numbers are sequentially combined to obtain a complex extension sequence, or four complex numbers are multiplied by corresponding energy normalization coefficients and then combined to obtain a complex extension. sequence.
  • the index value of the sequence of integers in (1) is mapped bit by bit according to the mapping relationship between the elements in the 8-ary integer set and the complex constellation points of the 8-point complex constellation (as shown in FIG. 18).
  • the complex constellation points to the complex constellation of 8 points (each complex constellation point represents a complex number) to generate a complex extension sequence, which is expressed as follows:
  • ComplexSeqi represents the pth element of the complex spreading sequence, and is mapped by A p according to the mapping relationship between the elements in the 8-ary integer set and the complex constellation points of the 8-point complex constellation, and A p represents a pseudo-random integer sequence.
  • the pth element represents the pth element of the complex spreading sequence, and is mapped by A p according to the mapping relationship between the elements in the 8-ary integer set and the complex constellation points of the 8-point complex constellation, and A p represents a pseudo-random integer sequence.
  • the pth element is mapped by A p according to the mapping relationship between the elements in the 8-ary integer set and the complex constellation points of the 8-point complex constellation, and A p represents a pseudo-random integer sequence.
  • integer sequence index value four complex numbers corresponding to eight complex constellation points are determined, and four complex numbers are sequentially combined to obtain a complex extension sequence, or four complex numbers are multiplied by corresponding energy normalization coefficients and then combined to obtain a complex extension. sequence.
  • the length of the additionally added bit sequence is greater than or equal to 0, each element takes a value of ⁇ 0, 1 ⁇ , and the additional bits are b M ... b 0 , and M > 0.
  • an integer index value is generated.
  • a non-orthogonal sequence in the non-orthogonal sequence set can be uniquely specified, and the index value is from a (2 ⁇ 2) 4- ary integer set, and the 256-element integer set is a set of all integers in the range [0,256-1] or [1,256];
  • the bit sequence (b m ... b 0 ) is converted into a decimal number, 0 ⁇ m ⁇ M; then, the above decimal number is modulo 256, and the obtained modulo value is the index value. And when the transmission fails, the value of the additional Y bits is randomly selected every time the retransmission is performed.
  • An index value of an integer is generated according to the bit sequence (a i ... a 0 + b m ... b 0 ), 0 ⁇ i ⁇ 39, 0 ⁇ m ⁇ M, and the index value is derived from a (3 ⁇ 3) 4- ary integer Set, a set of 6561 yuan integers is a set of all integers in the range [0,6561-1] or [1,6561];
  • the decimal number performs a modulo operation on the 6561, and the obtained modulus value is the index value.
  • the value of the additional Y bits is randomly selected every time the retransmission is performed.
  • the extra bit sequence is b M ... b 0 and the (b M —b 0 ) decimal value is greater than 6561
  • first need The bit sequence (b m ... b 0 ) is converted into a decimal number, 0 ⁇ m ⁇ M; then, the above-mentioned decimal number pair 6561 is modulo-operated, and the obtained modulo value is an index value.
  • the value of the additional Y bits is randomly selected every time the retransmission is performed.
  • a 4-long non-orthogonal spreading sequence is generated, and each element of the non-orthogonal spreading sequence is a complex number, and the real part of all elements in the extended sequence is extended.
  • Both the imaginary and the imaginary parts are derived from a set of 3 real numbers, and the set of 3 real numbers is a set of odd numbers in the range [-1, 0, +1], but the real part of all elements in the extended sequence is required here.
  • the imaginary part cannot be 0 at the same time.
  • An index value of an integer is generated according to (a i ... a 0 + b m ... b 0 ), 0 ⁇ i ⁇ 39, 0 ⁇ m ⁇ M, and the index value is from a set of 4096-yuan integers, and a set of 4096-yuan integers Is a collection of all integers in the range [0, 4096-1] or [1, 4096];
  • the decimal number converted by (a i ... a 0 + b m ... b 0 ), 0 ⁇ i ⁇ 39, 0 ⁇ m ⁇ M;
  • the decimal number is modulo-calculated for 4096, and the obtained modulus value is the index value.
  • the value of the additional Y bits is randomly selected every time the retransmission is performed.
  • the extra bit sequence is b M ... b 0 and the (b M —b 0 ) decimal value is greater than 4096
  • first need The bit sequence (b m ... b 0 ) is converted into a decimal number, 0 ⁇ m ⁇ M; then, the above decimal number is modulo-operated 4096, and the obtained modulo value is an index value.
  • the value of the additional Y bits is randomly selected every time the retransmission is performed.
  • the obtained four complex numbers are sequentially combined to obtain a complex extended sequence, or four complex numbers are multiplied by corresponding energy normalization coefficients and sequentially combined to obtain a complex extended sequence.
  • the non-orthogonal sequence set generated at this time has (2 ⁇ 2) 4 sequences.
  • a 4-long non-orthogonal spreading sequence is generated, and each element of the non-orthogonal spreading sequence is a complex number, and the real part of all elements in the extended sequence is extended.
  • the values of the imaginary part and the imaginary part are all from a set of 3 real numbers, and the set of 3 real numbers is a set of odd numbers in the range of ⁇ -1, 0, +1 ⁇ .
  • the obtained four complex numbers are sequentially combined to obtain a complex extended sequence, or four complex numbers are multiplied by corresponding energy normalization coefficients and sequentially combined to obtain a complex extended sequence.
  • the non-orthogonal sequence set generated at this time has (3 ⁇ 3) 4 sequences.
  • a 4-long non-orthogonal spreading sequence is generated, and each element of the non-orthogonal spreading sequence is a complex number, and the real part of all elements in the extended sequence is extended.
  • the values of the imaginary part and the imaginary part are all from a set of 3 real numbers, and the set of 3 real numbers is a set of odd numbers in the range of ⁇ -1, 0, +1 ⁇ .
  • the obtained four complex numbers are sequentially combined to obtain a complex extended sequence, or four complex numbers are multiplied by corresponding energy normalization coefficients and sequentially combined to obtain a complex extended sequence.
  • the non-orthogonal sequence set generated at this time has (3 ⁇ 3-1) 4 sequences.
  • one of the four long non-orthogonal sequences (tables) including (3 ⁇ 3) 4 pieces in (2) is selected; or
  • one of the four long non-orthogonal sequences (tables) including (3 ⁇ 3-1) 4 pieces in (2) is selected.
  • the length of the additionally added bit sequence is greater than or equal to 0, each element takes a value of ⁇ 0, 1 ⁇ , and the additional bits are b M ... b 0 , and M > 0.
  • the index value of the integer uniquely specifies a sequence in the orthogonal sequence set, and the index value comes from an 8-element (or 4-element) integer set, and an 8-element (or 4-ary) integer set. Is a set of all integers in the range [0,8-1] or [1,8] (or in the range [0,4-1] or [1,4]);
  • the bit sequence (a i ... a 0 + b m ... b 0 ) needs to be converted into one
  • the value of the additional Y bits is randomly selected every time the retransmission is performed;
  • the extra bits are b M ... b 0 and M>0
  • the value of the additional Y bits is randomly selected every time the retransmission is performed.
  • each row or each column 8 H 8 can be constructed of long Walsh code sequence.
  • each row or each column 8 H 8 can be constructed of long Walsh code sequence.
  • bit sequence length can be A 4-bit complex spreading sequence or an 8-length (or 4 long) orthogonal spreading sequence is determined with a bit sequence greater than or equal to 0) and terminal identity information (the bit sequence length may be greater than or equal to 0).
  • the value of the additionally added bit sequence specifies the starting position of the cyclic shift, and the value of the additionally added bit sequence may be randomly selected during each retransmission, or may be sequentially increased:
  • the generation process of the non-orthogonal extended sequence C1 and the orthogonal extended sequence C2 is introduced more specifically:
  • a method of generating a complex domain binary extension sequence C1 which can be divided into the following three parts:
  • UE_ID is a 40-length 0, 1 binary bit sequence, for example, a 39 a 38 ... a 1 a 0 , this bit sequence is converted into a decimal number, and the decimal conversion method is: a 39 ⁇ 2 39 + a 38 ⁇ 2 38 + ... + a 1 ⁇ 2 1 + a 0 ⁇ 2 0 .
  • the length of the extra bit sequence is greater than or equal to 0, and each element takes a value of ⁇ 0, 1 ⁇ .
  • the transmitter Taking a 2 ⁇ 2 integer set as an example, the transmitter generates an index value of an integer sequence, and the values of the elements in the integer sequence are all from a 4-ary integer set ⁇ 0, 1, 2, 3 ⁇ , and the length of the integer sequence Is 4.
  • the bit sequence (a i ... a 0 + b m ... b 0 ) needs to be performed 4 times.
  • Cyclic shift, 0 ⁇ i ⁇ 39, 0 ⁇ m ⁇ M, and the step size of each cyclic shift can be 0 bits, or a positive integer number of bits, and then use the above decimal conversion method to find The decimal numbers A 1 , A 2 , A 3 and A 4 of the bit sequence after each cyclic shift.
  • the value of the additionally added bit sequence specifies the starting position of the cyclic shift, and when the current transmission fails, the value of the additionally added Y bits may be randomly selected during each retransmission, or may be sequentially increased; If the value of the extra bit is incremented in each retransmission, then after the current transmission is successful, the value of the extra bit needs to be cleared.
  • a 1 , A 2 , A 3 and A 4 the values of each element in the integer sequence are determined as: A 1 mod 4, A 2 mod 4, A 3 mod 4 and A 4 mod 4, Where A p mod 4 represents the value of modulo 4, p belongs to ⁇ 1, 2, 3, 4 ⁇ , then the resulting sequence of integers ⁇ A 1 mod 4, A 2 mod 4, A 3 mod 4, A 4 mod 4 ⁇ .
  • the transmitter generates an index value of an integer sequence
  • the element values of the integer sequence are all from a 9-ary integer set ⁇ 0, 1, 2, ..., 8 ⁇ , and the length of the sequence of integers is 4.
  • the bit sequence (a i ... a 0 + b m ... b 0 ) needs to be performed 4 times.
  • Cyclic shift, 0 ⁇ i ⁇ 39, 0 ⁇ m ⁇ M, and the step size of each cyclic shift can be 0 bits, or a positive integer number of bits, and then use the above decimal conversion method to find The decimal numbers A 1 , A 2 , A 3 and A 4 of the bit sequence after each cyclic shift.
  • the value of the additionally added bit sequence specifies the starting position of the cyclic shift, and when the current transmission fails, the value of the additionally added Y bits may be randomly selected during each retransmission, or may be sequentially increased; If the value of the extra bit is incremented in each retransmission, then after the current transmission is successful, the value of the extra bit needs to be cleared.
  • a p mod 9 represents the value of modulo 9 and p belongs to ⁇ 1, 2, 4 ⁇ .
  • the transmitter generates an index value of an integer sequence whose element values are derived from an 8-ary integer set ⁇ 0, 1, 2, ..., 7 ⁇ , and the length of the sequence of integers Is 4.
  • the bit sequence (a i ... a 0 + b m ... b 0 ) needs to be performed 4 times.
  • Cyclic shift, 0 ⁇ i ⁇ 39, 0 ⁇ m ⁇ M, and the step size of each cyclic shift can be 0 bits, or a positive integer number of bits, and then use the above decimal conversion method to find The decimal numbers A 1 , A 2 , A 3 and A 4 of the bit sequence after each cyclic shift.
  • the value of the additionally added bit sequence specifies the starting position of the cyclic shift, and when the current transmission fails, the value of the additionally added Y bits may be randomly selected during each retransmission, or may be sequentially increased; If the value of the extra bit is incremented in each retransmission, then after the current transmission is successful, the value of the extra bit needs to be cleared.
  • a 1 , A 2 , A 3 and A 4 the values of each element in the sequence of integers are found as: A 1 mod 8 , A 2 mod 8, A 3 mod 8 and A 4 mod 8.
  • a p mod 8 represents the value of modulo 8 and p belongs to ⁇ 1, 2, 3, 4 ⁇ .
  • the complex numbers corresponding to the four complex constellation points are -1+j, 1+j, -1-j, 1-j.
  • a constellation map containing nine complex constellation points associated with an index value is constructed.
  • the values of the real and imaginary parts of each constellation point in the complex constellation are derived from a set of 3-ary real numbers, and the set of 3 real numbers is represented as [-1, 0, +1].
  • the complex numbers corresponding to the nine complex constellation points are -1+j, 1+j, -1-j, 1-j, -j, j, -1, +1, 0, respectively.
  • a constellation map containing eight complex constellation points associated with an index value is constructed.
  • the complex number corresponding to each constellation point in the complex constellation diagram is -1+j, 1+j, -1-j, 1-j, -j, j, -1, +1, that is, does not contain 0 points.
  • a constellation map containing eight complex constellation points associated with an index value is constructed.
  • the complex numbers corresponding to each constellation point in the complex constellation diagram are (-1+j)/sqrt(2), (1+j)/sqrt(2), (-1-j)/sqrt(2), (1 -j)/sqrt(2), -j, j, -1, +1, that is, does not contain 0 points.
  • the index value of the integer sequence in (1) is mapped bit by bit to the 4-point complex number.
  • the complex constellation points of the constellation diagram (each complex constellation point represents a complex number) generate a complex extension sequence, which is formulated as follows:
  • ComplexSeq p represents a p-th element of the complex spreading sequence obtained from A p mapping according to the mapping relation between the elements 4 yuan set of integers and 4:00 plurality of constellation points in the complex constellation
  • a p represents an integer of pseudorandom The pth element of the sequence.
  • the integer sequence index value four complex numbers corresponding to the four complex constellation points are determined, and four complex numbers are sequentially combined to obtain a complex extension sequence, or four complex numbers are multiplied by corresponding energy normalization coefficients and then combined to obtain a complex extension. sequence.
  • the index value of the sequence of integers in (1) is mapped bit by bit according to the mapping relationship between the elements in the 9-ary integer set and the complex constellation points of the 9-point complex constellation (as shown in FIG. 16).
  • the complex constellation points to each of the 9-point complex constellation diagrams (each complex constellation point represents a complex number) generate a complex extension sequence, which is expressed as follows:
  • ComplexSeq p represents the pth element of the complex spreading sequence, and is mapped by A p according to the mapping relationship between the elements in the 9-ary integer set and the complex constellation points of the 9-point complex constellation, and A p represents a pseudo-random integer The pth element of the sequence.
  • the integer sequence index value four complex numbers corresponding to the nine complex constellation points are determined, and four complex numbers are sequentially combined to obtain a complex extension sequence, or four complex numbers are multiplied by corresponding energy normalization coefficients and then combined to obtain a complex extension. sequence.
  • the index value of the sequence of integers in (1) is mapped bit by bit according to the mapping relationship between the elements in the 8-ary integer set and the complex constellation points of the 8-point complex constellation (as shown in FIG. 17).
  • the complex constellation points to the complex constellation of 8 points (each complex constellation point represents a complex number) to generate a complex extension sequence, which is expressed as follows:
  • ComplexSeq p represents the pth element of the complex spreading sequence, and is mapped by A p according to the mapping relationship between the elements in the 8-ary integer set and the complex constellation points of the 8-point complex constellation, and A p represents a pseudo-random integer The pth element of the sequence.
  • integer sequence index value four complex numbers corresponding to eight complex constellation points are determined, and four complex numbers are sequentially combined to obtain a complex extension sequence, or four complex numbers are multiplied by corresponding energy normalization coefficients and then combined to obtain a complex extension. sequence.
  • the index value of the sequence of integers in (1) is mapped bit by bit according to the mapping relationship between the elements in the 8-ary integer set and the complex constellation points of the 8-point complex constellation (as shown in FIG. 18).
  • the complex constellation points to the complex constellation of 8 points (each complex constellation point represents a complex number) to generate a complex extension sequence, which is expressed as follows:
  • ComplexSeq p represents the pth element of the complex spreading sequence, and is mapped by A p according to the mapping relationship between the elements in the 8-ary integer set and the complex constellation points of the 8-point complex constellation, and A p represents a pseudo-random integer The pth element of the sequence.
  • integer sequence index value four complex numbers corresponding to eight complex constellation points are determined, and four complex numbers are sequentially combined to obtain a complex extension sequence, or four complex numbers are multiplied by corresponding energy normalization coefficients and then combined to obtain a complex extension. sequence.
  • the length of the additionally added bit sequence is greater than or equal to 0, each element takes a value of ⁇ 0, 1 ⁇ , and the additional bits are b M ... b 0 , and M > 0.
  • an integer index value is generated.
  • a non-orthogonal sequence in the non-orthogonal sequence set can be uniquely specified, and the index value is from a (2 ⁇ 2) 4- ary integer set, and the 256-element integer set is a set of all integers in the range [0,256-1] or [1,256];
  • the bit sequence (b m ... b 0 ) is converted into a decimal number, 0 ⁇ m ⁇ M; then, the above decimal number is modulo 256, and the obtained modulo value is the index value. And when the transmission fails, the value of the additional Y bits is randomly selected every time the retransmission is performed.
  • An index value of an integer is generated according to the bit sequence (a i ... a 0 + b m ... b 0 ), 0 ⁇ i ⁇ 39, 0 ⁇ m ⁇ M, and the index value is derived from a (3 ⁇ 3) 4- ary integer Set, a set of 6561 yuan integers is a set of all integers in the range [0,6561-1] or [1,6561];
  • the decimal number converted by (a i ... a 0 + b m ... b 0 ), 0 ⁇ i ⁇ 39, 0 ⁇ m ⁇ M;
  • the decimal number performs a modulo operation on the 6561, and the obtained modulus value is the index value.
  • the value of the additional Y bits is randomly selected every time the retransmission is performed.
  • the extra bit sequence is b M ... b 0 and the (b M —b 0 ) decimal value is greater than 6561
  • first need The bit sequence (b m ... b 0 ) is converted into a decimal number, 0 ⁇ m ⁇ M; then, the above-mentioned decimal number pair 6561 is modulo-operated, and the obtained modulo value is an index value.
  • the value of the additional Y bits is randomly selected every time the retransmission is performed.
  • a 4-long non-orthogonal spreading sequence is generated, and each element of the non-orthogonal spreading sequence is a complex number, and the real part of all elements in the extended sequence is extended.
  • Both the imaginary and the imaginary parts are derived from a set of 3 real numbers, and the set of 3 real numbers is a set of odd numbers in the range [-1, 0, +1], but the real part of all elements in the extended sequence is required here.
  • the imaginary part cannot be 0 at the same time.
  • An index value of an integer is generated according to (a i ... a 0 + b m ... b 0 ), 0 ⁇ i ⁇ 39, 0 ⁇ m ⁇ M, and the index value is from a set of 84-ary integers, a set of 4096-yuan integers Is a collection of all integers in the range [0, 4096-1] or [1, 4096];
  • the decimal number converted by (a i ... a 0 + b m ... b 0 ), 0 ⁇ i ⁇ 39, 0 ⁇ m ⁇ M;
  • the decimal number is modulo-calculated for 4096, and the obtained modulus value is the index value.
  • the value of the additional Y bits is randomly selected every time the retransmission is performed.
  • the extra bit sequence is b M ... b 0 and the (b M —b 0 ) decimal value is greater than 4096
  • first need The bit sequence (b m ... b 0 ) is converted into a decimal number, 0 ⁇ m ⁇ M; then, the above decimal number is modulo-operated 4096, and the obtained modulo value is an index value.
  • the value of the additional Y bits is randomly selected every time the retransmission is performed.
  • the obtained four complex numbers are sequentially combined to obtain a complex extended sequence, or four complex numbers are multiplied by corresponding energy normalization coefficients and sequentially combined to obtain a complex extended sequence.
  • the non-orthogonal sequence set generated at this time has (2 ⁇ 2) 4 sequences.
  • a 4-long non-orthogonal spreading sequence is generated, and each element of the non-orthogonal spreading sequence is a complex number, and the real part of all elements in the extended sequence is extended.
  • the values of the imaginary part and the imaginary part are all from a set of 3 real numbers, and the set of 3 real numbers is a set of odd numbers in the range of ⁇ -1, 0, +1 ⁇ .
  • the obtained four complex numbers are sequentially combined to obtain a complex extended sequence, or four complex numbers are multiplied by corresponding energy normalization coefficients and sequentially combined to obtain a complex extended sequence.
  • the non-orthogonal sequence set generated at this time has (3 ⁇ 3) 4 sequences.
  • a 4-long non-orthogonal spreading sequence is generated, and each element of the non-orthogonal spreading sequence is a complex number, and the real part of all elements in the extended sequence is extended.
  • the values of the imaginary part and the imaginary part are all from a set of 3 real numbers, and the set of 3 real numbers is a set of odd numbers in the range of ⁇ -1, 0, +1 ⁇ .
  • the obtained four complex numbers are sequentially combined to obtain a complex extended sequence, or four complex numbers are multiplied by corresponding energy normalization coefficients and sequentially combined to obtain a complex extended sequence.
  • the non-orthogonal sequence set generated at this time has (3 ⁇ 3-1) 4 sequences.
  • one of the four long non-orthogonal sequences (tables) including (3 ⁇ 3) 4 pieces in (2) is selected; or
  • one of the four long non-orthogonal sequences (tables) including (3 ⁇ 3-1) 4 pieces in (2) is selected.
  • the length of the additionally added bit sequence is greater than or equal to 0, each element takes a value of ⁇ 0, 1 ⁇ , and the additional bits are b M ... b 0 , and M > 0.
  • the index value of the integer uniquely specifies a sequence in the orthogonal sequence set, and the index value comes from an 8-element (or 4-element) integer set, and an 8-element (or 4-ary) integer set. Is a set of all integers in the range [0,8-1] or [1,8] (or in the range [0,4-1] or [1,4]);
  • the bit sequence (a i ... a 0 + b m ... b 0 ) needs to be converted into one The decimal number, 0 ⁇ m ⁇ M, 0 ⁇ i ⁇ 39, and then the obtained decimal number is modulo 8 (or 4), and the modulo obtained value is an integer index value.
  • the value of the additional Y bits is 4 times randomized each time the retransmission is performed;
  • the extra bits are b M ... b 0 and M>2
  • the value of the additional Y bits is randomly selected every time the retransmission is performed.
  • each row or each column 8 H 8 can be constructed of long Walsh code sequence.
  • each row or each column 8 H 8 can be constructed of long Walsh code sequence.
  • step S1304 the data symbols to be transmitted are subjected to extension processing using the obtained spreading sequences C1 and C2.
  • the modulation symbol is first extended by a 4-long non-orthogonal sequence, and the extended symbol is further extended by an 8-long orthogonal sequence.
  • the modulated data symbols S k, S k with the first four non-orthogonal spreading sequence of length C1 ⁇ c 11, c 12 , ising c 14 ⁇ extended process, this extension step Processing means that S k is multiplied by each element (complex symbol) in ⁇ c 11 , c 12 , ... c 14 ⁇ , that is, the data after the first expansion processing is obtained ⁇ S k c 11 , S k c 12 , ...
  • each data of the first extended sequence ⁇ S k c 11 , S k c 12 , ... S k c 14 ⁇ is 8 long (or 4 long) Walsh orthogonal sequence
  • the modulated data symbols are extended by a complex-domain non-orthogonal spreading sequence, and the extension processing in this step refers to each element of the coded modulated data symbol and the 4-long complex-domain non-orthogonal spreading sequence (plural The symbol is multiplied by a complex number to form a sequence of complex symbols of the same length as the four long spreading sequences used. Thereby obtaining the first extended data sequence.
  • the first extended data sequence is extended by using the generated Walsh orthogonal sequence, and the extended processing in this step refers to each element and orthogonal sequence in the data sequence extended by the 4-long non-orthogonal sequence. Each element is multiplied to finally form a sequence of symbols of the same length as the 8 long spreading sequences used.
  • the modulation symbol is first extended by an 8-long orthogonal sequence, and the extended symbol is further extended by a 4-long non-orthogonal sequence.
  • the expansion processing in this step means S k and ⁇ c 11 , c 12 , ... c 18 ⁇ (or ⁇ c 11 , c 12 , ...
  • Each element (complex symbol) in c 14 ⁇ ) is subjected to complex multiplication, that is, the data after the first expansion processing is obtained ⁇ S k c 11 , S k c 12 , ... S k c 18 ⁇ (or ⁇ S k c 11 , S k c 12 , ... S k c 14 ⁇ ); then, the first extended sequence ⁇ S k c 11 , S k c 12 , ... S k c 18 ⁇ (or ⁇ S Each of k c 11 , S k c 12 , ...
  • the modulated data symbols are extended by using the generated 8-length (or 4-length) Walsh orthogonal sequence, and the extension processing in this step refers to each of the code-modulated data symbols and the 8-long orthogonal sequence.
  • the elements are multiplied to finally form a sequence of symbols of the same length as the 8-length (or 4 long) spreading sequence used. Thereby obtaining the first extended data sequence.
  • the first extended data is extended by using the generated 4-long complex-domain non-orthogonal spreading sequence.
  • the extended processing in this step refers to the data symbol extended by the 8-length (or 4-long) orthogonal sequence. 4
  • Each element (complex symbol) in the long complex field non-orthogonal spreading sequence is complex-multiplied, and finally forms a complex symbol sequence of the same length as the 4-long spreading sequence used.
  • the modulation symbols are extended by an extended sequence of L lengths, wherein the extended sequence of L long is obtained by extending the L 1 long orthogonal sequence and the L 2 long non-orthogonal sequence.
  • the modulated data symbol is S k
  • S k is extended by an extended sequence of L long.
  • the expansion processing in this step refers to each element of the long sequence of S k and L (complex symbol)
  • the complex multiplication is performed to finally form a symbol sequence of the same length as the L long spreading sequence used.
  • the L long sequence is a 4-long non-orthogonal sequence extended by another 8 long (or 4 long) orthogonal sequence; or, as shown in FIG. 25, the L long sequence is An 8-length (or 4-length) orthogonal sequence is extended by another 4-long non-orthogonal sequence.
  • the L long sequence is a 4-long non-orthogonal sequence extended by another 8 long (or 4 long) orthogonal sequence.
  • the extension in this step refers to each element in the 4 long non-orthogonal sequence and 8
  • Each element of the long (or 4 long) orthogonal sequence is multiplied to finally form a symbol sequence of the same length as the spreading sequence used, ie the resulting L long sequence is ⁇ c 11 c 21, c 11 c 22 ,... ...c 11 c 28 , c 12 c 21 , c 12 c 22 ... c 12 c 28 , ..., c 14 c 21 ... c 14 c 28 ⁇ (or ⁇ c 11 c 21, c 11 c 22 ,...
  • the sequence is extended by another 4-long non-orthogonal sequence.
  • the extension in this step refers to multiplying each element of the 8-long orthogonal sequence by each element of the 4-long non-orthogonal sequence to form a
  • the symbol sequence of the same length of the extended sequence used, that is, the obtained L long sequence is ⁇ c 11 c 21 , c 11 c 22 , ... c 11 c 24 , c 12 c 21 , c 12 c 22 ...
  • the expansion processing in this step means that each coded modulated data symbol is multiplied by each element (complex symbol) of the L long sequence, and finally formed and used for the extension. A sequence of symbols of the same sequence length.
  • Step S1306 Convert the extended symbol into a corresponding carrier modulated signal by carrier modulation (single carrier or multi-carrier modulation).
  • the terminal encodes and modulates the "bit sequence +1 bit (indicating whether there is still data later)" into 144 modulation symbols, and then adds 24 pilot symbols (data plus pilot symbols).
  • the corresponding time-frequency resources of LTE 1 PRB are required to be carried, and then a 4-long complex field spreading sequence is used, and then extended by 8 long (or 4 long) Walsh orthogonal spreading sequences (the extended symbol requires LTE) 32 (or 16) PRB time-frequency resources are carried), and finally the extended symbols are transmitted to the base station using OFDM/SC-FDMA/DFT-S-OFDM modulation with CP; the base station separates each terminal by using an advanced receiver information.
  • the terminal puts "bit sequence + information bit +1 bit (indicating whether there is still data afterwards)
  • the CRC+ convolutional code After the CRC+ convolutional code is encoded and modulated, it becomes 144 modulation symbols, and then 24 pilot symbols are added (data and pilot symbols corresponding to the time-frequency resources of LTE 1 PRB are used for carrying), and then used.
  • the 8 long (4 long) Walsh orthogonal spreading sequence is extended, and then a 4-long complex domain spreading sequence is used (the extended symbol requires LTE 32 (or 16) PRB time-frequency resources to carry), and finally will be extended.
  • the latter symbols are transmitted to the base station using OFDM/SC-FDMA/DFT-S-OFDM modulation with CP; the base station uses advanced receivers to separate the information of each terminal.
  • the terminal encodes and modulates the "bit sequence + information bit +1 bit (indicating whether there is still data later)" into 144 modulation symbols, and then adds 24 pilot symbols (data plus The pilot symbol corresponds to the time-frequency resource of LTE 1 PRB to be carried, and then the modulation symbol is extended by using a 32-length (or 16-length) spreading sequence.
  • the 32-length (or 16-length) spreading sequence is 8 long. (or 4 long) Walsh orthogonal spreading sequence and 4 long complex domain spreading sequence are extended, and finally the extended symbol is transmitted to the base station using OFDM/SC-FDMA/DFT-S-OFDM modulation with CP; Use advanced receivers to separate the information of each terminal.
  • the extra 1 bit added in the preferred embodiment of the present disclosure can function as a flag bit.
  • this 1-bit packet containing a bit value of 1 is the last packet.
  • this 1-bit packet containing a bit value of 1 is the last packet.
  • the value of this bit will affect the processing flow of the reported data by the receiver, as shown in Figure 26.
  • the receiver receives signals transmitted by a plurality of transmitters, and the signals transmitted by the plurality of transmitters are extended by the plurality of transmitters respectively using respective spreading sequences to respectively process the data symbols to be transmitted, and then the generated extensions are generated.
  • the subsequent symbol sequences are separately modulated onto the same time-frequency resource.
  • the receiver determines whether the reported data packet is the last data packet according to the value of the correctly detected flag bit, and can determine whether the advanced interference cancellation signal detector is used to transmit the received multiple transmitters. The signal is received and detected.
  • the base station receives a large amount of antennas, for example, 4/8/16 or more receiving antennas.
  • the terminal encodes and modulates the "bit sequence" into CRC+ convolutional codes, and then becomes N modulation symbols, and then A 2-long complex-domain binary code extension is used, and the OFDM/SC-FDMA/DFT-S-OFDM modulation with CP is used after spreading, and then transmitted to the base station; the base station separates the information of each terminal by using an advanced receiver.
  • the modulated data symbol is S k
  • the extension processing is performed by the 2-long non-orthogonal spreading sequence C1 ⁇ c 11 , c 12 ⁇
  • the expansion processing in this step refers to the data after each encoding modulation.
  • the symbol is multiplied by each element (complex symbol) of the 2 long sequence to form a symbol sequence of the same length as the extended sequence used.
  • the expanded data is ⁇ S k c 11 , S k c 12 ⁇ .
  • the length of the orthogonal extension sequence used for the second extension may be set to 1.
  • the two-bit complex extension sequence is determined according to the bit sequence information.
  • the identifier information UE_ID of the terminal itself may be a 40-bit sequence, and the length of the UE_ID is recommended to be greater than 16, and C1 is a 2-long complex-domain binary extension sequence.
  • the bit sequence includes information indicating that the terminal identifies the identity in the network (or information indicating the identity of the terminal, and may be simply referred to as a terminal identity, for example, part or all of the information of the identity information UE_ID of the terminal itself, or a temporary identifier in the network) Bit sequence or additional bit sequence; additional bit sequence length, value and terminal identity information, or The number of transmissions, or packet size, or time-frequency location, or cell configuration.
  • Determining a 2-long complex spreading sequence based on the bit sequence information is divided into the following three schemes according to whether or not to add additional bits and the different roles of the added bits:
  • Solution 1 Determine 2 long complex extension sequences based on the terminal identity information, and no additional bits are added to introduce randomness:
  • non-orthogonal extension sequence C1 is introduced in more detail:
  • a method of generating a complex domain binary extension sequence C1 which can be divided into the following three parts:
  • the transmitter Taking a 2 ⁇ 2 integer set as an example, the transmitter generates an index value of an integer sequence, and the values of the elements in the integer sequence are all from a 4-ary integer set ⁇ 0, 1, 2, 3 ⁇ , and the length of the integer sequence Is 4.
  • the bit sequence a i ... a 0 needs to be cyclically shifted twice, 0 ⁇ i ⁇ 39, and the step size of each cyclic shift may be 0 bits, or It is a positive integer number of bits, and the decimal numbers A 1 and A 2 of the bit sequence after each cyclic shift are obtained by the above-described decimal conversion method.
  • the transmitter generates an index value of an integer sequence
  • the element values of the integer sequence are all from a 9-ary integer set ⁇ 0, 1, 2, ..., 8,9 ⁇ , and the length of the sequence of integers is 4.
  • the bit sequence a i ... a 0 needs to be cyclically shifted twice, and 0 ⁇ i ⁇ 39, and the step size of each cyclic shift may be 0 bits. Alternatively, it is a positive integer number of bits, and the decimal numbers A 1 and A 2 of the bit sequence after each cyclic shift are obtained by the above-described decimal conversion method.
  • the transmitter generates an index value of an integer sequence
  • the element values of the sequence of integers are all from an 8-ary integer set ⁇ 0, 1, 2, ..., 7, 8 ⁇ , and the sequence of integers The length is 2.
  • the bit sequence a i ... a 0 needs to be cyclically shifted twice, 0 ⁇ i ⁇ 39, and the step size of each cyclic shift may be 0 bits, or It is a positive integer number of bits, and the decimal numbers A 1 and A 2 of the bit sequence after each cyclic shift are obtained by the above-described decimal conversion method.
  • the complex numbers corresponding to the four complex constellation points are -1+j, 1+j, -1-j, 1-j.
  • a constellation map containing nine complex constellation points associated with an index value is constructed.
  • the values of the real and imaginary parts of each constellation point in the complex constellation are derived from a set of 3-ary real numbers, and the set of 3 real numbers is represented as [-1, 0, +1].
  • the complex numbers corresponding to the nine complex constellation points are -1+j, 1+j, -1-j, 1-j, -j, j, -1, +1, 0, respectively.
  • a constellation map containing eight complex constellation points associated with an index value is constructed.
  • the complex number corresponding to each constellation point in the complex constellation diagram is -1+j, 1+j, -1-j, 1-j, -j, j, -1, +1, that is, does not contain 0 points.
  • a constellation map containing eight complex constellation points associated with an index value is constructed.
  • the complex numbers corresponding to each constellation point in the complex constellation diagram are (-1+j)/sqrt(2), (1+j)/sqrt(2), (-1-j)/sqrt(2), (1 -j)/sqrt(2), -j, j, -1, +1, that is, does not contain 0 points.
  • the index value of the integer sequence in (1) is mapped bit by bit to the 4-point complex constellation
  • the complex constellation points (each complex constellation point represents a complex number) generate a complex extension sequence, which is expressed as follows:
  • ComplexSeq p represents a p-th element of the complex spreading sequence obtained from A p mapping according to the mapping relation between the elements 4 yuan set of integers and 4:00 plurality of constellation points in the complex constellation
  • a p represents an integer of pseudorandom The pth element of the sequence.
  • two complex numbers corresponding to the four complex constellation points are determined, and two complex numbers are sequentially combined to obtain a complex extension sequence, or two complex numbers are multiplied by corresponding energy normalization coefficients and then combined to obtain a complex extension. sequence.
  • the index value of the sequence of integers in (1) is mapped bit by bit according to the mapping relationship between the elements in the 9-ary integer set and the complex constellation points of the 9-point complex constellation (as shown in FIG. 16).
  • the complex constellation points to each of the 9-point complex constellation diagrams (each complex constellation point represents a complex number) generate a complex extension sequence, which is expressed as follows:
  • ComplexSeq p represents the pth element of the complex spreading sequence, and is mapped by A p according to the mapping relationship between the elements in the 9-ary integer set and the complex constellation points of the 9-point complex constellation, and A p represents a pseudo-random integer The pth element of the sequence.
  • two complex numbers corresponding to the nine complex constellation points are determined, and the two complex numbers are sequentially combined to obtain a complex extended sequence, or two complex numbers are multiplied by corresponding energy normalization coefficients and then combined to obtain a complex expansion. sequence.
  • the index value of the sequence of integers in (1) is mapped bit by bit according to the mapping relationship between the elements in the 8-ary integer set and the complex constellation points of the 8-point complex constellation (as shown in FIG. 17).
  • the complex constellation points to the complex constellation of 8 points (each complex constellation point represents a complex number) to generate a complex extension sequence, which is expressed as follows:
  • ComplexSeq p represents the pth element of the complex spreading sequence, and is mapped by A p according to the mapping relationship between the elements in the 8-ary integer set and the complex constellation points of the 8-point complex constellation, and A p represents a pseudo-random integer The pth element of the sequence.
  • two complex numbers corresponding to eight complex constellation points are determined, and two complex numbers are sequentially combined to obtain a complex extension sequence, or two complex numbers are multiplied by corresponding energy normalization coefficients and then combined to obtain a complex extension. sequence.
  • the index value of the sequence of integers in (1) is mapped bit by bit according to the mapping relationship between the elements in the 8-ary integer set and the complex constellation points of the 8-point complex constellation (as shown in FIG. 18).
  • the complex constellation points to the complex constellation of 8 points (each complex constellation point represents a complex number) to generate a complex extension sequence, which is expressed as follows:
  • ComplexSeqp represents a p-th element of the complex spreading sequence obtained from A p mapping according to the mapping relation between the elements 8 yuan set of integers in a complex with 8 constellation points of a complex constellation, A p represents an integer of pseudo-random sequences The pth element.
  • two complex numbers corresponding to eight complex constellation points are determined, and two complex numbers are sequentially combined to obtain a complex extension sequence, or two complex numbers are multiplied by corresponding energy normalization coefficients and then combined to obtain a complex extension. sequence.
  • a 2-ary real number set it is determined that a 2-long non-orthogonal spreading sequence is generated, and each element of the non-orthogonal spreading sequence is a complex number, and the values of the real part and the imaginary part of all elements in the extended sequence are obtained. Both come from a set of 2 real numbers, and the set of 2 real numbers is a set of odd numbers in the range [-1, +1].
  • the index value is from a (2 ⁇ 2) 2- ary integer set
  • the 16-ary integer set is all integers in the range [0, 16-1] or [1, 16] a collection of
  • a decimal number converted by the bit sequence a i ... a 0 is required, and 0 ⁇ i ⁇ 39; then, the above decimal number is modulo-calculated to 256, and the obtained modulus value is obtained. That is the index value.
  • the index value is from a (3 ⁇ 3) 2- ary integer set
  • the 81-value integer set is all integers in the range [0,81-1] or [1,81] a collection of
  • a decimal number converted by the bit sequence a i ... a 0 is required, and 0 ⁇ i ⁇ 39; then, the above-mentioned decimal number pair 81 is subjected to a modulo operation, and the obtained modulo value is obtained. That is the index value.
  • a 2-long non-orthogonal spreading sequence is generated, and each element of the non-orthogonal spreading sequence is a complex number, and the real part of all elements in the extended sequence is Both the imaginary and the imaginary parts are derived from a set of 3 real numbers, and the set of 3 real numbers is a set of odd numbers in the range [-1, 0, +1], but the real part of all elements in the extended sequence is required here.
  • the imaginary part cannot be 0 at the same time.
  • the index value is from a set of 82-yuan integers, and the set of 64-ary integers is all integer groups in the range [0, 64-1] or [1, 64] a collection of
  • a decimal number converted by the bit sequence a i ... a 0 is required, and 0 ⁇ i ⁇ 39; then, the above-mentioned decimal number pair 64 is subjected to a modulo operation, and the obtained modulo value is obtained. That is the index value.
  • a 2-ary real number set it is determined that a 2-long non-orthogonal spreading sequence is generated, and each element of the non-orthogonal spreading sequence is a complex number, and the values of the real part and the imaginary part of all elements in the extended sequence are obtained. Both come from a set of 2 real numbers, and the set of 2 real numbers is a set of odd numbers in the range [-1, +1].
  • the obtained two complex numbers are sequentially combined to obtain a complex extended sequence, or two complex numbers are multiplied by corresponding energy normalization coefficients and sequentially combined to obtain a complex extended sequence.
  • the non-orthogonal sequence set generated at this time has (2 ⁇ 2) 2 sequences.
  • the obtained two complex numbers are sequentially combined to obtain a complex extended sequence, or two complex numbers are multiplied by corresponding energy normalization coefficients and sequentially combined to obtain a complex extended sequence.
  • the non-orthogonal sequence set generated at this time has (3 ⁇ 3) 2 sequences.
  • the obtained two complex numbers are sequentially combined to obtain a complex extended sequence, or two complex numbers are multiplied by corresponding energy normalization coefficients and sequentially combined to obtain a complex extended sequence.
  • the non-orthogonal sequence set generated at this time has (3 ⁇ 3-1) 2 sequences.
  • one of the two long non-orthogonal sequences (tables) including (3 ⁇ 3) 2 pieces in (2) is selected; or
  • one of the two long non-orthogonal sequences (tables) including (3 ⁇ 3-1) and two (2) is selected.
  • Solution 2 A 2-bit complex extension is determined according to an additional bit sequence (the bit sequence length may be greater than or equal to 0), a part of the bit sequence of the terminal identity information (UE_ID) (the bit sequence length may be greater than or equal to 0). Since the value of the extra bit sequence is randomly valued each time it is retransmitted, this additional bit sequence can be randomized:
  • non-orthogonal extension sequence C1 is introduced in more detail:
  • a method of generating a complex domain binary extension sequence C1 which can be divided into the following three parts:
  • UE_ID is a 40-length 0, 1 binary bit sequence, for example, a 39 a 38 ... a 1 a 0 , this bit sequence is converted into a decimal number, and the decimal conversion method is: a 39 ⁇ 2 39 + a 38 ⁇ 2 38 + ... + a 1 ⁇ 2 1 + a 0 ⁇ 2 0 .
  • the length of the extra bit sequence is greater than or equal to 0, and each element takes a value of ⁇ 0, 1 ⁇ .
  • the transmitter Taking a 2 ⁇ 2 integer set as an example, the transmitter generates an index value of an integer sequence, and the values of the elements in the integer sequence are all from a 4-ary integer set ⁇ 0, 1, 2, 3 ⁇ , and the length of the integer sequence Is 2.
  • the bit sequence (a i ... a 0 + b m ... b 0 ) needs to be performed twice.
  • Cyclic shift, 0 ⁇ i ⁇ 39, 0 ⁇ m ⁇ M, and the step size of each cyclic shift can be 0 bits, or a positive integer number of bits, and then use the above decimal conversion method to find The decimal numbers A 1 and A 2 of the bit sequence after each cyclic shift.
  • the value of the additional Y bits is randomly selected in each retransmission, or the value of the additional Y bits is randomly selected after each cyclic shift;
  • the bit sequence (a i ... a 0 ) needs to be cyclically shifted twice, 0 ⁇ i ⁇ 39, and the step size of each cyclic shift may be 0 bits, or a positive integer number of bits, and then use the above decimal conversion method to find the decimal number B1 of the bit sequence after each cyclic shift. , B2.
  • the bit sequence (b m ... b 0 ) is converted into decimal, 0 ⁇ m ⁇ M, and the result of the operation is added to B 1 and B 2 respectively to obtain new four decimal numbers A 1 and A 2 .
  • the value of the additional Y bits is randomly selected in each retransmission;
  • the bit sequence (a i ... a 0 + b m ... b 0 ) needs to be (b) m togetherb 0 )
  • Perform 2 randomization values 0 ⁇ i ⁇ 39, 0 ⁇ m ⁇ M, and each time contains a randomized bit sequence (a i ... a 0 + b m whil b 0 )
  • the sequence is converted to decimal numbers A 1 , A 2 .
  • the value of the additional Y bits is 4 times randomized each time the retransmission is performed;
  • the transmitter generates an index value of an integer sequence
  • the element values of the integer sequence are all from a 9-ary integer set ⁇ 0, 1, 2, ..., 8 ⁇ , and the length of the sequence of integers is 2.
  • the bit sequence (a i ... a 0 + b m ... b 0 ) needs to be performed twice.
  • Cyclic shift, 0 ⁇ i ⁇ 39, 0 ⁇ m ⁇ M, and the step size of each cyclic shift can be 0 bits, or a positive integer number of bits, and then use the above decimal conversion method to find The decimal numbers A 1 and A 2 of the bit sequence after each cyclic shift.
  • the value of the additional Y bits is randomly selected in each retransmission, or the value of the additional Y bits is randomly selected after each cyclic shift. ;
  • the bit sequence (ai...a0) needs to be cyclically shifted twice, 0 ⁇ i ⁇ 39 , and each cyclic shift step size bits may be 0 or a positive integral number of bits, then using the decimal conversion process, the cyclic shift is determined after each sequence of bits decimal number B 1, B 2 .
  • the bit sequence (b m ... b 0 ) is converted into decimal, 0 ⁇ m ⁇ M, and the result of the operation is added to B 1 and B 2 respectively to obtain new two decimal numbers A 1 and A 2 .
  • the value of the additional Y bits is randomly selected in each retransmission;
  • the bit sequence (a i ... a 0 + b m ... b 0 ) needs to be (b) m togetherb 0 )
  • Perform 2 randomization values 0 ⁇ i ⁇ 39, 0 ⁇ m ⁇ M, and each time contains a randomized bit sequence (a i ... a 0 + b m « b 0 )
  • the sequence is converted to decimal numbers A 1 , A 2 .
  • the value of the additional Y bits is doubled each time the retransmission is performed;
  • the transmitter generates an index value of an integer sequence whose element values are derived from an 8-ary integer set ⁇ 0, 1, 2, ..., 7 ⁇ , and the length of the sequence of integers Is 4.
  • the bit sequence (a i ... a 0 + b m ... b 0 ) needs to be performed twice.
  • Cyclic shift, 0 ⁇ i ⁇ 39, 0 ⁇ m ⁇ M, and the step size of each cyclic shift can be 0 bits, or a positive integer number of bits, and then use the above decimal conversion method to find The decimal numbers A 1 and A 2 of the bit sequence after each cyclic shift.
  • the value of the additional Y bits is randomly selected in each retransmission, or the value of the additional Y bits is randomly selected after each cyclic shift;
  • the bit sequence (a i ... a 0 ) needs to be cyclically shifted twice, 0 ⁇ i ⁇ 39, and the step size of each cyclic shift may be 0 bits, or a positive integer number of bits, and then use the above decimal conversion method to find the decimal number B of the bit sequence after each cyclic shift. 1 , B 2 .
  • the bit sequence (b m ... b 0 ) is converted into decimal, 0 ⁇ m ⁇ M, and the result of the operation is added to B 1 and B 2 respectively to obtain new two decimal numbers A 1 and A 2 .
  • the value of the additional Y bits is randomly selected in each retransmission;
  • the bit sequence (a i ... a 0 + b m ... b 0 ) needs to be (b) m togetherb 0 )
  • Perform 2 randomization values 0 ⁇ i ⁇ 39, 0 ⁇ m ⁇ M, and each time contains a randomized bit sequence (a i ... a 0 + b m « b 0 )
  • the sequence is converted to decimal numbers A 1 , A 2 .
  • the value of the additional Y bits is 4 times randomized each time the retransmission is performed;
  • the complex numbers corresponding to the four complex constellation points are -1+j, 1+j, -1-j, 1-j.
  • a constellation map containing nine complex constellation points associated with an index value is constructed.
  • the values of the real and imaginary parts of each constellation point in the complex constellation are derived from a set of 3-ary real numbers, and the set of 3 real numbers is represented as [-1, 0, +1].
  • the complex numbers corresponding to the nine complex constellation points are -1+j, 1+j, -1-j, 1-j, -j, j, -1, +1, 0, respectively.
  • constructing a constellation with 8 complex constellation points associated with an index value Figure The complex number corresponding to each constellation point in the complex constellation diagram is -1+j, 1+j, -1-j, 1-j, -j, j, -1, +1, that is, does not contain 0 points.
  • a constellation map containing eight complex constellation points associated with an index value is constructed.
  • the complex numbers corresponding to each constellation point in the complex constellation diagram are (-1+j)/sqrt(2), (1+j)/sqrt(2), (-1-j)/sqrt(2), (1 -j)/sqrt(2), -j, j, -1, +1, that is, does not contain 0 points.
  • the index value of the integer sequence in (1) is mapped bit by bit to the 4-point complex constellation
  • the complex constellation points (each complex constellation point represents a complex number) generate a complex extension sequence, which is expressed as follows:
  • ComplexSeq p represents the pth element of the complex spreading sequence, which is obtained from the mapping of Ap according to the mapping between the elements in the 4-ary integer set and the complex constellation points of the 4-point complex constellation, and A p represents a pseudo-random integer sequence.
  • the pth element represents the pth element of the complex spreading sequence, which is obtained from the mapping of Ap according to the mapping between the elements in the 4-ary integer set and the complex constellation points of the 4-point complex constellation
  • a p represents a pseudo-random integer sequence. The pth element.
  • two complex numbers corresponding to the four complex constellation points are determined, and two complex numbers are sequentially combined to obtain a complex extension sequence, or two complex numbers are multiplied by corresponding energy normalization coefficients and then combined to obtain a complex extension. sequence.
  • the index value of the sequence of integers in (1) is mapped bit by bit according to the mapping relationship between the elements in the 9-ary integer set and the complex constellation points of the 9-point complex constellation (as shown in FIG. 16).
  • the complex constellation points to each of the 9-point complex constellation diagrams (each complex constellation point represents a complex number) generate a complex extension sequence, which is expressed as follows:
  • ComplexSeq p represents the pth element of the complex spreading sequence, and is mapped by A p according to the mapping relationship between the elements in the 9-ary integer set and the complex constellation points of the 9-point complex constellation, and A p represents a pseudo-random integer The pth element of the sequence.
  • two complex numbers corresponding to the nine complex constellation points are determined, and the two complex numbers are sequentially combined to obtain a complex extended sequence, or two complex numbers are multiplied by corresponding energy normalization coefficients and then combined to obtain a complex expansion. sequence.
  • the index value of the sequence of integers in (1) is mapped bit by bit according to the mapping relationship between the elements in the 8-ary integer set and the complex constellation points of the 8-point complex constellation (as shown in FIG. 17).
  • the complex constellation points to the complex constellation of 8 points (each complex constellation point represents a complex number) to generate a complex extension sequence, which is expressed as follows:
  • ComplexSeq p represents the pth element of the complex spreading sequence, and is mapped by A p according to the mapping relationship between the elements in the 8-ary integer set and the complex constellation points of the 8-point complex constellation, and A p represents a pseudo-random integer The pth element of the sequence.
  • two complex numbers corresponding to eight complex constellation points are determined, and two complex numbers are sequentially combined to obtain a complex extension sequence, or two complex numbers are multiplied by corresponding energy normalization coefficients and then combined to obtain a complex extension. sequence.
  • the index value of the sequence of integers in (1) is mapped bit by bit according to the mapping relationship between the elements in the 8-ary integer set and the complex constellation points of the 8-point complex constellation (as shown in FIG. 18).
  • the complex constellation points to the complex constellation of 8 points (each complex constellation point represents a complex number) to generate a complex extension sequence, which is expressed as follows:
  • ComplexSeq p represents the pth element of the complex spreading sequence, and is mapped by A p according to the mapping relationship between the elements in the 8-ary integer set and the complex constellation points of the 8-point complex constellation, and A p represents a pseudo-random integer The pth element of the sequence.
  • two complex numbers corresponding to eight complex constellation points are determined, and two complex numbers are sequentially combined to obtain a complex extension sequence, or two complex numbers are multiplied by corresponding energy normalization coefficients and then combined to obtain a complex extension. sequence.
  • the length of the additionally added bit sequence is greater than or equal to 0, each element takes a value of ⁇ 0, 1 ⁇ , and the additional bits are b M ... b 0 , and M > 0.
  • a 2-ary real number set it is determined that a 2-long non-orthogonal spreading sequence is generated, and each element of the non-orthogonal spreading sequence is a complex number, and the values of the real part and the imaginary part of all elements in the extended sequence are obtained. Both come from a set of 2 real numbers, and the set of 2 real numbers is a set of odd numbers in the range of ⁇ -1, +1 ⁇ , then there are 16 non-orthogonal sequences in a set of 2 long non-orthogonal sequences.
  • an integer index value is generated.
  • a non-orthogonal sequence in the non-orthogonal sequence set can be uniquely specified, and the index value is from a (2 ⁇ 2) 2- ary integer set, and the 16-ary integer set is a set of all integers in the range [0,16-1] or [1,16];
  • the bit sequence (b m ... b 0 ) is converted into a decimal number, 0 ⁇ m ⁇ M; then, the above decimal number is modulo 16 and the resulting modulus value is the index value. And when the transmission fails, the value of the additional Y bits is randomly selected every time the retransmission is performed.
  • An index value of an integer is generated according to the bit sequence (a i ... a 0 + b m ... b 0 ), 0 ⁇ i ⁇ 39, 0 ⁇ m ⁇ M, and the index value is derived from a (3 ⁇ 3) 2- ary integer Set, a set of 81-ary integers is a set of all integers in the range [0,81-1] or [1,81];
  • the decimal number converted by (a i ... a 0 + b m ... b 0 ), 0 ⁇ i ⁇ 39, 0 ⁇ m ⁇ M;
  • the decimal number performs a modulo operation on 81, and the obtained modulus value is an index value.
  • the value of the additional Y bits is randomly selected every time the retransmission is performed.
  • the extra bit sequence is b M ... b 0 and the (b M —b 0 ) decimal value is greater than 81
  • first need The bit sequence (b m ... b 0 ) is converted into a decimal number, 0 ⁇ m ⁇ M; then, the above-mentioned decimal number pair 81 is subjected to a modulo operation, and the obtained modulo value is an index value.
  • the value of the additional Y bits is randomly selected every time the retransmission is performed.
  • a 2-long non-orthogonal spreading sequence is generated, and each element of the non-orthogonal spreading sequence is a complex number, and the real part of all elements in the extended sequence is Both the imaginary and the imaginary parts are derived from a set of 3 real numbers, and the set of 3 real numbers is a set of odd numbers in the range [-1, 0, +1], but the real part of all elements in the extended sequence is required here.
  • the imaginary part cannot be 0 at the same time.
  • An index value of an integer is generated according to (a i ... a 0 + b m ... b 0 ), 0 ⁇ i ⁇ 39, 0 ⁇ m ⁇ M, and the index value is from a set of 64-ary integers, a set of 64-valued integers Is a collection of all integers in the range [0, 64-1] or [1, 64];
  • the decimal number converted by (a i ... a 0 + b m ... b 0 ), 0 ⁇ i ⁇ 39, 0 ⁇ m ⁇ M;
  • the decimal number is modulo-operated on 64, and the obtained modulus value is the index value.
  • the value of the additional Y bits is randomly selected every time the retransmission is performed.
  • the extra bit sequence is b M ... b 0 and the (b M —b 0 ) decimal value is greater than 64
  • first need The bit sequence (b m ... b 0 ) is converted into a decimal number, 0 ⁇ m ⁇ M; then, the above decimal number is modulo 64, and the obtained modulo value is an index value.
  • the value of the additional Y bits is randomly selected every time the retransmission is performed.
  • a 2-ary real number set it is determined that a 2-long non-orthogonal spreading sequence is generated, and each element of the non-orthogonal spreading sequence is a complex number, and the values of the real part and the imaginary part of all elements in the extended sequence are obtained. Both come from a set of 2 real numbers, and the set of 2 real numbers is a set of odd numbers in the range ⁇ -1, +1 ⁇ .
  • the obtained two complex numbers are sequentially combined to obtain a complex extended sequence, or two complex numbers are multiplied by corresponding energy normalization coefficients and sequentially combined to obtain a complex extended sequence.
  • the non-orthogonal sequence set generated at this time has (2 ⁇ 2) 2 sequences.
  • the obtained two complex numbers are sequentially combined to obtain a complex extended sequence, or two complex numbers are multiplied by corresponding energy normalization coefficients and sequentially combined to obtain a complex extended sequence.
  • the non-orthogonal sequence set generated at this time has (3 ⁇ 3) 2 sequences.
  • the obtained two complex numbers are sequentially combined to obtain a complex extended sequence, or two complex numbers are multiplied by corresponding energy normalization coefficients and sequentially combined to obtain a complex extended sequence.
  • the non-orthogonal sequence set generated at this time has (3 ⁇ 3-1) 2 sequences.
  • one of the four long non-orthogonal sequences (tables) including (3 ⁇ 3) 2 pieces in (2) is selected; or
  • one of the four long non-orthogonal sequences (tables) including (3 ⁇ 3-1) 2 pieces in (2) is selected.
  • Solution 3 A 2-long complex spreading sequence is determined according to an additional bit sequence (the bit sequence length may be greater than or equal to 0) and a part of the bit sequence of the terminal identity information (UE_ID) (the bit sequence length may be greater than or equal to 0).
  • the value of the additionally added bit sequence specifies the starting position of the cyclic shift, and the value of the additionally added bit sequence may be randomly selected during each retransmission, or may be sequentially increased:
  • the generation process of the non-orthogonal extended sequence C1 and the orthogonal extended sequence C2 is introduced more specifically:
  • a method of generating a complex domain binary extension sequence C1 which can be divided into the following three parts:
  • UE_ID is a 40-length 0, 1 binary bit sequence, for example, a 39 a 38 ... a 1 a 0 , this bit sequence is converted into a decimal number, and the decimal conversion method is: a 39 ⁇ 2 39 + a 38 ⁇ 2 38 + ... + a 1 ⁇ 2 1 + a 0 ⁇ 2 0 .
  • the length of the extra bit sequence is greater than or equal to 0, and each element takes a value of ⁇ 0, 1 ⁇ .
  • the transmitter Taking a 2 ⁇ 2 integer set as an example, the transmitter generates an index value of an integer sequence, and the values of the elements in the integer sequence are all from a 4-ary integer set ⁇ 0, 1, 2, 3 ⁇ , and the length of the integer sequence Is 2.
  • the bit sequence (a i ... a 0 + b m ... b 0 ) needs to be performed twice.
  • Cyclic shift, 0 ⁇ i ⁇ 39, 0 ⁇ m ⁇ M, and the step size of each cyclic shift can be 0 bits, or a positive integer number of bits, and then use the above decimal conversion method to find The decimal numbers A 1 and A 2 of the bit sequence after each cyclic shift.
  • the value of the additionally added bit sequence specifies the starting position of the cyclic shift, and when the current transmission fails, the value of the additionally added Y bits may be randomly selected during each retransmission, or may be sequentially increased; If the value of the extra bit is incremented in each retransmission, then after the current transmission is successful, the value of the extra bit needs to be cleared.
  • the transmitter generates an index value of an integer sequence
  • the element values of the integer sequence are all from a 9-ary integer set ⁇ 0, 1, 2, ..., 8 ⁇ , and the length of the sequence of integers is 2.
  • the bit sequence (a i ... a 0 + b m ... b 0 ) needs to be performed twice.
  • Cyclic shift, 0 ⁇ i ⁇ 39, 0 ⁇ m ⁇ M, and the step size of each cyclic shift can be 0 bits, or a positive integer number of bits, and then use the above decimal conversion method to find The decimal numbers A 1 and A 2 of the bit sequence after each cyclic shift.
  • the value of the additionally added bit sequence specifies the starting position of the cyclic shift, and when the current transmission fails, the value of the additionally added Y bits may be randomly selected during each retransmission, or may be sequentially increased; If the value of the extra bit is incremented in each retransmission, then after the current transmission is successful, the value of the extra bit needs to be cleared.
  • the transmitter generates an index of an integer sequence, the sequence of integers
  • the element values are all derived from an 8-ary integer set ⁇ 0, 1, 2, ..., 7 ⁇ , and the length of the sequence of integers is 2.
  • the bit sequence (a i ... a 0 + b m ... b 0 ) needs to be performed twice.
  • Cyclic shift, 0 ⁇ i ⁇ 39, 0 ⁇ m ⁇ M, and the step size of each cyclic shift can be 0 bits, or a positive integer number of bits, and then use the above decimal conversion method to find The decimal numbers A 1 and A 2 of the bit sequence after each cyclic shift.
  • the value of the additionally added bit sequence specifies the starting position of the cyclic shift, and when the current transmission fails, the value of the additionally added Y bits may be randomly selected during each retransmission, or may be sequentially increased; If the value of the extra bit is incremented in each retransmission, then after the current transmission is successful, the value of the extra bit needs to be cleared.
  • the complex numbers corresponding to the four complex constellation points are -1+j, 1+j, -1-j, 1-j.
  • a constellation map containing nine complex constellation points associated with an index value is constructed.
  • the values of the real and imaginary parts of each constellation point in the complex constellation are derived from a set of 3-ary real numbers, and the set of 3 real numbers is represented as [-1, 0, +1].
  • the complex numbers corresponding to the nine complex constellation points are -1+j, 1+j, -1-j, 1-j, -j, j, -1, +1, 0, respectively.
  • a constellation map containing eight complex constellation points associated with an index value is constructed.
  • the complex number corresponding to each constellation point in the complex constellation diagram is -1+j, 1+j, -1-j, 1-j, -j, j, -1, +1, that is, does not contain 0 points.
  • a constellation map containing eight complex constellation points associated with an index value is constructed.
  • the complex numbers corresponding to each constellation point in the complex constellation diagram are (-1+j)/sqrt(2), (1+j)/sqrt(2), (-1-j)/sqrt(2), (1-j)/sqrt(2), -j, j, -1, +1, that is, does not contain 0 points.
  • the index value of the integer sequence in (1) is mapped bit by bit to the 4-point complex constellation
  • the complex constellation points (each complex constellation point represents a complex number) generate a complex extension sequence, which is expressed as follows:
  • ComplexSeq p represents a p-th element of the complex spreading sequence obtained from A p mapping according to the mapping relation between the elements 4 yuan set of integers and 4:00 plurality of constellation points in the complex constellation,
  • a p represents an integer of pseudorandom The ith element of the sequence.
  • two complex numbers corresponding to the four complex constellation points are determined, and two complex numbers are sequentially combined to obtain a complex extension sequence, or two complex numbers are multiplied by corresponding energy normalization coefficients and then combined to obtain a complex extension. sequence.
  • the index value of the sequence of integers in (1) is mapped bit by bit according to the mapping relationship between the elements in the 9-ary integer set and the complex constellation points of the 9-point complex constellation (as shown in FIG. 16).
  • the complex constellation points to each of the 9-point complex constellation diagrams (each complex constellation point represents a complex number) generate a complex extension sequence, which is expressed as follows:
  • ComplexSeq p represents the pth element of the complex spreading sequence, and is mapped by A p according to the mapping relationship between the elements in the 9-ary integer set and the complex constellation points of the 9-point complex constellation, and A p represents a pseudo-random integer The pth element of the sequence.
  • two complex numbers corresponding to the nine complex constellation points are determined, and the two complex numbers are sequentially combined to obtain a complex extended sequence, or two complex numbers are multiplied by corresponding energy normalization coefficients and then combined to obtain a complex expansion. sequence.
  • mapping relationship between the constellation points maps the index value of the integer sequence in (1) bit by bit to the complex constellation points of the 8-point complex constellation (each complex constellation point represents a complex number) to generate a complex number
  • the extended sequence is formulated as follows:
  • ComplexSeq p represents the pth element of the complex spreading sequence, and is mapped by A p according to the mapping relationship between the elements in the 8-ary integer set and the complex constellation points of the 8-point complex constellation, and A p represents a pseudo-random integer The pth element of the sequence.
  • two complex numbers corresponding to eight complex constellation points are determined, and two complex numbers are sequentially combined to obtain a complex extension sequence, or two complex numbers are multiplied by corresponding energy normalization coefficients and then combined to obtain a complex extension. sequence.
  • the index value of the sequence of integers in (1) is mapped bit by bit according to the mapping relationship between the elements in the 8-ary integer set and the complex constellation points of the 8-point complex constellation (as shown in FIG. 18).
  • the complex constellation points to the complex constellation of 8 points (each complex constellation point represents a complex number) to generate a complex extension sequence, which is expressed as follows:
  • ComplexSeq p represents the pth element of the complex spreading sequence, and is mapped by A p according to the mapping relationship between the elements in the 8-ary integer set and the complex constellation points of the 8-point complex constellation, and A p represents a pseudo-random integer The pth element of the sequence.
  • two complex numbers corresponding to eight complex constellation points are determined, and two complex numbers are sequentially combined to obtain a complex extension sequence, or two complex numbers are multiplied by corresponding energy normalization coefficients and then combined to obtain a complex extension. sequence.
  • the length of the additionally added bit sequence is greater than or equal to 0, each element takes a value of ⁇ 0, 1 ⁇ , and the additional bits are b M ... b 0 , and M > 0.
  • a 2-ary real number set it is determined that a 2-long non-orthogonal spreading sequence is generated, and each element of the non-orthogonal spreading sequence is a complex number, and the values of the real part and the imaginary part of all elements in the extended sequence are obtained. Both come from a set of 2 real numbers, and the set of 2 real numbers is a set of odd numbers in the range of ⁇ -1, +1 ⁇ , then there are 16 non-orthogonal sequences in a set of 2 long non-orthogonal sequences.
  • an integer index value is generated.
  • a non-orthogonal sequence in the non-orthogonal sequence set can be uniquely specified, and the index value is from a (2 ⁇ 2) 2- ary integer set, and the 16-ary integer set is a set of all integers in the range [0,16-1] or [1,16];
  • the bit sequence (b m ... b 0 ) is converted into a decimal number, 0 ⁇ m ⁇ M; then, the above decimal number is modulo 16 and the obtained modulo value is the index value. And when the transmission fails, the value of the additional Y bits is randomly selected every time the retransmission is performed.
  • An index value of an integer is generated according to the bit sequence (a i ... a 0 + b m ... b 0 ), 0 ⁇ i ⁇ 39, 0 ⁇ m ⁇ M, and the index value is derived from a (3 ⁇ 3) 2- ary integer Set, a set of 81-ary integers is a set of all integers in the range [0,81-1] or [1,81];
  • the decimal number converted by (a i ... a 0 + b m ... b 0 ), 0 ⁇ i ⁇ 39, 0 ⁇ m ⁇ M;
  • the decimal number performs a modulo operation on 81, and the obtained modulus value is the index value.
  • the value of the additional Y bits is randomly selected every time the retransmission is performed.
  • the extra bit sequence is b M ... b 0 and the (b M —b 0 ) decimal value is greater than 81
  • first need The bit sequence (b m ... b 0 ) is converted into a decimal number, 0 ⁇ m ⁇ M; then, the above-mentioned decimal number pair 81 is subjected to a modulo operation, and the obtained modulo value is an index value.
  • the value of the additional Y bits is randomly selected every time the retransmission is performed.
  • a 2-long non-orthogonal spreading sequence is generated, and each element of the non-orthogonal spreading sequence is a complex number, and the real part of all elements in the extended sequence is Both the imaginary and the imaginary parts are derived from a set of 3 real numbers, and the set of 3 real numbers is a set of odd numbers in the range [-1, 0, +1], but the real part of all elements in the extended sequence is required here.
  • the imaginary part cannot be 0 at the same time.
  • An index value of an integer is generated according to (a i ... a 0 + b m ... b 0 ), 0 ⁇ i ⁇ 39, 0 ⁇ m ⁇ M, and the index value is from a set of 64-ary integers, a set of 64-valued integers Is a collection of all integers in the range [0, 64-1] or [1, 64];
  • the decimal number converted by (a i ... a 0 + b m ... b 0 ), 0 ⁇ i ⁇ 39, 0 ⁇ m ⁇ M;
  • the decimal number is modulo-operated on 64, and the obtained modulus value is the index value.
  • the value of the additional Y bits is randomly selected every time the retransmission is performed.
  • the extra bit sequence is b M ... b 0 and the (b M —b 0 ) decimal value is greater than 64
  • first need The bit sequence (b m ... b 0 ) is converted into a decimal number, 0 ⁇ m ⁇ M; then, the above decimal number is modulo 64, and the obtained modulo value is an index value.
  • the value of the additional Y bits is randomly selected every time the retransmission is performed.
  • a 2-ary real number set it is determined that a 2-long non-orthogonal spreading sequence is generated, and each element of the non-orthogonal spreading sequence is a complex number, and the values of the real part and the imaginary part of all elements in the extended sequence are obtained. Both come from a set of 2 real numbers, and the set of 2 real numbers is a set of odd numbers in the range ⁇ -1, +1 ⁇ .
  • the obtained two complex numbers are sequentially combined to obtain a complex extended sequence, or two complex numbers are multiplied by corresponding energy normalization coefficients and sequentially combined to obtain a complex extended sequence.
  • the non-orthogonal sequence set generated at this time has (2 ⁇ 2) 2 sequences.
  • the obtained two complex numbers are sequentially combined to obtain a complex extended sequence, or two complex numbers are multiplied by corresponding energy normalization coefficients and sequentially combined to obtain a complex extended sequence.
  • the non-orthogonal sequence set generated at this time has (3 ⁇ 3) 2 sequences.
  • the obtained two complex numbers are sequentially combined to obtain a complex extended sequence, or two complex numbers are multiplied by corresponding energy normalization coefficients and sequentially combined to obtain a complex extended sequence.
  • the non-orthogonal sequence set generated at this time has (3 ⁇ 3-1) 2 sequences.
  • one of the two long non-orthogonal sequences (tables) including (3 ⁇ 3) 2 pieces in (2) is selected; or
  • one of the two long non-orthogonal sequences (tables) including (3 ⁇ 3-1) and two (2) is selected.
  • the data symbols to be transmitted are extended: a bit sequence including at least the own terminal identification information is encoded and modulated to form N 1 modulation symbols, and N 2 guides are added.
  • the frequency symbol, a total of N symbols, N N 1 + N 2 , the N symbols are expanded into 2 ⁇ N symbols.
  • the modulated data symbols S k, S k with the first non-orthogonal spreading sequence of length 2 C1 ⁇ c 11, c 12 ⁇ spreading process
  • the spreading process in this step refers to S k and ⁇ c 11
  • Each element (complex symbol) in c 12 ⁇ is multiplied by a complex number to obtain the data ⁇ S k c 11, S k c 12 ⁇ after the first expansion processing.
  • the expanded symbols are converted to corresponding carrier modulated signals by carrier modulation (single carrier or multi-carrier modulation).
  • carrier modulation single carrier or multi-carrier modulation
  • the resulting carrier modulated signal formed as described above is transmitted.
  • the base station receives a large amount of antennas, for example, 4/8/16 or more receiving antennas.
  • the terminal encodes and modulates the "bit sequence" into CRC+ convolutional codes, and then becomes N modulation symbols, and then OFDM/SC-FDMA/DFT-S-OFDM modulation with CP is used and then transmitted to the base station; the base station uses advanced receivers to separate the information of each terminal. This situation is equivalent to the need to expand on the transmitting side.
  • the modulated data symbol is S k and is spread by a spreading sequence of length 1; or, the modulated data symbol S k is not subjected to spreading processing, and is directly modulated by carrier (single carrier or more) Carrier modulation) is converted to the corresponding carrier modulated signal.
  • the transmitter side processes the signal processing: the terminal encodes and modulates the "bit sequence" by the CRC+ convolutional code, and then becomes 144 modulation symbols, and then adds 24 pilot symbols (the data plus the pilot symbol corresponds to LTE 1) PRB time-frequency resources to carry), then use a 4-long complex number
  • the domain extension sequence is then extended with an 8-length (or 4 long) non-orthogonal spreading sequence (the extended symbol requires LTE 32 (or 16) PRB time-frequency resources to carry), and finally the extended symbol
  • the OFDM/SC-FDMA/DFT-S-OFDM modulation with CP is transmitted to the base station; the base station separates the information of each terminal using an advanced receiver. or,
  • the transmitter side processes the signal processing: the terminal encodes and modulates the "bit sequence" by the CRC+ convolutional code, and then becomes 144 modulation symbols, and then adds 24 pilot symbols (the data plus the pilot symbol corresponds to LTE 1)
  • the PRB's time-frequency resources are carried), and then extended with an 8-long (or 4-long) non-orthogonal spreading sequence, and then a 4-long complex domain spreading sequence (the extended symbol requires LTE 32 (or 16)
  • the PRB time-frequency resource is used to carry), and finally the extended symbol is transmitted to the base station using OFDM/SC-FDMA/DFT-S-OFDM modulation with CP; the base station separates the information of each terminal by using an advanced receiver. or,
  • the transmitter side processes the signal processing: the terminal encodes and modulates the "bit sequence" by the CRC+ convolutional code, and then becomes 144 modulation symbols, and then adds 24 pilot symbols (the data plus the pilot symbol corresponds to LTE 1)
  • the time-frequency resources of the PRB are carried), and then the modulation symbols are extended using a 32-length extended sequence consisting of 8 long (or 4 long) non-orthogonal spreading sequences and 4 long
  • the complex domain spreading sequence is extended, and finally the extended symbol is transmitted to the base station using OFDM/SC-FDMA/DFT-S-OFDM modulation with CP; the base station separates the information of each terminal by using an advanced receiver. or,
  • the transmitter side processes the signal processing: the terminal encodes and modulates the "bit sequence" by the CRC+ convolutional code, and then becomes 144 modulation symbols, and then adds 24 pilot symbols (the data plus the pilot symbol corresponds to LTE 1) The time-frequency resource of the PRB is carried), then a 4-long complex field spreading sequence is used, and finally the extended symbol is transmitted to the base station using OFDM/SC-FDMA/DFT-S-OFDM modulation with CP; the base station uses advanced reception.
  • the machine separates the information of each terminal.
  • Step 110 Determine a 4-long complex spreading sequence or an 8-long (or 4-long) non-orthogonal spreading sequence based on the bit sequence information.
  • the identifier information UE_ID of the terminal itself may be a 40-bit sequence, and the length of the UE_ID is recommended to be greater than 16, C1 is a 4-long complex-domain binary extension sequence, and C2 is an 8-length (or 4-length) non-orthogonal sequence. Extended sequence, the value of the element in C2 is taken as ⁇ +1, -1 ⁇ .
  • the bit sequence includes information indicating that the terminal identifies the identity in the network (or information indicating the identity of the terminal, and may be collectively referred to as a terminal identity, for example, part or all of the information of the identity information UE_ID of the terminal itself, or temporary in the network.
  • Determining a 4-long complex spreading sequence or an 8-long (or 4-long) non-orthogonal spreading sequence according to the bit sequence information is divided into the following three schemes according to whether or not to add extra bits and different roles of the added bits:
  • Solution 1 Determine 4 long complex extension sequences or 8 long (or 4 long) non-orthogonal spreading sequences according to the terminal identity information, without using additional bits to introduce randomness:
  • a method of generating a complex domain binary extension sequence C1 which can be divided into the following three parts:
  • the transmitter Taking a 2*2 integer set as an example, the transmitter generates an index value of an integer sequence in which the elements take values from a set of 4-ary integers ⁇ 0, 1, 2, 3 ⁇ , and the length of the sequence of integers Is 4.
  • the bit sequence (a i ... a 0 ) needs to be cyclically shifted 4 times, 0 ⁇ i ⁇ 39, and the step size of each cyclic shift can be 0 bits. Or a positive integer number of bits, and then use the decimal conversion method described above to find the decimal numbers A 1 , A 2 , A 3 , and A 4 of the bit sequence after each cyclic shift.
  • decimal numbers A 1 , A 2 , A 3 and A 4 the values of each element in the sequence of integers are determined as: A 1 mod 4, A 2 mod 4, A 3 mod 4 and A 4 mod 4, where A p mod 4 represents the value of modulo 4, and p belongs to ⁇ 1, 2, 3, 4 ⁇ , then the sequence of integers ⁇ A 1 mod 4, A 2 mod 4, A 3 mod 4, A 4 mod 4 ⁇ . .
  • the transmitter in another embodiment, taking a 3*3 integer set as an example, the transmitter generates an index value of an integer sequence whose element values are derived from a 9-ary integer set ⁇ 0, 1, 2, ..., 8,9 ⁇ , and the length of the sequence of integers is 4.
  • the bit sequence a i ... a 0 needs to be cyclically shifted 4 times, 0 ⁇ i ⁇ 39, and the step size of each cyclic shift may be 0 bits, or It is a positive integer number of bits, and the decimal numbers A 1 , A 2 , A 3 , and A 4 of the bit sequence after each cyclic shift are obtained by the above-described decimal conversion method.
  • the transmitter generates an index value of an integer sequence
  • the element values of the sequence of integers are all from an 8-ary integer set ⁇ 0, 1, 2, ..., 7, 8 ⁇ , and the sequence of integers The length is 4.
  • the bit sequence a i ... a 0 needs to be cyclically shifted 4 times, 0 ⁇ i ⁇ 39, and the step size of each cyclic shift may be 0 bits, or It is a positive integer number of bits, and the decimal numbers A 1 , A 2 , A 3 and A 4 of the bit sequence after each cyclic shift are obtained by the above-described decimal conversion method.
  • decimal numbers A 1 , A 2 , A 3 and A 4 the values of each element in the sequence of integers are determined as: A 1 mod 8 , A 2 mod 8 , A 3 mod 8 and A 4 mod 8, where A p mod 8 represents the value of modulo 8 and p belongs to ⁇ 1, 2, 3, 4 ⁇ , then the sequence of integers ⁇ A 1 mod 8 , A 2 mod 8 , A 3 mod 8 , A 4 mod 8 ⁇ . .
  • the complex numbers corresponding to the four complex constellation points are -1+j, 1+j, -1-j, 1-j.
  • a constellation map containing nine complex constellation points associated with an index value is constructed.
  • the values of the real part and the imaginary part of each constellation point in the complex constellation diagram are all from a 3-ary real number set, and the 3-ary real number set is represented as [-1, 0, +1].
  • the complex numbers corresponding to the nine complex constellation points are -1+j, 1+j, -1-j, 1-j, -j, j, -1, +1, 0, respectively.
  • a constellation map containing eight complex constellation points associated with an index value is constructed.
  • the complex number corresponding to each constellation point in the complex constellation diagram is -1+j, 1+j, -1-j, 1-j, -j, j, -1, +1, that is, does not contain 0 points.
  • a constellation map containing eight complex constellation points associated with an index value is constructed.
  • the complex numbers corresponding to each constellation point in the complex constellation diagram are (-1+j)/sqrt(2), (1+j)/sqrt(2), (-1-j)/sqrt(2), (1-j)/sqrt(2), -j, j, -1, +1, that is, does not contain 0 points.
  • the index value of the integer sequence in (1) is mapped bit by bit to the 4-point complex constellation
  • the complex constellation points (each complex constellation point represents a complex number) generate a complex extension sequence, which is expressed as follows:
  • ComplexSeq p represents a p-th element of the complex spreading sequence obtained from A p mapping according to the mapping relation between the elements 4 yuan set of integers and 4:00 plurality of constellation points in the complex constellation
  • a p represents an integer of pseudorandom The pth element of the sequence.
  • the complex of the elements in the 9-ary integer set and the 9-point complex constellation maps the index value of the integer sequence in (1) bit by bit to the complex constellation points of the 9-point complex constellation (each complex constellation point represents a complex number) to generate a complex number
  • the extended sequence is formulated as follows:
  • ComplexSeq p represents the pth element of the complex spreading sequence, and is mapped by A p according to the mapping relationship between the elements in the 9-ary integer set and the complex constellation points of the 9-point complex constellation, and A p represents a pseudo-random integer The pth element of the sequence.
  • the index value of the sequence of integers in (1) is mapped bit by bit according to the mapping relationship between the elements in the 8-ary integer set and the complex constellation points of the 8-point complex constellation (as shown in FIG. 18).
  • the complex constellation points to the complex constellation of 8 points (each complex constellation point represents a complex number) to generate a complex extension sequence, which is expressed as follows:
  • ComplexSeq p represents the pth element of the complex spreading sequence, and is mapped by A p according to the mapping relationship between the elements in the 8-ary integer set and the complex constellation points of the 8-point complex constellation, and A p represents a pseudo-random integer The pth element of the sequence.
  • the index value of the sequence of integers in (1) is mapped bit by bit according to the mapping relationship between the elements in the 8-ary integer set and the complex constellation points of the 8-point complex constellation (as shown in FIG. 19).
  • the complex constellation points to the complex constellation of 8 points (each complex constellation point represents a complex number) to generate a complex extension sequence, which is expressed as follows:
  • ComplexSeq i represents the pth element of the complex spreading sequence, and is mapped by A p according to the mapping relationship between the elements in the 8-ary integer set and the complex constellation points of the 8-point complex constellation, and A p represents a pseudo-random integer The pth element of the sequence.
  • each element of the non-orthogonal spreading sequence is a complex number
  • the real part and the virtual part of all the elements in the extended sequence The values of the parts are all from a set of 2-ary real numbers, which are sets of odd numbers in the range [-1, +1].
  • the index value is from a (2*2) 4- ary integer set, all of which are in the range [0, 256-1] or [1, 256] a collection of integers;
  • a decimal number converted by the bit sequence a i ... a 0 is required, and 0 ⁇ i ⁇ 39; then, the above decimal number is modulo-calculated to 256, and the obtained modulus value is obtained. That is the index value.
  • determining to generate a 4-long non-orthogonal spreading sequence, and each element of the non-orthogonal spreading sequence is a complex number, and all the elements in the extended sequence The values of the real part and the imaginary part are all derived from a set of 3-ary real numbers, which is a set of odd numbers in the range [-1, 0, +1].
  • the index value is from a (3*3) 4- ary integer set, and the 6561-element integer set is all in the range [0,6561-1] or [1,6561] a collection of integers;
  • a decimal number converted by the bit sequence a i ... a 0 is required, and 0 ⁇ i ⁇ 39; then, the above-mentioned decimal number pair 6561 is subjected to a modulo operation, and the obtained modulo value is obtained. That is the index value.
  • the values of the real and imaginary parts of the element are all from a set of 3-ary real numbers, which are a set of odd numbers in the range [-1, 0, +1], but the extension is required here.
  • the real and imaginary parts of all elements in the sequence cannot be zero at the same time.
  • an integer index value is generated according to the index value from a set of either integer 84, is the set of integers 4096 yuan [0,4096-1] or [1,4096] all integers in the range of composition set;
  • the index value of the integer In order to generate the index value of the integer, firstly, you need to be a bit sequence a i ?? a 0 decimal conversion, and 0 ⁇ i ⁇ 39; Then, the decimal number 4096 of a modulo operation, the modulo value is obtained That is the index value.
  • each element of the non-orthogonal spreading sequence is a complex number
  • the real part and the virtual part of all the elements in the extended sequence The values of the parts are all from a set of 2-ary real numbers, which are sets of odd numbers in the range [-1, +1].
  • the obtained four complex numbers are sequentially combined to obtain the complex extension sequence, or the four complex numbers are multiplied by corresponding energy normalization coefficients and sequentially combined to obtain the complex extension sequence.
  • the non-orthogonal sequence set generated at this time has (2*2) 4 sequences.
  • the values of the real part and the imaginary part of the element are all derived from a set of 3-ary real numbers, which is a set of odd numbers in the range [-1, 0, +1].
  • the complex number expansion sequence is obtained by multiplying four complex numbers by corresponding energy normalization coefficients.
  • the non-orthogonal sequence set generated at this time has (3*3) 4 sequences.
  • the values of the real part and the imaginary part of the element are all derived from a set of 3-ary real numbers, which is a set of odd numbers in the range [-1, 0, +1].
  • the obtained four complex numbers are sequentially combined to obtain the complex extension sequence, or the four complex numbers are multiplied by corresponding energy normalization coefficients and sequentially combined to obtain the complex extension sequence.
  • the non-orthogonal sequence set generated at this time has (3*3-1) 4 sequences.
  • one of the four long non-orthogonal sequences (tables) containing (3*3) 4 in (2) is selected; or
  • one of the four long non-orthogonal sequences (tables) including (3*3-1) 4 in (2) is selected.
  • index value of an integer is generated according to the UE_ID, the index value is from a set of 16-ary (or 8-ary) integers, which is [0, 16-1] or [1, 16 a collection of all integers within the range (or [0,8-1] or [1,8] range);
  • the above decimal number is modulo 16 (or 8), and the obtained
  • the modulus value is the index value.
  • the orthogonal H 8 matrix points are multiplied by an 8 long column matrix, and the value of each element in the 8 long column matrix is taken from ⁇ +1, -1 ⁇ , for example, one of the 8 long
  • the column matrix is:
  • H 16 [H 8 H 8 ⁇ A 0 ]
  • the set of each column in H 16 is a set of 8 long non-orthogonal sequences.
  • the orthogonal H 4 matrix points are multiplied by a 4-long column matrix, and the value of each element in the 4-length column matrix is taken from ⁇ +1, -1 ⁇ , for example, one of the four long
  • the column matrix is:
  • H 8 [H 4 H 4 ⁇ A 1 ]
  • the set of each column in H 8 is a set of 4 long non-orthogonal sequences.
  • the orthogonal H 8 matrix points are multiplied by an 8 long column matrix, and the value of each element in the 8 long column matrix is taken from ⁇ +1, -1 ⁇ , for example, one of the 8 long
  • the column matrix is:
  • H 16 [H 8 H 8 ⁇ A 0 ]
  • the set of each column in H 16 is a set of 8 long non-orthogonal sequences.
  • the orthogonal H 4 matrix points are multiplied by a 4-long column matrix, and the value of each element in the 4-length column matrix is taken from ⁇ +1, -1 ⁇ , for example, one of the four long
  • the column matrix is:
  • H 8 [H 4 H 4 ⁇ A 1 ]
  • the set of each column in H 8 is a set of 4 long non-orthogonal sequences.
  • Solution 2 Determine a 4-long complex extension sequence or 8 lengths (or 4) according to an additional bit sequence (the bit sequence length may be greater than or equal to 0) and a bit sequence of the terminal identity information (the bit sequence length may be greater than or equal to 0) Long) non-orthogonal spreading sequence. Since the value of the extra bit sequence is randomly valued each time it is retransmitted, this additional bit sequence can be randomized:
  • a method of generating a complex domain binary extension sequence C1 which can be divided into the following three parts:
  • UE_ID is a 40-length 0, 1 binary bit sequence, for example, a 39 a 38 ... a 1 a 0 , this bit sequence is converted into a decimal number, and the decimal conversion method is: a 39 * 2 39 + a 38 *2 38 +...+a 1 *2 1 +a 0 *2 0 .
  • the length of the extra bit sequence is greater than or equal to 0, and each element takes a value of ⁇ 0, 1 ⁇ .
  • the transmitter Taking a 2*2 integer set as an example, the transmitter generates an index value of an integer sequence in which the elements take values from a set of 4-ary integers ⁇ 0, 1, 2, 3 ⁇ , and the length of the sequence of integers Is 4.
  • the bit sequence (a i ... a 0 + b m ... b 0 ) needs to be performed 4 times.
  • Cyclic shift, 0 ⁇ i ⁇ 39, 0 ⁇ m ⁇ M, and the step size of each cyclic shift can be 0 bits, or a positive integer number of bits, and then use the above decimal conversion method to find The decimal numbers A 1 , A 2 , A 3 and A 4 of the bit sequence after each cyclic shift.
  • the value of the additional Y bits is randomly selected in each retransmission;
  • the bit sequence (a i ... a 0 ) needs to be cyclically shifted 4 times, 0 ⁇ i ⁇ 39, and the step size of each cyclic shift may be 0 bits, or a positive integer number of bits, and then use the above decimal conversion method to find the decimal number B of the bit sequence after each cyclic shift. 1 , B 2 , B 3 and B 4 .
  • the bit sequence (b m ??b 0 ) is converted into decimal, 0 ⁇ m ⁇ M, and the result of the operation is added to B 1 , B 2 , B 3 and B 4 to obtain a new 4 decimal numbers A 1 , A 2 , A 3 and A 4 . And when the transmission fails, the value of the additional Y bits is randomly selected in each retransmission;
  • the bit sequence (a i ... a 0 + b m ... b 0 ) needs to be (b) m togetherb 0 )
  • Perform 4 randomization values 0 ⁇ i ⁇ 39, 0 ⁇ m ⁇ M, and each time contains a randomized bit sequence (a i ... a 0 + b m « b 0 )
  • the sequence is converted to decimal numbers A 1 , A 2 , A 3 and A 4 .
  • the value of the additional Y bits is 4 times randomized each time the retransmission is performed;
  • decimal numbers A 1 , A 2 , A 3 and A 4 the values of each element in the sequence of integers are determined as: A 1 mod 4, A 2 mod 4, A 3 mod 4 and A 4 mod 4, where A p mod 4 represents the value of modulo 4, and p belongs to ⁇ 1, 2, 3, 4 ⁇ , then the sequence of integers ⁇ A 1 mod 4, A 2 mod 4, A 3 mod 4, A 4 mod 4 ⁇ .
  • the transmitter in another embodiment, taking a 3*3 integer set as an example, the transmitter generates an index value of an integer sequence whose element values are derived from a 9-ary integer set ⁇ 0, 1, 2, ..., 8,9 ⁇ , and the length of the sequence of integers is 4.
  • the bit sequence (a i ... a 0 + b m ... b 0 ) needs to be performed 4 times.
  • Cyclic shift, 0 ⁇ i ⁇ 39, 0 ⁇ m ⁇ M, and the step size of each cyclic shift can be 0 bits, or a positive integer number of bits, and then use the above decimal conversion method to find The decimal numbers A 1 , A 2 , A 3 and A 4 of the bit sequence after each cyclic shift.
  • the value of the additional Y bits is randomly selected in each retransmission;
  • the bit sequence (a i ... a 0 ) needs to be cyclically shifted 4 times, 0 ⁇ i ⁇ 39, and the step size of each cyclic shift may be 0 bits, or a positive integer number of bits, and then use the above decimal conversion method to find the decimal number B of the bit sequence after each cyclic shift. 1 , B 2 , B 3 and B 4 .
  • the bit sequence (b m ??b 0 ) is converted into decimal, 0 ⁇ m ⁇ M, and the result of the operation is added to B 1 , B 2 , B 3 and B 4 to obtain a new 4 decimal numbers A 1 , A 2 , A 3 and A 4 . And when the transmission fails, the value of the additional Y bits is randomly selected in each retransmission;
  • the bit sequence (a i ... a 0 + b m ... b 0 ) needs to be (b) m togetherb 0 )
  • Perform 4 randomization values 0 ⁇ i ⁇ 39, 0 ⁇ m ⁇ M, and each time contains a randomized bit sequence (a i ... a 0 + b m « b 0 )
  • the sequence is converted to decimal numbers A 1 , A 2 , A 3 and A 4 .
  • the value of the additional Y bits is 4 times randomized each time the retransmission is performed;
  • the transmitter generates an index value of an integer sequence
  • the element values of the sequence of integers are all from an 8-ary integer set ⁇ 0, 1, 2, ..., 7, 8 ⁇ , and the sequence of integers The length is 4.
  • the bit sequence (a i ... a 0 + b m ... b 0 ) needs to be performed 4 times.
  • Cyclic shift, 0 ⁇ i ⁇ 39, 0 ⁇ m ⁇ M, and the step size of each cyclic shift can be 0 bits, or a positive integer number of bits, and then use the above decimal conversion method to find The decimal numbers A 1 , A 2 , A 3 and A 4 of the bit sequence after each cyclic shift.
  • the value of the additional Y bits is randomly selected in each retransmission;
  • the bit sequence (a i ... a 0 ) needs to be cyclically shifted 4 times, 0 ⁇ i ⁇ 39, and the step size of each cyclic shift may be 0 bits, or a positive integer number of bits, and then use the above decimal conversion method to find the decimal number B of the bit sequence after each cyclic shift. 1 , B 2 , B 3 and B 4 .
  • the bit sequence (a i ... a 0 + b m ... b 0 ) needs to be (b) m togetherb 0 )
  • Perform 4 randomization values 0 ⁇ i ⁇ 39, 0 ⁇ m ⁇ M, and each time contains a randomized bit sequence (a i ... a 0 + b m « b 0 )
  • the sequence is converted to decimal numbers A 1 , A 2 , A 3 and A 4 .
  • the value of the additional Y bits is 4 times randomized each time the retransmission is performed;
  • decimal numbers A 1 , A 2 , A 3 and A 4 the values of each element in the sequence of integers are determined as: A 1 mod 8 , A 2 mod 8 , A 3 mod 8 and A 4 mod 8, where A p mod 8 represents the value of modulo 8 and p belongs to ⁇ 1, 2, 3, 4 ⁇ .
  • the complex numbers corresponding to the four complex constellation points are -1+j, 1+j, -1-j, 1-j.
  • a constellation map containing nine complex constellation points associated with an index value is constructed.
  • the values of the real part and the imaginary part of each constellation point in the complex constellation diagram are all from a 3-ary real number set, and the 3-ary real number set is represented as [-1, 0, +1].
  • the complex numbers corresponding to the nine complex constellation points are -1+j, 1+j, -1-j, 1-j, -j, j, -1, +1, 0, respectively.
  • a constellation map containing eight complex constellation points associated with an index value is constructed.
  • the complex number corresponding to each constellation point in the complex constellation diagram is -1+j, 1+j, -1-j, 1-j, -j, j, -1, +1, that is, does not contain 0 points.
  • a constellation map containing eight complex constellation points associated with an index value is constructed.
  • the complex numbers corresponding to each constellation point in the complex constellation diagram are (-1+j)/sqrt(2), (1+j)/sqrt(2), (-1-j)/sqrt(2), (1-j)/sqrt(2), -j, j, -1, +1, that is, does not contain 0 points.
  • the index value of the integer sequence in (1) is mapped bit by bit to the 4-point complex constellation
  • the complex constellation points (each complex constellation point represents a complex number) generate a complex extension sequence, which is expressed as follows:
  • ComplexSeq p represents a p-th element of the complex spreading sequence obtained from A p mapping according to the mapping relation between the elements 4 yuan set of integers and 4:00 plurality of constellation points in the complex constellation
  • a p represents an integer of pseudorandom The pth element of the sequence.
  • the index value of the integer sequence in (1) is mapped bit by bit according to the mapping relationship between the elements in the 9-ary integer set and the complex constellation points of the 9-point complex constellation (as shown in FIG. 17).
  • the complex constellation points to each of the 9-point complex constellation diagrams (each complex constellation point represents a complex number) generate a complex extension sequence, which is expressed as follows:
  • ComplexSeq p represents the pth element of the complex spreading sequence, and is mapped by A p according to the mapping relationship between the elements in the 9-ary integer set and the complex constellation points of the 9-point complex constellation, and A p represents a pseudo-random integer The pth element of the sequence.
  • the index value of the sequence of integers in (1) is mapped bit by bit according to the mapping relationship between the elements in the 8-ary integer set and the complex constellation points of the 8-point complex constellation (as shown in FIG. 18).
  • the complex constellation points to the complex constellation of 8 points (each complex constellation point represents a complex number) to generate a complex extension sequence, which is expressed as follows:
  • ComplexSeq p represents the pth element of the complex spreading sequence, and is mapped by A p according to the mapping relationship between the elements in the 8-ary integer set and the complex constellation points of the 8-point complex constellation, and A p represents a pseudo-random integer The pth element of the sequence.
  • the index value of the sequence of integers in (1) is mapped bit by bit according to the mapping relationship between the elements in the 8-ary integer set and the complex constellation points of the 8-point complex constellation (as shown in FIG. 19).
  • the complex constellation points to the complex constellation of 8 points (each complex constellation point represents a complex number) to generate a complex extension sequence, which is expressed as follows:
  • ComplexSeq i represents the pth element of the complex spreading sequence, and is mapped by A p according to the mapping relationship between the elements in the 8-ary integer set and the complex constellation points of the 8-point complex constellation, and A p represents a pseudo-random integer The pth element of the sequence.
  • the length of the additionally added bit sequence is greater than or equal to 0, each element takes a value of ⁇ 0, 1 ⁇ , and the additional bits are b M ... b 0 , and M > 0.
  • each element of the non-orthogonal spreading sequence is a complex number
  • the real part and the virtual part of all the elements in the extended sequence values are from a unit 2 yuan real numbers
  • the set of real numbers is 2 yuan ⁇ -1, + 1 ⁇ set consisting of an odd number in the range, then for the non-orthogonal sequences of length 4 total 4 4 non concentrated Orthogonal sequence.
  • an integer index value is generated, according to which the index value can uniquely specify a non-orthogonal sequence in the non-orthogonal sequence set, and the index value is from a (2*2) 4- ary integer set, the 256 A set of meta-integers is a collection of all integers in the range [0, 256-1] or [1, 256];
  • the bit sequence (b m ... b 0 ) is converted into a decimal number, 0 ⁇ m ⁇ M; then, the above decimal number is modulo 256, and the obtained modulo value is the index value. And when the transmission fails, the value of the additional Y bits is randomly selected every time it is retransmitted.
  • determining to generate a 4-long non-orthogonal spreading sequence, and each element of the non-orthogonal spreading sequence is a complex number, and all the elements in the extended sequence The values of the real part and the imaginary part are all derived from a set of 3-ary real numbers, which is a set of odd numbers in the range [-1, 0, +1].
  • An index value of an integer is generated according to the bit sequence (a i ... a 0 + b m ... b 0 ), 0 ⁇ i ⁇ 39, 0 ⁇ m ⁇ M, and the index value is from one (3*3) 4 a set of meta-integers, the set of 6561-element integers being a set of all integers in the range [0,6561-1] or [1,6561];
  • the decimal number converted by (a i ... a 0 + b m ... b 0 ), 0 ⁇ i ⁇ 39, 0 ⁇ m ⁇ M;
  • the decimal number performs a modulo operation on the 6561, and the obtained modulus value is the index value.
  • the value of the additional Y bits is randomly selected every time the retransmission is performed.
  • the extra bit sequence is b M ... b 0 and the (b M —b 0 ) decimal value is greater than 6561
  • first need The bit sequence (b m ... b 0 ) is converted into a decimal number, 0 ⁇ m ⁇ M; then, the above-mentioned decimal number pair 6561 is modulo-operated, and the obtained modulo value is an index value.
  • the value of the additional Y bits is randomly selected every time the retransmission is performed.
  • the values of the real and imaginary parts of the element are all from a set of 3-ary real numbers, which are a set of odd numbers in the range [-1, 0, +1], but the extension is required here.
  • the real and imaginary parts of all elements in the sequence cannot be zero at the same time.
  • the index value is from a set of 8 4 integers
  • the set of 4096-yuan integers is a set of all integers in the range [0, 4096-1] or [1, 4096];
  • the decimal number is modulo-calculated for 4096, and the obtained modulus value is the index value.
  • the value of the additional Y bits is randomly selected every time the retransmission is performed.
  • the extra bit sequence is b M ... b 0 and the (b M —b 0 ) decimal value is greater than 4096
  • first need The bit sequence (b m ... b 0 ) is converted into a decimal number, 0 ⁇ m ⁇ M; then, the above decimal number is modulo-operated 4096, and the obtained modulo value is an index value.
  • the value of the additional Y bits is randomly selected every time the retransmission is performed.
  • each element of the non-orthogonal spreading sequence is a complex number
  • the real part and the virtual part of all the elements in the extended sequence The values of the parts are all from a set of 2-ary real numbers, which is a set of odd numbers in the range of ⁇ -1, +1 ⁇ .
  • the obtained four complex numbers are sequentially combined to obtain the complex extension sequence, or the four complex numbers are multiplied by corresponding energy normalization coefficients and sequentially combined to obtain the complex extension sequence.
  • the non-orthogonal sequence set generated at this time has (2*2) 4 sequences.
  • the values of the real and imaginary parts of the element are all derived from a set of 3-ary real numbers, which are a set of odd numbers in the range ⁇ -1, 0, +1 ⁇ .
  • the obtained four complex numbers are sequentially combined to obtain the complex extension sequence, or the four complex numbers are multiplied by corresponding energy normalization coefficients and sequentially combined to obtain the complex extension sequence.

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Mobile Radio Communication Systems (AREA)

Abstract

本公开提供一种接入方法及装置、发射机、接收机、终端，该方法包括：将待发送的比特序列编码调制形成形成N1个调制符号，将N1个调制符号加上N2个导频符号后形成N个符号，N1和N为正整数，N2为整数；使用两条扩展序列或一条等价序列对N个符号进行扩展，等价序列包括：将上述两条扩展序列中的一条扩展序列扩展，并与另一条扩展序列所形成的序列，比特序列中携带有第一指示信息或第二指示信息，第一指示信息用于至少指示两条扩展序列中的非正交序列，第二指示信息用于至少指示生成等价序列的两条扩展序列中的非正交序列；对扩展后的符号进行载波调制得到载波调制信号，发送载波调制信号。

Description

接入方法及装置、发射机、接收机、终端 技术领域
本公开涉及通信领域，具体而言，涉及一种接入方法及装置、发射机、接收机、终端。
背景技术
上行多用户接入可以通过不同的多址接入技术如：时分多址(Time Division Multiple Access，简称为TDMA)，频分多址(Frequency Division Multiple Access，FDMA)，码分多址(Code Division Multiple Access，简称为CDMA)和空分多址(Space Division Multiple Access，简称为SDMA)。采用码分多址接入的接入过程中，首先，每个接入终端都先用一定长度的扩展序列(如，长度为L的扩展序列，是指这个扩展序列由L个符号构成，也可以说是由L个元素构成，此处的L个符号或者L个元素可以是L个数字符号)对数字幅相调制后的数据符号进行扩展。扩展过程是指每个已调制的数据符号与扩展序列的每个符号相乘，最终形成与所用扩展序列长度相同的符号序列的过程，图1为相关技术中数据符号扩展原理图，如图1所示，数据符号为Sk，一个N长的扩展序列C＝{c1，c2，……cN}，所谓的扩展处理就是将Sk与扩展序列C中的每个元素相乘，最终得到扩展后的序列{Skc1，Skc2，……SkcN}。扩展过程中每个已调制的数据符号(例如采用二相相移键控(Binary Phase Shift Keying，简称为BPSK)/正交调幅(Quadrature Amplitude Modulation，简称为QAM)调制后的星座点符号)与扩展序列的每个符号相乘，最终每个已调制的数据符号会被扩展成为与所用扩展序列长度相同的符号序列，如使用长度为L的扩展序列则每个已调制符号会被扩展成L个符号，也可以说每一个已调制的数据符号承载在一条长度为L的扩展序列上了。然后，所有接入终端的扩展后符号序列可以在相同的时频资源上发送。最后，基站收到的是所有接入终端的扩展信号叠加在一起的合信号，并通过多用户接收机技术从合信号中分离出各个 终端的有用信息。
为了提供灵活的系统设计，支持更多的用户同时接入，通常接入终端采用的扩展序列不是互相正交，从多用户信息论角度而言，上行采用非正交的多址方式是可以取得比正交多址方式更大的系统容量或边缘吞吐量的。因为各终端的扩展序列不是互相正交，所以一般情况下每个用户的解调性能会随着同时接入用户数量的增加而变差。当系统过载时，多用户之间的干扰会变得更加严重。目前主流的码分多址技术为了实现简单，大都是基于二元伪随机实数序列作为扩展序列。但是由于二元伪随机实数序列，尤其是长度较短的二元伪随机实数序列之间的低互相关度并不容易保证，这会导致严重的多用户间干扰，必然会影响多用户接入的性能。
进一步，5G海量连接场景或海量机器通信(Massive machine-type communication，简称为MMC)是5G物联网(Internet of Thing，简称为IoT)业务的一个大类。这个场景的最大挑战是支持海量的终端数，势必要求：每一个机器终端的成本要远低于一般的手机终端；功耗方面也得足够低，以保证电池的使用寿命；覆盖方面还应该有较强的鲁棒性，覆盖面能够达到地下室等偏僻地方。
而传统正交多址有以下不足：需要严格接入流程，终端复杂、成本高、功耗大；而且对小包而言信令开销太大，频谱利用率低；资源正交分割，硬容量，系统灵活性和扩展性低。
目前，针对机器通信接入技术的研究主要集中在以下两个方向：一种是基于ALOHA协议(最早最基本的无线通信协议)等一次传输接入技术的研究，另一种就是通过改进长期演进(Long-Term Evolution，简称为LTE)竞争接入技术来适应机器通信特点的方案。
由于机器通信的设备密度远大于传统的人和人(Human-to-Human，简称为H2H)之间通信的设备密度，这会造成在相同的时刻将有海量的设备会被触发，并且通过随机接入信道(Random Access Channel，简称为RACH)向基站发起接入请求，所以这将不可避免的会引起信息冲突问题， 进而又带来接入时延、信息拥塞等一系列问题，故LTE的随机接入技术并不适合机器通信接入技术。同样，基于LTE改进的接入技术方案，虽然可以保证机器通信接入技术的可靠性，但是该方案需要大量的信令开销，这就无法满足机器通信对灵活性、低功耗、低成本、较少的信令开销的需求。
基于ALOHA的一次传输接入技术其大体可分为两种：一种其设计思想比较简单，即只要用户有数据要发送，就尽管他们发送，当然，这样就会产生冲突从而造成帧的破坏；另一种设计思想是用时钟来统一用户的数据发送，即将时间分为离散的时间片，用户每次必须等到下一个时间片才能开始发送数据，从而避免了用户发送数据的随意性，减少了数据产生冲突的可能性。在第二种一次传输接入技术中，数据的发送时刻不仅要受到用户的影响，而且还要受到时间片的限制，即数据要等到下一个时间片开始时才可以发送。
虽然一次传输接入技术可以节省大量的信令开销，但是其可靠性却无法得到较好的保证，而且对于机器通信时的海量接入，一次传输接入技术必然又会出现较严重的冲突问题。
针对相关技术中，随着机器通信的海量接入进而导致的传输接入技术出现的严重冲突以及可靠性差的问题，尚未提出有效的解决方案。
发明内容
本公开实施例提供了一种接入方法及装置、发射机、接收机、终端，以至少解决相关技术中的问题。
根据本公开的一个实施例，提供了一种接入方法，包括：
将待发送的比特序列编码调制形成N1个调制符号，将所述N1个调制符号加上N2个导频符号后形成N个符号，N1和N为正整数，N2为整数；
使用两条扩展序列或一条等价序列对所述N个符号进行扩展，其中，所述等价序列包括：将所述两条扩展序列中的一条扩展序列扩展，并与另 一条扩展序列所形成的序列，所述比特序列中携带有第一指示信息或第二指示信息，所述第一指示信息用于至少指示所述两条扩展序列中的非正交序列，所述第二指示信息用于至少指示生成所述等价序列的两条扩展序列中的非正交序列；
对扩展后的符号进行载波调制得到载波调制信号，并发送所述载波调制信号。
可选地，所述第一指示信息或所述第二指示信息均至少包括以下信息：终端身份标识信息；终端身份标识信息和；以指定方式或随机产生的一个或多个比特，其中，所述终端身份标识信息包括以下至少之一：唯一标识终端的标识信息；用于指示终端在当前网络中的身份标识信息。
可选地，通过以下参数至少之一确定所述以指定方式或随机产生的一个或多个比特：所述终端身份标识信息、载波调制信号的传输次数、发送载波调制信号的时频位置、所述终端所在小区的配置信息。
可选地，所述两条扩展序列包括：非正交序列和正交序列；非正交序列和非正交序列；所述非正交序列包括：复数非正交序列。
可选地，通过以下方式之一确定所述非正交序列：根据所述比特序列的第一指示信息或所述第二指示信息从包含有多个非正交序列的集合中选择；根据所述第一指示信息或所述第二指示信息序列发生器产生；
通过以下方式之一确定所述正交序列：所述第一指示信息或所述第二指示信息还包括有指示正交序列的指示信息，则根据所述比特序列的的第一指示信息或所述第二指示信息从包含有多个正交序列的集合中选择；从包含有多个正交序列的集合中随机选择。
可选地，当所述非正交序列为复数非正交序列时，通过以下方式确定所述非正交序列：所述复数非正交序列的每一元素为一个复数，且所述复数非正交序列中所有元素的实部和虚部的取值均来自于一个M元实数集合，其中，M是大于等于2的整数；
其中，当所述M是奇数，所述M元实数集合是[-(M-1)/2，(M-1)/2] 范围内的M个整数组成的集合；或者
当所述M是偶数，所述M元实数集合是[-(M-1),(M-1)]范围内的M个奇数组成的集合；或者
当所述M是奇数，所述M元实数集合是[-(M-1)/2,(M-1)/2]范围内的M个整数分别乘以该M元实数集合对应的能量归一化系数得到的M个实数组成的集合；或者
当所述M是偶数，所述M元实数集合是[-(M-1),(M-1)]范围内的M个奇数分别乘以该M元实数集合的能量归一化系数得到的M个实数组成的集合。
可选地，当所述非正交序列为复数非正交序列时，根据所述比特序列确定所述复数非正交序列包括：
根据所述比特序列生成整数序列，所述整数序列的所有元素的取值均来自于一个M×M元整数集合，且具有的元素个数与所述非正交序列的长度相同，所述M×M元整数集合是[0，M×M-1]或[1，M×M]范围内的所有整数组成的集合，M为大于等于2的整数；
根据所述整数序列中元素，按照预设的映射规则从一个M×M点的复数星座图中选取所述元素对应的复数星座点；
确定所述复数星座点对应的复数，将所述复数依次组合得到所述复数非正交序列，或者，将所述复数乘以所述复数的能量归一化系数后依次组合得到所述复数非正交序列。
可选地，所述M＝2或3或4。
可选地，当所述所述非正交序列为复数非正交序列时，根据所述比特序列确定要使用的复数非正交序列包括：
根据所述比特序列生成整数序列，所述整数序列所有元素的取值来自8元整数集合，且具有元素的个数与所述非正交序列的长度相同，所述8元整数集合是[0，7]或[1，8]范围内的所有整数组成的集合；
根据所述的整数序列中的元素，按照预设的映射规则从8点的复数星座图中选取所述复数对应的复数星座点；
确定所述复数星座点对应的复数，将所述复数依次组合得到所述复数非正交序列，或者，将所述复数乘以该复数对应的能量归一化系数后依次组合得到所述复数非正交序列。
可选地，通过基站发送的广播信息确定以下至少之一：所述两条扩展序列中至少一条扩展序列的长度或所述等价序列的长度；所述终端可用的时频资源。
可选地，所述正交序列至少包括以下之一：沃尔什Walsh序列、离散傅里叶变换DFT序列、Zadoff–Chu序列。
可选地，将待发送的比特序列编码调制成N个符号包括：采用以下至少之一编码方式进行编码：循环冗余校验CRC编码和信道纠错编码；
采用至少以下之一编码方式对所述待发送的比特序列进行调制：二进制相移键控、正交移相键控、16正交振幅调制、64正交振幅调制。
可选地，采用至少以下方式之一对所述待发送的比特序列进行载波调制：带有循环前缀CP的正交频分复用OFDM；带有循环前缀CP的单载波频分多址SC-FDMA调制；带有循环前缀CP的1个子载波的OFDM/SC-FDMA调制。
可选地，所述正交序列的序列长度为1；所述非正交序列的长度为1。
可选地，所述导频符号的个数N2取值为0。
根据本公开的另一个方面，还提供了一种上行接入方法，包括：
接收多个发射机发射的载波调制信号，所述载波调制信号是通过所述发射机将待发送的比特序列编码调制形成N1个调制符号，将所述N1个调制符号加上N2个导频符号后形成N个符号，并使用两条扩展序列或一条等价序列对所述N个符号进行扩展，以及对扩展后的符号进行载波调制形成的，其中，N1和N为正整数，N2为整数，所述等价序列包括：将所 述两条扩展序列中的一条扩展序列扩展，并与另一条扩展序列所形成的序列，所述比特序列中携带有第一指示信息或第二指示信息，所述第一指示信息用于至少指示所述两条扩展序列中非正交序列，所述第二指示信息用于至少指示生成的所述等价序列的两条扩展序列中的非正交序列；
对接收的所述载波调制信号进行接收检测。
根据本公开的另一个方面，还提供了一种上行接入装置，包括：
编码调制模块，用于将待发送的比特序列编码调制形成N1个调制符号，将所述N1个调制符号加上N2个导频符号后形成N个符号，N1和N为正整数，N2为整数；
扩展模块，用于使用两条扩展序列或一条等价序列对所述N个符号进行扩展，其中，所述等价序列包括：将所述两条扩展序列中的一条扩展序列扩展，并与另一条扩展序列所形成的序列，所述比特序列中携带有第一指示信息或第二指示信息，所述第一指示信息用于至少指示所述两条扩展序列中的非正交序列，所述第二指示信息用于至少指示所述等价序列的两条扩展序列中的非正交序列；
载波调制模块，用于对扩展后的符号进行载波调制得到载波调制信号；
发送模块，用于发送所述载波调制信号。
根据本公开的另一个方面，还提供了一种上行接入装置，包括：
接收模块，用于接收多个发射机发射的载波调制信号，所述载波调制信号是通过所述发射机将待发送的比特序列编码调制形成N1个调制符号，将所述N1个调制符号加上N2个导频符号后形成N个符号，并使用两条扩展序列或一条等价序列对所述N个符号进行扩展，以及对扩展后的符号进行载波调制形成的，其中，N1和N为正整数，N2为整数，所述等价序列包括：将所述两条扩展序列中的一条扩展序列扩展，并与另一条扩展序列所形成的序列，所述比特序列中携带有第一指示信息或第二指示信息，所述第一指示信息用于至少指示所述两条扩展序列中非正交序列，所述第二指示信息用于至少指示生成的所述等价序列的两条扩展序列中非正交 序列；
检测模块，用于对接收的所述载波调制信号进行接收检测。
根据本公开的另一个方面，还提供了一种发射机，包括：
第一处理器；用于存储处理器可执行指令的第一存储器；
其中，所述第一处理器，用于将待发送的比特序列编码调制形成形成N1个调制符号，将所述N1个调制符号加上N2个导频符号后形成N个符号，使用两条扩展序列或一条等价序列对所述N个符号进行扩展，对扩展后的符号进行载波调制得到载波调制信号，并发送所述载波调制信号，其中，N1和N为正整数，N2为整数，所述等价序列包括：将所述两条扩展序列中的一条扩展序列扩展，并与另一条扩展序列所形成的序列，所述比特序列中携带有第一指示信息或第二指示信息，所述第一指示信息用于至少指示所述两条扩展序列中非正交序列，所述第二指示信息用于至少指示生成的所述等价序列的两条扩展序列中非正交序列。
可选地，所述发射机在无数据需求时，处于休眠状态。
根据本公开的另一个方面，还提供了一种终端，包括：以上任一项所述的发射机。
根据本公开的另一个方面，还提供了一种接收机，包括：
第二处理器；用于存储第二处理器可执行指令的第二存储器；
其中，所述第二处理器，用于接收多个发射机发射的载波调制信号，所述载波调制信号时通过所述发射机将待发送的比特序列编码调制形成N1个调制符号，将所述N1个调制符号加上N2个导频符号后形成N个符号，使用两条扩展序列或一条等价序列对所述N个符号进行扩展，对扩展后的符号进行载波调制形成的，其中，N1和N为正整数，N2为整数，所述等价序列包括：将所述两条扩展序列中的一条扩展序列扩展，并与另一条扩展序列所形成的序列，所述比特序列中携带有第一指示信息或第二指示信息，所述第一指示信息用于至少指示所述两条扩展序列中非正交序列，所述第二指示信息用于至少指示生成的所述等价序列中的非正交序列。
根据本公开的另一种实施例，还提供了一种存储介质，所述存储介质包括存储的程序，其中，所述程序运行时执行以上任一项所述的接入方法。
通过本公开实施例，对待发送的比特序列编码调制成调制符号，将所述调制符号加上导频符号后形成N个符号，通过两条扩展序列或一条等价序列对包含有调制符号和导频符号的N个符号进行扩展，对扩展后的符号进行载波调制，其中，比特序列中携带有携带有第一指示信息或第二指示信息，所述第一指示信息用于至少指示所述两条扩展序列中非正交序列；所述第二指示信息用于至少指示所述等价序列中非正交序列，采用上述技术方案，解决了相关技术中，随着机器通信的海量接入进而导致的传输接入技术出现的严重冲突以及可靠性差的问题，进而提高了上行接入过程的可靠性，避免了上行接入过程的过多的信令交互过程。
附图说明
此处所说明的附图用来提供对本公开的进一步理解，构成本申请的一部分，本公开的示意性实施例及其说明用于解释本公开，并不构成对本公开的不当限定。在附图中：
图1为相关技术中数据符号扩展原理图；
图2是根据本公开实施例的上行接入方法的流程图；
图3是根据本公开实施例的上行接入方法的另一流程图；
图4是根据本公开实施例的上行接入装置的结构框图；
图5是根据本公开实施例的上行接入装置的另一结构框图；
图6是根据本公开实施例的上行接入装置的又一结构框图；
图7为根据本公开实施例的发射机的结构框图；
图8为根据本公开实施例的接收机的结构框图；
图9为根据本公开优选实施例1的发射机侧对信号处理过程的流程图；
图10为根据本公开优选实施例2的发射机侧对信号处理流程图；
图11为根据本公开优选实施例3的发射机侧对信号处理流程图；
图12为根据本公开优选实施例4的发射机侧对信号处理流程图；
图13为根据本公开优选实施例5的发射机侧上行接入方法的流程图；
图14为根据本公开优选实施例的根据终端身份标识信息确定L1长或L2长扩展序列的流程图；
图15为根据本公开优选实施例的4个复数星座点的星座示意图；
图16为根据本公开优选实施例的9个复数星座点的星座示意图；
图17为根据本公开优选实施例的由8个复数星座点组成的方形星座示意图；
图18为根据本公开优选实施例的由8个复数星座点组成的圆形星座示意图；
图19为根据本公开优选实施例的根据额外增加的比特序列、终端身份标识信息取得L1长或L2长序列且额外增加的比特的取值是随机取值的流程图(一)；
图20为根据本公开优选实施例的根据额外增加的比特序列、终端身份标识信息取得L1长或L2长序列且额外增加的比特的取值由重传次数决定的流程图(一)；
图21为根据本公开优选实施例的调制符号分别经过4长非正交扩展、8长正交扩展的原理示意图；
图22为根据本公开优选实施例的调制符号分别经过8长正交扩展、4长非正交扩展的原理示意图；
图23为根据本公开优选实施例的调制符号分别经过L长序列扩展的原理示意图；
图24为根据本公开优选实施例的分别由4长非正交序列、8长正交序列生成L序列的原理示意图；
图25为根据本公开优选实施例的分别由8长正交序列、4长非正交序 列生成L序列的原理示意图；
图26为根据本公开优选实施例的接收机的流程图；
图27为根据本公开优选实施例的多天线时发射机侧的数据扩展流程图(一)；
图28为根据本公开优选实施例的多天线时发射机侧的数据扩展流程图(二)。
具体实施方式
下文中将参考附图并结合实施例来详细说明本公开。需要说明的是，在不冲突的情况下，本申请中的实施例及实施例中的特征可以相互组合。
需要说明的是，本公开的说明书和权利要求书及上述附图中的术语“第一”、“第二”等是用于区别类似的对象，而不必用于描述特定的顺序或先后次序。
为了解决随着机器通信的海量接入进行导致的传输接入技术出现的严重冲突以及可靠性差的问题，本公开实施例的一个大致思路如下：如何取得优良的码分多址接入性能？或更直接的说基站怎样才能准确地从合信号中分离出各终端的有用数据信息？这就是码分多址系统的关键，主要涉及两个方面：扩展序列和接收机，扩展序列的选取是性能基础，接收机的设计是性能保障。
具体来讲，要取得优良的接入性能，不同终端采用的扩展序列首先需要有良好的互相关特性。如果扩展序列是直接在无线多径信道中传输的话，如单载波的码分复用技术，则还要求序列具有良好的自相关特性来对抗序列自身的时延多径扩展。
正因为扩展序列的重要性，不同的码分多址接入技术主要区别在于扩展序列的选取上。直接序列扩频码分多址接入(Direct Sequence-Code Division Multiple Access，简称为DS-CDMA)技术是最为常用的码分多址接入技术，已经被多种无线通信标准采纳为上行多用户接入技术，其扩展 序列是基于最简单的二元伪随机(Pseudo-Noise，简称为PN)实数序列的。由于序列的简单性，基于PN序列的DS-CDMA也是多载波码分复用的最主要技术之一，在此技术中，每个已调制符号会先被一个二元伪随机实数序列扩展，然后再通过多载波技术发射出去。
为了解决上述技术问题，在本实施例中提供了一种上行接入方法，图2是根据本公开实施例的上行接入方法的流程图，如图2所示，该流程包括如下步骤：
步骤S202，将待发送的比特序列编码调制形成N1个调制符号，将该N1个调制符号加上N2个导频符号后形成N个符号，N1和N为正整数，N2为整数；
步骤S204，使用两条扩展序列或一条等价序列对N个符号进行扩展，其中，等价序列包括：将上述两条扩展序列中的一条扩展序列扩展，并与另一条扩展序列所形成的序列，比特序列中携带有第一指示信息或第二指示信息，第一指示信息用于至少指示两条扩展序列中的非正交序列，第二指示信息用于至少指示生成的等价序列的两条扩展序列中的非正交序列；
步骤S206，对扩展后的符号进行载波调制得到载波调制信号，并发送载波调制信号。
通过上述各个步骤，对待发送的比特序列编码调制形成调制符号，再将调制符号加上导频符号后形成N个符号，通过两条扩展序列或一条等价序列对包含有调制符号和导频符号的N个符号进行扩展，对扩展后的符号进行载波调制，其中，比特序列中携带有第一指示信息或第二指示信息，第一指示信息用于至少指示两条扩展序列中非正交序列，第二指示信息用于至少指示生成等价序列的两条序列中的非正交序列，采用上述技术方案，解决了相关技术中，随着机器通信的海量接入进而导致的传输接入技术出现的严重冲突以及可靠性差的问题，进而提高了上行接入过程的可靠性，避免了上行接入过程的过多的信令交互过程。
上述两条扩展序列优选先使用非正交序列进行扩展，非正扩展后的符 号再使用正交扩展，当然也可以是先用正交序列进行扩展，之后再使用非正交序列，等价序列可以是两条扩展序列中一条序列扩展成另一条序列的等价序列，例如，上述两条扩展序列分别为A和B，等价序列可以是将A扩展成B以后形成的BB序列，也可以是将B扩展成A的AA序列，其中的A和B可以分别代表非正交序列和正交序列。
本公开实施例的两条扩展序列可以是非正交序列和正交序列，也可以两条都是非正交序列，具体可以根据实际情况进行调整，此外，比特序列中除了携带有指示非正交序列的指示信息之外，还可以携带有正交序列的指示信息，正交序列的指示信息通常是借用非正交序列的指示信息，不希望额外增加指示信息来指示正交序列，本公开实施例对此均不作限定。
需要说明的是，本公开实施例中的非正交序列是至少通过以下方式之一确定的：根据比特序列中的第一指示信息或第二指示信息从包含有多个非正交序列的集合中选择；根据比特序列中的第一指示信息或第二指示信息从序列发生器产生；正交序列是至少通过以下方式之一确定的：当所述第一指示信息或第二指示信息包含有能够指示正交序列的信息时，根据比特序列中用于指示正交序列的指示信息从包含有多个正交序列的集合中选择；从包含有多个正交序列的集合中随机选择，本领域技术人员根据其具备的能力能够获知的非正交序列和正交序列的确定方式均在本公开实施例的保护范围内，需要说明的是，第一指示信息和第二指示信息所指示的非正交序列优选来自不同的集合。
在本公开实施例的一个可选示例中，对于第一指示信息或者第二指示信息可以至少携带有以下信息：终端身份标识信息；终端身份标识信息和以指定方式或随机产生的多个比特，可以理解为随机产生的一个或多个比特信息是随机的，并不一定包含在第一指示信息或第二指示信息中，本公开实施例中的终端身份标识信息包括以下至少之一：唯一标识终端的标识信息；用于指示终端在当前网络中的身份标识信息，具体可以是UE_ID或者C-RNTI。
上述随机产生的一个或多个比特并不是完全随机产生的，它可以是根据以下参数之一确定的：终端身份标识信息、载波调制信号的传输次数、发送载波调制信号的时频位置、终端所在小区的配置信息。
在执行上述步骤之前，本公开实施例还可以做以下准备：通过基站发送的广播信息确定以下至少之一：上述两条扩展序列中至少一条扩展序列的长度；上述等价序列长度；终端可用的时频资源，也就是说，本公开实施例基站是可以通过广播信息告知终端当前可用的时频资源的资源池子，终端在知晓这些信息之后，在发送数据时，随机选取一个可用的资源即可。
在具体应用中，本公开实施例提到的其中一条扩展序列可以是复数扩展序列，其中，在本公开的各个实施例中，作为一种示例，复数扩展序列可以是复数非正交序列。对于复数扩展序列，本公开实施例提供了主要给出了几种确定方式，但这些确定方式仅用于举例说明，其他在本公开实施例提供的确定方式的提示下本领域技术人员能够想到的复数扩展序列的确定方式均在本公开实施例的保护范围。
第一种确定方式
当扩展序列为复数扩展序列时，通过以下方式确定上述扩展序列：复数扩展序列的每一元素为一个复数，且复数扩展序列中所有元素的实部和虚部的取值均来自于一个M元实数集合，其中，M是大于等于2的整数；
其中，当M是奇数，M元实数集合是[-(M-1)/2，(M-1)/2]范围内的M个整数组成的集合；或者
当M是偶数，M元实数集合是[-(M-1),(M-1)]范围内的M个奇数组成的集合；或者
当M是奇数，M元实数集合是[-(M-1)/2,(M-1)/2]范围内的M个整数分别乘以该M元实数集合对应的能量归一化系数得到的M个实数组成的集合；或者
当M是偶数，M元实数集合是[-(M-1),(M-1)]范围内的M个奇数分别乘以该M元实数集合的能量归一化系数得到的M个实数组成的集合。
第二种确定方式
根据比特序列生成整数序列，整数序列的所有元素的取值均来自于一个M×M元整数集合，且具有的元素个数与非正交序列的长度相同，M×M元整数集合是[0，M×M-1]或[1，M×M]范围内的所有整数组成的集合，M为大于等于2的整数；
根据整数序列中元素，按照预设的映射规则从一个M×M点的复数星座图中选取元素对应的复数星座点；
确定复数星座点对应的复数，将复数依次组合得到复数扩展序列，或者，将复数乘以复数的能量归一化系数后依次组合得到复数扩展序列。
在第一种确定方式和第二种确定方式中的M取值，优选2或3或4。
第三种确定方式
根据比特序列生成整数序列，整数序列所有元素的取值来自8元整数集合，且具有元素的个数与非正交序列的长度相同，8元整数集合是[0，7]或[1，8]范围内的所有整数组成的集合；
根据的整数序列中的元素，按照预设的映射规则从8点的复数星座图中选取复数对应的复数星座点；
确定复数星座点对应的复数，将复数依次组合得到复数扩展序列，或者，将复数乘以该复数对应的能量归一化系数后依次组合得到复数扩展序列。
对于步骤S202中编码、调制的实现方式有多种，本公开实施例的一个可选示例中，采用以下至少之一编码方式进行编码：CRC编码和信道纠错编码；采用至少以下之一编码方式进行调制：BPSK、QPSK、16QAM、64QAM，优先选取低阶的BPSK和QPSK两种调制方式。
步骤S206的一个可选实现方式，可以是采用至少以下方式之一进行载波调制：带有CP的OFDM；带有CP的SC-FDMA调制；带有CP的1个子载波的OFDM/SC-FDMA调制。
可选地，当两条扩展序列中的其中一条为复数扩展序列时，上述两条扩展序列包括：复数域非正交序列和正交序列；复数域非正交序列和非正交序列，正交序列至少包括以下之一：沃尔什Walsh序列、离散傅里叶变换DFT序列、Zadoff–Chu序列。
在本公开实施例中，正交序列的序列长度可以为1，非正交序列的长度也可以为1，实际上，正交序列是为了增加覆盖，替换传统的简单重复。例如一条8长正交序列解扩时，可以做到自己的能量累加8倍，其它7条序列因为与这条是正交的，解扩后累积能量为0。而每个用户都简单重复8次的话，则不能消除其它用户。
在某些情况下，N个符号中包括的导频符号数可以为0，即不包括导频符号，本公开实施例对此不作特殊说明。
实施例2
为了完善上述技术方案，在本公开实施例中，还提供了一种上行接入方法，图3是根据本公开实施例的上行接入方法的另一流程图，如图3所示，该流程包括如下步骤：
步骤S302，接收多个发射机发射的载波调制信号，载波调制信号是通过发射机将待发送的比特序列编码调制形成形成N1个调制符号，将所述N1个调制符号加上N2个导频符号后形成N个符号，并使用两条扩展序列或一条等价序列对N个符号进行扩展，以及对扩展后的符号进行载波调制形成的，其中，N1和N为正整数，N2为整数，等价序列包括：将上述两条扩展序列中的一条扩展序列扩展，并与另一条扩展序列所形成的序列，比特序列中携带有第一指示信息或第二指示信息，第一指示信息用于至少指示两条扩展序列中的非正交序列；第二指示信息用于至少指示生成的等价序列的两条扩展序列中的非正交序列；
步骤S304，对接收的载波调制信号进行接收检测。
通过上述各个步骤，接收多个发射机发射的载波调制信号，并对载波调制信息进行接收检测，其中，载波调制信号是通过发射机将待发送的比 特序列编码调形成调制符号，将该调制符号加上导频符号后形成N个符号，并使用两条扩展序列或一条等价序列对N个符号进行扩展，以及对扩展后的符号进行载波调制形成的，采用上述技术方案，解决了相关技术中，随着机器通信的海量接入进行导致的传输接入技术出现的严重冲突以及可靠性差的问题，进而提高了上行接入过程的可靠性，避免了上行接入过程的过多的信令交互过程。
步骤S302中接收到的载波调制信号是多个发射机在相同的视频资源池里发送的，所述步骤S302接收到的会是叠加在一起的多个信号。
通过以上的实施方式的描述，本领域的技术人员可以清楚地了解到根据上述实施例的方法可借助软件加必需的通用硬件平台的方式来实现，当然也可以通过硬件，但很多情况下前者是更佳的实施方式。基于这样的理解，本公开的技术方案本质上或者说对现有技术做出贡献的部分可以以软件产品的形式体现出来，该计算机软件产品存储在一个存储介质(如ROM/RAM、磁碟、光盘)中，包括若干指令用以使得一台终端设备(可以是手机，计算机，服务器，或者网络设备等)执行本公开各个实施例的方法。
实施例3
在本实施例中还提供了一种上行接入装置，该装置用于实现上述实施例及优选实施方式，已经进行过说明的不再赘述。如以下所使用的，术语“模块”可以实现预定功能的软件和/或硬件的组合。尽管以下实施例所描述的装置较佳地以软件来实现，但是硬件，或者软件和硬件的组合的实现也是可能并被构想的。
图4是根据本公开实施例的上行接入装置的结构框图，如图4所示，该装置包括：
编码调制模块40，用于将待发送的比特序列编码调制形成N1个调制符号，将所述N1个调制符号加上N2个导频符号后形成N个符号，N1和N为正整数，N2为整数；
扩展模块42，用于使用两条扩展序列或一条等价序列对N个符号进行扩展，其中，等价序列包括：将上述两条扩展序列中的一条扩展序列扩展，并与另一条扩展序列所形成的序列，比特序列中携带有第一指示信息或第二指示信息，第一指示信息用于至少指示两条扩展序列中非正交序列；第二指示信息用于至少指示生成的等价序列的两条扩展序列中的非正交序列；
载波调制模块44，用于对扩展后的符号进行载波调制得到载波调制信号；
发送模块46，用于发送载波调制信号。
通过上述各个模块的作用，对待发送的比特序列编码调制成N个符号，通过两条扩展序列或一条等价序列对包含有调制符号和导频符号的N个符号进行扩展，对扩展后的符号进行载波调制，其中，比特序列中携带有第一指示信息或第二指示信息，所述第一指示信息用于至少指示所述两条扩展序列中非正交序列；所述第二指示信息用于至少指示所述等价序列中非正交序列，采用上述技术方案，解决了相关技术中，随着机器通信的海量接入进行导致的传输接入技术出现的严重冲突以及可靠性差的问题，进而提高了上行接入过程的可靠性，避免了上行接入过程的过多的信令交互过程。
上述两条扩展序列优选先使用非正交序列进行扩展，非正扩展后的符号再使用正交扩展，当然也可以是先用正交序列进行扩展，之后再使用非正交序列，等价序列可以是正交序列扩展后的得到的非正交序列，也可以是上述两条扩展序列的等价扩展得到的序列，本公开实施例的两条扩展序列可以是非正交序列和正交序列，也可以两条都是非正交序列，具体可以根据实际情况进行调整，此外，比特序列中除了携带有指示非正交序列的指示信息之外，还可以携带有正交序列的指示信息，正交序列的指示信息通常是借用非正交序列的指示信息，不希望额外增加指示信息来指示正交序列，本公开实施例对此均不作限定。
需要说明的是，本公开实施例中的非正交序列是至少通过以下方式之一确定的：根据比特序列中的第一指示信息或第二指示信息从包含有多个非正交序列的集合中选择；根据比特序列中的第一指示信息或第二指示信息根据序列发生器产生；正交序列是至少通过以下方式之一确定的：当所述第一指示信息或第二指示信息包含有能够指示正交序列的信息时，根据比特序列中用于指示正交序列的指示信息从包含有多个正交序列的集合中选择；从包含有多个正交序列的集合中随机选择，本领域技术人员根据其具备的能力能够获知的非正交序列和正交序列的确定方式均在本公开实施例的保护范围内。
在本公开实施例的一个可选示例中，对于第一指示信息或第二指示信息可以携带有以下信息：终端身份标识信息；终端身份标识信息和随机产生的多个比特，可以理解为随机产生的多个比特信息是随机的，并不一定包含在非正交序列的指示信息中，本公开实施例中的终端身份标识信息包括以下至少之一：唯一标识终端的标识信息；用于指示终端在当前网络中的身份标识信息，具体可以是UE_ID或者C-RNTI。
上述随机产生的多个比特并不是完全随机产生的，它可以是根据以下参数之一确定的：终端身份标识信息、载波调制信号的传输次数、发送载波调制信号的时频位置、终端所在小区的配置信息。
图5是根据本公开实施例的上行接入装置的另一结构框图，如图5所示，上述装置还包括，确定模块48，用于通过基站发送的广播信息确定以下至少之一：上述两条扩展序列中至少一条扩展序列的长度；等价序列的序列长度；终端可用的时频资源，也就是说，本公开实施例基站是可以通过广播信息告知终端当前可用的时频资源的资源池子，终端在知晓这些信息之后，在下次发送数据时，随机选取一个可用的资源即可。
在具体应用中，本公开实施例提到的扩展序列可以是复数扩展序列，对于复数扩展序列，本公开实施例提供了主要给出了几种确定方式，但这些确定方式仅用于举例说明，其他在本公开实施例提供的确定方式的提示 下本领域技术人员能够想到的复数扩展序列的确定方式均在本公开实施例的保护范围。
第一种确定方式
确定模块48，还用于当其中一条扩展序列为复数扩展序列时，通过以下方式确定上述扩展序列：复数扩展序列的每一元素为一个复数，且复数扩展序列中所有元素的实部和虚部的取值均来自于一个M元实数集合，其中，M是大于等于2的整数；
其中，当M是奇数，M元实数集合是[-(M-1)/2，(M-1)/2]范围内的M个整数组成的集合；或者
当M是偶数，M元实数集合是[-(M-1),(M-1)]范围内的M个奇数组成的集合；或者
当M是奇数，M元实数集合是[-(M-1)/2,(M-1)/2]范围内的M个整数分别乘以该M元实数集合对应的能量归一化系数得到的M个实数组成的集合；或者
当M是偶数，M元实数集合是[-(M-1),(M-1)]范围内的M个奇数分别乘以该M元实数集合的能量归一化系数得到的M个实数组成的集合。
第二种确定方式
确定模块48，还用于当扩展序列为复数扩展序列时，通过以下方式确定上述扩展序列：
根据比特序列生成整数序列，整数序列的所有元素的取值均来自于一个M×M元整数集合，且具有的元素个数与非正交序列的长度相同，M×M元整数集合是[0，M×M-1]或[1，M×M]范围内的所有整数组成的集合，M为大于等于2的整数；
根据整数序列中元素，按照预设的映射规则从一个M×M点的复数星座图中选取元素对应的复数星座点；
确定复数星座点对应的复数，将复数依次组合得到复数扩展序列，或 者，将复数乘以复数的能量归一化系数后依次组合得到复数扩展序列。
在第一种确定方式和第二种确定方式中的M取值，优选2或3或4。
第三种确定方式
确定模块48，还用于当扩展序列为复数扩展序列时，通过以下方式确定上述扩展序列：
根据比特序列生成整数序列，整数序列所有元素的取值来自8元整数集合，且具有元素的个数与非正交序列的长度相同，8元整数集合是[0，7]或[1，8]范围内的所有整数组成的集合；
根据的整数序列中的元素，按照预设的映射规则从8点的复数星座图中选取复数对应的复数星座点；
确定复数星座点对应的复数，将复数依次组合得到复数扩展序列，或者，将复数乘以该复数对应的能量归一化系数后依次组合得到复数扩展序列。
可选地，编码调制模块40，还用于采用以下至少之一编码方式进行编码：CRC编码和信道纠错编码；还用于采用至少以下之一编码方式进行调制：BPSK、QPSK、16QAM、64QAM，优先选取低阶的BPSK和QPSK两种调制方式。
在本公开实施例中，载波调制模块44，还用于采用至少以下方式之一进行载波调制：带有CP的OFDM；带有CP的SC-FDMA调制；带有CP的1个子载波的OFDM/SC-FDMA调制。
在本公开实施例中，正交序列的序列长度可以为1，非正交序列的长度也可以为1，实际上，正交序列是为了增加覆盖，替换传统的简单重复。例如一条8长正交序列解扩时，可以做到自己的能量累加8倍，其它7条序列因为与这条是正交的，解扩后累积能量为0。而每个用户都简单重复8次的话，则不能消除其它用户。
实施例4
在本实施例中还提供了一种上行接入装置，该装置用于实现上述实施例及优选实施方式，已经进行过说明的不再赘述。如以下所使用的，术语“模块”可以实现预定功能的软件和/或硬件的组合。尽管以下实施例所描述的装置较佳地以软件来实现，但是硬件，或者软件和硬件的组合的实现也是可能并被构想的。
图6是根据本公开实施例的上行接入装置的又一结构框图，如图6所示，该装置包括：
接收模块60，用于接收多个发射机发射的载波调制信号，载波调制信号是通过发射机将待发送的比特序列编码调制形成形成N1个调制符号，将所述N1个调制符号加上N2个导频符号后形成N个符号，使用两条扩展序列或一条等价序列对N个符号进行扩展，对扩展后的符号进行载波调制形成的，其中，N1和N为正整数，N2为整数，等价序列包括：等价序列包括：将上述两条扩展序列中的一条扩展序列扩展，并与另一条扩展序列所形成的序列，比特序列中携带有第一指示信息或第二指示信息，第一指示信息用于至少指示两条扩展序列中非正交序列；第二指示信息用于至少指示生成等价序列的两条序列中的非正交序列；
检测模块62，用于对接收的载波调制信号进行接收检测。
通过上述各个模块的作用，接收多个发射机发射的载波调制信号，并对载波调制信息进行接收检测，其中，载波调制信号是通过发射机将待发送的比特序列编码调制形成调制符号，将该调制符号加上导频符号后形成N个符号，并使用两条扩展序列或一条等价序列对N个符号进行扩展，以及对扩展后的符号进行载波调制形成的，采用上述技术方案，解决了相关技术中，随着机器通信的海量接入进行导致的传输接入技术出现的严重冲突以及可靠性差的问题，进而提高了上行接入过程的可靠性，避免了上行接入过程的过多的信令交互过程。
实施例5
在实际应用中，本公开实施例还提供了一种发射机，图7为根据本公 开实施例的发射机的结构框图，如图7所示，包括：
第一处理器70；
用于存储处理器可执行指令的第一存储器72；其中，第一处理器70，用于将待发送的比特序列编码调制形成形成N1个调制符号，将所述N1个调制符号加上N2个导频符号后形成N个符号，使用两条扩展序列或一条等价序列对N个符号进行扩展，对扩展后的符号进行载波调制得到载波调制信号，并发送载波调制信号，其中，N1和N为正整数，N2为整数，等价序列包括：将上述两条扩展序列中的一条扩展序列扩展，并与另一条扩展序列所形成的序列，比特序列中携带有第一指示信息或第二指示信息，第一指示信息用于至少指示两条扩展序列中非正交序列；第二指示信息用于至少指示生成等价序列的两条序列中的非正交序列。
本公开实施例的一个可选应用场景：当前在需要大量机器通信的情况下，很多时候需要向某一地区投放数百万量的终端，终端内部都会内设发射机，如果采用传统的上行接入方法，需要随机接入或者握手交互的过程，这样需要大量的信令交互，浪费终端的电量，也增加了终端的成本，而通过本公开实施例的上行接入方法，即使投放的终端量很大，但由于上行接入方法简单，不需过多的信令交互过程，进而也减少了终端耗电量，降低了终端成本，同时也增加了上行接入过程的可靠性。
为了更好的节省终端电量，发射机在无数据需求时，处于休眠状态。
在本公开实施例中，还提供了一种终端，包括以上任一项所述的发射机。
实施例6
图8为根据本公开实施例的接收机的结构框图，如图8所示，包括：
第二处理器80；
用于存储第二处理器可执行指令的第二存储器82；
其中，第二处理器80，用于接收多个发射机发射的载波调制信号，载 波调制信号时通过发射机将待发送的比特序列编码调制形成N1个调制符号，将所述N1个调制符号加上N2个导频符号后形成N个符号，使用两条扩展序列或一条等价序列对N个符号进行扩展，对扩展后的符号进行载波调制形成的，其中，N1和N为正整数，N2为整数，等价序列包括：等价序列包括：将上述两条扩展序列中的一条扩展序列扩展，并与另一条扩展序列所形成的序列，比特序列中携带有第一指示信息或第二指示信息，第一指示信息用于至少指示两条扩展序列中非正交序列；第二指示信息用于至少指示生成等价序列的两条序列中的非正交序列。
以下结合一示例对上述发射机和接收机的结构以及工作原理进行说明，但不用于限定本公开实施例。
本公开实施例提供的发射机，可以包括：
序列确定装置，配置为确定要使用的实数PN序列或者复数扩展序列，实数PN序列的L个元素取值来自[-1,+1]集合，复数扩展序列的每一元素为一个复数，且复数扩展序列中所有元素的实部和虚部的取值均来自于一个M元实数集合，其中，M是大于等于2的整数；
扩展装置，配置为采用复数扩展序列对待发送的数据符号进行扩展处理，生成扩展后的符号序列；
信号发送装置，配置为发送扩展后的符号序列。
可选地，序列确定装置确定的复数扩展序列中所有元素的实部和虚部的取值都来自于一个M元实数集合，其中：
M是奇数，M元实数集合是[-(M-1)/2,(M-1)/2]范围内的M个整数组成的集合；或者
M是偶数，M元实数集合是[-(M-1),(M-1)]范围内的M个奇数组成的集合；或者
M是奇数，M元实数集合是[-(M-1)/2,(M-1)/2]范围内的M个整数分别乘以相应的归一化系数得到的M个实数组成的集合；或者
M是偶数，M元实数集合是[-(M-1),(M-1)]范围内的M个奇数分别乘以相应的归一化系数得到的M个实数组成的集合。
可选地，序列确定装置确定的复数扩展序列中所有元素的实部和虚部的取值均来自于一个M元实数集合，其中，M＝2或3或4。
可选地，序列确定装置确定要使用的复数扩展序列，包括：
根据约定规则从收发系统预设的复数非正交序列集合中选取一个复数非正交序列，确定为复数扩展序列；或者
根据基站发送的复数非正交序列索引信息，从收发系统预设的复数非正交序列集合中选取一个复数非正交序列，确定为复数扩展序列；
其中，复数非正交序列集合中的每一复数非正交序列，其所有元素的实部和虚部的取值均来自于M元实数集合。
可选地，序列确定装置确定要使用的复数扩展序列，包括：
生成一个伪随机的整数序列，整数序列具有L个元素且其中所有元素的取值均来自于一个M×M元整数集合，M×M元整数集合是[0，M×M-1]或[1，M×M]范围内的所有整数组成的集合，L为大于等于2的整数；
根据伪随机的整数序列中的L个元素，按照预设的映射规则从一个M×M点的复数星座图中选取对应的L个复数星座点；
确定L个复数星座点对应的L个复数，将L个复数依次组合得到复数扩展序列，或者，将L个复数乘以相应的能量归一化系数后依次组合得到复数扩展序列。
可选地，信号发送装置发送扩展后的符号序列，包括：对扩展后的符号序列进行带有CP的OFDM或者SC-FDMA多载波调制，形成发射信号并发射。
可选地，信号发送装置发送扩展后的符号序列，包括：对扩展后的符号序列进行单载波调制，形成发射信号并发射。
本公开实施例提供的接收机可以包括：
信号接收装置，配置为接收多个发射机发射的信号，多个发射机发射的信号是多个发射机分别采用各自的复数扩展序列对各自待发送的数据符号进行扩展处理，再将生成的扩展后的符号序列分别调制到相同的时频资源上形成的；
接收检测装置，配置为采用干扰消除信号检测器对接收的多个发射机发射的信号进行接收检测，检测时使用多个发射机所采用的复数扩展序列；
其中，复数扩展序列的每一元素为一个复数，且复数扩展序列中所有元素的实部和虚部的取值均来自于一个M元实数集合，其中，M是大于等于2的整数。
可选地，接收检测装置检测时使用多个发射机所采用的复数扩展序列中，所有元素的实部和虚部的取值均来自于一个M元实数集合，其中：
M是奇数，M元实数集合是[-(M-1)/2,(M-1)/2]范围内的M个整数组成的集合；或者
M是偶数，M元实数集合是[-(M-1),(M-1)]范围内的M个奇数组成的集合；或者
M是奇数，M元实数集合是[-(M-1)/2,(M-1)/2]范围内的M个整数分别乘以相应的归一化系数得到的M个实数组成的集合；或者
M是偶数，M元实数集合是[-(M-1),(M-1)]范围内的M个奇数分别乘以相应的归一化系数得到的M个实数组成的集合。
可选地，接收检测装置检测时使用多个发射机所采用的复数扩展序列中，所有元素的实部和虚部的取值均来自于一个M元实数集合，其中：M＝2,3或4。
为了更好的理解本公开实施例上述提供的上行接入过程，以下将结合优选实施例对上述技术方案进行解释说明，必要的情况下，优选实施例的技术方案是可以结合使用的，本公开对此不作限定。
优选实施例1
本公开优选实施例1提供了一种基于扩展的上行接入方法，图9为根据本公开优选实施例1的发射机侧对信号处理过程的流程图，如图9所示，在发射机侧对信号处理过程：终端把“比特序列”经CRC+卷积码编码、调制后，变成144个调制符号，再加入24导频符号(数据加导频符号对应的需要LTE 1个物理资源块(Physical Resource Block，简称为PRB)的时频资源来承载)，之后使用一条4长复数域扩展序列，然后再使用8长(或4长)的Walsh正交扩展序列进行扩展(扩展后的符号需要LTE 32个(或16个)PRB时频资源来承载)，最后将扩展后的符号使用带CP的OFDM/SC-FDMA/DFT-S-OFDM调制，发送给基站；基站使用先进接收机分离各个终端的信息。
优选实施例2
图10为根据本公开优选实施例2的发射机侧对信号处理流程图，如图10所示：终端把“比特序列”经CRC+卷积码编码、调制后，变成144个调制符号，再加入24导频符号(数据加导频符号对应的需要LTE 1个PRB的时频资源来承载)，之后使用8长(或4长)的Walsh正交扩展序列进行扩展，然后再使用一条4长复数域扩展序列(扩展后的符号需要LTE32(或16个)个PRB时频资源来承载)，最后将扩展后的符号使用带CP的OFDM/SC-FDMA/DFT-S-OFDM调制，发送给基站；基站使用先进接收机分离各个终端的信息。
优选实施例3
图11为根据本公开优选实施例3的发射机侧对信号处理流程图，如图11所示，发射机侧对信号处理过程：终端把“比特序列”经CRC+卷积码编码、调制后，变成144个调制符号，再加入24导频符号(数据加导频符号对应的需要LTE 1个PRB的时频资源来承载)，然后使用一条32长(或16长)的扩展序列对调制符号进行扩展，此32长(或16长)扩展序列由8长(或4长)的Walsh正交扩展序列与4长复数域扩展序列进行扩展所得，最后将扩展后的符号使用带CP的 OFDM/SC-FDMA/DFT-S-OFDM调制，发送给基站；基站使用先进接收机分离各个终端的信息。
优选实施例4
图12为根据本公开优选实施例4的发射机侧对信号处理流程图，如图12所示，发射机侧对信号处理过程：终端把“比特序列”经CRC+卷积码编码、调制后，变成144个调制符号，再加入24导频符号(数据加导频符号对应的需要LTE 1个PRB的时频资源来承载)，之后使用一条4长复数域扩展序列，最后将扩展后的符号使用带CP的OFDM/SC-FDMA/DFT-S-OFDM调制，发送给基站；基站使用先进接收机分离各个终端的信息。
优选实施例5
图13为根据本公开优选实施例5的发射机侧上行接入方法的流程图，如图13所示，包括：
步骤S1302，根据比特序列信息确定4长的复数扩展序列或8长(或4长)的正交扩展序列。本公开优选实施例中终端本身的标识信息UE_ID可以是40长的比特序列，且UE_ID的长度建议大于16，C1是4长复数域二元扩展序列，C2是8长的Walsh正交扩展序列，C2中元素的值取值于{+1，-1}。
比特序列包含终端在网络中标识身份的信息(或者说能表示终端身份的信息，可统一简称为终端身份标识，例如终端本身的标识信息UE_ID的部分或全部信息，或者在网络中的临时标识)的比特序列或者额外增加的比特序列；额外增加的比特序列的长度、取值与终端身份标识信息，或者传输次数，或者数据包大小，或者时频位置，或者小区配置有关。
根据比特序列信息确定4长的复数扩展序列或8长(或4长)的正交扩展序列，按照是否增加额外的比特位以及所增加的比特位的不同作用，分成以下三个方案：
方案一：如图14所示，根据终端身份标识信息确定4长的复数扩展 序列或8长(或4长)的正交扩展序列,不利用额外的增加比特位用来引入随机性：
结合本公开优选实施例给出的应用场景，更加具体的介绍非正交扩展序列C1、正交扩展序列C2的生成过程：
(一)生成复数域二元扩展序列C1的一种方法，该方法可以分成以下三个部分：
(1)此处UE_ID是一个40长的0、1二进制比特序列，例如a39a38……a1a0，将此比特序列转换成十进制数，十进制转换方法为：a39×239+a38×238+……+a1×21+a0×20＝A。
以2×2整数集合为例，发射机生成一个整数序列的索引值，该整数序列中元素取值均来自于一个4元整数集合{0,1,2,3}，且该整数序列的长度为4。
为了生成上述的整数序列，首先，需要将比特序列(ai……a0)进行4次的循环移位，0≤i≤39，且每次循环移位的步长可以是0个比特位，或者是正整数个比特位，再利用上述的十进制转化方法，求出每次循环移位后比特序列的十进制数A1、A2、A3和A4。
最后，根据十进制数A1、A2、A3和A4，求出整数序列中每个元素的取值为：A1mod 4、A2mod 4、A3mod 4和A4mod 4，其中Apmod 4表示对4取模的值，p属于{1,2,3,4}，则得到的整数序列{A1mod 4、A2mod 4、A3mod 4、A4mod 4}。
另一个实施例中，以3×3整数集合为例，发射机生成一个整数序列的索引值，该整数序列的元素取值均来自于一个9元整数集合{0,1,2,……，8}，且该整数序列的长度为4。
为了生成上述的整数序列，首先，需要将比特序列ai……a0进行4次的循环移位，0≤i≤39，且每次循环移位的步长可以是0个比特位,或者是正整数个比特位，利用上述的十进制转化方法，求出每次循环移位后比特序列的十进制数A1、A2、A3和A4。
最后，根据十进制数A1、A2、A3和A4，求出整数序列中每个元素的取值为：A1mod 9、A2mod 9、A3mod 9和A4mod 9，其中Apmod 9表示对9取模的值，p属于{1,2,3,4}，则得到的整数序列{A1mod 9、A2mod 9、A3mod 9、A4mod 9}。。
另一个实施例中，发射机生成一个整数序列的索引值，该整数序列的元素取值均来自于一个8元整数集合{0,1,2,……，7}，且该整数序列的长度为4。
为了生成上述的整数序列，首先，需要将比特序列ai……a0进行4次的循环移位，0≤i≤39,且每次循环移位的步长可以是0个比特位，或者是正整数个比特位，再利用上述的十进制转化方法，求出每次循环移位后比特序列的十进制数A1、A2、A3和A4。
最后，根据十进制数A1、A2、A3和A4，求出整数序列中每个元素的取值为：A1mod 8、A2mod 8、A3mod 8和A4mod 8，其中Apmod 8表示对8取模的值，p属于{1,2,3,4}，则得到的整数序列{A1mod 8、A2mod 8、A3mod 8、A4mod 8}。。
(2)构造与索引值相关联的含有4个复数星座点的星座图。复数星座图中每个星座点的实部和虚部的取值均来自于一个2元实数集合，且此2元实数集合表示为[-1,+1]。
故此4个复数星座点对应的复数分别为-1+j、1+j、-1-j、1-j。
另一个实施例中，构造与索引值相关联的含有9个复数星座点的星座图。复数星座图中每个星座点的实部和虚部的取值均来自于一个3元实数集合，且此3元实数集合表示为[-1,0,+1]。
故此9个复数星座点对应的复数分别为-1+j、1+j、-1-j、1-j、-j、j、-1、+1、0。
另一个实施例中，构造与索引值相关联的含有8个复数星座点的星座图。复数星座图中每个星座点对应的复数分别为-1+j、1+j、-1-j、1-j、-j、j、-1、+1，即不含有0点。
另一个实施例中，构造与索引值相关联的含有8个复数星座点的星座图。复数星座图中每个星座点对应的复数分别为(-1+j)/sqrt(2)、(1+j)/sqrt(2)、(-1-j)/sqrt(2)、(1-j)/sqrt(2)、-j、j、-1、+1，即不含有0点。
(3)根据伪随机的整数序列中的4个元素，按照预设的映射规则从一个4点的复数星座图中选取对应的4个复数星座点；
根据4元整数集合中的元素与4点复数星座图的复数星座点之间的映射关系(如图15所示)把(1)中整数序列的索引值逐位映射到4点复数星座图的复数星座点(每一复数星座点表示一个复数)生成复数扩展序列，用公式表示如下：
Ap—>ComplexSeqp；
其中，ComplexSeqp表示复数扩展序列的第p个元素，根据4元整数集合中的元素与4点复数星座图的复数星座点之间的映射关系由Ap映射得到，Ap表示伪随机的整数序列的第p个元素。
根据整数序列索引值，确定4个复数星座点对应的4个复数，将4个复数依次组合得到复数扩展序列，或者，将4个复数乘以相应的能量归一化系数后依次组合得到复数扩展序列。
在另一实施例中，根据9元整数集合中的元素与9点复数星座图的复数星座点之间的映射关系(如图16所示)把(1)中整数序列的索引值逐位映射到9点复数星座图的复数星座点(每一复数星座点表示一个复数)生成复数扩展序列，用公式表示如下：
Ap—>ComplexSeqp；
其中，ComplexSeqp表示复数扩展序列的第p个元素，根据9元整数集合中的元素与9点复数星座图的复数星座点之间的映射关系由Ap映射得到，Ap表示伪随机的整数序列的第p个元素。
根据整数序列索引值，确定9个复数星座点对应的4个复数，将4个复数依次组合得到复数扩展序列，或者，将4个复数乘以相应的能量归一化系数后依次组合得到复数扩展序列。
在另一实施例中，根据8元整数集合中的元素与8点复数星座图的复数星座点之间的映射关系(如图17所示)把(1)中整数序列的索引值逐位映射到8点复数星座图的复数星座点(每一复数星座点表示一个复数)生成复数扩展序列，用公式表示如下：
Ap—>ComplexSeqp；
其中，ComplexSeqp表示复数扩展序列的第p个元素，根据8元整数集合中的元素与8点复数星座图的复数星座点之间的映射关系由Ap映射得到，Ap表示伪随机的整数序列的第p个元素。
根据整数序列索引值，确定8个复数星座点对应的4个复数，将4个复数依次组合得到复数扩展序列，或者，将4个复数乘以相应的能量归一化系数后依次组合得到复数扩展序列。
在另一实施例中，根据8元整数集合中的元素与8点复数星座图的复数星座点之间的映射关系(如图18所示)把(1)中整数序列的索引值逐位映射到8点复数星座图的复数星座点(每一复数星座点表示一个复数)生成复数扩展序列，用公式表示如下：
Ap—>ComplexSeqp；
其中，ComplexSeqp表示复数扩展序列的第p个元素，根据8元整数集合中的元素与8点复数星座图的复数星座点之间的映射关系由Ap映射得到，Ap表示伪随机的整数序列的第p个元素。
根据整数序列索引值，确定8个复数星座点对应的4个复数，将4个复数依次组合得到复数扩展序列，或者，将4个复数乘以相应的能量归一化系数后依次组合得到复数扩展序列。
(二)生成复数域二元扩展序列C1的另一种方法，且该方法可以分成以下三部分：
(1)此处UE_ID是一个40长的0、1二进制比特序列，例如a39a38……a1a0，将此比特序列转换成十进制数，十进制转换方法为：a39×239+a38×238+……+a1×21+a0×20＝A。
以一个2元实数集合为例，确定要生成4长的非正交扩展序列，且非正交扩展序列的每一元素为一个复数，且扩展序列中所有元素的实部和虚部的取值均来自于一个2元实数集合，2元实数集合是[-1,+1]范围内的奇数组成的集合。
根据UE_ID生成一个整数的索引值，索引值来自于一个(2×2)4元整数集合，256元整数集合是[0，256-1]或[1，256]范围内的所有整数组成的集合；
为了生成上述的整数的索引值，首先，需要将比特序列ai……a0转换的十进制数，且0≤i≤39；然后，将上述的十进制数对256进行模运算，所得的模值即为索引值。
另一个实施例中，以3元实数集合为例，确定要生成4长的非正交扩展序列，且非正交扩展序列的每一元素为一个复数，且扩展序列中所有元素的实部和虚部的取值均来自于一个3元实数集合，3元实数集合是[-1,0,+1]范围内的奇数组成的集合。
根据UE_ID生成一个整数的索引值，索引值来自于一个(3×3)4元整数集合，6561元整数集合是[0，6561-1]或[1，6561]范围内的所有整数组成的集合；
为了生成上述的整数的索引值，首先，需要将比特序列ai……a0转换的十进制数,且0≤i≤39；然后，将上述的十进制数对6561进行模运算，所得的模值即为索引值。
另一个实施例中，以一个3元实数集合为例，确定要生成4长的非正交扩展序列，且非正交扩展序列的每一元素为一个复数，且扩展序列中所有元素的实部和虚部的取值均来自于一个3元实数集合，3元实数集合是[-1,0,+1]范围内的奇数组成的集合，但是此处要求扩展序列中所有元素的实部和虚部不能同时为0。
根据UE_ID生成一个整数的索引值，索引值是来自于一个4096元整数集合，4096元整数集合是[0，4096-1]或[1，4096]范围内的所有整数组 成的集合；
为了生成上述的整数的索引值，首先，需要将比特序列ai……a0转换的十进制数,且0≤i≤39；然后，将上述的十进制数对4096进行模运算，所得的模值即为索引值。
(2)构造一个4长复数域的非正交序列的集合(表格)；
以一个2元实数集合为例，确定要生成4长的非正交扩展序列，且非正交扩展序列的每一元素为一个复数，且扩展序列中所有元素的实部和虚部的取值均来自于一个2元实数集合，2元实数集合是[-1,+1]范围内的奇数组成的集合。
将所得到的4个复数依次组合得到复数扩展序列，或者，将4个复数乘以相应的能量归一化系数后依次组合得到复数扩展序列。
则此时生成的非正交序列集合中具有(2×2)4条序列。
另一个实施例中，以一个3元实数集合为例，确定要生成4长的非正交扩展序列，且非正交扩展序列的每一元素为一个复数，且扩展序列中所有元素的实部和虚部的取值均来自于一个3元实数集合，3元实数集合是[-1,0,+1]范围内的奇数组成的集合。
将所得到的4个复数依次组合得到复数扩展序列，或者，将4个复数乘以相应的能量归一化系数后依次组合得到复数扩展序列。
则此时生成的非正交序列集合中具有(3×3)4条序列。
另一个实施例中，以一个3元实数集合为例，确定要生成4长的非正交扩展序列，且非正交扩展序列的每一元素为一个复数，且扩展序列中所有元素的实部和虚部的取值均来自于一个3元实数集合，3元实数集合是[-1,0,+1]范围内的奇数组成的集合。
将所得到的4个复数依次组合得到复数扩展序列，或者，将4个复数乘以相应的能量归一化系数后依次组合得到复数扩展序列。
但是此处要求扩展序列中所有元素的实部和虚部不能同时为0，所以 此时生成的非正交序列集合中具有(3×3-1)4条序列。
(3)根据(1)中的索引值并且按照预设的映射规则，从(2)中包含(2×2)4条4长非正交序列的集合(表格)中选择一条而成；或者，
根据(1)中的索引值和预设的映射规则，从(2)中包含(3×3)4条的4长非正交序列的集合(表格)中选择一条而成；或者
根据(1)中的索引值和预设的映射规则，从(2)中包含(3×3-1)4条的4长非正交序列的集合(表格)中选择一条而成。
(三)生成8长(或4长)Walsh正交扩展序列C2的一种方法，该方法可以分成以下三个部分：
(1)此处UE_ID是一个40长的0、1二进制比特序列，例如a39a38……a1a0，将此比特序列转换成十进制数，十进制转换方法为：a39×239+a38×238+……+a1×21+a0×20＝A。
确定要生成一个序列长度为8(或4)的Walsh正交扩展序列集合，且序列集合中每一个正交序列的每一个元素的取值来均来自于{-1,+1}，且正交序列集中总共有8(或4)条正交序列。
根据UE_ID生成一个整数的索引值，索引值来自于一个8元(或4元)整数集合，8元(或4元)整数集合是[0，8-1]或[1，8]范围内(或[0，4-1]或[1，4]范围内)的所有整数组成的集合；
为了生成上述的整数的索引值，首先，需要将ai……a0转换的十进制数，且0≤i≤39；然后，将上述的十进制数对8进行模运算，所得的模值即为索引值。
(2)构造一个包含8条8长(或者4条4长)Walsh正交扩展序列的集合(表格)；
例如给出生成8条8长(或者4条4长)Walsh序列的一种方法：
例如给出生成8条8长Walsh序列的一种方法：
首先令H2为：
Figure PCTCN2017082532-appb-000001
则H4和H8分别为：
Figure PCTCN2017082532-appb-000002
Figure PCTCN2017082532-appb-000003
其中，由H8中的每行或者每列即可构造出8长的Walsh码序列。
或者，
例如给出生成4条4长Walsh序列的一种方法：
首先令H2为：
Figure PCTCN2017082532-appb-000004
则H4为：
Figure PCTCN2017082532-appb-000005
其中，由H4中的每行或者每列即可构造出4长的Walsh码序列。
(3)根据(1)中的索引值并且按照预设的映射规则，从(2)中包含8条8长(或4条4长)Walsh正交扩展序列的集合(表格)中选择一条而成。
(4)生成8长(或4长)Walsh正交扩展序列C2的另一种方法，该方法可以分成以下两个部分：
(1)构造一个包含8条8长(或4条4长)Walsh正交扩展序列的集合(表格)；
例如给出生成8条8长(或4条4长)Walsh序列的一种方法：
例如给出生成8条8长Walsh序列的一种方法：
首先令H2为：
Figure PCTCN2017082532-appb-000006
则H4和H8分别为：
Figure PCTCN2017082532-appb-000007
Figure PCTCN2017082532-appb-000008
其中，由H8中的每行或者每列即可构造出8长的Walsh码序列。
或者，
例如给出生成4条4长Walsh序列的一种方法：
首先令H2为：
Figure PCTCN2017082532-appb-000009
则H4为：
Figure PCTCN2017082532-appb-000010
其中，由H4中的每行或者每列即可构造出4长的Walsh码序列。
(2)从(1)中包含8条8长(或4条4长)Walsh正交扩展序列的集合(表格)中随机选择一条而成。
方案二：如图19所示，根据额外增加的比特序列(比特序列长度可以大于或等于0)、终端身份标识信息的比特序列(比特序列长度可以大于或等于0)确定4长的复数扩展序列或8长(或4长)的正交扩展序列。 因为额外增加的比特序列的取值在每次重传时，都是随机取值的，所以这额外增加的比特序列可以起到随机化的作用：
结合本公开优选实施例给出的应用场景，更加具体的介绍非正交扩展序列C1、正交扩展序列C2的生成过程：
(一)生成复数域二元扩展序列C1的一种方法，该方法可以分成以下三个部分：
(1)此处UE_ID是一个40长的0、1二进制比特序列，例如a39a38……a1a0，将此比特序列转换成十进制数，十进制转换方法为：a39×239+a38×238+……+a1×21+a0×20。额外增加的比特序列的长度大于或等于0，每个元素均取值于{0，1}。
以2×2整数集合为例，发射机生成一个整数序列的索引值，该整数序列中元素取值均来自于一个4元整数集合{0,1,2,3}，且该整数序列的长度为4。
当额外增加的比特为bM……b0，且M>0时，为了生成上述的整数序列，首先，需要将比特序列(ai……a0+bm……b0)进行4次的循环移位，0≤i≤39,0≤m≤M,且每次循环移位的步长可以是0个比特位、或者是正整数个比特位，再利用上述的十进制转化方法，求出每次循环移位后比特序列的十进制数A1、A2、A3和A4。且当本次传输失败时，额外增加的Y个比特的取值在每次重传时要随机选择，或者额外增加的Y个比特的取值在每次循环移位是都要随机取值；
或者，
当额外增加的比特为bM……b0，且M>0时，为了生成上述的整数序列，首先，需要将比特序列(ai……a0)进行4次的循环移位，0≤i≤39,,且每次循环移位的步长可以是0个比特位、或者是正整数个比特位，再利用上述的十进制转化方法，求出每次循环移位后比特序列的十进制数B1、B2、B3和B4。将比特序列(bm……b0)进行十进制转化，0≤m≤M，将运算的结果与B1、B2、B3和B4相加，得到新的4个十进制数A1、A2、 A3和A4。且当本次传输失败时，额外增加的Y个比特的取值在每次重传时要随机选择；
或者，
当额外增加的比特为bM……b0，且M>0时，为了生成上述的整数序列，首先，需要将比特序列(ai……a0+bm……b0)中(bm……b0)进行4次随机化取值，0≤i≤39,0≤m≤M,且每次含有随机化比特序列的(ai……a0+bm……b0)序列转化成十进制数A1、A2、A3和A4。且当本次传输失败时，额外增加的Y个比特的取值在每次重传时都要进行4次随机化；
或者
当额外增加的比特为bM……b0，且M>0时，为了生成上述的整数序列，首先，需要将初始值随机选取的比特序列(bm……b0)进行4次的循环移位，或者随机取4次取值，0≤m≤M,且每次循环移位的步长可以是0个比特位、或者是正整数个比特位，再利用上述的十进制转化方法，求出每次循环移位后比特序列的十进制数A1、A2、A3和A4。且当本次传输失败时，额外增加的Y个比特的取值在每次重传时要随机选择。
最后，根据十进制数A1、A2、A3和A4，求出整数序列中每个元素的取值为：A1mod 4、A2mod 4、A3mod 4和A4mod 4，其中Apmod 4表示对4取模的值，p属于{1,2,3,4}，则得到的整数序列{A1mod 4、A2mod 4、A3mod 4、A4mod 4}。
另一个实施例中，以3×3整数集合为例，发射机生成一个整数序列的索引值，该整数序列的元素取值均来自于一个9元整数集合{0,1,2,……，8}，且该整数序列的长度为4。
当额外增加的比特为bM……b0，且M>0时，为了生成上述的整数序列，首先，需要将比特序列(ai……a0+bm……b0)进行4次的循环移位，0≤i≤39,0＜m≤M,且每次循环移位的步长可以是0个比特位、或者是 正整数个比特位，再利用上述的十进制转化方法，求出每次循环移位后比特序列的十进制数A1、A2、A3和A4。且当本次传输失败时，额外增加的Y个比特的取值在每次重传时要随机选择，或者额外增加的Y个比特的取值在每次循环移位是都要随机取值；
或者，
当额外增加的比特为bM……b0，且M>0时，为了生成上述的整数序列，首先，需要将比特序列(ai……a0)进行4次的循环移位，0≤i≤39,,且每次循环移位的步长可以是0个比特位、或者是正整数个比特位，再利用上述的十进制转化方法，求出每次循环移位后比特序列的十进制数B1、B2、B3和B4。将比特序列(bm……b0)进行十进制转化，0≤m≤M，将运算的结果与B1、B2、B3和B4相加，得到新的4个十进制数A1、A2、A3和A4。且当本次传输失败时，额外增加的Y个比特的取值在每次重传时要随机选择；
或者，
当额外增加的比特为bM……b0，且M>0时，为了生成上述的整数序列，首先，需要将比特序列(ai……a0+bm……b0)中(bm……b0)进行4次随机化取值，0≤i≤39,0≤m≤M,且每次含有随机化比特序列的(ai……a0+bm……b0)序列转化成十进制数A1、A2、A3和A4。且当本次传输失败时，额外增加的Y个比特的取值在每次重传时都要进行4次随机化；
或者
当额外增加的比特为bM……b0，且M>0时，为了生成上述的整数序列，首先，需要将初始值随机选取的比特序列(bm……b0)进行4次的循环移位，或者随机取4次取值，0≤m≤M,且每次循环移位的步长可以是0个比特位、或者是正整数个比特位，再利用上述的十进制转化方法，求出每次循环移位后比特序列的十进制数A1、A2、A3和A4。且当本次传输失败时，额外增加的Y个比特的取值在每次重传时要随机选择。
最后，根据十进制数A1、A2、A3和A4，求出整数序列中每个元素的取值为：A1mod 9、A2mod 9、A3mod 9和A4mod 9，其中Apmod 9表示对9取模的值，p属于{1,2,3,4}。
另一个实施例中，发射机生成一个整数序列的索引值，该整数序列的元素取值均来自于一个8元整数集合{0,1,2,……，7}，且该整数序列的长度为4。
当额外增加的比特为bM……b0，且M>0时，为了生成上述的整数序列，首先，需要将比特序列(ai……a0+bm……b0)进行4次的循环移位，0≤i≤39,0≤m≤M,且每次循环移位的步长可以是0个比特位、或者是正整数个比特位，再利用上述的十进制转化方法，求出每次循环移位后比特序列的十进制数A1、A2、A3和A4。且当本次传输失败时，额外增加的Y个比特的取值在每次重传时要随机选择，或者额外增加的Y个比特的取值在每次循环移位是都要随机取值；
或者，
当额外增加的比特为bM……b0，且M>0时，为了生成上述的整数序列，首先，需要将比特序列(ai……a0)进行4次的循环移位，0≤i≤39,,且每次循环移位的步长可以是0个比特位、或者是正整数个比特位，再利用上述的十进制转化方法，求出每次循环移位后比特序列的十进制数B1、B2、B3和B4。将比特序列(bm……b0)进行十进制转化，0≤m≤M，将运算的结果与B1、B2、B3和B4相加，得到新的4个十进制数A1、A2、A3和A4。且当本次传输失败时，额外增加的Y个比特的取值在每次重传时要随机选择；
或者，
当额外增加的比特为bM……b0，且M>0时，为了生成上述的整数序列，首先，需要将比特序列(ai……a0+bm……b0)中(bm……b0)进行4次随机化取值，0≤i≤39,0≤m≤M,且每次含有随机化比特序列的 (ai……a0+bm……b0)序列转化成十进制数A1、A2、A3和A4。且当本次传输失败时，额外增加的Y个比特的取值在每次重传时都要进行4次随机化；
或者
当额外增加的比特为bM……b0，且M>0时，为了生成上述的整数序列，首先，需要将初始值随机选取的比特序列(bm……b0)进行4次的循环移位，或者随机取4次取值，0≤m≤M,且每次循环移位的步长可以是0个比特位、或者是正整数个比特位，再利用上述的十进制转化方法，求出每次循环移位后比特序列的十进制数A1、A2、A3和A4。且当本次传输失败时，额外增加的Y个比特的取值在每次重传时要随机选择。
最后，根据十进制数A1、A2、A3和A4，求出整数序列中每个元素的取值为：A1mod 8、A2mod 8、A3mod 8和A4mod 8，其中Apmod 8表示对8取模的值，p属于{1,2,3,4}。
(2)构造与索引值相关联的含有4个复数星座点的星座图。复数星座图中每个星座点的实部和虚部的取值均来自于一个2元实数集合，且此2元实数集合表示为[-1,+1]。
故此4个复数星座点对应的复数分别为-1+j、1+j、-1-j、1-j。
另一个实施例中，构造与索引值相关联的含有9个复数星座点的星座图。复数星座图中每个星座点的实部和虚部的取值均来自于一个3元实数集合，且此3元实数集合表示为[-1,0,+1]。
故此9个复数星座点对应的复数分别为-1+j、1+j、-1-j、1-j、-j、j、-1、+1、0。
另一个实施例中，构造与索引值相关联的含有8个复数星座点的星座图。复数星座图中每个星座点对应的复数分别为-1+j、1+j、-1-j、1-j、-j、j、-1、+1，即不含有0点。
另一个实施例中，构造与索引值相关联的含有8个复数星座点的星座图。复数星座图中每个星座点对应的复数分别为(-1+j)/sqrt(2)、(1+j)/sqrt(2)、(-1-j)/sqrt(2)、(1-j)/sqrt(2)、-j、j、-1、+1，即不含有0点。
(3)根据伪随机的整数序列中的4个元素，按照预设的映射规则从一个4点的复数星座图中选取对应的4个复数星座点；
根据4元整数集合中的元素与4点复数星座图的复数星座点之间的映射关系(如图15所示)把(1)中整数序列的索引值逐位映射到4点复数星座图的复数星座点(每一复数星座点表示一个复数)生成复数扩展序列，用公式表示如下：
Ap—>ComplexSeqp；
其中，ComplexSeqp表示复数扩展序列的第p个元素，根据4元整数集合中的元素与4点复数星座图的复数星座点之间的映射关系由Ap映射得到，Ap表示伪随机的整数序列的第p个元素。
根据整数序列索引值，确定4个复数星座点对应的4个复数，将4个复数依次组合得到复数扩展序列，或者，将4个复数乘以相应的能量归一化系数后依次组合得到复数扩展序列。
在另一实施例中，根据9元整数集合中的元素与9点复数星座图的复数星座点之间的映射关系(如图16所示)把(1)中整数序列的索引值逐位映射到9点复数星座图的复数星座点(每一复数星座点表示一个复数)生成复数扩展序列，用公式表示如下：
Ap—>ComplexSeqp；
其中，ComplexSeqp表示复数扩展序列的第p个元素，根据9元整数集合中的元素与9点复数星座图的复数星座点之间的映射关系由Ap映射得到，Ap表示伪随机的整数序列的第p个元素。
根据整数序列索引值，确定9个复数星座点对应的4个复数，将4个复数依次组合得到复数扩展序列，或者，将4个复数乘以相应的能量归一化系数后依次组合得到复数扩展序列。
在另一实施例中，根据8元整数集合中的元素与8点复数星座图的复数星座点之间的映射关系(如图17所示)把(1)中整数序列的索引值逐位映射到8点复数星座图的复数星座点(每一复数星座点表示一个复数)生成复数扩展序列，用公式表示如下：
Ap—>ComplexSeqp；
其中，ComplexSeqp表示复数扩展序列的第p个元素，根据8元整数集合中的元素与8点复数星座图的复数星座点之间的映射关系由Ap映射得到，Ap表示伪随机的整数序列的第p个元素。
根据整数序列索引值，确定8个复数星座点对应的4个复数，将4个复数依次组合得到复数扩展序列，或者，将4个复数乘以相应的能量归一化系数后依次组合得到复数扩展序列。
在另一实施例中，根据8元整数集合中的元素与8点复数星座图的复数星座点之间的映射关系(如图18所示)把(1)中整数序列的索引值逐位映射到8点复数星座图的复数星座点(每一复数星座点表示一个复数)生成复数扩展序列，用公式表示如下：
Ap—>ComplexSeqp；
其中，ComplexSeqi表示复数扩展序列的第p个元素，根据8元整数集合中的元素与8点复数星座图的复数星座点之间的映射关系由Ap映射得到，Ap表示伪随机的整数序列的第p个元素。
根据整数序列索引值，确定8个复数星座点对应的4个复数，将4个复数依次组合得到复数扩展序列，或者，将4个复数乘以相应的能量归一化系数后依次组合得到复数扩展序列。
(二)生成复数域二元扩展序列C1的另一种方法，且该方法可以分成以下三部分：
(1)此处UE_ID是一个40长的0、1二进制比特序列，例如a39a38……a1a0，将此比特序列转换成十进制数，十进制转换方法为：a39×239+a38×238+……+a1×21+a0×20＝A。额外增加的比特序列的长度大于或等于0， 每个元素均取值于{0，1}，且额外增加的比特为bM……b0，且M>0。
以一个2元实数集合为例，确定要生成4长的非正交扩展序列，且非正交扩展序列的每一元素为一个复数，且扩展序列中所有元素的实部和虚部的取值均来自于一个2元实数集合，2元实数集合是{-1,+1}范围内的奇数组成的集合，则对于4长的非正交序列集中共有256条非正交序列。
为此要生成一个整数的索引值，根据该索引值可以唯一指定非正交序列集中的一条非正交序列，且索引值来自于一个(2×2)4元整数集合，256元整数集合是[0，256-1]或[1，256]范围内的所有整数组成的集合；
当额外增加的比特为bM……b0，且M>0时，为了生成一个整数的索引值来指定4长非正交序列集中的一条，首先需要将比特序列(ai……a0+bm……b0)转化成一个十进制数，0≤i≤39,0＜m≤M；然后，将上述的十进制数对256进行模运算，所得的模值即为索引值。且当本次传输失败时，额外增加的Y个比特的取值在每次重传时都要随机取值。
或者，
当额外增加的比特序列为bM……b0，且M>0时，为了生成一个整数的索引值来指定4长非正交序列集中的一条，首先需要将比特序列(bm……b0)转化成一个十进制数，0＜m≤M；然后，将上述的十进制数对256进行模运算，所得的模值即为索引值。且当本次传输失败时，额外增加的Y个比特的取值在每次重传时都要随机取值。
另一个实施例中，以3元实数集合为例，确定要生成4长的非正交扩展序列，且非正交扩展序列的每一元素为一个复数，且扩展序列中所有元素的实部和虚部的取值均来自于一个3元实数集合，3元实数集合是[-1,0,+1]范围内的奇数组成的集合。
根据比特序列(ai……a0+bm……b0)生成一个整数的索引值，0≤i≤39,0≤m≤M，索引值来自于一个(3×3)4元整数集合，6561元整数集合是[0，6561-1]或[1，6561]范围内的所有整数组成的集合；
为了生成上述的整数的索引值，首先，需要将(ai……a0+bm……b0) 转换的十进制数，0≤i≤39,0≤m≤M；然后，将上述的十进制数对6561进行模运算，所得的模值即为索引值。且当本次传输失败时，额外增加的Y个比特的取值在每次重传时都要随机取值。
或者，
当额外增加的比特序列为bM……b0，且(bM……b0)十进制值大于6561时，为了生成一个整数的索引值来指定4长非正交序列集中的一条，首先需要将比特序列(bm……b0)转化成一个十进制数，0≤m≤M；然后，将上述的十进制数对6561进行模运算，所得的模值即为索引值。且当本次传输失败时，额外增加的Y个比特的取值在每次重传时都要随机取值。
另一个实施例中，以一个3元实数集合为例，确定要生成4长的非正交扩展序列，且非正交扩展序列的每一元素为一个复数，且扩展序列中所有元素的实部和虚部的取值均来自于一个3元实数集合，3元实数集合是[-1,0,+1]范围内的奇数组成的集合，但是此处要求扩展序列中所有元素的实部和虚部不能同时为0。
根据(ai……a0+bm……b0)生成一个整数的索引值，0≤i≤39,0≤m≤M，索引值是来自于一个4096元整数集合，4096元整数集合是[0，4096-1]或[1，4096]范围内的所有整数组成的集合；
为了生成上述的整数的索引值，首先，需要将(ai……a0+bm……b0)转换的十进制数，0≤i≤39,0≤m≤M；然后，将上述的十进制数对4096进行模运算，所得的模值即为索引值。且当本次传输失败时，额外增加的Y个比特的取值在每次重传时都要随机取值。
或者，
当额外增加的比特序列为bM……b0，且(bM……b0)十进制值大于4096时，为了生成一个整数的索引值来指定4长非正交序列集中的一条，首先需要将比特序列(bm……b0)转化成一个十进制数，0≤m≤M；然后，将上述的十进制数对4096进行模运算，所得的模值即为索引值。且当本次传输失败时，额外增加的Y个比特的取值在每次重传时都要随机取值。
(2)构造一个4长复数域的非正交序列的集合(表格)；
以一个2元实数集合为例，确定要生成4长的非正交扩展序列，且非正交扩展序列的每一元素为一个复数，且扩展序列中所有元素的实部和虚部的取值均来自于一个2元实数集合，2元实数集合是{-1,+1}范围内的奇数组成的集合。
将所得到的4个复数依次组合得到复数扩展序列，或者，将4个复数乘以相应的能量归一化系数后依次组合得到复数扩展序列。
则此时生成的非正交序列集合中具有(2×2)4条序列。
另一个实施例中，以一个3元实数集合为例，确定要生成4长的非正交扩展序列，且非正交扩展序列的每一元素为一个复数，且扩展序列中所有元素的实部和虚部的取值均来自于一个3元实数集合，3元实数集合是{-1,0,+1}范围内的奇数组成的集合。
将所得到的4个复数依次组合得到复数扩展序列，或者，将4个复数乘以相应的能量归一化系数后依次组合得到复数扩展序列。
则此时生成的非正交序列集合中具有(3×3)4条序列。
另一个实施例中，以一个3元实数集合为例，确定要生成4长的非正交扩展序列，且非正交扩展序列的每一元素为一个复数，且扩展序列中所有元素的实部和虚部的取值均来自于一个3元实数集合，3元实数集合是{-1,0,+1}范围内的奇数组成的集合。
将所得到的4个复数依次组合得到复数扩展序列，或者，将4个复数乘以相应的能量归一化系数后依次组合得到复数扩展序列。
但是此处要求扩展序列中所有元素的实部和虚部不能同时为0，所以此时生成的非正交序列集合中具有(3×3-1)4条序列。
(3)根据(1)中的索引值并且按照预设的映射规则，从(2)中包含(2×2)4条4长非正交序列的集合(表格)中选择一条而成；或者，
根据(1)中的索引值和预设的映射规则，从(2)中包含(3×3)4 条的4长非正交序列的集合(表格)中选择一条而成；或者
根据(1)中的索引值和预设的映射规则，从(2)中包含(3×3-1)4条的4长非正交序列的集合(表格)中选择一条而成。
(三)生成8长(或4长)Walsh正交扩展序列C2的一种方法，该方法可以分成以下三个部分：
(1)此处UE_ID是一个40长的0、1二进制比特序列，例如a39a38……a1a0，将此比特序列转换成十进制数，十进制转换方法为：a39×239+a38×238+……+a1×21+a0×20＝A。额外增加的比特序列的长度大于或等于0，每个元素均取值于{0，1}，且额外增加的比特为bM……b0，且M>0。
确定要生成一个序列长度为8(或4)的Walsh正交扩展序列集合，且序列集合中每一个正交序列的每一个元素的取值来均来自于{-1,+1}，且正交序列集中总共有8(或4)条正交序列。
根据要生成一个整数的索引值，该整数的索引值唯一指定了正交序列集中的一个序列，且索引值来自于一个8元(或4元)整数集合，8元(或4元)整数集合是[0，8-1]或[1，8]范围内(或[0，4-1]或[1，4]范围内)的所有整数组成的集合；
当额外增加的比特为bM……b0，且M>0时，为了生成上述的整数序列，首先，需要将比特序列(ai……a0+bm……b0)转化成一个十进制数，0≤i≤39,0≤m≤M然后将所得到的十进制数对8(或4)取模，取模得到值即为整数索引值。且当本次传输失败时，额外增加的Y个比特的取值在每次重传时都要进行随机取值；
或者
当额外增加的比特为bM……b0，且M>0时，为了生成上述的整数序列，需要将初始值随机选取的比特序列(bm……b0)转化成一个十进制数，0≤m≤M,然后将所得到的十进制数对8(或4)取模，取模得到值即为整数索引值。且当本次传输失败时，额外增加的Y个比特的取值在每次重传时要随机选择。
(2)构造一个包含8条8长Walsh正交扩展序列的集合(表格)；
例如给出生成8条8长(或4条4长)Walsh序列的一种方法：
例如给出生成8条8长Walsh序列的一种方法：
首先令H2为：
Figure PCTCN2017082532-appb-000011
则H4和H8分别为：
Figure PCTCN2017082532-appb-000012
Figure PCTCN2017082532-appb-000013
其中，由H8中的每行或者每列即可构造出8长的Walsh码序列。
或者，
例如给出生成4条4长Walsh序列的一种方法：
首先令H2为：
Figure PCTCN2017082532-appb-000014
则H4为：
Figure PCTCN2017082532-appb-000015
其中，由H4中的每行或者每列即可构造出4长的Walsh码序列。(3)根据(1)中的索引值并且按照预设的映射规则，从(2)中包含8条8长(或4条4长)Walsh正交扩展序列的集合(表格)中选择一条而成。
(4)生成8长(或4)Walsh正交扩展序列C2的另一种方法，该方法可以分成以下两个部分：
(1)构造一个包含8条8长(或4条4长)Walsh正交扩展序列的集合(表格)；
例如给出生成8条8长(或4条4长)Walsh序列的一种方法：
例如给出生成8条8长Walsh序列的一种方法：
首先令H2为：
Figure PCTCN2017082532-appb-000016
则H4和H8分别为：
Figure PCTCN2017082532-appb-000017
Figure PCTCN2017082532-appb-000018
其中，由H8中的每行或者每列即可构造出8长的Walsh码序列。
或者，
例如给出生成4条4长Walsh序列的一种方法：
首先令H2为：
Figure PCTCN2017082532-appb-000019
则H4为：
Figure PCTCN2017082532-appb-000020
其中，由H4中的每行或者每列即可构造出4长的Walsh码序列。(2)从(1)中包含8条8长(或4条4长)Walsh正交扩展序列的集合(表格)中随机选择一条而成。
方案三：如图20所示，根据额外增加的比特序列(比特序列长度可 以大于或等于0)、终端身份标识信息的比特序列(比特序列长度可以大于或等于0)确定4长的复数扩展序列或8长(或4长)的正交扩展序列。额外增加的比特序列的取值指定了循环移位的起始位置，且额外增加的比特序列的取值在每次重传时，可以随机选择，也可以依次增加：
结合本实施例给出的应用场景，更加具体的介绍非正交扩展序列C1、正交扩展序列C2的生成过程：
(一)生成复数域二元扩展序列C1的一种方法，该方法可以分成以下三个部分：
(1)此处UE_ID是一个40长的0、1二进制比特序列，例如a39a38……a1a0，将此比特序列转换成十进制数，十进制转换方法为：a39×239+a38×238+……+a1×21+a0×20。额外增加的比特序列的长度大于或等于0，每个元素均取值于{0，1}。
以2×2整数集合为例，发射机生成一个整数序列的索引值，该整数序列中元素取值均来自于一个4元整数集合{0,1,2,3}，且该整数序列的长度为4。
当额外增加的比特为bM……b0，且M>0时，为了生成上述的整数序列，首先，需要将比特序列(ai……a0+bm……b0)进行4次的循环移位，0≤i≤39,0≤m≤M,且每次循环移位的步长可以是0个比特位、或者是正整数个比特位，再利用上述的十进制转化方法，求出每次循环移位后比特序列的十进制数A1、A2、A3和A4。额外增加的比特序列的取值指定了循环移位的起始位置，且当本次传输失败时，额外增加的Y个比特的取值在每次重传时可以随机选取，也可以依次增加；如果是额外增加的比特的取值在每次重传时采取依次增加，那么当本次传输成功后，需要将额外增加的比特的取值清零。
最后，根据十进制数A1、A2、A3和A4，求出整数序列中每个元素的取值为：A1mod 4、A2mod 4、A3mod 4和A4mod 4，其中Apmod 4表示对4取模的值，p属于{1,2,3,4}，则得到的整数序列{A1mod 4、A2mod 4、 A3mod 4、A4mod 4}。
另一个实施例中，以3×3整数集合为例，发射机生成一个整数序列的索引值，该整数序列的元素取值均来自于一个9元整数集合{0,1,2,……，8}，且该整数序列的长度为4。
当额外增加的比特为bM……b0，且M>0时，为了生成上述的整数序列，首先，需要将比特序列(ai……a0+bm……b0)进行4次的循环移位，0≤i≤39,0≤m≤M,且每次循环移位的步长可以是0个比特位、或者是正整数个比特位，再利用上述的十进制转化方法，求出每次循环移位后比特序列的十进制数A1、A2、A3和A4。额外增加的比特序列的取值指定了循环移位的起始位置，且当本次传输失败时，额外增加的Y个比特的取值在每次重传时可以随机选取，也可以依次增加；如果是额外增加的比特的取值在每次重传时采取依次增加，那么当本次传输成功后，需要将额外增加的比特的取值清零。
最后，根据十进制数A1、A2、A3和A4，求出整数序列中每个元素的取值为：A1mod 9、A2mod 9、A3mod 9和A4mod 9，其中Apmod 9表示对9取模的值，p属于{1,2,4}。
另一个实施例中，发射机生成一个整数序列的索引值，该整数序列的元素取值均来自于一个8元整数集合{0,1,2,……，7}，且该整数序列的长度为4。
当额外增加的比特为bM……b0，且M>0时，为了生成上述的整数序列，首先，需要将比特序列(ai……a0+bm……b0)进行4次的循环移位，0≤i≤39,0≤m≤M,且每次循环移位的步长可以是0个比特位、或者是正整数个比特位，再利用上述的十进制转化方法，求出每次循环移位后比特序列的十进制数A1、A2、A3和A4。额外增加的比特序列的取值指定了循环移位的起始位置，且当本次传输失败时，额外增加的Y个比特的取值 在每次重传时可以随机选取，也可以依次增加；如果是额外增加的比特的取值在每次重传时采取依次增加，那么当本次传输成功后，需要将额外增加的比特的取值清零。
最后，根据十进制数A1、A2、A3和A4，求出整数序列中每个元素的取值为：A1mod 8、A2mod 8、A3mod 8和A4mod 8，其中Apmod 8表示对8取模的值，p属于{1,2,3,4}。
(2)构造与索引值相关联的含有4个复数星座点的星座图。复数星座图中每个星座点的实部和虚部的取值均来自于一个2元实数集合，且此2元实数集合表示为[-1,+1]。
故此4个复数星座点对应的复数分别为-1+j、1+j、-1-j、1-j。
另一个实施例中，构造与索引值相关联的含有9个复数星座点的星座图。复数星座图中每个星座点的实部和虚部的取值均来自于一个3元实数集合，且此3元实数集合表示为[-1,0,+1]。
故此9个复数星座点对应的复数分别为-1+j、1+j、-1-j、1-j、-j、j、-1、+1、0。
另一个实施例中，构造与索引值相关联的含有8个复数星座点的星座图。复数星座图中每个星座点对应的复数分别为-1+j、1+j、-1-j、1-j、-j、j、-1、+1，即不含有0点。
另一个实施例中，构造与索引值相关联的含有8个复数星座点的星座图。复数星座图中每个星座点对应的复数分别为(-1+j)/sqrt(2)、(1+j)/sqrt(2)、(-1-j)/sqrt(2)、(1-j)/sqrt(2)、-j、j、-1、+1，即不含有0点。
(3)根据伪随机的整数序列中的4个元素，按照预设的映射规则从一个4点的复数星座图中选取对应的4个复数星座点；
根据4元整数集合中的元素与4点复数星座图的复数星座点之间的映射关系(如图15所示)把(1)中整数序列的索引值逐位映射到4点复数 星座图的复数星座点(每一复数星座点表示一个复数)生成复数扩展序列，用公式表示如下：
Ap—>ComplexSeqp
其中，ComplexSeqp表示复数扩展序列的第p个元素，根据4元整数集合中的元素与4点复数星座图的复数星座点之间的映射关系由Ap映射得到，Ap表示伪随机的整数序列的第p个元素。
根据整数序列索引值，确定4个复数星座点对应的4个复数，将4个复数依次组合得到复数扩展序列，或者，将4个复数乘以相应的能量归一化系数后依次组合得到复数扩展序列。
在另一实施例中，根据9元整数集合中的元素与9点复数星座图的复数星座点之间的映射关系(如图16所示)把(1)中整数序列的索引值逐位映射到9点复数星座图的复数星座点(每一复数星座点表示一个复数)生成复数扩展序列，用公式表示如下：
Ap—>ComplexSeqp
其中，ComplexSeqp表示复数扩展序列的第p个元素，根据9元整数集合中的元素与9点复数星座图的复数星座点之间的映射关系由Ap映射得到，Ap表示伪随机的整数序列的第p个元素。
根据整数序列索引值，确定9个复数星座点对应的4个复数，将4个复数依次组合得到复数扩展序列，或者，将4个复数乘以相应的能量归一化系数后依次组合得到复数扩展序列。
在另一实施例中，根据8元整数集合中的元素与8点复数星座图的复数星座点之间的映射关系(如图17所示)把(1)中整数序列的索引值逐位映射到8点复数星座图的复数星座点(每一复数星座点表示一个复数)生成复数扩展序列，用公式表示如下：
Ap—>ComplexSeqp
其中，ComplexSeqp表示复数扩展序列的第p个元素，根据8元整数 集合中的元素与8点复数星座图的复数星座点之间的映射关系由Ap映射得到，Ap表示伪随机的整数序列的第p个元素。
根据整数序列索引值，确定8个复数星座点对应的4个复数，将4个复数依次组合得到复数扩展序列，或者，将4个复数乘以相应的能量归一化系数后依次组合得到复数扩展序列。
在另一实施例中，根据8元整数集合中的元素与8点复数星座图的复数星座点之间的映射关系(如图18所示)把(1)中整数序列的索引值逐位映射到8点复数星座图的复数星座点(每一复数星座点表示一个复数)生成复数扩展序列，用公式表示如下：
Ap—>ComplexSeqp
其中，ComplexSeqp表示复数扩展序列的第p个元素，根据8元整数集合中的元素与8点复数星座图的复数星座点之间的映射关系由Ap映射得到，Ap表示伪随机的整数序列的第p个元素。
根据整数序列索引值，确定8个复数星座点对应的4个复数，将4个复数依次组合得到复数扩展序列，或者，将4个复数乘以相应的能量归一化系数后依次组合得到复数扩展序列。
(二)生成复数域二元扩展序列C1的另一种方法，且该方法可以分成以下三部分：
(1)此处UE_ID是一个40长的0、1二进制比特序列，例如a39a38……a1a0，将此比特序列转换成十进制数，十进制转换方法为：a39×239+a38×238+……+a1×21+a0×20＝A。额外增加的比特序列的长度大于或等于0，每个元素均取值于{0，1}，且额外增加的比特为bM……b0，且M>0。
以一个2元实数集合为例，确定要生成4长的非正交扩展序列，且非正交扩展序列的每一元素为一个复数，且扩展序列中所有元素的实部和虚部的取值均来自于一个2元实数集合，2元实数集合是{-1,+1}范围内的奇数组成的集合，则对于4长的非正交序列集中共有44条非正交序列。
为此要生成一个整数的索引值，根据该索引值可以唯一指定非正交序 列集中的一条非正交序列，且索引值来自于一个(2×2)4元整数集合，256元整数集合是[0，256-1]或[1，256]范围内的所有整数组成的集合；
当额外增加的比特为bM……b0，且M>0时，为了生成一个整数的索引值来指定4长非正交序列集中的一条，首先需要将比特序列(ai……a0+bm……b0)转化成一个十进制数，0≤i≤39,0≤m≤M；然后，将上述的十进制数对256进行模运算，所得的模值即为索引值。且当本次传输失败时，额外增加的Y个比特的取值在每次重传时都要随机取值。
或者，
当额外增加的比特序列为bM……b0，且M>0时，为了生成一个整数的索引值来指定4长非正交序列集中的一条，首先需要将比特序列(bm……b0)转化成一个十进制数，0≤m≤M；然后，将上述的十进制数对256进行模运算，所得的模值即为索引值。且当本次传输失败时，额外增加的Y个比特的取值在每次重传时都要随机取值。
另一个实施例中，以3元实数集合为例，确定要生成4长的非正交扩展序列，且非正交扩展序列的每一元素为一个复数，且扩展序列中所有元素的实部和虚部的取值均来自于一个3元实数集合，3元实数集合是{-1,0,+1}范围内的奇数组成的集合。
根据比特序列(ai……a0+bm……b0)生成一个整数的索引值，0≤i≤39,0≤m≤M，索引值来自于一个(3×3)4元整数集合，6561元整数集合是[0，6561-1]或[1，6561]范围内的所有整数组成的集合；
为了生成上述的整数的索引值，首先，需要将(ai……a0+bm……b0)转换的十进制数，0≤i≤39,0≤m≤M；然后，将上述的十进制数对6561进行模运算，所得的模值即为索引值。且当本次传输失败时，额外增加的Y个比特的取值在每次重传时都要随机取值。
或者，
当额外增加的比特序列为bM……b0，且(bM……b0)十进制值大于6561 时，为了生成一个整数的索引值来指定4长非正交序列集中的一条，首先需要将比特序列(bm……b0)转化成一个十进制数，0≤m≤M；然后，将上述的十进制数对6561进行模运算，所得的模值即为索引值。且当本次传输失败时，额外增加的Y个比特的取值在每次重传时都要随机取值。
另一个实施例中，以一个3元实数集合为例，确定要生成4长的非正交扩展序列，且非正交扩展序列的每一元素为一个复数，且扩展序列中所有元素的实部和虚部的取值均来自于一个3元实数集合，3元实数集合是[-1,0,+1]范围内的奇数组成的集合，但是此处要求扩展序列中所有元素的实部和虚部不能同时为0。
根据(ai……a0+bm……b0)生成一个整数的索引值，0≤i≤39,0≤m≤M，索引值是来自于一个84元整数集合，4096元整数集合是[0，4096-1]或[1，4096]范围内的所有整数组成的集合；
为了生成上述的整数的索引值，首先，需要将(ai……a0+bm……b0)转换的十进制数，0≤i≤39,0≤m≤M；然后，将上述的十进制数对4096进行模运算，所得的模值即为索引值。且当本次传输失败时，额外增加的Y个比特的取值在每次重传时都要随机取值。
或者，
当额外增加的比特序列为bM……b0，且(bM……b0)十进制值大于4096时，为了生成一个整数的索引值来指定4长非正交序列集中的一条，首先需要将比特序列(bm……b0)转化成一个十进制数，0≤m≤M；然后，将上述的十进制数对4096进行模运算，所得的模值即为索引值。且当本次传输失败时，额外增加的Y个比特的取值在每次重传时都要随机取值。
(2)构造一个4长复数域的非正交序列的集合(表格)；
以一个2元实数集合为例，确定要生成4长的非正交扩展序列，且非正交扩展序列的每一元素为一个复数，且扩展序列中所有元素的实部和虚部的取值均来自于一个2元实数集合，2元实数集合是{-1,+1}范围内的奇数组成的集合。
将所得到的4个复数依次组合得到复数扩展序列，或者，将4个复数乘以相应的能量归一化系数后依次组合得到复数扩展序列。
则此时生成的非正交序列集合中具有(2×2)4条序列。
另一个实施例中，以一个3元实数集合为例，确定要生成4长的非正交扩展序列，且非正交扩展序列的每一元素为一个复数，且扩展序列中所有元素的实部和虚部的取值均来自于一个3元实数集合，3元实数集合是{-1,0,+1}范围内的奇数组成的集合。
将所得到的4个复数依次组合得到复数扩展序列，或者，将4个复数乘以相应的能量归一化系数后依次组合得到复数扩展序列。
则此时生成的非正交序列集合中具有(3×3)4条序列。
另一个实施例中，以一个3元实数集合为例，确定要生成4长的非正交扩展序列，且非正交扩展序列的每一元素为一个复数，且扩展序列中所有元素的实部和虚部的取值均来自于一个3元实数集合，3元实数集合是{-1,0,+1}范围内的奇数组成的集合。
将所得到的4个复数依次组合得到复数扩展序列，或者，将4个复数乘以相应的能量归一化系数后依次组合得到复数扩展序列。
但是此处要求扩展序列中所有元素的实部和虚部不能同时为0，所以此时生成的非正交序列集合中具有(3×3-1)4条序列。
(3)根据(1)中的索引值并且按照预设的映射规则，从(2)中包含(2×2)4条4长非正交序列的集合(表格)中选择一条而成；或者，
根据(1)中的索引值和预设的映射规则，从(2)中包含(3×3)4条的4长非正交序列的集合(表格)中选择一条而成；或者
根据(1)中的索引值和预设的映射规则，从(2)中包含(3×3-1)4条的4长非正交序列的集合(表格)中选择一条而成。
(三)生成8长(或4长)Walsh正交扩展序列C2的一种方法，该方法可以分成以下三个部分：
(1)此处UE_ID是一个40长的0、1二进制比特序列，例如a39a38……a1a0，将此比特序列转换成十进制数，十进制转换方法为：a39×239+a38×238+……+a1×21+a0×20＝A。额外增加的比特序列的长度大于或等于0，每个元素均取值于{0，1}，且额外增加的比特为bM……b0，且M>0。
确定要生成一个序列长度为8(或4)的Walsh正交扩展序列集合，且序列集合中每一个正交序列的每一个元素的取值来均来自于{-1,+1}，且正交序列集中总共有8(或4)条正交序列。
根据要生成一个整数的索引值，该整数的索引值唯一指定了正交序列集中的一个序列，且索引值来自于一个8元(或4元)整数集合，8元(或4元)整数集合是[0，8-1]或[1，8]范围内(或[0，4-1]或[1，4]范围内)的所有整数组成的集合；
当额外增加的比特为bM……b0，且M>0时，为了生成上述的整数序列，首先，需要将比特序列(ai……a0+bm……b0)转化成一个十进制数，0≤m≤M，0≤i≤39然后将所得到的十进制数对8(或4)取模，取模得到值即为整数索引值。且当本次传输失败时，额外增加的Y个比特的取值在每次重传时都要进行4次随机化；
或者
当额外增加的比特为bM……b0，且M>2时，为了生成上述的整数序列，需要将初始值随机选取的比特序列(bm……b0)转化成一个十进制数，0≤m≤M,然后将所得到的十进制数对8(或4)取模，取模得到值即为整数索引值。且当本次传输失败时，额外增加的Y个比特的取值在每次重传时要随机选择。
(2)构造一个包含8条8长(或4条4长)Walsh正交扩展序列的集合(表格)；
例如给出生成8条8长(或4条4长)Walsh序列的一种方法：
例如给出生成8条8长Walsh序列的一种方法：
首先令H2为：
Figure PCTCN2017082532-appb-000021
则H4和H8分别为：
Figure PCTCN2017082532-appb-000022
Figure PCTCN2017082532-appb-000023
其中，由H8中的每行或者每列即可构造出8长的Walsh码序列。
或者，
例如给出生成4条4长Walsh序列的一种方法：
首先令H2为：
Figure PCTCN2017082532-appb-000024
则H4为：
Figure PCTCN2017082532-appb-000025
其中，由H4中的每行或者每列即可构造出4长的Walsh码序列。
(3)根据(1)中的索引值并且按照预设的映射规则，从(2)中包含8条8长(或4条4长)Walsh正交扩展序列的集合(表格)中选择一条而成。
(4)生成8长(或4长)Walsh正交扩展序列C2的另一种方法，该方法可以分成以下两个部分：
(1)构造一个包含8条8长(或4条4长)Walsh正交扩展序列的集 合(表格)；
例如给出生成8条8长(或4条4长)Walsh序列的一种方法：
例如给出生成8条8长Walsh序列的一种方法：
首先令H2为：
Figure PCTCN2017082532-appb-000026
则H4和H8分别为：
Figure PCTCN2017082532-appb-000027
Figure PCTCN2017082532-appb-000028
其中，由H8中的每行或者每列即可构造出8长的Walsh码序列。
或者，
例如给出生成4条4长Walsh序列的一种方法：
首先令H2为：
Figure PCTCN2017082532-appb-000029
则H4为：
Figure PCTCN2017082532-appb-000030
其中，由H4中的每行或者每列即可构造出4长的Walsh码序列。
(2)从(1)中包含8条8长(或4条4长)Walsh正交扩展序列的集合(表格)中随机选择一条而成。
步骤S1304，利用所得到的扩展序列C1和C2对待发送的数据符号进行扩展处理。
将至少包含自己终端身份标识信息的比特序列，通过编码调制，形成N1个调制符号，再加上N2个导频符号，一共N个符号，N＝N1+N2，将的N个符号通过扩展变成L×N个符号。
根据不同的扩展类型，可以分成以下三种情况：
(一)调制符号首先经过4长非正交序列扩展，此扩展后的符号再经过8长的正交序列扩展。如图21所示，调制后的数据符号为Sk，首先将Sk用4长非正交扩展序列C1＝{c11,c12,……c14}进行扩展处理，本步骤中的扩展处理是指Sk与{c11,c12,……c14}中的每个元素(复数符号)进行复数相乘，即得到第一次扩展处理后的数据{Skc11,Skc12,……Skc14}；然后，将第一次扩展后的序列{Skc11,Skc12,……Skc14}的每一个数据与8长(或4长)Walsh正交序列C2＝{c21,c22,……c28}(或C2＝{c21,c22,……c24})进行第二次扩展处理，得到第二次扩展后的数据{Skc11c21,Skc11c22，……Skc11c28，Skc12 c21,Skc12 c22……，Skc12 c28，Skc14 c21……Skc14 c28}(或{Skc11c21,Skc11c22，……Skc11c24，Skc12 c21,Skc12 c22……，Skc12 c24，Skc14 c21……Skc14 c24})。
将调制后的数据符号用复数域非正交扩展序列进行扩展处理，本步骤中的扩展处理是指每个编码调制后的数据符号与4长复数域非正交扩展序列的每个元素(复数符号)进行复数相乘，最终形成与所用4长扩展序列长度相同的复数符号序列。从而得到第一次扩展后的数据序列。
将第一次扩展后的数据序列使用生成的Walsh正交序列进行扩展处理，本步骤中的扩展处理是指将经过4长非正交序列扩展后的数据序列中的每一个元素与正交序列的每个元素进行相乘，最终形成与所用8长扩展序列长度相同的符号序列。
(二)调制符号首先经过8长正交序列扩展，此扩展后的符号再经过4长的非正交序列扩展。如图22所示，调制后的数据符号为Sk，首先将Sk用8长(或4长)Walsh正交序列C1＝{c11,c12,……c18}(或C1＝{c11,c12,…… c14})进行扩展处理，本步骤中的扩展处理是指Sk与{c11,c12,……c18}(或{c11,c12,……c14})中的每个元素(复数符号)进行复数相乘，即得到第一次扩展处理后的数据{Skc11,Skc12,……Skc18}(或{Skc11,Skc12,……Skc14})；然后，将第一次扩展后的序列{Skc11,Skc12,……Skc18}(或{Skc11,Skc12,……Skc14})的每一个数据与4长非正交扩展序列C2＝{c21,c22,……c24}进行第二次扩展处理，得到第二次扩展后的数据{Skc11c21,Skc11c22，……Skc11c24，Skc12 c21,Skc12 c22……，Skc12 c24，Skc18 c21……Skc18 c24}(或{Skc11c21,Skc11c22，……Skc11c24，Skc12 c21,Skc12 c22……，Skc12 c24，Skc14 c21……Skc14c24})。具体的，如下：
将调制后的数据符号用使用生成的8长(或4长)Walsh正交序列进行扩展处理，本步骤中的扩展处理是指每个编码调制后的数据符号与8长正交序列的每个元素进行相乘，最终形成与所用8长(或4长)扩展序列长度相同的符号序列。从而得到第一次扩展后的数据序列。
将第一次扩展后的数据使用生成的4长复数域非正交扩展序列进行扩展处理，本步骤中的扩展处理是指将经过8长(或4长)正交序列扩展后的数据符号与4长复数域非正交扩展序列中的每个元素(复数符号)进行复数相乘，最终形成与所用4长扩展序列长度相同的复数符号序列。
(三)调制符号经过L长的扩展序列进行扩展，其中L长的扩展序列是由L1长正交序列和L2长的非正交序列扩展得到的。如图23所示，调制后的数据符号为Sk，将Sk用L长的扩展序列进行扩展处理，本步骤中的扩展处理是指将Sk与L长序列的每个元素(复数符号)进行复数相乘，最终形成与所用L长扩展序列长度相同的符号序列。
其中，如图24所示，L长序列是一条4长非正交序列被另一条8长(或4长)正交序列扩展而成的；或者，如图25所示，的L长序列是一条8长(或4长)正交序列被另一条4长非正交序列扩展而成的。
的L长序列是一条4长非正交序列被另一条8长(或4长)正交序列扩展而成的，本步骤中的扩展是指将4长非正交序列中每个元素与8长(或 4长)正交序列的每个元素进行相乘，最终形成与所用扩展序列长度相同的符号序列，即所得到的的L长序列为{c11c21,c11c22，……c11c28，c12 c21,c12 c22……c12 c28，……，c14c21……c14 c28}(或{c11c21,c11c22，……c11c24，c12 c21,c12 c22……c12 c24，……，c14c21……c14 c24})；或者是一条8长(或4长)正交序列被另一条4长非正交序列扩展而成的，本步骤中的扩展是指将8长正交序列中每个元素与4长非正交序列的每个元素进行相乘，最终形成与所用扩展序列长度相同的符号序列，即所得到的的L长序列为{c11c21,c11c22，……c11c24，c12 c21,c12 c22……c12 c24，……，c18c21……c18 c24}；(或{c11c21,c11c22，……c11c24，c12 c21,c12 c22……c12 c24，……，c14c21……c14 c24})
最后，使用生成的L长序列进行扩展处理，本步骤中的扩展处理是指每个编码调制后的数据符号与L长序列的每个元素(复数符号)进行复数相乘，最终形成与所用扩展序列长度相同的符号序列。
步骤S1306，将所述扩展后符号通过载波调制(单载波或者多载波调制)转化为相应的载波调制信号。
步骤S1308，发射上述形成的最终的载波调制信号(单载波或者多载波调制信号)。
优选实施例6
终端把“比特序列+1比特(表示其后是否还有数据的指示信息)”经CRC+卷积码编码、调制后，变成144个调制符号，再加入24导频符号(数据加导频符号对应的需要LTE 1个PRB的时频资源来承载)，之后使用一条4长复数域扩展序列，然后再使用8长(或4长)的Walsh正交扩展序列进行扩展(扩展后的符号需要LTE 32(或16)个PRB时频资源来承载)，最后将扩展后的符号使用带CP的OFDM/SC-FDMA/DFT-S-OFDM调制，发送给基站；基站使用先进接收机分离各个终端的信息。
或者，
终端把“比特序列+信息比特+1比特(表示其后是否还有数据的指 示信息)”经CRC+卷积码编码、调制后，变成144个调制符号，再加入24导频符号(数据加导频符号对应的需要LTE 1个PRB的时频资源来承载)，之后使用8长(4长)的Walsh正交扩展序列进行扩展，然后再使用一条4长复数域扩展序列(扩展后的符号需要LTE 32个(或16个)PRB时频资源来承载)，最后将扩展后的符号使用带CP的OFDM/SC-FDMA/DFT-S-OFDM调制，发送给基站；基站使用先进接收机分离各个终端的信息。
或者，
终端把“比特序列+信息比特+1比特(表示其后是否还有数据的指示信息)”经CRC+卷积码编码、调制后，变成144个调制符号，再加入24导频符号(数据加导频符号对应的需要LTE 1个PRB的时频资源来承载)，然后使用一条32长(或16长)的扩展序列对调制符号进行扩展，此32长(或16长)扩展序列由8长(或4长)的Walsh正交扩展序列与4长复数域扩展序列进行扩展所得，最后将扩展后的符号使用带CP的OFDM/SC-FDMA/DFT-S-OFDM调制，发送给基站；基站使用先进接收机分离各个终端的信息。
本公开优选实施例中所额外增加的1比特可以起到标志位的作用。
当发射端将此1比特设置为0时，表示上报的数据无法通过一个数据包完成传输，后续还有数据包需要进行传输；当发射端将此1比特设置为1时，表示上报的数据传输完毕，此包含比特值为1的1比特的数据包为最后一个数据包。
或者，
当发射端将此1比特设置为1时，表示上报的数据无法通过一个数据包完成传输，后续还有数据包需要进行传输；当发射端将此1比特设置为0时，表示上报的数据传输完毕，此包含比特值为1的1比特的数据包是最后一个数据包。
故，此1比特的取值会影响接收机对上报数据的处理流程，如图26 所示，首先，接收机接收多个发射机发射的信号，多个发射机发射的信号是多个发射机分别采用各自的扩展序列对各自待发送的数据符号进行扩展处理，再将生成的扩展后的符号序列分别调制到相同的时频资源上形成的。
然后，接收机根据正确检测出的标志位1比特的值，判断该上报的数据包是否是最后一个数据包，从而可以判断是否要采用先进干扰消除信号检测器对接收的多个发射机发射的信号进行接收检测。
优选实施例7
基站接收天线量较多，例如4根/8根/16或者更多接收天线，这种情况下，终端把“比特序列”经CRC+卷积码编码、调制后，变成N个调制符号，然后使用一条2长复数域二元码扩展，扩展后使用带CP的OFDM/SC-FDMA/DFT-S-OFDM调制，然后发送给基站；基站使用先进接收机分离各个终端的信息。
如图27所示，调制后的数据符号为Sk，用2长非正交扩展序列C1{c11,c12}进行扩展处理，本步骤中的扩展处理是指每个编码调制后的数据符号与2长序列的每个元素(复数符号)进行复数相乘，最终形成与所用扩展序列长度相同的符号序列。扩展之后的数据为{Skc11,Skc12}。
本实施例中只进行了一次非正交扩展，或者，可以设定第二次扩展所用的正交扩展序列的长度为1。
本实施例发射机侧的基于扩展的上行接入方法的流程，包括：
根据比特序列信息确定2长的复数扩展序列,本实施例中终端本身的标识信息UE_ID可以是40长的比特序列，且UE_ID的长度建议大于16，C1是2长复数域二元扩展序列。
比特序列包含终端在网络中标识身份的信息(或者说能表示终端身份的信息，可统一简称为终端身份标识，例如终端本身的标识信息UE_ID的部分或全部信息，或者在网络中的临时标识)的比特序列或者额外增加的比特序列；额外增加的比特序列的长度、取值与终端身份标识信息，或 者传输次数，或者数据包大小，或者时频位置，或者小区配置有关。
根据比特序列信息确定2长的复数扩展序列，按照是否增加额外的比特位以及所增加的比特位的不同作用，分成以下三个方案：
方案一：根据终端身份标识信息确定2长的复数扩展序列，不再额外的增加比特位来引入随机性：
结合本实施例给出的应用场景，更加具体的介绍非正交扩展序列C1：
(一)生成复数域二元扩展序列C1的一种方法，该方法可以分成以下三个部分：
(1)此处UE_ID是一个40长的0、1二进制比特序列，例如a39a38……a1a0，将此比特序列转换成十进制数，十进制转换方法为：a39×239+a38×238+……+a1×21+a0×20＝A。
以2×2整数集合为例，发射机生成一个整数序列的索引值，该整数序列中元素取值均来自于一个4元整数集合{0,1,2,3}，且该整数序列的长度为4。
为了生成上述的整数序列，首先，需要将比特序列ai……a0进行2次的循环移位，0≤i≤39,且每次循环移位的步长可以是0个比特位，或者是正整数个比特位，再利用上述的十进制转化方法，求出每次循环移位后比特序列的十进制数A1、A2。
最后，根据十进制数A1、A2，求出整数序列中每个元素的取值为：A1mod 4、A2mod 4，其中Apmod 4表示对4取模的值，p属于{1,2}，则得到的整数序列{A1mod 4、A2mod 4}。
另一个实施例中，以3×3整数集合为例，发射机生成一个整数序列的索引值，该整数序列的元素取值均来自于一个9元整数集合{0,1,2,……，8,9}，且该整数序列的长度为4。
为了生成上述的整数序列，首先，需要将比特序列ai……a0进行2次的循环移位，且0≤i≤39，且每次循环移位的步长可以是0个比特位,或 者是正整数个比特位，利用上述的十进制转化方法，求出每次循环移位后比特序列的十进制数A1、A2。
最后，根据十进制数A1、A2，求出整数序列中每个元素的取值为：A1mod 9、A2mod 9，其中Apmod 9表示对9取模的值，p属于{1,2}，则得到的整数序列{A1mod 9、A2mod 9}。
另一个实施例中，发射机生成一个整数序列的索引值，该整数序列的元素取值均来自于一个8元整数集合{0,1,2,……，7,8}，且该整数序列的长度为2。
为了生成上述的整数序列，首先，需要将比特序列ai……a0进行2次的循环移位，0≤i≤39,且每次循环移位的步长可以是0个比特位，或者是正整数个比特位，再利用上述的十进制转化方法，求出每次循环移位后比特序列的十进制数A1、A2。
最后，根据十进制数A1、A2，求出整数序列中每个元素的取值为：A1mod 8、A2mod 8，其中Apmod 8表示对8取模的值，p属于{1,2}，则得到的整数序列{A1mod 8、A2mod 8}。
(2)构造与索引值相关联的含有4个复数星座点的星座图。复数星座图中每个星座点的实部和虚部的取值均来自于一个2元实数集合，且此2元实数集合表示为[-1,+1]。
故此4个复数星座点对应的复数分别为-1+j、1+j、-1-j、1-j。
另一个实施例中，构造与索引值相关联的含有9个复数星座点的星座图。复数星座图中每个星座点的实部和虚部的取值均来自于一个3元实数集合，且此3元实数集合表示为[-1,0,+1]。
故此9个复数星座点对应的复数分别为-1+j、1+j、-1-j、1-j、-j、j、-1、+1、0。
另一个实施例中，构造与索引值相关联的含有8个复数星座点的星座图。复数星座图中每个星座点对应的复数分别为-1+j、1+j、-1-j、1-j、-j、j、-1、+1，即不含有0点。
另一个实施例中，构造与索引值相关联的含有8个复数星座点的星座图。复数星座图中每个星座点对应的复数分别为(-1+j)/sqrt(2)、(1+j)/sqrt(2)、(-1-j)/sqrt(2)、(1-j)/sqrt(2)、-j、j、-1、+1，即不含有0点。
(3)根据伪随机的整数序列中的4个元素，按照预设的映射规则从一个4点的复数星座图中选取对应的2个复数星座点；
根据4元整数集合中的元素与4点复数星座图的复数星座点之间的映射关系(如图15所示)把(1)中整数序列的索引值逐位映射到4点复数星座图的复数星座点(每一复数星座点表示一个复数)生成复数扩展序列，用公式表示如下：
Ap—>ComplexSeqp
其中，ComplexSeqp表示复数扩展序列的第p个元素，根据4元整数集合中的元素与4点复数星座图的复数星座点之间的映射关系由Ap映射得到，Ap表示伪随机的整数序列的第p个元素。
根据整数序列索引值，确定4个复数星座点对应的2个复数，将2个复数依次组合得到复数扩展序列，或者，将2个复数乘以相应的能量归一化系数后依次组合得到复数扩展序列。
在另一实施例中，根据9元整数集合中的元素与9点复数星座图的复数星座点之间的映射关系(如图16所示)把(1)中整数序列的索引值逐位映射到9点复数星座图的复数星座点(每一复数星座点表示一个复数)生成复数扩展序列，用公式表示如下：
Ap—>ComplexSeqp
其中，ComplexSeqp表示复数扩展序列的第p个元素，根据9元整数集合中的元素与9点复数星座图的复数星座点之间的映射关系由Ap映射得到，Ap表示伪随机的整数序列的第p个元素。
根据整数序列索引值，确定9个复数星座点对应的2个复数，将2个复数依次组合得到复数扩展序列，或者，将2个复数乘以相应的能量归一化系数后依次组合得到复数扩展序列。
在另一实施例中，根据8元整数集合中的元素与8点复数星座图的复数星座点之间的映射关系(如图17所示)把(1)中整数序列的索引值逐位映射到8点复数星座图的复数星座点(每一复数星座点表示一个复数)生成复数扩展序列，用公式表示如下：
Ap—>ComplexSeqp
其中，ComplexSeqp表示复数扩展序列的第p个元素，根据8元整数集合中的元素与8点复数星座图的复数星座点之间的映射关系由Ap映射得到，Ap表示伪随机的整数序列的第p个元素。
根据整数序列索引值，确定8个复数星座点对应的2个复数，将2个复数依次组合得到复数扩展序列，或者，将2个复数乘以相应的能量归一化系数后依次组合得到复数扩展序列。
在另一实施例中，根据8元整数集合中的元素与8点复数星座图的复数星座点之间的映射关系(如图18所示)把(1)中整数序列的索引值逐位映射到8点复数星座图的复数星座点(每一复数星座点表示一个复数)生成复数扩展序列，用公式表示如下：
Ap—>ComplexSeqp
其中，ComplexSeqp表示复数扩展序列的第p个元素，根据8元整数集合中的元素与8点复数星座图的复数星座点之间的映射关系由Ap映射得到，Ap表示伪随机的整数序列的第p个元素。
根据整数序列索引值，确定8个复数星座点对应的2个复数，将2个复数依次组合得到复数扩展序列，或者，将2个复数乘以相应的能量归一化系数后依次组合得到复数扩展序列。
(二)生成复数域二元扩展序列C1的另一种方法，且该方法可以分成以下三部分：
(1)此处UE_ID是一个40长的0、1二进制比特序列，例如a39a38……a1a0，将此比特序列转换成十进制数，十进制转换方法为：a39×239+a38×238+……+a1×21+a0×20＝A。
以一个2元实数集合为例，确定要生成2长的非正交扩展序列，且非正交扩展序列的每一元素为一个复数，且扩展序列中所有元素的实部和虚部的取值均来自于一个2元实数集合，2元实数集合是[-1,+1]范围内的奇数组成的集合。
根据终端身份标识信息生成一个整数的索引值，索引值来自于一个(2×2)2元整数集合，16元整数集合是[0，16-1]或[1，16]范围内的所有整数组成的集合；
为了生成上述的整数的索引值，首先，需要将比特序列ai……a0转换的十进制数，且0≤i≤39；然后，将上述的十进制数对256进行模运算，所得的模值即为索引值。
另一个实施例中，以3元实数集合为例，确定要生成2长的非正交扩展序列，且非正交扩展序列的每一元素为一个复数，且扩展序列中所有元素的实部和虚部的取值均来自于一个3元实数集合，3元实数集合是[-1,0,+1]范围内的奇数组成的集合。
根据终端身份信息标识生成一个整数的索引值，索引值来自于一个(3×3)2元整数集合，81元整数集合是[0，81-1]或[1，81]范围内的所有整数组成的集合；
为了生成上述的整数的索引值，首先，需要将比特序列ai……a0转换的十进制数,且0≤i≤39；然后，将上述的十进制数对81进行模运算，所得的模值即为索引值。
另一个实施例中，以一个3元实数集合为例，确定要生成2长的非正交扩展序列，且非正交扩展序列的每一元素为一个复数，且扩展序列中所有元素的实部和虚部的取值均来自于一个3元实数集合，3元实数集合是[-1,0,+1]范围内的奇数组成的集合，但是此处要求扩展序列中所有元素的实部和虚部不能同时为0。
根据终端身份标识信息生成一个整数的索引值，索引值是来自于一个82元整数集合，64元整数集合是[0，64-1]或[1，64]范围内的所有整数组 成的集合；
为了生成上述的整数的索引值，首先，需要将比特序列ai……a0转换的十进制数,且0≤i≤39；然后，将上述的十进制数对64进行模运算，所得的模值即为索引值。
(2)构造一个2长复数域的非正交序列的集合(表格)；
以一个2元实数集合为例，确定要生成2长的非正交扩展序列，且非正交扩展序列的每一元素为一个复数，且扩展序列中所有元素的实部和虚部的取值均来自于一个2元实数集合，2元实数集合是[-1,+1]范围内的奇数组成的集合。
将所得到的2个复数依次组合得到复数扩展序列，或者，将2个复数乘以相应的能量归一化系数后依次组合得到复数扩展序列。
则此时生成的非正交序列集合中具有(2×2)2条序列。
另一个实施例中，以一个3元实数集合为例，确定要生成2长的非正交扩展序列，且非正交扩展序列的每一元素为一个复数，且扩展序列中所有元素的实部和虚部的取值均来自于一个3元实数集合，3元实数集合是[-1,0,+1]范围内的奇数组成的集合。
将所得到的2个复数依次组合得到复数扩展序列，或者，将2个复数乘以相应的能量归一化系数后依次组合得到复数扩展序列。
则此时生成的非正交序列集合中具有(3×3)2条序列。
另一个实施例中，以一个3元实数集合为例，确定要生成2长的非正交扩展序列，且非正交扩展序列的每一元素为一个复数，且扩展序列中所有元素的实部和虚部的取值均来自于一个3元实数集合，3元实数集合是[-1,0,+1]范围内的奇数组成的集合。
将所得到的2个复数依次组合得到复数扩展序列，或者，将2个复数乘以相应的能量归一化系数后依次组合得到复数扩展序列。
但是此处要求扩展序列中所有元素的实部和虚部不能同时为0，所以 此时生成的非正交序列集合中具有(3×3-1)2条序列。
(3)根据(1)中的索引值并且按照预设的映射规则，从(2)中包含(2×2)2条2长非正交序列的集合(表格)中选择一条而成；或者，
根据(1)中的索引值和预设的映射规则，从(2)中包含(3×3)2条的2长非正交序列的集合(表格)中选择一条而成；或者
根据(1)中的索引值和预设的映射规则，从(2)中包含(3×3-1)2条的2长非正交序列的集合(表格)中选择一条而成。
方案二：根据额外增加的比特序列(比特序列长度可以大于或等于0)、终端身份标识信息(UE_ID)的一部分比特序列(比特序列长度可以大于或等于0)确定2长的复数扩展。因为额外增加的比特序列的取值在每次重传时，都是随机取值的，所以这额外增加的比特序列可以起到随机化的作用：
结合本实施例给出的应用场景，更加具体的介绍非正交扩展序列C1：
(一)生成复数域二元扩展序列C1的一种方法，该方法可以分成以下三个部分：
(1)此处UE_ID是一个40长的0、1二进制比特序列，例如a39a38……a1a0，将此比特序列转换成十进制数，十进制转换方法为：a39×239+a38×238+……+a1×21+a0×20。额外增加的比特序列的长度大于或等于0，每个元素均取值于{0，1}。
以2×2整数集合为例，发射机生成一个整数序列的索引值，该整数序列中元素取值均来自于一个4元整数集合{0,1,2,3}，且该整数序列的长度为2。
当额外增加的比特为bM……b0，且M>0时，为了生成上述的整数序列，首先，需要将比特序列(ai……a0+bm……b0)进行2次的循环移位，0≤i≤39,0≤m≤M,且每次循环移位的步长可以是0个比特位、或者是 正整数个比特位，再利用上述的十进制转化方法，求出每次循环移位后比特序列的十进制数A1、A2。且当本次传输失败时，额外增加的Y个比特的取值在每次重传时要随机选择，或者额外增加的Y个比特的取值在每次循环移位后都要随机取值；
或者，
当额外增加的比特为bM……b0，且M>0时，为了生成上述的整数序列，首先，需要将比特序列(ai……a0)进行2次的循环移位，0≤i≤39,,且每次循环移位的步长可以是0个比特位、或者是正整数个比特位，再利用上述的十进制转化方法，求出每次循环移位后比特序列的十进制数B1、B2。将比特序列(bm……b0)进行十进制转化，0≤m≤M，将运算的结果分别与B1、B2相加，得到新的4个十进制数A1、A2。且当本次传输失败时，额外增加的Y个比特的取值在每次重传时要随机选择；
或者，
当额外增加的比特为bM……b0，且M>0时，为了生成上述的整数序列，首先，需要将比特序列(ai……a0+bm……b0)中(bm……b0)进行2次随机化取值，0≤i≤39,0≤m≤M,且每次含有随机化比特序列的(ai……a0+bm……b0)序列转化成十进制数A1、A2。且当本次传输失败时，额外增加的Y个比特的取值在每次重传时都要进行4次随机化；
或者
当额外增加的比特为bM……b0，且M>0时，为了生成上述的整数序列，首先，需要将初始值随机选取的比特序列(bm……b0)进行2次的循环移位，或者随机取2次取值，0≤m≤M,且每次循环移位的步长可以是0个比特位、或者是正整数个比特位，再利用上述的十进制转化方法，求出每次循环移位后比特序列的十进制数A1、A2。且当本次传输失败时，额外增加的Y个比特的取值在每次重传时要随机选择。
最后，根据十进制数A1、A2，求出整数序列中每个元素的取值为：A1mod 4、A2mod 4，其中Apmod 4表示对4取模的值，p属于{1,2}，则 得到的整数序列{A1mod 4、A2mod 4}。
另一个实施例中，以3×3整数集合为例，发射机生成一个整数序列的索引值，该整数序列的元素取值均来自于一个9元整数集合{0,1,2,……，8}，且该整数序列的长度为2。
当额外增加的比特为bM……b0，且M>0时，为了生成上述的整数序列，首先，需要将比特序列(ai……a0+bm……b0)进行2次的循环移位，0≤i≤39,0＜m≤M,且每次循环移位的步长可以是0个比特位、或者是正整数个比特位，再利用上述的十进制转化方法，求出每次循环移位后比特序列的十进制数A1、A2。且当本次传输失败时，额外增加的Y个比特的取值在每次重传时要随机选择，，或者额外增加的Y个比特的取值在每次循环移位后都要随机取值；
或者，
当额外增加的比特为bM……b0，且M>0时，为了生成上述的整数序列，首先，需要将比特序列(ai……a0)进行2次的循环移位，0≤i≤39,,且每次循环移位的步长可以是0个比特位、或者是正整数个比特位，再利用上述的十进制转化方法，求出每次循环移位后比特序列的十进制数B1、B2。将比特序列(bm……b0)进行十进制转化，0≤m≤M，将运算的结果分别与B1、B2相加，得到新的2个十进制数A1、A2。且当本次传输失败时，额外增加的Y个比特的取值在每次重传时要随机选择；
或者，
当额外增加的比特为bM……b0，且M>0时，为了生成上述的整数序列，首先，需要将比特序列(ai……a0+bm……b0)中(bm……b0)进行2次随机化取值，0≤i≤39,0≤m≤M,且每次含有随机化比特序列的(ai……a0+bm……b0)序列转化成十进制数A1、A2。且当本次传输失败时，额外增加的Y个比特的取值在每次重传时都要进行2次随机化；
或者
当额外增加的比特为bM……b0，且M>0时，为了生成上述的整数序列，首先，需要将初始值随机选取的比特序列(bm……b0)进行2次的循环移位，或者随机取2次取值，0≤m≤M,且每次循环移位的步长可以是0个比特位、或者是正整数个比特位，再利用上述的十进制转化方法，求出每次循环移位后比特序列的十进制数A1、A2。且当本次传输失败时，额外增加的Y个比特的取值在每次重传时要随机选择。
最后，根据十进制数A1、A2，求出整数序列中每个元素的取值为：A1mod 9、A2mod 9，其中Apmod 9表示对9取模的值，p属于{1,2}。
另一个实施例中，发射机生成一个整数序列的索引值，该整数序列的元素取值均来自于一个8元整数集合{0,1,2,……，7}，且该整数序列的长度为4。
当额外增加的比特为bM……b0，且M>0时，为了生成上述的整数序列，首先，需要将比特序列(ai……a0+bm……b0)进行2次的循环移位，0≤i≤39,0≤m≤M,且每次循环移位的步长可以是0个比特位、或者是正整数个比特位，再利用上述的十进制转化方法，求出每次循环移位后比特序列的十进制数A1、A2。且当本次传输失败时，额外增加的Y个比特的取值在每次重传时要随机选择，或者额外增加的Y个比特的取值在每次循环移位后都要随机取值；
或者，
当额外增加的比特为bM……b0，且M>0时，为了生成上述的整数序列，首先，需要将比特序列(ai……a0)进行2次的循环移位，0≤i≤39,,且每次循环移位的步长可以是0个比特位、或者是正整数个比特位，再利用上述的十进制转化方法，求出每次循环移位后比特序列的十进制数B1、B2。将比特序列(bm……b0)进行十进制转化，0≤m≤M，将运算的结果分别与B1、B2相加，得到新的2个十进制数A1、A2。且当本次传输失败时，额外增加的Y个比特的取值在每次重传时要随机选择；
或者，
当额外增加的比特为bM……b0，且M>1时，为了生成上述的整数序列，首先，需要将比特序列(ai……a0+bm……b0)中(bm……b0)进行2次随机化取值，0≤i≤39,0≤m≤M,且每次含有随机化比特序列的(ai……a0+bm……b0)序列转化成十进制数A1、A2。且当本次传输失败时，额外增加的Y个比特的取值在每次重传时都要进行4次随机化；
或者
当额外增加的比特为bM……b0，且M>1时，为了生成上述的整数序列，首先，需要将初始值随机选取的比特序列(bm……b0)进行2次的循环移位，或者随机取2次取值，0≤m≤M,且每次循环移位的步长可以是0个比特位、或者是正整数个比特位，再利用上述的十进制转化方法，求出每次循环移位后比特序列的十进制数A1、A2。且当本次传输失败时，额外增加的Y个比特的取值在每次重传时要随机选择。
最后，根据十进制数A1、A2，求出整数序列中每个元素的取值为：A1mod 8、A2mod 8，其中Apmod 8表示对8取模的值，p属于{1,2}。
(2)构造与索引值相关联的含有4个复数星座点的星座图。复数星座图中每个星座点的实部和虚部的取值均来自于一个2元实数集合，且此2元实数集合表示为[-1,+1]。
故此4个复数星座点对应的复数分别为-1+j、1+j、-1-j、1-j。
另一个实施例中，构造与索引值相关联的含有9个复数星座点的星座图。复数星座图中每个星座点的实部和虚部的取值均来自于一个3元实数集合，且此3元实数集合表示为[-1,0,+1]。
故此9个复数星座点对应的复数分别为-1+j、1+j、-1-j、1-j、-j、j、-1、+1、0。
另一个实施例中，构造与索引值相关联的含有8个复数星座点的星座 图。复数星座图中每个星座点对应的复数分别为-1+j、1+j、-1-j、1-j、-j、j、-1、+1，即不含有0点。
另一个实施例中，构造与索引值相关联的含有8个复数星座点的星座图。复数星座图中每个星座点对应的复数分别为(-1+j)/sqrt(2)、(1+j)/sqrt(2)、(-1-j)/sqrt(2)、(1-j)/sqrt(2)、-j、j、-1、+1，即不含有0点。
(3)根据伪随机的整数序列中的4个元素，按照预设的映射规则从一个4点的复数星座图中选取对应的4个复数星座点；
根据4元整数集合中的元素与4点复数星座图的复数星座点之间的映射关系(如图15所示)把(1)中整数序列的索引值逐位映射到4点复数星座图的复数星座点(每一复数星座点表示一个复数)生成复数扩展序列，用公式表示如下：
Ap—>ComplexSeqp
其中，ComplexSeqp表示复数扩展序列的第p个元素，根据4元整数集合中的元素与4点复数星座图的复数星座点之间的映射关系由Ap映射得到，Ap表示伪随机的整数序列的第p个元素。
根据整数序列索引值，确定4个复数星座点对应的2个复数，将2个复数依次组合得到复数扩展序列，或者，将2个复数乘以相应的能量归一化系数后依次组合得到复数扩展序列。
在另一实施例中，根据9元整数集合中的元素与9点复数星座图的复数星座点之间的映射关系(如图16所示)把(1)中整数序列的索引值逐位映射到9点复数星座图的复数星座点(每一复数星座点表示一个复数)生成复数扩展序列，用公式表示如下：
Ap—>ComplexSeqp
其中，ComplexSeqp表示复数扩展序列的第p个元素，根据9元整数集合中的元素与9点复数星座图的复数星座点之间的映射关系由Ap映射得到，Ap表示伪随机的整数序列的第p个元素。
根据整数序列索引值，确定9个复数星座点对应的2个复数，将2个复数依次组合得到复数扩展序列，或者，将2个复数乘以相应的能量归一化系数后依次组合得到复数扩展序列。
在另一实施例中，根据8元整数集合中的元素与8点复数星座图的复数星座点之间的映射关系(如图17所示)把(1)中整数序列的索引值逐位映射到8点复数星座图的复数星座点(每一复数星座点表示一个复数)生成复数扩展序列，用公式表示如下：
Ap—>ComplexSeqp
其中，ComplexSeqp表示复数扩展序列的第p个元素，根据8元整数集合中的元素与8点复数星座图的复数星座点之间的映射关系由Ap映射得到，Ap表示伪随机的整数序列的第p个元素。
根据整数序列索引值，确定8个复数星座点对应的2个复数，将2个复数依次组合得到复数扩展序列，或者，将2个复数乘以相应的能量归一化系数后依次组合得到复数扩展序列。
在另一实施例中，根据8元整数集合中的元素与8点复数星座图的复数星座点之间的映射关系(如图18所示)把(1)中整数序列的索引值逐位映射到8点复数星座图的复数星座点(每一复数星座点表示一个复数)生成复数扩展序列，用公式表示如下：
Ap—>ComplexSeqp
其中，ComplexSeqp表示复数扩展序列的第p个元素，根据8元整数集合中的元素与8点复数星座图的复数星座点之间的映射关系由Ap映射得到，Ap表示伪随机的整数序列的第p个元素。
根据整数序列索引值，确定8个复数星座点对应的2个复数，将2个复数依次组合得到复数扩展序列，或者，将2个复数乘以相应的能量归一化系数后依次组合得到复数扩展序列。
(二)生成复数域二元扩展序列C1的另一种方法，且该方法可以分成以下三部分：
(1)此处UE_ID是一个40长的0、1二进制比特序列，例如a39a38……a1a0，将此比特序列转换成十进制数，十进制转换方法为：a39×239+a38×238+……+a1×21+a0×20＝A。额外增加的比特序列的长度大于或等于0，每个元素均取值于{0，1}，且额外增加的比特为bM……b0，且M>0。
以一个2元实数集合为例，确定要生成2长的非正交扩展序列，且非正交扩展序列的每一元素为一个复数，且扩展序列中所有元素的实部和虚部的取值均来自于一个2元实数集合，2元实数集合是{-1,+1}范围内的奇数组成的集合，则对于2长的非正交序列集中共有16条非正交序列。
为此要生成一个整数的索引值，根据该索引值可以唯一指定非正交序列集中的一条非正交序列，且索引值来自于一个(2×2)2元整数集合，16元整数集合是[0，16-1]或[1，16]范围内的所有整数组成的集合；
当额外增加的比特为bM……b0，且M>0时，为了生成一个整数的索引值来指定2长非正交序列集中的一条，首先需要将比特序列(ai……a0+bm……b0)转化成一个十进制数，0≤i≤39,0＜m≤M；然后，将上述的十进制数对16进行模运算，所得的模值即为索引值。且当本次传输失败时，额外增加的Y个比特的取值在每次重传时都要随机取值。
或者，
当额外增加的比特序列为bM……b0，且M>0时，为了生成一个整数的索引值来指定2长非正交序列集中的一条，首先需要将比特序列(bm……b0)转化成一个十进制数，0＜m≤M；然后，将上述的十进制数对16进行模运算，所得的模值即为索引值。且当本次传输失败时，额外增加的Y个比特的取值在每次重传时都要随机取值。
另一个实施例中，以3元实数集合为例，确定要生成2长的非正交扩展序列，且非正交扩展序列的每一元素为一个复数，且扩展序列中所有元素的实部和虚部的取值均来自于一个3元实数集合，3元实数集合是[-1,0,+1]范围内的奇数组成的集合。
根据比特序列(ai……a0+bm……b0)生成一个整数的索引值，0≤i≤39,0≤m≤M，索引值来自于一个(3×3)2元整数集合，81元整数集合是[0，81-1]或[1，81]范围内的所有整数组成的集合；
为了生成上述的整数的索引值，首先，需要将(ai……a0+bm……b0)转换的十进制数，0≤i≤39,0≤m≤M；然后，将上述的十进制数对81进行模运算，所得的模值即为索引值。且当本次传输失败时，额外增加的Y个比特的取值在每次重传时都要随机取值。
或者，
当额外增加的比特序列为bM……b0，且(bM……b0)十进制值大于81时，为了生成一个整数的索引值来指定2长非正交序列集中的一条，首先需要将比特序列(bm……b0)转化成一个十进制数，0≤m≤M；然后，将上述的十进制数对81进行模运算，所得的模值即为索引值。且当本次传输失败时，额外增加的Y个比特的取值在每次重传时都要随机取值。
另一个实施例中，以一个3元实数集合为例，确定要生成2长的非正交扩展序列，且非正交扩展序列的每一元素为一个复数，且扩展序列中所有元素的实部和虚部的取值均来自于一个3元实数集合，3元实数集合是[-1,0,+1]范围内的奇数组成的集合，但是此处要求扩展序列中所有元素的实部和虚部不能同时为0。
根据(ai……a0+bm……b0)生成一个整数的索引值，0≤i≤39,0≤m≤M，索引值是来自于一个64元整数集合，64元整数集合是[0，64-1]或[1，64]范围内的所有整数组成的集合；
为了生成上述的整数的索引值，首先，需要将(ai……a0+bm……b0)转换的十进制数，0≤i≤39,0≤m≤M；然后，将上述的十进制数对64进行模运算，所得的模值即为索引值。且当本次传输失败时，额外增加的Y个比特的取值在每次重传时都要随机取值。
或者，
当额外增加的比特序列为bM……b0，且(bM……b0)十进制值大于64 时，为了生成一个整数的索引值来指定2长非正交序列集中的一条，首先需要将比特序列(bm……b0)转化成一个十进制数，0≤m≤M；然后，将上述的十进制数对64进行模运算，所得的模值即为索引值。且当本次传输失败时，额外增加的Y个比特的取值在每次重传时都要随机取值。
(2)构造一个4长复数域的非正交序列的集合(表格)；
以一个2元实数集合为例，确定要生成2长的非正交扩展序列，且非正交扩展序列的每一元素为一个复数，且扩展序列中所有元素的实部和虚部的取值均来自于一个2元实数集合，2元实数集合是{-1,+1}范围内的奇数组成的集合。
将所得到的2个复数依次组合得到复数扩展序列，或者，将2个复数乘以相应的能量归一化系数后依次组合得到复数扩展序列。
则此时生成的非正交序列集合中具有(2×2)2条序列。
另一个实施例中，以一个3元实数集合为例，确定要生成2长的非正交扩展序列，且非正交扩展序列的每一元素为一个复数，且扩展序列中所有元素的实部和虚部的取值均来自于一个3元实数集合，3元实数集合是{-1,0,+1}范围内的奇数组成的集合。
将所得到的2个复数依次组合得到复数扩展序列，或者，将2个复数乘以相应的能量归一化系数后依次组合得到复数扩展序列。
则此时生成的非正交序列集合中具有(3×3)2条序列。
另一个实施例中，以一个3元实数集合为例，确定要生成2长的非正交扩展序列，且非正交扩展序列的每一元素为一个复数，且扩展序列中所有元素的实部和虚部的取值均来自于一个3元实数集合，3元实数集合是{-1,0,+1}范围内的奇数组成的集合。
将所得到的2个复数依次组合得到复数扩展序列，或者，将2个复数乘以相应的能量归一化系数后依次组合得到复数扩展序列。
但是此处要求扩展序列中所有元素的实部和虚部不能同时为0，所以 此时生成的非正交序列集合中具有(3×3-1)2条序列。
(3)根据(1)中的索引值并且按照预设的映射规则，从(2)中包含(2×2)2条4长非正交序列的集合(表格)中选择一条而成；或者，
根据(1)中的索引值和预设的映射规则，从(2)中包含(3×3)2条的4长非正交序列的集合(表格)中选择一条而成；或者
根据(1)中的索引值和预设的映射规则，从(2)中包含(3×3-1)2条的4长非正交序列的集合(表格)中选择一条而成。
方案三：根据额外增加的比特序列(比特序列长度可以大于或等于0)、终端身份标识信息(UE_ID)的一部分比特序列(比特序列长度可以大于或等于0)确定2长的复数扩展序列。额外增加的比特序列的取值指定了循环移位的起始位置，且额外增加的比特序列的取值在每次重传时，可以随机选择，也可以依次增加：
结合本实施例给出的应用场景，更加具体的介绍非正交扩展序列C1、正交扩展序列C2的生成过程：
(一)生成复数域二元扩展序列C1的一种方法，该方法可以分成以下三个部分：
(1)此处UE_ID是一个40长的0、1二进制比特序列，例如a39a38……a1a0，将此比特序列转换成十进制数，十进制转换方法为：a39×239+a38×238+……+a1×21+a0×20。额外增加的比特序列的长度大于或等于0，每个元素均取值于{0，1}。
以2×2整数集合为例，发射机生成一个整数序列的索引值，该整数序列中元素取值均来自于一个4元整数集合{0,1,2,3}，且该整数序列的长度为2。
当额外增加的比特为bM……b0，且M>0时，为了生成上述的整数序列，首先，需要将比特序列(ai……a0+bm……b0)进行2次的循环移位， 0≤i≤39,0≤m≤M,且每次循环移位的步长可以是0个比特位、或者是正整数个比特位，再利用上述的十进制转化方法，求出每次循环移位后比特序列的十进制数A1、A2。额外增加的比特序列的取值指定了循环移位的起始位置，且当本次传输失败时，额外增加的Y个比特的取值在每次重传时可以随机选取，也可以依次增加；如果是额外增加的比特的取值在每次重传时采取依次增加，那么当本次传输成功后，需要将额外增加的比特的取值清零。
最后，根据十进制数A1、A2，求出整数序列中每个元素的取值为：A1mod 4、A2mod 4，其中Apmod 4表示对4取模的值，p属于{1,2}，则得到的整数序列{A1mod 4、A2mod 4}。
另一个实施例中，以3×3整数集合为例，发射机生成一个整数序列的索引值，该整数序列的元素取值均来自于一个9元整数集合{0,1,2,……，8}，且该整数序列的长度为2。
当额外增加的比特为bM……b0，且M>0时，为了生成上述的整数序列，首先，需要将比特序列(ai……a0+bm……b0)进行2次的循环移位，0≤i≤39,0≤m≤M,且每次循环移位的步长可以是0个比特位、或者是正整数个比特位，再利用上述的十进制转化方法，求出每次循环移位后比特序列的十进制数A1、A2。额外增加的比特序列的取值指定了循环移位的起始位置，且当本次传输失败时，额外增加的Y个比特的取值在每次重传时可以随机选取，也可以依次增加；如果是额外增加的比特的取值在每次重传时采取依次增加，那么当本次传输成功后，需要将额外增加的比特的取值清零。
最后，根据十进制数A1、A2，求出整数序列中每个元素的取值为：A1mod 9、A2mod 9，其中Apmod 9表示对9取模的值，p属于{1,2}。
另一个实施例中，发射机生成一个整数序列的索引值，该整数序列的 元素取值均来自于一个8元整数集合{0,1,2,……，7}，且该整数序列的长度为2。
当额外增加的比特为bM……b0，且M>0时，为了生成上述的整数序列，首先，需要将比特序列(ai……a0+bm……b0)进行2次的循环移位，0≤i≤39,0≤m≤M,且每次循环移位的步长可以是0个比特位、或者是正整数个比特位，再利用上述的十进制转化方法，求出每次循环移位后比特序列的十进制数A1、A2。额外增加的比特序列的取值指定了循环移位的起始位置，且当本次传输失败时，额外增加的Y个比特的取值在每次重传时可以随机选取，也可以依次增加；如果是额外增加的比特的取值在每次重传时采取依次增加，那么当本次传输成功后，需要将额外增加的比特的取值清零。
最后，根据十进制数A1、A2，求出整数序列中每个元素的取值为：A1mod 8、A2mod 8，其中Apmod 8表示对8取模的值，p属于{1,2}。
(2)构造与索引值相关联的含有4个复数星座点的星座图。复数星座图中每个星座点的实部和虚部的取值均来自于一个2元实数集合，且此2元实数集合表示为[-1,+1]。
故此4个复数星座点对应的复数分别为-1+j、1+j、-1-j、1-j。
另一个实施例中，构造与索引值相关联的含有9个复数星座点的星座图。复数星座图中每个星座点的实部和虚部的取值均来自于一个3元实数集合，且此3元实数集合表示为[-1,0,+1]。
故此9个复数星座点对应的复数分别为-1+j、1+j、-1-j、1-j、-j、j、-1、+1、0。
另一个实施例中，构造与索引值相关联的含有8个复数星座点的星座图。复数星座图中每个星座点对应的复数分别为-1+j、1+j、-1-j、1-j、-j、j、-1、+1，即不含有0点。
另一个实施例中，构造与索引值相关联的含有8个复数星座点的星座图。复数星座图中每个星座点对应的复数分别为(-1+j)/sqrt(2)、(1+j)/sqrt(2)、 (-1-j)/sqrt(2)、(1-j)/sqrt(2)、-j、j、-1、+1，即不含有0点。
(3)根据伪随机的整数序列中的2个元素，按照预设的映射规则从一个4点的复数星座图中选取对应的4个复数星座点；
根据4元整数集合中的元素与4点复数星座图的复数星座点之间的映射关系(如图15所示)把(1)中整数序列的索引值逐位映射到4点复数星座图的复数星座点(每一复数星座点表示一个复数)生成复数扩展序列，用公式表示如下：
Ap—>ComplexSeqp
其中，ComplexSeqp表示复数扩展序列的第p个元素，根据4元整数集合中的元素与4点复数星座图的复数星座点之间的映射关系由Ap映射得到，Ap表示伪随机的整数序列的第i个元素。
根据整数序列索引值，确定4个复数星座点对应的2个复数，将2个复数依次组合得到复数扩展序列，或者，将2个复数乘以相应的能量归一化系数后依次组合得到复数扩展序列。
在另一实施例中，根据9元整数集合中的元素与9点复数星座图的复数星座点之间的映射关系(如图16所示)把(1)中整数序列的索引值逐位映射到9点复数星座图的复数星座点(每一复数星座点表示一个复数)生成复数扩展序列，用公式表示如下：
Ap—>ComplexSeqp
其中，ComplexSeqp表示复数扩展序列的第p个元素，根据9元整数集合中的元素与9点复数星座图的复数星座点之间的映射关系由Ap映射得到，Ap表示伪随机的整数序列的第p个元素。
根据整数序列索引值，确定9个复数星座点对应的2个复数，将2个复数依次组合得到复数扩展序列，或者，将2个复数乘以相应的能量归一化系数后依次组合得到复数扩展序列。
在另一实施例中，根据8元整数集合中的元素与8点复数星座图的复 数星座点之间的映射关系(如图17所示)把(1)中整数序列的索引值逐位映射到8点复数星座图的复数星座点(每一复数星座点表示一个复数)生成复数扩展序列，用公式表示如下：
Ap—>ComplexSeqp
其中，ComplexSeqp表示复数扩展序列的第p个元素，根据8元整数集合中的元素与8点复数星座图的复数星座点之间的映射关系由Ap映射得到，Ap表示伪随机的整数序列的第p个元素。
根据整数序列索引值，确定8个复数星座点对应的2个复数，将2个复数依次组合得到复数扩展序列，或者，将2个复数乘以相应的能量归一化系数后依次组合得到复数扩展序列。
在另一实施例中，根据8元整数集合中的元素与8点复数星座图的复数星座点之间的映射关系(如图18所示)把(1)中整数序列的索引值逐位映射到8点复数星座图的复数星座点(每一复数星座点表示一个复数)生成复数扩展序列，用公式表示如下：
Ap—>ComplexSeqp
其中，ComplexSeqp表示复数扩展序列的第p个元素，根据8元整数集合中的元素与8点复数星座图的复数星座点之间的映射关系由Ap映射得到，Ap表示伪随机的整数序列的第p个元素。
根据整数序列索引值，确定8个复数星座点对应的2个复数，将2个复数依次组合得到复数扩展序列，或者，将2个复数乘以相应的能量归一化系数后依次组合得到复数扩展序列。
(二)生成复数域二元扩展序列C1的另一种方法，且该方法可以分成以下三部分：
(1)此处UE_ID是一个40长的0、1二进制比特序列，例如a39a38……a1a0，将此比特序列转换成十进制数，十进制转换方法为：a39×239+a38×238+……+a1×21+a0×20＝A。额外增加的比特序列的长度大于或等于0，每个元素均取值于{0，1}，且额外增加的比特为bM……b0，且M>0。
以一个2元实数集合为例，确定要生成2长的非正交扩展序列，且非正交扩展序列的每一元素为一个复数，且扩展序列中所有元素的实部和虚部的取值均来自于一个2元实数集合，2元实数集合是{-1,+1}范围内的奇数组成的集合，则对于2长的非正交序列集中共有16条非正交序列。
为此要生成一个整数的索引值，根据该索引值可以唯一指定非正交序列集中的一条非正交序列，且索引值来自于一个(2×2)2元整数集合，16元整数集合是[0，16-1]或[1，16]范围内的所有整数组成的集合；
当额外增加的比特为bM……b0，且M>0时，为了生成一个整数的索引值来指定2长非正交序列集中的一条，首先需要将比特序列(ai……a0+bm……b0)转化成一个十进制数，0≤i≤39,0≤m≤M；然后，将上述的十进制数对16进行模运算，所得的模值即为索引值。且当本次传输失败时，额外增加的Y个比特的取值在每次重传时都要随机取值。
或者，
当额外增加的比特序列为bM……b0，且M>3时，为了生成一个整数的索引值来指定2长非正交序列集中的一条，首先需要将比特序列(bm……b0)转化成一个十进制数，0≤m≤M；然后，将上述的十进制数对16进行模运算，所得的模值即为索引值。且当本次传输失败时，额外增加的Y个比特的取值在每次重传时都要随机取值。
另一个实施例中，以3元实数集合为例，确定要生成2长的非正交扩展序列，且非正交扩展序列的每一元素为一个复数，且扩展序列中所有元素的实部和虚部的取值均来自于一个3元实数集合，3元实数集合是{-1,0,+1}范围内的奇数组成的集合。
根据比特序列(ai……a0+bm……b0)生成一个整数的索引值，0≤i≤39,0≤m≤M，索引值来自于一个(3×3)2元整数集合，81元整数集合是[0，81-1]或[1，81]范围内的所有整数组成的集合；
为了生成上述的整数的索引值，首先，需要将(ai……a0+bm……b0)转换的十进制数，0≤i≤39,0≤m≤M；然后，将上述的十进制数对81 进行模运算，所得的模值即为索引值。且当本次传输失败时，额外增加的Y个比特的取值在每次重传时都要随机取值。
或者，
当额外增加的比特序列为bM……b0，且(bM……b0)十进制值大于81时，为了生成一个整数的索引值来指定2长非正交序列集中的一条，首先需要将比特序列(bm……b0)转化成一个十进制数，0≤m≤M；然后，将上述的十进制数对81进行模运算，所得的模值即为索引值。且当本次传输失败时，额外增加的Y个比特的取值在每次重传时都要随机取值。
另一个实施例中，以一个3元实数集合为例，确定要生成2长的非正交扩展序列，且非正交扩展序列的每一元素为一个复数，且扩展序列中所有元素的实部和虚部的取值均来自于一个3元实数集合，3元实数集合是[-1,0,+1]范围内的奇数组成的集合，但是此处要求扩展序列中所有元素的实部和虚部不能同时为0。
根据(ai……a0+bm……b0)生成一个整数的索引值，0≤i≤39,0≤m≤M，索引值是来自于一个64元整数集合，64元整数集合是[0，64-1]或[1，64]范围内的所有整数组成的集合；
为了生成上述的整数的索引值，首先，需要将(ai……a0+bm……b0)转换的十进制数，0≤i≤39,0≤m≤M；然后，将上述的十进制数对64进行模运算，所得的模值即为索引值。且当本次传输失败时，额外增加的Y个比特的取值在每次重传时都要随机取值。
或者，
当额外增加的比特序列为bM……b0，且(bM……b0)十进制值大于64时，为了生成一个整数的索引值来指定2长非正交序列集中的一条，首先需要将比特序列(bm……b0)转化成一个十进制数，0≤m≤M；然后，将上述的十进制数对64进行模运算，所得的模值即为索引值。且当本次传输失败时，额外增加的Y个比特的取值在每次重传时都要随机取值。
(2)构造一个2长复数域的非正交序列的集合(表格)；
以一个2元实数集合为例，确定要生成2长的非正交扩展序列，且非正交扩展序列的每一元素为一个复数，且扩展序列中所有元素的实部和虚部的取值均来自于一个2元实数集合，2元实数集合是{-1,+1}范围内的奇数组成的集合。
将所得到的2个复数依次组合得到复数扩展序列，或者，将2个复数乘以相应的能量归一化系数后依次组合得到复数扩展序列。
则此时生成的非正交序列集合中具有(2×2)2条序列。
另一个实施例中，以一个3元实数集合为例，确定要生成2长的非正交扩展序列，且非正交扩展序列的每一元素为一个复数，且扩展序列中所有元素的实部和虚部的取值均来自于一个3元实数集合，3元实数集合是{-1,0,+1}范围内的奇数组成的集合。
将所得到的2个复数依次组合得到复数扩展序列，或者，将2个复数乘以相应的能量归一化系数后依次组合得到复数扩展序列。
则此时生成的非正交序列集合中具有(3×3)2条序列。
另一个实施例中，以一个3元实数集合为例，确定要生成2长的非正交扩展序列，且非正交扩展序列的每一元素为一个复数，且扩展序列中所有元素的实部和虚部的取值均来自于一个3元实数集合，3元实数集合是{-1,0,+1}范围内的奇数组成的集合。
将所得到的2个复数依次组合得到复数扩展序列，或者，将2个复数乘以相应的能量归一化系数后依次组合得到复数扩展序列。
但是此处要求扩展序列中所有元素的实部和虚部不能同时为0，所以此时生成的非正交序列集合中具有(3×3-1)2条序列。
(3)根据(1)中的索引值并且按照预设的映射规则，从(2)中包含(2×2)2条2长非正交序列的集合(表格)中选择一条而成；或者，
根据(1)中的索引值和预设的映射规则，从(2)中包含(3×3)2条的2长非正交序列的集合(表格)中选择一条而成；或者
根据(1)中的索引值和预设的映射规则，从(2)中包含(3×3-1)2条的2长非正交序列的集合(表格)中选择一条而成。
然后，利用所得到的非正交扩展序列C1对待发送的数据符号进行扩展处理：将至少包含自己终端标识信息的比特序列，通过编码调制，形成N1个调制符号，再加上N2个导频符号，一共N个符号，N＝N1+N2，将的N个符号通过扩展变成2×N个符号。
例如，调制后的数据符号为Sk，首先将Sk用2长非正交扩展序列C1＝{c11,c12}进行扩展处理，本步骤中的扩展处理是指Sk与{c11,c12}中的每个元素(复数符号)进行复数相乘，即得到第一次扩展处理后的数据{Skc11,Skc12}。
最后，将扩展后符号通过载波调制(单载波或者多载波调制)转化为相应的载波调制信号。发射上述形成的最终的载波调制信号(单载波或者多载波调制信号)。
优选实施例8
基站接收天线量较多，例如4根/8根/16或者更多接收天线，这种情况下，终端把“比特序列”经CRC+卷积码编码、调制后，变成N个调制符号，然后使用带CP的OFDM/SC-FDMA/DFT-S-OFDM调制，然后发送给基站；基站使用先进接收机分离各个终端的信息。这种情况相当于发射侧不需要扩展。
如图28所示，调制后的数据符号为Sk，用长度为1的扩展序列对其进行扩展；或者，调制后的数据符号Sk没有进行扩展处理，直接通过载波调制(单载波或者多载波调制)转化为相应的载波调制信号。
优选实施例9：两次非正交序列扩展：
本实施例提供了一种基于扩展的上行接入方法：
其发射机侧对信号处理过程：终端把“比特序列”经CRC+卷积码编码、调制后，变成144个调制符号，再加入24导频符号(数据加导频符号对应的需要LTE 1个PRB的时频资源来承载)，之后使用一条4长复数 域扩展序列，然后再使用8长(或4长)的非正交扩展序列进行扩展(扩展后的符号需要LTE 32个(或16个)PRB时频资源来承载)，最后将扩展后的符号使用带CP的OFDM/SC-FDMA/DFT-S-OFDM调制，发送给基站；基站使用先进接收机分离各个终端的信息。或者，
其发射机侧对信号处理过程：终端把“比特序列”经CRC+卷积码编码、调制后，变成144个调制符号，再加入24导频符号(数据加导频符号对应的需要LTE 1个PRB的时频资源来承载)，之后使用8长(或4长)的非正交扩展序列进行扩展，然后再使用一条4长复数域扩展序列(扩展后的符号需要LTE 32个(或16个)PRB时频资源来承载)，最后将扩展后的符号使用带CP的OFDM/SC-FDMA/DFT-S-OFDM调制，发送给基站；基站使用先进接收机分离各个终端的信息。或者，
其发射机侧对信号处理过程：终端把“比特序列”经CRC+卷积码编码、调制后，变成144个调制符号，再加入24导频符号(数据加导频符号对应的需要LTE 1个PRB的时频资源来承载)，然后使用一条32长的扩展序列对调制符号进行扩展，此32长(或16长)扩展序列由8长(或4长)的非正交扩展序列与4长复数域扩展序列进行扩展所得，最后将扩展后的符号使用带CP的OFDM/SC-FDMA/DFT-S-OFDM调制，发送给基站；基站使用先进接收机分离各个终端的信息。或者，
其发射机侧对信号处理过程：终端把“比特序列”经CRC+卷积码编码、调制后，变成144个调制符号，再加入24导频符号(数据加导频符号对应的需要LTE 1个PRB的时频资源来承载)，之后使用一条4长复数域扩展序列，最后将扩展后的符号使用带CP的OFDM/SC-FDMA/DFT-S-OFDM调制，发送给基站；基站使用先进接收机分离各个终端的信息。
本实施例发射机侧的基于扩展的上行接入方法的流程，包括：
步骤110，根据比特序列信息确定4长的复数扩展序列或8长(或4长)的非正交扩展序列。本实施例中终端本身的标识信息UE_ID可以是40长的比特序列，且UE_ID的长度建议大于16，C1是4长复数域二元扩展序列，C2是8长(或4长)的非正交扩展序列，C2中元素的值取值于{+1， -1}。
所述比特序列包含终端在网络中标识身份的信息(或者说能表示终端身份的信息，可统一简称为终端身份标识，例如终端本身的标识信息UE_ID的部分或全部信息，或者在网络中的临时标识)的比特序列或者额外增加的比特序列；所述额外增加的比特序列的长度、取值与终端身份标识信息，或者传输次数，或者数据包大小，或者时频位置，或者小区配置有关。
根据比特序列信息确定4长的复数扩展序列或8长(或4长)的非正交扩展序列，按照是否增加额外的比特位以及所增加的比特位的不同作用，分成以下三个方案：
方案一：根据终端身份标识信息确定4长的复数扩展序列或8长(或4长)的非正交扩展序列,不利用额外的增加比特位用来引入随机性：
结合本实施例给出的应用场景，更加具体的介绍非正交扩展序列C1、C2的生成过程：
(一)生成复数域二元扩展序列C1的一种方法，该方法可以分成以下三个部分：
(1)此处UE_ID是一个40长的0、1二进制比特序列，例如a39a38……a1a0，将此比特序列转换成十进制数，十进制转换方法为：a39*239+a38*238+……+a1*21+a0*20＝A。
以2*2整数集合为例，发射机生成一个整数序列的索引值，该整数序列中元素取值均来自于一个4元整数集合{0,1,2,3}，且该整数序列的长度为4。
为了生成上述的整数序列，首先，需要将比特序列(ai……a0)进行4次的循环移位，0≤i≤39，且每次循环移位的步长可以是0个比特位，或者是正整数个比特位，再利用上述的十进制转化方法，求出每次循环移位后比特序列的十进制数A1、A2、A3和A4。
最后，根据十进制数A1、A2、A3和A4，求出所述整数序列中每个元素的取值为：A1mod 4、A2mod 4、A3mod 4和A4mod 4，其中Apmod 4表示对4取模的值，p属于{1,2,3,4}，则得到所述的整数序列{A1mod 4、 A2mod 4、A3mod 4、A4mod 4}。。
另一个实施例中，以3*3整数集合为例，发射机生成一个整数序列的索引值，该整数序列的元素取值均来自于一个9元整数集合{0,1,2,……，8,9}，且该整数序列的长度为4。
为了生成上述的整数序列，首先，需要将比特序列ai……a0进行4次的循环移位，0≤i≤39，且每次循环移位的步长可以是0个比特位,或者是正整数个比特位，利用上述的十进制转化方法，求出每次循环移位后比特序列的十进制数A1、A2、A3和A4。
最后，根据十进制数A1、A2、A3和A4，求出所述整数序列中每个元素的取值为：A1mod 9、A2mod 9、A3mod 9和A4mod 9，其中Apmod 9表示对9取模的值，p属于{1,2,3,4}，则得到所述的整数序列{A1mod 9、A2mod 9、A3mod 9、A4mod 9}。。
另一个实施例中，发射机生成一个整数序列的索引值，该整数序列的元素取值均来自于一个8元整数集合{0,1,2,……，7,8}，且该整数序列的长度为4。
为了生成上述的整数序列，首先，需要将比特序列ai……a0进行4次的循环移位，0≤i≤39,且每次循环移位的步长可以是0个比特位，或者是正整数个比特位，再利用上述的十进制转化方法，求出每次循环移位后比特序列的十进制数A1、A2、A3和A4。
最后，根据十进制数A1、A2、A3和A4，求出所述整数序列中每个元素的取值为：A1mod 8、A2mod 8、A3mod 8和A4mod 8，其中Apmod 8表示对8取模的值，p属于{1,2,3,4}，则得到所述的整数序列{A1mod 8、A2mod 8、A3mod 8、A4mod 8}。。
(2)构造与索引值相关联的含有4个复数星座点的星座图。所述复数星座图中每个星座点的实部和虚部的取值均来自于一个2元实数集合，且此2元实数集合表示为[-1,+1]。
故此4个复数星座点对应的复数分别为-1+j、1+j、-1-j、1-j。
另一个实施例中，构造与索引值相关联的含有9个复数星座点的星座图。所述复数星座图中每个星座点的实部和虚部的取值均来自于一个3元实数集合，且此3元实数集合表示为[-1,0,+1]。
故此9个复数星座点对应的复数分别为-1+j、1+j、-1-j、1-j、-j、j、-1、+1、0。
另一个实施例中，构造与索引值相关联的含有8个复数星座点的星座图。所述复数星座图中每个星座点对应的复数分别为-1+j、1+j、-1-j、1-j、-j、j、-1、+1，即不含有0点。
另一个实施例中，构造与索引值相关联的含有8个复数星座点的星座图。所述复数星座图中每个星座点对应的复数分别为(-1+j)/sqrt(2)、(1+j)/sqrt(2)、(-1-j)/sqrt(2)、(1-j)/sqrt(2)、-j、j、-1、+1，即不含有0点。
(3)根据所述伪随机的整数序列中的4个元素，按照预设的映射规则从一个4点的复数星座图中选取对应的4个复数星座点；
根据4元整数集合中的元素与4点复数星座图的复数星座点之间的映射关系(如图16所示)把(1)中整数序列的索引值逐位映射到4点复数星座图的复数星座点(每一复数星座点表示一个复数)生成复数扩展序列，用公式表示如下：
Ap—>ComplexSeqp
其中，ComplexSeqp表示复数扩展序列的第p个元素，根据4元整数集合中的元素与4点复数星座图的复数星座点之间的映射关系由Ap映射得到，Ap表示伪随机的整数序列的第p个元素。
根据整数序列索引值，确定所述4个复数星座点对应的4个复数，将所述4个复数依次组合得到所述复数扩展序列，或者，将所述4个复数乘以相应的能量归一化系数后依次组合得到所述复数扩展序列。
在另一实施例中，根据9元整数集合中的元素与9点复数星座图的复 数星座点之间的映射关系(如图17所示)把(1)中整数序列的索引值逐位映射到9点复数星座图的复数星座点(每一复数星座点表示一个复数)生成复数扩展序列，用公式表示如下：
Ap—>ComplexSeqp
其中，ComplexSeqp表示复数扩展序列的第p个元素，根据9元整数集合中的元素与9点复数星座图的复数星座点之间的映射关系由Ap映射得到，Ap表示伪随机的整数序列的第p个元素。
根据整数序列索引值，确定所述9个复数星座点对应的4个复数，将所述4个复数依次组合得到所述复数扩展序列，或者，将所述4个复数乘以相应的能量归一化系数后依次组合得到所述复数扩展序列。
在另一实施例中，根据8元整数集合中的元素与8点复数星座图的复数星座点之间的映射关系(如图18所示)把(1)中整数序列的索引值逐位映射到8点复数星座图的复数星座点(每一复数星座点表示一个复数)生成复数扩展序列，用公式表示如下：
Ap—>ComplexSeqp
其中，ComplexSeqp表示复数扩展序列的第p个元素，根据8元整数集合中的元素与8点复数星座图的复数星座点之间的映射关系由Ap映射得到，Ap表示伪随机的整数序列的第p个元素。
根据整数序列索引值，确定所述8个复数星座点对应的4个复数，将所述4个复数依次组合得到所述复数扩展序列，或者，将所述4个复数乘以相应的能量归一化系数后依次组合得到所述复数扩展序列。
在另一实施例中，根据8元整数集合中的元素与8点复数星座图的复数星座点之间的映射关系(如图19所示)把(1)中整数序列的索引值逐位映射到8点复数星座图的复数星座点(每一复数星座点表示一个复数)生成复数扩展序列，用公式表示如下：
Ap—>ComplexSeqp
其中，ComplexSeqi表示复数扩展序列的第p个元素，根据8元整数集合中的元素与8点复数星座图的复数星座点之间的映射关系由Ap映射得到，Ap表示伪随机的整数序列的第p个元素。
根据整数序列索引值，确定所述8个复数星座点对应的4个复数，将所述4个复数依次组合得到所述复数扩展序列，或者，将所述4个复数乘以相应的能量归一化系数后依次组合得到所述复数扩展序列。
(二)生成复数域二元扩展序列C1的另一种方法，且该方法可以分成以下三部分：
(1)此处UE_ID是一个40长的0、1二进制比特序列，例如a39a38……a1a0，将此比特序列转换成十进制数，十进制转换方法为：a39*239+a38*238+……+a1*21+a0*20＝A。
以一个2元实数集合为例，确定要生成4长的非正交扩展序列，且所述非正交扩展序列的每一元素为一个复数，且所述扩展序列中所有元素的实部和虚部的取值均来自于一个2元实数集合，所述2元实数集合是[-1,+1]范围内的奇数组成的集合。
根据UE_ID生成一个整数的索引值，所述索引值来自于一个(2*2)4元整数集合，所述256元整数集合是[0，256-1]或[1，256]范围内的所有整数组成的集合；
为了生成上述的整数的索引值，首先，需要将比特序列ai……a0转换的十进制数，且0≤i≤39；然后，将上述的十进制数对256进行模运算，所得的模值即为索引值。
另一个实施例中，以3元实数集合为例，确定要生成4长的非正交扩展序列，且所述非正交扩展序列的每一元素为一个复数，且所述扩展序列中所有元素的实部和虚部的取值均来自于一个3元实数集合，所述3元实数集合是[-1,0,+1]范围内的奇数组成的集合。
根据UE_ID生成一个整数的索引值，所述索引值来自于一个(3*3)4元整数集合，所述6561元整数集合是[0，6561-1]或[1，6561]范围内的所有整数组成的集合；
为了生成上述的整数的索引值，首先，需要将比特序列ai……a0转换的十进制数,且0≤i≤39；然后，将上述的十进制数对6561进行模运算，所得的模值即为索引值。
另一个实施例中，以一个3元实数集合为例，确定要生成4长的非正交扩展序列，且所述非正交扩展序列的每一元素为一个复数，且所述扩展序列中所有元素的实部和虚部的取值均来自于一个3元实数集合，所述3元实数集合是[-1,0,+1]范围内的奇数组成的集合，但是此处要求所述扩展序列中所有元素的实部和虚部不能同时为0。
根据UE_ID生成一个整数的索引值，所述索引值是来自于一个84元整数集合，所述4096元整数集合是[0，4096-1]或[1，4096]范围内的所有整数组成的集合；
为了生成上述的整数的索引值，首先，需要将比特序列ai……a0转换的十进制数,且0≤i≤39；然后，将上述的十进制数对4096进行模运算，所得的模值即为索引值。
(2)构造一个4长复数域的非正交序列的集合(表格)；
以一个2元实数集合为例，确定要生成4长的非正交扩展序列，且所述非正交扩展序列的每一元素为一个复数，且所述扩展序列中所有元素的实部和虚部的取值均来自于一个2元实数集合，所述2元实数集合是[-1,+1]范围内的奇数组成的集合。
将所得到的4个复数依次组合得到所述复数扩展序列，或者，将所述4个复数乘以相应的能量归一化系数后依次组合得到所述复数扩展序列。
则此时生成的非正交序列集合中具有(2*2)4条序列。
另一个实施例中，以一个3元实数集合为例，确定要生成4长的非正交扩展序列，且所述非正交扩展序列的每一元素为一个复数，且所述扩展序列中所有元素的实部和虚部的取值均来自于一个3元实数集合，所述3元实数集合是[-1,0,+1]范围内的奇数组成的集合。
将所得到的4个复数依次组合得到所述复数扩展序列，或者，将所述 4个复数乘以相应的能量归一化系数后依次组合得到所述复数扩展序列。
则此时生成的非正交序列集合中具有(3*3)4条序列。
另一个实施例中，以一个3元实数集合为例，确定要生成4长的非正交扩展序列，且所述非正交扩展序列的每一元素为一个复数，且所述扩展序列中所有元素的实部和虚部的取值均来自于一个3元实数集合，所述3元实数集合是[-1,0,+1]范围内的奇数组成的集合。
将所得到的4个复数依次组合得到所述复数扩展序列，或者，将所述4个复数乘以相应的能量归一化系数后依次组合得到所述复数扩展序列。
但是此处要求所述扩展序列中所有元素的实部和虚部不能同时为0，所以此时生成的非正交序列集合中具有(3*3-1)4条序列。
(3)根据(1)中的索引值并且按照预设的映射规则，从(2)中包含(2*2)4条4长非正交序列的集合(表格)中选择一条而成；或者，
根据(1)中的索引值和预设的映射规则，从(2)中包含(3*3)4条的4长非正交序列的集合(表格)中选择一条而成；或者
根据(1)中的索引值和预设的映射规则，从(2)中包含(3*3-1)4条的4长非正交序列的集合(表格)中选择一条而成。
(三)生成8长(或4长)非正交扩展序列C2的一种方法，该方法可以分成以下三个部分：
(1)此处UE_ID是一个40长的0、1二进制比特序列，例如a39a38……a1a0，将此比特序列转换成十进制数，十进制转换方法为：a39*239+a38*238+……+a1*21+a0*20＝A。
确定要生成一个序列长度为8(或4)的非正交扩展序列集合，且所述序列集合中每一个非正交序列的每一个元素的取值来均来自于{-1,+1}，且非正交序列集中总共有16条(或8条)非正交序列。
根据UE_ID生成一个整数的索引值，所述索引值来自于一个16元(或8元)整数集合，所述16元(或8元)整数集合是[0，16-1]或[1，16]范围(或[0，8-1]或[1，8]范围)内的所有整数组成的集合；
为了生成上述的整数的索引值，首先，需要将ai……a0转换成十进制数，且0≤i≤39；然后，将上述的十进制数对16(或8)进行模运算，所得的模值即为索引值。
(2)构造一个包含16条8长(或8条4长)非正交扩展序列的集合(表格)；
例如给出生成16条8长(或8条4长)非正交序列的一种方法：
首先得到由8长正价序列集组成的8长8列的矩阵：
Figure PCTCN2017082532-appb-000031
之后将正交的H8矩阵点乘一个8长的列矩阵，且此8长的列矩阵中的每一个元素的取值均取自于{+1，-1}，例如其中一个8长的列矩阵为：
Figure PCTCN2017082532-appb-000032
即而：H16＝[H8 H8·A0]
其中，由H16中的每列的集合就是1条8长非正交序列集合。
或者，
首先得到由4长正价序列集组成的4长4列的矩阵：
Figure PCTCN2017082532-appb-000033
之后将正交的H4矩阵点乘一个4长的列矩阵，且此4长的列矩阵中的每一个元素的取值均取自于{+1，-1}，例如其中一个4长的列矩阵为：
Figure PCTCN2017082532-appb-000034
即而：H8＝[H4 H4·A1]
其中，由H8中的每列的集合就是1条4长非正交序列集合。
(3)根据(1)中的索引值并且按照预设的映射规则，从(2)中包含16条8长(或者8条4长)非正交扩展序列的集合(表格)中选择一条而成。
(四)生成8长(或4长)非正交扩展序列C2的另一种方法，该方法可以分成以下两个部分：
(1)构造一个包含16条8长(或者8条4长)非正交扩展序列的集合(表格)；
例如给出生成16条8长(或者8条4长)非正交序列的一种方法：
首先得到由8长正价序列集组成的8长8列的矩阵：
Figure PCTCN2017082532-appb-000035
之后将正交的H8矩阵点乘一个8长的列矩阵，且此8长的列矩阵中的每一个元素的取值均取自于{+1，-1}，例如其中一个8长的列矩阵为：
Figure PCTCN2017082532-appb-000036
即而：H16＝[H8 H8·A0]
其中，由H16中的每列的集合就是1条8长非正交序列集合。
或者，
首先得到由4长正价序列集组成的4长4列的矩阵：
Figure PCTCN2017082532-appb-000037
之后将正交的H4矩阵点乘一个4长的列矩阵，且此4长的列矩阵中的每一个元素的取值均取自于{+1，-1}，例如其中一个4长的列矩阵为：
Figure PCTCN2017082532-appb-000038
即而：H8＝[H4 H4·A1]
其中，由H8中的每列的集合就是1条4长非正交序列集合。
(2)从(1)中包含16条8长(或8条4长)非正交扩展序列的集合(表格)中随机选择一条而成。
方案二：根据额外增加的比特序列(比特序列长度可以大于或等于0)、终端身份标识信息的比特序列(比特序列长度可以大于或等于0)确定4长的复数扩展序列或8长(或4长)非正交扩展序列。因为额外增加的比特序列的取值在每次重传时，都是随机取值的，所以这额外增加的比特序列可以起到随机化的作用：
结合本实施例给出的应用场景，更加具体的介绍非正交扩展序列C1、C2的生成过程：
(一)生成复数域二元扩展序列C1的一种方法，该方法可以分成以下三个部分：
(1)此处UE_ID是一个40长的0、1二进制比特序列，例如a39a38……a1a0，将此比特序列转换成十进制数，十进制转换方法为：a39*239+a38*238+……+a1*21+a0*20。额外增加的比特序列的长度大于或等于0，每个元素均取值于{0，1}。
以2*2整数集合为例，发射机生成一个整数序列的索引值，该整数序列中元素取值均来自于一个4元整数集合{0,1,2,3}，且该整数序列的长度为4。
当额外增加的比特为bM……b0，且M>0时，为了生成上述的整数序列，首先，需要将比特序列(ai……a0+bm……b0)进行4次的循环移位，0≤i≤39,0≤m≤M,且每次循环移位的步长可以是0个比特位、或者是正整数个比特位，再利用上述的十进制转化方法，求出每次循环移位后比特序列的十进制数A1、A2、A3和A4。且当本次传输失败时，额外增加的Y个比特的取值在每次重传时要随机选择；
或者，
当额外增加的比特为bM……b0，且M>0时，为了生成上述的整数序列，首先，需要将比特序列(ai……a0)进行4次的循环移位，0≤i≤39,,且每次循环移位的步长可以是0个比特位、或者是正整数个比特位，再利用上述的十进制转化方法，求出每次循环移位后比特序列的十进制数B1、B2、B3和B4。将比特序列(bm……b0)进行十进制转化，0≤m≤M，将运算的结果与B1、B2、B3和B4相加，得到新的4个十进制数A1、A2、A3和A4。且当本次传输失败时，额外增加的Y个比特的取值在每次重传时要随机选择；
或者，
当额外增加的比特为bM……b0，且M>0时，为了生成上述的整数序列，首先，需要将比特序列(ai……a0+bm……b0)中(bm……b0)进行4次随机化取值，0≤i≤39,0≤m≤M,且每次含有随机化比特序列的(ai……a0+bm……b0)序列转化成十进制数A1、A2、A3和A4。且当本次传输失败时，额外增加的Y个比特的取值在每次重传时都要进行4次随机化；
或者
当额外增加的比特为bM……b0，且M>0时，为了生成上述的整数序列，首先，需要将初始值随机选取的比特序列(bm……b0)进行4次的循环移位，并且每次随机取4次取值，0≤m≤M,且每次循环移位的步长可以是0个比特位、或者是正整数个比特位，再利用上述的十进制转化方法，求出每次循环移位后比特序列的十进制数A1、A2、A3和A4。且当本次传输失败时，额外增加的Y个比特的取值在每次重传时要随机选择。
最后，根据十进制数A1、A2、A3和A4，求出所述整数序列中每个元素的取值为：A1mod 4、A2mod 4、A3mod 4和A4mod 4，其中Apmod 4表示对4取模的值，p属于{1,2,3,4}，则得到所述的整数序列{A1mod 4、A2mod 4、A3mod 4、A4mod 4}。
另一个实施例中，以3*3整数集合为例，发射机生成一个整数序列的索引值，该整数序列的元素取值均来自于一个9元整数集合{0,1,2,……，8,9}，且该整数序列的长度为4。
当额外增加的比特为bM……b0，且M>0时，为了生成上述的整数序列，首先，需要将比特序列(ai……a0+bm……b0)进行4次的循环移位，0≤i≤39,0＜m≤M,且每次循环移位的步长可以是0个比特位、或者是正整数个比特位，再利用上述的十进制转化方法，求出每次循环移位后比特序列的十进制数A1、A2、A3和A4。且当本次传输失败时，额外增加的Y个比特的取值在每次重传时要随机选择；
或者，
当额外增加的比特为bM……b0，且M>0时，为了生成上述的整数序列，首先，需要将比特序列(ai……a0)进行4次的循环移位，0≤i≤39,,且每次循环移位的步长可以是0个比特位、或者是正整数个比特位，再利用上述的十进制转化方法，求出每次循环移位后比特序列的十进制数B1、B2、B3和B4。将比特序列(bm……b0)进行十进制转化，0≤m≤M，将运算的结果与B1、B2、B3和B4相加，得到新的4个十进制数A1、A2、A3和A4。且当本次传输失败时，额外增加的Y个比特的取值在每次重传时要随机选择；
或者，
当额外增加的比特为bM……b0，且M>0时，为了生成上述的整数序列，首先，需要将比特序列(ai……a0+bm……b0)中(bm……b0)进行4次随机化取值，0≤i≤39,0≤m≤M,且每次含有随机化比特序列的(ai……a0+bm……b0)序列转化成十进制数A1、A2、A3和A4。且当本次传输失败时， 额外增加的Y个比特的取值在每次重传时都要进行4次随机化；
或者
当额外增加的比特为bM……b0，且M>0时，为了生成上述的整数序列，首先，需要将初始值随机选取的比特序列(bm……b0)进行4次的循环移位，并且每次随机取4次取值，0≤m≤M,且每次循环移位的步长可以是0个比特位、或者是正整数个比特位，再利用上述的十进制转化方法，求出每次循环移位后比特序列的十进制数A1、A2、A3和A4。且当本次传输失败时，额外增加的Y个比特的取值在每次重传时要随机选择。
最后，根据十进制数A1、A2、A3和A4，求出所述整数序列中每个元素的取值为：A1mod 9、A2mod 9、A3mod 9和A4mod 9，其中Apmod 9表示对9取模的值，p属于{1,2,3,4}。
另一个实施例中，发射机生成一个整数序列的索引值，该整数序列的元素取值均来自于一个8元整数集合{0,1,2,……，7,8}，且该整数序列的长度为4。
当额外增加的比特为bM……b0，且M>0时，为了生成上述的整数序列，首先，需要将比特序列(ai……a0+bm……b0)进行4次的循环移位，0≤i≤39,0≤m≤M,且每次循环移位的步长可以是0个比特位、或者是正整数个比特位，再利用上述的十进制转化方法，求出每次循环移位后比特序列的十进制数A1、A2、A3和A4。且当本次传输失败时，额外增加的Y个比特的取值在每次重传时要随机选择；
或者，
当额外增加的比特为bM……b0，且M>0时，为了生成上述的整数序列，首先，需要将比特序列(ai……a0)进行4次的循环移位，0≤i≤39,,且每次循环移位的步长可以是0个比特位、或者是正整数个比特位，再利用上述的十进制转化方法，求出每次循环移位后比特序列的十进制数B1、B2、B3和B4。将比特序列(bm……b0)进行十进制转化，0≤m≤M，将运 算的结果与B1、B2、B3和B4相加，得到新的4个十进制数A1、A2、A3和A4。且当本次传输失败时，额外增加的Y个比特的取值在每次重传时要随机选择；
或者，
当额外增加的比特为bM……b0，且M>0时，为了生成上述的整数序列，首先，需要将比特序列(ai……a0+bm……b0)中(bm……b0)进行4次随机化取值，0≤i≤39,0≤m≤M,且每次含有随机化比特序列的(ai……a0+bm……b0)序列转化成十进制数A1、A2、A3和A4。且当本次传输失败时，额外增加的Y个比特的取值在每次重传时都要进行4次随机化；
或者
当额外增加的比特为bM……b0，且M>0时，为了生成上述的整数序列，首先，需要将初始值随机选取的比特序列(bm……b0)进行4次的循环移位，并且每次随机取4次取值，0≤m≤M,且每次循环移位的步长可以是0个比特位、或者是正整数个比特位，再利用上述的十进制转化方法，求出每次循环移位后比特序列的十进制数A1、A2、A3和A4。且当本次传输失败时，额外增加的Y个比特的取值在每次重传时要随机选择。
最后，根据十进制数A1、A2、A3和A4，求出所述整数序列中每个元素的取值为：A1mod 8、A2mod 8、A3mod 8和A4mod 8，其中Apmod 8表示对8取模的值，p属于{1,2,3,4}。
(2)构造与索引值相关联的含有4个复数星座点的星座图。所述复数星座图中每个星座点的实部和虚部的取值均来自于一个2元实数集合，且此2元实数集合表示为[-1,+1]。
故此4个复数星座点对应的复数分别为-1+j、1+j、-1-j、1-j。
另一个实施例中，构造与索引值相关联的含有9个复数星座点的星座图。所述复数星座图中每个星座点的实部和虚部的取值均来自于一个3元实数集合，且此3元实数集合表示为[-1,0,+1]。
故此9个复数星座点对应的复数分别为-1+j、1+j、-1-j、1-j、-j、j、-1、+1、0。
另一个实施例中，构造与索引值相关联的含有8个复数星座点的星座图。所述复数星座图中每个星座点对应的复数分别为-1+j、1+j、-1-j、1-j、-j、j、-1、+1，即不含有0点。
另一个实施例中，构造与索引值相关联的含有8个复数星座点的星座图。所述复数星座图中每个星座点对应的复数分别为(-1+j)/sqrt(2)、(1+j)/sqrt(2)、(-1-j)/sqrt(2)、(1-j)/sqrt(2)、-j、j、-1、+1，即不含有0点。
(3)根据所述伪随机的整数序列中的4个元素，按照预设的映射规则从一个4点的复数星座图中选取对应的4个复数星座点；
根据4元整数集合中的元素与4点复数星座图的复数星座点之间的映射关系(如图16所示)把(1)中整数序列的索引值逐位映射到4点复数星座图的复数星座点(每一复数星座点表示一个复数)生成复数扩展序列，用公式表示如下：
Ap—>ComplexSeqp
其中，ComplexSeqp表示复数扩展序列的第p个元素，根据4元整数集合中的元素与4点复数星座图的复数星座点之间的映射关系由Ap映射得到，Ap表示伪随机的整数序列的第p个元素。
根据整数序列索引值，确定所述4个复数星座点对应的4个复数，将所述4个复数依次组合得到所述复数扩展序列，或者，将所述4个复数乘以相应的能量归一化系数后依次组合得到所述复数扩展序列。
在另一实施例中，根据9元整数集合中的元素与9点复数星座图的复数星座点之间的映射关系(如图17所示)把(1)中整数序列的索引值逐位映射到9点复数星座图的复数星座点(每一复数星座点表示一个复数)生成复数扩展序列，用公式表示如下：
Ap—>ComplexSeqp
其中，ComplexSeqp表示复数扩展序列的第p个元素，根据9元整数集合中的元素与9点复数星座图的复数星座点之间的映射关系由Ap映射得到，Ap表示伪随机的整数序列的第p个元素。
根据整数序列索引值，确定所述9个复数星座点对应的4个复数，将所述4个复数依次组合得到所述复数扩展序列，或者，将所述4个复数乘以相应的能量归一化系数后依次组合得到所述复数扩展序列。
在另一实施例中，根据8元整数集合中的元素与8点复数星座图的复数星座点之间的映射关系(如图18所示)把(1)中整数序列的索引值逐位映射到8点复数星座图的复数星座点(每一复数星座点表示一个复数)生成复数扩展序列，用公式表示如下：
Ap—>ComplexSeqp
其中，ComplexSeqp表示复数扩展序列的第p个元素，根据8元整数集合中的元素与8点复数星座图的复数星座点之间的映射关系由Ap映射得到，Ap表示伪随机的整数序列的第p个元素。
根据整数序列索引值，确定所述8个复数星座点对应的4个复数，将所述4个复数依次组合得到所述复数扩展序列，或者，将所述4个复数乘以相应的能量归一化系数后依次组合得到所述复数扩展序列。
在另一实施例中，根据8元整数集合中的元素与8点复数星座图的复数星座点之间的映射关系(如图19所示)把(1)中整数序列的索引值逐位映射到8点复数星座图的复数星座点(每一复数星座点表示一个复数)生成复数扩展序列，用公式表示如下：
Ap—>ComplexSeqp
其中，ComplexSeqi表示复数扩展序列的第p个元素，根据8元整数集合中的元素与8点复数星座图的复数星座点之间的映射关系由Ap映射得到，Ap表示伪随机的整数序列的第p个元素。
根据整数序列索引值，确定所述8个复数星座点对应的4个复数，将所述4个复数依次组合得到所述复数扩展序列，或者，将所述4个复数乘以相应的能量归一化系数后依次组合得到所述复数扩展序列。
(二)生成复数域二元扩展序列C1的另一种方法，且该方法可以分成以下三部分：
(1)此处UE_ID是一个40长的0、1二进制比特序列，例如a39a38……a1a0，将此比特序列转换成十进制数，十进制转换方法为：a39*239+a38*238+……+a1*21+a0*20＝A。额外增加的比特序列的长度大于或等于0，每个元素均取值于{0，1}，且额外增加的比特为bM……b0，且M>0。
以一个2元实数集合为例，确定要生成4长的非正交扩展序列，且所述非正交扩展序列的每一元素为一个复数，且所述扩展序列中所有元素的实部和虚部的取值均来自于一个2元实数集合，所述2元实数集合是{-1,+1}范围内的奇数组成的集合，则对于4长的非正交序列集中共有44条非正交序列。
为此要生成一个整数的索引值，根据该索引值可以唯一指定非正交序列集中的一条非正交序列，且所述索引值来自于一个(2*2)4元整数集合，所述256元整数集合是[0，256-1]或[1，256]范围内的所有整数组成的集合；
当额外增加的比特为bM……b0，且M>0时，为了生成一个整数的索引值来指定4长非正交序列集中的一条，首先需要将比特序列(ai……a0+bm……b0)转化成一个十进制数，0≤i≤39,0＜m≤M；然后，将上述的十进制数对256进行模运算，所得的模值即为索引值。且当本次传输失败时，额外增加的Y个比特的取值在每次重传时都要随机取值。
或者，
当额外增加的比特序列为bM……b0，且M>0时，为了生成一个整数的索引值来指定4长非正交序列集中的一条，首先需要将比特序列(bm……b0)转化成一个十进制数，0＜m≤M；然后，将上述的十进制数对256进行模运算，所得的模值即为索引值。且当本次传输失败时，额外增加的Y个 比特的取值在每次重传时都要随机取值。
另一个实施例中，以3元实数集合为例，确定要生成4长的非正交扩展序列，且所述非正交扩展序列的每一元素为一个复数，且所述扩展序列中所有元素的实部和虚部的取值均来自于一个3元实数集合，所述3元实数集合是[-1,0,+1]范围内的奇数组成的集合。
根据比特序列(ai……a0+bm……b0)生成一个整数的索引值，0≤i≤39,0≤m≤M，所述索引值来自于一个(3*3)4元整数集合，所述6561元整数集合是[0，6561-1]或[1，6561]范围内的所有整数组成的集合；
为了生成上述的整数的索引值，首先，需要将(ai……a0+bm……b0)转换的十进制数，0≤i≤39,0≤m≤M；然后，将上述的十进制数对6561进行模运算，所得的模值即为索引值。且当本次传输失败时，额外增加的Y个比特的取值在每次重传时都要随机取值。
或者，
当额外增加的比特序列为bM……b0，且(bM……b0)十进制值大于6561时，为了生成一个整数的索引值来指定4长非正交序列集中的一条，首先需要将比特序列(bm……b0)转化成一个十进制数，0≤m≤M；然后，将上述的十进制数对6561进行模运算，所得的模值即为索引值。且当本次传输失败时，额外增加的Y个比特的取值在每次重传时都要随机取值。
另一个实施例中，以一个3元实数集合为例，确定要生成4长的非正交扩展序列，且所述非正交扩展序列的每一元素为一个复数，且所述扩展序列中所有元素的实部和虚部的取值均来自于一个3元实数集合，所述3元实数集合是[-1,0,+1]范围内的奇数组成的集合，但是此处要求所述扩展序列中所有元素的实部和虚部不能同时为0。
根据(ai……a0+bm……b0)生成一个整数的索引值，0≤i≤39,0≤m≤M，所述索引值是来自于一个84元整数集合，所述4096元整数集合是[0，4096-1]或[1，4096]范围内的所有整数组成的集合；
为了生成上述的整数的索引值，首先，需要将(ai……a0+bm……b0) 转换的十进制数，0≤i≤39,0≤m≤M；然后，将上述的十进制数对4096进行模运算，所得的模值即为索引值。且当本次传输失败时，额外增加的Y个比特的取值在每次重传时都要随机取值。
或者，
当额外增加的比特序列为bM……b0，且(bM……b0)十进制值大于4096时，为了生成一个整数的索引值来指定4长非正交序列集中的一条，首先需要将比特序列(bm……b0)转化成一个十进制数，0≤m≤M；然后，将上述的十进制数对4096进行模运算，所得的模值即为索引值。且当本次传输失败时，额外增加的Y个比特的取值在每次重传时都要随机取值。
(2)构造一个4长复数域的非正交序列的集合(表格)；
以一个2元实数集合为例，确定要生成4长的非正交扩展序列，且所述非正交扩展序列的每一元素为一个复数，且所述扩展序列中所有元素的实部和虚部的取值均来自于一个2元实数集合，所述2元实数集合是{-1,+1}范围内的奇数组成的集合。
将所得到的4个复数依次组合得到所述复数扩展序列，或者，将所述4个复数乘以相应的能量归一化系数后依次组合得到所述复数扩展序列。
则此时生成的非正交序列集合中具有(2*2)4条序列。
另一个实施例中，以一个3元实数集合为例，确定要生成4长的非正交扩展序列，且所述非正交扩展序列的每一元素为一个复数，且所述扩展序列中所有元素的实部和虚部的取值均来自于一个3元实数集合，所述3元实数集合是{-1,0,+1}范围内的奇数组成的集合。
将所得到的4个复数依次组合得到所述复数扩展序列，或者，将所述4个复数乘以相应的能量归一化系数后依次组合得到所述复数扩展序列。
则此时生成的非正交序列集合中具有(3*3)4条序列。
另一个实施例中，以一个3元实数集合为例，确定要生成4长的非正交扩展序列，且所述非正交扩展序列的每一元素为一个复数，且所述扩展 序列中所有元素的实部和虚部的取值均来自于一个3元实数集合，所述3元实数集合是{-1,0,+1}范围内的奇数组成的集合。
将所得到的4个复数依次组合得到所述复数扩展序列，或者，将所述4个复数乘以相应的能量归一化系数后依次组合得到所述复数扩展序列。
但是此处要求所述扩展序列中所有元素的实部和虚部不能同时为0，所以此时生成的非正交序列集合中具有(3*3-1)4条序列。
(3)根据(1)中的索引值并且按照预设的映射规则，从(2)中包含(2*2)4条4长非正交序列的集合(表格)中选择一条而成；或者，
根据(1)中的索引值和预设的映射规则，从(2)中包含(3*3)4条的4长非正交序列的集合(表格)中选择一条而成；或者
根据(1)中的索引值和预设的映射规则，从(2)中包含(3*3-1)4条的4长非正交序列的集合(表格)中选择一条而成。
(三)生成8长(或4长)非正交扩展序列C2的一种方法，该方法可以分成以下三个部分：
(1)此处UE_ID是一个40长的0、1二进制比特序列，例如a39a38……a1a0，将此比特序列转换成十进制数，十进制转换方法为：a39*239+a38*238+……+a1*21+a0*20＝A。额外增加的比特序列的长度大于或等于0，每个元素均取值于{0，1}，且额外增加的比特为bM……b0，且M>0。
确定要生成一个序列长度为8(或4)的非正交扩展序列集合，且所述序列集合中每一个非正交序列的每一个元素的取值来均来自于{-1,+1}，且非正交序列集中总共有16条(或8条)非正交序列。
根据要生成一个整数的索引值，该整数的索引值唯一指定了非正交序列集中的一个序列，且所述索引值来自于一个16元(或8元)整数集合，所述16元(或8元)整数集合是[0，16-1]或[1，16]范围(或[0，8-1]或[1，8])内的所有整数组成的集合；
当额外增加的比特为bM……b0，且M>0时，为了生成上述的整数序列，首先，在bm……b0随机取值之后，将比特序列(ai……a0+bm……b0)转化 成一个十进制数，0≤i≤39,0≤m≤M然后将所得到的十进制数对16取模，取模得到值即为整数索引值。且当本次传输失败时，额外增加的Y个比特的取值在每次重传时都要进行随机化处理；
或者
当额外增加的比特为bM……b0，且M>0时，为了生成上述的整数序列，在bm……b0随机取值之后，需要将初始值随机选取的比特序列(bm……b0)转化成一个十进制数，0≤m≤M,然后将所得到的十进制数对16(或8)取模，取模得到值即为整数索引值。且当本次传输失败时，额外增加的Y个比特的取值在每次重传时都要进行随机化处理。
(2)构造一个包含16条8长(或8条4长)非正交扩展序列的集合(表格)；
例如给出生成16条8长(或8条4长)非序列的一种方法：
首先得到由8长正价序列集组成的8长8列的矩阵：
Figure PCTCN2017082532-appb-000039
之后将正交的H8矩阵点乘一个8长的列矩阵，且此8长的列矩阵中的每一个元素的取值均取自于{+1，-1}，例如其中一个8长的列矩阵为：
Figure PCTCN2017082532-appb-000040
即而：H16＝[H8 H8·A0]
其中，由H16中的每列的集合就是1条8长非正交序列集合。
或者，
首先得到由4长正价序列集组成的4长4列的矩阵：
Figure PCTCN2017082532-appb-000041
之后将正交的H4矩阵点乘一个4长的列矩阵，且此4长的列矩阵中的每一个元素的取值均取自于{+1，-1}，例如其中一个4长的列矩阵为：
Figure PCTCN2017082532-appb-000042
即而：H8＝[H4 H4·A1]
其中，由H8中的每列的集合就是1条4长非正交序列集合。
(3)根据(1)中的索引值并且按照预设的映射规则，从(2)中包含16条8长(或8条4长)非正交扩展序列的集合(表格)中选择一条而成。
(四)生成8长(或4长)非正交扩展序列C2的另一种方法，该方法可以分成以下两个部分：
(1)构造一个包含16条8长(或8条4长)非正交扩展序列的集合(表格)；
例如给出生成16条8长(8条4长)非序列的一种方法：
首先得到由8长正价序列集组成的8长8列的矩阵：
Figure PCTCN2017082532-appb-000043
之后将正交的H8矩阵点乘一个8长的列矩阵，且此8长的列矩阵中的每一个元素的取值均取自于{+1，-1}，例如其中一个8长的列矩阵为：
Figure PCTCN2017082532-appb-000044
即而：H16＝[H8 H8·A0]
其中，由H16中的每列的集合就是1条8长非正交序列集合。
或者，
首先得到由4长正价序列集组成的4长4列的矩阵：
Figure PCTCN2017082532-appb-000045
之后将正交的H4矩阵点乘一个4长的列矩阵，且此4长的列矩阵中的每一个元素的取值均取自于{+1，-1}，例如其中一个4长的列矩阵为：
Figure PCTCN2017082532-appb-000046
即而：H8＝[H4 H4·A1]
其中，由H8中的每列的集合就是1条4长非正交序列集合。
(2)从(1)中包含16条8长(8条4长)非正交扩展序列的集合(表格)中随机选择一条而成。
方案三：根据额外增加的比特序列(比特序列长度可以大于或等于0)、终端身份标识信息的比特序列(比特序列长度可以大于或等于0)确定4长的复数扩展序列或8长(或4长)的非正交扩展序列。额外增加的比特序列的取值指定了循环移位的起始位置，且额外增加的比特序列的取值在每次重传时，可以随机选择，也可以依次增加：
结合本实施例给出的应用场景，更加具体的介绍非正交扩展序列C1、正交扩展序列C2的生成过程：
(一)生成复数域二元扩展序列C1的一种方法，该方法可以分成以下三个部分：
(1)此处UE_ID是一个40长的0、1二进制比特序列，例如a39a38……a1a0，将此比特序列转换成十进制数，十进制转换方法为：a39*239+a38*238+……+a1*21+a0*20。额外增加的比特序列的长度大于或等于0，每个元素均取值于{0，1}。
以2*2整数集合为例，发射机生成一个整数序列的索引值，该整数序列中元素取值均来自于一个4元整数集合{0,1,2,3}，且该整数序列的长度为4。
当额外增加的比特为bM……b0，且M>0时，为了生成上述的整数序列，首先，需要将比特序列(ai……a0+bm……b0)进行4次的循环移位，0≤i≤39,0≤m≤M,且每次循环移位的步长可以是0个比特位、或者是正整数个比特位，再利用上述的十进制转化方法，求出每次循环移位后比特序列的十进制数A1、A2、A3和A4。额外增加的比特序列的取值指定了循环移位的起始位置，且当本次传输失败时，额外增加的Y个比特的取值在每次重传时可以随机选取，也可以依次增加；如果是额外增加的比特的取值在每次重传时采取依次增加，那么当本次传输成功后，需要将额外增加的比特的取值清零。
最后，根据十进制数A1、A2、A3和A4，求出所述整数序列中每个元素的取值为：A1mod 4、A2mod 4、A3mod 4和A4mod 4，其中Apmod 4表示对4取模的值，p属于{1,2,3,4}，则得到所述的整数序列{A1mod 4、A2mod 4、A3mod 4、A4mod 4}。
另一个实施例中，以3*3整数集合为例，发射机生成一个整数序列的索引值，该整数序列的元素取值均来自于一个9元整数集合{0,1,2,……，8,9}，且该整数序列的长度为4。
当额外增加的比特为bM……b0，且M>0时，为了生成上述的整数序列，首先，需要将比特序列(ai……a0+bm……b0)进行4次的循环移位，0≤i≤39,0≤m≤M,且每次循环移位的步长可以是0个比特位、或者是正整数个比特位，再利用上述的十进制转化方法，求出每次循环移位后比特序列的十进制数A1、A2、A3和A4。额外增加的比特序列的取值指定了循环移位的起始位置，且当本次传输失败时，额外增加的Y个比特的取值在每次重传时可以随机选取，也可以依次增加；如果是额外增加的比特的取值在每次重传时采取依次增加，那么当本次传输成功后，需要将额外增加的比特的取值清零。
最后，根据十进制数A1、A2、A3和A4，求出所述整数序列中每个元素的取值为：A1mod 9、A2mod 9、A3mod 9和A4mod 9，其中Apmod 9表示对9取模的值，p属于{1,2,4}。
另一个实施例中，发射机生成一个整数序列的索引值，该整数序列的元素取值均来自于一个8元整数集合{0,1,2,……，7,8}，且该整数序列的长度为4。
当额外增加的比特为bM……b0，且M>0时，为了生成上述的整数序列，首先，需要将比特序列(ai……a0+bm……b0)进行4次的循环移位，0≤i≤39,0≤m≤M,且每次循环移位的步长可以是0个比特位、或者是正整数个比特位，再利用上述的十进制转化方法，求出每次循环移位后比特序列的十进制数A1、A2、A3和A4。额外增加的比特序列的取值指定了循环移位的起始位置，且当本次传输失败时，额外增加的Y个比特的取值在每次重传时可以随机选取，也可以依次增加；如果是额外增加的比特的取值在每次重传时采取依次增加，那么当本次传输成功后，需要将额外增加的比特的取值清零。
最后，根据十进制数A1、A2、A3和A4，求出所述整数序列中每个元素的取值为：A1mod 8、A2mod 8、A3mod 8和A4mod 8，其中Apmod 8表示对8取模的值，p属于{1,2,3,4}。
(2)构造与索引值相关联的含有4个复数星座点的星座图。所述复数星座图中每个星座点的实部和虚部的取值均来自于一个2元实数集合，且此2元实数集合表示为[-1,+1]。
故此4个复数星座点对应的复数分别为-1+j、1+j、-1-j、1-j。
另一个实施例中，构造与索引值相关联的含有9个复数星座点的星座图。所述复数星座图中每个星座点的实部和虚部的取值均来自于一个3元实数集合，且此3元实数集合表示为[-1,0,+1]。
故此9个复数星座点对应的复数分别为-1+j、1+j、-1-j、1-j、-j、j、-1、+1、0。
另一个实施例中，构造与索引值相关联的含有8个复数星座点的星座图。所述复数星座图中每个星座点对应的复数分别为-1+j、1+j、-1-j、1-j、-j、j、-1、+1，即不含有0点。
另一个实施例中，构造与索引值相关联的含有8个复数星座点的星座图。所述复数星座图中每个星座点对应的复数分别为(-1+j)/sqrt(2)、(1+j)/sqrt(2)、(-1-j)/sqrt(2)、(1-j)/sqrt(2)、-j、j、-1、+1，即不含有0点。
(3)根据所述伪随机的整数序列中的4个元素，按照预设的映射规则从一个4点的复数星座图中选取对应的4个复数星座点；
根据4元整数集合中的元素与4点复数星座图的复数星座点之间的映射关系(如图16所示)把(1)中整数序列的索引值逐位映射到4点复数星座图的复数星座点(每一复数星座点表示一个复数)生成复数扩展序列，用公式表示如下：
Ap—>ComplexSeqp
其中，ComplexSeqp表示复数扩展序列的第p个元素，根据4元整数集合中的元素与4点复数星座图的复数星座点之间的映射关系由Ap映射得到，Ap表示伪随机的整数序列的第p个元素。
根据整数序列索引值，确定所述4个复数星座点对应的4个复数，将所述4个复数依次组合得到所述复数扩展序列，或者，将所述4个复数乘以相应的能量归一化系数后依次组合得到所述复数扩展序列。
在另一实施例中，根据9元整数集合中的元素与9点复数星座图的复数星座点之间的映射关系(如图17所示)把(1)中整数序列的索引值逐位映射到9点复数星座图的复数星座点(每一复数星座点表示一个复数)生成复数扩展序列，用公式表示如下：
Ap—>ComplexSeqp
其中，ComplexSeqp表示复数扩展序列的第p个元素，根据9元整数集合中的元素与9点复数星座图的复数星座点之间的映射关系由Ap映射得到，Ap表示伪随机的整数序列的第p个元素。
根据整数序列索引值，确定所述9个复数星座点对应的4个复数，将所述4个复数依次组合得到所述复数扩展序列，或者，将所述4个复数乘以相应的能量归一化系数后依次组合得到所述复数扩展序列。
在另一实施例中，根据8元整数集合中的元素与8点复数星座图的复数星座点之间的映射关系(如图18所示)把(1)中整数序列的索引值逐位映射到8点复数星座图的复数星座点(每一复数星座点表示一个复数)生成复数扩展序列，用公式表示如下：
Ap—>ComplexSeqp
其中，ComplexSeqp表示复数扩展序列的第p个元素，根据8元整数集合中的元素与8点复数星座图的复数星座点之间的映射关系由Ap映射得到，Ap表示伪随机的整数序列的第p个元素。
根据整数序列索引值，确定所述8个复数星座点对应的4个复数，将所述4个复数依次组合得到所述复数扩展序列，或者，将所述4个复数乘以相应的能量归一化系数后依次组合得到所述复数扩展序列。
在另一实施例中，根据8元整数集合中的元素与8点复数星座图的复数星座点之间的映射关系(如图19所示)把(1)中整数序列的索引值逐位映射到8点复数星座图的复数星座点(每一复数星座点表示一个复数)生成复数扩展序列，用公式表示如下：
Ap—>ComplexSeqp
其中，ComplexSeqp表示复数扩展序列的第p个元素，根据8元整数集合中的元素与8点复数星座图的复数星座点之间的映射关系由Ap映射得到，Ap表示伪随机的整数序列的第p个元素。
根据整数序列索引值，确定所述8个复数星座点对应的4个复数，将所述4个复数依次组合得到所述复数扩展序列，或者，将所述4个复数乘以相应的能量归一化系数后依次组合得到所述复数扩展序列。
(二)生成复数域二元扩展序列C1的另一种方法，且该方法可以分成以下三部分：
(1)此处UE_ID是一个40长的0、1二进制比特序列，例如a39a38……a1a0，将此比特序列转换成十进制数，十进制转换方法为：a39*239+a38*238+……+a1*21+a0*20＝A。额外增加的比特序列的长度大于或等于0，每个元素均取值于{0，1}，且额外增加的比特为bM……b0，且M>0。
以一个2元实数集合为例，确定要生成4长的非正交扩展序列，且所述非正交扩展序列的每一元素为一个复数，且所述扩展序列中所有元素的实部和虚部的取值均来自于一个2元实数集合，所述2元实数集合是{-1,+1}范围内的奇数组成的集合，则对于4长的非正交序列集中共有44条非正交序列。
为此要生成一个整数的索引值，根据该索引值可以唯一指定非正交序列集中的一条非正交序列，且所述索引值来自于一个(2*2)4元整数集合，所述256元整数集合是[0，256-1]或[1，256]范围内的所有整数组成的集合；
当额外增加的比特为bM……b0，且M>0时，为了生成一个整数的索引值来指定4长非正交序列集中的一条，首先需要将比特序列(ai……a0+bm……b0)转化成一个十进制数，0≤i≤39,0≤m≤M；然后，将上述的十进制数对256进行模运算，所得的模值即为索引值。且当本次传输失败时，额外增加的Y个比特的取值在每次重传时都要随机取值。
或者，
当额外增加的比特序列为bM……b0，且M>0时，为了生成一个整数的索引值来指定4长非正交序列集中的一条，首先需要将比特序列(bm……b0)转化成一个十进制数，0≤m≤M；然后，将上述的十进制数对256进行模运算，所得的模值即为索引值。且当本次传输失败时，额外增加的Y个 比特的取值在每次重传时都要随机取值。
另一个实施例中，以3元实数集合为例，确定要生成4长的非正交扩展序列，且所述非正交扩展序列的每一元素为一个复数，且所述扩展序列中所有元素的实部和虚部的取值均来自于一个3元实数集合，所述3元实数集合是{-1,0,+1}范围内的奇数组成的集合。
根据比特序列(ai……a0+bm……b0)生成一个整数的索引值，0≤i≤39,0≤m≤M，所述索引值来自于一个(3*3)4元整数集合，所述6561元整数集合是[0，6561-1]或[1，6561]范围内的所有整数组成的集合；
为了生成上述的整数的索引值，首先，需要将(ai……a0+bm……b0)转换的十进制数，0≤i≤39,0≤m≤M；然后，将上述的十进制数对6561进行模运算，所得的模值即为索引值。且当本次传输失败时，额外增加的Y个比特的取值在每次重传时都要随机取值。
或者，
当额外增加的比特序列为bM……b0，且(bM……b0)十进制值大于6561时，为了生成一个整数的索引值来指定4长非正交序列集中的一条，首先需要将比特序列(bm……b0)转化成一个十进制数，0≤m≤M；然后，将上述的十进制数对6561进行模运算，所得的模值即为索引值。且当本次传输失败时，额外增加的Y个比特的取值在每次重传时都要随机取值。
另一个实施例中，以一个3元实数集合为例，确定要生成4长的非正交扩展序列，且所述非正交扩展序列的每一元素为一个复数，且所述扩展序列中所有元素的实部和虚部的取值均来自于一个3元实数集合，所述3元实数集合是[-1,0,+1]范围内的奇数组成的集合，但是此处要求所述扩展序列中所有元素的实部和虚部不能同时为0。
根据(ai……a0+bm……b0)生成一个整数的索引值，0≤i≤39,0≤m≤M，所述索引值是来自于一个84元整数集合，所述4096元整数集合是[0，4096-1]或[1，4096]范围内的所有整数组成的集合；
为了生成上述的整数的索引值，首先，需要将(ai……a0+bm……b0) 转换的十进制数，0≤i≤39,0≤m≤M；然后，将上述的十进制数对4096进行模运算，所得的模值即为索引值。且当本次传输失败时，额外增加的Y个比特的取值在每次重传时都要随机取值。
或者，
当额外增加的比特序列为bM……b0，且(bM……b0)十进制值大于4096时，为了生成一个整数的索引值来指定4长非正交序列集中的一条，首先需要将比特序列(bm……b0)转化成一个十进制数，0≤m≤M；然后，将上述的十进制数对4096进行模运算，所得的模值即为索引值。且当本次传输失败时，额外增加的Y个比特的取值在每次重传时都要随机取值。
(2)构造一个4长复数域的非正交序列的集合(表格)；
以一个2元实数集合为例，确定要生成4长的非正交扩展序列，且所述非正交扩展序列的每一元素为一个复数，且所述扩展序列中所有元素的实部和虚部的取值均来自于一个2元实数集合，所述2元实数集合是{-1,+1}范围内的奇数组成的集合。
将所得到的4个复数依次组合得到所述复数扩展序列，或者，将所述4个复数乘以相应的能量归一化系数后依次组合得到所述复数扩展序列。
则此时生成的非正交序列集合中具有(2*2)4条序列。
另一个实施例中，以一个3元实数集合为例，确定要生成4长的非正交扩展序列，且所述非正交扩展序列的每一元素为一个复数，且所述扩展序列中所有元素的实部和虚部的取值均来自于一个3元实数集合，所述3元实数集合是{-1,0,+1}范围内的奇数组成的集合。
将所得到的4个复数依次组合得到所述复数扩展序列，或者，将所述4个复数乘以相应的能量归一化系数后依次组合得到所述复数扩展序列。
则此时生成的非正交序列集合中具有(3*3)4条序列。
另一个实施例中，以一个3元实数集合为例，确定要生成4长的非正交扩展序列，且所述非正交扩展序列的每一元素为一个复数，且所述扩展 序列中所有元素的实部和虚部的取值均来自于一个3元实数集合，所述3元实数集合是{-1,0,+1}范围内的奇数组成的集合。
将所得到的4个复数依次组合得到所述复数扩展序列，或者，将所述4个复数乘以相应的能量归一化系数后依次组合得到所述复数扩展序列。
但是此处要求所述扩展序列中所有元素的实部和虚部不能同时为0，所以此时生成的非正交序列集合中具有(3*3-1)4条序列。
(3)根据(1)中的索引值并且按照预设的映射规则，从(2)中包含(2*2)4条4长非正交序列的集合(表格)中选择一条而成；或者，
根据(1)中的索引值和预设的映射规则，从(2)中包含(3*3)4条的4长非正交序列的集合(表格)中选择一条而成；或者
根据(1)中的索引值和预设的映射规则，从(2)中包含(3*3-1)4条的4长非正交序列的集合(表格)中选择一条而成。
(三)生成8长(或4长)非正交扩展序列C2的一种方法，该方法可以分成以下三个部分：
(1)此处UE_ID是一个40长的0、1二进制比特序列，例如a39a38……a1a0，将此比特序列转换成十进制数，十进制转换方法为：a39*239+a38*238+……+a1*21+a0*20＝A。额外增加的比特序列的长度大于或等于0，每个元素均取值于{0，1}，且额外增加的比特为bM……b0，且M>0。
确定要生成一个序列长度为8(或4)的非正交扩展序列集合，且所述序列集合中每一个非正交序列的每一个元素的取值来均来自于{-1,+1}，且正交序列集中总共有16条(或8条)正交序列。
根据要生成一个整数的索引值，该整数的索引值唯一指定了正交序列集中的一个序列，且所述索引值来自于一个16元(或8元)整数集合，所述16元(或8元)整数集合是[0，16-1]或[1，16]范围(或[0,8-1]或[1,8])内的所有整数组成的集合；
当额外增加的比特为bM……b0，且M>0时，为了生成上述的整数序列，首先，在bm……b0随机取值后，需要将比特序列(ai……a0+bm……b0)转化成一个十进制数，0≤m≤M，0≤i≤39然后将所得到的十进制数对16 (或8)取模，取模得到值即为整数索引值。且当本次传输失败时，额外增加的Y个比特的取值在每次重传时都要进行随机化；
或者
当额外增加的比特为bM……b0，且M>2时，为了生成上述的整数序列，在bm……b0随机取值后，需要将初始值随机选取的比特序列(bm……b0)转化成一个十进制数，0≤m≤M,然后将所得到的十进制数对16(或8)取模，取模得到值即为整数索引值。且当本次传输失败时，额外增加的Y个比特的取值在每次重传时要随机选择。
(2)构造一个包含16条8长(或8条4长)非正交扩展序列的集合(表格)；
例如给出生成16条8长(或8条4长)非序列的一种方法：
首先得到由8长正价序列集组成的8长8列的矩阵：
Figure PCTCN2017082532-appb-000047
之后将正交的H8矩阵点乘一个8长的列矩阵，且此8长的列矩阵中的每一个元素的取值均取自于{+1，-1}，例如其中一个8长的列矩阵为：
Figure PCTCN2017082532-appb-000048
即而：H16＝[H8 H8·A0]
其中，由H16中的每列的集合就是1条8长非正交序列集合。
或者，
首先得到由4长正价序列集组成的4长4列的矩阵：
Figure PCTCN2017082532-appb-000049
之后将正交的H4矩阵点乘一个4长的列矩阵，且此4长的列矩阵中的每一个元素的取值均取自于{+1，-1}，例如其中一个4长的列矩阵为：
Figure PCTCN2017082532-appb-000050
即而：H8＝[H4 H4·A1]
其中，由H8中的每列的集合就是1条4长非正交序列集合。
(3)根据(1)中的索引值并且按照预设的映射规则，从(2)中包含16条8长(或8条4长)非正交扩展序列的集合(表格)中选择一条而成。
(四)生成8长(或4长)非正交扩展序列C2的另一种方法，该方法可以分成以下两个部分：
(1)构造一个包含16条8长(8条4长)非正交扩展序列的集合(表格)；
例如给出生成16条8长(8条4长)非正交序列的一种方法：
首先得到由8长正价序列集组成的8长8列的矩阵：
Figure PCTCN2017082532-appb-000051
之后将正交的H8矩阵点乘一个8长的列矩阵，且此8长的列矩阵中的每一个元素的取值均取自于{+1，-1}，例如其中一个8长的列矩阵为：
Figure PCTCN2017082532-appb-000052
即而：H16＝[H8 H8·A0]
其中，由H16中的每列的集合就是1条8长非正交序列集合。
或者，
首先得到由4长正价序列集组成的4长4列的矩阵：
Figure PCTCN2017082532-appb-000053
之后将正交的H4矩阵点乘一个4长的列矩阵，且此4长的列矩阵中的每一个元素的取值均取自于{+1，-1}，例如其中一个4长的列矩阵为：
Figure PCTCN2017082532-appb-000054
即而：H8＝[H4 H4·A8］
其中，由H8中的每列的集合就是1条4长非正交序列集合。
(2)从(1)中包含16条8长(8条4长)非正交扩展序列的集合(表格)中随机选择一条而成。
步骤120，利用所得到的扩展序列C1和C2对待发送的数据符号进行扩展处理。
将至少包含自己终端身份标识信息的比特序列，通过编码调制，形成N1个调制符号，再加上N2个导频符号，一共N个符号，N＝N1+N2，将所述的N个符号通过扩展变成L*N个符号。
根据不同的扩展类型，可以分成以下三种情况：
(一)调制符号首先经过4长非正交序列扩展，此扩展后的符号再经过8长(或4长)的非正交序列扩展。调制后的数据符号为Sk，首先将Sk用4长非正交扩展序列C1＝{c11,c12,……c14}进行扩展处理，本步骤中的扩展处理是指Sk与{c11,c12,……c14}中的每个元素(复数符号)进行复数相乘，即得到第一次扩展处理后的数据{Skc11,Skc12,……Skc14}；然后，将第一次扩展后的序列{Skc11,Skc12,……Skc14}的每一个数据与8长(或4长)非正交序列C2＝{c21,c22,……c28}(或C2＝{c21,c22,……c24})进行第二次扩展处理，得到第二次扩展后的数据{Skc11c21,Skc11c22，……Skc11c28，Skc12 c21,Skc12 c22……，Skc12 c28，Skc14 c21……Skc14 c28}(或{Skc11c21,Skc11c22，……Skc11c24，Skc12 c21,Skc12 c22……，Skc12 c24，Skc14 c21……Skc14 c24})。
将调制后的数据符号用复数域非正交扩展序列进行扩展处理，本步骤中的扩展处理是指每个编码调制后的数据符号与所述4长复数域非正交扩展序列的每个元素(复数符号)进行复数相乘，最终形成与所用4长扩展序列长度相同的复数符号序列。从而得到第一次扩展后的数据序列。
将第一次扩展后的数据序列使用生成的8长(或4长)非正交序列进行扩展处理，本步骤中的扩展处理是指将经过4长非正交序列扩展后的数据序列中的每一个元素与所述8长(或4长)非正交序列的每个元素进行相乘，最终形成与所用8长(或4长)扩展序列长度相同的符号序列。
(二)调制符号首先经过8长(或4长)非正交序列扩展，此扩展后的符号再经过4长的非正交序列扩展。调制后的数据符号为Sk，首先将Sk用8长(或4长)非正交序列C1＝{c11,c12,……c18}(或C1＝{c11,c12,……c14})进行扩展处理，本步骤中的扩展处理是指Sk与{c11,c12,……c18}(或{c11,c12,……c14})中的每个元素(复数符号)进行复数相乘，即得到第一次扩展处理后的数据{Skc11,Skc12,……Skc18}(或{Skc11,Skc12,……Skc14})；然后，将第一次扩展后的序列{Skc11,Skc12,……Skc18}(或{Skc11,Skc12,……Skc14})的每一个数据与4长非正交扩展序列C2＝{c21,c22,……c24}进行第二次扩展处理，得到第二次扩展后的数据{Skc11c21,Skc11c22，……Skc11c24，Skc12  c21,Skc12 c22……，Skc12 c24，Skc18 c21……Skc18 c24}(或{Skc11c21,Skc11c22，……Skc11c24，Skc12 c21,Skc12 c22……，Skc12 c24，Skc14 c21……Skc14 c24})。具体的，如下：
将调制后的数据符号用使用生成的8长(或4长)非正交序列进行扩展处理，本步骤中的扩展处理是指每个编码调制后的数据符号与所述8长(或4长)非正交序列的每个元素进行相乘，最终形成与所用8长(或4长)扩展序列长度相同的符号序列。从而得到第一次扩展后的数据序列。
将第一次扩展后的数据使用生成的4长复数域非正交扩展序列进行扩展处理，本步骤中的扩展处理是指将经过8长(或4长)非正交序列扩展后的数据符号与所述4长复数域非正交扩展序列中的每个元素(复数符号)进行复数相乘，最终形成与所用4长扩展序列长度相同的复数符号序列。
(三)调制符号经过L长的扩展序列进行扩展，其中L长的扩展序列是由L1长非正交序列和L2长的非正交序列扩展得到的。调制后的数据符号为Sk，将Sk用L长的扩展序列进行扩展处理，本步骤中的扩展处理是指将Sk与所述L长序列的每个元素(复数符号)进行复数相乘，最终形成与所用L长扩展序列长度相同的符号序列。
其中，所述的L长序列是一条4长非正交序列被另一条8长(或4长)非正交序列扩展而成的；或者，所述的L长序列是一条8长(或4长)非正交序列被另一条4长非正交序列扩展而成的。
所述的L长序列是一条4长非正交序列被另一条8长(或4长)非正交序列扩展而成的，本步骤中的扩展是指将4长非正交序列中每个元素与8长(或4长)非正交序列的每个元素进行相乘，最终形成与所用扩展序列长度相同的符号序列，即所得到的的L长序列为{c11c21,c11c22，……c11c28，c12 c21,c12 c22……c12 c28，……，c14c21……c14 c28}(或{c11c21,c11c22，……c11c24，c12 c21,c12 c22……c12 c24，……，c14c21……c14 c24})；或者是一条8长(或4长)非正交序列被另一条4长非正交序列扩展而成的，本步骤中的扩展是指将8长(或4长)非正交序列中每个元素与4长非正交序 列的每个元素进行相乘，最终形成与所用扩展序列长度相同的符号序列，即所得到的的L长序列为{c11c21,c11c22，……c11c24，c12 c21,c12 c22……c12 c24，……，c18c21……c18 c24}(或{c11c21,c11c22，……c11c24，c12 c21,c12 c22……c12 c24，……，c14c21……c14 c24})；
最后，使用生成的L长序列进行扩展处理，本步骤中的扩展处理是指每个编码调制后的数据符号与所述L长序列的每个元素(复数符号)进行复数相乘，最终形成与所用扩展序列长度相同的符号序列。
步骤130，将所述扩展后符号通过载波调制(单载波或者多载波调制)转化为相应的载波调制信号。
步骤140，发射上述形成的最终的载波调制信号(单载波或者多载波调制信号)。
综上所述，本公开实施例达到了以下技术效果：解决了相关技术中，随着机器通信的海量接入进行导致的传输接入技术出现的严重冲突以及可靠性差的问题，进而提高了上行接入过程的可靠性，避免了上行接入过程的过多的信令交互过程，同时避免传统正交多址接入的严格、复杂接入流程，简化接入流程，简化终端实现，降低终端功耗和成本，减少控制信令，提高海量链接场景下的系统效率和系统灵活性，增加覆盖率。
本公开的实施例还提供了一种存储介质。可选地，在本实施例中，上述存储介质可以被设置为存储用于执行以下步骤的程序代码：
S1，将待发送的比特序列编码调制形成N1个调制符号，将N1个调制符号加上N2个导频符号后形成N个符号，N1和N为正整数，N2为整数；
S2，使用两条扩展序列对N个符号进行扩展，其中，等价序列包括：通过正交序列扩展非正交序列形成的序列，和/或通过非正交序列扩展正交序列形成的序列，比特序列中携带有第一指示信息或第二指示信息，第一指示信息用于至少指示两条扩展序列中非正交序列，第二指示信息用于至少指示生成等价序列的两条序列中的非正交序列；
S3，对扩展后的符号进行载波调制得到载波调制信号，并发送载波调制信号。
本公开的实施例还提供了一种存储介质。可选地，在本实施例中，上述存储介质可以被设置为存储用于执行以下步骤的程序代码：
S1，接收多个发射机发射的载波调制信号，所述载波调制信号是通过所述发射机将待发送的比特序列编码调制形成N1个调制符号，将所述N1个调制符号加上N2个导频符号后形成N个符号，并使用两条扩展序列或一条等价序列对所述N个符号进行扩展，以及对扩展后的符号进行载波调制形成的，其中，N1和N为正整数，N2为整数，所述等价序列包括：将所述两条扩展序列中的一条扩展序列扩展，并与另一条扩展序列所形成的序列，所述比特序列中携带有第一指示信息或第二指示信息，所述第一指示信息用于至少指示所述两条扩展序列中非正交序列，所述第二指示信息用于至少指示所述等价序列中非正交序列；
S2，对接收的载波调制信号进行接收检测。
可选地，在本实施例中，上述存储介质可以包括但不限于：U盘、只读存储器(ROM，Read-Only Memory)、随机存取存储器(RAM，Random Access Memory)、移动硬盘、磁碟或者光盘等各种可以存储程序代码的介质。
可选地，本实施例中的具体示例可以参考上述实施例及可选实施方式中所描述的示例，本实施例在此不再赘述。
显然，本领域的技术人员应该明白，上述的本公开的各模块或各步骤可以用通用的计算装置来实现，它们可以集中在单个的计算装置上，或者分布在多个计算装置所组成的网络上，可选地，它们可以用计算装置可执行的程序代码来实现，从而，可以将它们存储在存储装置中由计算装置来执行，并且在某些情况下，可以以不同于此处的顺序执行所示出或描述的步骤，或者将它们分别制作成各个集成电路模块，或者将它们中的多个模块或步骤制作成单个集成电路模块来实现。这样，本公开不限制于任何特 定的硬件和软件结合。
以上所述仅为本公开的优选实施例而已，并不用于限制本公开，对于本领域的技术人员来说，本公开可以有各种更改和变化。凡在本公开的精神和原则之内，所作的任何修改、等同替换、改进等，均应包含在本公开的保护范围之内。
工业实用性
本发明实施例提供的上述技术方案，可以应用于接入过程中，通过对待发送的比特序列编码调制成调制符号，将所述调制符号加上导频符号后形成N个符号，通过两条扩展序列或一条等价序列对包含有调制符号和导频符号的N个符号进行扩展，对扩展后的符号进行载波调制，其中，比特序列中携带有携带有第一指示信息或第二指示信息，所述第一指示信息用于至少指示所述两条扩展序列中非正交序列；所述第二指示信息用于至少指示所述等价序列中非正交序列，采用上述技术方案，解决了相关技术中，随着机器通信的海量接入进而导致的传输接入技术出现的严重冲突以及可靠性差的问题，进而提高了上行接入过程的可靠性，避免了上行接入过程的过多的信令交互过程。

Claims (23)

  1. 一种接入方法，包括：
    将待发送的比特序列编码调制形成N1个调制符号，将所述N1个调制符号加上N2个导频符号后形成N个符号，N1和N为正整数，N2为整数；
    使用两条扩展序列或一条等价序列对所述N个符号进行扩展，其中，所述等价序列包括：将所述两条扩展序列中的一条扩展序列扩展，并与另一条扩展序列所形成的序列，所述比特序列中携带有第一指示信息或第二指示信息，所述第一指示信息用于至少指示所述两条扩展序列中的非正交序列，所述第二指示信息用于至少指示生成的所述等价序列的两条扩展序列中的非正交序列；
    对扩展后的符号进行载波调制得到载波调制信号，并发送所述载波调制信号。
  2. 如权利要求1所述的方法，其中，所述第一指示信息或所述第二指示信息均至少包括以下信息：终端身份标识信息；终端身份标识信息和；以指定方式或随机产生的一个或多个比特，其中，所述终端身份标识信息包括以下至少之一：唯一标识终端的标识信息；用于指示终端在当前网络中的身份标识信息。
  3. 如权利要求2所述的方法，其中，通过以下参数至少之一确定所述以指定方式或随机产生的一个或多个比特：所述终端身份标识信息、载波调制信号的传输次数、发送载波调制信号的时频位置、所述终端所在小区的配置信息。
  4. 如权利要求1所述的方法，其中，所述两条扩展序列包括：非正交序列和正交序列；或者，非正交序列和非正交序列；其中，所述非正交序列包括：复数非正交序列。
  5. 如权利要求4所述的方法，其中，
    通过以下方式之一确定所述非正交序列：根据所述比特序列的第一指示信息或所述第二指示信息从包含有多个非正交序列的集合中选择；根据所述第一指示信息或所述第二指示信息序列发生器产生；
    通过以下方式之一确定所述正交序列：所述第一指示信息或所述第二指示信息还包括有指示正交序列的指示信息，则根据所述比特序列的第一指示信息或所述第二指示信息从包含有多个正交序列的集合中选择；从包含有多个正交序列的集合中随机选择。
  6. 如权利要求4所述的方法，其中，
    当所述非正交序列为复数非正交序列时，通过以下方式确定所述非正交序列：所述复数非正交序列的每一元素为一个复数，且所述复数非正交序列中所有元素的实部和虚部的取值均来自于一个M元实数集合，其中，M是大于等于2的整数；
    其中，当所述M是奇数，所述M元实数集合是[-(M-1)/2，(M-1)/2]范围内的M个整数组成的集合；或者
    当所述M是偶数，所述M元实数集合是[-(M-1),(M-1)]范围内的M个奇数组成的集合；或者
    当所述M是奇数，所述M元实数集合是[-(M-1)/2,(M-1)/2]范围内的M个整数分别乘以该M元实数集合对应的能量归一化系数得到的M个实数组成的集合；或者
    当所述M是偶数，所述M元实数集合是[-(M-1),(M-1)]范围内的M个奇数分别乘以该M元实数集合的能量归一化系数得到的M个实数组成的集合。
  7. 如权利要求4所述的方法，其中，
    当所述非正交序列为复数非正交序列时，根据所述比特序列确定所述复数非正交序列包括：
    根据所述比特序列生成整数序列，所述整数序列的所有元素的取值均来自于一个M×M元整数集合，且具有的元素个数与所述非正交序列的长度相同，所述M×M元整数集合是[0，M×M-1]或[1，M×M]范围内的所有整数组成的集合，M为大于等于2的整数；
    根据所述整数序列中元素，按照预设的映射规则从一个M×M点的复数星座图中选取所述元素对应的复数星座点；
    确定所述复数星座点对应的复数，将所述复数依次组合得到所述复数非正交序列，或者，将所述复数乘以所述复数的能量归一化系数后依次组合得到所述复数非正交序列。
  8. 如权利要求6或7所述的方法，其中，
    所述M＝2或3或4。
  9. 如权利要求4所述的方法，其中，
    当所述非正交序列为复数非正交序列时，根据所述比特序列确定要使用的复数非正交序列包括：
    根据所述比特序列生成整数序列，所述整数序列所有元素的取值来自8元整数集合，且具有元素的个数与所述非正交序列的长度相同，所述8元整数集合是[0，7]或[1，8]范围内的所有整数组成的集合；
    根据所述的整数序列中的元素，按照预设的映射规则从8点的复数星座图中选取所述复数对应的复数星座点；
    确定所述复数星座点对应的复数，将所述复数依次组合得到所述复数非正交序列，或者，将所述复数乘以该复数对应的能量归一化系数后依次组合得到所述复数非正交序列。
  10. 如权利要求1所述的方法，其中，
    通过基站发送的广播信息确定以下至少之一：所述两条扩展序列的至少一条扩展序列的长度或所述等价序列的长度；终端可用的时频资源。
  11. 如权利要求4-7、9-10任一项所述的方法，其中，
    所述正交序列至少包括以下之一：沃尔什序列、离散傅里叶变换序列、Zadoff–Chu序列。
  12. 如权利要求1所述的方法，其中，
    采用以下至少之一编码方式对所述待发送的比特序列进行编码：循环冗余校验编码和信道纠错编码；
    采用至少以下之一编码方式对所述待发送的比特序列进行调制：二进制相移键控、正交移相键控、16正交振幅调制、64正交振幅调制。
  13. 如权利要求1所述的方法，其中，
    对扩展后的符号进行载波调制包括：采用至少以下方式之一进行载波调制：带有循环前缀CP的正交频分复用OFDM；带有循环前缀CP的单载波频分多址SC-FDMA调制；带有循环前缀CP的1个子载波的OFDM/SC-FDMA调制。
  14. 如权利要求4-7、9-10、12-13任一项所述的方法，其中，所述正交序列的序列长度为1；所述非正交序列的长度为1。
  15. 如权利要求4-7、9-10、12-13任一项所述的方法，其中，所述导频符号的个数N2取值为0。
  16. 一种接入方法，其中，包括：
    接收多个发射机发射的载波调制信号，所述载波调制信号是通过所述发射机将待发送的比特序列编码调制形成N1个调制符号，将所述N1个调制符号加上N2个导频符号后形成N个符号，并使用两条扩展序列或一条等价序列对所述N个符号进行扩展，以及对扩展后的符号进行载波调制形成的，其中，N1和N为正整数，N2为整数，所述等价序列包括：将所述两条扩展序列中的一条扩展序列扩展，并与另一条扩展序列所形成的序列，所述比特序列中携带有第一指示信息或第二指示信息，所述第一指示信息用于至少指示所述两条扩展序列中非正交序列，所述第二指示信息用于至少指示生成的所述等价序列的两条扩展序列中的非正交序列；
    对接收的所述载波调制信号进行接收检测。
  17. 一种上行接入装置，其中，包括：
    编码调制模块，用于将待发送的比特序列编码调制形成N1个调制符号，将所述N1个调制符号加上N2个导频符号后形成N个符号，N1和N为正整数，N2为整数；
    扩展模块，用于使用两条扩展序列或一条等价序列对所述N个符号进行扩展，其中，所述等价序列包括：将所述两条扩展序列中的一条扩展序列扩展，并与另一条扩展序列所形成的序列，所述比特序列中携带有第一指示信息或第二指示信息，所述第一指示信息用于至少指示所述两条扩展序列中的非正交序列，所述第二指示信息用于至少指示所述等价序列的两条扩展序列中的非正交序列；
    载波调制模块，用于对扩展后的符号进行载波调制得到载波调制信号；
    发送模块，用于发送所述载波调制信号。
  18. 一种上行接入装置，其中，包括：
    接收模块，用于接收多个发射机发射的载波调制信号，所述载波调制信号是通过所述发射机将待发送的比特序列编码调制形成N1个调制符号，将所述N1个调制符号加上N2个导频符号后形成N个符号，并使用两条扩展序列或一条等价序列对所述N个符号进行扩展，以及对扩展后的符号进行载波调制形成的，其中，N1和N为正整数，N2为整数，所述等价序列包括：将所述两条扩展序列中的一条扩展序列扩展，并与另一条扩展序列所形成的序列，所述比特序列中携带有第一指示信息或第二指示信息，所述第一指示信息用于至少指示所述两条扩展序列中非正交序列，所述第二指示信息用于至少指示生成的所述等价序列的两条扩展序列中非正交序列；
    检测模块，用于对接收的所述载波调制信号进行接收检测。
  19. 一种发射机，其中，包括：
    第一处理器；
    用于存储处理器可执行指令的第一存储器；
    其中，所述第一处理器，用于将待发送的比特序列编码调制形成形成N1个调制符号，将所述N1个调制符号加上N2个导频符号后形成N个符号，使用两条扩展序列或一条等价序列对所述N个符号进行扩展，对扩展后的符号进行载波调制得到载波调制信号，并发送所述载波调制信号，其中，N1和N为正整数，N2为整数，所述等价序列包括：将所述两条扩展序列中的一条扩展序列扩展，并与另一条扩 展序列所形成的序列，所述比特序列中携带有第一指示信息或第二指示信息，所述第一指示信息用于至少指示所述两条扩展序列中非正交序列，所述第二指示信息用于至少指示生成的所述等价序列的两条扩展序列中非正交序列。
  20. 如权利要求19所述的发射机，其中，所述发射机在无数据需求时，处于休眠状态。
  21. 一种终端，其中，包括：权利要求19-20任一项所述的发射机。
  22. 一种接收机，其中，包括：
    第二处理器；
    用于存储第二处理器可执行指令的第二存储器；
    其中，所述第二处理器，用于接收多个发射机发射的载波调制信号，所述载波调制信号时通过所述发射机将待发送的比特序列编码调制形成N1个调制符号，将所述N1个调制符号加上N2个导频符号后形成N个符号，使用两条扩展序列或一条等价序列对所述N个符号进行扩展，对扩展后的符号进行载波调制形成的，其中，N1和N为正整数，N2为整数，所述等价序列包括：将所述两条扩展序列中的一条扩展序列扩展，并与另一条扩展序列所形成的序列，所述比特序列中携带有第一指示信息或第二指示信息，所述第一指示信息用于至少指示所述两条扩展序列中非正交序列，所述第二指示信息用于至少指示生成的所述等价序列中的非正交序列。
  23. 一种存储介质，其中，所述存储介质包括存储的程序，其中，所述程序运行时执行权利要求1至15中任一项所述的方法，或权利要求16所述的方法。
PCT/CN2017/082532 2016-04-29 2017-04-28 接入方法及装置、发射机、接收机、终端 WO2017186175A1 (zh)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN201610284332.6A CN107343321B (zh) 2016-04-29 2016-04-29 接入方法及装置、发射机、接收机、终端
CN201610284332.6 2016-04-29

Publications (1)

Publication Number Publication Date
WO2017186175A1 true WO2017186175A1 (zh) 2017-11-02

Family

ID=60161847

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2017/082532 WO2017186175A1 (zh) 2016-04-29 2017-04-28 接入方法及装置、发射机、接收机、终端

Country Status (2)

Country Link
CN (1) CN107343321B (zh)
WO (1) WO2017186175A1 (zh)

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109873782A (zh) * 2017-12-01 2019-06-11 中兴通讯股份有限公司 数据发送、接收方法、装置、设备及计算机可读存储介质
CN114362875A (zh) * 2018-03-05 2022-04-15 中兴通讯股份有限公司 使用扩展码的传输

Families Citing this family (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109962751B (zh) * 2017-12-25 2022-03-01 中兴通讯股份有限公司 一种数据处理方法及装置
WO2019144405A1 (en) * 2018-01-29 2019-08-01 Zte Corporation Method and apparatus for generating spreading sequence codebooks
CN108900459A (zh) * 2018-05-25 2018-11-27 西南电子技术研究所（中国电子科技集团公司第十研究所） Gfdm/cdma混合多址无线接入方法
CN111726315B (zh) * 2019-03-20 2023-05-30 中兴通讯股份有限公司 数据发送、接收方法、装置、数据传输系统和存储介质
CN112422257A (zh) * 2020-11-17 2021-02-26 上海道生物联技术有限公司 一种同步信号发送方法及系统

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
KR20020031614A (ko) * 2000-10-20 2002-05-03 윤종용 이동통신시스템에서 버스트 파일롯 송신장치 및 방법
CN103220802A (zh) * 2012-01-19 2013-07-24 中兴通讯股份有限公司 下行数据处理方法及装置
CN104349491A (zh) * 2013-08-08 2015-02-11 中兴通讯股份有限公司 一种物理下行共享信道传输的方法、系统和网络侧设备
CN104580034A (zh) * 2013-10-25 2015-04-29 华为技术有限公司 一种上行信道估计的方法、发送装置及接收装置

Family Cites Families (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102916783B (zh) * 2011-08-02 2015-09-30 华为技术有限公司 信息发送和接收处理方法、基站和用户设备
CN105515713B (zh) * 2014-09-25 2018-11-30 中兴通讯股份有限公司 一种多用户码分多址接入通信方法与相应发射机、接收机
CN105515608A (zh) * 2014-09-26 2016-04-20 中兴通讯股份有限公司 一种扩频处理方法及装置

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
KR20020031614A (ko) * 2000-10-20 2002-05-03 윤종용 이동통신시스템에서 버스트 파일롯 송신장치 및 방법
CN103220802A (zh) * 2012-01-19 2013-07-24 中兴通讯股份有限公司 下行数据处理方法及装置
CN104349491A (zh) * 2013-08-08 2015-02-11 中兴通讯股份有限公司 一种物理下行共享信道传输的方法、系统和网络侧设备
CN104580034A (zh) * 2013-10-25 2015-04-29 华为技术有限公司 一种上行信道估计的方法、发送装置及接收装置

Cited By (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109873782A (zh) * 2017-12-01 2019-06-11 中兴通讯股份有限公司 数据发送、接收方法、装置、设备及计算机可读存储介质
EP3720076A4 (en) * 2017-12-01 2021-08-04 ZTE Corporation PROCESS, APPARATUS AND DEVICE FOR DATA TRANSMISSION AND RECEPTION, AND COMPUTER READABLE STORAGE MEDIA
US11418377B2 (en) 2017-12-01 2022-08-16 Zte Corporation Sending and receiving of orthogonal frequency multiplexing using an extended sequence
CN114362875A (zh) * 2018-03-05 2022-04-15 中兴通讯股份有限公司 使用扩展码的传输

Also Published As

Publication number Publication date
CN107343321A (zh) 2017-11-10
CN107343321B (zh) 2022-11-08

Similar Documents

Publication Publication Date Title
WO2017186175A1 (zh) 接入方法及装置、发射机、接收机、终端
KR100940730B1 (ko) 무선통신 시스템에서 기준 신호 생성 방법
CN105393618B (zh) 信号传输方法、装置、通信系统、终端和基站
US11533744B2 (en) Resource scheduling method, terminal device, and network device
KR20230082057A (ko) Nb iot 시스템들에서의 스케줄링 요청을 위한 방법 및 장치
KR102538097B1 (ko) Nb iot 시스템들에서의 스케줄링 요청을 위한 방법 및 장치
CN106572543B (zh) 随机接入方法、基站及用户设备
RU2770685C1 (ru) Терминал и способ передачи
US10484985B2 (en) Terminal, base station, transmission method, and reception method
CN101636937B (zh) 在无线通信系统中生成随机接入前导码的方法
WO2013077339A1 (ja) 移動局装置、基地局装置、無線通信システム、無線通信方法および集積回路
EP3934190B1 (en) Sequence-based signal processing method and apparatus
KR20120124448A (ko) 무선 기지국, 사용자 장비 및 그 방법들
US20200351883A1 (en) Scrambling-based data transmission method
WO2018059488A1 (zh) 一种参考信号传输方法和装置
CN108702347B (zh) 终端装置、基站装置以及通信方法
US10122502B2 (en) Communication device, transmitting method, and receiving method
KR20080065562A (ko) 무선통신 시스템에서 ａｃｋ/ｎａｋ 신호의 송수신 방법
CN102084610B (zh) 在无线通信系统中发送和接收序列的方法
CN103384182A (zh) 一种进行上行传输的方法、系统和设备
WO2021029125A1 (ja) 端末、基地局、送信方法及び受信方法
CN103379076A (zh) 一种进行上行传输的方法、系统和设备
WO2015085514A1 (zh) 信息传输方法和装置
WO2016161916A1 (zh) 一种数据传输方法及设备
CN107733596B (zh) 信息传输方法和设备

Legal Events

Date Code Title Description
NENP Non-entry into the national phase

Ref country code: DE

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

Ref document number: 17788827

Country of ref document: EP

Kind code of ref document: A1

122 Ep: pct application non-entry in european phase

Ref document number: 17788827

Country of ref document: EP

Kind code of ref document: A1