CN107343321B - Access method and device, transmitter, receiver and terminal - Google Patents

Access method and device, transmitter, receiver and terminal Download PDF

Info

Publication number
CN107343321B
CN107343321B CN201610284332.6A CN201610284332A CN107343321B CN 107343321 B CN107343321 B CN 107343321B CN 201610284332 A CN201610284332 A CN 201610284332A CN 107343321 B CN107343321 B CN 107343321B
Authority
CN
China
Prior art keywords
sequence
complex
spreading
orthogonal
integer
Prior art date
Legal status (The legal status 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 status listed.)
Active
Application number
CN201610284332.6A
Other languages
Chinese (zh)
Other versions
CN107343321A (en
Inventor
袁志锋
李超
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
ZTE Corp
Original Assignee
ZTE Corp
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 ZTE Corp filed Critical ZTE Corp
Priority to CN201610284332.6A priority Critical patent/CN107343321B/en
Priority to PCT/CN2017/082532 priority patent/WO2017186175A1/en
Publication of CN107343321A publication Critical patent/CN107343321A/en
Application granted granted Critical
Publication of CN107343321B publication Critical patent/CN107343321B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W74/00—Wireless channel access, e.g. scheduled or random 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
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W74/00—Wireless channel access, e.g. scheduled or random access
    • 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

Abstract

The present disclosure providesAn access method and device, a transmitter, a receiver and a terminal are provided, the method comprises the following steps: coding and modulating bit sequence to be transmitted to form N 1 Modulation symbol, N 1 One modulation symbol plus N 2 Forming N symbols after each pilot symbol, N 1 And N is a positive integer, N 2 Is an integer; spreading the N symbols using two spreading sequences or an equivalent sequence, the equivalent sequence comprising: a sequence formed by extending one of the two spreading sequences by the other spreading sequence is provided, wherein a bit sequence carries first indication information or second indication information, the first indication information is used for indicating at least a non-orthogonal sequence in the two spreading sequences, and the second indication information is used for indicating at least a non-orthogonal sequence in the two spreading sequences for generating an equivalent sequence; and carrying out carrier modulation on the expanded symbols to obtain carrier modulation signals, and sending the carrier modulation signals.

Description

Access method and device, transmitter, receiver and terminal
Technical Field
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.
Background
Uplink multi-user access may be via different multiple access techniques such as: time Division Multiple Access (TDMA for short), frequency Division Multiple Access (FDMA), code Division Multiple Access (CDMA for short), and Space Division Multiple Access (SDMA for short). In the access process using cdma, first, each access terminal uses a spreading sequence of a certain length (for example, a spreading sequence of length L means that the spreading sequence is composed of L symbols, or is composed of L elements, where L symbols or L elements may be L digital symbols) to spread data symbols modulated by digital amplitude. The spreading process is a process of multiplying each modulated data symbol by each symbol of a spreading sequence to finally form a symbol sequence having the same length as the used spreading sequence, fig. 1 is a schematic diagram of data symbol spreading in the related art, as shown in fig. 1, where a data symbol is S k One N-long spreading sequence C = { C = { (C) } 1 ，c 2 ，……c N The so-called extension process is toS k Multiplying each element in the spreading sequence C to finally obtain a spread sequence S k c 1 ，S k c 2 ，……S k c N }. Each modulated data symbol (for example, a constellation point symbol modulated by Binary Phase Shift Keying (BPSK)/Quadrature Amplitude Modulation (QAM)) is multiplied by each symbol of the spreading sequence in the spreading process, and finally each modulated data symbol is spread into a symbol sequence with the same length as the used spreading sequence, for example, each modulated symbol is spread into L symbols by using a spreading sequence with a length of L, or each modulated data symbol is carried on a spreading sequence with a length of L. The extended symbol sequences for all access terminals may then be transmitted on the same time-frequency resource. Finally, the base station receives a combined signal in which the spread signals of all the access terminals are superimposed, and separates the useful information of each terminal from the combined signal by a multi-user receiver technology.
In order to provide flexible system design and support simultaneous access of more users, the spreading sequences adopted by the access terminals are not mutually orthogonal, and from the perspective of multi-user information theory, the non-orthogonal multiple access method adopted by the uplink can achieve larger system capacity or marginal throughput than the orthogonal multiple access method. Since the spreading sequences of the terminals are not orthogonal to each other, the demodulation performance of each user generally deteriorates as the number of simultaneously accessed users increases. When the system is overloaded, the interference between multiple users becomes more severe. At present, the mainstream code division multiple access technology is based on a binary pseudorandom real number sequence as an extended sequence for realizing simplicity. However, since the low cross-correlation degree between the binary pseudorandom real number sequences, especially the binary pseudorandom real number sequences with short length, is not easily guaranteed, serious interference between multiple users can be caused, and the performance of multi-user access can be inevitably influenced.
Further, a 5G mass-connectivity scenario or mass-machine communication (MMC for short) is a large class of Internet of things (Internet of things, ioT for short) service of 5G. The biggest challenge of this scenario is to support a huge number of terminals, which inevitably requires: the cost of each machine terminal is far lower than that of a common mobile phone terminal; the power consumption is low enough to ensure the service life of the battery; the coverage aspect should have stronger robustness, and the coverage surface can reach the remote places such as basement.
The traditional orthogonal multiple access has the following defects: a strict access flow is required, and the terminal is complex, high in cost and large in power consumption; moreover, the signaling overhead is too large for small packets, and the frequency spectrum utilization rate is low; resource orthogonal partitioning, hard capacity, system flexibility and scalability are low.
Currently, research on machine communication access technologies mainly focuses on the following two directions: one is a study of a one-time transmission access technology based on ALOHA protocol (the earliest most basic wireless communication protocol), and the other is a scheme for adapting to machine communication characteristics by improving Long-Term Evolution (LTE) contention access technology.
Since the device density of machine communication is much higher than that of communication between traditional people and Human beings (Human-to-Human, abbreviated as H2H), which causes that a great amount of devices will be triggered at the same time, and an Access request is initiated to a base station through a Random Access Channel (RACH), this inevitably causes information collision problem, which further brings a series of problems such as Access delay and information congestion, so the Random Access technology of LTE is not suitable for the machine communication Access technology. Similarly, although the access technical solution based on LTE can ensure the reliability of the machine communication access technology, the solution needs a large amount of signaling overhead, which cannot meet the requirements of machine communication on flexibility, low power consumption, low cost and less signaling overhead.
ALOHA-based one-time transmission access techniques can be broadly divided into two types: one of the design ideas is simple, i.e. as long as the users have data to send, they send, but of course, so that collisions occur resulting in frame corruption; the other design idea is to use a clock to unify the data transmission of the user, i.e. the time is divided into discrete time slices, and the user must wait for the next time slice each time to start transmitting the data, thereby avoiding the randomness of data transmission of the user and reducing the possibility of data collision. In the second one-time transmission access technology, the transmission time of data is not only influenced by the user, but also limited by the time slice, that is, the data can be transmitted until the next time slice starts.
Although the one-time transmission access technology can save a large amount of signaling overhead, the reliability of the one-time transmission access technology cannot be better guaranteed, and for massive access during machine communication, the one-time transmission access technology inevitably has a serious conflict problem.
Aiming at the problems of serious conflict and poor reliability of a transmission access technology caused by massive access of machine communication in the related technology, an effective solution is not provided.
Disclosure of Invention
The embodiment of the disclosure provides an access method and device, a transmitter, a receiver and a terminal, so as to at least solve the problems in the related art.
According to an embodiment of the present disclosure, there is provided an access method including:
coding and modulating a bit sequence to be transmitted to form N1 modulation symbols, adding N2 pilot symbols to the N1 modulation symbols to form N symbols, wherein N1 and N are positive integers, and N2 is an integer;
spreading the N symbols using two spreading sequences or an equivalent sequence, wherein the equivalent sequence comprises: a sequence formed by extending one of the two spreading sequences by the other spreading sequence, wherein the bit sequence carries first indication information or second indication information, the first indication information is used for at least indicating a non-orthogonal sequence in the two spreading sequences, and the second indication information is used for at least indicating a non-orthogonal sequence in the equivalent sequence;
And carrying out carrier modulation on the expanded symbols to obtain carrier modulation signals, and sending the carrier modulation signals.
Optionally, the first indication information or the second indication information each 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, wherein the terminal identification information includes at least one of: identification information uniquely identifying the terminal; the terminal identity information is used for indicating the identity information of the terminal in the current network.
Optionally, the one or more bits generated in a specified manner or randomly are determined by at least one of the following parameters: the terminal identity identification information, the transmission times of the carrier modulation signals, the time-frequency position for sending the carrier modulation signals and the configuration information of the cell where the terminal is located.
Optionally, the two spreading sequences include: a non-orthogonal sequence and an orthogonal sequence; non-orthogonal sequences and non-orthogonal sequences; the non-orthogonal sequence comprises: a complex non-orthogonal sequence.
Optionally, the non-orthogonal sequence is determined by one of: selecting from a set comprising a plurality of non-orthogonal sequences according to the first indication information or the second indication information of the bit sequence; the sequencer generates the first indication information or the second indication information according to the first indication information or the second indication information;
Determining the orthogonal sequence by one of: if the first indication information or the second indication information further includes indication information indicating an orthogonal sequence, selecting from a set including a plurality of orthogonal sequences according to the first indication information or the second indication information of the bit sequence; randomly selected from a set comprising a plurality of orthogonal sequences.
Optionally, when 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 values of real parts and imaginary parts of all elements in the complex non-orthogonal sequence are from an M-element real number set, wherein M is an integer greater than or equal to 2;
wherein, when M is an odd number, the set of M-membered real numbers is a set consisting of M integers in the range [ - (M-1)/2, (M-1)/2 ]; or
When said M is an even number, said set of M-ary real numbers is a set consisting of M odd numbers in the range [ - (M-1), (M-1) ]; or
When M is an odd number, the M-element real number set is a set consisting of M real numbers obtained by respectively multiplying M integers in the range of [ - (M-1)/2, (M-1)/2 ] by an energy normalization coefficient corresponding to the M-element real number set; or
When M is an even number, the M-element real number set is a set consisting of M real numbers obtained by multiplying M odd numbers in the range of [ - (M-1), (M-1) ] by the energy normalization coefficient of the M-element real number set.
Optionally, when the non-orthogonal sequence is a complex non-orthogonal sequence, determining the complex non-orthogonal sequence according to the bit sequence includes:
generating an integer sequence according to the bit sequence, wherein values of all elements of the integer sequence are from an M × M-element integer set, the number of the elements is the same as the length of the non-orthogonal sequence, the M × M-element integer set is a set formed by all integers in a range of [0, M × M-1] or [1, M × M ], and M is an integer greater than or equal to 2;
according to the elements in the integer sequence, selecting complex constellation points corresponding to the elements from a complex constellation diagram of M multiplied by M points according to a preset mapping rule;
and determining a complex number corresponding to the complex constellation point, and sequentially combining the complex numbers to obtain the complex non-orthogonal sequence, or sequentially combining the complex numbers multiplied by the energy normalization coefficient of the complex numbers to obtain the complex non-orthogonal sequence.
Optionally, said M =2 or 3 or 4.
Optionally, when the non-orthogonal sequence is a complex non-orthogonal sequence, determining a complex non-orthogonal sequence to be used according to the bit sequence includes:
generating an integer sequence according to the bit sequence, wherein values of all elements of the integer sequence are from an 8-element integer set, the number of the elements is the same as the length of the non-orthogonal sequence, and the 8-element integer set is a set consisting of all integers in a range of [0,7] or [1,8 ];
according to elements in the integer sequence, selecting complex constellation points corresponding to the complex numbers from a complex constellation diagram of 8 points according to a preset mapping rule;
and determining a complex number corresponding to the complex constellation point, and sequentially combining the complex numbers to obtain the complex non-orthogonal sequence, or sequentially combining the complex number multiplied by an energy normalization coefficient corresponding to the complex number to obtain the complex non-orthogonal sequence.
Optionally, the broadcast information sent by the base station determines at least one of: the length of at least one of the two spreading sequences or the length of the equivalent sequence; time frequency resources available to the terminal.
Optionally, the orthogonal sequence includes at least one of: walsh sequences, discrete fourier transform DFT sequences, zadoff-Chu sequences.
Optionally, the encoding and modulating the bit sequence to be transmitted into N symbols includes: the coding is carried out by adopting at least one of the following coding modes: cyclic Redundancy Check (CRC) coding and channel error correction coding;
modulating the bit sequence to be transmitted by adopting at least one of the following coding modes: binary phase shift keying, quadrature phase shift keying, 16 quadrature amplitude modulation, 64 quadrature amplitude modulation.
Optionally, the bit sequence to be transmitted is carrier-modulated in at least one of the following ways: orthogonal Frequency Division Multiplexing (OFDM) with a Cyclic Prefix (CP); single carrier frequency division multiple access SC-FDMA modulation with a cyclic prefix CP; OFDM/SC-FDMA modulation of 1 subcarrier with cyclic prefix CP.
Optionally, the sequence length of the orthogonal sequence is 1; the length of the non-orthogonal sequence is 1.
Optionally, the number N of pilot symbols 2 The value is 0.
According to another embodiment of the present disclosure, there is also provided an access method, including:
receiving carrier modulation signals transmitted by a plurality of transmitters, wherein the carrier modulation signals are formed by encoding and modulating bit sequences to be transmitted by the transmitters to form N1 modulation symbols, adding N2 pilot symbols to the N1 modulation symbols to form N symbols, spreading the N symbols by using two spreading sequences or an equivalent sequence, and performing carrier modulation on the spread symbols, wherein N1 and N are positive integers, N2 is an integer, and the equivalent sequence comprises: a sequence formed by extending one of the two spreading sequences by the other spreading sequence, wherein the bit sequence carries first indication information or second indication information, the first indication information is used for at least indicating a non-orthogonal sequence in the two spreading sequences, and the second indication information is used for at least indicating a non-orthogonal sequence in the two spreading sequences for generating the equivalent sequence;
And carrying out receiving detection on the received carrier modulation signal.
According to another embodiment of the present disclosure, there is also provided an access apparatus including:
the code modulation module is used for code modulating a bit sequence to be transmitted to form N1 modulation symbols, adding N2 pilot symbols to the N1 modulation symbols to form N symbols, wherein N1 and N are positive integers, and N2 is an integer;
a spreading module configured to spread the N symbols using two spreading sequences or an equivalent sequence, wherein the equivalent sequence includes: a sequence formed by extending one of the two spreading sequences by the other spreading sequence, wherein the bit sequence carries first indication information or second indication information, the first indication information is used for at least indicating a non-orthogonal sequence in the two spreading sequences, and the second indication information is used for at least indicating a non-orthogonal sequence in the two spreading sequences in the equivalent sequence;
the carrier modulation module is used for carrying out carrier modulation on the expanded symbols to obtain carrier modulation signals;
and the sending module is used for sending the carrier modulation signal.
According to another embodiment of the present disclosure, there is also provided an access apparatus including:
A receiving module, configured to receive carrier modulation signals transmitted by multiple transmitters, where the carrier modulation signals are formed by encoding and modulating bit sequences to be transmitted by the transmitters to form N1 modulation symbols, adding N2 pilot symbols to the N1 modulation symbols to form N symbols, spreading the N symbols using two spreading sequences or an equivalent sequence, and performing carrier modulation on the spread symbols, where N1 and N are positive integers, N2 is an integer, and the equivalent sequence includes: a sequence formed by extending one of the two spreading sequences by the other spreading sequence, wherein the bit sequence carries first indication information or second indication information, the first indication information is used for at least indicating a non-orthogonal sequence in the two spreading sequences, and the second indication information is used for at least indicating generation of the non-orthogonal sequence in the two spreading sequences in the equivalent sequence;
and the detection module is used for receiving and detecting the received carrier modulation signal.
There is also provided, in accordance with another embodiment of the present disclosure, a transmitter including:
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 sent to form N1 modulation symbols, add N2 pilot symbols to the N1 modulation symbols to form N symbols, spread the N symbols using two spreading sequences or an equivalent sequence, perform carrier modulation on the spread symbols to obtain a carrier modulation signal, and send the carrier modulation signal, where N1 and N are positive integers, N2 is an integer, and the equivalent sequence includes: and a sequence formed by extending one of the two spreading sequences by the other spreading sequence, wherein the bit sequence carries first indication information or second indication information, the first indication information is used for at least indicating a non-orthogonal sequence in the two spreading sequences, and the second indication information is used for at least indicating a non-orthogonal sequence in the two spreading sequences in the equivalent sequence.
Optionally, the transmitter is in a sleep state when there is no data demand.
According to another embodiment of the present disclosure, there is also provided a terminal including: a transmitter as claimed in any preceding claim.
There is also provided, in accordance with another embodiment of the present disclosure, a receiver, including:
A second processor; a second memory for storing second processor-executable instructions;
the second processor is configured to receive carrier modulation signals transmitted by multiple transmitters, where the carrier modulation signals are encoded and modulated by the transmitters to form N1 modulation symbols, the N1 modulation symbols are added with N2 pilot symbols to form N symbols, the N symbols are spread by using two spreading sequences or an equivalent sequence, and the spread symbols are carrier-modulated to form the carrier modulation signals, where N1 and N are positive integers, N2 is an integer, and the equivalent sequence includes: and extending one of the two spreading sequences by another spreading sequence to form a sequence, wherein the bit sequence carries first indication information or second indication information, the first indication information is used for at least indicating a non-orthogonal sequence in the two spreading sequences, and the second indication information is used for at least indicating generation of the non-orthogonal sequence in the two spreading sequences in the equivalent sequence.
According to another embodiment of the present disclosure, there is also provided a storage medium including a stored program, wherein the program executes the access method of any one of the above.
According to the method, a bit sequence to be sent is coded and modulated into modulation symbols, N symbols are formed after pilot symbols are added to the modulation symbols, the N symbols comprising the modulation symbols and the pilot symbols are expanded through two expansion sequences or an equivalent sequence, carrier modulation is carried out on the expanded symbols, wherein the bit sequence carries first indication information or second indication information, and the first indication information is used for at least indicating non-orthogonal sequences in the two expansion sequences; the second indication information is used for indicating at least the non-orthogonal sequence in the equivalent sequence, and by adopting the technical scheme, the problems of serious conflict and poor reliability of a transmission access technology caused by massive access of machine communication in the related technology are solved, so that the reliability of an uplink access process is improved, and the excessive signaling interaction process of the uplink access process is avoided.
Drawings
The accompanying drawings, which are included to provide a further understanding of the disclosure and are incorporated in and constitute a part of this application, illustrate embodiment(s) of the disclosure and together with the description serve to explain the disclosure and not to limit the disclosure. In the drawings:
Fig. 1 is a schematic diagram of data symbol spreading in the related art;
fig. 2 is a flow chart of an access method according to an embodiment of the present disclosure;
fig. 3 is another flow chart of an access method according to an embodiment of the present disclosure;
fig. 4 is a block diagram of an uplink access apparatus according to an embodiment of the present disclosure;
fig. 5 is another block diagram of an uplink access apparatus according to an embodiment of the present disclosure;
fig. 6 is a further block diagram of an uplink access apparatus according to an embodiment of the present disclosure;
fig. 7 is a block diagram of a transmitter according to an embodiment of the present disclosure;
FIG. 8 is a 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 the preferred embodiment 1 of the present disclosure;
fig. 10 is a transmitter side pair signal processing flow chart according to a preferred embodiment 2 of the present disclosure;
fig. 11 is a transmitter side pair signal processing flow diagram according to the preferred embodiment 3 of the present disclosure;
fig. 12 is a transmitter side pair signal processing flow diagram according to the preferred embodiment 4 of the present disclosure;
fig. 13 is a flowchart of a transmitter side access method according to a preferred embodiment 5 of the present disclosure;
fig. 14 is a flowchart for determining an L1 long or L2 long spreading sequence according to terminal identity information according to a preferred embodiment of the present disclosure;
Fig. 15 is a constellation diagram of 4 complex constellation points in accordance with a preferred embodiment of the present disclosure;
fig. 16 is a constellation diagram of 9 complex constellation points according to a preferred embodiment of the present disclosure;
fig. 17 is a schematic diagram of a square constellation consisting of 8 complex constellation points according to a preferred embodiment of the present disclosure;
fig. 18 is a schematic diagram of a circular constellation of 8 complex constellation points in accordance with a preferred embodiment of the present disclosure;
fig. 19 is a flow chart (one) of obtaining the L1 long sequence or the L2 long sequence according to the additionally added bit sequence and the terminal identity information, and the value of the additionally added bit is a random value according to the preferred embodiment of the present disclosure;
fig. 20 is a flowchart (one) of obtaining the L1 long or L2 long sequence according to the extra added bit sequence and the terminal id information, and determining the value of the extra added bit according to the retransmission times according to the preferred embodiment of the present disclosure;
fig. 21 is a schematic diagram of modulation symbols respectively subjected to 4-long non-orthogonal spreading and 8-long orthogonal spreading according to a preferred embodiment of the present disclosure;
fig. 22 is a schematic diagram of modulation symbols respectively subjected to 8-length orthogonal spreading and 4-length non-orthogonal spreading according to a preferred embodiment of the present disclosure;
fig. 23 is a schematic diagram of modulation symbols respectively subjected to L-long sequence spreading according to a preferred embodiment of the present disclosure;
Fig. 24 is a schematic diagram of generating L sequences from 4 long non-orthogonal sequences and 8 long orthogonal sequences, respectively, according to a preferred embodiment of the present disclosure;
fig. 25 is a schematic diagram of the principle of generating L sequences from 8 long orthogonal sequences and 4 long non-orthogonal sequences, respectively, according to a preferred embodiment of the present disclosure;
FIG. 26 is a flow chart of a receiver in accordance with a preferred embodiment of the present disclosure;
fig. 27 is a flow chart (one) of data expansion at the transmitter side for multiple antennas according to the preferred embodiment of the present disclosure;
fig. 28 is a flow chart (ii) of data expansion at the transmitter side in multi-antenna according to a preferred embodiment of the present disclosure.
Detailed Description
The present disclosure will be described in detail below with reference to the accompanying drawings in conjunction with embodiments. It should be noted that the embodiments and features of the embodiments in the present application may be combined with each other without conflict.
It should be noted that the terms "first," "second," and the like in the description and claims of the present disclosure and in the foregoing drawings are used for distinguishing between similar elements and not necessarily for describing a particular sequential or chronological order.
In order to solve the problems of serious conflict and poor reliability of the transmission access technology caused by the massive access of machine communication, a general idea of the embodiment of the present disclosure is as follows: how to achieve good cdma performance? Or more directly how can the base station accurately separate the useful data information of each terminal from the composite signal? This is the key of cdma systems, and mainly involves two aspects: the system comprises a spreading sequence and a receiver, wherein the selection of the spreading sequence is a performance basis, and the design of the receiver is a performance guarantee.
Specifically, to achieve good access performance, the spreading sequences used by different terminals need to have good cross-correlation properties. If the spreading sequence is transmitted directly in a wireless multipath channel, such as a single-carrier code division multiplexing technique, the sequence is also required to have good autocorrelation characteristics to combat the time-delay multipath spreading of the sequence itself.
Because of the importance of spreading sequences, different cdma technologies differ mainly in the choice of spreading sequences. Direct Sequence-Code Division Multiple Access (DS-CDMA) is the most common CDMA Access technology, and has been adopted as an uplink multi-user Access technology by various wireless communication standards, and the spreading Sequence is based on the simplest binary Pseudo-random (PN) real Sequence. Due to sequence simplicity, DS-CDMA based on PN sequences is also one of the most dominant techniques for multi-carrier code division multiplexing, in which each modulated symbol is first spread by a binary pseudorandom real sequence and then transmitted via multi-carrier techniques.
In order to solve the above technical problem, an access method is provided in this embodiment, and fig. 2 is a flowchart of an access method according to an embodiment of the present disclosure, and as shown in fig. 2, the flowchart includes the following steps:
Step S202, coding and modulating the bit sequence to be transmitted to form N 1 A modulation symbol, N 1 One modulation symbol plus N 2 Forming N symbols after a pilot symbol, N 1 And N is a positive integer, N 2 Is an integer;
step S204, using two spreading sequences or an equivalent sequence to spread the N symbols, wherein the equivalent sequence includes: a sequence formed by extending one of the two spreading sequences by the other spreading sequence is provided, wherein a bit sequence carries first indication information or second indication information, the first indication information is used for indicating at least a non-orthogonal sequence in the two spreading sequences, and the second indication information is used for indicating at least a non-orthogonal sequence in the two spreading sequences for generating an equivalent sequence;
step S206, carrying out carrier modulation on the expanded symbol to obtain a carrier modulation signal, and sending the carrier modulation signal.
Through the steps, a bit sequence to be sent is coded and modulated to form a modulation symbol, N symbols are formed after the modulation symbol is added with a pilot frequency symbol, the N symbols comprising the modulation symbol and the pilot frequency symbol are expanded through two extension sequences or an equivalent sequence, and the expanded symbols are subjected to carrier modulation, wherein the bit sequence carries first indication information or second indication information, the first indication information is used for indicating at least non-orthogonal sequences in the two extension sequences, and the second indication information is used for indicating at least non-orthogonal sequences in the two extension sequences for generating the equivalent sequence.
The two spreading sequences are preferably spread by using a non-orthogonal sequence, and the symbol after non-orthogonal spreading is then spread by using an orthogonal sequence, but may also be spread by using an orthogonal sequence first and then the non-orthogonal sequence is used, and the equivalent sequence may be an equivalent sequence of spreading one of the two spreading sequences into the other, for example, the two spreading sequences are a and B, respectively, the equivalent sequence may be a BB sequence formed by spreading a into B, or an AA sequence formed by spreading B into a, where a and B may represent a non-orthogonal sequence and an orthogonal sequence, respectively.
In addition, the bit sequence may carry indication information indicating the non-orthogonal sequence and indication information indicating the orthogonal sequence, the indication information of the orthogonal sequence is usually indication information indicating the non-orthogonal sequence, and it is not desirable to additionally add the indication information to indicate the orthogonal sequence, which is not limited in the embodiments of the present disclosure.
It should be noted that the non-orthogonal sequence in the embodiment of the present disclosure is determined by at least one of the following ways: selecting from a set comprising a plurality of non-orthogonal sequences according to first indication information or second indication information in a bit sequence; generating from a 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: when the first indication information or the second indication information contains information capable of indicating an orthogonal sequence, selecting from a set containing a plurality of orthogonal sequences according to indication information for indicating the orthogonal sequence in a bit sequence; the non-orthogonal sequence and the orthogonal sequence are randomly selected from a set including a plurality of orthogonal sequences, and the determination manner of the non-orthogonal sequence and the orthogonal sequence, which can be known by those skilled in the art according to the capabilities of the non-orthogonal sequence and the orthogonal sequence, is within the scope of the embodiments of the present disclosure.
In an optional example of the embodiment of the present disclosure, the first indication information or the second indication information may carry at least the following information: terminal identity identification information; the terminal identification information and the plurality of bits generated in a specified manner or randomly may be understood as that one or more bits generated randomly are random and are not necessarily included in the first indication information or the second indication information, and the terminal identification information in the embodiment of the present disclosure includes at least one of the following: identification information uniquely identifying the terminal; the identity information used for indicating the terminal in the current network may specifically be a UE _ ID or a C-RNTI.
The randomly generated bit or bits are not completely randomly generated and may be determined according to one of the following parameters: the terminal identity identification information, the transmission times of the carrier modulation signals, the time-frequency position for sending the carrier modulation signals and the configuration information of the cell where the terminal is located.
Before the above steps are performed, the embodiments of the present disclosure may also prepare for: determining, by the broadcast information transmitted by the base station, at least one of: the length of at least one of the two spreading sequences; the above equivalent sequence length; the terminal may use the available time-frequency resources, that is, the base station in the embodiment of the present disclosure may notify the terminal of the resource pool of the currently available time-frequency resources through the broadcast information, and after knowing the information, the terminal may randomly select one available resource when sending data.
In a specific application, one of the spreading sequences mentioned in the embodiments of the present disclosure may be a complex spreading sequence, wherein, in various embodiments of the present disclosure, the complex spreading sequence may be a complex non-orthogonal sequence, as an example. For the complex spreading sequence, several determination manners are mainly provided in the embodiments of the present disclosure, but these determination manners are only used for illustration, and other determination manners of the complex spreading sequence that can be considered by those skilled in the art in light of the determination manners provided in the embodiments of the present disclosure are within the scope of the embodiments of the present disclosure.
First mode of determination
When the spreading sequence is a complex spreading sequence, the spreading sequence is determined by: each element of the complex spreading sequence is a complex number, and values of real parts and imaginary parts of all elements in the complex spreading sequence are from an M-element real number set, wherein M is an integer greater than or equal to 2;
wherein, when M is an odd number, the M-membered real number set is a set consisting of M integers in the range of [ - (M-1)/2, (M-1)/2 ]; or alternatively
When M is an even number, the M-element real number set is a set consisting of M odd numbers in the range of [ - (M-1), (M-1) ]; or
When M is an odd number, the M-element real number set is a set consisting of M real numbers obtained by respectively multiplying M integers in the range of [ - (M-1)/2, (M-1)/2 ] by an energy normalization coefficient corresponding to the M-element real number set; or alternatively
When M is an even number, the M-element real number set is a set consisting of M real numbers obtained by multiplying M odd numbers in the range of [ - (M-1), (M-1) ] by the energy normalization coefficient of the M-element real number set.
Second mode of determination
Generating an integer sequence according to the bit sequence, wherein values of all elements of the integer sequence are from an M × M-element integer set, the number of the elements is the same as the length of the non-orthogonal sequence, the M × M-element integer set is a set formed by all integers in a range of [0, M × M-1] or [1, M × M ], and M is an integer greater than or equal to 2;
according to elements in the integer sequence, selecting complex constellation points corresponding to the elements from a complex constellation diagram of M multiplied by M points according to a preset mapping rule;
and determining a complex number corresponding to the complex constellation point, and sequentially combining the complex numbers to obtain a complex spreading sequence, or sequentially combining the complex numbers multiplied by an energy normalization coefficient of the complex numbers to obtain the complex spreading sequence.
The value of M in the first and second determination methods is preferably 2, 3 or 4.
Third mode of determination
Generating an integer sequence according to the bit sequence, wherein values of all elements of the integer sequence are from an 8-element integer set, the number of the elements is the same as the length of the non-orthogonal sequence, and the 8-element integer set is a set consisting of all integers in a range of [0,7] or [1,8 ];
according to elements in the integer sequence, selecting a plurality of constellation points corresponding to the complex numbers from the 8-point complex constellation diagram according to a preset mapping rule;
and determining a complex number corresponding to the complex constellation point, and sequentially combining the complex number to obtain a complex spreading sequence, or multiplying the complex number by an energy normalization coefficient corresponding to the complex number and sequentially combining to obtain the complex spreading sequence.
There are various implementation manners of encoding and modulating in step S202, and in an optional example of the embodiment of the present disclosure, encoding is performed by using at least one of the following encoding manners: CRC coding and channel error correction coding; and modulating by adopting at least one of the following coding modes: BPSK, QPSK, 16QAM, 64QAM, preferably low order BPSK and QPSK modulation.
An optional implementation manner of step S206 may be to perform carrier modulation by at least one of the following manners: OFDM with CP; SC-FDMA modulation with CP; OFDM/SC-FDMA modulation of 1 subcarrier with CP.
Optionally, when one of the two spreading sequences is a complex spreading sequence, the two spreading sequences include: a complex field non-orthogonal sequence and an orthogonal sequence; a complex field non-orthogonal sequence and a non-orthogonal sequence, the orthogonal sequence including at least one of: walsh sequences, discrete Fourier Transform (DFT) sequences, zadoff-Chu sequences.
In the embodiment of the present disclosure, the sequence length of the orthogonal sequence may be 1, and the length of the non-orthogonal sequence may also be 1, and in fact, the orthogonal sequence is to increase the coverage, instead of the conventional simple repetition. For example, when an 8-long orthogonal sequence is despread, the energy accumulation of the sequence can be 8 times, and because the other 7 sequences are orthogonal to the sequence, the accumulated energy after despreading is 0. And if each user is simply repeated 8 times, other users cannot be eliminated.
In some cases, the number of pilot symbols included in the N symbols may be 0, that is, pilot symbols are not included, which is not specifically described in the embodiments of the present disclosure.
Example 2
In order to perfect the above technical solution, in the embodiment of the present disclosure, an access method is further provided, fig. 3 is another flowchart of the access method according to the embodiment of the present disclosure, and as shown in fig. 3, the process includes the following steps:
Step S302, receiving carrier modulation signals transmitted by a plurality of transmitters, wherein the carrier modulation signals are formed by encoding and modulating bit sequences to be transmitted by the transmitters to form N 1 A modulation symbol of N 1 One modulation symbol plus N 2 N symbols are formed after the pilot symbols are generated, and the N symbols are spread by using two spreading sequences or an equivalent sequence and the spread symbols are subjected to carrier modulation, wherein N is formed 1 And N is a positive integer, N 2 Is an integer, equivalent sequences include: a sequence formed by extending one of the two spreading sequences by the other spreading sequence is provided, wherein a bit sequence carries first indication information or second indication information, and the first indication information is used for indicating at least non-orthogonal sequences in the two spreading sequences; the second indication information is used for indicating at least a non-orthogonal sequence in two spreading sequences for generating equivalent sequences;
step S304 is to perform reception detection on the received carrier modulated signal.
Through the steps, the carrier modulation signals transmitted by a plurality of transmitters are received, and the carrier modulation information is received and detected, wherein the carrier modulation signals are formed by encoding and modulating a bit sequence to be transmitted through the transmitters to form modulation symbols, N symbols are formed by adding pilot symbols to the modulation symbols, the N symbols are expanded by using two expansion sequences or an equivalent sequence, and the expanded symbols are formed by carrying out carrier modulation.
The carrier modulation signals received in step S302 are sent by multiple transmitters in the same video resource pool, and the signals received in step S302 may be multiple signals that are superimposed together.
Through the above description of the embodiments, those skilled in the art can clearly understand that the method according to the above embodiments can be implemented by software plus a necessary general hardware platform, and certainly can also be implemented by hardware, but the former is a better implementation mode in many cases. Based on such understanding, the technical solutions of the present disclosure may be embodied in the form of a software product, which is stored in a storage medium (e.g., ROM/RAM, magnetic disk, optical disk) and includes instructions for enabling a terminal device (e.g., a mobile phone, a computer, a server, or a network device) to execute the method of the embodiments of the present disclosure.
Example 3
In this embodiment, an uplink access apparatus is further provided, and the apparatus is used to implement the foregoing embodiments and preferred embodiments, and details of which have been already described are omitted. As used below, the term "module" may be a combination of software and/or hardware that implements a predetermined function. Although the means described in the embodiments below are preferably implemented in software, an implementation in hardware or a combination of software and hardware is also possible and contemplated.
Fig. 4 is a block diagram of an uplink access apparatus according to an embodiment of the present disclosure, and as shown in fig. 4, the apparatus includes:
a code modulation module 40 for code modulating the bit sequence to be transmitted to form N 1 A modulation symbol of N 1 One modulation symbol plus N 2 Forming N symbols after a pilot symbol, N 1 And N isPositive integer, N 2 Is an integer;
a spreading module 42, configured to spread the N symbols by using two spreading sequences or an equivalent sequence, where the equivalent sequence includes: extending one of the two spreading sequences by a sequence formed by the other spreading sequence, wherein a bit sequence carries first indication information or second indication information, and the first indication information is used for indicating at least a non-orthogonal sequence of the two spreading sequences; the second indication information is used for indicating at least a non-orthogonal sequence in the two spreading sequences for generating the equivalent sequence;
a carrier modulation module 44, configured to perform carrier modulation on the extended symbol to obtain a carrier modulation signal;
and a transmitting module 46, configured to transmit the carrier modulation signal.
Through the function of each module, a bit sequence to be sent is coded and modulated into N symbols, the N symbols comprising modulation symbols and pilot symbols are spread through two spreading sequences or an equivalent sequence, and the spread symbols are subjected to carrier modulation, wherein the bit sequence carries first indication information or second indication information, and the first indication information is used for at least indicating a non-orthogonal sequence in the two spreading sequences; the technical scheme is adopted, so that the problems of serious conflict and poor reliability of a transmission access technology caused by massive access of machine communication in related technologies are solved, the reliability of an uplink access process is improved, and the excessive signaling interaction process of the uplink access process is avoided.
The two spreading sequences are preferably spread by using a non-orthogonal sequence first, the symbol after non-orthogonal spreading is then spread by using an orthogonal sequence, certainly, the symbol may also be spread by using an orthogonal sequence first, and then the non-orthogonal sequence is used, the equivalent sequence may be a non-orthogonal sequence obtained after spreading the orthogonal sequence, or a sequence obtained by equivalently spreading the two spreading sequences, the two spreading sequences in the embodiment of the present disclosure may be a non-orthogonal sequence and an orthogonal sequence, or both of the two spreading sequences may be non-orthogonal sequences, and may be specifically adjusted according to actual situations.
It should be noted that the non-orthogonal sequence in the embodiment of the present disclosure is determined by at least one of the following methods: selecting from a set comprising a plurality of non-orthogonal sequences according to first indication information or second indication information in a bit sequence; generating according to a sequence generator according to first indication information or second indication information in a bit sequence; the orthogonal sequence is determined by at least one of: when the first indication information or the second indication information contains information capable of indicating an orthogonal sequence, selecting from a set containing a plurality of orthogonal sequences according to indication information for indicating the orthogonal sequence in a bit sequence; the determination of the non-orthogonal sequence and the orthogonal sequence, which can be known to those skilled in the art according to the abilities of the non-orthogonal sequence and the orthogonal sequence, is randomly selected from a set comprising a plurality of orthogonal sequences, and is within the scope of the embodiments of the present disclosure.
In an optional example of the embodiment of the present disclosure, the first indication information or the second indication information may carry the following information: terminal identity identification information; the terminal identity information and the randomly generated bits may be understood as that the randomly generated bits are random and are not necessarily included in the indication information of the non-orthogonal sequence, and the terminal identity information in the embodiment of the present disclosure includes at least one of the following: identification information uniquely identifying the terminal; the identity information used for indicating the terminal in the current network may specifically be a UE _ ID or a C-RNTI.
The randomly generated bits are not completely randomly generated and may be determined according to one of the following parameters: the terminal identity identification information, the transmission times of the carrier modulation signals, the time-frequency position for sending the carrier modulation signals and the configuration information of the cell in which the terminal is positioned.
Fig. 5 is another structural block diagram of an uplink access apparatus according to an embodiment of the present disclosure, and as shown in fig. 5, the apparatus further includes a determining module 48, configured to determine, through broadcast information sent by a base station, at least one of the following: the length of at least one of the two spreading sequences; the sequence length of the equivalent sequence; the terminal may use the available time-frequency resources, that is, the base station in the embodiment of the present disclosure may notify the terminal of the resource pool of the currently available time-frequency resources through the broadcast information, and after knowing the information, the terminal may randomly select one available resource when sending data next time.
In a specific application, the spreading sequence mentioned in the embodiments of the present disclosure may be a complex spreading sequence, and for the complex spreading sequence, several determination manners are mainly given in the embodiments of the present disclosure, but these determination manners are merely used for illustration, and other determination manners of the complex spreading sequence that can occur to those skilled in the art in light of the determination manners provided in the embodiments of the present disclosure are within the scope of the embodiments of the present disclosure.
First mode of determination
The determining module 48 is further configured to determine, when one of the spreading sequences is a complex spreading sequence, the spreading sequence by: each element of the complex spreading sequence is a complex number, and values of real parts and imaginary parts of all elements in the complex spreading sequence are from an M-element real number set, wherein M is an integer greater than or equal to 2;
wherein, when M is an odd number, the M-membered real number set is a set consisting of M integers in the range of [ - (M-1)/2, (M-1)/2 ]; or
When M is an even number, the M-element real number set is a set consisting of M odd numbers in the range of [ - (M-1), (M-1) ]; or
When M is an odd number, the M-element real number set is a set consisting of M real numbers obtained by respectively multiplying M integers in the range of [ - (M-1)/2, (M-1)/2 ] by an energy normalization coefficient corresponding to the M-element real number set; or
When M is an even number, the M-element real number set is a set consisting of M real numbers obtained by multiplying M odd numbers in the range of [ - (M-1), (M-1) ] by the energy normalization coefficient of the M-element real number set.
Second mode of determination
The determining module 48 is further configured to determine the spreading sequence when the spreading sequence is a complex spreading sequence by:
generating an integer sequence according to the bit sequence, wherein values of all elements of the integer sequence are from an M × M-element integer set, the number of the elements is the same as the length of the non-orthogonal sequence, the M × M-element integer set is a set formed by all integers in a range of [0, M × M-1] or [1, M × M ], and M is an integer greater than or equal to 2;
selecting a complex constellation point corresponding to an element from a complex constellation diagram of an M multiplied by M point according to the element in the integer sequence and a preset mapping rule;
and determining a complex number corresponding to the complex constellation point, and sequentially combining the complex numbers to obtain a complex spreading sequence, or sequentially combining the complex numbers multiplied by an energy normalization coefficient of the complex numbers to obtain the complex spreading sequence.
The value of M in the first and second determination methods is preferably 2, 3 or 4.
Third mode of determination
The determining module 48 is further configured to determine the spreading sequence when the spreading sequence is a complex spreading sequence by:
Generating an integer sequence according to the bit sequence, wherein values of all elements of the integer sequence are from an 8-element integer set, the number of the elements is the same as the length of the non-orthogonal sequence, and the 8-element integer set is a set consisting of all integers in a range of [0,7] or [1,8 ];
according to elements in the integer sequence, selecting a plurality of constellation points corresponding to the complex numbers from the 8-point complex constellation diagram according to a preset mapping rule;
and determining a complex number corresponding to the complex constellation point, and sequentially combining the complex numbers to obtain a complex spreading sequence, or multiplying the complex number by an energy normalization coefficient corresponding to the complex number and then sequentially combining to obtain the complex spreading sequence.
Optionally, 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 modulate using at least one of the following coding schemes: BPSK, QPSK, 16QAM, 64QAM, preferably low-order BPSK and QPSK modulation.
In the embodiment of the present disclosure, the carrier modulation module 44 is further configured to perform carrier modulation in at least one of the following manners: OFDM with CP; SC-FDMA modulation with CP; OFDM/SC-FDMA modulation of 1 subcarrier with CP.
In the embodiment of the present disclosure, the sequence length of the orthogonal sequence may be 1, and the length of the non-orthogonal sequence may also be 1, and in fact, the orthogonal sequence is to increase the coverage, instead of the traditional simple repetition. For example, when an 8-long orthogonal sequence is despread, the energy accumulation of the sequence can be 8 times, and because the other 7 sequences are orthogonal to the sequence, the accumulated energy after despreading is 0. And if each user is simply repeated 8 times, other users cannot be eliminated.
Example 4
In this embodiment, an uplink access apparatus is further provided, and the apparatus is used to implement the foregoing embodiments and preferred embodiments, and details of which have been already described are omitted. As used below, the term "module" may be a combination of software and/or hardware that implements a predetermined function. Although the means described in the embodiments below are preferably implemented in software, an implementation in hardware, or a combination of software and hardware is also possible and contemplated.
Fig. 6 is a further structural block diagram of an uplink access apparatus according to an embodiment of the present disclosure, and as shown in fig. 6, the apparatus includes:
a receiving module 60, configured to receive carrier modulation signals transmitted by multiple transmitters, where the carrier modulation signals are formed by the transmitters by code-modulating bit sequences to be transmitted to form N 1 A modulation symbol of N 1 One modulation symbol plus N 2 N symbols are formed after each pilot frequency symbol, two spreading sequences or one equivalent sequence are used for spreading the N symbols, and the spread symbols are subjected to carrier modulation to form the pilot frequency carrier 1 And N is a positive integer, N 2 As integers, equivalent sequences include: equivalent sequences include: a sequence formed by extending one of the two spreading sequences by the other spreading sequence is provided, wherein a bit sequence carries first indication information or second indication information, and the first indication information is used for indicating at least non-orthogonal sequences in the two spreading sequences; the second indication information is used for indicating at least a non-orthogonal sequence in the two spreading sequences for generating the equivalent sequence;
and a detection module 62, configured to perform reception detection on the received carrier modulation signal.
The technical scheme is adopted to solve the problems of serious conflict and poor reliability of a transmission access technology caused by massive access of machine communication in the related technology, further improve the reliability of an uplink access process and avoid excessive signaling interaction process of the uplink access process.
Example 5
In practical applications, an embodiment of the present disclosure further provides a transmitter, and fig. 7 is a block diagram of a structure of the transmitter according to the embodiment of the present disclosure, as shown in fig. 7, including:
a first processor 70;
a first memory 72 for storing processor-executable instructions; wherein the first processor 70 is used for coding and modulating the bit sequence to be transmitted into N 1 A modulation symbol of N 1 One modulation symbol plus N 2 Forming N symbols after each pilot frequency symbol, using two spreading sequences or an equivalent sequence to spread the N symbols, carrying out carrier modulation on the spread symbols to obtain carrier modulation signals, and sending the carrier modulation signals, wherein N is 1 And N is positive integerNumber, N 2 As integers, equivalent sequences include: a sequence formed by extending one of the two spreading sequences by the other spreading sequence is provided, wherein a bit sequence carries first indication information or second indication information, and the first indication information is used for indicating at least non-orthogonal sequences in the two spreading sequences; the second indication information indicates a non-orthogonal sequence of at least two spreading sequences generating an equivalent sequence.
An optional application scenario of the embodiments of the present disclosure: at present under the condition that needs a large amount of machine communication, many times need put in millions of terminal to a certain area, set up the transmitter in the terminal inside all can, if adopt traditional access method, need random access or the interactive process of shaking hands, need a large amount of signaling interaction like this, the electric quantity of extravagant terminal, the cost of terminal has also been increased, and through the access method of this disclosure embodiment, even the terminal volume of putting in is very big, but because the access method is simple, do not need too much signaling interaction process, and then also reduced terminal power consumption, terminal cost is reduced, the reliability of the access process of ascending has also been increased simultaneously.
In order to better save the power of the terminal, the transmitter is in a dormant state when no data is needed.
In an embodiment of the present disclosure, a terminal is further provided, which includes the transmitter described in any one of the above.
Example 6
Fig. 8 is a block diagram of a receiver according to an embodiment of the disclosure, as shown in fig. 8, including:
a second processor 80;
a second memory 82 for storing second processor-executable instructions;
wherein, the second processor 80 is configured to receive carrier modulation signals transmitted by a plurality of transmitters, and when the carrier modulation signals are transmitted, the transmitters perform coded modulation on bit sequences to be transmitted to form N 1 A modulation symbol of N 1 One modulation symbol plus N 2 Forming N symbols after each pilot frequency symbol, using two spreading sequences or an equivalent sequence to spread the N symbols, and spreading the N symbolsIs formed by carrier modulation of the symbols of (1), wherein N 1 And N is a positive integer, N 2 Is an integer, equivalent sequences include: equivalent sequences include: a sequence formed by extending one of the two spreading sequences by the other spreading sequence is provided, wherein a bit sequence carries first indication information or second indication information, and the first indication information is used for indicating at least non-orthogonal sequences in the two spreading sequences; the second indication information indicates a non-orthogonal sequence of at least two spreading sequences generating an equivalent sequence.
The structure and operation principle of the above transmitter and receiver are described below with reference to an example, but the present disclosure is not limited thereto.
The transmitter provided by the embodiment of the present disclosure may include:
sequence determination means configured to determine a real PN sequence or a complex spreading sequence to be used, L elements of the real PN sequence having values from [ -1, +1] set, each element of the complex spreading sequence being a complex number, and values of real parts and imaginary parts of all elements in the complex spreading sequence being from an M-element real number set, where M is an integer greater than or equal to 2;
the spreading device is configured to spread data symbols to be transmitted by adopting a complex spreading sequence to generate a spread symbol sequence;
a signal transmitting device configured to transmit the spread symbol sequence.
Optionally, the values of the real part and the imaginary part of all the elements in the complex spreading sequence determined by the sequence determining device are from an M-ary real number set, where:
m is an odd number, and the M-element real number set is a set consisting of M integers in the range of [ - (M-1)/2, (M-1)/2 ]; or
M is an even number, and the M-element real number set is a set consisting of M odd numbers in the range of [ - (M-1), (M-1) ]; or
M is an odd number, and the M-element real number set is a set consisting of M real numbers obtained by respectively multiplying M integers in the range of [ - (M-1)/2, (M-1)/2 ] by corresponding normalization coefficients; or
M is an even number, and the M-element real number set is a set consisting of M real numbers obtained by multiplying M odd numbers in the range of [ - (M-1), (M-1) ] by corresponding normalization coefficients respectively.
Optionally, the values of the real part and the imaginary part of all elements in the complex spreading sequence determined by the sequence determining device are from an M-element real number set, where M =2 or 3 or 4.
Optionally, the sequence determining means determines a complex spreading sequence to be used, comprising:
selecting a complex non-orthogonal sequence from a complex non-orthogonal sequence set preset by a transceiving system according to an agreed rule, and determining the complex non-orthogonal sequence as a complex spreading sequence; or
According to the complex non-orthogonal sequence index information sent by the base station, selecting a complex non-orthogonal sequence from a complex non-orthogonal sequence set preset by a transceiving system, and determining the complex non-orthogonal sequence as a complex spreading sequence;
and each complex non-orthogonal sequence in the complex non-orthogonal sequence set has values of real parts and imaginary parts of all elements from the M-element real number set.
Optionally, the sequence determining means determines a complex spreading sequence to be used, comprising:
Generating a pseudo-random integer sequence, wherein the integer sequence has L elements and all the elements are from an M × M-element integer set, the M × M-element integer set is a set composed of all integers in a range of [0, M × M-1] or [1, M × M ], and L is an integer greater than or equal to 2;
selecting corresponding L complex constellation points from a complex constellation diagram of M multiplied by M points according to L elements in the pseudorandom integer sequence and a preset mapping rule;
and determining L complex numbers corresponding to the L complex constellation points, and sequentially combining the L complex numbers to obtain a complex spreading sequence, or sequentially combining the L complex numbers multiplied by corresponding energy normalization coefficients to obtain the complex spreading sequence.
Optionally, the signal transmitting apparatus transmits the extended symbol sequence, including: and carrying out OFDM or SC-FDMA multi-carrier modulation with CP on the spread symbol sequence to form a transmission signal and transmitting the transmission signal.
Optionally, the signal transmitting apparatus transmits the extended symbol sequence, including: and carrying out single carrier modulation on the spread symbol sequence to form a transmitting signal and transmitting.
The receiver provided by the embodiment of the disclosure may include:
the signal receiving device is configured to receive signals transmitted by a plurality of transmitters, and the signals transmitted by the plurality of transmitters are formed by respectively adopting respective complex spreading sequences to spread respective data symbols to be transmitted by the plurality of transmitters and then respectively modulating the generated spread symbol sequences to the same time-frequency resources;
The receiving detection device is configured to adopt the interference elimination signal detector to carry out receiving detection on the received signals transmitted by the plurality of transmitters, and the complex spreading sequences adopted by the plurality of transmitters are used for detection;
each element of the complex spreading sequence is a complex number, and values of real parts and imaginary parts of all elements in the complex spreading sequence are from an M-element real number set, wherein M is an integer greater than or equal to 2.
Optionally, in the complex spreading sequence used by multiple transmitters when the receiving and detecting apparatus detects, values of real parts and imaginary parts of all elements are derived from an M-ary real number set, where:
m is an odd number, and the M-element real number set is a set consisting of M integers in the range of [ - (M-1)/2, (M-1)/2 ]; or
M is an even number, and the M-element real number set is a set consisting of M odd numbers in the range of [ - (M-1), (M-1) ]; or
M is an odd number, and the M-element real number set is a set consisting of M real numbers obtained by respectively multiplying M integers in the range of [ - (M-1)/2, (M-1)/2 ] by corresponding normalization coefficients; or alternatively
M is an even number, and the M-element real number set is a set consisting of M real numbers obtained by multiplying M odd numbers in the range of [ - (M-1), (M-1) ] by corresponding normalization coefficients.
Optionally, in the complex spreading sequence used by multiple transmitters when the receiving and detecting apparatus detects, values of real parts and imaginary parts of all elements are derived from an M-ary real number set, where: m =2,3 or 4.
In order to better understand the uplink access process provided by the embodiment of the present disclosure, the following explains the above technical solutions with reference to the preferred embodiment, where necessary, the technical solutions of the preferred embodiment may be used in combination, and the present disclosure does not limit this.
Preferred embodiment 1
A preferred embodiment 1 of the present disclosure provides an access method based on extension, fig. 9 is a flowchart of a transmitter-side signal processing procedure according to the preferred embodiment 1 of the present disclosure, and as shown in fig. 9, the transmitter-side signal processing procedure includes: the terminal codes and modulates a 'bit sequence' by CRC + convolutional codes to become 144 modulation symbols, then adds 24 pilot symbols (carried by time-frequency resources which are corresponding to the data plus pilot symbols and need 1 Physical Resource Block (PRB for short), then uses a 4-length complex field spreading sequence, then uses a Walsh orthogonal spreading sequence with 8 lengths (or 4 lengths) to spread (the spread symbols need 32 (or 16) PRB time-frequency resources to carry), and finally uses OFDM/SC-FDMA/DFT-S-OFDM with CP to modulate the spread symbols and send the modulated symbols to a base station; the base station separates information of the respective terminals using an advanced receiver.
Preferred embodiment 2
Fig. 10 is a flow chart of transmitter side pair signal processing according to the preferred embodiment 2 of the present disclosure, as shown in fig. 10: the terminal encodes and modulates the 'bit sequence' by CRC + convolutional code to 144 modulation symbols, then adds 24 pilot symbols (the data plus the pilot symbols correspond to time-frequency resources needing LTE 1 PRB to carry), then uses 8-long (or 4-long) Walsh orthogonal spreading sequences to spread, then uses a 4-long complex number domain spreading sequence (the spread symbols need LTE32 (or 16) PRB time-frequency resources to carry), and finally uses OFDM/SC-FDMA/DFT-S-OFDM with CP to modulate the spread symbols and sends the modulated symbols to the base station; the base station separates the information of the respective terminals using an advanced receiver.
Preferred embodiment 3
Fig. 11 is a transmitter-side pair signal processing flow chart according to the preferred embodiment 3 of the present disclosure, and as shown in fig. 11, the transmitter-side pair signal processing procedure: the terminal encodes and modulates the 'bit sequence' by CRC + convolutional code to 144 modulation symbols, then adds 24 pilot symbols (the data plus the time-frequency resource corresponding to the pilot symbols and needing LTE 1 PRB is used for carrying), then uses a 32-long (or 16-long) spreading sequence to spread the modulation symbols, the 32-long (or 16-long) spreading sequence is obtained by spreading 8-long (or 4-long) Walsh orthogonal spreading sequence and 4-long complex domain spreading sequence, and finally uses OFDM/SC-FDMA/DFT-S-OFDM with CP to modulate the spread symbols and sends the modulated symbols to the base station; the base station separates information of the respective terminals using an advanced receiver.
Preferred embodiment 4
Fig. 12 is a transmitter-side pair signal processing flow chart according to a preferred embodiment 4 of the present disclosure, and as shown in fig. 12, the transmitter-side pair signal processing procedure: the terminal changes a 'bit sequence' into 144 modulation symbols after CRC + convolutional code coding and modulation, then adds 24 pilot symbols (the data plus the pilot symbols are carried by the time-frequency resources which need 1 PRB of LTE), then uses a 4-long complex domain spreading sequence, finally modulates the spread symbols by OFDM/SC-FDMA/DFT-S-OFDM with CP, and sends the symbols to the base station; the base station separates the information of the respective terminals using an advanced receiver.
Preferred embodiment 5
Fig. 13 is a flowchart of a transmitter side access method according to a preferred embodiment 5 of the present disclosure, as shown in fig. 13, including:
in step S1302, a 4-long complex spreading sequence or an 8-long (or 4-long) orthogonal spreading sequence is determined according to the bit sequence information. In the preferred embodiment of the present disclosure, the identification information UE _ ID of the terminal itself may be a bit sequence 40 long, and the length of UE _ ID is suggested to be greater than 16, C1 is a complex field binary spreading sequence 4 long, C2 is a Walsh orthogonal spreading sequence 8 long, and the value of the element in C2 takes on { +1, -1}.
The bit sequence contains the bit sequence of the information for identifying the identity of the terminal in the network (or the information capable of representing the identity of the terminal, which may be collectively referred to as terminal identity, for example, part or all of the information of the identity information UE _ ID of the terminal itself, or temporary identity in the network) or an additionally added bit sequence; the length and value of the extra bit sequence are related to the terminal identity information, or the transmission times, or the size of the data packet, or the time-frequency position, or the cell configuration.
Determining a 4-long complex spreading sequence or an 8-long (or 4-long) orthogonal spreading sequence according to the bit sequence information, and according to whether to add extra bits and the different roles of the added bits, dividing into the following three schemes:
the first scheme is as follows: as shown in fig. 14, a 4-long complex spreading sequence or an 8-long (or 4-long) orthogonal spreading sequence is determined according to the terminal identity information, and additional added bits are not used to introduce randomness:
the generation process of the non-orthogonal spreading sequence C1 and the orthogonal spreading sequence C2 is more specifically introduced in combination with the application scenario given by the preferred embodiment of the present disclosure:
a method for generating a complex field binary spreading sequence C1, which can be divided into the following three parts:
(1) The UE _ ID is here a 40-long binary bit sequence of 0,1, e.g. a 39 a 38 ……a 1 a 0 Converting the bit sequence into decimal number, the decimal conversion method is as follows: a is 39 ×2 39 +a 38 ×2 38 +……+a 1 ×2 1 +a 0 ×2 0 ＝A。
Taking the 2 × 2 integer set as an example, the transmitter generates an index value of an integer sequence in which the values of the elements are all from a 4-ary integer set {0,1,2,3}, and the length of the integer sequence is 4.
To generate the above-described integer sequence, first, a bit sequence (a) needs to be generated i ……a 0 ) Performing 4 times of cyclic shift, i is more than or equal to 0 and less than or equal to 39, and the step length of each cyclic shift can be 0 bit or positive integer, and then using the decimal conversion method to obtain decimal number A of the bit sequence after each cyclic shift 1 、A 2 、A 3 And A 4 。
Finally, according to the decimal number A 1 、A 2 、A 3 And A 4 And solving the value of each element in the integer sequence as follows: a. The 1 mod 4、A 2 mod 4、A 3 mod 4 and A 4 mod 4, where A p mod 4 represents the value modulo 4, p belongs to {1,2,3,4}, and the resulting sequence of integers { A } 1 mod 4、A 2 mod 4、A 3 mod 4、A 4 mod 4}。
In another embodiment, for example, using a 3 × 3 integer set, the transmitter generates an index value for a sequence of integers whose elements are derived from a 9-ary integer set {0,1,2, \ 8230 \8230;, 8}, and whose length is 4.
To generate the above-mentioned integer sequence, first, the bit sequence a needs to be generated i ……a 0 Performing 4 times of cyclic shift, i is more than or equal to 0 and less than or equal to 39, the step length of each cyclic shift can be 0 bit or positive integer, and the decimal number A of the bit sequence after each cyclic shift is obtained by the decimal conversion method 1 、A 2 、A 3 And A 4 。
Finally, according to the decimal number A 1 、A 2 、A 3 And A 4 And solving the value of each element in the integer sequence as follows: a. The 1 mod 9、A 2 mod 9、A 3 mod 9 and A 4 mod 9, where A p mod 9 represents the value modulo 9, p belongs to {1,2,3,4}, and the resulting sequence of integers { A } 1 mod 9、A 2 mod 9、A 3 mod 9、A 4 mod 9}。
In another embodiment, the transmitter generates an index value for a sequence of integers whose elements are derived from an 8-ary integer set {0,1,2, \ 8230 \ 8230;, 7}, and whose length is 4.
To generate the integer sequence, first, the bit sequence a needs to be generated i ……a 0 Performing 4 cyclic shifts, i is more than or equal to 0 and less than or equal to 39, and each cyclic shiftThe step length can be 0 bit or positive integer, and the decimal number A of the bit sequence after each cyclic shift is obtained by the decimal conversion method 1 、A 2 、A 3 And A 4 。
Finally, according to the decimal number A 1 、A 2 、A 3 And A 4 And solving the value of each element in the integer sequence as follows: a. The 1 mod 8、A 2 mod 8、A 3 mod 8 and A 4 mod 8, where A p mod 8 represents the value modulo 8, p belongs to {1,2,3,4}, and the resulting sequence of integers { A } 1 mod 8、A 2 mod 8、A 3 mod 8、A 4 mod 8}。
(2) And constructing a constellation diagram which is associated with the index value and contains 4 complex constellation points. The values of the real part and the imaginary part of each constellation point in the complex constellation diagram are from a 2-element real number set, and the 2-element real number set is represented as [ -1, +1].
Therefore, the complex numbers corresponding to the 4 complex constellation points are-1 + j, -1-j, and 1-j, respectively.
In another embodiment, a constellation diagram is constructed that contains 9 complex constellation points associated with the index value. The values of the real part and the imaginary part of each constellation point in the complex constellation diagram are from a 3-element real number set, and the 3-element real number set is represented as [ -1,0, +1].
Therefore, the complex numbers corresponding to the 9 complex constellation points are-1 + j, -1-j, -1, +1, and 0, respectively.
In another embodiment, a constellation diagram is constructed that contains 8 complex constellation points associated with the index value. The complex number corresponding to each constellation point in the complex constellation diagram is-1 + j, -1-j, -1 and +1 respectively, that is, no 0 point is contained.
In another embodiment, a constellation diagram is constructed that contains 8 complex constellation points associated with the index value. The complex number corresponding to each constellation point in the complex constellation diagram is (-1 + j)/sqrt (2), (-1-j)/sqrt (2), (1-j)/sqrt (2), -j, -1 and +1, respectively, that is, no 0 point is contained.
(3) Selecting 4 corresponding complex constellation points from a 4-point complex constellation diagram according to a preset mapping rule according to 4 elements in the pseudorandom integer sequence;
the complex spreading sequence is generated by mapping the index value of the integer sequence in (1) to the complex constellation points of the 4-point complex constellation (each complex constellation point represents a complex number) bit by bit according to the mapping relationship between the elements in the 4-element integer set and the complex constellation points of the 4-point complex constellation (as shown in fig. 15), and is expressed by the following formula:
A p —>ComplexSeq p ；
Wherein, complexSeq p Representing the p-th element of the complex spreading sequence, and obtained by Ap mapping according to the mapping relation between the elements in the 4-element integer set and the complex constellation points of the 4-point complex constellation diagram, A p Representing the p-th element of the pseudorandom integer sequence.
And determining 4 complex numbers corresponding to the 4 complex constellation points according to the integer sequence index value, and sequentially combining the 4 complex numbers to obtain a complex spreading sequence, or sequentially combining the 4 complex numbers multiplied by corresponding energy normalization coefficients to obtain the complex spreading sequence.
In another embodiment, the complex spreading sequence is generated by mapping the index values of the integer sequence in (1) to the complex constellation points of the 9-point complex constellation (each complex constellation point represents a complex number) bit by bit according to the mapping relationship between the elements in the 9-element integer set and the complex constellation points of the 9-point complex constellation (as shown in fig. 16), and is formulated as follows:
A p —>ComplexSeq p ；
wherein, complexSeq p Representing the p-th element of the complex spreading sequence, and obtained by Ap mapping according to the mapping relation between the elements in the 9-element integer set and the complex constellation points of the 9-point complex constellation diagram, A p Representing the p-th element of the pseudorandom integer sequence.
And determining 4 complex numbers corresponding to the 9 complex constellation points according to the integer sequence index value, and sequentially combining the 4 complex numbers to obtain a complex spreading sequence, or sequentially combining the 4 complex numbers multiplied by corresponding energy normalization coefficients to obtain the complex spreading sequence.
In another embodiment, the complex spreading sequence is generated by mapping the index values of the sequence of integers in (1) to the complex constellation points of the 8-point complex constellation (each complex constellation point represents a complex number) 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), and is formulated as follows:
A p —>ComplexSeq p ；
wherein, complexSeq p Representing the p-th element of the complex spreading sequence, and according to the mapping relation between the elements in the 8-element integer set and the complex constellation points of the 8-point complex constellation diagram, the p-th element is represented by A p Mapping to obtain p Representing the p-th element of the pseudorandom integer sequence.
And according to the integer sequence index value, 4 complex numbers corresponding to 8 complex constellation points are determined, and the 4 complex numbers are sequentially combined to obtain a complex spreading sequence, or the 4 complex numbers are multiplied by corresponding energy normalization coefficients and then are sequentially combined to obtain the complex spreading sequence.
In another embodiment, the complex spreading sequence is generated by mapping the index values of the sequence of integers in (1) to the complex constellation points of the 8-point complex constellation (each complex constellation point represents a complex number) 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), and is formulated as follows:
A p —>ComplexSeq p ；
Wherein, complexSeq p Representing the p-th element of the complex spreading sequence, according to the mapping relation between the elements in the 8-element integer set and the complex constellation points of the 8-point complex constellation diagram, A p Mapping to obtain, A p Representing the p-th element of the pseudorandom integer sequence.
And according to the integer sequence index value, 4 complex numbers corresponding to 8 complex constellation points are determined, and the 4 complex numbers are sequentially combined to obtain a complex spreading sequence, or the 4 complex numbers are multiplied by corresponding energy normalization coefficients and then are sequentially combined to obtain the complex spreading sequence.
(II) another method for generating a complex field binary spreading sequence C1, and the method can be divided into the following three parts:
(1) Here the UE _ ID is a 40-long sequence of 0, 1 binary bits, e.g., a 39 a 38 ……a 1 a 0 Converting the bit sequence into decimal number, the decimal conversion method is as follows: a is 39 ×2 39 +a 38 ×2 38 +……+a 1 ×2 1 +a 0 ×2 0 ＝A。
Taking a 2-element real number set as an example, it is determined that a 4-long non-orthogonal spreading sequence is to be generated, each element of the non-orthogonal spreading sequence is a complex number, values of real parts and imaginary parts of all elements in the spreading sequence are from a 2-element real number set, and the 2-element real number set is a set composed of odd numbers in a range of [ -1, +1 ].
Generating an index value of an integer from the UE _ ID, the index value being from one (2X 2) 4 Set of prime integers, the set of 256 prime integers is [0, 256-1 ]]Or [1, 256 ]]A set of all integers within the range;
to generate the index value of the integer, first, the bit sequence a needs to be generated i ……a 0 The decimal number is converted, and i is more than or equal to 0 and less than or equal to 39; then, the decimal number pair 256 is subjected to modulo operation, and the obtained modulo value is the index value.
In another embodiment, taking a 3-element real number set as an example, it is determined that a 4-long non-orthogonal spreading sequence is to be generated, each element of the non-orthogonal spreading sequence is a complex number, and values of real parts and imaginary parts of all elements in the spreading sequence are derived from a 3-element real number set, and the 3-element real number set is a set consisting of odd numbers in a range of [ -1,0, +1 ].
Generating an index value of an integer from the UE _ ID, the index value being from one (3X 3) 4 The set of prime integers, the set of 6561 prime integers is [0, 6561-1 ]]Or [1, 6561 ]]A set of all integers within the range;
to generate the index value of the integer, first, the bit sequence a needs to be generated i ……a 0 The decimal number is converted, and i is more than or equal to 0 and less than or equal to 39; then, the decimal above is addedThe system number pair 6561 is subjected to modular operation, and the obtained modular value is the index value.
In another embodiment, a 3-ary real number set is taken as an example, it is determined that a 4-long non-orthogonal spreading sequence is to be generated, each element of the non-orthogonal spreading sequence is a complex number, and values of real parts and imaginary parts of all elements in the spreading sequence are derived from a 3-ary real number set, the 3-ary real number set is a set consisting of odd numbers in the range of [ -1,0, +1], but it is required that real parts and imaginary parts of all elements in the spreading sequence cannot be 0 at the same time.
Generating an index value of an integer from a 4096-tuple integer set, the 4096-tuple integer set being [0, 4096-1] or a set of all integers in the [1, 4096] range according to the UE _ ID;
to generate the index value of the integer, first, the bit sequence a needs to be set i ……a 0 The decimal number is converted, and i is more than or equal to 0 and less than or equal to 39; then, the decimal number is subjected to a modular operation on 4096, and the obtained modular value is an index value.
(2) Constructing a set (table) of 4 long complex field non-orthogonal sequences;
taking a 2-element real number set as an example, it is determined that a 4-long non-orthogonal spreading sequence is to be generated, each element of the non-orthogonal spreading sequence is a complex number, values of real parts and imaginary parts of all elements in the spreading sequence are from a 2-element real number set, and the 2-element real number set is a set composed of odd numbers in a range of [ -1, +1 ].
And combining the obtained 4 complex numbers in sequence to obtain a complex spreading sequence, or multiplying the 4 complex numbers by corresponding energy normalization coefficients and then combining in sequence to obtain the complex spreading sequence.
Then the set of non-orthogonal sequences generated at this time has (2 x 2) 4 A sequence of bars.
In another embodiment, a 3-ary real number set is taken as an example, it is determined that a 4-long non-orthogonal spreading sequence is to be generated, each element of the non-orthogonal spreading sequence is a complex number, values of real parts and imaginary parts of all elements in the spreading sequence are derived from a 3-ary real number set, and the 3-ary real number set is a set consisting of odd numbers in the range of [ -1,0, +1 ].
And combining the obtained 4 complex numbers in sequence to obtain a complex spreading sequence, or multiplying the 4 complex numbers by corresponding energy normalization coefficients and combining in sequence to obtain the complex spreading sequence.
Then the set of non-orthogonal sequences generated at this time has (3 × 3) 4 A sequence of bars.
In another embodiment, for example, a 3-element real number set, it is determined that a 4-long non-orthogonal spreading sequence is to be generated, each element of the non-orthogonal spreading sequence is a complex number, and values of real parts and imaginary parts of all elements in the spreading sequence are derived from a 3-element real number set, where the 3-element real number set is a set consisting of odd numbers in a range of [ -1,0, +1 ].
And combining the obtained 4 complex numbers in sequence to obtain a complex spreading sequence, or multiplying the 4 complex numbers by corresponding energy normalization coefficients and combining in sequence to obtain the complex spreading sequence.
However, it is required that the real part and imaginary part of all elements in the spreading sequence cannot be 0 at the same time, so that the set of non-orthogonal sequences generated at this time has (3X 3-1) 4 A sequence of bars.
(3) According to the index value in (1) and according to the preset mapping rule, including (2X 2) from (2) 4 Selecting one from a set (table) of 4 long non-orthogonal sequences; alternatively, the first and second electrodes may be,
According to the index value in (1) and preset mapping rule, including (3X 3) from (2) 4 Selecting one from a set (table) of 4 long non-orthogonal sequences of strips; or
According to the index value in (1) and the preset mapping rule, the index value in (2) comprises (3X 3-1) 4 One of a set (table) of 4 long non-orthogonal sequences of bars is selected.
(iii) a method of generating an 8-long (or 4-long) Walsh orthogonal spreading sequence C2, which can be divided into the following three parts:
(1) Here the UE _ ID is a 40-long sequence of 0, 1 binary bits, e.g., a 39 a 38 ……a 1 a 0 Converting the bit sequence into a decimal number of tenThe method for carrying out the binary conversion comprises the following steps: a is a 39 ×2 39 +a 38 ×2 38 +……+a 1 ×2 1 +a 0 ×2 0 ＝A。
Determining to generate a Walsh orthogonal spreading sequence set with a sequence length of 8 (or 4), wherein each element of each orthogonal sequence in the sequence set is derived from { -1, +1}, and the total number of the orthogonal sequences in the orthogonal sequence set is 8 (or 4).
Generating an index value of an integer from an 8-ary (or 4-ary) integer set, the 8-ary (or 4-ary) integer set being a set of all integers in a range of [0,8-1] or [1,8] (or in a range of [0,4-1] or [1,4 ]), according to the UE _ ID;
to generate the index value of the integer, first, a needs to be set i ……a 0 The decimal number is converted, and i is more than or equal to 0 and less than or equal to 39; then, the decimal number is modulo-operated on 8, and the obtained modulo value is the index value.
(2) Constructing a set (table) of 8 Walsh orthogonal spreading sequences of length 8 (or 4 Walsh orthogonal spreading sequences of length 4);
for example, one method of generating 8 Walsh sequences 8 long (or 4 Walsh sequences 4 long) is given:
for example, one method of generating 8 long Walsh sequences is given:
first order H 2 Comprises the following steps:
Figure GDA0003742351690000361
then H 4 And H 8 Respectively as follows:
Figure GDA0003742351690000371
Figure GDA0003742351690000372
wherein, is prepared from H 8 Each row or each column ofAn 8 long Walsh code sequence can be constructed.
Alternatively, the first and second electrodes may be,
for example, one method of generating 4 long Walsh sequences is given:
first order H 2 Comprises the following steps:
Figure GDA0003742351690000373
then H 4 Comprises the following steps:
Figure GDA0003742351690000374
wherein, is formed by H 4 Each row or column in (a) can construct a 4-long Walsh code sequence.
(3) And (2) selecting one from a set (table) containing 8 Walsh orthogonal spreading sequences with the length of 8 (or 4 Walsh orthogonal spreading sequences with the length of 4) according to the index value in (1) and a preset mapping rule.
(4) Another method of generating an 8-long (or 4-long) Walsh orthogonal spreading sequence C2 can be divided into the following two parts:
(1) Constructing a set (table) of 8 Walsh orthogonal spreading sequences of length 8 (or 4 Walsh orthogonal spreading sequences of length 4);
for example, one method of generating 8 Walsh sequences 8 long (or 4 Walsh sequences 4 long) is given:
For example, one method of generating 8 long Walsh sequences is given:
first order H 2 Comprises the following steps:
Figure GDA0003742351690000381
then H 4 And H 8 Respectively as follows:
Figure GDA0003742351690000382
Figure GDA0003742351690000383
wherein, is formed by H 8 Each row or column in the set can construct an 8-long Walsh code sequence.
Alternatively, the first and second electrodes may be,
for example, one method of generating 4 long Walsh sequences is given:
first order H 2 Comprises the following steps:
Figure GDA0003742351690000384
then H 4 Comprises the following steps:
Figure GDA0003742351690000385
wherein, is formed by H 4 Each row or column in (a) can construct a 4-long Walsh code sequence.
(2) Randomly selecting one from a set (table) of 8 Walsh orthogonal spreading sequences (1) with 8 lengths (or 4 Walsh orthogonal spreading sequences with 4 lengths).
Scheme two is as follows: as shown in fig. 19, a 4-long complex spreading sequence or an 8-long (or 4-long) orthogonal spreading sequence is determined according to an additionally added bit sequence (the bit sequence length may be greater than or equal to 0), and a bit sequence of the terminal identification information (the bit sequence length may be greater than or equal to 0). Because the value of the additionally added bit sequence is randomly selected at each retransmission, the additionally added bit sequence can play a role of randomization:
in combination with the application scenario given in the preferred embodiment of the present disclosure, the generation process of the non-orthogonal spreading sequence C1 and the orthogonal spreading sequence C2 is described more specifically:
a method for generating a complex field binary spreading sequence C1, which can be divided into the following three parts:
(1) The UE _ ID is here a 40-long binary bit sequence of 0,1, e.g. a 39 a 38 ……a 1 a 0 Converting the bit sequence into decimal number, the decimal conversion method is as follows: a is 39 ×2 39 +a 38 ×2 38 +……+a 1 ×2 1 +a 0 ×2 0 . The length of the additionally added bit sequence is greater than or equal to 0, and each element is equal to {0,1}.
Taking the 2 × 2 integer set as an example, the transmitter generates an index value of an integer sequence in which the values of the elements are all from a 4-ary integer set {0,1,2,3}, and the length of the integer sequence is 4.
When the extra bit is b M ……b 0 And M is>When 0, in order to generate the above-mentioned integer sequence, first, a bit sequence (a) is required i ……a 0 +b m ……b 0 ) Performing 4 times of cyclic shift, i is more than or equal to 0 and less than or equal to 39, M is more than or equal to 0 and less than or equal to M, the step length of each cyclic shift can be 0 bit or positive integer, and then using the decimal conversion method to obtain the decimal number A of the bit sequence after each cyclic shift 1 、A 2 、A 3 And A 4 . When the transmission fails, the values of the additionally added Y bits are randomly selected in each retransmission, or the values of the additionally added Y bits are randomly selected in each cyclic shift;
alternatively, the first and second liquid crystal display panels may be,
when the extra bit is b M ……b 0 And M is>When 0, in order to generate the above-mentioned integer sequence, first, a bit sequence (a) is required i ……a 0 ) Performing 4 times of cyclic shift, i is more than or equal to 0 and less than or equal to 39, the step length of each cyclic shift can be 0 bit or positive integer, and then using the decimal conversion method to obtain the decimal number B of the bit sequence after each cyclic shift 1 、B 2 、B 3 And B 4 . A bit sequence (b) m ……b 0 ) Decimal conversion is carried out, M is more than or equal to 0 and less than or equal to M, and the operation result is compared with B 1 、B 2 、B 3 And B 4 Adding to obtain new 4 decimal numbers A 1 、A 2 、A 3 And A 4 . When the transmission fails, the values of the additionally added Y bits are randomly selected during each retransmission;
alternatively, the first and second electrodes may be,
when the extra bit is b M ……b 0 And M is>When 0, in order to generate the above-mentioned integer sequence, first, a bit sequence (a) is required i ……a 0 +b m ……b 0 ) In (b) m ……b 0 ) Randomizing 4 times, i is more than or equal to 0 and less than or equal to 39, M is more than or equal to 0 and less than or equal to M, and each time contains randomized bit sequence (a) i ……a 0 +b m ……b 0 ) Conversion of sequences into decimal numbers A 1 、A 2 、A 3 And A 4 . When the transmission fails, the values of the additionally added Y bits are randomized for 4 times in each retransmission;
or
When the extra bit is b M ……b 0 And M is>0, in order to generate the above-mentioned integer sequence, first, a bit sequence (b) whose initial value is randomly selected is required m ……b 0 ) Performing 4 times of cyclic shift or randomly taking 4 values, M is more than or equal to 0 and less than or equal to M, the step length of each cyclic shift can be 0 bit or positive integer, and then using the decimal conversion method to obtain decimal number A of the bit sequence after each cyclic shift 1 、A 2 、A 3 And A 4 . And when the transmission fails, the value of the additionally added Y bits is randomly selected during each retransmission.
Finally, according to the decimal number A 1 、A 2 、A 3 And A 4 And solving the value of each element in the integer sequence as follows: a. The 1 mod 4、A 2 mod 4、A 3 mod 4 and A 4 mod 4, where A p mod 4 represents a value modulo 4, p belongs to {1,2,3,4}, and the resulting sequence of integers { A } 1 mod 4、A 2 mod 4、A 3 mod 4、A 4 mod 4}。
In another embodiment, for example, using a 3 × 3 integer set, the transmitter generates an index of an integer sequence, the values of the elements of the integer sequence are from a 9-ary integer set {0,1,2, \ 8230 \ 8230; \ 8}, and the length of the integer sequence is 4.
When the extra bit is b M ……b 0 And M is>0, in order to generate the above-mentioned integer sequence, first, a bit sequence (a) is required i ……a 0 +b m ……b 0 ) Performing 4 times of cyclic shift, i is more than or equal to 0 and less than or equal to 39, M is more than 0 and less than or equal to M, the step length of each cyclic shift can be 0 bit or positive integer, and then using the decimal conversion method to obtain decimal number A of the bit sequence after each cyclic shift 1 、A 2 、A 3 And A 4 . When the transmission fails, the values of the additionally added Y bits are randomly selected in each retransmission, or the values of the additionally added Y bits are randomly selected in each cyclic shift;
Alternatively, the first and second electrodes may be,
when the extra bit is b M ……b 0 And M is>When 0, in order to generate the above-mentioned integer sequence, first, a bit sequence (a) is required i ……a 0 ) Performing 4 times of cyclic shift, i is more than or equal to 0 and less than or equal to 39, and the step length of each cyclic shift can be 0 bit or positive integer, and then using the decimal conversion method to obtain the decimal number B of the bit sequence after each cyclic shift 1 、B 2 、B 3 And B 4 . Bit sequence (b) m ……b 0 ) Decimal conversion is carried out, M is more than or equal to 0 and less than or equal to M, and the operation result is compared with B 1 、B 2 、B 3 And B 4 Adding to obtain new 4 decimal numbers A 1 、A 2 、A 3 And A 4 . When the transmission fails, the values of the additionally added Y bits are randomly selected during each retransmission;
alternatively, the first and second electrodes may be,
when the extra bit is b M ……b 0 And M is>When 0, in order to generate the above-mentioned integer sequence, first, a bit sequence (a) is required i ……a 0 +b m ……b 0 ) In (b) m ……b 0 ) Randomizing 4 times, i is more than or equal to 0 and less than or equal to 39, M is more than or equal to 0 and less than or equal to M, and each time contains randomized bit sequence (a) i ……a 0 +b m ……b 0 ) Conversion of sequences into decimal numbers A 1 、A 2 、A 3 And A 4 . When the transmission fails, the values of the additionally added Y bits are randomized for 4 times in each retransmission;
or alternatively
When the extra bit is b M ……b 0 And M is>0, in order to generate the above-mentioned integer sequence, first, a bit sequence (b) whose initial value is randomly selected is required m ……b 0 ) Performing 4 times of cyclic shift or randomly taking 4 values, M is more than or equal to 0 and less than or equal to M, the step length of each cyclic shift can be 0 bit or positive integer, and then using the decimal conversion method to obtain decimal number A of the bit sequence after each cyclic shift 1 、A 2 、A 3 And A 4 . And when the transmission fails, the value of the additionally added Y bits is randomly selected during each retransmission.
Finally, according to the decimal number A 1 、A 2 、A 3 And A 4 And solving the value of each element in the integer sequence as follows: a. The 1 mod 9、A 2 mod 9、A 3 mod 9 and A 4 mod 9, where A p mod 9 represents the value modulo 9, p belonging to {1,2,3,4}.
In another embodiment, the transmitter generates a sequence of integer index values, the values of the elements of the sequence of integers are from an 8-ary set of integers {0,1,2, \8230;, 7}, and the sequence of integers has a length of 4.
When the extra bit is b M ……b 0 And M is>When 0, in order to generate the above-mentioned integer sequence, first, a bit sequence (a) is required i ……a 0 +b m ……b 0 ) Performing cyclic shift 4 times, i is more than or equal to 0 and less than or equal to 39, M is more than or equal to 0 and less than or equal to M, and the step size of each cyclic shift can be 0 bit,Or positive integer number of bits, and calculating decimal number A of bit sequence after each cyclic shift by the decimal conversion method 1 、A 2 、A 3 And A 4 . When the transmission fails, the values of the additionally added Y bits are randomly selected in each retransmission, or the values of the additionally added Y bits are randomly selected in each cyclic shift;
alternatively, the first and second electrodes may be,
when the extra bit is b M ……b 0 And M is>When 0, in order to generate the above-mentioned integer sequence, first, a bit sequence (a) is required i ……a 0 ) Performing 4 times of cyclic shift, i is more than or equal to 0 and less than or equal to 39, the step length of each cyclic shift can be 0 bit or positive integer, and then using the decimal conversion method to obtain the decimal number B of the bit sequence after each cyclic shift 1 、B 2 、B 3 And B 4 . A bit sequence (b) m ……b 0 ) Decimal conversion is carried out, M is more than or equal to 0 and less than or equal to M, and the operation result is compared with B 1 、B 2 、B 3 And B 4 Adding to obtain new 4 decimal numbers A 1 、A 2 、A 3 And A 4 . When the transmission fails, the values of the additionally added Y bits are randomly selected during each retransmission;
alternatively, the first and second liquid crystal display panels may be,
when the extra bit is b M ……b 0 And M is>When 0, in order to generate the above-mentioned integer sequence, first, a bit sequence (a) is required i ……a 0 +b m ……b 0 ) In (b) m ……b 0 ) Randomizing 4 times, i is more than or equal to 0 and less than or equal to 39, M is more than or equal to 0 and less than or equal to M, and each time contains randomized bit sequence (a) i ……a 0 +b m ……b 0 ) Conversion of sequences into decimal numbers A 1 、A 2 、A 3 And A 4 . When the transmission fails, the values of the additionally added Y bits are randomized for 4 times in each retransmission;
or alternatively
When the extra bit is b M ……b 0 And M is>0, in order to generate the above-mentioned integer sequence, first, a bit sequence (b) whose initial value is randomly selected is required m ……b 0 ) Performing 4 times of cyclic shift or randomly taking 4 values, M is more than or equal to 0 and less than or equal to M, the step length of each cyclic shift can be 0 bit or positive integer, and then using the decimal conversion method to obtain decimal number A of the bit sequence after each cyclic shift 1 、A 2 、A 3 And A 4 . And when the transmission fails, the value of the additionally added Y bits is randomly selected during each retransmission.
Finally, according to the decimal number A 1 、A 2 、A 3 And A 4 And solving the value of each element in the integer sequence as follows: a. The 1 mod 8、A 2 mod 8、A 3 mod 8 and A 4 mod 8, where A p mod 8 represents the value modulo 8, p belonging to {1,2,3,4}.
(2) And constructing a constellation diagram which is associated with the index value and contains 4 complex constellation points. The values of the real part and the imaginary part of each constellation point in the complex constellation diagram are from a 2-element real number set, and the 2-element real number set is represented as [ -1, +1].
Therefore, the complex numbers corresponding to the 4 complex constellation points are-1 + j, -1-j, and 1-j, respectively.
In another embodiment, a constellation diagram is constructed that contains 9 complex constellation points associated with the index value. The values of the real part and the imaginary part of each constellation point in the complex constellation diagram are from a 3-element real number set, and the 3-element real number set is represented as [ -1,0, +1].
Therefore, the plural numbers corresponding to the 9 plural constellation points are-1 + j, -1-j, -1, +1, and 0, respectively.
In another embodiment, a constellation diagram comprising 8 complex constellation points associated with the index value is constructed. The complex number corresponding to each constellation point in the complex constellation diagram is-1 + j, -1-j, -1 and +1 respectively, that is, no 0 point is contained.
In another embodiment, a constellation diagram comprising 8 complex constellation points associated with the index value is constructed. The complex number corresponding to each constellation point in the complex constellation diagram is (-1 + j)/sqrt (2), (-1-j)/sqrt (2), (1-j)/sqrt (2), -j, -1, +1, respectively, that is, no 0 point is contained.
(3) Selecting corresponding 4 complex constellation points from a 4-point complex constellation diagram according to a preset mapping rule and 4 elements in the pseudorandom integer sequence;
the complex spreading sequence is generated by mapping the index value of the integer sequence in (1) to the complex constellation points of the 4-point complex constellation (each complex constellation point represents a complex number) bit by bit according to the mapping relationship between the elements in the 4-element integer set and the complex constellation points of the 4-point complex constellation (as shown in fig. 15), and is expressed by the following formula:
A p —>ComplexSeq p ；
Wherein, complexSeq p Representing the p-th element of the complex spreading sequence, and according to the mapping relation between the elements in the 4-element integer set and the complex constellation points of the 4-point complex constellation diagram, the p-th element is represented by A p Mapping to obtain, A p Representing the p-th element of the pseudorandom integer sequence.
And determining 4 complex numbers corresponding to the 4 complex constellation points according to the integer sequence index value, and sequentially combining the 4 complex numbers to obtain a complex spreading sequence, or sequentially combining the 4 complex numbers multiplied by corresponding energy normalization coefficients to obtain the complex spreading sequence.
In another embodiment, the complex spreading sequence is generated by mapping the index values of the integer sequence in (1) to the complex constellation points of the 9-point complex constellation (each complex constellation point represents a complex number) 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), and is formulated as follows:
A p —>ComplexSeq p ；
wherein, complexSeq p Representing the p-th element of the complex spreading sequence, and according to the mapping relation between the elements in the 9-element integer set and the complex constellation points of the 9-point complex constellation diagram, the p-th element is represented by A p Mapping to obtain p To indicate a falseThe p-th element of the random integer sequence.
And determining 4 complex numbers corresponding to the 9 complex constellation points according to the integer sequence index value, and sequentially combining the 4 complex numbers to obtain a complex spreading sequence, or sequentially combining the 4 complex numbers multiplied by corresponding energy normalization coefficients to obtain the complex spreading sequence.
In another embodiment, the complex spreading sequence is generated by mapping the index values of the sequence of integers in (1) to the complex constellation points of the 8-point complex constellation (each complex constellation point represents a complex number) 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), and is formulated as follows:
A p —>ComplexSeq p ；
wherein, complexSeq p And expressing the p-th element of the complex spreading sequence, and mapping by Ap according to the mapping relation between the element in the 8-element integer set and the complex constellation point of the 8-point complex constellation diagram, wherein Ap expresses the p-th element of the pseudorandom integer sequence.
And determining 4 complex numbers corresponding to 8 complex constellation points according to the integer sequence index value, and sequentially combining the 4 complex numbers to obtain a complex spreading sequence, or sequentially combining the 4 complex numbers multiplied by corresponding energy normalization coefficients to obtain the complex spreading sequence.
In another embodiment, the complex spreading sequence is generated by mapping the index values of the sequence of integers in (1) to the complex constellation points of the 8-point complex constellation (each complex constellation point represents a complex number) 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), and is formulated as follows:
A p —>ComplexSeq p ；
Wherein ComplexSeqi represents the p-th element of the complex spreading sequence, and A represents the mapping relation between the element in the 8-element integer set and the complex constellation point of the 8-point complex constellation diagram p Mapping to obtain, A p Representing the p-th element of the pseudorandom integer sequence.
And according to the integer sequence index value, 4 complex numbers corresponding to 8 complex constellation points are determined, and the 4 complex numbers are sequentially combined to obtain a complex spreading sequence, or the 4 complex numbers are multiplied by corresponding energy normalization coefficients and then are sequentially combined to obtain the complex spreading sequence.
(II) another method for generating a complex field binary spreading sequence C1, and the method can be divided into the following three parts:
(1) The UE _ ID is here a 40-long binary bit sequence of 0,1, e.g. a 39 a 38 ……a 1 a 0 Converting the bit sequence into decimal number, the decimal conversion method is as follows: a is 39 ×2 39 +a 38 ×2 38 +……+a 1 ×2 1 +a 0 ×2 0 And (d) = a. The length of the additional bit sequence is greater than or equal to 0, each element takes on the value of 0,1, and the additional bit is b M ……b 0 And M is>0。
Taking a 2-element real number set as an example, it is determined that a 4-long non-orthogonal spreading sequence is to be generated, each element of the non-orthogonal spreading sequence is a complex number, values of real parts and imaginary parts of all elements in the spreading sequence are derived from a 2-element real number set, the 2-element real number set is a set composed of odd numbers in the range { -1, +1}, and then 256 non-orthogonal sequences are determined in total for the 4-long non-orthogonal sequence set.
For this purpose, an integer index value is generated, according to which a non-orthogonal sequence in the set of non-orthogonal sequences can be uniquely assigned and the index value is derived from one (2 x 2) 4 Set of prime integers, the set of 256 prime integers is [0, 256-1 ]]Or [1, 256 ]]A set of all integers within the range;
when the extra bit is b M ……b 0 And M is>When 0, to generate an index value of an integer to specify one of the 4-long non-orthogonal sequence sets, first, a bit sequence (a) needs to be assigned i ……a 0 +b m ……b 0 ) Converting into a decimal number, i is more than or equal to 0 and less than or equal to 39, M is more than 0 and less than or equal to M; then, the decimal number is modulo-operated to 256, and the obtained modulo value is the index value. And when the transmission fails, the amount of the data is increasedThe value of the added Y bits is randomly selected at each retransmission.
Alternatively, the first and second liquid crystal display panels may be,
when the extra bit sequence is b M ……b 0 And M is>When 0, in order to generate an index value of an integer to specify one of the 4 long non-orthogonal sequence sets, first, a bit sequence (b) is required m ……b 0 ) Converting into a decimal number, wherein M is more than 0 and less than or equal to M; then, the decimal number pair 256 is subjected to modulo operation, and the obtained modulo value is the index value. And when the transmission fails, the values of the additionally added Y bits need to be randomly taken during each retransmission.
In another embodiment, taking a 3-ary real number set as an example, it is determined that a 4-long non-orthogonal spreading sequence is to be generated, each element of the non-orthogonal spreading sequence is a complex number, and values of real parts and imaginary parts of all elements in the spreading sequence are derived from a 3-ary real number set, and the 3-ary real number set is a set consisting of odd numbers in the range of [ -1,0, +1 ].
According to the bit sequence (a) i ……a 0 +b m ……b 0 ) Generating an index value of an integer, 0 ≦ i ≦ 39,0 ≦ M ≦ M, the index value from one (3 × 3) 4 The set of prime integers, the set of 6561 prime integers is [0, 6561-1 ]]Or [1, 6561 ]]A set of all integers within the range;
to generate the index value of the integer, first, (a) needs to be set i ……a 0 +b m ……b 0 ) I is more than or equal to 0 and less than or equal to 39, M is more than or equal to 0 and less than or equal to M; then, the decimal number is modulo-operated on 6561, and the obtained modulo value is the index value. And when the transmission fails, the values of the additionally added Y bits need to be randomly taken during each retransmission.
Alternatively, the first and second electrodes may be,
when the extra added bit sequence is b M ……b 0 And (b) is M ……b 0 ) When the decimal value is larger than 6561, in order to generate an index value of an integer to specify one of the 4 long non-orthogonal sequence sets, it is first necessary to put the bit sequence (b) m ……b 0 ) Converting into a decimal number, wherein M is more than or equal to 0 and less than or equal to M; then, the decimal number is modulo-operated on 6561, and the obtained modulo value is the index value. And when the transmission fails, the values of the additionally added Y bits need to be randomly taken during each retransmission.
In another embodiment, a 3-element real number set is taken as an example, it is determined that a 4-long non-orthogonal spreading sequence is to be generated, each element of the non-orthogonal spreading sequence is a complex number, and values of real parts and imaginary parts of all elements in the spreading sequence are derived from a 3-element real number set, the 3-element real number set is a set consisting of odd numbers in a range of [ -1,0, +1], but it is required that real parts and imaginary parts of all elements in the spreading sequence cannot be 0 at the same time.
According to (a) i ……a 0 +b m ……b 0 ) Generating an index value for an integer, i 0 ≦ 39, M0 ≦ M, the index value being from a 4096-tuple integer set, the 4096-tuple integer set being [0, 4096-1 ]]Or [1, 4096]A set of all integers within the range;
to generate the index value of the integer, first, (a) needs to be added i ……a 0 +b m ……b 0 ) I is more than or equal to 0 and less than or equal to 39, M is more than or equal to 0 and less than or equal to M; then, the decimal number is subjected to a modular operation on 4096, and the obtained modular value is an index value. And when the transmission fails, the values of the additionally added Y bits need to be randomly taken during each retransmission.
Alternatively, the first and second electrodes may be,
when the extra bit sequence is b M ……b 0 And (b) is M ……b 0 ) When the decimal value is larger than 4096, in order to generate an index value of an integer to specify one of the 4-long non-orthogonal sequence sets, it is first necessary to assign a bit sequence (b) m ……b 0 ) Converting into a decimal number, wherein M is more than or equal to 0 and less than or equal to M; then, the decimal number is subjected to a modular operation on 4096, and the obtained modular value is an index value. And when the transmission fails, the values of the additionally added Y bits need to be randomly taken during each retransmission.
(2) Constructing a set (table) of 4-long complex field non-orthogonal sequences;
taking a 2-element real number set as an example, it is determined that a 4-long non-orthogonal spreading sequence is to be generated, each element of the non-orthogonal spreading sequence is a complex number, values of real parts and imaginary parts of all elements in the spreading sequence are from a 2-element real number set, and the 2-element real number set is a set composed of odd numbers in a range of { -1, +1 }.
And combining the obtained 4 complex numbers in sequence to obtain a complex spreading sequence, or multiplying the 4 complex numbers by corresponding energy normalization coefficients and then combining in sequence to obtain the complex spreading sequence.
Then the set of non-orthogonal sequences generated at this time has (2 x 2) 4 A sequence of bars.
In another embodiment, a 3-element real number set is taken as an example, it is determined that a 4-long non-orthogonal spreading sequence is to be generated, each element of the non-orthogonal spreading sequence is a complex number, values of real parts and imaginary parts of all elements in the spreading sequence are derived from a 3-element real number set, and the 3-element real number set is a set composed of odd numbers in the range of { -1,0, +1 }.
And combining the obtained 4 complex numbers in sequence to obtain a complex spreading sequence, or multiplying the 4 complex numbers by corresponding energy normalization coefficients and combining in sequence to obtain the complex spreading sequence.
Then the set of non-orthogonal sequences generated at this time has (3 x 3) 4 A sequence of bars.
In another embodiment, for example, a 3-element real number set, it is determined that a 4-long non-orthogonal spreading sequence is to be generated, each element of the non-orthogonal spreading sequence is a complex number, and values of real parts and imaginary parts of all elements in the spreading sequence are derived from a 3-element real number set, where the 3-element real number set is a set consisting of odd numbers in a range of { -1,0, +1 }.
And combining the obtained 4 complex numbers in sequence to obtain a complex spreading sequence, or multiplying the 4 complex numbers by corresponding energy normalization coefficients and combining in sequence to obtain the complex spreading sequence.
However, it is required that the real part and imaginary part of all elements in the spreading sequence cannot be 0 at the same time, so that the non-orthogonal sequence set generated at this time isHezhonghas (3X 3-1) 4 A sequence of bars.
(3) According to the index value in (1) and according to the preset mapping rule, including (2X 2) from (2) 4 Selecting one from a set (table) of 4 long non-orthogonal sequences; alternatively, the first and second electrodes may be,
according to the index value in (1) and the preset mapping rule, the index value in (2) comprises (3 x 3) 4 Selecting one from a set (table) of 4 long non-orthogonal sequences of strips; or
According to the index value in (1) and the preset mapping rule, the index value in (2) comprises (3X 3-1) 4 One of a set (table) of 4 long non-orthogonal sequences of bars is selected.
(iii) a method of generating an 8-long (or 4-long) Walsh orthogonal spreading sequence C2, which can be divided into the following three parts:
(1) Here the UE _ ID is a 40-long sequence of 0,1 binary bits, e.g., a 39 a 38 ……a 1 a 0 Converting the bit sequence into decimal number, the decimal conversion method is as follows: a is a 39 ×2 39 +a 38 ×2 38 +……+a 1 ×2 1 +a 0 ×2 0 And (d) = a. The length of the additional bit sequence is greater than or equal to 0, each element takes on the value of 0,1, and the additional bit is b M ……b 0 And M is>0。
Determining to generate a Walsh orthogonal spreading sequence set with a sequence length of 8 (or 4), wherein each element of each orthogonal sequence in the sequence set is derived from { -1, +1}, and the total number of the orthogonal sequences in the orthogonal sequence set is 8 (or 4).
According to the index value of an integer to be generated, the index value of the integer uniquely specifies one sequence in the orthogonal sequence set, and the index value is from an 8-element (or 4-element) integer set, wherein the 8-element (or 4-element) integer set is a set composed of all integers in a range of [0,8-1] or [1,8] (or a range of [0,4-1] or [1,4 ]);
when the extra bit is b M ……b 0 And M is>0, in order to generate the above-mentioned integer sequence, first,the bit sequence (a) needs to be converted into i ……a 0 +b m ……b 0 ) Converting the decimal number into a decimal number, i is more than or equal to 0 and less than or equal to 39, M is more than or equal to 0 and less than or equal to M, then taking the modulus of the obtained decimal number to 8 (or 4), and obtaining the value which is the integer index value by taking the modulus. When the transmission fails, the values of the additionally added Y bits are randomly taken during each retransmission;
or alternatively
When the extra bit is b M ……b 0 And M is>0, in order to generate the above-mentioned integer sequence, a bit sequence (b) whose initial value is randomly selected is required m ……b 0 ) Converting the decimal number into a decimal number, wherein M is more than or equal to 0 and less than or equal to M, and then performing modulus operation on the obtained decimal number to 8 (or 4) to obtain a value which is an integer index value. And when the transmission fails, the value of the additionally added Y bits is randomly selected during each retransmission.
(2) Constructing a set (table) of 8 long Walsh orthogonal spreading sequences;
for example, one method of generating 8 Walsh sequences 8 long (or 4 Walsh sequences 4 long) is given:
for example, one method of generating 8 long Walsh sequences is given:
first order H 2 Comprises the following steps:
Figure GDA0003742351690000501
then H 4 And H 8 Respectively as follows:
Figure GDA0003742351690000502
Figure GDA0003742351690000503
wherein, is formed by H 8 Each row or column in the set can construct an 8-long Walsh code sequence.
Alternatively, the first and second electrodes may be,
for example, one method of generating 4 long Walsh sequences is given:
first order H 2 Comprises the following steps:
Figure GDA0003742351690000504
then H 4 Comprises the following steps:
Figure GDA0003742351690000511
wherein, is formed by H 4 Each row or column in (a) can construct a 4-long Walsh code sequence. (3) And (2) selecting one from a set (table) containing 8 Walsh orthogonal spreading sequences with the length of 8 (or 4 Walsh orthogonal spreading sequences with the length of 4) according to the index value in (1) and a preset mapping rule.
(4) Another method of generating an 8 long (or 4) Walsh orthogonal spreading sequence C2 can be divided into the following two parts:
(1) Constructing a set (table) of 8 Walsh orthogonal spreading sequences of length 8 (or 4 Walsh orthogonal spreading sequences of length 4);
for example, one method of generating 8 Walsh sequences 8 (or 4 Walsh sequences 4) long is given:
for example, one method of generating 8 long Walsh sequences is given:
first order H 2 Comprises the following steps:
Figure GDA0003742351690000512
then H 4 And H 8 Respectively as follows:
Figure GDA0003742351690000513
Figure GDA0003742351690000514
wherein, is formed by H 8 Each row or column in the set can construct an 8-long Walsh code sequence.
Alternatively, the first and second electrodes may be,
for example, one method of generating 4 long Walsh sequences is given:
first order H 2 Comprises the following steps:
Figure GDA0003742351690000515
then H 4 Comprises the following steps:
Figure GDA0003742351690000521
wherein, is prepared from H 4 Each row or column in (a) can construct a 4-long Walsh code sequence. (2) Randomly selecting one from a set (table) of 8 Walsh orthogonal spreading sequences (1) with 8 lengths (or 4 Walsh orthogonal spreading sequences with 4 lengths).
The third scheme is as follows: as shown in fig. 20, a 4-long complex spreading sequence or an 8-long (or 4-long) orthogonal spreading sequence is determined according to an additionally added bit sequence (the bit sequence length may be greater than or equal to 0), and a bit sequence of the terminal identification information (the bit sequence length may be greater than or equal to 0). The value of the additionally added bit sequence designates the starting position of the cyclic shift, and the value of the additionally added bit sequence can be randomly selected or sequentially increased during each retransmission:
with reference to the application scenario given in this embodiment, a generation process of the non-orthogonal spreading sequence C1 and the orthogonal spreading sequence C2 is described in more detail:
a method for generating a complex field binary spreading sequence C1, which can be divided into the following three parts:
(1) The UE _ ID is here a 40-long binary bit sequence of 0, 1, e.g. a 39 a 38 ……a 1 a 0 Converting the bit sequence into decimal number, the decimal conversion method is as follows: a is 39 ×2 39 +a 38 ×2 38 +……+a 1 ×2 1 +a 0 ×2 0 . The length of the additionally added bit sequence is greater than or equal to 0, and each element takes on the value of 0, 1.
Taking the 2 × 2 integer set as an example, the transmitter generates an index value of an integer sequence in which the values of the elements are all from a 4-ary integer set {0,1,2,3}, and the length of the integer sequence is 4.
When the extra bit is b M ……b 0 And M is>When 0, in order to generate the above-mentioned integer sequence, first, a bit sequence (a) is required i ……a 0 +b m ……b 0 ) Performing cyclic shift 4 times, i is more than or equal to 0 and less than or equal to 39, M is more than or equal to 0 and less than or equal to M, and the step length of each cyclic shift can be 0 bit or positive integer, and then using the decimal conversion method to obtain decimal number A of the bit sequence after each cyclic shift 1 、A 2 、A 3 And A 4 . The value of the additionally added bit sequence designates the initial position of the cyclic shift, and when the transmission fails, the values of the additionally added Y bits can be randomly selected during each retransmission or can be sequentially increased; if the values of the additionally added bits are sequentially increased during each retransmission, the values of the additionally added bits need to be cleared after the transmission is successful.
Finally, according to the decimal number A 1 、A 2 、A 3 And A 4 And solving the value of each element in the integer sequence as follows: a. The 1 mod 4、A 2 mod 4、A 3 mod 4 and A 4 mod 4, where A p mod 4 represents a value modulo 4, p belongs to {1,2,3,4}, and the resulting sequence of integers { A } 1 mod 4、A 2 mod 4、A 3 mod 4、A 4 mod 4}。
In another embodiment, for example, using a 3 × 3 integer set, the transmitter generates an index value for a sequence of integers whose elements are derived from a 9-ary integer set {0,1,2, \ 8230 \8230;, 8}, and whose length is 4.
When the extra bit is b M ……b 0 And M is>When 0, in order to generate the above-mentioned integer sequence, first, a bit sequence (a) is required i ……a 0 +b m ……b 0 ) Performing cyclic shift 4 times, i is more than or equal to 0 and less than or equal to 39, M is more than or equal to 0 and less than or equal to M, and the step length of each cyclic shift can be 0 bit or positive integer, and then using the decimal conversion method to obtain decimal number A of the bit sequence after each cyclic shift 1 、A 2 、A 3 And A 4 . The value of the additionally added bit sequence designates the initial position of the cyclic shift, and when the transmission fails, the values of the additionally added Y bits can be randomly selected during each retransmission or can be sequentially increased; if the values of the additionally added bits are sequentially increased during each retransmission, the values of the additionally added bits need to be cleared after the transmission is successful.
Finally, according to the decimal number A 1 、A 2 、A 3 And A 4 And solving the value of each element in the integer sequence as follows: a. The 1 mod 9、A 2 mod 9、A 3 mod 9 and A 4 mod 9, where A p mod 9 represents the value modulo 9, p belonging to {1,2,4}.
In another embodiment, the transmitter generates an index value for a sequence of integers whose elements are derived from an 8-ary integer set {0,1,2, \ 8230 \ 8230;, 7}, and whose length is 4.
When the extra bit is b M ……b 0 And M is>When 0, in order to generate the above-mentioned integer sequence, first, a bit sequence (a) is required i ……a 0 +b m ……b 0 ) Performing cyclic shift 4 times, i is more than or equal to 0 and less than or equal to 39, M is more than or equal to 0 and less than or equal to M, and the step length of each cyclic shift can be 0 bit or positive integer, and then using the decimal conversion method to obtain decimal number A of the bit sequence after each cyclic shift 1 、A 2 、A 3 And A 4 . The value of the extra bit sequence designates the starting position of the cyclic shift, and when the transmission fails, the extra bit sequenceThe added values of the Y bits can be randomly selected during each retransmission and can also be sequentially increased; if the values of the additionally added bits are sequentially increased during each retransmission, the values of the additionally added bits need to be cleared after the transmission is successful.
Finally, according to the decimal number A 1 、A 2 、A 3 And A 4 And solving the value of each element in the integer sequence as follows: a. The 1 mod 8、A 2 mod 8、A 3 mod 8 and A 4 mod 8, where A p mod 8 represents the value modulo 8, p belonging to {1,2,3,4}.
(2) And constructing a constellation diagram which is associated with the index value and contains 4 complex constellation points. The values of the real part and the imaginary part of each constellation point in the complex constellation diagram are from a 2-element real number set, and the 2-element real number set is represented as [ -1, +1].
Therefore, the complex numbers corresponding to the 4 complex constellation points are-1 + j, -1-j, and 1-j, respectively.
In another embodiment, a constellation diagram is constructed that contains 9 complex constellation points associated with the index value. The values of the real part and the imaginary part of each constellation point in the complex constellation diagram are from a 3-element real number set, and the 3-element real number set is represented as [ -1,0, +1].
Therefore, the plural numbers corresponding to the 9 plural constellation points are-1 + j, -1-j, -1, +1, and 0, respectively.
In another embodiment, a constellation diagram is constructed that contains 8 complex constellation points associated with the index value. The complex numbers corresponding to each constellation point in the complex constellation diagram are-1 + j, -1-j, -1 and +1 respectively, that is, no 0 point is contained.
In another embodiment, a constellation diagram comprising 8 complex constellation points associated with the index value is constructed. The complex number corresponding to each constellation point in the complex constellation diagram is (-1 + j)/sqrt (2), (-1-j)/sqrt (2), (1-j)/sqrt (2), -j, -1 and +1, respectively, that is, no 0 point is contained.
(3) Selecting 4 corresponding complex constellation points from a 4-point complex constellation diagram according to a preset mapping rule according to 4 elements in the pseudorandom integer sequence;
the complex spreading sequence is generated by mapping the index value of the integer sequence in (1) to the complex constellation points of the 4-point complex constellation (each complex constellation point represents a complex number) bit by bit according to the mapping relationship between the elements in the 4-element integer set and the complex constellation points of the 4-point complex constellation (as shown in fig. 15), and is expressed by the following formula:
A p —>ComplexSeq p
wherein, complexSeq p Representing the p-th element of the complex spreading sequence, and according to the mapping relation between the elements in the 4-element integer set and the complex constellation points of the 4-point complex constellation diagram, the p-th element is represented by A p Mapping to obtain p Representing the p-th element of the pseudorandom integer sequence.
And determining 4 complex numbers corresponding to the 4 complex constellation points according to the integer sequence index value, and sequentially combining the 4 complex numbers to obtain a complex spreading sequence, or sequentially combining the 4 complex numbers multiplied by corresponding energy normalization coefficients to obtain the complex spreading sequence.
In another embodiment, the complex spreading sequence is generated by mapping the index values of the integer sequence in (1) to the complex constellation points of the 9-point complex constellation (each complex constellation point represents a complex number) 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), and is formulated as follows:
A p —>ComplexSeq p
Wherein, complexSeq p Representing the p-th element of the complex spreading sequence, according to the mapping relation between the elements in the 9-element integer set and the complex constellation points of the 9-point complex constellation diagram, A p Mapping to obtain p Representing the p-th element of the pseudorandom integer sequence.
And determining 4 complex numbers corresponding to the 9 complex constellation points according to the integer sequence index value, and sequentially combining the 4 complex numbers to obtain a complex spreading sequence, or sequentially combining the 4 complex numbers multiplied by corresponding energy normalization coefficients to obtain the complex spreading sequence.
In another embodiment, the complex spreading sequence is generated by mapping the index values of the integer sequence in (1) to the complex constellation points of the 8-point complex constellation (each complex constellation point represents a complex number) bit by bit according to the mapping relationship between the elements in the 8-element integer set and the complex constellation points of the 8-point complex constellation (as shown in fig. 17), and is formulated as follows:
A p —>ComplexSeq p
wherein, complexSeq p Representing the p-th element of the complex spreading sequence, according to the mapping relation between the elements in the 8-element integer set and the complex constellation points of the 8-point complex constellation diagram, A p Mapping to obtain, A p Representing the p-th element of the pseudorandom integer sequence.
And determining 4 complex numbers corresponding to 8 complex constellation points according to the integer sequence index value, and sequentially combining the 4 complex numbers to obtain a complex spreading sequence, or sequentially combining the 4 complex numbers multiplied by corresponding energy normalization coefficients to obtain the complex spreading sequence.
In another embodiment, the complex spreading sequence is generated by mapping the index values of the sequence of integers in (1) to the complex constellation points of the 8-point complex constellation (each complex constellation point represents a complex number) 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), and is formulated as follows:
A p —>ComplexSeq p
wherein, complexSeq p Representing the p-th element of the complex spreading sequence, and according to the mapping relation between the elements in the 8-element integer set and the complex constellation points of the 8-point complex constellation diagram, the p-th element is represented by A p Mapping to obtain, A p Representing the p-th element of the pseudorandom integer sequence.
And according to the integer sequence index value, 4 complex numbers corresponding to 8 complex constellation points are determined, and the 4 complex numbers are sequentially combined to obtain a complex spreading sequence, or the 4 complex numbers are multiplied by corresponding energy normalization coefficients and then are sequentially combined to obtain the complex spreading sequence.
(II) another method for generating a complex field binary spreading sequence C1, and the method can be divided into the following three parts:
(1) The UE _ ID is here a 40-long binary bit sequence of 0,1, e.g. a 39 a 38 ……a 1 a 0 Converting the bit sequence into decimal number, the decimal conversion method is as follows: a is 39 ×2 39 +a 38 ×2 38 +……+a 1 ×2 1 +a 0 ×2 0 And (d) = a. The length of the additional bit sequence is greater than or equal to 0, each element is equal to {0,1}, and the additional bit is b M ……b 0 And M is>0。
Taking a 2-element real number set as an example, it is determined that a 4-long non-orthogonal spreading sequence is to be generated, each element of the non-orthogonal spreading sequence is a complex number, values of real parts and imaginary parts of all elements in the spreading sequence are derived from a 2-element real number set, the 2-element real number set is a set consisting of odd numbers in a range of { -1, +1}, and then 44 non-orthogonal sequences are in total in the 4-long non-orthogonal sequence set.
For this purpose, an integer index value is generated, according to which a non-orthogonal sequence in the set of non-orthogonal sequences can be uniquely assigned and the index value is derived from one (2 x 2) 4 Set of prime integers, the set of 256 prime integers is [0, 256-1 ]]Or [1, 256 ]]A set of all integers within the range;
when the extra bit is b M ……b 0 And M is>When 0, to generate an index value of an integer to specify one of the 4-long non-orthogonal sequence sets, first, a bit sequence (a) needs to be assigned i ……a 0 +b m ……b 0 ) Converting into a decimal number, i is more than or equal to 0 and less than or equal to 39, M is more than or equal to 0 and less than or equal to M; then, the decimal number pair 256 is subjected to modulo operation, and the obtained modulo value is the index value. And when the transmission fails, the values of the additionally added Y bits need to be randomly taken during each retransmission.
Alternatively, the first and second liquid crystal display panels may be,
when the extra added bit sequence is b M ……b 0 And M is>When 0, in order to generate an index value of an integer to specify one of the 4 long non-orthogonal sequence sets, first, a bit sequence (b) is required m ……b 0 ) Converting into a decimal number, wherein M is more than or equal to 0 and less than or equal to M; then, the decimal number is modulo-operated to 256, and the obtained modulo value is the index value. And when the transmission fails, the values of the additionally added Y bits need to be randomly taken during each retransmission.
In another embodiment, a 3-ary real number set is taken as an example, it is determined that a 4-long non-orthogonal spreading sequence is to be generated, each element of the non-orthogonal spreading sequence is a complex number, values of real parts and imaginary parts of all elements in the spreading sequence are derived from a 3-ary real number set, and the 3-ary real number set is a set composed of odd numbers in the range of { -1,0, +1 }.
According to the bit sequence (a) i ……a 0 +b m ……b 0 ) Generating an index value for an integer, 0 ≦ i ≦ 39,0 ≦ M ≦ M, the index value from one (3 × 3) 4 The set of prime integers, the set of 6561 prime integers is [0, 6561-1 ]]Or [1, 6561 ]]A set of all integers within the range;
to generate the index value of the integer, first, (a) needs to be set i ……a 0 +b m ……b 0 ) I is more than or equal to 0 and less than or equal to 39, M is more than or equal to 0 and less than or equal to M; then, the decimal number is modulo-operated on 6561, and the obtained modulo value is the index value. And when the transmission fails, the values of the additionally added Y bits need to be randomly taken during each retransmission.
Alternatively, the first and second electrodes may be,
when the extra bit sequence is b M ……b 0 And (b) are M ……b 0 ) When the decimal value is larger than 6561, in order to generate an index value of an integer to specify one of the 4 long non-orthogonal sequence sets, it is first necessary to put the bit sequence (b) m ……b 0 ) Converting into a decimal number, wherein M is more than or equal to 0 and less than or equal to M; then, the decimal number is modulo-operated on 6561, and the obtained modulo value is the index value. And when the transmission fails, the values of the additionally added Y bits need to be randomly taken during each retransmission.
In another embodiment, a 3-element real number set is taken as an example, it is determined that a 4-long non-orthogonal spreading sequence is to be generated, each element of the non-orthogonal spreading sequence is a complex number, and values of real parts and imaginary parts of all elements in the spreading sequence are derived from a 3-element real number set, the 3-element real number set is a set consisting of odd numbers in a range of [ -1,0, +1], but it is required that real parts and imaginary parts of all elements in the spreading sequence cannot be 0 at the same time.
According to (a) i ……a 0 +b m ……b 0 ) Generating an index value for an integer, 0 ≦ i ≦ 39,0 ≦ M ≦ M, the index value being from an 84-tuple integer set, the 4096-tuple integer set being [0, 4096-1 ≦ M]Or [1, 4096]A set of all integers within the range;
To generate the index value of the integer, first, (a) needs to be added i ……a 0 +b m ……b 0 ) I is more than or equal to 0 and less than or equal to 39, M is more than or equal to 0 and less than or equal to M; then, the decimal number is subjected to a modular operation on 4096, and the obtained modular value is an index value. And when the transmission fails, the values of the additionally added Y bits need to be randomly taken during each retransmission.
Alternatively, the first and second liquid crystal display panels may be,
when the extra bit sequence is b M ……b 0 And (b) is M ……b 0 ) When the decimal value is larger than 4096, in order to generate an index value of an integer to specify one of the 4-long non-orthogonal sequence sets, it is first necessary to assign a bit sequence (b) m ……b 0 ) Converting into a decimal number, wherein M is more than or equal to 0 and less than or equal to M; then, the decimal number is subjected to a modular operation on 4096, and the obtained modular value is an index value. And when the transmission fails, the values of the additionally added Y bits need to be randomly taken during each retransmission.
(2) Constructing a set (table) of 4 long complex field non-orthogonal sequences;
taking a 2-element real number set as an example, it is determined that a 4-long non-orthogonal spreading sequence is to be generated, each element of the non-orthogonal spreading sequence is a complex number, values of real parts and imaginary parts of all elements in the spreading sequence are from a 2-element real number set, and the 2-element real number set is a set composed of odd numbers in a range of { -1, +1 }.
And combining the obtained 4 complex numbers in sequence to obtain a complex spreading sequence, or multiplying the 4 complex numbers by corresponding energy normalization coefficients and then combining in sequence to obtain the complex spreading sequence.
Then the set of non-orthogonal sequences generated at this time has (2 x 2) 4 A sequence of bars.
In another embodiment, a 3-element real number set is taken as an example, it is determined that a 4-long non-orthogonal spreading sequence is to be generated, each element of the non-orthogonal spreading sequence is a complex number, values of real parts and imaginary parts of all elements in the spreading sequence are derived from a 3-element real number set, and the 3-element real number set is a set composed of odd numbers in the range of { -1,0, +1 }.
And combining the obtained 4 complex numbers in sequence to obtain a complex spreading sequence, or multiplying the 4 complex numbers by corresponding energy normalization coefficients and then combining in sequence to obtain the complex spreading sequence.
Then the set of non-orthogonal sequences generated at this time has (3 × 3) 4 A sequence of bars.
In another embodiment, a 3-element real number set is taken as an example, it is determined that a 4-long non-orthogonal spreading sequence is to be generated, each element of the non-orthogonal spreading sequence is a complex number, values of real parts and imaginary parts of all elements in the spreading sequence are derived from a 3-element real number set, and the 3-element real number set is a set composed of odd numbers in the range of { -1,0, +1 }.
And combining the obtained 4 complex numbers in sequence to obtain a complex spreading sequence, or multiplying the 4 complex numbers by corresponding energy normalization coefficients and combining in sequence to obtain the complex spreading sequence.
However, it is required that the real part and imaginary part of all elements in the spreading sequence cannot be 0 at the same time, so that the set of non-orthogonal sequences generated at this time has (3X 3-1) 4 A sequence of bars.
(3) Selecting one from a set (table) containing (2 × 2) 4 long non-orthogonal sequences in (2) according to the index value in (1) and a preset mapping rule; alternatively, the first and second electrodes may be,
according to the index value in (1) and preset mapping rule, including (3X 3) from (2) 4 Selecting one from a set (table) of 4 long non-orthogonal sequences of the strips; or alternatively
According to the index value in (1) and the preset mapping rule, the index value in (2) comprises (3X 3-1) 4 One of a set (table) of 4 long non-orthogonal sequences of bars is selected.
(iii) a method of generating an 8-long (or 4-long) Walsh orthogonal spreading sequence C2, which can be divided into the following three parts:
(1) The UE _ ID is here a 40-long binary bit sequence of 0,1, e.g. a 39 a 38 ……a 1 a 0 Converting the bit sequence into decimal number, the decimal conversion method is as follows: a is 39 ×2 39 +a 38 ×2 38 +……+a 1 ×2 1 +a 0 ×2 0 And (d) = A. The length of the additional bit sequence is greater than or equal to 0, each element takes on the value of 0,1, and the additional bit is b M ……b 0 And M is>0。
Determining to generate a Walsh orthogonal spreading sequence set with a sequence length of 8 (or 4), wherein each element of each orthogonal sequence in the sequence set is derived from { -1, +1}, and the total number of the orthogonal sequences in the orthogonal sequence set is 8 (or 4).
According to the index value of an integer to be generated, the index value of the integer uniquely specifies one sequence in the orthogonal sequence set, and the index value is from an 8-element (or 4-element) integer set, wherein the 8-element (or 4-element) integer set is a set composed of all integers in a range of [0,8-1] or [1,8] (or a range of [0,4-1] or [1,4 ]);
when the extra bit is b M ……b 0 And M is>When 0, in order to generate the above-mentioned integer sequence, first, a bit sequence (a) is required i ……a 0 +b m ……b 0 ) Converting the decimal number into a decimal number, M is more than or equal to 0 and less than or equal to M, i is more than or equal to 0 and less than or equal to 39, and then performing modulo operation on 8 (or 4) to obtain a value which is an integer index value. When the transmission fails, the values of the additionally added Y bits are randomized for 4 times in each retransmission;
or
When the extra bit is b M ……b 0 And M is>2, (b) a bit sequence (whose initial value is randomly selected) is required to generate the above integer sequence m ……b 0 ) Converting the decimal number into a decimal number, wherein M is more than or equal to 0 and less than or equal to M, and then performing modulus operation on the obtained decimal number to 8 (or 4) to obtain a value which is an integer index value. And when the transmission fails, the values of the additionally added Y bits are randomly selected during each retransmission.
(2) Constructing a set (table) of 8 Walsh orthogonal spreading sequences of length 8 (or 4 Walsh orthogonal spreading sequences of length 4);
for example, one method of generating 8 Walsh sequences 8 long (or 4 Walsh sequences 4 long) is given:
for example, one method of generating 8 Walsh sequences of length 8 is given:
first order H 2 Comprises the following steps:
Figure GDA0003742351690000611
then H 4 And H 8 Respectively as follows:
Figure GDA0003742351690000612
Figure GDA0003742351690000613
wherein, is formed by H 8 Each row or column in the set can construct an 8-long Walsh code sequence.
Alternatively, the first and second liquid crystal display panels may be,
for example, one method of generating 4 long Walsh sequences is given:
first order H 2 Comprises the following steps:
Figure GDA0003742351690000621
then H 4 Comprises the following steps:
Figure GDA0003742351690000622
wherein, is prepared from H 4 Each row or column in the set can construct a 4-long Walsh code sequence.
(3) And (2) selecting one from a set (table) containing 8 Walsh orthogonal spreading sequences with the length of 8 (or 4 Walsh orthogonal spreading sequences with the length of 4) according to the index value in (1) and a preset mapping rule.
(4) Another method of generating an 8-long (or 4-long) Walsh orthogonal spreading sequence C2 can be divided into the following two parts:
(1) Constructing a set (table) of 8 Walsh orthogonal spreading sequences of length 8 (or 4 Walsh orthogonal spreading sequences of length 4);
For example, one method of generating 8 Walsh sequences 8 long (or 4 Walsh sequences 4 long) is given:
for example, one method of generating 8 long Walsh sequences is given:
first order H 2 Comprises the following steps:
Figure GDA0003742351690000623
then H 4 And H 8 Respectively as follows:
Figure GDA0003742351690000624
Figure GDA0003742351690000625
wherein, is formed by H 8 Each row or column in the set can construct an 8-long Walsh code sequence.
Alternatively, the first and second liquid crystal display panels may be,
for example, one method of generating 4 long Walsh sequences is given:
first order H 2 Comprises the following steps:
Figure GDA0003742351690000631
then H 4 Comprises the following steps:
Figure GDA0003742351690000632
wherein, is prepared from H 4 Each row or column in (a) can construct a 4-long Walsh code sequence.
(2) And (2) randomly selecting one from a set (table) containing 8 Walsh orthogonal spreading sequences with the length of 8 (or 4 Walsh orthogonal spreading sequences with the length of 4) in the step (1).
In step S1304, the data symbol to be transmitted is spread using the obtained spreading sequences C1 and C2.
The bit sequence at least containing the terminal identity identification information of the user is coded and modulated to form N1 modulation symbols, N2 pilot symbols are added to form N symbols, N = N1+ N2, and the N symbols are changed into L multiplied by N symbols through expansion.
According to different extension types, the following three cases can be divided:
the modulation symbol is first spread by 4 long non-orthogonal sequences, and the spread symbol is then spread by 8 long orthogonal sequences. As shown in fig. 21, the modulated data symbol is S k First, S is k Using 4 long non-orthogonal spreading sequences C1= { C = { (C) } 11 ,c 12 ,……c 14 Carries out an expansion process, the expansion process in this step is S k And { c 11 ,c 12 ,……c 14 Complex multiplication is carried out on each element (complex sign) in the data, and data (S) after the first expansion processing is obtained 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 14 Each data of the symbols is associated with an 8-long (or 4-long) Walsh orthogonal sequence C2= { C = } 21 ,c 22 ,……c 28 } (or C2= { C) 21 ,c 22 ,……c 24 }) to perform second expansion processing to obtain data { S after second expansion k c 11 c 21 ,S k c 11 c 22 ，……S k c 11 c 28 ，S k c 12 c 21 ,S k c 12 c 22 ……，S k c 12 c 28 ，S k c 14 c 21 ……S k c 14 c 28 } (or { S } k c 11 c 21 ,S k c 11 c 22 ，……S k c 11 c 24 ，S k c 12 c 21 ,S k c 12 c 22 ……，S k c 12 c 24 ，S k c 14 c 21 ……S k c 14 c 24 })。
The modulated data symbols are spread by a complex field non-orthogonal spreading sequence, the spreading in this step means that each coded and modulated data symbol is multiplied by each element (complex symbol) of a 4-long complex field non-orthogonal spreading sequence to finally form a complex symbol sequence with the same length as the 4-long spreading sequence. Thereby obtaining the data sequence after the first expansion.
The data sequence after the first spreading is spread by using the generated Walsh orthogonal sequence, and the spreading in this step is to multiply each element in the data sequence after being spread by 4 long non-orthogonal sequences by each element in the orthogonal sequence, and finally form a symbol sequence having the same length as the used 8 long spreading sequence.
The modulation symbol (II) is firstly spread by 8 long orthogonal sequences, and the spread symbol is spread by 4 long non-orthogonal sequences. As shown in fig. 22, the modulated data symbol is S k First, S is k Using 8 long (or 4 long) Walsh orthogonal sequences C1= { C 11 ,c 12 ,……c 18 } (or C1= { C) 11 ,c 12 ,……c 14 }) performing an extension process, the extension process in this stepIs referred to as S k And { c 11 ,c 12 ,……c 18 } (or { c) 11 ,c 12 ,……c 14 Is multiplied by each element (complex sign), namely, data { S after the first expansion processing is obtained 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 k c 11 ,S k c 12 ,……S k c 14 }) with a 4 long non-orthogonal spreading sequence C2= { C 21 ,c 22 ,……c 24 Performing second expansion processing to obtain data (S) after second expansion k c 11 c 21 ,S k c 11 c 22 ，……S k c 11 c 24 ，S k c 12 c 21 ,S k c 12 c 22 ……，S k c 12 c 24 ，S k c 18 c 21 ……S k c 18 c 24 } (or { S k c 11 c 21 ,S k c 11 c 22 ，……S k c 11 c 24 ，S k c 12 c 21 ,S k c 12 c 22 ……，S k c 12 c 24 ，S k c 14 c 21 ……S k c 14 c 24 }). Specifically, the following:
the modulated data symbols are spread with the 8-long (or 4-long) Walsh orthogonal sequence generated by the use of the spreading process in this step, which means that each element of the 8-long orthogonal sequence is multiplied by each code-modulated data symbol, and finally a symbol sequence having the same length as the 8-long (or 4-long) spreading sequence used is formed. Thereby obtaining the data sequence after the first expansion.
The data after the first spreading is spread by using the generated 4-long complex field non-orthogonal spreading sequence, the spreading in this step is to multiply the data symbol after 8-long (or 4-long) orthogonal sequence spreading with each element (complex symbol) in the 4-long complex field non-orthogonal spreading sequence in a complex number manner, and finally form a complex symbol sequence with the same length as the 4-long spreading sequence.
The modulation symbols are spread by L long spreading sequences 1 Long orthogonal sequence and L 2 Long non-orthogonal sequence spreading. As shown in fig. 23, the modulated data symbol is S k Will S k The spreading process is performed by using a spreading sequence of L length, and the spreading process in this step is performed by using S k Complex multiplication is performed with each element (complex symbol) of the L-long sequence, and finally a symbol sequence having the same length as the L-long spreading sequence used is formed.
As shown in fig. 24, the L-long sequence is a 4-long non-orthogonal sequence spread by another 8-long (or 4-long) orthogonal sequence; alternatively, as shown in fig. 25, the L-length sequence is an 8-length (or 4-length) orthogonal sequence spread by another 4-length non-orthogonal sequence.
The spreading in the step is that each element in the 4 long non-orthogonal sequence is multiplied by each element in the 8 long (or 4 long) orthogonal sequence to finally form a symbol sequence with the same length as the used spreading sequence, namely the obtained L-length 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 ，……c 11 c 24 ，c 12 c 21 ,c 12 c 22 ……c 12 c 24 ，……，c 14 c 21 ……c 14 c 24 }); or an 8-long (or 4-long) orthogonal sequence is expanded by another 4-long non-orthogonal sequence, and the step is carried out The spreading in the step is that each element in 8 long orthogonal sequences is multiplied by each element in 4 long non-orthogonal sequences to finally form a symbol sequence with the same length as the used spreading sequence, namely the obtained L-length sequence is { c 11 c 21 ,c 11 c 22 ，……c 11 c 24 ，c 12 c 21 ,c 12 c 22 ……c 12 c 24 ，……，c 18 c 21 ……c 18 c 24 }; (or { c) 11 c 21 ,c 11 c 22 ，……c 11 c 24 ，c 12 c 21 ,c 12 c 22 ……c 12 c 24 ，……，c 14 c 21 ……c 14 c 24 })
Finally, the generated L-length sequence is used for spreading, where the spreading in this step is to multiply each code-modulated data symbol by each element (complex symbol) of the L-length sequence to finally form a symbol sequence having the same length as the spreading sequence used.
Step S1306, the extended symbol is converted into a corresponding carrier modulation signal through carrier modulation (single carrier or multi-carrier modulation).
Step S1308, the final carrier modulation signal (single carrier or multi-carrier modulation signal) formed as described above is transmitted.
Preferred embodiment 6
The terminal encodes and modulates a' bit sequence +1 bit (indicating whether data exist or not) by CRC + convolutional code to become 144 modulation symbols, then adds 24 pilot symbols (the data and the pilot symbols correspond to time-frequency resources which need LTE 1 PRB to carry), then uses a 4-long complex number domain spreading sequence, then uses an 8-long (or 4-long) Walsh orthogonal spreading sequence to spread (the spread symbols need LTE 32 (or 16) PRB time-frequency resources to carry), and finally uses OFDM/SC-FDMA/DFT-S-OFDM with CP to modulate the spread symbols and sends the modulated symbols to a base station; the base station separates the information of the respective terminals using an advanced receiver.
Alternatively, the first and second electrodes may be,
the terminal encodes and modulates a' bit sequence + information bit +1 bit (indicating whether indication information of data exists or not) by CRC + convolutional code to become 144 modulation symbols, then adds 24 pilot symbols (the data and the pilot symbols correspond to time-frequency resources needing LTE 1 PRB to carry), then uses a Walsh orthogonal spreading sequence with 8 lengths (4 lengths) to carry out spreading, then uses a complex domain spreading sequence with 4 lengths (the spread symbols need LTE 32 (or 16) PRB time-frequency resources to carry), and finally uses OFDM/SC-FDMA/DFT-S-OFDM with CP to modulate the spread symbols and sends the symbols to a base station; the base station separates information of the respective terminals using an advanced receiver.
Alternatively, the first and second electrodes may be,
the terminal encodes and modulates the' bit sequence + information bit +1 bit (indicating whether there is data or not) by CRC + convolutional code to become 144 modulation symbols, then adds 24 pilot symbols (carried by time-frequency resources needing LTE 1 PRB corresponding to the data plus pilot symbols), then uses a 32-long (or 16-long) spreading sequence to spread the modulation symbols, the 32-long (or 16-long) spreading sequence is obtained by spreading 8-long (or 4-long) Walsh orthogonal spreading sequence and 4-long complex field spreading sequence, and finally uses OFDM/SC-FDMA/DFT-S-OFDM with CP to modulate the spread symbols and sends the modulated symbols to the base station; the base station separates information of the respective terminals using an advanced receiver.
The additional 1 bit in the preferred embodiment of the present disclosure can function as a flag bit.
When the transmitting terminal sets the 1 bit to 0, the reported data cannot be transmitted through one data packet, and the following data packets need to be transmitted; when the transmitting end sets the 1 bit to 1, the transmission of the reported data is finished, and the data packet containing the 1 bit with the bit value of 1 is the last data packet.
Alternatively, the first and second electrodes may be,
when the transmitting terminal sets the 1 bit to 1, the reported data cannot be transmitted through one data packet, and the following data packets need to be transmitted; when the transmitting end sets the 1 bit to 0, it indicates that the reported data transmission is finished, and the data packet containing 1 bit with bit value 1 is the last data packet.
Therefore, the value of 1 bit affects the processing flow of the receiver on the reported data, as shown in fig. 26, first, the receiver receives signals transmitted by multiple transmitters, and the signals transmitted by the multiple transmitters are formed by the multiple transmitters respectively adopting respective spreading sequences to spread respective data symbols to be transmitted, and then respectively modulating the generated spread symbol sequences to the same time-frequency resources.
Then, the receiver judges whether the reported data packet is the last data packet according to the correctly detected value of the 1 bit of the flag bit, thereby judging whether to adopt an advanced interference cancellation signal detector to carry out receiving detection on the received signals transmitted by a plurality of transmitters.
Preferred embodiment 7
The base station has more receiving antennas, for example, 4/8/16 or more receiving antennas, in this case, the terminal encodes and modulates the 'bit sequence' by the CRC + convolutional code to become N modulation symbols, then uses a 2-long complex domain binary code for spreading, uses OFDM/SC-FDMA/DFT-S-OFDM modulation with CP after spreading, and then sends the modulation symbols to the base station; the base station separates information of the respective terminals using an advanced receiver.
As shown in fig. 27, the modulated data symbol is S k Using 2 long non-orthogonal spreading sequences C1{ C } 11 ,c 12 Spreading processing is performed, where spreading processing in this step means that each code-modulated data symbol is complex-multiplied by each element (complex symbol) of a 2-long sequence, and finally a symbol sequence with the same length as the used spreading sequence is formed. The data after expansion is S k c 11 ,S k c 12 }。
In this embodiment, non-orthogonal spreading is performed only once, or the length of the orthogonal spreading sequence used for the second spreading may be set to 1.
The procedure of the access method based on the extension at the transmitter side of the embodiment includes:
in this embodiment, 2 long complex spreading sequences are determined according to the bit sequence information, the identification information UE _ ID of the terminal itself may be 40 long bit sequences, and the length of UE _ ID is suggested to be greater than 16, and C1 is 2 long complex field binary spreading sequences.
The bit sequence comprises a bit sequence of terminal identity identification information in the network (or information capable of representing the terminal identity, which may be collectively referred to as terminal identity identification, for example, part or all of identification information UE _ ID of the terminal itself, or temporary identification in the network) or an additionally added bit sequence; the length and value of the extra bit sequence are related to the terminal identity information, or the transmission times, or the size of the data packet, or the time-frequency position, or the cell configuration.
Determining a complex spreading sequence of 2 lengths according to the bit sequence information, and dividing into the following three schemes according to whether additional bits are added and different roles of the added bits:
the first scheme is as follows: determining a 2-long complex spreading sequence according to the terminal identity information, and introducing randomness without additionally adding bits:
With reference to the application scenario given in this embodiment, a non-orthogonal spreading sequence C1 is introduced more specifically:
a method for generating a complex field binary spreading sequence C1, which can be divided into the following three parts:
(1) Here the UE _ ID is a 40-long sequence of 0,1 binary bits, e.g., a 39 a 38 ……a 1 a 0 Converting the bit sequence into decimal number, the decimal conversion method is as follows: a is 39 ×2 39 +a 38 ×2 38 +……+a 1 ×2 1 +a 0 ×2 0 ＝A。
Taking the 2 × 2 integer set as an example, the transmitter generates an index value of an integer sequence in which the values of the elements are all from a 4-ary integer set {0,1,2,3}, and the length of the integer sequence is 4.
To generate the above-mentioned integer sequence, first, the bit sequence a needs to be generated i ……a 0 Performing cyclic shift for 2 times, i is more than or equal to 0 and less than or equal to 39, and each timeThe step length of the sub-cyclic shift can be 0 bit or a positive integer, and the decimal number A of the bit sequence after each cyclic shift is obtained by the decimal conversion method 1 、A 2 。
Finally, according to the decimal number A 1 、A 2 And solving the value of each element in the integer sequence as follows: a. The 1 mod 4、A 2 mod 4, where A p mod 4 represents the value modulo 4, p belonging to {1,2}, resulting in a sequence of integers { A } 1 mod 4、A 2 mod 4}。
In another embodiment, for example, using a 3 × 3 integer set, the transmitter generates an index value of an integer sequence, the values of the elements of the integer sequence are all from a 9-ary integer set {0,1,2, \8230; \ 8,9}, and the length of the integer sequence is 4.
To generate the integer sequence, first, the bit sequence a needs to be generated i ……a 0 Performing cyclic shift for 2 times, wherein i is more than or equal to 0 and less than or equal to 39, and the step length of each cyclic shift can be 0 bit or positive integer, and using the decimal conversion method to obtain decimal number A of the bit sequence after each cyclic shift 1 、A 2 。
Finally, according to the decimal number A 1 、A 2 And solving the value of each element in the integer sequence as follows: a. The 1 mod 9、A 2 mod 9, where A p mod 9 represents the value modulo 9, p belonging to {1,2}, resulting in a sequence of integers { A } 1 mod 9、A 2 mod 9}。
In another embodiment, the transmitter generates an index value for a sequence of integers whose elements are derived from an 8-ary integer set {0,1,2, \ 8230 \ 8230;, 7,8}, and whose length is 2.
To generate the above-mentioned integer sequence, first, the bit sequence a needs to be generated i ……a 0 Performing 2 times of cyclic shift, i is more than or equal to 0 and less than or equal to 39, the step length of each cyclic shift can be 0 bit or positive integer, and then using the decimal conversion method to calculate each cycleDecimal number A of bit sequence after shift 1 、A 2 。
Finally, according to the decimal number A 1 、A 2 And solving the value of each element in the integer sequence as follows: a. The 1 mod 8、A 2 mod 8, where A p mod 8 represents the value modulo 8, p belonging to {1,2}, resulting in a sequence of integers { A } 1 mod 8、A 2 mod 8}。
(2) And constructing a constellation diagram which is associated with the index value and contains 4 complex constellation points. The values of the real part and the imaginary part of each constellation point in the complex constellation diagram are from a 2-element real number set, and the 2-element real number set is represented as [ -1, +1].
Therefore, the complex numbers corresponding to the 4 complex constellation points are-1 + j, -1-j, and 1-j, respectively.
In another embodiment, a constellation diagram is constructed that contains 9 complex constellation points associated with the index value. The values of the real part and the imaginary part of each constellation point in the complex constellation diagram are from a 3-element real number set, and the 3-element real number set is represented as [ -1,0, +1].
Therefore, the plural numbers corresponding to the 9 plural constellation points are-1 + j, -1-j, -1, +1, and 0, respectively.
In another embodiment, a constellation diagram is constructed that contains 8 complex constellation points associated with the index value. The complex number corresponding to each constellation point in the complex constellation diagram is-1 + j, -1-j, -1 and +1 respectively, that is, no 0 point is contained.
In another embodiment, a constellation diagram comprising 8 complex constellation points associated with the index value is constructed. The complex number corresponding to each constellation point in the complex constellation diagram is (-1 + j)/sqrt (2), (-1-j)/sqrt (2), (1-j)/sqrt (2), -j, -1 and +1, respectively, that is, no 0 point is contained.
(3) Selecting 2 corresponding complex constellation points from a 4-point complex constellation diagram according to a preset mapping rule according to 4 elements in the pseudorandom integer sequence;
mapping the index value of the integer sequence in (1) to the complex constellation points of the 4-point complex constellation (each complex constellation point represents a complex number) bit by bit according to the mapping relationship between the elements in the 4-element integer set and the complex constellation points of the 4-point complex constellation (as shown in fig. 15) to generate a complex spreading sequence, which is formulated as follows:
A p —>ComplexSeq p
wherein, complexSeq p Representing the p-th element of the complex spreading sequence, according to the mapping relation between the elements in the 4-element integer set and the complex constellation points of the 4-point complex constellation diagram, A p Mapping to obtain p Representing the p-th element of the pseudorandom integer sequence.
And determining 2 complex numbers corresponding to 4 complex constellation points according to the integer sequence index value, and sequentially combining the 2 complex numbers to obtain a complex spreading sequence, or sequentially combining the 2 complex numbers multiplied by corresponding energy normalization coefficients to obtain the complex spreading sequence.
In another embodiment, the complex spreading sequence is generated by mapping the index values of the integer sequence in (1) to the complex constellation points of the 9-point complex constellation (each complex constellation point represents a complex number) bit by bit according to the mapping relationship between the elements in the 9-element integer set and the complex constellation points of the 9-point complex constellation (as shown in fig. 16), and is formulated as follows:
A p —>ComplexSeq p
Wherein, complexSeq p Representing the p-th element of the complex spreading sequence, according to the mapping relation between the elements in the 9-element integer set and the complex constellation points of the 9-point complex constellation diagram, A p Mapping to obtain, A p Representing the p-th element of the pseudorandom integer sequence.
And determining 2 complex numbers corresponding to the 9 complex constellation points according to the integer sequence index value, and sequentially combining the 2 complex numbers to obtain a complex spreading sequence, or sequentially combining the 2 complex numbers multiplied by corresponding energy normalization coefficients to obtain the complex spreading sequence.
In another embodiment, the complex spreading sequence is generated by mapping the index values of the sequence of integers in (1) to the complex constellation points of the 8-point complex constellation (each complex constellation point represents a complex number) 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), and is formulated as follows:
A p —>ComplexSeq p
wherein, complexSeq p Representing the p-th element of the complex spreading sequence, and according to the mapping relation between the elements in the 8-element integer set and the complex constellation points of the 8-point complex constellation diagram, the p-th element is represented by A p Mapping to obtain p Representing the p-th element of the pseudorandom integer sequence.
And determining 2 complex numbers corresponding to 8 complex constellation points according to the integer sequence index value, and sequentially combining the 2 complex numbers to obtain a complex spreading sequence, or sequentially combining the 2 complex numbers multiplied by corresponding energy normalization coefficients to obtain the complex spreading sequence.
In another embodiment, the complex spreading sequence is generated by mapping the index values of the sequence of integers in (1) to the complex constellation points of the 8-point complex constellation (each complex constellation point represents a complex number) 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), and is formulated as follows:
A p —>ComplexSeq p
wherein, complexSeqp represents the p-th element of the complex spreading sequence, and A represents the mapping relationship between the elements in the 8-element integer set and the complex constellation points of the 8-point complex constellation diagram p Mapping to obtain p Representing the p-th element of the pseudorandom integer sequence.
And determining 2 complex numbers corresponding to 8 complex constellation points according to the integer sequence index value, and sequentially combining the 2 complex numbers to obtain a complex spreading sequence, or sequentially combining the 2 complex numbers multiplied by corresponding energy normalization coefficients to obtain the complex spreading sequence.
(II) another method for generating a complex field binary spreading sequence C1, and the method can be divided into the following three parts:
(1) The UE _ ID is here a 40-long binary bit sequence of 0, 1, e.g. a 39 a 38 ……a 1 a 0 Converting the bit sequence into a decimal number,the decimal conversion method comprises the following steps: a is 39 ×2 39 +a 38 ×2 38 +……+a 1 ×2 1 +a 0 ×2 0 ＝A。
Taking a 2-element real number set as an example, it is determined that a 2-long non-orthogonal spreading sequence is to be generated, each element of the non-orthogonal spreading sequence is a complex number, values of real parts and imaginary parts of all elements in the spreading sequence are from a 2-element real number set, and the 2-element real number set is a set composed of odd numbers in a range of [ -1, +1 ].
Generating an index value of an integer according to the terminal identity information, wherein the index value is from one (2 multiplied by 2) 2 Set of prime integers, set of 16 prime integers is [0, 16-1 ]]Or [1, 16 ]]A set of all integers within the range;
to generate the index value of the integer, first, the bit sequence a needs to be set i ……a 0 The decimal number is converted, and i is more than or equal to 0 and less than or equal to 39; then, the decimal number pair 256 is subjected to modulo operation, and the obtained modulo value is the index value.
In another embodiment, taking a 3-element real number set as an example, it is determined that a 2-long non-orthogonal spreading sequence is to be generated, each element of the non-orthogonal spreading sequence is a complex number, and values of real parts and imaginary parts of all elements in the spreading sequence are derived from a 3-element real number set, and the 3-element real number set is a set consisting of odd numbers in a range of [ -1,0, +1 ].
Generating an index value of an integer according to the terminal identity information identification, wherein the index value is from one (3 multiplied by 3) 2 Set of prime integers, the set of 81 prime integers is [0, 81-1 ]]Or [1, 81 ]]A set of all integers within the range;
to generate the index value of the integer, first, the bit sequence a needs to be set i ……a 0 The decimal number is converted, and i is more than or equal to 0 and less than or equal to 39; then, the decimal number pair 81 is subjected to modulo operation, and the obtained modulo value is the index value.
In another embodiment, a 3-element real number set is taken as an example, it is determined that a 2-long non-orthogonal spreading sequence is to be generated, each element of the non-orthogonal spreading sequence is a complex number, and values of real parts and imaginary parts of all elements in the spreading sequence are derived from a 3-element real number set, the 3-element real number set is a set consisting of odd numbers in a range of [ -1,0, +1], but it is required that real parts and imaginary parts of all elements in the spreading sequence cannot be 0 at the same time.
Generating an index value of an integer according to the terminal identity identification information, wherein the index value is from an 82-element integer set, and the 64-element integer set is [0, 64-1] or a set consisting of all integers in the range of [1, 64 ];
to generate the index value of the integer, first, the bit sequence a needs to be set i ……a 0 The decimal number is converted, and i is more than or equal to 0 and less than or equal to 39; then, the decimal number pair 64 is subjected to modulo operation, and the obtained modulo value is the index value.
(2) Constructing a set (table) of 2-long complex field non-orthogonal sequences;
taking a 2-element real number set as an example, it is determined that a 2-long non-orthogonal spreading sequence is to be generated, each element of the non-orthogonal spreading sequence is a complex number, values of real parts and imaginary parts of all elements in the spreading sequence are from a 2-element real number set, and the 2-element real number set is a set composed of odd numbers in a range of [ -1, +1 ].
And combining the obtained 2 complex numbers in sequence to obtain a complex spreading sequence, or multiplying the 2 complex numbers by corresponding energy normalization coefficients and then combining in sequence to obtain the complex spreading sequence.
Then the set of non-orthogonal sequences generated at this time has (2 x 2) 2 A sequence of bars.
In another embodiment, for example, a 3-element real number set, it is determined that a 2-long non-orthogonal spreading sequence is to be generated, each element of the non-orthogonal spreading sequence is a complex number, and values of real parts and imaginary parts of all elements in the spreading sequence are derived from a 3-element real number set, where the 3-element real number set is a set consisting of odd numbers in a range of [ -1,0, +1 ].
And combining the obtained 2 complex numbers in sequence to obtain a complex spreading sequence, or multiplying the 2 complex numbers by corresponding energy normalization coefficients and combining in sequence to obtain the complex spreading sequence.
Then the set of non-orthogonal sequences generated at this time has (3 x 3) 2 A sequence of bars.
In another embodiment, a 3-ary real number set is taken as an example, to determine that a 2-long non-orthogonal spreading sequence is to be generated, each element of the non-orthogonal spreading sequence is a complex number, and values of real parts and imaginary parts of all elements in the spreading sequence are derived from a 3-ary real number set, and the 3-ary real number set is a set consisting of odd numbers in the range of [ -1,0, +1 ].
And combining the obtained 2 complex numbers in sequence to obtain a complex spreading sequence, or multiplying the 2 complex numbers by corresponding energy normalization coefficients and then combining in sequence to obtain the complex spreading sequence.
However, it is required that the real part and imaginary part of all elements in the spreading sequence cannot be 0 at the same time, so that the set of non-orthogonal sequences generated at this time has (3X 3-1) 2 A sequence of bars.
(3) According to the index value in (1) and according to the preset mapping rule, including (2X 2) from (2) 2 2, selecting one from a set (table) of long non-orthogonal sequences; alternatively, the first and second liquid crystal display panels may be,
according to the index value in (1) and the preset mapping rule, the index value in (2) comprises (3 x 3) 2 Selecting one from a set (table) of 2 long non-orthogonal sequences of strips; or
According to the index value in (1) and the preset mapping rule, the index value in (2) comprises (3X 3-1) 2 One of a set (table) of 2 long non-orthogonal sequences of bars is selected.
Scheme II: a 2-long complex spreading is determined according to an additionally added bit sequence (the length of the bit sequence may be greater than or equal to 0), a part of the bit sequence of the terminal identification information (UE _ ID) (the length of the bit sequence may be greater than or equal to 0). Because the value of the additionally added bit sequence is randomly selected at each retransmission, the additionally added bit sequence can play a role of randomization:
With reference to the application scenario given in this embodiment, the non-orthogonal spreading sequence C1 is described in more detail:
a method for generating a complex field binary spreading sequence C1, which can be divided into the following three parts:
(1) Here the UE _ ID is a 40-long sequence of 0,1 binary bits, e.g., a 39 a 38 ……a 1 a 0 Converting the bit sequence into decimal number, the decimal conversion method is as follows: a is a 39 ×2 39 +a 38 ×2 38 +……+a 1 ×2 1 +a 0 ×2 0 . The length of the additionally added bit sequence is greater than or equal to 0, and each element takes on the value of 0, 1.
Taking a 2 × 2 integer set as an example, the transmitter generates an index value of a sequence of integers, elements of the sequence of integers each having a value from a 4-ary integer set {0,1,2,3}, and the sequence of integers has a length of 2.
When the extra bit is b M ……b 0 And M is>When 0, in order to generate the above-mentioned integer sequence, first, a bit sequence (a) is required i ……a 0 +b m ……b 0 ) Performing cyclic shift for 2 times, i is more than or equal to 0 and less than or equal to 39, M is more than or equal to 0 and less than or equal to M, and the step length of each cyclic shift can be 0 bit or positive integer, and then using the decimal conversion method to obtain decimal number A of the bit sequence after each cyclic shift 1 、A 2 . When the transmission fails, values of the additionally added Y bits are randomly selected during each retransmission, or values of the additionally added Y bits are randomly selected after each cyclic shift;
Alternatively, the first and second liquid crystal display panels may be,
when the extra bit is b M ……b 0 And M is>When 0, in order to generate the above-mentioned integer sequence, first, a bit sequence (a) is required i ……a 0 ) And performing cyclic shift for 2 times, wherein i is more than or equal to 0 and less than or equal to 39, the step length of each cyclic shift can be 0 bit or a positive integer, and the decimal numbers B1 and B2 of the bit sequence after each cyclic shift are solved by using the decimal conversion method. A bit sequence (b) m ……b 0 ) Decimal conversion is carried out, M is more than or equal to 0 and less than or equal to M, and the operation results are respectively compared with B 1 、B 2 Adding to obtain new 4 decimal numbers A 1 、A 2 . When the transmission fails, the values of the additionally added Y bits are randomly selected during each retransmission;
alternatively, the first and second electrodes may be,
when the extra bit is b M ……b 0 And M is>0, in order to generate the above-mentioned integer sequence, first, a bit sequence (a) is required i ……a 0 +b m ……b 0 ) In (b) m ……b 0 ) 2 times of randomization value, i is more than or equal to 0 and less than or equal to 39, M is more than or equal to 0 and less than or equal to M, and each time contains a randomized bit sequence (a) i ……a 0 +b m ……b 0 ) Conversion of sequences into decimal numbers A 1 、A 2 . When the transmission fails, the values of the additionally added Y bits are randomized for 4 times in each retransmission;
or alternatively
When the extra bit is b M ……b 0 And M is>0, in order to generate the above-mentioned integer sequence, first, a bit sequence (b) whose initial value is randomly selected is required m ……b 0 ) Performing cyclic shift for 2 times or randomly taking 2 values, M is more than or equal to 0 and less than or equal to M, the step length of each cyclic shift can be 0 bit or positive integer, and then using the decimal conversion method to obtain decimal number A of the bit sequence after each cyclic shift 1 、A 2 . And when the transmission fails, the value of the additionally added Y bits is randomly selected during each retransmission.
Finally, according to the decimal number A 1 、A 2 And solving the value of each element in the integer sequence as follows: a. The 1 mod 4、A 2 mod 4, where A p mod 4 represents a value modulo 4, p belongs to {1,2}, and the resulting sequence of integers { A } 1 mod 4、A 2 mod 4}。
In another embodiment, for example, using a 3 × 3 integer set, the transmitter generates an index value for a sequence of integers whose elements are derived from a 9-ary integer set {0,1,2, \8230; \ 8}, and whose length is 2.
When the extra bit is b M ……b 0 And M is>When 0, in order to generate the above-mentioned integer sequence, first, a bit sequence (a) is required i ……a 0 +b m ……b 0 ) Performing cyclic shift for 2 times, i is more than or equal to 0 and less than or equal to 39, M is more than or equal to 0 and less than or equal to M, and the step length of each cyclic shift can be 0 bit or positive integer, and then using the decimal conversion method to obtain decimal number A of the bit sequence after each cyclic shift 1 、A 2 . When the transmission fails, values of the additionally added Y bits are randomly selected during each retransmission, or values of the additionally added Y bits are randomly selected after each cyclic shift;
alternatively, the first and second liquid crystal display panels may be,
when the extra bit is b M ……b 0 And M is>0, in order to generate the integer sequence, firstly, the bit sequence (ai \8230; \8230a0) needs to be circularly shifted 2 times, i is more than or equal to 0 and less than or equal to 39, the step length of each circular shift can be 0 bit or positive integer bit, and then the decimal number B of the bit sequence after each circular shift is obtained by the decimal conversion method 1 、B 2 . A bit sequence (b) m ……b 0 ) Decimal conversion is carried out, M is more than or equal to 0 and less than or equal to M, and the operation results are respectively compared with B 1 、B 2 Adding to obtain new 2 decimal numbers A 1 、A 2 . When the transmission fails, the values of the additionally added Y bits are randomly selected during each retransmission;
alternatively, the first and second electrodes may be,
when the extra bit is b M ……b 0 And M is>When 0, in order to generate the above-mentioned integer sequence, first, a bit sequence (a) is required i ……a 0 +b m ……b 0 ) In (b) m ……b 0 ) Randomizing 2 times, i is more than or equal to 0 and less than or equal to 39, M is more than or equal to 0 and less than or equal to M, and each time contains randomized bit sequence (a) i ……a 0 +b m ……b 0 ) Conversion of sequences into decimal numbers A 1 、A 2 . When the transmission fails, the values of the additionally added Y bits need to be randomized for 2 times during each retransmission;
or alternatively
When the extra bit is b M ……b 0 And M is>0, in order to generate the above-mentioned integer sequence, first, a bit sequence (b) whose initial value is randomly selected is required m ……b 0 ) Performing cyclic shift for 2 times or randomly taking 2 values, M is more than or equal to 0 and less than or equal to M, the step length of each cyclic shift can be 0 bit or positive integer, and then using the decimal conversion method to obtain decimal number A of the bit sequence after each cyclic shift 1 、A 2 . And when the transmission fails, the values of the additionally added Y bits are randomly selected during each retransmission.
Finally, according to the decimal number A 1 、A 2 And solving the value of each element in the integer sequence as follows: a. The 1 mod 9、A 2 mod 9, where A p mod 9 represents the value modulo 9, p belonging to {1,2}.
In another embodiment, the transmitter generates a sequence of integer index values, the values of the elements of the sequence of integers are from an 8-ary set of integers {0,1,2, \8230;, 7}, and the sequence of integers has a length of 4.
When the extra bit is b M ……b 0 And M is>0, in order to generate the above-mentioned integer sequence, first, a bit sequence (a) is required i ……a 0 +b m ……b 0 ) Performing cyclic shift for 2 times, i is more than or equal to 0 and less than or equal to 39, M is more than or equal to 0 and less than or equal to M, the step length of each cyclic shift can be 0 bit or positive integer, and then using the decimal conversion method to obtain decimal number A of the bit sequence after each cyclic shift 1 、A 2 . When the transmission fails, the values of the additionally added Y bits are randomly selected during each retransmission, or the values of the additionally added Y bits are randomly selected after each cyclic shift;
alternatively, the first and second liquid crystal display panels may be,
when the extra bit is b M ……b 0 And M is>When 0, in order to generate the above-mentioned integer sequence, first, a bit sequence (a) is required i ……a 0 ) Performing 2 times of cyclic shift, i is more than or equal to 0 and less than or equal to 39, the step length of each cyclic shift can be 0 bit or positive integer, and then using the decimal conversion method to obtain the decimal number B of the bit sequence after each cyclic shift 1 、B 2 . Bit sequence (b) m ……b 0 ) Decimal conversion is carried out, M is more than or equal to 0 and less than or equal to M, and the operation results are respectively compared with B 1 、B 2 Adding to obtain new 2 decimal numbers A 1 、A 2 . When the transmission fails, the values of the additionally added Y bits are randomly selected during each retransmission;
alternatively, the first and second electrodes may be,
when the extra bit is b M ……b 0 And M is>1, in order to generate the above-mentioned integer sequence, first, a bit sequence (a) is required i ……a 0 +b m ……b 0 ) In (b) m ……b 0 ) 2 times of randomization value, i is more than or equal to 0 and less than or equal to 39, M is more than or equal to 0 and less than or equal to M, and each time contains a randomized bit sequence (a) i ……a 0 +b m ……b 0 ) Conversion of sequences into decimal numbers A 1 、A 2 . When the transmission fails, the values of the additionally added Y bits are randomized for 4 times in each retransmission;
or alternatively
When the extra bit is b M ……b 0 And M is>1, in order to generate the above-mentioned integer sequence, first, a bit sequence (b) whose initial value is randomly selected is required m ……b 0 ) Performing cyclic shift for 2 times or randomly taking 2 values, M is more than or equal to 0 and less than or equal to M, the step length of each cyclic shift can be 0 bit or positive integer, and then using the decimal conversion method to obtain decimal number A of the bit sequence after each cyclic shift 1 、A 2 . And when the transmission fails, the value of the additionally increased Y bits is required to be taken along with the retransmission at each timeAnd (4) selecting the machine.
Finally, according to the decimal number A 1 、A 2 And solving the value of each element in the integer sequence as follows: a. The 1 mod 8、A 2 mod 8, where A p mod 8 represents the value modulo 8, p belonging to {1,2}.
(2) And constructing a constellation diagram which is associated with the index value and contains 4 complex constellation points. The values of the real part and the imaginary part of each constellation point in the complex constellation diagram are from a 2-element real number set, and the 2-element real number set is represented as [ -1, +1].
Therefore, the complex numbers corresponding to the 4 complex constellation points are-1 + j, -1-j, and 1-j, respectively.
In another embodiment, a constellation diagram is constructed that contains 9 complex constellation points associated with the index value. The values of the real part and the imaginary part of each constellation point in the complex constellation diagram are from a 3-element real number set, and the 3-element real number set is represented as [ -1,0, +1].
Therefore, the plural numbers corresponding to the 9 plural constellation points are-1 + j, -1-j, -1, +1, and 0, respectively.
In another embodiment, a constellation diagram comprising 8 complex constellation points associated with the index value is constructed. The complex number corresponding to each constellation point in the complex constellation diagram is-1 + j, -1-j, -1 and +1 respectively, that is, no 0 point is contained.
In another embodiment, a constellation diagram is constructed that contains 8 complex constellation points associated with the index value. The complex number corresponding to each constellation point in the complex constellation diagram is (-1 + j)/sqrt (2), (-1-j)/sqrt (2), (1-j)/sqrt (2), -j, -1 and +1, respectively, that is, no 0 point is contained.
(3) Selecting 4 corresponding complex constellation points from a 4-point complex constellation diagram according to a preset mapping rule according to 4 elements in the pseudorandom integer sequence;
The complex spreading sequence is generated by mapping the index value of the integer sequence in (1) to the complex constellation points of the 4-point complex constellation (each complex constellation point represents a complex number) bit by bit according to the mapping relationship between the elements in the 4-element integer set and the complex constellation points of the 4-point complex constellation (as shown in fig. 15), and is expressed by the following formula:
A p —>ComplexSeq p
wherein, complexSeq p Representing the p-th element of the complex spreading sequence, and obtained by Ap mapping according to the mapping relation between the elements in the 4-element integer set and the complex constellation points of the 4-point complex constellation diagram, A p Representing the p-th element of the pseudorandom integer sequence.
And determining 2 complex numbers corresponding to 4 complex constellation points according to the integer sequence index value, and sequentially combining the 2 complex numbers to obtain a complex spreading sequence, or multiplying the 2 complex numbers by a corresponding energy normalization coefficient and then sequentially combining to obtain the complex spreading sequence.
In another embodiment, the complex spreading sequence is generated by mapping the index values of the integer sequence in (1) to the complex constellation points of the 9-point complex constellation (each complex constellation point represents a complex number) 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), and is formulated as follows:
A p —>ComplexSeq p
Wherein, complexSeq p Representing the p-th element of the complex spreading sequence, and according to the mapping relation between the elements in the 9-element integer set and the complex constellation points of the 9-point complex constellation diagram, the p-th element is represented by A p Mapping to obtain, A p Representing the p-th element of the pseudorandom integer sequence.
And according to the integer sequence index value, determining 2 complex numbers corresponding to 9 complex constellation points, and sequentially combining the 2 complex numbers to obtain a complex spreading sequence, or sequentially combining the 2 complex numbers multiplied by a corresponding energy normalization coefficient to obtain the complex spreading sequence.
In another embodiment, the complex spreading sequence is generated by mapping the index values of the integer sequence in (1) to the complex constellation points of the 8-point complex constellation (each complex constellation point represents a complex number) bit by bit according to the mapping relationship between the elements in the 8-element integer set and the complex constellation points of the 8-point complex constellation (as shown in fig. 17), and is formulated as follows:
A p —>ComplexSeq p
wherein, complexSeq p Representing the p-th element of the complex spreading sequence, and according to the mapping relation between the elements in the 8-element integer set and the complex constellation points of the 8-point complex constellation diagram, the p-th element is represented by A p Mapping to obtain, A p Representing the p-th element of the pseudorandom integer sequence.
And determining 2 complex numbers corresponding to 8 complex constellation points according to the integer sequence index value, and sequentially combining the 2 complex numbers to obtain a complex spreading sequence, or sequentially combining the 2 complex numbers multiplied by corresponding energy normalization coefficients to obtain the complex spreading sequence.
In another embodiment, the complex spreading sequence is generated by mapping the index values of the sequence of integers in (1) to the complex constellation points of the 8-point complex constellation (each complex constellation point represents a complex number) 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), and is formulated as follows:
A p —>ComplexSeq p
wherein, complexSeq p Representing the p-th element of the complex spreading sequence, according to the mapping relation between the elements in the 8-element integer set and the complex constellation points of the 8-point complex constellation diagram, A p Mapping to obtain p Representing the p-th element of the pseudorandom integer sequence.
And determining 2 complex numbers corresponding to 8 complex constellation points according to the integer sequence index value, and sequentially combining the 2 complex numbers to obtain a complex spreading sequence, or sequentially combining the 2 complex numbers multiplied by corresponding energy normalization coefficients to obtain the complex spreading sequence.
(II) another method for generating a complex field binary spreading sequence C1, and the method can be divided into the following three parts:
(1) Here the UE _ ID is a 40-long sequence of 0,1 binary bits, e.g., a 39 a 38 ……a 1 a 0 The bit sequence is converted into decimal number, and the decimal conversion method comprises the following steps: a is 39 ×2 39 +a 38 ×2 38 +……+a 1 ×2 1 +a 0 ×2 0 And (d) = A. The length of the additional bit sequence is greater than or equal to 0, each element is equal to {0,1}, and the additional bit is b M ……b 0 And M is>0。
Taking a 2-element real number set as an example, it is determined that a 2-long non-orthogonal spreading sequence is to be generated, each element of the non-orthogonal spreading sequence is a complex number, values of real parts and imaginary parts of all elements in the spreading sequence are derived from a 2-element real number set, the 2-element real number set is a set composed of odd numbers in the range { -1, +1}, and there are 16 non-orthogonal sequences in the 2-long non-orthogonal sequence set.
For this purpose, an integer index value is generated, according to which a non-orthogonal sequence in the set of non-orthogonal sequences can be uniquely assigned and the index value is derived from one (2 x 2) 2 Set of prime integers, the set of 16 prime integers being [0, 16-1 ]]Or [1, 16 ]]A set of all integers within the range;
when the extra bit is b M ……b 0 And M is>When 0, in order to generate an index value of an integer to specify one of the 2-long non-orthogonal sequence sets, first, a bit sequence (a) needs to be set i ……a 0 +b m ……b 0 ) Converting into a decimal number, i is more than or equal to 0 and less than or equal to 39, M is more than or equal to 0 and less than or equal to M; then, the decimal number pair 16 is subjected to modulo operation, and the obtained modulo value is the index value. And when the transmission fails, the values of the additionally added Y bits need to be randomly taken during each retransmission.
Alternatively, the first and second electrodes may be,
when the extra bit sequence is b M ……b 0 And M is>When 0, to generate an index value of an integer to specify one of the 2-long non-orthogonal sequence sets, first, a bit sequence (b) is required m ……b 0 ) Converting into a decimal number, wherein M is more than or equal to 0 and less than or equal to M; then, the decimal number pair 16 is subjected to modulo operation, and the obtained modulo value is the index value. And when the transmission fails, the values of the additionally added Y bits need to be randomly taken during each retransmission.
In another embodiment, taking a 3-ary real number set as an example, it is determined that a 2-long non-orthogonal spreading sequence is to be generated, each element of the non-orthogonal spreading sequence is a complex number, and values of real parts and imaginary parts of all elements in the spreading sequence are derived from a 3-ary real number set, and the 3-ary real number set is a set consisting of odd numbers in the range of [ -1,0, +1 ].
According to a bit sequence (a) i ……a 0 +b m ……b 0 ) Generating an index value for an integer, 0 ≦ i ≦ 39,0 ≦ M ≦ M, the index value from one (3 × 3) 2 Set of prime integers, the set of 81 prime integers is [0, 81-1 ]]Or [1, 81 ]]A set of all integers within the range;
to generate the index value of the integer, first, (a) needs to be set i ……a 0 +b m ……b 0 ) I is more than or equal to 0 and less than or equal to 39, M is more than or equal to 0 and less than or equal to M; then, the decimal number pair 81 is subjected to modulo operation, and the obtained modulo value is the index value. And when the transmission fails, the values of the additionally added Y bits need to be randomly taken during each retransmission.
Alternatively, the first and second electrodes may be,
when the extra bit sequence is b M ……b 0 And (b) is M ……b 0 ) When the decimal value is greater than 81, in order to generate an index value of an integer to specify one of the 2-long non-orthogonal sequence set, first, a bit sequence (b) is required m ……b 0 ) Converting into a decimal number, wherein M is more than or equal to 0 and less than or equal to M; then, the decimal number pair 81 is subjected to modulo operation, and the obtained modulo value is the index value. And when the transmission fails, the values of the additionally added Y bits need to be randomly taken during each retransmission.
In another embodiment, a 3-ary real number set is taken as an example, to determine that a 2-long non-orthogonal spreading sequence is to be generated, each element of the non-orthogonal spreading sequence is a complex number, and values of real parts and imaginary parts of all elements in the spreading sequence are derived from a 3-ary real number set, the 3-ary real number set is a set consisting of odd numbers in the range of [ -1,0, +1], but it is required that real parts and imaginary parts of all elements in the spreading sequence cannot be 0 at the same time.
According to (a) i ……a 0 +b m ……b 0 ) Generating an index value for an integer, 0 ≦ i ≦ 39,0 ≦ M ≦ M, the index value being from a 64-way integer set, the 64-way integer set being [0, 64-1 ]]Or [1, 64 ]]A set of all integers within the range;
To generate the index value of the integer, first, (a) needs to be added i ……a 0 +b m ……b 0 ) I is more than or equal to 0 and less than or equal to 39, M is more than or equal to 0 and less than or equal to M; then, the decimal number pair 64 is subjected to a modulus operation, and the obtained modulus value is an index value. And when the transmission fails, the values of the additionally added Y bits need to be randomly taken during each retransmission.
Alternatively, the first and second electrodes may be,
when the extra bit sequence is b M ……b 0 And (b) are M ……b 0 ) When the decimal value is larger than 64, in order to generate an index value of an integer to specify one of the 2-long non-orthogonal sequence set, first, a bit sequence (b) is required m ……b 0 ) Converting into a decimal number, wherein M is more than or equal to 0 and less than or equal to M; then, the decimal number pair 64 is subjected to a modulus operation, and the obtained modulus value is an index value. And when the transmission fails, the values of the additionally added Y bits need to be randomly taken during each retransmission.
(2) Constructing a set (table) of 4 long complex field non-orthogonal sequences;
taking a 2-element real number set as an example, it is determined that a 2-long non-orthogonal spreading sequence is to be generated, each element of the non-orthogonal spreading sequence is a complex number, values of real parts and imaginary parts of all elements in the spreading sequence are from a 2-element real number set, and the 2-element real number set is a set composed of odd numbers in a range of { -1, +1 }.
And combining the obtained 2 complex numbers in sequence to obtain a complex spreading sequence, or multiplying the 2 complex numbers by corresponding energy normalization coefficients and combining in sequence to obtain the complex spreading sequence.
Then the set of non-orthogonal sequences generated at this time has (2 x 2) 2 A sequence of bars.
In another embodiment, a 3-element real number set is taken as an example, to determine that a 2-long non-orthogonal spreading sequence is to be generated, each element of the non-orthogonal spreading sequence is a complex number, and values of real parts and imaginary parts of all elements in the spreading sequence are derived from a 3-element real number set, and the 3-element real number set is a set composed of odd numbers in the range of { -1,0, +1 }.
And combining the obtained 2 complex numbers in sequence to obtain a complex spreading sequence, or multiplying the 2 complex numbers by corresponding energy normalization coefficients and combining in sequence to obtain the complex spreading sequence.
Then the set of non-orthogonal sequences generated at this time has (3 x 3) 2 A sequence of bars.
In another embodiment, a 3-element real number set is taken as an example, to determine that a 2-long non-orthogonal spreading sequence is to be generated, each element of the non-orthogonal spreading sequence is a complex number, and values of real parts and imaginary parts of all elements in the spreading sequence are derived from a 3-element real number set, and the 3-element real number set is a set composed of odd numbers in the range of { -1,0, +1 }.
And combining the obtained 2 complex numbers in sequence to obtain a complex spreading sequence, or multiplying the 2 complex numbers by corresponding energy normalization coefficients and then combining in sequence to obtain the complex spreading sequence.
However, it is required that the real part and imaginary part of all elements in the spreading sequence cannot be 0 at the same time, so that the set of non-orthogonal sequences generated at this time has (3X 3-1) 2 A sequence of bars.
(3) According to the index value in (1) and according to the preset mapping rule, including (2X 2) from (2) 2 Selecting one from a set (table) of 4 long non-orthogonal sequences; alternatively, the first and second electrodes may be,
according to the index value in (1) and preset mapping rule, including (3X 3) from (2) 2 Selecting one from a set (table) of 4 long non-orthogonal sequences of the strips; or alternatively
According to the index value in (1) and the preset mapping rule, the index value in (2) comprises (3X 3-1) 2 One of a set (table) of 4 long non-orthogonal sequences of bars is selected.
The third scheme is as follows: a 2-long complex spreading sequence is determined according to an additionally added bit sequence (the length of the bit sequence may be greater than or equal to 0), a part of the bit sequence (the length of the bit sequence may be greater than or equal to 0) of the terminal identification information (UE _ ID). The value of the additionally added bit sequence designates the starting position of the cyclic shift, and the value of the additionally added bit sequence can be randomly selected or sequentially increased during each retransmission:
With reference to the application scenario given in this embodiment, a generation process of the non-orthogonal spreading sequence C1 and the orthogonal spreading sequence C2 is described in more detail:
a method for generating a complex field binary spreading sequence C1, which can be divided into the following three parts:
(1) The UE _ ID is here a 40-long binary bit sequence of 0,1, e.g. a 39 a 38 ……a 1 a 0 Converting the bit sequence into decimal number, the decimal conversion method is as follows: a is 39 ×2 39 +a 38 ×2 38 +……+a 1 ×2 1 +a 0 ×2 0 . The length of the additionally added bit sequence is greater than or equal to 0, and each element takes on the value of 0, 1.
Taking a 2 × 2 integer set as an example, the transmitter generates an index value of a sequence of integers, elements of the sequence of integers each having a value from a 4-ary integer set {0,1,2,3}, and the sequence of integers has a length of 2.
When the extra bit is b M ……b 0 And M is>When 0, in order to generate the above-mentioned integer sequence, first, a bit sequence (a) is required i ……a 0 +b m ……b 0 ) Performing cyclic shift for 2 times, i is more than or equal to 0 and less than or equal to 39, M is more than or equal to 0 and less than or equal to M, the step length of each cyclic shift can be 0 bit or positive integer, and then using the decimal conversion method to obtain decimal number A of the bit sequence after each cyclic shift 1 、A 2 . The value of the additionally added bit sequence designates the initial position of the cyclic shift, and when the transmission fails, the values of the additionally added Y bits can be randomly selected during each retransmission or can be sequentially increased; such as If the values of the additionally added bits are sequentially increased during each retransmission, the values of the additionally added bits need to be cleared after the transmission is successful.
Finally, according to the decimal number A 1 、A 2 And solving the value of each element in the integer sequence as follows: a. The 1 mod 4、A 2 mod 4, where A p mod 4 represents a value modulo 4, p belongs to {1,2}, and the resulting sequence of integers { A } 1 mod 4、A 2 mod 4}。
In another embodiment, for example, using a 3 × 3 integer set, the transmitter generates an index value for a sequence of integers whose elements are derived from a 9-ary integer set {0,1,2, \8230; \ 8}, and whose length is 2.
When the extra bit is b M ……b 0 And M is>0, in order to generate the above-mentioned integer sequence, first, a bit sequence (a) is required i ……a 0 +b m ……b 0 ) Performing cyclic shift for 2 times, i is more than or equal to 0 and less than or equal to 39, M is more than or equal to 0 and less than or equal to M, and the step length of each cyclic shift can be 0 bit or positive integer, and then using the decimal conversion method to obtain decimal number A of the bit sequence after each cyclic shift 1 、A 2 . The value of the additionally added bit sequence designates the initial position of the cyclic shift, and when the transmission fails, the values of the additionally added Y bits can be randomly selected during each retransmission or can be sequentially increased; if the values of the additionally added bits are sequentially increased during each retransmission, the values of the additionally added bits need to be cleared after the transmission is successful.
Finally, according to the decimal number A 1 、A 2 And solving the value of each element in the integer sequence as follows: a. The 1 mod 9、A 2 mod 9, where A p mod 9 represents the value modulo 9, p belonging to {1,2}.
In another embodiment, the transmitter generates a sequence of integer index values, the values of the elements of the sequence of integers are from an 8-ary set of integers {0,1,2, \8230;, 7}, and the sequence of integers has a length of 2.
When the extra bit is b M ……b 0 And M is>0, in order to generate the above-mentioned integer sequence, first, a bit sequence (a) is required i ……a 0 +b m ……b 0 ) Performing cyclic shift for 2 times, i is more than or equal to 0 and less than or equal to 39, M is more than or equal to 0 and less than or equal to M, and the step length of each cyclic shift can be 0 bit or positive integer, and then using the decimal conversion method to obtain decimal number A of the bit sequence after each cyclic shift 1 、A 2 . The value of the additionally added bit sequence designates the initial position of the cyclic shift, and when the transmission fails, the values of the additionally added Y bits can be randomly selected during each retransmission or can be sequentially increased; if the values of the additionally added bits are sequentially increased during each retransmission, the values of the additionally added bits need to be cleared after the transmission is successful.
Finally, according to the decimal number A 1 、A 2 And solving the value of each element in the integer sequence as follows: a. The 1 mod 8、A 2 mod 8, where A p mod 8 represents the value modulo 8, p belonging to {1,2}.
(2) And constructing a constellation diagram which is associated with the index value and contains 4 complex constellation points. The values of the real part and the imaginary part of each constellation point in the complex constellation diagram are from a 2-element real number set, and the 2-element real number set is represented as [ -1, +1].
Therefore, the complex numbers corresponding to the 4 complex constellation points are-1 + j, -1-j, and 1-j, respectively.
In another embodiment, a constellation diagram is constructed that contains 9 complex constellation points associated with the index value. The values of the real part and the imaginary part of each constellation point in the complex constellation diagram are from a 3-element real number set, and the 3-element real number set is represented as [ -1,0, +1].
Therefore, the complex numbers corresponding to the 9 complex constellation points are-1 + j, -1-j, -1, +1, and 0, respectively.
In another embodiment, a constellation diagram comprising 8 complex constellation points associated with the index value is constructed. The complex numbers corresponding to each constellation point in the complex constellation diagram are-1 + j, -1-j, -1 and +1 respectively, that is, no 0 point is contained.
In another embodiment, a constellation diagram comprising 8 complex constellation points associated with the index value is constructed. The complex number corresponding to each constellation point in the complex constellation diagram is (-1 + j)/sqrt (2), (-1-j)/sqrt (2), (1-j)/sqrt (2), -j, -1, +1, respectively, that is, no 0 point is contained.
(3) Selecting 4 corresponding complex constellation points from a 4-point complex constellation diagram according to a preset mapping rule according to 2 elements in the pseudorandom integer sequence;
the complex spreading sequence is generated by mapping the index value of the integer sequence in (1) to the complex constellation points of the 4-point complex constellation (each complex constellation point represents a complex number) bit by bit according to the mapping relationship between the elements in the 4-element integer set and the complex constellation points of the 4-point complex constellation (as shown in fig. 15), and is expressed by the following formula:
A p —>ComplexSeq p
wherein, complexSeq p Representing the p-th element of the complex spreading sequence, and according to the mapping relation between the elements in the 4-element integer set and the complex constellation points of the 4-point complex constellation diagram, the p-th element is represented by A p Mapping to obtain, A p Representing the ith element of the pseudorandom integer sequence.
And determining 2 complex numbers corresponding to 4 complex constellation points according to the integer sequence index value, and sequentially combining the 2 complex numbers to obtain a complex spreading sequence, or sequentially combining the 2 complex numbers multiplied by corresponding energy normalization coefficients to obtain the complex spreading sequence.
In another embodiment, the complex spreading sequence is generated by mapping the index values of the integer sequence in (1) to the complex constellation points of the 9-point complex constellation (each complex constellation point represents a complex number) 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), and is formulated as follows:
A p —>ComplexSeq p
Wherein, complexSeq p Representing the p-th element of the complex spreading sequence, according to the mapping relation between the elements in the 9-element integer set and the complex constellation points of the 9-point complex constellation diagram, A p Mapping to obtain p Representing the p-th element of the pseudorandom integer sequence.
And determining 2 complex numbers corresponding to the 9 complex constellation points according to the integer sequence index value, and sequentially combining the 2 complex numbers to obtain a complex spreading sequence, or sequentially combining the 2 complex numbers multiplied by corresponding energy normalization coefficients to obtain the complex spreading sequence.
In another embodiment, the complex spreading sequence is generated by mapping the index values of the integer sequence in (1) to the complex constellation points of the 8-point complex constellation (each complex constellation point represents a complex number) bit by bit according to the mapping relationship between the elements in the 8-element integer set and the complex constellation points of the 8-point complex constellation (as shown in fig. 17), and is formulated as follows:
A p —>ComplexSeq p
wherein, complexSeq p Representing the p-th element of the complex spreading sequence, and according to the mapping relation between the elements in the 8-element integer set and the complex constellation points of the 8-point complex constellation diagram, the p-th element is represented by A p Mapping to obtain p Representing the p-th element of the pseudorandom integer sequence.
According to the integer sequence index value, 2 complex numbers corresponding to 8 complex constellation points are determined, and the 2 complex numbers are sequentially combined to obtain a complex spreading sequence, or the 2 complex numbers are multiplied by corresponding energy normalization coefficients and then are sequentially combined to obtain the complex spreading sequence.
In another embodiment, the complex spreading sequence is generated by mapping the index values of the sequence of integers in (1) to the complex constellation points of the 8-point complex constellation (each complex constellation point represents a complex number) 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), and is formulated as follows:
A p —>ComplexSeq p
wherein, complexSeq p Representing the p-th element of a complex spreading sequence, according to an 8-membered integerThe mapping relation between the elements in the set and the complex constellation points of the 8-point complex constellation diagram is represented by A p Mapping to obtain p Representing the p-th element of the pseudorandom integer sequence.
And determining 2 complex numbers corresponding to 8 complex constellation points according to the integer sequence index value, and sequentially combining the 2 complex numbers to obtain a complex spreading sequence, or sequentially combining the 2 complex numbers multiplied by corresponding energy normalization coefficients to obtain the complex spreading sequence.
(II) another method for generating a complex field binary spreading sequence C1, and the method can be divided into the following three parts:
(1) The UE _ ID is here a 40-long binary bit sequence of 0,1, e.g. a 39 a 38 ……a 1 a 0 Converting the bit sequence into decimal number, the decimal conversion method is as follows: a is 39 ×2 39 +a 38 ×2 38 +……+a 1 ×2 1 +a 0 ×2 0 And (d) = A. The length of the additional bit sequence is greater than or equal to 0, each element takes on the value of 0,1, and the additional bit is b M ……b 0 And M is>0。
Taking a 2-element real number set as an example, it is determined that a 2-long non-orthogonal spreading sequence is to be generated, each element of the non-orthogonal spreading sequence is a complex number, values of real parts and imaginary parts of all elements in the spreading sequence are derived from a 2-element real number set, the 2-element real number set is a set composed of odd numbers in the range { -1, +1}, and there are 16 non-orthogonal sequences in the 2-long non-orthogonal sequence set.
For this purpose, an integer index value is generated, according to which a non-orthogonal sequence in the set of non-orthogonal sequences can be uniquely assigned and the index value is derived from one (2 x 2) 2 Set of prime integers, set of 16 prime integers is [0, 16-1 ]]Or [1, 16 ]]A set of all integers within the range;
when the extra bit is b M ……b 0 And M is>When 0, to generate an index value of an integer to specify one of the 2-long non-orthogonal sequence sets, first, a bit sequence (a) needs to be assigned i ……a 0 +b m ……b 0 ) Converting into a decimal number, i is more than or equal to 0 and less than or equal to 39, M is more than or equal to 0 and less than or equal to M; then, the decimal number pair 16 is subjected to modulo operation, and the obtained modulo value is the index value. And when the transmission fails, the values of the additionally added Y bits need to be randomly taken during each retransmission.
Alternatively, the first and second liquid crystal display panels may be,
when the extra bit sequence is b M ……b 0 And M is>3, in order to generate an index value of an integer to specify one of the 2-long non-orthogonal sequence sets, first, a bit sequence (b) is required m ……b 0 ) Converting into a decimal number, wherein M is more than or equal to 0 and less than or equal to M; then, the decimal number pair 16 is subjected to modulo operation, and the obtained modulo value is the index value. And when the transmission fails, the values of the additionally added Y bits need to be randomly taken during each retransmission.
In another embodiment, a 3-ary real number set is taken as an example, to determine that a 2-long non-orthogonal spreading sequence is to be generated, each element of the non-orthogonal spreading sequence is a complex number, and values of real parts and imaginary parts of all elements in the spreading sequence are derived from a 3-ary real number set, and the 3-ary real number set is a set composed of odd numbers in the range of { -1,0, +1 }.
According to the bit sequence (a) i ……a 0 +b m ……b 0 ) Generating an index value for an integer, 0 ≦ i ≦ 39,0 ≦ M ≦ M, the index value from one (3 × 3) 2 Set of prime integers, the set of 81 prime integers is [0, 81-1 ]]Or [1, 81 ]]A set of all integers within the range;
to generate the index value of the integer, first, (a) needs to be added i ……a 0 +b m ……b 0 ) I is more than or equal to 0 and less than or equal to 39, M is more than or equal to 0 and less than or equal to M; then, the decimal number pair 81 is subjected to modulo operation, and the obtained modulo value is the index value. And when the transmission fails, the values of the additionally added Y bits need to be randomly taken during each retransmission.
Alternatively, the first and second electrodes may be,
when the extra added bit sequence is b M ……b 0 And (b) is M ……b 0 ) When the decimal value is greater than 81, in order to generate an index value of an integer to specify one of a 2-long non-orthogonal sequence set, it is first necessary to assign a bit sequence (b) m ……b 0 ) Converting into a decimal number, wherein M is more than or equal to 0 and less than or equal to M; then, the decimal number pair 81 is subjected to modulo operation, and the obtained modulo value is the index value. And when the transmission fails, the values of the additionally added Y bits need to be randomly taken during each retransmission.
In another embodiment, a 3-ary real number set is taken as an example, to determine that a 2-long non-orthogonal spreading sequence is to be generated, each element of the non-orthogonal spreading sequence is a complex number, and values of real parts and imaginary parts of all elements in the spreading sequence are derived from a 3-ary real number set, the 3-ary real number set is a set consisting of odd numbers in the range of [ -1,0, +1], but it is required that real parts and imaginary parts of all elements in the spreading sequence cannot be 0 at the same time.
According to (a) i ……a 0 +b m ……b 0 ) Generating an index value for an integer, 0 ≦ i ≦ 39,0 ≦ M ≦ M, the index value being from a 64-ary integer set, the 64-ary integer set being [0, 64-1 ]]Or [1, 64 ]]A set of all integers within the range;
To generate the index value of the integer, first, (a) needs to be added i ……a 0 +b m ……b 0 ) I is more than or equal to 0 and less than or equal to 39, M is more than or equal to 0 and less than or equal to M; then, the decimal number pair 64 is subjected to a modulus operation, and the obtained modulus value is an index value. And when the transmission fails, the values of the additionally added Y bits need to be randomly taken during each retransmission.
Alternatively, the first and second liquid crystal display panels may be,
when the extra added bit sequence is b M ……b 0 And (b) is M ……b 0 ) When the decimal value is larger than 64, in order to generate an index value of an integer to specify one of the 2-long non-orthogonal sequence set, first, a bit sequence (b) is required m ……b 0 ) Converting into a decimal number, wherein M is more than or equal to 0 and less than or equal to M; then, the decimal number is modulo-operated on 64, and the modulus is obtainedThe value is the index value. And when the transmission fails, the values of the additionally added Y bits need to be randomly taken during each retransmission.
(2) Constructing a set (table) of 2-long complex field non-orthogonal sequences;
taking a 2-element real number set as an example, determining that a 2-long non-orthogonal spreading sequence is to be generated, each element of the non-orthogonal spreading sequence is a complex number, and values of real parts and imaginary parts of all elements in the spreading sequence are from a 2-element real number set, and the 2-element real number set is a set composed of odd numbers in a range of { -1, +1 }.
And combining the obtained 2 complex numbers in sequence to obtain a complex spreading sequence, or multiplying the 2 complex numbers by corresponding energy normalization coefficients and combining in sequence to obtain the complex spreading sequence.
Then the set of non-orthogonal sequences generated at this time has (2 x 2) 2 A sequence of bars.
In another embodiment, a 3-element real number set is taken as an example, to determine that a 2-long non-orthogonal spreading sequence is to be generated, each element of the non-orthogonal spreading sequence is a complex number, and values of real parts and imaginary parts of all elements in the spreading sequence are derived from a 3-element real number set, and the 3-element real number set is a set composed of odd numbers in the range of { -1,0, +1 }.
And combining the obtained 2 complex numbers in sequence to obtain a complex spreading sequence, or multiplying the 2 complex numbers by corresponding energy normalization coefficients and combining in sequence to obtain the complex spreading sequence.
Then the set of non-orthogonal sequences generated at this time has (3 × 3) 2 A sequence of bars.
In another embodiment, a 3-element real number set is taken as an example, to determine that a 2-long non-orthogonal spreading sequence is to be generated, each element of the non-orthogonal spreading sequence is a complex number, and values of real parts and imaginary parts of all elements in the spreading sequence are derived from a 3-element real number set, and the 3-element real number set is a set composed of odd numbers in the range of { -1,0, +1 }.
And combining the obtained 2 complex numbers in sequence to obtain a complex spreading sequence, or multiplying the 2 complex numbers by corresponding energy normalization coefficients and combining in sequence to obtain the complex spreading sequence.
However, it is required that the real part and imaginary part of all elements in the spreading sequence cannot be 0 at the same time, so that the set of non-orthogonal sequences generated at this time has (3X 3-1) 2 A sequence of bars.
(3) According to the index value in (1) and according to the preset mapping rule, including (2X 2) from (2) 2 2, selecting one from a set (table) of long non-orthogonal sequences; alternatively, the first and second electrodes may be,
according to the index value in (1) and preset mapping rule, including (3X 3) from (2) 2 Selecting one from a set (table) of 2 long non-orthogonal sequences of strips; or
According to the index value in (1) and preset mapping rule, including (3X 3-1) from (2) 2 One of a set (table) of 2 long non-orthogonal sequences of bars is selected.
Then, the obtained non-orthogonal spreading sequence C1 is used to perform spreading processing on the data symbols to be transmitted: forming N bit sequence at least containing own terminal identification information by coding modulation 1 One modulation symbol, plus N 2 A total of N pilot symbols, N = N 1 +N 2 The N symbols are expanded to 2 × N symbols.
For example, the modulated data symbol is S k First, S is k Using 2 long non-orthogonal spreading sequences C1= { C = { (C) } 11 ,c 12 Carry out the expansion processing, the expansion processing in this step means S k And { c 11 ,c 12 Complex multiplication is carried out on each element (complex sign) in the data, and data (S) after the first expansion processing is obtained k c 11, S k c 12 }。
And finally, converting the extended symbols into corresponding carrier modulation signals through carrier modulation (single carrier or multi-carrier modulation). The resultant carrier-modulated signal (single-carrier or multi-carrier modulated signal) formed as described above is transmitted.
Preferred embodiment 8
The base station has more receiving antennas, for example 4/8/16 or more receiving antennas, in this case, the terminal encodes and modulates the 'bit sequence' by the CRC + convolutional code into N modulation symbols, then modulates the N modulation symbols by using OFDM/SC-FDMA/DFT-S-OFDM with CP, and then transmits the modulated symbols to the base station; the base station separates information of the respective terminals using an advanced receiver. This situation is equivalent to the transmit side not needing an extension.
As shown in fig. 28, the modulated data symbol is S k Spreading it with a spreading sequence of length 1; alternatively, the modulated data symbol S k The signal is directly converted into a corresponding carrier modulation signal through carrier modulation (single carrier or multi-carrier modulation) without expansion processing.
Preferred embodiment 9: two non-orthogonal sequence spreads:
the embodiment provides an access method based on expansion, which comprises the following steps:
the transmitter side processes signals: the terminal changes a 'bit sequence' into 144 modulation symbols after CRC + convolutional code coding and modulation, then adds 24 pilot symbols (the data plus the pilot symbols correspond to the time-frequency resources needing 1 PRB of LTE to carry), then uses a 4-long complex domain spreading sequence, then uses 8-long (or 4-long) non-orthogonal spreading sequences to carry out spreading (the spread symbols need 32 (or 16) PRB time-frequency resources to carry), and finally uses OFDM/SC-FDMA/DFT-S-OFDM modulation with CP to transmit the spread symbols to a base station; the base station separates information of the respective terminals using an advanced receiver. Alternatively, the first and second electrodes may be,
the transmitter side processes signals: the terminal changes a 'bit sequence' into 144 modulation symbols after CRC + convolutional code coding and modulation, then adds 24 pilot symbols (the data plus the pilot symbols correspond to time-frequency resources needing 1 PRB of LTE) to carry), then uses a non-orthogonal spreading sequence with 8 length (or 4 length) to carry out spreading, then uses a complex domain spreading sequence with 4 length (the spread symbols need 32 (or 16) PRB time-frequency resources to carry), and finally uses OFDM/SC-FDMA/DFT-S-OFDM modulation with CP to transmit the spread symbols to a base station; the base station separates information of the respective terminals using an advanced receiver. Alternatively, the first and second liquid crystal display panels may be,
The transmitter side comprises the following signal processing processes: the terminal codes and modulates the 'bit sequence' by CRC + convolutional codes to become 144 modulation symbols, then adds 24 pilot symbols (the data plus the pilot symbols are carried by the time-frequency resources which need 1 PRB of LTE), then uses a 32-long spreading sequence to spread the modulation symbols, the 32-long (or 16-long) spreading sequence is obtained by spreading 8-long (or 4-long) non-orthogonal spreading sequence and 4-long complex field spreading sequence, and finally uses OFDM/SC-FDMA/DFT-S-OFDM modulation with CP to transmit the spread symbols to the base station; the base station separates information of the respective terminals using an advanced receiver. Alternatively, the first and second liquid crystal display panels may be,
the transmitter side processes signals: the terminal codes and modulates the 'bit sequence' by CRC + convolutional codes to become 144 modulation symbols, then adds 24 pilot symbols (the data plus the pilot symbols are carried by time-frequency resources which need LTE 1 PRB), then uses a 4-long complex number domain extended sequence, and finally modulates the extended symbols by OFDM/SC-FDMA/DFT-S-OFDM with CP and sends the symbols to the base station; the base station separates information of the respective terminals using an advanced receiver.
The procedure of the access method based on the extension at the transmitter side of the embodiment includes:
Step 110, determining a 4-long complex spreading sequence or an 8-long (or 4-long) non-orthogonal spreading sequence according to the bit sequence information. In this embodiment, the identification information UE _ ID of the terminal itself may be a bit sequence 40 long, and the length of UE _ ID is suggested to be greater than 16, C1 is a complex field binary spreading sequence 4 long, C2 is a non-orthogonal spreading sequence 8 long (or 4 long), and the value of the element in C2 is { +1, -1}.
The bit sequence comprises a bit sequence of terminal identity identification information in the network (or information capable of representing the terminal identity, which may be collectively referred to as terminal identity identification for short, such as part or all of identification information UE _ ID of the terminal itself, or temporary identification in the network) or an additionally added bit sequence; the length and value of the extra bit sequence are related to the terminal identity information, or the transmission times, or the size of the data packet, or the time-frequency position, or the cell configuration.
Determining a 4-long complex spreading sequence or an 8-long (or 4-long) non-orthogonal spreading sequence according to the bit sequence information, and dividing into the following three schemes according to whether to add extra bits and different roles of the added bits:
the first scheme is as follows: determining 4 long complex spreading sequences or 8 long (or 4 long) non-orthogonal spreading sequences according to the terminal identity information without using extra added bits for introducing randomness:
With reference to the application scenario given in this embodiment, a generation process of the non-orthogonal spreading sequences C1 and C2 is described in more detail:
a method for generating a complex field binary spreading sequence C1, which can be divided into the following three parts:
(1) The UE _ ID is here a 40-long binary bit sequence of 0,1, e.g. a 39 a 38 ……a 1 a 0 The bit sequence is converted into decimal number, and the decimal conversion method comprises the following steps: a is 39 *2 39 +a 38 *2 38 +……+a 1 *2 1 +a 0 *2 0 ＝A。
Taking the 2 x 2 integer set as an example, the transmitter generates an index value of an integer sequence in which the values of the elements are all from a 4-element integer set {0,1,2,3}, and the length of the integer sequence is 4.
To generate the above-described integer sequence, first, a bit sequence (a) needs to be generated i ……a 0 ) Performing 4 times of cyclic shift, i is more than or equal to 0 and less than or equal to 39, and the step length of each cyclic shift can be 0 bit or positive integer, and then using the decimal conversion method to obtain decimal number A of the bit sequence after each cyclic shift 1 、A 2 、A 3 And A 4 。
Finally, according to the decimal number A 1 、A 2 、A 3 And A 4 And solving the value of each element in the integer sequence as follows: a. The 1 mod 4、A 2 mod 4、A 3 mod 4 and A 4 mod 4, where A p mod 4 represents a value modulo 4, p belongs to {1,2,3,4}, and the result is the value Integer sequence of { A } 1 mod 4、A 2 mod 4、A 3 mod 4、A 4 mod 4}。
In another embodiment, for example, using a 3-by-3 integer set, the transmitter generates an index value for an integer sequence whose elements take values from a 9-ary integer set {0,1,2, \ 8230; \ 8230;, 8,9}, and whose length is 4.
To generate the above-mentioned integer sequence, first, the bit sequence a needs to be generated i ……a 0 Performing 4 times of cyclic shift, i is more than or equal to 0 and less than or equal to 39, and the step length of each cyclic shift can be 0 bit or positive integer, and using the decimal conversion method to obtain decimal number A of the bit sequence after each cyclic shift 1 、A 2 、A 3 And A 4 。
Finally, according to the decimal number A 1 、A 2 、A 3 And A 4 And solving the value of each element in the integer sequence as follows: a. The 1 mod 9、A 2 mod 9、A 3 mod 9 and A 4 mod 9, where A p mod 9 represents the value modulo 9, p belonging to {1,2,3,4}, resulting in the sequence of integers { A } 1 mod 9、A 2 mod 9、A 3 mod 9、A 4 mod 9}。
In another embodiment, the transmitter generates a sequence of integers having elements from an 8-ary set of integers {0,1,2, \8230; \8230, 7,8}, and a length of 4.
To generate the above-mentioned integer sequence, first, the bit sequence a needs to be generated i ……a 0 Performing 4 times of cyclic shift, i is more than or equal to 0 and less than or equal to 39, the step length of each cyclic shift can be 0 bit or positive integer, and then using the decimal conversion method to obtain the decimal number A of the bit sequence after each cyclic shift 1 、A 2 、A 3 And A 4 。
Finally, according to the decimal number A 1 、A 2 、A 3 And A 4 Determining each element in said sequence of integersThe values of the elements are: a. The 1 mod 8、A 2 mod 8、A 3 mod 8 and A 4 mod 8, where A p mod 8 represents a value modulo 8, p belonging to {1,2,3,4}, resulting in the sequence of integers { A } 1 mod 8、A 2 mod 8、A 3 mod 8、A 4 mod 8}。
(2) And constructing a constellation diagram which is associated with the index value and contains 4 complex constellation points. The values of the real part and the imaginary part of each constellation point in the complex constellation diagram are from a 2-element real number set, and the 2-element real number set is represented as [ -1, +1].
Therefore, the plural numbers corresponding to the 4 plural constellation points are-1 + j, -1-j, and 1-j, respectively.
In another embodiment, a constellation diagram is constructed that contains 9 complex constellation points associated with the index value. The values of the real part and the imaginary part of each constellation point in the complex constellation diagram are from a 3-element real number set, and the 3-element real number set is represented as [ -1,0, +1].
Therefore, the complex numbers corresponding to the 9 complex constellation points are-1 + j, -1-j, -1, +1, and 0, respectively.
In another embodiment, a constellation diagram comprising 8 complex constellation points associated with the index value is constructed. The complex number corresponding to each constellation point in the complex constellation diagram is-1 + j, -1-j, -1 and +1 respectively, that is, no 0 point is contained.
In another embodiment, a constellation diagram is constructed that contains 8 complex constellation points associated with the index value. The complex number corresponding to each constellation point in the complex constellation diagram is (-1 + j)/sqrt (2), (-1-j)/sqrt (2), (1-j)/sqrt (2), -j, -1 and +1, respectively, that is, no 0 point is contained.
(3) Selecting corresponding 4 complex constellation points from a 4-point complex constellation diagram according to a preset mapping rule according to 4 elements in the pseudorandom integer sequence;
mapping the index value of the integer sequence in (1) to the complex constellation points of the 4-point complex constellation (each complex constellation point represents a complex number) bit by bit according to the mapping relationship between the elements in the 4-element integer set and the complex constellation points of the 4-point complex constellation (as shown in fig. 16) to generate a complex spreading sequence, which is formulated as follows:
A p —>ComplexSeq p
wherein, complexSeq p Representing the p-th element of the complex spreading sequence, and according to the mapping relation between the elements in the 4-element integer set and the complex constellation points of the 4-point complex constellation diagram, the p-th element is represented by A p Mapping to obtain p Representing the p-th element of the pseudorandom integer sequence.
And determining 4 complex numbers corresponding to the 4 complex constellation points according to the integer sequence index value, and sequentially combining the 4 complex numbers to obtain the complex spreading sequence, or sequentially combining the 4 complex numbers multiplied by the corresponding energy normalization coefficient to obtain the complex spreading sequence.
In another embodiment, the complex spreading sequence is generated by mapping the index values of the integer sequence in (1) to the complex constellation points of the 9-point complex constellation (each complex constellation point represents a complex number) bit by bit according to the mapping relationship between the elements in the 9-element integer set and the complex constellation points of the 9-point complex constellation (as shown in fig. 17), and is formulated as follows:
A p —>ComplexSeq p
wherein, complexSeq p Representing the p-th element of the complex spreading sequence, according to the mapping relation between the elements in the 9-element integer set and the complex constellation points of the 9-point complex constellation diagram, A p Mapping to obtain p Representing the p-th element of the pseudorandom integer sequence.
And determining 4 complex numbers corresponding to the 9 complex constellation points according to the integer sequence index value, and sequentially combining the 4 complex numbers to obtain the complex spreading sequence, or sequentially combining the 4 complex numbers multiplied by corresponding energy normalization coefficients to obtain the complex spreading sequence.
In another embodiment, the complex spreading sequence is generated by mapping the index values of the integer sequence in (1) to the complex constellation points of the 8-point complex constellation (each complex constellation point represents a complex number) bit by bit according to the mapping relationship between the elements in the 8-element integer set and the complex constellation points of the 8-point complex constellation (as shown in fig. 18), and is formulated as follows:
A p —>ComplexSeq p
Wherein, complexSeq p Representing the p-th element of the complex spreading sequence, and according to the mapping relation between the elements in the 8-element integer set and the complex constellation points of the 8-point complex constellation diagram, the p-th element is represented by A p Mapping to obtain p Representing the p-th element of the pseudorandom integer sequence.
And determining 4 complex numbers corresponding to the 8 complex constellation points according to the integer sequence index value, and sequentially combining the 4 complex numbers to obtain the complex spreading sequence, or sequentially combining the 4 complex numbers multiplied by corresponding energy normalization coefficients to obtain the complex spreading sequence.
In another embodiment, the complex spreading sequence is generated by mapping the index values of the sequence of integers in (1) to the complex constellation points of the 8-point complex constellation (each complex constellation point represents a complex number) 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), and is formulated as follows:
A p —>ComplexSeq p
wherein, complexSeq i Representing the p-th element of the complex spreading sequence, and according to the mapping relation between the elements in the 8-element integer set and the complex constellation points of the 8-point complex constellation diagram, the p-th element is represented by A p Mapping to obtain p Representing the p-th element of the pseudorandom integer sequence.
And determining 4 complex numbers corresponding to the 8 complex constellation points according to the integer sequence index value, and sequentially combining the 4 complex numbers to obtain the complex spreading sequence, or sequentially combining the 4 complex numbers multiplied by the corresponding energy normalization coefficient to obtain the complex spreading sequence.
(II) another method for generating a complex field binary spreading sequence C1, and the method can be divided into the following three parts:
(1) The UE _ ID is here a 40-long binary bit sequence of 0, 1, e.g. a 39 a 38 ……a 1 a 0 Converting the bit sequence into decimal number, the decimal conversion method is as follows: a is a 39 *2 39 +a 38 *2 38 +……+a 1 *2 1 +a 0 *2 0 ＝A。
Taking a 2-element real number set as an example, determining that a 4-long non-orthogonal spreading sequence is to be generated, each element of the non-orthogonal spreading sequence is a complex number, and values of real parts and imaginary parts of all elements in the spreading sequence are from a 2-element real number set, wherein the 2-element real number set is a set composed of odd numbers in a range of [ -1, +1 ].
Generating an index value of an integer from the UE _ ID, the index value being from one (2 x 2) 4 A set of primitive integers, the set of 256 primitive integers being [0, 256-1 ]]Or [1, 256 ]]A set of all integers within the range;
to generate the index value of the integer, first, the bit sequence a needs to be generated i ……a 0 The decimal number is converted, and i is more than or equal to 0 and less than or equal to 39; then, the decimal number pair 256 is subjected to modulo operation, and the obtained modulo value is the index value.
In another embodiment, taking a 3-element real number set as an example, it is determined that a 4-long non-orthogonal spreading sequence is to be generated, each element of the non-orthogonal spreading sequence is a complex number, and values of real parts and imaginary parts of all elements in the spreading sequence are derived from a 3-element real number set, where the 3-element real number set is a set consisting of odd numbers in a range of [ -1,0, +1 ].
Generating an index value of an integer from the UE _ ID, the index value being from one (3 x 3) 4 A set of prime integers, said set of 6561 prime integers being [0, 6561-1 ]]Or [1, 6561]A set of all integers within the range;
to generate the index value of the integer, first, the bit sequence a needs to be set i ……a 0 The decimal number is converted, and i is more than or equal to 0 and less than or equal to 39; then, the decimal number is modulo-operated on 6561, and the obtained modulo value is the index value.
In another embodiment, a 3-ary real number set is taken as an example, it is determined that a 4-long non-orthogonal spreading sequence is to be generated, each element of the non-orthogonal spreading sequence is a complex number, and values of real parts and imaginary parts of all elements in the spreading sequence are derived from a 3-ary real number set, the 3-ary real number set is a set consisting of odd numbers in the range of [ -1,0, +1], but it is required that real parts and imaginary parts of all elements in the spreading sequence cannot be 0 at the same time.
Generating an index value of an integer from a UE _ ID, the index value being from an 8 4 A set of prime integers, said set of 4096 prime integers being [0, 4096-1]Or [1, 4096]A set of all integers within the range;
to generate the index value of the integer, first, the bit sequence a needs to be set i ……a 0 The decimal number is converted, and i is more than or equal to 0 and less than or equal to 39; then, the decimal number is subjected to a modular operation on 4096, and the obtained modular value is an index value.
(2) Constructing a set (table) of 4 long complex field non-orthogonal sequences;
taking a 2-element real number set as an example, determining to generate a 4-long non-orthogonal spreading sequence, wherein each element of the non-orthogonal spreading sequence is a complex number, and values of real parts and imaginary parts of all elements in the spreading sequence are from a 2-element real number set, and the 2-element real number set is a set consisting of odd numbers in a range of [ -1, +1 ].
And combining the obtained 4 complex numbers in sequence to obtain the complex spreading sequence, or multiplying the 4 complex numbers by corresponding energy normalization coefficients and then combining in sequence to obtain the complex spreading sequence.
Then the set of non-orthogonal sequences generated at this time has (2 x 2) 4 A sequence of bars.
In another embodiment, a 3-ary real number set is taken as an example, it is determined that a 4-long non-orthogonal spreading sequence is to be generated, each element of the non-orthogonal spreading sequence is a complex number, and values of real parts and imaginary parts of all elements in the spreading sequence are derived from a 3-ary real number set, and the 3-ary real number set is a set composed of odd numbers in the range of [ -1,0, +1 ].
And combining the obtained 4 complex numbers in sequence to obtain the complex spreading sequence, or multiplying the 4 complex numbers by corresponding energy normalization coefficients and then combining in sequence to obtain the complex spreading sequence.
Then the set of non-orthogonal sequences generated at this time has (3 x 3) 4 A sequence of bars.
In another embodiment, a 3-ary real number set is taken as an example, it is determined that a 4-long non-orthogonal spreading sequence is to be generated, each element of the non-orthogonal spreading sequence is a complex number, and values of real parts and imaginary parts of all elements in the spreading sequence are derived from a 3-ary real number set, and the 3-ary real number set is a set composed of odd numbers in the range of [ -1,0, +1 ].
And combining the obtained 4 complex numbers in sequence to obtain the complex spreading sequence, or multiplying the 4 complex numbers by corresponding energy normalization coefficients and then combining in sequence to obtain the complex spreading sequence.
However, it is required that the real part and the imaginary part of all elements in the spreading sequence cannot be 0 at the same time, so that the set of non-orthogonal sequences generated at this time has (3 x 3-1) 4 A sequence of bars.
(3) According to the index value in (1) and according to a preset mapping rule, (2 x 2) is contained in (2) 4 Selecting one from a set (table) of 4 long non-orthogonal sequences; alternatively, the first and second electrodes may be,
according to the index value in (1) and preset mapping rule, including (3 x 3) from (2) 4 Selecting one from a set (table) of 4 long non-orthogonal sequences of strips; or
According to the index value in (1) and preset mapping rule, including (3 x 3-1) from (2) 4 One of a set (table) of 4 long non-orthogonal sequences of bars is selected.
(III) A method for generating 8 long (or 4 long) non-orthogonal spreading sequences C2, which can be divided into the following three parts:
(1) The UE _ ID is here a 40-long binary bit sequence of 0, 1, e.g. a 39 a 38 ……a 1 a 0 Converting the bit sequence into a decimal number, the decimal systemThe conversion method comprises the following steps: a is 39 *2 39 +a 38 *2 38 +……+a 1 *2 1 +a 0 *2 0 ＝A。
Determining a non-orthogonal spreading sequence set with a sequence length of 8 (or 4) to be generated, wherein the value of each element of each non-orthogonal sequence in the sequence set is from { -1, +1}, and the total number of 16 (or 8) non-orthogonal sequences in the non-orthogonal sequence set is total.
Generating an index value of an integer from a set of 16-ary (or 8-ary) integers, the set of 16-ary (or 8-ary) integers being a set of all integers in a [0, 16-1] or [1, 16] range (or a [0,8-1] or [1,8] range), according to the UE _ ID;
to generate the index value of the integer, first, a needs to be set i ……a 0 Converting the decimal number into a decimal number, wherein i is more than or equal to 0 and less than or equal to 39; then, the decimal number pair 16 (or 8) is subjected to modulus operation, and the obtained modulus value is the index value.
(2) Constructing a set (table) containing 16 non-orthogonal spreading sequences with length of 8 (or 8 non-orthogonal spreading sequences with length of 4);
for example, one method of generating 16, 8 (or 8, 4) non-orthogonal sequences is given:
a matrix of 8 long 8 columns consisting of a set of 8 long positive sequences is first obtained:
Figure GDA0003742351690001021
then orthogonal H 8 The matrix points multiply an 8-long column matrix, and the value of each element in the 8-long column matrix is taken from { +1, -1}, for example, where an 8-long column matrix is:
Figure GDA0003742351690001031
namely, then: h 16 ＝[H 8 H 8 ·A 0 ]
Wherein, is formed by H 16 The set of each column in (a) is a set of 1 8 long non-orthogonal sequences.
Alternatively, the first and second liquid crystal display panels may be,
a 4-long 4-column matrix consisting of a 4-long positive sequence set is first obtained:
Figure GDA0003742351690001032
then orthogonal H 4 The matrix points multiply a 4-long column matrix, and the value of each element in the 4-long column matrix is taken from { +1, -1}, for example, where a 4-long column matrix is:
Figure GDA0003742351690001033
Namely, and: h 8 ＝[H 4 H 4 ·A 1 ]
Wherein, is formed by H 8 The set of each column in (a) is a set of 1 4 long non-orthogonal sequences.
(3) And (2) selecting one from a set (table) containing 16 non-orthogonal spreading sequences with the length of 8 (or 8 non-orthogonal spreading sequences with the length of 4) according to the index value in the step (1) and a preset mapping rule.
(IV) another method for generating 8 long (or 4 long) non-orthogonal spreading sequences C2, which can be divided into the following two parts:
(1) Constructing a set (table) containing 16 non-orthogonal spreading sequences with length of 8 (or 8 non-orthogonal spreading sequences with length of 4);
for example, one method of generating 16 8 long (or 8 4 long) non-orthogonal sequences is given:
a matrix of 8 long 8 columns consisting of a set of 8 long positive sequences is first obtained:
Figure GDA0003742351690001041
then orthogonal H 8 Dot-by-dot multiplying an 8-long column matrix, with each element in the 8-long column matrixThe values of the elements are all taken from { +1, -1}, for example, an 8-long column matrix is:
Figure GDA0003742351690001042
namely, and: h 16 ＝[H 8 H 8 ·A 0 ]
Wherein, is prepared from H 16 The set of each column in (a) is a set of 1 8 long non-orthogonal sequences.
Alternatively, the first and second liquid crystal display panels may be,
a 4-long 4-column matrix consisting of a 4-long positive sequence set was first obtained:
Figure GDA0003742351690001043
then orthogonal H 4 The matrix points multiply a 4-long column matrix, and the value of each element in the 4-long column matrix is taken from { +1, -1}, for example, where a 4-long column matrix is:
Figure GDA0003742351690001044
Namely, and: h 8 ＝[H 4 H 4 ·A 1 ]
Wherein, is prepared from H 8 The set of each column in (a) is a set of 1 4 long non-orthogonal sequences.
(2) And (2) randomly selecting one from a set (table) of 16 non-orthogonal spreading sequences with 8 lengths (or 8 non-orthogonal spreading sequences with 4 lengths) in the step (1).
Scheme II: and determining a 4-long complex spreading sequence or an 8-long (or 4-long) non-orthogonal spreading sequence according to the additionally added bit sequence (the length of the bit sequence can be greater than or equal to 0) and the bit sequence of the terminal identity information (the length of the bit sequence can be greater than or equal to 0). Because the value of the additionally added bit sequence is randomly selected at each retransmission, the additionally added bit sequence can play a role of randomization:
with reference to the application scenario given in this embodiment, a generation process of the non-orthogonal spreading sequences C1 and C2 is described in more detail:
a method for generating a complex field binary spreading sequence C1, which can be divided into the following three parts:
(1) Here the UE _ ID is a 40-long sequence of 0,1 binary bits, e.g., a 39 a 38 ……a 1 a 0 The bit sequence is converted into decimal number, and the decimal conversion method comprises the following steps: a is 39 *2 39 +a 38 *2 38 +……+a 1 *2 1 +a 0 *2 0 . The length of the additionally added bit sequence is greater than or equal to 0, and each element takes on the value of 0, 1.
Taking the 2 x 2 integer set as an example, the transmitter generates an index value of an integer sequence in which the values of the elements are all from a 4-element integer set {0,1,2,3}, and the length of the integer sequence is 4.
When the extra bit is b M ……b 0 And M is>0, in order to generate the above-mentioned integer sequence, first, a bit sequence (a) is required i ……a 0 +b m ……b 0 ) Performing cyclic shift 4 times, i is more than or equal to 0 and less than or equal to 39, M is more than or equal to 0 and less than or equal to M, and the step length of each cyclic shift can be 0 bit or positive integer, and then using the decimal conversion method to obtain decimal number A of the bit sequence after each cyclic shift 1 、A 2 、A 3 And A 4 . When the transmission fails, the values of the additionally added Y bits are randomly selected during each retransmission;
alternatively, the first and second electrodes may be,
when the extra bit is b M ……b 0 And M is>When 0, in order to generate the above-mentioned integer sequence, first, a bit sequence (a) is required i ……a 0 ) Performing 4 times of cyclic shift, i is more than or equal to 0 and less than or equal to 39, the step length of each cyclic shift can be 0 bit or positive integer, and then using the decimal conversion method to obtain the bit sequence after each cyclic shiftDecimal number of column B 1 、B 2 、B 3 And B 4 . A bit sequence (b) m ……b 0 ) Decimal conversion is carried out, M is more than or equal to 0 and less than or equal to M, and the operation result is compared with B 1 、B 2 、B 3 And B 4 Adding to obtain new 4 decimal numbers A 1 、A 2 、A 3 And A 4 . When the transmission fails, the values of the additionally added Y bits are randomly selected during each retransmission;
alternatively, the first and second electrodes may be,
when the extra bit is b M ……b 0 And M is>When 0, in order to generate the above-mentioned integer sequence, first, a bit sequence (a) is required i ……a 0 +b m ……b 0 ) In (b) m ……b 0 ) Randomizing 4 times, i is more than or equal to 0 and less than or equal to 39, M is more than or equal to 0 and less than or equal to M, and each time contains randomized bit sequence (a) i ……a 0 +b m ……b 0 ) Conversion of sequences into decimal numbers A 1 、A 2 、A 3 And A 4 . When the transmission fails, the values of the additionally added Y bits are randomized for 4 times in each retransmission;
or
When the extra bit is b M ……b 0 And M is>0, in order to generate the above-mentioned integer sequence, first, a bit sequence (b) whose initial value is randomly selected is required m ……b 0 ) Performing 4 times of cyclic shift, randomly taking 4 values each time, M is more than or equal to 0 and less than or equal to M, the step length of each cyclic shift can be 0 bit or positive integer, and then using the decimal conversion method to obtain decimal number A of the bit sequence after each cyclic shift 1 、A 2 、A 3 And A 4 . And when the transmission fails, the value of the additionally added Y bits is randomly selected during each retransmission.
Finally, according to the decimal number A 1 、A 2 、A 3 And A 4 And solving the value of each element in the integer sequence as follows: a. The 1 mod 4、A 2 mod 4、A 3 mod 4 and A 4 mod 4, where A p mod 4 represents a value modulo 4, p belonging to {1,2,3,4}, resulting in the sequence of integers { A } 1 mod 4、A 2 mod 4、A 3 mod 4、A 4 mod 4}。
In another embodiment, for example, a 3-by-3 integer set, the transmitter generates an index value for a sequence of integers whose elements are derived from a 9-ary integer set {0,1,2, \8230; \ 8,9}, and whose length is 4.
When the extra bit is b M ……b 0 And M is>0, in order to generate the above-mentioned integer sequence, first, a bit sequence (a) is required i ……a 0 +b m ……b 0 ) Performing 4 times of cyclic shift, i is more than or equal to 0 and less than or equal to 39, M is more than 0 and less than or equal to M, the step length of each cyclic shift can be 0 bit or positive integer, and then using the decimal conversion method to obtain decimal number A of the bit sequence after each cyclic shift 1 、A 2 、A 3 And A 4 . When the transmission fails, the values of the additionally added Y bits are randomly selected during each retransmission;
alternatively, the first and second electrodes may be,
when the extra bit is b M ……b 0 And M is>0, in order to generate the above-mentioned integer sequence, first, a bit sequence (a) is required i ……a 0 ) Performing 4 times of cyclic shift, i is more than or equal to 0 and less than or equal to 39, the step length of each cyclic shift can be 0 bit or positive integer, and then using the decimal conversion method to obtain the decimal number B of the bit sequence after each cyclic shift 1 、B 2 、B 3 And B 4 . A bit sequence (b) m ……b 0 ) Decimal conversion is carried out, M is more than or equal to 0 and less than or equal to M, and the operation result is compared with B 1 、B 2 、B 3 And B 4 Adding to obtain new 4 decimal numbers A 1 、A 2 、A 3 And A 4 . And when the transmission fails, the value of the extra Y bits is randomly selected during each retransmissionSelecting;
alternatively, the first and second electrodes may be,
when the extra bit is b M ……b 0 And M is>When 0, in order to generate the above-mentioned integer sequence, first, a bit sequence (a) is required i ……a 0 +b m ……b 0 ) In (b) m ……b 0 ) Randomizing 4 times, i is more than or equal to 0 and less than or equal to 39, M is more than or equal to 0 and less than or equal to M, and each time contains randomized bit sequence (a) i ……a 0 +b m ……b 0 ) Conversion of sequences into decimal numbers A 1 、A 2 、A 3 And A 4 . When the transmission fails, the values of the additionally added Y bits need to be randomized for 4 times in each retransmission;
or alternatively
When the extra bit is b M ……b 0 And M is>0, in order to generate the above-mentioned integer sequence, first, a bit sequence (b) whose initial value is randomly selected is required m ……b 0 ) Performing 4 times of cyclic shift, randomly taking 4 values each time, M is more than or equal to 0 and less than or equal to M, the step length of each cyclic shift can be 0 bit or positive integer, and then using the decimal conversion method to obtain decimal number A of the bit sequence after each cyclic shift 1 、A 2 、A 3 And A 4 . And when the transmission fails, the value of the additionally added Y bits is randomly selected during each retransmission.
Finally, according to the decimal number A 1 、A 2 、A 3 And A 4 And solving the value of each element in the integer sequence as follows: a. The 1 mod 9、A 2 mod 9、A 3 mod 9 and A 4 mod 9, where A p mod 9 represents the value modulo 9, p belonging to {1,2,3,4}.
In another embodiment, the transmitter generates an index value for a sequence of integers whose elements are derived from an 8-ary integer set {0,1,2, \ 8230 \ 8230;, 7,8}, and whose length is 4.
When the extra bit is b M ……b 0 And M is>When 0, in order to generate the above-mentioned integer sequence, first, a bit sequence (a) is required i ……a 0 +b m ……b 0 ) Performing cyclic shift 4 times, i is more than or equal to 0 and less than or equal to 39, M is more than or equal to 0 and less than or equal to M, and the step length of each cyclic shift can be 0 bit or positive integer, and then using the decimal conversion method to obtain decimal number A of the bit sequence after each cyclic shift 1 、A 2 、A 3 And A 4 . When the transmission fails, the values of the additionally added Y bits are randomly selected during each retransmission;
alternatively, the first and second liquid crystal display panels may be,
when the extra bit is b M ……b 0 And M is>0, in order to generate the above-mentioned integer sequence, first, a bit sequence (a) is required i ……a 0 ) Performing 4 times of cyclic shift, i is more than or equal to 0 and less than or equal to 39, and the step length of each cyclic shift can be 0 bit or positive integer, and then using the decimal conversion method to obtain the decimal number B of the bit sequence after each cyclic shift 1 、B 2 、B 3 And B 4 . A bit sequence (b) m ……b 0 ) Decimal conversion is carried out, M is more than or equal to 0 and less than or equal to M, and the operation result is compared with B 1 、B 2 、B 3 And B 4 Adding to obtain new 4 decimal numbers A 1 、A 2 、A 3 And A 4 . When the transmission fails, the values of the additionally added Y bits are randomly selected during each retransmission;
alternatively, the first and second liquid crystal display panels may be,
when the extra bit is b M ……b 0 And M is>0, in order to generate the above-mentioned integer sequence, first, a bit sequence (a) is required i ……a 0 +b m ……b 0 ) In (b) m ……b 0 ) Randomizing 4 times, i is more than or equal to 0 and less than or equal to 39, M is more than or equal to 0 and less than or equal to M, and each time contains randomized bit sequence (a) i ……a 0 +b m ……b 0 ) Conversion of sequences into decimal numbers A 1 、A 2 、A 3 And A 4 . And when it is used asWhen the secondary transmission fails, the values of the additionally added Y bits are randomized for 4 times in each retransmission;
or
When the extra bit is b M ……b 0 And M is>0, in order to generate the above-mentioned integer sequence, first, a bit sequence (b) whose initial value is randomly selected is required m ……b 0 ) Performing 4 times of cyclic shift, randomly taking 4 values each time, M is more than or equal to 0 and less than or equal to M, the step length of each cyclic shift can be 0 bit or positive integer, and then using the decimal conversion method to obtain decimal number A of the bit sequence after each cyclic shift 1 、A 2 、A 3 And A 4 . And when the transmission fails, the value of the additionally added Y bits is randomly selected during each retransmission.
Finally, according to the decimal number A 1 、A 2 、A 3 And A 4 And solving the value of each element in the integer sequence as follows: a. The 1 mod 8、A 2 mod 8、A 3 mod 8 and A 4 mod 8, where A p mod 8 represents the value modulo 8, p belonging to {1,2,3,4}.
(2) And constructing a constellation diagram which is associated with the index value and contains 4 complex constellation points. The values of the real part and the imaginary part of each constellation point in the complex constellation diagram are from a 2-element real number set, and the 2-element real number set is represented as [ -1, +1].
Therefore, the complex numbers corresponding to the 4 complex constellation points are-1 + j, -1-j, and 1-j, respectively.
In another embodiment, a constellation diagram is constructed that contains 9 complex constellation points associated with the index value. The values of the real part and the imaginary part of each constellation point in the complex constellation diagram are from a 3-element real number set, and the 3-element real number set is represented as [ -1,0, +1].
Therefore, the plural numbers corresponding to the 9 plural constellation points are-1 + j, -1-j, -1, +1, and 0, respectively.
In another embodiment, a constellation diagram comprising 8 complex constellation points associated with the index value is constructed. The complex number corresponding to each constellation point in the complex constellation diagram is-1 + j, -1-j, -1 and +1 respectively, that is, no 0 point is contained.
In another embodiment, a constellation diagram comprising 8 complex constellation points associated with the index value is constructed. The complex number corresponding to each constellation point in the complex constellation diagram is (-1 + j)/sqrt (2), (-1-j)/sqrt (2), (1-j)/sqrt (2), -j, -1 and +1, respectively, that is, no 0 point is contained.
(3) According to 4 elements in the pseudorandom integer sequence, selecting corresponding 4 complex constellation points from a 4-point complex constellation diagram according to a preset mapping rule;
mapping the index value of the integer sequence in (1) to the complex constellation points of the 4-point complex constellation (each complex constellation point represents a complex number) bit by bit according to the mapping relationship between the elements in the 4-element integer set and the complex constellation points of the 4-point complex constellation (as shown in fig. 16) to generate a complex spreading sequence, which is formulated as follows:
A p —>ComplexSeq p
wherein, complexSeq p Representing the p-th element of the complex spreading sequence, and according to the mapping relation between the elements in the 4-element integer set and the complex constellation points of the 4-point complex constellation diagram, the p-th element is represented by A p Mapping to obtain p Representing the p-th element of the pseudorandom integer sequence.
And determining 4 complex numbers corresponding to the 4 complex constellation points according to the integer sequence index value, and sequentially combining the 4 complex numbers to obtain the complex spreading sequence, or sequentially combining the 4 complex numbers multiplied by the corresponding energy normalization coefficient to obtain the complex spreading sequence.
In another embodiment, the complex spreading sequence is generated by mapping the index values of the integer sequence in (1) to the complex constellation points of the 9-point complex constellation (each complex constellation point represents a complex number) 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), and is formulated as follows:
A p —>ComplexSeq p
wherein, complexSeq p Representing the p-th element of the complex spreading sequence, according to the mapping relation between the elements in the 9-element integer set and the complex constellation points of the 9-point complex constellation diagram, A p Mapping to obtain p Representing the p-th element of the pseudorandom integer sequence.
And determining 4 complex numbers corresponding to the 9 complex constellation points according to the integer sequence index value, and sequentially combining the 4 complex numbers to obtain the complex spreading sequence, or sequentially combining the 4 complex numbers multiplied by corresponding energy normalization coefficients to obtain the complex spreading sequence.
In another embodiment, the complex spreading sequence is generated by mapping the index values of the sequence of integers in (1) to the complex constellation points of the 8-point complex constellation (each complex constellation point represents a complex number) 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), and is formulated as follows:
A p —>ComplexSeq p
Wherein, complexSeq p Representing the p-th element of the complex spreading sequence, and according to the mapping relation between the elements in the 8-element integer set and the complex constellation points of the 8-point complex constellation diagram, the p-th element is represented by A p Mapping to obtain p Representing the p-th element of the pseudorandom integer sequence.
And determining 4 complex numbers corresponding to the 8 complex constellation points according to the integer sequence index value, and sequentially combining the 4 complex numbers to obtain the complex spreading sequence, or sequentially combining the 4 complex numbers multiplied by corresponding energy normalization coefficients to obtain the complex spreading sequence.
In another embodiment, the complex spreading sequence is generated by mapping the index values of the sequence of integers in (1) to the complex constellation points of the 8-point complex constellation (each complex constellation point represents a complex number) 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), and is formulated as follows:
A p —>ComplexSeq p
wherein, complexSeq i Representing the p-th element of the complex spreading sequence, and according to the mapping relation between the elements in the 8-element integer set and the complex constellation points of the 8-point complex constellation diagram, the p-th element is represented by A p Mapping to obtain p Representing the p-th element of the pseudorandom integer sequence.
And determining 4 complex numbers corresponding to the 8 complex constellation points according to the integer sequence index value, and sequentially combining the 4 complex numbers to obtain the complex spreading sequence, or sequentially combining the 4 complex numbers multiplied by corresponding energy normalization coefficients to obtain the complex spreading sequence.
(II) another method for generating a complex field binary spreading sequence C1, and the method can be divided into the following three parts:
(1) Here the UE _ ID is a 40-long sequence of 0,1 binary bits, e.g., a 39 a 38 ……a 1 a 0 Converting the bit sequence into decimal number, the decimal conversion method is as follows: a is 39 *2 39 +a 38 *2 38 +……+a 1 *2 1 +a 0 *2 0 And (d) = a. The length of the additional bit sequence is greater than or equal to 0, each element is equal to {0,1}, and the additional bit is b M ……b 0 And M is>0。
Taking a 2-element real number set as an example, determining to generate a 4-long non-orthogonal spreading sequence, wherein each element of the non-orthogonal spreading sequence is a complex number, and values of real parts and imaginary parts of all elements in the spreading sequence are from a 2-element real number set, the 2-element real number set is a set consisting of odd numbers in a range of { -1, +1}, so that 4 elements are totally generated in the 4-long non-orthogonal sequence set 4 A non-orthogonal sequence of stripes.
For this purpose, an integer index value is generated, from which a non-orthogonal sequence in the set of non-orthogonal sequences can be uniquely assigned and which is derived from one (2 x 2) 4 A set of primitive integers, the set of 256 primitive integers being [0, 256-1 ]]Or [1, 256 ]]A set of all integers within the range;
when the extra bit is b M ……b 0 And M is>When 0, in order to generate an index value of an integer to specify one of the 4 long non-orthogonal sequence sets, first, a bit sequence (a) needs to be set i ……a 0 +b m ……b 0 ) Converting into a decimal number, i is more than or equal to 0 and less than or equal to 39, M is more than or equal to 0 and less than or equal to M; then, the decimal number is modulo-operated to 256, and the obtained modulo value is the index value. And when the transmission fails, the values of the additionally added Y bits need to be randomly taken during each retransmission.
Alternatively, the first and second electrodes may be,
when the extra bit sequence is b M ……b 0 And M is>When 0, in order to generate an index value of an integer to specify one of the 4 long non-orthogonal sequence sets, first, a bit sequence (b) is required m ……b 0 ) Converting into a decimal number, wherein M is more than or equal to 0 and less than or equal to M; then, the decimal number is modulo-operated to 256, and the obtained modulo value is the index value. And when the transmission fails, the values of the additionally added Y bits need to be randomly taken during each retransmission.
In another embodiment, taking a 3-element real number set as an example, it is determined that a 4-long non-orthogonal spreading sequence is to be generated, each element of the non-orthogonal spreading sequence is a complex number, and values of real parts and imaginary parts of all elements in the spreading sequence are derived from a 3-element real number set, where the 3-element real number set is a set consisting of odd numbers in a range of [ -1,0, +1 ].
According to the bit sequence (a) i ……a 0 +b m ……b 0 ) Generating an index value of an integer, 0 ≦ i ≦ 39,0 ≦ M ≦ M, the index value from one (3 x 3) 4 A set of prime integers, the set of 6561 prime integers being [0, 6561-1]Or [1, 6561 ]]A set of all integers within the range;
to generate the index value of the integer, first, (a) needs to be set i ……a 0 +b m ……b 0 ) I is more than or equal to 0 and less than or equal to 39, M is more than or equal to 0 and less than or equal to M; then, the decimal number is modulo-operated on 6561, and the obtained modulo value is the index value. And when the transmission fails, additionallyThe value of the increased Y bits is randomly selected at each retransmission.
Alternatively, the first and second electrodes may be,
when the extra added bit sequence is b M ……b 0 And (b) are M ……b 0 ) When the decimal value is larger than 6561, in order to generate an index value of an integer to specify one of the 4 long non-orthogonal sequence sets, it is first necessary to put the bit sequence (b) m ……b 0 ) Converting into a decimal number, wherein M is more than or equal to 0 and less than or equal to M; then, the decimal number is modulo-operated on 6561, and the obtained modulo value is the index value. And when the transmission fails, the values of the additionally added Y bits need to be randomly taken during each retransmission.
In another embodiment, a 3-ary real number set is taken as an example, it is determined that a 4-long non-orthogonal spreading sequence is to be generated, each element of the non-orthogonal spreading sequence is a complex number, and values of real parts and imaginary parts of all elements in the spreading sequence are derived from a 3-ary real number set, the 3-ary real number set is a set consisting of odd numbers in the range of [ -1,0, +1], but it is required that real parts and imaginary parts of all elements in the spreading sequence cannot be 0 at the same time.
According to (a) i ……a 0 +b m ……b 0 ) Generating an index value of an integer, 0 ≦ i ≦ 39,0 ≦ M ≦ M from 8 4 A set of prime integers, said set of 4096 prime integers being [0, 4096-1]Or [1, 4096]A set of all integers within the range;
to generate the index value of the integer, first, (a) needs to be added i ……a 0 +b m ……b 0 ) I is more than or equal to 0 and less than or equal to 39, M is more than or equal to 0 and less than or equal to M; then, the decimal number is subjected to a modular operation on 4096, and the obtained modular value is an index value. And when the transmission fails, the values of the additionally added Y bits need to be randomly taken during each retransmission.
Alternatively, the first and second electrodes may be,
when the extra added bit sequence is b M ……b 0 And (b) are M ……b 0 ) Decimal value is largeIn 4096, to generate an index value of an integer to specify one of a set of 4-long non-orthogonal sequences, a bit sequence (b) is first required m ……b 0 ) Converting into a decimal number, wherein M is more than or equal to 0 and less than or equal to M; then, the decimal number is subjected to a modular operation on 4096, and the obtained modular value is an index value. And when the transmission fails, the values of the additionally added Y bits need to be randomly taken during each retransmission.
(2) Constructing a set (table) of 4 long complex field non-orthogonal sequences;
taking a 2-element real number set as an example, determining to generate a 4-long non-orthogonal spreading sequence, wherein each element of the non-orthogonal spreading sequence is a complex number, and values of real parts and imaginary parts of all elements in the spreading sequence are from a 2-element real number set, and the 2-element real number set is a set consisting of odd numbers in a range of { -1, +1 }.
And combining the obtained 4 complex numbers in sequence to obtain the complex spreading sequence, or multiplying the 4 complex numbers by corresponding energy normalization coefficients and then combining in sequence to obtain the complex spreading sequence.
Then the set of non-orthogonal sequences generated at this time has (2 x 2) 4 A sequence of bars.
In another embodiment, a 3-element real number set is taken as an example, it is determined that a 4-long non-orthogonal spreading sequence is to be generated, each element of the non-orthogonal spreading sequence is a complex number, and values of real parts and imaginary parts of all elements in the spreading sequence are derived from a 3-element real number set, and the 3-element real number set is a set composed of odd numbers in the range of { -1,0, +1 }.
And combining the obtained 4 complex numbers in sequence to obtain the complex spreading sequence, or multiplying the 4 complex numbers by corresponding energy normalization coefficients and then combining in sequence to obtain the complex spreading sequence.
Then the set of non-orthogonal sequences generated at this time has (3 x 3) 4 A sequence of bars.
In another embodiment, for example, a 3-element real number set is taken as an example, it is determined that a 4-long non-orthogonal spreading sequence is to be generated, each element of the non-orthogonal spreading sequence is a complex number, and values of real parts and imaginary parts of all elements in the spreading sequence are derived from a 3-element real number set, where the 3-element real number set is a set consisting of odd numbers in a range of { -1,0, +1 }.
And combining the obtained 4 complex numbers in sequence to obtain the complex spreading sequence, or multiplying the 4 complex numbers by corresponding energy normalization coefficients and then combining in sequence to obtain the complex spreading sequence.
However, it is required that the real part and the imaginary part of all elements in the spreading sequence cannot be 0 at the same time, so that the set of non-orthogonal sequences generated at this time has (3 x 3-1) 4 A sequence of bars.
(3) According to the index value in (1) and according to a preset mapping rule, including (2 x 2) from (2) 4 Selecting one from a set (table) of 4 long non-orthogonal sequences; alternatively, the first and second electrodes may be,
according to the index value in (1) and preset mapping rule, including (3 x 3) from (2) 4 Selecting one from a set (table) of 4 long non-orthogonal sequences of strips; or
According to the index value in (1) and preset mapping rule, including (3 x 3-1) from (2) 4 One of a set (table) of 4 long non-orthogonal sequences of bars is selected.
(III) A method for generating 8 long (or 4 long) non-orthogonal spreading sequences C2, which can be divided into the following three parts:
(1) The UE _ ID is here a 40-long binary bit sequence of 0, 1, e.g. a 39 a 38 ……a 1 a 0 The bit sequence is converted into decimal number, and the decimal conversion method comprises the following steps: a is 39 *2 39 +a 38 *2 38 +……+a 1 *2 1 +a 0 *2 0 And (d) = A. The length of the additional bit sequence is greater than or equal to 0, each element takes on the value of 0,1, and the additional bit is b M ……b 0 And M is>0。
Determining to generate a non-orthogonal spreading sequence set with a sequence length of 8 (or 4), wherein each element of each non-orthogonal sequence in the sequence set is derived from { -1, +1}, and the total number of the non-orthogonal sequences in the non-orthogonal sequence set is 16 (or 8).
Generating an index value of an integer according to which the index value of the integer uniquely specifies one of the non-orthogonal sequence sets and the index value is from a 16-ary (or 8-ary) integer set, wherein the 16-ary (or 8-ary) integer set is a set consisting of all integers in a range of [0, 16-1] or [1, 16] (or [0,8-1] or [1,8 ]);
when the extra bit is b M ……b 0 And M is>When 0, in order to generate the above-mentioned integer sequence, first, b m ……b 0 After random value taking, the bit sequence (a) is added i ……a 0 +b m ……b 0 ) Converting the decimal number into a decimal number, i is more than or equal to 0 and less than or equal to 39, M is more than or equal to 0 and less than or equal to M, then performing modulus operation on the obtained decimal number to 16 to obtain a value which is an integer index value. When the transmission fails, the additionally added values of Y bits need to be randomized in each retransmission;
Or
When the extra bit is b M ……b 0 And M is>At 0, in order to generate the above integer sequence, at b m ……b 0 After random value taking, a bit sequence (b) randomly selected from the initial value is needed m ……b 0 ) Converting the decimal number into a decimal number, wherein M is more than or equal to 0 and less than or equal to M, and then performing modulus operation on the obtained decimal number to 16 (or 8) to obtain a value which is an integer index value. And when the transmission fails, the additionally increased values of Y bits are randomized in each retransmission.
(2) Constructing a set (table) containing 16 non-orthogonal spreading sequences with 8 lengths (or 8 non-orthogonal spreading sequences with 4 lengths);
for example, one method of generating 16 8 long (or 8 4 long) non-sequences is given:
a matrix of 8 long 8 columns consisting of 8 long positive valency sequence sets was first obtained:
Figure GDA0003742351690001161
then orthogonal H 8 The matrix points multiply an 8-long column matrix, and the value of each element in the 8-long column matrix is taken from { +1, -1}, for example, where an 8-long column matrix is:
Figure GDA0003742351690001162
namely, and: h 16 ＝[H 8 H 8 ·A 0 ]
Wherein, is formed by H 16 The set of each column in (a) is a set of 1 8 long non-orthogonal sequences.
Alternatively, the first and second electrodes may be,
a 4-long 4-column matrix consisting of a 4-long positive sequence set is first obtained:
Figure GDA0003742351690001163
then orthogonal H 4 The matrix points multiply a 4-long column matrix, and the value of each element in the 4-long column matrix is taken from { +1, -1}, for example, where a 4-long column matrix is:
Figure GDA0003742351690001164
Namely, and: h 8 ＝[H 4 H 4 ·A 1 ]
Wherein, is prepared from H 8 The set of each column in (a) is a set of 1 4 long non-orthogonal sequences.
(3) And (2) selecting one from a set (table) containing 16 non-orthogonal spreading sequences with the length of 8 (or 8 non-orthogonal spreading sequences with the length of 4) according to the index value in the step (1) and a preset mapping rule.
(IV) another method for generating 8 long (or 4 long) non-orthogonal spreading sequences C2, which can be divided into the following two parts:
(1) Constructing a set (table) containing 16 non-orthogonal spreading sequences with length of 8 (or 8 non-orthogonal spreading sequences with length of 4);
for example, one method of generating 16 8 long (8 4 long) non-sequences is given:
a matrix of 8 long 8 columns consisting of a set of 8 long positive sequences is first obtained:
Figure GDA0003742351690001171
then orthogonal H 8 The matrix points multiply an 8-long column matrix, and the value of each element in the 8-long column matrix is taken from { +1, -1}, for example, where an 8-long column matrix is:
Figure GDA0003742351690001172
namely, and: h 16 ＝[H 8 H 8 ·A 0 ]
Wherein, is prepared from H 16 The set of each column in (a) is a set of 1 8 long non-orthogonal sequences.
Alternatively, the first and second electrodes may be,
a 4-long 4-column matrix consisting of a 4-long positive sequence set is first obtained:
Figure GDA0003742351690001173
then orthogonal H 4 The matrix points multiply a 4-long column matrix, and the value of each element in the 4-long column matrix is taken from { +1, -1}, for example, where a 4-long column matrix is:
Figure GDA0003742351690001181
Namely, then: h 8 ＝[H 4 H 4 ·A 1 ]
Wherein, is prepared from H 8 The set of each column in (a) is a set of 1 4 long non-orthogonal sequences.
(2) One of the 16 non-orthogonal spreading sequences (8 non-orthogonal spreading sequences) with a length of 8 (8 non-orthogonal spreading sequences with a length of 4) is randomly selected from the set (table) in (1).
The third scheme is as follows: and determining a 4-long complex spreading sequence or an 8-long (or 4-long) non-orthogonal spreading sequence according to the additionally added bit sequence (the length of the bit sequence can be greater than or equal to 0) and the bit sequence of the terminal identity information (the length of the bit sequence can be greater than or equal to 0). The value of the additionally added bit sequence designates the starting position of the cyclic shift, and the value of the additionally added bit sequence can be randomly selected or sequentially increased during each retransmission:
with reference to the application scenario given in this embodiment, a generation process of the non-orthogonal spreading sequence C1 and the orthogonal spreading sequence C2 is described in more detail:
a method for generating a complex field binary spreading sequence C1, which can be divided into the following three parts:
(1) Here the UE _ ID is a 40-long sequence of 0,1 binary bits, e.g., a 39 a 38 ……a 1 a 0 The bit sequence is converted into decimal number, and the decimal conversion method comprises the following steps: a is 39 *2 39 +a 38 *2 38 +……+a 1 *2 1 +a 0 *2 0 . The length of the additionally added bit sequence is greater than or equal to 0, and each element takes on the value of 0, 1.
Taking the 2 x 2 integer set as an example, the transmitter generates an index value of an integer sequence in which the values of the elements are all from a 4-element integer set {0,1,2,3}, and the length of the integer sequence is 4.
When the extra bit is b M ……b 0 And M is>When 0, in order to generate the above-mentioned integer sequence, first, a bit sequence (a) is required i ……a 0 +b m ……b 0 ) Performing cyclic shift 4 times, i is more than or equal to 0 and less than or equal to 39, M is more than or equal to 0 and less than or equal to M, and the step length of each cyclic shift can be 0 bit or positive integer, and then using the decimal conversion method to obtain decimal number A of the bit sequence after each cyclic shift 1 、A 2 、A 3 And A 4 . The value of the additionally added bit sequence designates the initial position of the cyclic shift, and when the transmission fails, the values of the additionally added Y bits can be randomly selected during each retransmission or can be sequentially increased; if the values of the additionally added bits are sequentially increased during each retransmission, the values of the additionally added bits need to be cleared after the transmission is successful.
Finally, according to the decimal number A 1 、A 2 、A 3 And A 4 And solving the value of each element in the integer sequence as follows: a. The 1 mod 4、A 2 mod 4、A 3 mod 4 and A 4 mod 4, where A p mod 4 represents a value modulo 4, p belonging to {1,2,3,4}, resulting in the sequence of integers { A } 1 mod 4、A 2 mod 4、A 3 mod 4、A 4 mod 4}。
In another embodiment, for example, a 3-by-3 integer set, the transmitter generates an index value for a sequence of integers whose elements are derived from a 9-ary integer set {0,1,2, \8230; \ 8,9}, and whose length is 4.
When the extra bit is b M ……b 0 And M is>When 0, in order to generate the above-mentioned integer sequence, first, a bit sequence (a) is required i ……a 0 +b m ……b 0 ) Performing cyclic shift 4 times, i is more than or equal to 0 and less than or equal to 39, M is more than or equal to 0 and less than or equal to M, and the step length of each cyclic shift can be 0 bit or positive integer, and then using the decimal conversion method to obtain decimal number A of the bit sequence after each cyclic shift 1 、A 2 、A 3 And A 4 . The value of the additionally added bit sequence designates the initial position of the cyclic shift, and when the transmission fails, the values of the additionally added Y bits can be randomly selected during each retransmission or can be sequentially added; if the values of the additionally added bits are sequentially increased during each retransmission, the values of the additionally added bits need to be cleared after the transmission is successful.
Finally, according to the decimal number A 1 、A 2 、A 3 And A 4 And solving the value of each element in the integer sequence as follows: a. The 1 mod 9、A 2 mod 9、A 3 mod 9 and A 4 mod 9, where A p mod 9 represents the value modulo 9, p belonging to {1,2,4}.
In another embodiment, the transmitter generates an index value for a sequence of integers whose elements are derived from an 8-ary integer set {0,1,2, \ 8230 \ 8230;, 7,8}, and whose length is 4.
When the extra bit is b M ……b 0 And M is>When 0, in order to generate the above-mentioned integer sequence, first, a bit sequence (a) is required i ……a 0 +b m ……b 0 ) Performing cyclic shift 4 times, i is more than or equal to 0 and less than or equal to 39, M is more than or equal to 0 and less than or equal to M, and the step length of each cyclic shift can be 0 bit or positive integer, and then using the decimal conversion method to obtain decimal number A of the bit sequence after each cyclic shift 1 、A 2 、A 3 And A 4 . The value of the additionally added bit sequence designates the initial position of the cyclic shift, and when the transmission fails, the values of the additionally added Y bits can be randomly selected during each retransmission or can be sequentially added; if the values of the additionally added bits are sequentially increased during each retransmission, the values of the additionally added bits need to be cleared after the transmission is successful.
Finally, according to the decimal number A 1 、A 2 、A 3 And A 4 And solving the value of each element in the integer sequence as follows: a. The 1 mod 8、A 2 mod 8、A 3 mod 8 and A 4 mod 8, where A p mod 8 represents the value modulo 8, p belonging to {1,2,3,4}.
(2) And constructing a constellation diagram which is associated with the index value and contains 4 complex constellation points. The values of the real part and the imaginary part of each constellation point in the complex constellation diagram are from a 2-element real number set, and the 2-element real number set is represented as [ -1, +1].
Therefore, the plural numbers corresponding to the 4 plural constellation points are-1 + j, -1-j, and 1-j, respectively.
In another embodiment, a constellation diagram is constructed that contains 9 complex constellation points associated with the index value. The values of the real part and the imaginary part of each constellation point in the complex constellation diagram are from a 3-element real number set, and the 3-element real number set is represented as [ -1,0, +1].
Therefore, the plural numbers corresponding to the 9 plural constellation points are-1 + j, -1-j, -1, +1, and 0, respectively.
In another embodiment, a constellation diagram comprising 8 complex constellation points associated with the index value is constructed. The complex number corresponding to each constellation point in the complex constellation diagram is-1 + j, -1-j, -1, +1, respectively, that is, no 0 point is contained.
In another embodiment, a constellation diagram is constructed that contains 8 complex constellation points associated with the index value. The complex number corresponding to each constellation point in the complex constellation diagram is (-1 + j)/sqrt (2), (-1-j)/sqrt (2), (1-j)/sqrt (2), -j, -1 and +1, respectively, that is, no 0 point is contained.
(3) Selecting corresponding 4 complex constellation points from a 4-point complex constellation diagram according to a preset mapping rule according to 4 elements in the pseudorandom integer sequence;
the complex spreading sequence is generated by mapping the index value of the integer sequence in (1) to the complex constellation points of the 4-point complex constellation (each complex constellation point represents a complex number) bit by bit according to the mapping relationship between the elements in the 4-element integer set and the complex constellation points of the 4-point complex constellation (as shown in fig. 16), and is expressed by the following formula:
A p —>ComplexSeq p
wherein, complexSeq p Representing the p-th element of the complex spreading sequence, and according to the mapping relation between the elements in the 4-element integer set and the complex constellation points of the 4-point complex constellation diagram, the p-th element is represented by A p Mapping to obtain p Representing the p-th element of the pseudorandom integer sequence.
And determining 4 complex numbers corresponding to the 4 complex constellation points according to the integer sequence index value, and sequentially combining the 4 complex numbers to obtain the complex spreading sequence, or sequentially combining the 4 complex numbers multiplied by corresponding energy normalization coefficients to obtain the complex spreading sequence.
In another embodiment, the complex spreading sequence is generated by mapping the index values of the integer sequence in (1) to the complex constellation points of the 9-point complex constellation (each complex constellation point represents a complex number) 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), and is formulated as follows:
A p —>ComplexSeq p
Wherein, complexSeq p Representing the p-th element of the complex spreading sequence, and according to the mapping relation between the elements in the 9-element integer set and the complex constellation points of the 9-point complex constellation diagram, the p-th element is represented by A p Mapping to obtain p Representing the p-th element of the pseudorandom integer sequence.
And determining 4 complex numbers corresponding to the 9 complex constellation points according to the integer sequence index value, and sequentially combining the 4 complex numbers to obtain the complex spreading sequence, or sequentially combining the 4 complex numbers multiplied by corresponding energy normalization coefficients to obtain the complex spreading sequence.
In another embodiment, the complex spreading sequence is generated by mapping the index values of the sequence of integers in (1) to the complex constellation points of the 8-point complex constellation (each complex constellation point represents a complex number) 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), and is formulated as follows:
A p —>ComplexSeq p
wherein, complexSeq p Representing the p-th element of the complex spreading sequence, and according to the mapping relation between the elements in the 8-element integer set and the complex constellation points of the 8-point complex constellation diagram, the p-th element is represented by A p Mapping to obtain, A p Representing the p-th element of the pseudorandom integer sequence.
And determining 4 complex numbers corresponding to the 8 complex constellation points according to the integer sequence index value, and sequentially combining the 4 complex numbers to obtain the complex spreading sequence, or sequentially combining the 4 complex numbers multiplied by corresponding energy normalization coefficients to obtain the complex spreading sequence.
In another embodiment, the complex spreading sequence is generated by mapping the index values of the sequence of integers in (1) to the complex constellation points of the 8-point complex constellation (each complex constellation point represents a complex number) 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), and is formulated as follows:
A p —>ComplexSeq p
wherein, complexSeq p Representing the p-th element of the complex spreading sequence, and according to the mapping relation between the elements in the 8-element integer set and the complex constellation points of the 8-point complex constellation diagram, the p-th element is represented by A p Mapping to obtain p Representing the p-th element of the pseudorandom integer sequence.
And determining 4 complex numbers corresponding to the 8 complex constellation points according to the integer sequence index value, and sequentially combining the 4 complex numbers to obtain the complex spreading sequence, or sequentially combining the 4 complex numbers multiplied by the corresponding energy normalization coefficient to obtain the complex spreading sequence.
(II) another method for generating a complex field binary spreading sequence C1, and the method can be divided into the following three parts:
(1) Here the UE _ ID is a 40-long sequence of 0,1 binary bits, e.g., a 39 a 38 ……a 1 a 0 The bit sequence is converted into decimal number, and the decimal conversion method comprises the following steps: a is 39 *2 39 +a 38 *2 38 +……+a 1 *2 1 +a 0 *2 0 And (d) = a. The length of the additional bit sequence is greater than or equal to 0, each element takes on the value of 0,1, and the additional bit is b M ……b 0 And M is>0。
For example, a 2-element real number set is used to determine that a 4-long non-orthogonal spreading sequence is to be generated, and each element of the non-orthogonal spreading sequence is oneA plurality of complex numbers, and the values of the real part and the imaginary part of all the elements in the spreading sequence are from a 2-element real number set, the 2-element real number set is a set formed by odd numbers in the range of { -1, +1}, and the total number of the 4 elements in the 4-long non-orthogonal sequence set is 4 4 The stripes are non-orthogonal sequences.
For this purpose, an integer index value is generated, according to which a non-orthogonal sequence in the set of non-orthogonal sequences can be uniquely assigned, and the index value is derived from one (2 x 2) 4 A set of primitive integers, the set of 256 primitive integers being [0, 256-1 ]]Or [1, 256 ]]A set of all integers within the range;
When the extra bit is b M ……b 0 And M is>When 0, to generate an index value of an integer to specify one of the 4-long non-orthogonal sequence sets, first, a bit sequence (a) needs to be assigned i ……a 0 +b m ……b 0 ) Converting into a decimal number, i is more than or equal to 0 and less than or equal to 39, M is more than or equal to 0 and less than or equal to M; then, the decimal number is modulo-operated to 256, and the obtained modulo value is the index value. And when the transmission fails, the values of the additionally added Y bits need to be randomly taken during each retransmission.
Alternatively, the first and second electrodes may be,
when the extra added bit sequence is b M ……b 0 And M is>When 0, in order to generate an index value of an integer to specify one of the 4 long non-orthogonal sequence sets, first, a bit sequence (b) is required m ……b 0 ) Converting into a decimal number, wherein M is more than or equal to 0 and less than or equal to M; then, the decimal number pair 256 is subjected to modulo operation, and the obtained modulo value is the index value. And when the transmission fails, the values of the additionally added Y bits need to be randomly taken during each retransmission.
In another embodiment, a 3-ary real number set is taken as an example, it is determined that a 4-long non-orthogonal spreading sequence is to be generated, each element of the non-orthogonal spreading sequence is a complex number, and values of real parts and imaginary parts of all elements in the spreading sequence are derived from a 3-ary real number set, and the 3-ary real number set is a set composed of odd numbers in the range of { -1,0, +1 }.
According to the bit sequence (a) i ……a 0 +b m ……b 0 ) Generating an index value of an integer, 0 ≦ i ≦ 39,0 ≦ M ≦ M, the index value from one (3 x 3) 4 A set of prime integers, the set of 6561 prime integers being [0, 6561-1]Or [1, 6561]A set of all integers within the range;
to generate the index value of the integer, first, (a) needs to be added i ……a 0 +b m ……b 0 ) I is more than or equal to 0 and less than or equal to 39, M is more than or equal to 0 and less than or equal to M; then, the decimal number is modulo-operated on 6561, and the obtained modulo value is the index value. And when the transmission fails, the values of the additionally added Y bits need to be randomly taken during each retransmission.
Alternatively, the first and second liquid crystal display panels may be,
when the extra bit sequence is b M ……b 0 And (b) are M ……b 0 ) When the decimal value is greater than 6561, in order to generate an index value of an integer to specify one of a 4-long non-orthogonal sequence set, first, a bit sequence (b) is required m ……b 0 ) Converting into a decimal number, wherein M is more than or equal to 0 and less than or equal to M; then, the decimal number is modulo-operated on 6561, and the obtained modulo value is the index value. And when the transmission fails, the values of the additionally added Y bits need to be randomly taken during each retransmission.
In another embodiment, a 3-ary real number set is taken as an example, it is determined that a 4-long non-orthogonal spreading sequence is to be generated, each element of the non-orthogonal spreading sequence is a complex number, and values of real parts and imaginary parts of all elements in the spreading sequence are derived from a 3-ary real number set, the 3-ary real number set is a set consisting of odd numbers in the range of [ -1,0, +1], but it is required that real parts and imaginary parts of all elements in the spreading sequence cannot be 0 at the same time.
According to (a) i ……a 0 +b m ……b 0 ) Generating an index value of an integer, 0 ≦ i ≦ 39,0 ≦ M ≦ M from 8 4 A set of prime integers, said set of 4096 prime integers being [0, 4096-1]Or [1,4 ]096]A set of all integers within the range;
to generate the index value of the integer, first, (a) needs to be added i ……a 0 +b m ……b 0 ) I is more than or equal to 0 and less than or equal to 39, M is more than or equal to 0 and less than or equal to M; then, the decimal number is subjected to a modular operation on 4096, and the obtained modular value is an index value. And when the transmission fails, the values of the additionally added Y bits need to be randomly taken during each retransmission.
Alternatively, the first and second electrodes may be,
when the extra bit sequence is b M ……b 0 And (b) is M ……b 0 ) When the decimal value is larger than 4096, in order to generate an index value of an integer to specify one of a set of 4-long non-orthogonal sequences, first, a bit sequence (b) m ……b 0 ) Converting into a decimal number, wherein M is more than or equal to 0 and less than or equal to M; then, the decimal number is subjected to a modular operation on 4096, and the obtained modular value is an index value. And when the transmission fails, the values of the additionally added Y bits need to be randomly taken during each retransmission.
(2) Constructing a set (table) of 4 long complex field non-orthogonal sequences;
taking a 2-element real number set as an example, determining that a 4-long non-orthogonal spreading sequence is to be generated, each element of the non-orthogonal spreading sequence is a complex number, and values of real parts and imaginary parts of all elements in the spreading sequence are from a 2-element real number set, wherein the 2-element real number set is a set composed of odd numbers in a range of { -1, +1 }.
And combining the obtained 4 complex numbers in sequence to obtain the complex spreading sequence, or multiplying the 4 complex numbers by corresponding energy normalization coefficients and then combining in sequence to obtain the complex spreading sequence.
Then the set of non-orthogonal sequences generated at this time has (2 x 2) 4 A sequence of bars.
In another embodiment, a 3-element real number set is taken as an example, it is determined that a 4-long non-orthogonal spreading sequence is to be generated, each element of the non-orthogonal spreading sequence is a complex number, and values of real parts and imaginary parts of all elements in the spreading sequence are derived from a 3-element real number set, and the 3-element real number set is a set composed of odd numbers in the range of { -1,0, +1 }.
And combining the obtained 4 complex numbers in sequence to obtain the complex spreading sequence, or multiplying the 4 complex numbers by corresponding energy normalization coefficients and then combining in sequence to obtain the complex spreading sequence.
Then the set of non-orthogonal sequences generated at this time has (3 x 3) 4 A sequence of bars.
In another embodiment, a 3-element real number set is taken as an example, it is determined that a 4-long non-orthogonal spreading sequence is to be generated, each element of the non-orthogonal spreading sequence is a complex number, and values of real parts and imaginary parts of all elements in the spreading sequence are derived from a 3-element real number set, and the 3-element real number set is a set composed of odd numbers in the range of { -1,0, +1 }.
And combining the obtained 4 complex numbers in sequence to obtain the complex spreading sequence, or multiplying the 4 complex numbers by corresponding energy normalization coefficients and then combining in sequence to obtain the complex spreading sequence.
However, it is required that the real part and imaginary part of all elements in the spreading sequence cannot be 0 at the same time, so that the set of non-orthogonal sequences generated at this time has (3 x 3-1) 4 A sequence of bars.
(3) According to the index value in (1) and according to a preset mapping rule, including (2 x 2) from (2) 4 Selecting one from a set (table) of 4 long non-orthogonal sequences; alternatively, the first and second liquid crystal display panels may be,
according to the index value in (1) and preset mapping rule, including (3 x 3) from (2) 4 Selecting one from a set (table) of 4 long non-orthogonal sequences of strips; or
And (3) selecting one from a set (table) of 4 long non-orthogonal sequences containing (3 × 3-1) 4 pieces in (2) according to the index value in (1) and a preset mapping rule.
(III) a method for generating 8 long (or 4 long) non-orthogonal spreading sequences C2, which can be divided into the following three parts:
(1) Here the UE _ ID is one 40Long sequences of binary bits of 0, 1, e.g. a 39 a 38 ……a 1 a 0 The bit sequence is converted into decimal number, and the decimal conversion method comprises the following steps: a is 39 *2 39 +a 38 *2 38 +……+a 1 *2 1 +a 0 *2 0 And (d) = a. The length of the additional bit sequence is greater than or equal to 0, each element takes on the value of 0,1, and the additional bit is b M ……b 0 And M is>0。
Determining to generate a non-orthogonal spreading sequence set with a sequence length of 8 (or 4), wherein each element of each non-orthogonal sequence in the sequence set is derived from { -1, +1}, and the orthogonal sequence set has 16 (or 8) orthogonal sequences in total.
Generating an index value of an integer according to which the index value of the integer uniquely specifies one of the orthogonal sequence sets and the index value is from a set of 16-ary (or 8-ary) integers, the set of 16-ary (or 8-ary) integers being a set of all integers in a range of [0, 16-1] or [1, 16] (or [0,8-1] or [1,8 ]);
when the extra bit is b M ……b 0 And M is>When 0, in order to generate the above-mentioned integer sequence, first, b m ……b 0 After random value taking, the bit sequence (a) needs to be added i ……a 0 +b m ……b 0 ) Converting the decimal number into a decimal number, M is more than or equal to 0 and less than or equal to M, i is more than or equal to 0 and less than or equal to 39, and then performing modulus operation on the obtained decimal number to obtain a value which is an integer index value. When the transmission fails, the values of the additionally added Y bits are randomized in each retransmission;
Or
When the extra bit is b M ……b 0 And M is>2, in order to generate the above integer sequence, at b m ……b 0 After random value taking, a bit sequence (b) randomly selected from the initial value is needed m ……b 0 ) Converting into a decimal number, M is more than or equal to 0 and less than or equal to M, then taking the modulus of the obtained decimal number to 16 (or 8), and obtaining the value by taking the modulusIs an integer index value. And when the transmission fails, the value of the additionally added Y bits is randomly selected during each retransmission.
(2) Constructing a set (table) containing 16 non-orthogonal spreading sequences with 8 lengths (or 8 non-orthogonal spreading sequences with 4 lengths);
for example, one method of generating 16 8 long (or 8 4 long) non-sequences is given:
a matrix of 8 long 8 columns consisting of a set of 8 long positive sequences is first obtained:
Figure GDA0003742351690001271
then orthogonal H 8 The matrix points multiply an 8-long column matrix, and the value of each element in the 8-long column matrix is taken from { +1, -1}, for example, where an 8-long column matrix is:
Figure GDA0003742351690001272
namely, and: h 16 ＝[H 8 H 8 ·A 0 ]
Wherein, is formed by H 16 The set of each column in (a) is a set of 1 8 long non-orthogonal sequences.
Alternatively, the first and second electrodes may be,
a 4-long 4-column matrix consisting of a 4-long positive sequence set is first obtained:
Figure GDA0003742351690001273
then orthogonal H 4 The matrix points multiply a 4-long column matrix, and the value of each element in the 4-long column matrix is taken from { +1, -1}, for example, where a 4-long column matrix is:
Figure GDA0003742351690001281
Namely, and: h 8 ＝[H 4 H 4 ·A 1 ]
Wherein, is prepared from H 8 The set of each column in (a) is a set of 1 4 long non-orthogonal sequences.
(3) And (2) selecting one from a set (table) containing 16 non-orthogonal spreading sequences with 8 lengths (or 8 non-orthogonal spreading sequences with 4 lengths) in (1) according to the index value and a preset mapping rule.
(IV) another method for generating 8 long (or 4 long) non-orthogonal spreading sequences C2, which can be divided into the following two parts:
(1) Constructing a set (table) containing 16 non-orthogonal spreading sequences with length of 8 (8 and 4);
for example, one method of generating 16 8 long (8 4 long) non-orthogonal sequences is given:
a matrix of 8 long 8 columns consisting of a set of 8 long positive sequences is first obtained:
Figure GDA0003742351690001282
then orthogonal H 8 The matrix points multiply an 8-long column matrix, and the value of each element in the 8-long column matrix is taken from { +1, -1}, for example, where an 8-long column matrix is:
Figure GDA0003742351690001283
namely, then: h 16 ＝[H 8 H 8 ·A 0 ]
Wherein, is prepared from H 16 The set of each column in (a) is a set of 1 8 long non-orthogonal sequences.
Alternatively, the first and second electrodes may be,
a 4-long 4-column matrix consisting of a 4-long positive sequence set was first obtained:
Figure GDA0003742351690001291
then orthogonal H 4 The matrix points multiply a 4-long column matrix, and the value of each element in the 4-long column matrix is taken from { +1, -1}, for example, where a 4-long column matrix is:
Figure GDA0003742351690001292
Namely, then: h 8 ＝[H 4 H 4 ·A 1 ]
Wherein, is formed by H 8 The set of each column in (a) is a set of 1 4 long non-orthogonal sequences.
(2) One of the 16 non-orthogonal spreading sequences (8 non-orthogonal spreading sequences with a length of 8 (8 non-orthogonal spreading sequences with a length of 4) in the step (1) is randomly selected.
And step 120, performing spreading processing on the data symbols to be transmitted by using the obtained spreading sequences C1 and C2.
The method comprises the steps of forming N1 modulation symbols by coding and modulating a bit sequence at least containing own terminal identity identification information, adding N2 pilot symbols, forming N symbols in total, wherein N = N1+ N2, and changing the N symbols into L x N symbols by expansion.
According to different extension types, the following three cases can be divided:
the modulation symbol is firstly spread by 4 long non-orthogonal sequences, and the spread symbol is further spread by 8 long (or 4 long) non-orthogonal sequences. The modulated data symbol is S k First, S is k Using 4 long non-orthogonal spreading sequences C1= { C = { (C) } 11 ,c 12 ,……c 14 Carry out the expansion processing, the expansion processing in this step means S k And { c 11 ,c 12 ,……c 14 Complex multiplication is carried out on each element (complex sign) in the data, and data (S) after the first expansion processing is obtained 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 14 Each of the data is associated with an 8-long (or 4-long) non-orthogonal sequence C 2＝{c 21 ,c 22 ,……c 28 } (or C2= { C) 21 ,c 22 ,……c 24 }) to perform second expansion processing to obtain data { S after second expansion k c 11 c 21 ,S k c 11 c 22 ，……S k c 11 c 28 ，S k c 12 c 21 ,S k c 12 c 22 ……，S k c 12 c 28 ，S k c 14 c 21 ……S k c 14 c 28 } (or { S k c 11 c 21 ,S k c 11 c 22 ，……S k c 11 c 24 ，S k c 12 c 21 ,S k c 12 c 22 ……，S k c 12 c 24 ，S k c 14 c 21 ……S k c 14 c 24 })。
The modulated data symbols are spread by a complex field non-orthogonal spreading sequence, and the spreading in this step means that each coded and modulated data symbol is complex multiplied by each element (complex symbol) of the 4-long complex field non-orthogonal spreading sequence, and finally a complex symbol sequence with the same length as the used 4-long spreading sequence is formed. Thereby obtaining the data sequence after the first expansion.
The data sequence after the first spreading is spread by using the generated 8-long (or 4-long) non-orthogonal sequence, and the spreading in this step means that each element in the data sequence after being spread by the 4-long non-orthogonal sequence is multiplied by each element of the 8-long (or 4-long) non-orthogonal sequence, and finally a symbol sequence with the same length as the 8-long (or 4-long) spreading sequence is formed.
The modulation symbol is firstly spread by 8-length (or 4-length) non-orthogonal sequence, and the spread symbol is spread by 4-length non-orthogonal sequence. The modulated data symbol is S k First, S is k Using 8 long (or 4 long) non-orthogonal sequences C1= { C = { (C) } 11 ,c 12 ,……c 18 } (or C1= { C) 11 ,c 12 ,……c 14 }) performing expansion processing, where the expansion processing in this step means S k And { c 11 ,c 12 ,……c 18 } (or { c 11 ,c 12 ,……c 14 Get the data after the first expansion process { S }by complex multiplication of each element (complex sign) 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 k c 11 ,S k c 12 ,……S k c 14 }) with a 4 long non-orthogonal spreading sequence C2= { C 21 ,c 22 ,……c 24 Performing a second expansion process to obtain data (S) after the second expansion k c 11 c 21 ,S k c 11 c 22 ，……S k c 11 c 24 ，S k c 12 c 21 ,S k c 12 c 22 ……，S k c 12 c 24 ，S k c 18 c 21 ……S k c 18 c 24 } (or { S k c 11 c 21 ,S k c 11 c 22 ，……S k c 11 c 24 ，S k c 12 c 21 ,S k c 12 c 22 ……，S k c 12 c 24 ，S k c 14 c 21 ……S k c 14 c 24 }). Specifically, the following is:
the modulated data symbols are spread by using the generated 8-long (or 4-long) non-orthogonal sequence, and the spreading in this step means that each coded and modulated data symbol is multiplied by each element of the 8-long (or 4-long) non-orthogonal sequence to finally form a symbol sequence with the same length as the used 8-long (or 4-long) spreading sequence. Thereby obtaining the data sequence after the first expansion.
The data after the first spreading is spread by using the generated 4-long complex field non-orthogonal spreading sequence, where the spreading in this step refers to complex multiplication of a data symbol spread by an 8-long (or 4-long) non-orthogonal sequence and each element (complex symbol) in the 4-long complex field non-orthogonal spreading sequence, and finally a complex symbol sequence with the same length as the used 4-long spreading sequence is formed.
And (III) spreading the modulation symbols by an L-length spreading sequence, wherein the L-length spreading sequence is obtained by spreading an L1-length non-orthogonal sequence and an L2-length non-orthogonal sequence. The modulated data symbol is S k Will S k The spreading process is performed by using a spreading sequence of L length, and the spreading process in this step is performed by using S k Complex multiplication is carried out on each element (complex sign) of the L long sequence, and finally a sign sequence with the same length as the L long spreading sequence is formed.
Wherein, the L long sequence is formed by expanding a 4 long non-orthogonal sequence by another 8 long (or 4 long) non-orthogonal sequence; or, the L-length sequence is formed by extending an 8-length (or 4-length) non-orthogonal sequence by another 4-length non-orthogonal sequence.
The L-long sequence is formed by expanding a 4-long non-orthogonal sequence by another 8-long (or 4-long) non-orthogonal sequence, the expansion in the step refers to that each element in the 4-long non-orthogonal sequence is multiplied by each element of the 8-long (or 4-long) non-orthogonal sequence to finally form a symbol sequence with the same length as the used expansion sequence, namely the obtained 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 ，……c 11 c 24 ，c 12 c 21 ,c 12 c 22 ……c 12 c 24 ，……，c 14 c 21 ……c 14 c 24 }); or is a stripThe 8 long (or 4 long) non-orthogonal sequence is formed by spreading another 4 long non-orthogonal sequence, the spreading in the step means that each element in the 8 long (or 4 long) non-orthogonal sequence is multiplied by each element of the 4 long non-orthogonal sequence to finally form a symbol sequence with the same length as the spreading sequence, namely, 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 ……c 12 c 24 ，……，c 18 c 21 ……c 18 c 24 } (or { c 11 c 21 ,c 11 c 22 ，……c 11 c 24 ，c 12 c 21 ,c 12 c 22 ……c 12 c 24 ，……，c 14 c 21 ……c 14 c 24 })；
Finally, the generated L-length sequence is used for spreading, where the spreading in this step is to multiply each code-modulated data symbol by each element (complex symbol) of the L-length sequence to finally form a symbol sequence with the same length as the spreading sequence used.
Step 130, converting the extended symbol into a corresponding carrier modulation signal through carrier modulation (single carrier or multi-carrier modulation).
Step 140, the final carrier modulation signal (single carrier or multi-carrier modulation signal) formed above is transmitted.
To sum up, the embodiment of the present disclosure achieves the following technical effects: the method solves the problems of serious conflict and poor reliability of a transmission access technology caused by massive access of machine communication in the related technology, further improves the reliability of an uplink access process, avoids excessive signaling interaction processes of the uplink access process, avoids strict and complex access processes of the traditional orthogonal multiple access, simplifies the access process, simplifies the implementation of a terminal, reduces the power consumption and cost of the terminal, reduces control signaling, improves the system efficiency and the system flexibility in a massive link scene, and increases the coverage rate.
Embodiments of the present disclosure also provide a storage medium. Alternatively, in this embodiment, the storage medium may be configured to store program codes for performing the following steps:
s1, coding and modulating a bit sequence to be transmitted to form N 1 Modulation symbols, N 1 One modulation symbol plus N 2 Forming N symbols after a pilot symbol, N 1 And N is a positive integer, N 2 Is an integer;
s2, using two spreading sequences or an equivalent sequence to spread the N symbols, wherein the equivalent sequence comprises: a sequence formed by one of the two spreading sequences and the other spreading sequence is spread, wherein the bit sequence carries first indication information or second indication information, the first indication information is used for at least indicating a non-orthogonal sequence in the two spreading sequences, and the second indication information is used for at least indicating a non-orthogonal sequence in the two spreading sequences for generating the equivalent sequence;
and S3, carrying out carrier modulation on the expanded symbols to obtain carrier modulation signals, and sending the carrier modulation signals.
Embodiments of the present disclosure also provide a storage medium. Alternatively, in the present embodiment, the storage medium may be configured to store program codes for performing the following steps:
S1, receiving carrier modulation signals transmitted by a plurality of transmitters, wherein the carrier modulation signals are formed by encoding and modulating bit sequences to be transmitted through the transmitters to form N 1 A modulation symbol of N 1 One modulation symbol plus N 2 N symbols are formed after the pilot symbols are formed, two spreading sequences or an equivalent sequence are used for spreading the N symbols, and the spread symbols are subjected to carrier modulation, wherein N is formed 1 And N is a positive integer, N 2 Is an integer, the equivalent sequence includes: a sequence formed by extending one of the two spreading sequences by the other spreading sequence, wherein the bit sequence carries first indication information or second indication information, and the first indication informationThe information is used for at least indicating a non-orthogonal sequence in the two spreading sequences, and the second indication information is used for at least indicating a non-orthogonal sequence for generating two spreading sequences in the equivalent sequence;
and S2, receiving and detecting the received carrier modulation signal.
Optionally, in this embodiment, the storage medium may include, but is not limited to: a U-disk, a Read-Only Memory (ROM), a Random Access Memory (RAM), a removable hard disk, a magnetic disk, or an optical disk, and various media capable of storing program codes.
Optionally, for a specific example in this embodiment, reference may be made to the examples described in the above embodiment and optional implementation, and this embodiment is not described herein again.
It will be apparent to those skilled in the art that the modules or steps of the present disclosure described above may be implemented by a general purpose computing device, they may be centralized on a single computing device or distributed across a network of multiple computing devices, and alternatively, they may be implemented by program code executable by a computing device, such that they may be stored in a storage device and executed by a computing device, and in some cases, the steps shown or described may be performed in an order different than that described herein, or they may be separately fabricated into individual integrated circuit modules, or multiple ones of them may be fabricated into a single integrated circuit module. As such, the present disclosure is not limited to any specific combination of hardware and software.
The above description is only a preferred embodiment of the present disclosure and is not intended to limit the present disclosure, and various modifications and changes may be made to the present disclosure by those skilled in the art. Any modification, equivalent replacement, or improvement made within the spirit and principle of the present disclosure should be included in the protection scope of the present disclosure.

Claims (23)

1. An access method, comprising:
code modulating the bit sequence to be transmitted to form N 1 A modulation symbol of N 1 One modulation symbol plus N 2 Forming N symbols after a pilot symbol, N 1 And N is a positive integer, N 2 Is an integer;
spreading the N symbols using two spreading sequences or an equivalent sequence, wherein the equivalent sequence comprises: a sequence formed by extending one of the two spreading sequences by the other spreading sequence, wherein the bit sequence carries first indication information or second indication information, the first indication information is used for at least indicating a non-orthogonal sequence of the two spreading sequences, and the second indication information is used for at least indicating a non-orthogonal sequence of the two spreading sequences for generating the equivalent sequence;
and carrying out carrier modulation on the expanded symbols to obtain carrier modulation signals, and sending the carrier modulation signals.
2. The method of claim 1, wherein the first indication information or the second indication information each includes at least the following information: terminal identity identification information; terminal identity identification information and; one or more bits generated in a specified manner or randomly, wherein the terminal identification information includes at least one of: identification information uniquely identifying the terminal; the terminal is used for indicating the identity information of the terminal in the current network.
3. The method of claim 2, wherein the one or more bits generated in a specified manner or randomly are determined by at least one of the following parameters: the terminal identity identification information, the transmission times of the carrier modulation signals, the time-frequency position for sending the carrier modulation signals and the configuration information of the cell where the terminal is located.
4. The method of claim 1, wherein the two spreading sequences comprise: non-orthogonal sequences and orthogonal sequences; alternatively, a non-orthogonal sequence and a non-orthogonal sequence; wherein the non-orthogonal sequence comprises: a complex non-orthogonal sequence.
5. The method of claim 4,
determining the non-orthogonal sequence by one of: selecting from a set containing a plurality of non-orthogonal sequences according to the first indication information or the second indication information of the bit sequence; the sequencer generates the first indication information or the second indication information;
determining the orthogonal sequence by one of: the first indication information or the second indication information further comprises indication information indicating an orthogonal sequence, and is selected from a set comprising a plurality of orthogonal sequences according to the first indication information or the second indication information of the bit sequence; randomly selected from a set comprising a plurality of orthogonal sequences.
6. The method of claim 4,
when the non-orthogonal sequence is a complex non-orthogonal sequence, determining the non-orthogonal sequence by: each element of the complex non-orthogonal sequence is a complex number, and values of real parts and imaginary parts of all elements in the complex non-orthogonal sequence are from an M-element real number set, wherein M is an integer greater than or equal to 2;
wherein, when M is an odd number, the set of M-membered real numbers is a set consisting of M integers in the range [ - (M-1)/2, (M-1)/2 ]; or
When said M is an even number, said M-ary set of real numbers is a set consisting of M odd numbers in the range [ - (M-1), (M-1) ]; or
When M is an odd number, the M-element real number set is a set consisting of M real numbers obtained by respectively multiplying M integers in the range of [ - (M-1)/2, (M-1)/2 ] by an energy normalization coefficient corresponding to the M-element real number set; or
When M is an even number, the M-ary real number set is a set of M real numbers obtained by multiplying M odd numbers within a range of [ - (M-1), (M-1) ] by an energy normalization coefficient of the M-ary real number set, respectively.
7. The method of claim 4,
when the non-orthogonal sequence is a complex non-orthogonal sequence, determining the complex non-orthogonal sequence according to the bit sequence includes:
Generating an integer sequence according to the bit sequence, wherein values of all elements of the integer sequence are from an M × M-element integer set, the number of the elements is the same as the length of the non-orthogonal sequence, the M × M-element integer set is a set consisting of all integers in a range of [0, M × M-1] or [1, M × M ], and M is an integer greater than or equal to 2;
according to the elements in the integer sequence, selecting complex constellation points corresponding to the elements from a complex constellation diagram of M multiplied by M points according to a preset mapping rule;
and determining a complex number corresponding to the complex constellation point, and sequentially combining the complex numbers to obtain the complex non-orthogonal sequence, or sequentially combining the complex numbers multiplied by an energy normalization coefficient of the complex numbers to obtain the complex non-orthogonal sequence.
8. The method of claim 6 or 7,
m =2 or 3 or 4.
9. The method of claim 4,
when the non-orthogonal sequence is a complex non-orthogonal sequence, determining a complex non-orthogonal sequence to use from the bit sequence includes:
generating an integer sequence according to the bit sequence, wherein values of all elements of the integer sequence are from an 8-element integer set, the number of the elements is the same as the length of the non-orthogonal sequence, and the 8-element integer set is a set consisting of all integers in a range of [0,7] or [1,8 ];
According to elements in the integer sequence, selecting complex constellation points corresponding to the complex numbers from a complex constellation diagram of 8 points according to a preset mapping rule;
and determining a complex number corresponding to the complex constellation point, and sequentially combining the complex numbers to obtain the complex non-orthogonal sequence, or multiplying the complex number by an energy normalization coefficient corresponding to the complex number and sequentially combining to obtain the complex non-orthogonal sequence.
10. The method of claim 1,
determining, by the broadcast information transmitted by the base station, at least one of: the length of at least one of the two spreading sequences or the length of the equivalent sequence; time-frequency resources available to the terminal.
11. The method of any one of claims 4-7, 9-10,
the orthogonal sequence includes at least one of: walsh sequences, discrete fourier transform DFT sequences, zadoff-Chu sequences.
12. The method of claim 1,
and coding the bit sequence to be transmitted by adopting at least one of the following coding modes: cyclic redundancy check coding and channel error correction coding;
modulating the bit sequence to be transmitted by adopting at least one of the following coding modes: binary phase shift keying, quadrature phase shift keying, 16 quadrature amplitude modulation, 64 quadrature amplitude modulation.
13. The method of claim 1,
the carrier modulation of the spread symbols comprises: the carrier modulation is performed in at least one of the following ways: orthogonal Frequency Division Multiplexing (OFDM) with a Cyclic Prefix (CP); single carrier frequency division multiple access SC-FDMA modulation with a cyclic prefix CP; OFDM/SC-FDMA modulation of 1 subcarrier with cyclic prefix CP.
14. The method of any one of claims 4-7, 9-10, 12-13, wherein the orthogonal sequence has a sequence length of 1; the length of the non-orthogonal sequence is 1.
15. The method of any of claims 4-7, 9-10, 12-13, wherein the number of pilot symbols N 2 The value is 0.
16. An access method, comprising:
receiving carrier modulation signals transmitted by a plurality of transmitters, wherein the carrier modulation signals are formed by encoding and modulating bit sequences to be transmitted by the transmitters to form N 1 A modulation symbol of N 1 One modulation symbol plus N 2 N symbols are formed after each pilot frequency symbol, two spreading sequences or one equivalent sequence are used for spreading the N symbols, and the carrier modulation is carried out on the spread symbols, wherein N is formed 1 And N is a positive integer, N 2 Is an integer, the equivalent sequence includes: extending one of the two spreading sequences by a sequence formed by the other spreading sequence, wherein the bit sequence carries first indication information or second indication information, the first indication information is used for at least indicating a non-orthogonal sequence in the two spreading sequences, and the second indication information is used for at least indicating a non-orthogonal sequence in the two spreading sequences for generating the equivalent sequence;
and carrying out receiving detection on the received carrier modulation signal.
17. An access device, comprising:
a code modulation module for code modulating the bit sequence to be transmitted to form N 1 A modulation symbol of N 1 One modulation symbol plus N 2 Forming N symbols after each pilot symbol, N 1 And N is a positive integer, N 2 Is an integer;
a spreading module, configured to spread the N symbols using two spreading sequences or an equivalent sequence, where the equivalent sequence includes: a sequence formed by extending one of the two spreading sequences by the other spreading sequence, wherein the bit sequence carries first indication information or second indication information, the first indication information is used for at least indicating a non-orthogonal sequence of the two spreading sequences, and the second indication information is used for at least indicating a non-orthogonal sequence of the two spreading sequences of the equivalent sequence;
The carrier modulation module is used for carrying out carrier modulation on the expanded symbols to obtain carrier modulation signals;
and the sending module is used for sending the carrier modulation signal.
18. An access device, comprising:
a receiving module, configured to receive carrier modulation signals transmitted by multiple transmitters, where the carrier modulation signals are formed by coding and modulating a bit sequence to be transmitted by the transmitters to form N 1 A modulation symbol of N 1 One modulation symbol plus N 2 N symbols are formed after the pilot symbols are formed, two spreading sequences or an equivalent sequence are used for spreading the N symbols, and the spread symbols are subjected to carrier modulation, wherein N is formed 1 And N is a positive integer, N 2 Is an integer, the equivalent sequence includes: a sequence formed by extending one of the two spreading sequences by the other spreading sequence, wherein the bit sequence carries first indication information or second indication information, the first indication information is used for at least indicating a non-orthogonal sequence in the two spreading sequences, and the second indication information is used for at least indicating that a non-orthogonal sequence in the two spreading sequences in the equivalent sequence is generated;
And the detection module is used for receiving and detecting the received carrier modulation signal.
19. A transmitter, comprising:
a first processor;
a first memory for storing processor-executable instructions;
wherein the first processor is used for sending the information to the serverCoded modulation of the transmitted bit sequence to form N 1 A modulation symbol of N 1 One modulation symbol plus N 2 Forming N symbols after each pilot frequency symbol, using two extension sequences or an equivalent sequence to extend the N symbols, carrying out carrier modulation on the extended symbols to obtain carrier modulation signals, and sending the carrier modulation signals, wherein N is 1 And N is a positive integer, N 2 Is an integer, the equivalent sequence includes: and extending one of the two spreading sequences by another spreading sequence to form a sequence, wherein the bit sequence carries first indication information or second indication information, the first indication information is used for at least indicating a non-orthogonal sequence in the two spreading sequences, and the second indication information is used for at least indicating a non-orthogonal sequence in the two spreading sequences for generating the equivalent sequence.
20. The transmitter of claim 19, wherein the transmitter is in a sleep state when there is no data demand.
21. A terminal, comprising: the transmitter of any one of claims 19-20.
22. A receiver, comprising:
a second processor;
a second memory for storing second processor-executable instructions;
the second processor is configured to receive carrier modulation signals transmitted by multiple transmitters, and when the carrier modulation signals are received, the transmitters perform coded modulation on bit sequences to be transmitted to form N 1 A modulation symbol of N 1 One modulation symbol plus N 2 N symbols are formed after each pilot frequency symbol, two spreading sequences or one equivalent sequence are used for spreading the N symbols, and the spread symbols are subjected to carrier modulation, wherein N is formed 1 And N is a positive integer, N 2 Is an integer, the equivalent sequence includes: the two strips are put togetherOne of the spreading sequences spreads a sequence formed by the other spreading sequence, the bit sequence carries first indication information or second indication information, the first indication information is used for at least indicating a non-orthogonal sequence in the two spreading sequences, and the second indication information is used for at least indicating generation of the non-orthogonal sequence in the equivalent sequence.
23. A storage medium comprising a stored program, wherein the program when executed performs the method of any one of claims 1 to 15, or the method of claim 16.
CN201610284332.6A 2016-04-29 2016-04-29 Access method and device, transmitter, receiver and terminal Active CN107343321B (en)

Priority Applications (2)

Application Number Priority Date Filing Date Title
CN201610284332.6A CN107343321B (en) 2016-04-29 2016-04-29 Access method and device, transmitter, receiver and terminal
PCT/CN2017/082532 WO2017186175A1 (en) 2016-04-29 2017-04-28 Access method and device, transmitter, receiver, and terminal

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201610284332.6A CN107343321B (en) 2016-04-29 2016-04-29 Access method and device, transmitter, receiver and terminal

Publications (2)

Publication Number Publication Date
CN107343321A CN107343321A (en) 2017-11-10
CN107343321B true CN107343321B (en) 2022-11-08

Family

ID=60161847

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201610284332.6A Active CN107343321B (en) 2016-04-29 2016-04-29 Access method and device, transmitter, receiver and terminal

Country Status (2)

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

Families Citing this family (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109873782B (en) 2017-12-01 2022-02-25 中兴通讯股份有限公司 Data transmitting and receiving method, device, equipment and computer readable storage medium
CN109962751B (en) * 2017-12-25 2022-03-01 中兴通讯股份有限公司 Data processing method and device
WO2019144405A1 (en) 2018-01-29 2019-08-01 Zte Corporation Method and apparatus for generating spreading sequence codebooks
CA3125352C (en) * 2018-03-05 2023-10-24 Zte Corporation Transmissions using spreading codes
CN108900459A (en) * 2018-05-25 2018-11-27 西南电子技术研究所（中国电子科技集团公司第十研究所） GFDM/CDMA mixing multiple access radio switch-in method
CN111726315B (en) * 2019-03-20 2023-05-30 中兴通讯股份有限公司 Data transmitting and receiving method and device, data transmission system and storage medium
CN112422257A (en) * 2020-11-17 2021-02-26 上海道生物联技术有限公司 Method and system for sending synchronization signal

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP1234385A1 (en) * 2000-10-20 2002-08-28 Samsung Electronics Co., Ltd. Apparatus and method for transmitting a burst pilot channel in a mobile communication system
CN102916783A (en) * 2011-08-02 2013-02-06 华为技术有限公司 Method for transmitting, receiving and processing information, base station and user equipment
CN104580034A (en) * 2013-10-25 2015-04-29 华为技术有限公司 Estimation method, sending device and receiving device for uplink channel
CN105515713A (en) * 2014-09-25 2016-04-20 中兴通讯股份有限公司 Multi-user CDMA (Code Division Multiple Access) communication method and corresponding transmitter and receiver
CN105515608A (en) * 2014-09-26 2016-04-20 中兴通讯股份有限公司 Spread spectrum processing method and spread spectrum processing device

Family Cites Families (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103220802B (en) * 2012-01-19 2019-04-05 中兴通讯股份有限公司 Downstream data processing method and device
CN104349491A (en) * 2013-08-08 2015-02-11 中兴通讯股份有限公司 PESCH (physical downlink shared channel) transmission method, system and network side equipment

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP1234385A1 (en) * 2000-10-20 2002-08-28 Samsung Electronics Co., Ltd. Apparatus and method for transmitting a burst pilot channel in a mobile communication system
CN102916783A (en) * 2011-08-02 2013-02-06 华为技术有限公司 Method for transmitting, receiving and processing information, base station and user equipment
CN104580034A (en) * 2013-10-25 2015-04-29 华为技术有限公司 Estimation method, sending device and receiving device for uplink channel
CN105515713A (en) * 2014-09-25 2016-04-20 中兴通讯股份有限公司 Multi-user CDMA (Code Division Multiple Access) communication method and corresponding transmitter and receiver
CN105515608A (en) * 2014-09-26 2016-04-20 中兴通讯股份有限公司 Spread spectrum processing method and spread spectrum processing device

Also Published As

Publication number Publication date
CN107343321A (en) 2017-11-10
WO2017186175A1 (en) 2017-11-02

Similar Documents

Publication Publication Date Title
CN107343321B (en) Access method and device, transmitter, receiver and terminal
US11206689B2 (en) Method and device for performing a random access in wireless communication system
US10326547B2 (en) Multi-user code division multiple access communication method, and corresponding transmitter and receiver
JP6856736B2 (en) Communication equipment, communication methods, and integrated circuits
RU2554550C2 (en) Radio base station and user equipment and methods therein
KR102432449B1 (en) Multi-user communication method and apparatus of code division multiple access
US20190364603A1 (en) Method and apparatus for performing random access
US11611967B2 (en) Scrambling-based data transmission method
WO2011082681A1 (en) Method and device for resource mapping and code division multiplexing
US10736134B2 (en) NCMA-based uplink communication method and device therefor
KR20170070169A (en) System and method for low peak to average power ratio multiple access communications
CN101632246B (en) Systems and methods for generating sequences that are nearest to a set of sequences with minimum average cross-correlation
WO2018059488A1 (en) Method and device for transmitting reference signal
EP3261306B1 (en) Data transmission method and device
WO2018100428A1 (en) Method and device for signal processing in communication system
WO2016155390A1 (en) Data transmission method and device
US20180034501A1 (en) Data Transmission Method and Apparatus
CN107710853B (en) Method and device for transmitting information
CN108207028B (en) Data generation method, device and equipment
WO2019154286A1 (en) Data modulation and demodulation method and apparatus
CN106850163B (en) Transmission method of PHICH feedback information and related equipment
CN103384182A (en) Method, system and device for carrying out uplink transmission
CN109565485B (en) Multiplexing method and device of demodulation reference signals and communication system
KR20140075252A (en) Apparatus and method for control channel configuration and detection of control information
KR102322497B1 (en) Non-orthogonal based uplink transmission method and apparatus

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant