WO2016062120A1 - 码分多址接入的多用户通信方法及装置 - Google Patents

码分多址接入的多用户通信方法及装置 Download PDF

Info

Publication number
WO2016062120A1
WO2016062120A1 PCT/CN2015/083479 CN2015083479W WO2016062120A1 WO 2016062120 A1 WO2016062120 A1 WO 2016062120A1 CN 2015083479 W CN2015083479 W CN 2015083479W WO 2016062120 A1 WO2016062120 A1 WO 2016062120A1
Authority
WO
WIPO (PCT)
Prior art keywords
sequence
complex
length
real
sequences
Prior art date
Application number
PCT/CN2015/083479
Other languages
English (en)
French (fr)
Inventor
袁志锋
李卫敏
Original Assignee
中兴通讯股份有限公司
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by 中兴通讯股份有限公司 filed Critical 中兴通讯股份有限公司
Priority to JP2017522059A priority Critical patent/JP6598857B2/ja
Priority to US15/521,096 priority patent/US10651887B2/en
Priority to KR1020177013426A priority patent/KR102432449B1/ko
Priority to EP15853508.8A priority patent/EP3211846A4/en
Publication of WO2016062120A1 publication Critical patent/WO2016062120A1/zh

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L27/00—Modulated-carrier systems
    • H04L27/18—Phase-modulated carrier systems, i.e. using phase-shift keying
    • H04L27/20—Modulator circuits; Transmitter circuits
    • H04L27/2032—Modulator circuits; Transmitter circuits for discrete phase modulation, e.g. in which the phase of the carrier is modulated in a nominally instantaneous manner
    • H04L27/2035—Modulator circuits; Transmitter circuits for discrete phase modulation, e.g. in which the phase of the carrier is modulated in a nominally instantaneous manner using a single or unspecified number of carriers
    • H04L27/2042—Modulator circuits; Transmitter circuits for discrete phase modulation, e.g. in which the phase of the carrier is modulated in a nominally instantaneous manner using a single or unspecified number of carriers with more than two phase states
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04B—TRANSMISSION
    • H04B1/00—Details of transmission systems, not covered by a single one of groups H04B3/00 - H04B13/00; Details of transmission systems not characterised by the medium used for transmission
    • H04B1/69—Spread spectrum techniques
    • H04B1/707—Spread spectrum techniques using direct sequence modulation
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04B—TRANSMISSION
    • H04B7/00—Radio transmission systems, i.e. using radiation field
    • H04B7/24—Radio transmission systems, i.e. using radiation field for communication between two or more posts
    • H04B7/26—Radio transmission systems, i.e. using radiation field for communication between two or more posts at least one of which is mobile
    • H04B7/2628—Radio transmission systems, i.e. using radiation field for communication between two or more posts at least one of which is mobile using code-division multiple access [CDMA] or spread spectrum multiple access [SSMA]
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04J—MULTIPLEX COMMUNICATION
    • H04J13/00—Code division multiplex systems
    • H04J13/0007—Code type
    • H04J13/0022—PN, e.g. Kronecker
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04J—MULTIPLEX COMMUNICATION
    • H04J13/00—Code division multiplex systems
    • H04J13/10—Code generation
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04J—MULTIPLEX COMMUNICATION
    • H04J13/00—Code division multiplex systems
    • H04J13/10—Code generation
    • H04J13/102—Combining codes
    • H04J13/107—Combining codes by concatenation
    • 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/0001—Systems modifying transmission characteristics according to link quality, e.g. power backoff
    • H04L1/0009—Systems modifying transmission characteristics according to link quality, e.g. power backoff by adapting the channel coding
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L27/00—Modulated-carrier systems
    • H04L27/26—Systems using multi-frequency codes

Definitions

  • the present invention relates to the field of communications, and in particular to a multi-user communication method and apparatus for code division multiple access.
  • Uplink multi-user access can be through different multiple access technologies such as Time Division Multiple Access (TDMA), Frequency Division Multiple Access (FDMA), Code Division Multiple Access (Code Division Multiple Access). , CDMA) and Space Division Multiple Access (SDMA).
  • TDMA Time Division Multiple Access
  • FDMA Frequency Division Multiple Access
  • CDMA Code Division Multiple Access
  • SDMA Space Division Multiple Access
  • multi-user code division multiple access communication technology is a very important category of uplink multi-user access communication technology, and can provide excellent access performance, and thus has been adopted by multiple wireless communication standards.
  • each access terminal first uses a certain length of the extended sequence (for example, the extended sequence of length L means that the extended sequence consists of L symbols, or It is said that it is composed of L elements, where L symbols/L elements can be L digital symbols) and the digital amplitude-phase-modulated data symbols are expanded.
  • the spreading process refers to the process of multiplying each modulated data symbol by each symbol of the spreading sequence to finally form a sequence of symbols of the same length as the spreading sequence used.
  • Each modulated data symbol in the expansion process for example, a constellation point symbol modulated by Quadrature Amplitude Modulation (QAM)
  • QAM Quadrature Amplitude Modulation
  • the symbol will be expanded into a sequence of symbols of the same length as the extended sequence used. If a spreading sequence of length L is used, each modulated symbol will be expanded into L symbols. It can also be said that each modulated data symbol is carried in a strip.
  • the extended sequence of length L is on.
  • the extended symbol sequence of all access terminals can then be transmitted on the same time-frequency resource.
  • the base station receives the combined signals of the extended signals of all the access terminals, and separates the useful information of each terminal from the combined signals by the multi-user receiver technology.
  • the communication technology using code division multiple access is often classified as a class of spread spectrum communication, because the modulation symbol of the terminal is expanded to L times the symbol, if the transmission time requirement of the extended L times symbol is equal to before the expansion Modulation symbols, the required bandwidth will inevitably extend by a factor of L. This is also why the spreading sequence is often referred to as a spreading sequence.
  • MC-CDMA Multi-Carrier Code Division Multiple Access
  • the spreading process on the transmitting side is relatively simple, and it is only necessary to multiply each modulation symbol, such as each QAM modulated symbol, with each symbol of a spreading sequence of length L.
  • the extended L symbols can be obtained, and then the extended symbols can be transmitted by single carrier or multi-carrier technology.
  • the receiving process of the base station is not simple.
  • the base station accurately separate the useful data information of each terminal from the combined signal? This is the key to the CDMA system. It mainly involves two aspects: the extended sequence and the receiver. The selection of the extended sequence is the performance basis, and the receiver design is the performance guarantee.
  • the extended sequences used by different terminals first need to have good cross-correlation properties. If the spreading sequence is transmitted directly in the wireless multipath channel, such as the single-carrier code division multiplexing technique, the sequence is also required to have good autocorrelation properties to combat the delay multipath expansion of the sequence itself.
  • Multi-carrier code division multiplexing technology can rely on multi-carrier technology to combat multipath, so the extended sequence can only consider the cross-correlation property that facilitates the separation of multi-user information. This is also the biggest difference between the single-carrier code division multiplexing and multi-carrier code division multiplexing technology for sequence selection!
  • a good spreading sequence is the basis of performance.
  • the separation of multi-user information is done at the base station side.
  • the base station adopts different multi-user receiving technologies to obtain corresponding performance.
  • base stations need to adopt high-performance, but high-complexity multi-user receiver technologies, such as serial interference cancellation receiver technology.
  • Direct Sequence-Code Division Multiple Access (DS-CDMA) technology is the most commonly used code division multiple access technology and has been adopted as a multi-user access by multiple wireless communication standards.
  • Technology, its extended sequence is based on the simplest binary pseudo-random (Pseudo-Noise, PN) real number sequence. Due to the simplicity of the sequence, DS-CDMA based on PN sequence is also one of the most important techniques for multi-carrier code division multiplexing. In this technique, each modulated symbol is first extended by a binary pseudo-random real number sequence, and then It is then transmitted through multi-carrier technology.
  • the binary pseudo-random real number sequence may also be referred to as a binary pseudo-random sequence, and each symbol value in the sequence is usually represented as 0 or 1, and may be further expressed as a bipolar sequence, that is, 0 is represented as +1, and 1 is represented as -1, or 0 is represented as -1, and 1 is represented as +1.
  • the length of the extended sequence is also a key component of the code division multiple access technique.
  • the longer the spreading sequence the easier the cross-correlation between the spreading sequences used by the terminals is, and the easier it is to find more sequences with low cross-correlation, thus supporting more simultaneous access terminals. If the number of terminals accessing at the same time is greater than the length of the extended sequence, It can be said that the multi-user access system is in an overload state. It is worth mentioning that the realization of system overload is one of the key attributes of CDMA in the future wireless communication.
  • the extension sequences used by the access terminals are not orthogonal to each other.
  • the uplink can adopt the non-orthogonal multiple access method. Orthogonal multiple access mode for greater system capacity or edge throughput. Since the spreading sequences of the terminals are not orthogonal to each other, in general, the demodulation performance of each user deteriorates as the number of simultaneous access users increases. When the system is overloaded, interference between multiple users becomes more serious.
  • a large application scenario of the code division multiple access technology is random access or access to competing resources. Since each access user transmits its own modulation symbols with the extended sequence and then transmits them in the same time-frequency resource, the same time-frequency resources are used competitively.
  • an important constraint performance factor of code division multiple access is that a user spreads all modulation symbols using only one spreading sequence, that is, all modulation symbols are spread using the same sequence.
  • This method is convenient for the receiver to adopt serial interference cancellation technology, which can simplify the implementation of serial interference cancellation, but the single extended sequence scheme cannot be effectively randomized or averaged due to user interference. Therefore, it is disadvantageous for the access performance of non-orthogonal code division multiple access.
  • an embodiment of the present invention provides a multi-user communication method and apparatus for code division multiple access.
  • a multi-user communication method for code division multiple access is provided, which is applied to a transmitter, comprising: acquiring N modulation symbols obtained by modulating a code block programmed by a channel coder, Wherein, N is a positive integer greater than or equal to 2; the N modulation symbols are extended according to a spreading sequence of N specified lengths, wherein at least two extended sequences of the N specified length extension sequences are different; Send the expanded modulation symbol.
  • the N specified length extension sequences are obtained by: determining the N specified length extension sequences according to an output sequence of the pseudo random sequence generator; The N extended sequence of the specified length is obtained in the list, where the preset list includes a plurality of sequences of the specified length.
  • the preset list has L sequences of length L, and the sequence constitutes an L-order orthogonal matrix, where L is a value indicated by the specified length.
  • the sequence constitutes an L-order orthogonal matrix, including: the L-length L sequence is arranged as an L ⁇ L discrete Fourier transform matrix; or, the L ⁇ L discrete Fourier Each element in the leaf transformation matrix is multiplied by a first predetermined value to form the L-order orthogonal matrix.
  • the sequence constitutes an L-order orthogonal matrix, including: the L-length L sequence is arranged as an L ⁇ L Hadamard matrix; or, each of the L ⁇ L Hadamard matrix The element is multiplied by a second predetermined value to form the L-order orthogonal matrix.
  • the orthogonal matrix is an identity matrix.
  • the extended sequence includes at least one of the following: a real sequence, a complex sequence.
  • the method further includes: multiplying the N complex sequences of the specified length by the N specified
  • the energy normalization coefficients of the complex sequence of lengths result in normalized N complex sequences of a specified length.
  • the complex sequence is determined by generating a real part and an imaginary part of all complex elements in the complex sequence using a pseudo-random sequence generator capable of generating an M-ary real number, or from a set of real numbers of the M-ary
  • the real and imaginary parts of all complex elements in the complex sequence are selected by a certain pseudo-random criterion, where M is an integer greater than or equal to 2.
  • the M-ary real number set satisfies at least one of the following conditions: the M is an odd number, and the real number set is a range of [-(M-1)/2, (M-1)/2] a set of M integers within; the M is an even number, and the set of real numbers is a set of M odd numbers in the range [-(M-1), (M-1)]; the M is an odd number,
  • the real number set is composed of M real numbers obtained by multiplying M integers in the range [-(M-1)/2, (M-1)/2] by the corresponding energy normalization coefficients of the real number set, respectively.
  • a set the M is an even number, and the real set is M obtained by multiplying M odd numbers in the range of [-(M-1), (M-1)] by the corresponding energy normalization coefficients of the real set A collection of real numbers.
  • the method further includes: multiplying the N complex sequences of the specified length by the N specified
  • the energy normalization coefficients of the complex sequence of lengths result in normalized N complex sequences of a specified length.
  • the complex sequence is determined by: generating an integer sequence of length R, wherein the integer sequence value is from an M ⁇ M-ary integer set, and the M ⁇ M-ary integer set is [ a set of all integers in the range of 0, M x M-1] or [1, M x M]; elements of the sequence of integers of length R Selecting a constellation point corresponding to the element in the complex constellation according to a preset mapping rule; determining the complex sequence according to the constellation point.
  • the M value includes at least one of the following: 2, 3, and 4.
  • transmitting the extended modulation symbol includes: performing multi-carrier modulation on the modulation symbol; and using the modulated modulation symbol as a transmission signal of the transmitter.
  • a multi-user communication method for code division multiple access which is applied to a receiver, comprising: receiving a transmission signal transmitted by K transmitters, wherein the transmitting Transmitting the modulated signal to the K transmitters by using a spreading sequence of a specified length, respectively, and then modulating the expanded modulated signal to a signal formed by the same time-frequency resource, for each transmitter, N modulation symbols, there are N extended sequences of a specified length, and at least two extended sequences of the N specified length extension sequences are different, N and K are positive integers; according to the extended sequence The signal is transmitted for detection.
  • a multi-user communication device for code division multiple access which is applied to a transmitter, and includes: a first acquiring module, configured to acquire a code coded by a channel encoder. The N modulation symbols obtained after the block is modulated, wherein N is a positive integer greater than or equal to 2; an expansion module, configured to expand the N modulation symbols according to a spreading sequence of N specified lengths, where At least two extension sequences are different in the extended sequence of N specified lengths; a sending module is configured to send the extended modulation symbols.
  • the device further includes: a first determining module, configured to determine, according to an output sequence of the pseudo-random sequence generator, the N extended sequences of a specified length; and a second acquiring module, configured to follow the preset The criterion obtains the extended sequence of the N specified lengths from the preset list, where the preset list includes a plurality of sequences of the specified length.
  • the extended sequence includes at least one of the following: a real sequence, a complex sequence
  • the selecting module is configured to generate a real part and an imaginary part of all complex elements in the complex sequence by using a pseudo-random sequence generator capable of generating an M-ary real number, or from the M-ary real number set A certain pseudo-random criterion selects the real and imaginary parts of all complex elements in the complex sequence, where M is an integer greater than or equal to two.
  • a multi-user communication apparatus for code division multiple access which is applied to a receiver, and includes: a receiving module, configured to receive a transmission signal transmitted by K transmitters, where Transmitting the modulated signal to the K transmitters by using a spreading sequence of a specified length, respectively, and then modulating the expanded modulated signal to a signal formed by the same time-frequency resource, for each transmitting
  • a receiving module configured to receive a transmission signal transmitted by K transmitters, where Transmitting the modulated signal to the K transmitters by using a spreading sequence of a specified length, respectively, and then modulating the expanded modulated signal to a signal formed by the same time-frequency resource, for each transmitting
  • the detection module is set to The transmitted signal is detected according to the extended sequence.
  • a technical solution for expanding a modulation symbol by using N extended sequences with at least two different spreading sequences is used, which solves the problem that a user expands all modulation symbols by using only one extended sequence in the related art.
  • Inter-user interference is not effectively randomized or averaged, improving multi-access performance.
  • Each access user can use a variety of different spreading sequences to extend its modulation symbols, so that interference between users can be Effective randomization or averaging.
  • FIG. 1 is a flowchart of a code division multiple access multi-user communication method according to an embodiment of the present invention
  • FIG. 2 is a structural block diagram of a code division multiple access multi-user communication apparatus according to an embodiment of the present invention
  • FIG. 3 is a block diagram showing still another structure of a code division multiple access multi-user communication apparatus according to an embodiment of the present invention.
  • FIG. 4 is another flow chart of a code division multiple access multi-user communication method according to an embodiment of the present invention.
  • FIG. 5 is a block diagram showing another structure of a code division multiple access multi-user communication apparatus according to an embodiment of the present invention.
  • FIG. 6 is a schematic diagram of a signal processing process of a transmitter according to a preferred embodiment 1 and a second embodiment of the present invention
  • FIG. 7 is a flowchart of a multi-user code division multiple access communication method on a transmitter side according to a preferred embodiment of the present invention.
  • FIG. 8 is a flowchart of a multi-user code division multiple access communication method on the transmitter side according to a preferred embodiment of the present invention
  • Figure 9 is a block diagram of a transmitter of a preferred embodiment of the present invention.
  • FIG. 10 is a schematic diagram of receiving signals and processing by a receiver of a preferred embodiment of the present invention.
  • FIG. 11 is a flowchart of a multi-user code division multiple access communication method on the receiver side of a preferred embodiment of the present invention.
  • Figure 12 is a block diagram of a receiver of a preferred embodiment of the present invention.
  • FIG. 13 is a schematic diagram showing the principle of an example of generating a complex extension sequence in the fifth embodiment of the present invention.
  • FIG. 14 is a schematic diagram showing the principle of another example of generating a complex extension sequence in the fifth embodiment of the present invention.
  • 15 is a schematic diagram showing the principle of an M-ary pseudo-random sequence generator in a fifth embodiment of the present invention.
  • 16 is a schematic diagram showing the principle of an example of generating a complex extension sequence in a preferred embodiment of the present invention.
  • 17 is a schematic diagram showing the principle of another example of generating a complex spreading sequence in a preferred embodiment of the present invention.
  • 18 is a schematic diagram showing a mapping relationship between two pseudo-random real numbers and a complex constellation diagram of two sets of real numbers in a preferred embodiment of the present invention
  • 19 is a schematic diagram showing a mapping relationship between two pseudo-random real numbers and a complex constellation diagram of two sets of real numbers in a preferred embodiment of the present invention.
  • 20 is a schematic diagram showing the principle of an example of generating a complex extension sequence in a preferred embodiment 7 of the present invention.
  • Figure 21 is a schematic diagram showing the principle of another example of the generation of the complex extension sequence in the preferred embodiment 7 of the present invention.
  • FIG. 1 is a flowchart of a multi-user communication method for code division multiple access according to an embodiment of the present invention. As shown in Figure 1, the process includes the following steps:
  • Step S102 Acquire N modulation symbols obtained by modulating a code block programmed by a channel coder, where N is a positive integer greater than or equal to 2;
  • Step S104 expanding the N modulation symbols according to the N extended sequences of the specified length, where at least two extended sequences are different in the extended sequence of the N specified lengths;
  • Step S106 transmitting the expanded modulation symbol.
  • the technical solution for expanding the modulation symbols by using the N extended sequences with at least two different spreading sequences is used to solve the problem that the user in the related art uses only one extended sequence to expand all the modulation symbols.
  • Inter-interference does not have an effective randomization or averaging problem, so that each access user can use a variety of different spreading sequences to extend its modulation symbols, so that interference between users can be effectively randomized or averaged. Improves the performance of multiple access.
  • the method (1) for obtaining the extended sequence of the N specified lengths may be implemented in the following two ways:
  • the sequence of degree R is equally divided into N sequences of a specified length; the sequence of N specified lengths is used as the extended sequence of the N specified lengths, for example, the pseudo-random sequence generator generates a sequence of preset length 2, then When N is 4, when the specified length is 3, the sequence is repeated six times, and a sequence having a sequence length of 12 is generated, and the sequence 4 having a length of 12 is equally divided into a spread sequence having a specified length of 3.
  • the preset list has L sequences of length L, and the sequence can form an L-order orthogonal matrix, of course, forming the L-order positive There are a plurality of mating matrices.
  • the sequence of length L is arranged as an L ⁇ L discrete Fourier transform matrix; or L ⁇ L discrete Fu
  • Each element in the inner leaf variation matrix is multiplied by a first predetermined value to form an L-order orthogonal matrix, or the above-described sequence of length L is arranged into an L ⁇ L Hadamard matrix; or, each of the L ⁇ L Hadamard matrices
  • the element is multiplied by the second predetermined value to form the L-order orthogonal matrix, and for the first predetermined value and the second predetermined value, those skilled in the art can completely set according to experience and actual conditions, and the preferred embodiment of the present invention There is no limit to this.
  • the unit matrix can be directly selected as the above orthogonal matrix.
  • the extended sequence provided by the foregoing embodiment of the present invention may be a real matrix.
  • the current mainstream code division multiple access technology is mostly based on a binary pseudo-random real number sequence as an extended sequence.
  • the binary pseudo-random real number sequence especially the low cross-correlation between the short pseudo-random real number sequences is not easy to guarantee, which will lead to serious multi-user interference, which will inevitably affect multi-user access.
  • the embodiment of the present invention further provides the following technical solution, that is, the foregoing extended sequence can also be implemented by a complex sequence, that is, each user can also use a plurality of different complex extended sequences to modulate the symbols.
  • the method of the present invention provides the following four methods for determining the complex sequence, which need to be explained by using the complex cross-correlation potential of the complex sequence to improve the access performance.
  • the four determination methods provided below may be used in combination or separately when needed, and the embodiment of the present invention does not limit this:
  • the normalized N complex length sequences of the specified length may also be obtained by multiplying N complex sequences of a specified length by the energy normalization coefficients of the N specified lengths of the complex sequence.
  • two random sequence generators may be directly outputting the first real sequence and the second real sequence, respectively, and the real part of the complex sequence may be directly determined according to the first real sequence and the second real sequence.
  • the imaginary part can also use the complex constellation diagram to determine the real and imaginary parts of the complex sequence.
  • the embodiment of the present invention may actually be understood as the first according to the determination
  • the real sequence and the second real sequence determine the real part and the imaginary part of the complex sequence.
  • the sequence output by the pseudo random sequence generator is used to extract data from the sequence to determine the first real sequence and the second real number. The sequence in turn determines the real and imaginary parts of the complex sequence.
  • the real number set in the above embodiment satisfies at least one of the following conditions: the real set is a set of M integers in the range of [-(M-1)/2, (M-1)/2] Where M is an odd number; the above set of real numbers is a set of M odd numbers in the range [-(M-1), (M-1)], where M is an even number; the above real number set is [-(M- a set of M real numbers obtained by multiplying M integers in the range of 1), (M-1)/2] by the corresponding energy normalization coefficients of the real set, wherein M is an odd number; a set of M real numbers obtained by multiplying M odd numbers in the range [-(M-1), (M-1)] by the corresponding energy normalization coefficients of the real set, wherein M is an even number, wherein
  • the value of M includes at least one of the following: 2, 3, 4.
  • the imaginary part will contain the above
  • the complex sequence N of R is equally divided into the above-described complex sequence of the specified length.
  • the following process may also be performed: multiplying the N complex sequences of the specified length by respectively
  • the normalized N complex-length sequences of the specified length are obtained by normalizing the energy of the complex sequence of the N specified lengths.
  • Step S106 Determine the complex sequence by: generating a sequence of integers of length R, wherein the integer sequence takes values from a set of M x M-ary integers, and the set of M x M-ary integers is [0, M x M-1] or [ a set consisting of all integers in the range of 1, M ⁇ M]; the elements of the integer sequence of length R above are arranged according to a preset mapping rule in the complex constellation diagram and the constellation points corresponding to the above elements are selected; After the process of the sequence is extended, and the modulation symbols are extended according to the above-mentioned extended sequence, the above step S106 can be implemented by performing multi-carrier modulation on the modulation symbols and using the modulated modulation symbols as the transmission signals of the transmitter.
  • a multi-user communication device for code division multiple access is also provided, which is applied to a transmitter, and the device is used to implement the foregoing embodiments and preferred embodiments, and details are not described herein.
  • the term "module” may implement a combination of software and/or hardware of a predetermined function.
  • the apparatus described in the following embodiments is preferably implemented in software, hardware, or a combination of software and hardware, is also possible and contemplated.
  • FIG. 2 is a structural block diagram of a multi-user communication apparatus for code division multiple access according to an embodiment of the present invention. As shown in FIG. 2, the apparatus includes:
  • the first obtaining module 20 is configured to obtain N modulation symbols obtained by modulating a code block programmed by the channel coder, where N is a positive integer greater than or equal to 2;
  • the extension module 22 is connected to the first obtaining module 20, and is configured to expand the N modulation symbols according to a sequence of N specified lengths, wherein at least two extension sequences of the N specified length extension sequences are different;
  • the transmitting module 24 is connected to the extension module 22 and configured to transmit the extended modulation symbols.
  • the apparatus further includes: a first determining module 26, coupled to the extension module 22, configured to determine the N specified lengths according to an output sequence of the pseudo-random sequence generator.
  • the second obtaining module 28 is connected to the extension module 22 and configured to obtain the extended sequence of the N specified lengths from the preset list according to a preset criterion, wherein the preset list includes multiple sequences.
  • the component module 34 is connected to the second determining module 32, and is configured to sequentially form the obtained R complex elements into the complex sequence of length R, and divide the complex sequence N of length R into the complex sequence of the specified length.
  • the selection module 36 is configured to generate a real part and an imaginary part of all complex elements in the complex sequence using a pseudo-random sequence generator capable of generating an M-ary real number, or to select a complex number from a set of M-ary real numbers with a certain pseudo-random criterion a real part and an imaginary part of all complex elements in the sequence, wherein M is an integer greater than or equal to 2;
  • the third determining module 38 is configured to determine the complex sequence according to the selected real part of the plurality of complex elements and the imaginary part .
  • FIG. 4 is a code division according to an embodiment of the present invention.
  • Step S402 receiving transmission signals transmitted by K transmitters, wherein the transmission signals are respectively extended by the K transmitters by using a spreading sequence of a specified length, and then the expanded modulated signals are respectively modulated to a signal formed by the same time-frequency resource, for each transmitter, there are N extended sequences of a specified length for N modulation symbols, and at least two extended sequences of the N specified length extension sequences are different, N and K is a positive integer;
  • Step S404 detecting the transmitting signal according to the extended sequence.
  • the technical solution for performing the expansion processing on the modulation symbols in each transmitter according to the N spreading sequences having at least two different spreading sequences transmitted by the receiving transmitter is solved, and one user only uses one in the related art.
  • a multi-user communication device for code division multiple access is also provided, which is applied to a receiver, and the device is used to implement the foregoing embodiments and preferred embodiments, and details are not described herein.
  • the term "module” may implement a combination of software and/or hardware of a predetermined function.
  • the apparatus described in the following embodiments is preferably implemented in software, hardware, or a combination of software and hardware, is also possible and contemplated.
  • FIG. 5 is a structural block diagram of a multi-user communication apparatus for code division multiple access according to an embodiment of the present invention. As shown in FIG. 5, the apparatus includes:
  • the receiving module 50 is configured to receive the transmission signals transmitted by the K transmitters, wherein the foregoing transmission signals are respectively extended by the K transmitters by using a spreading sequence of a specified length, and then the expanded modulation is respectively performed.
  • the signal is modulated to a signal formed by the same time-frequency resource.
  • N and K are both positive integers;
  • the detecting module 52 is connected to the receiving module 50 and configured to detect the transmitting signal according to the extended sequence.
  • FIG. 6 is a flowchart of transmitter signal processing according to a preferred embodiment of the present invention.
  • the embodiment provides a multi-user code division multiple access communication method and a corresponding transmitter and receiver.
  • the transmitter (such as a terminal in a transceiver system, also called a terminal transmitter) has a signal processing process as shown in FIG. 6.
  • the data bits to be transmitted are first encoded and modulated to obtain a plurality of data symbols, and the channel encoder is encoded.
  • One code block is modulated to obtain N data symbols, and the N data symbols are extended by N non-identical extension sequences to obtain an extended symbol sequence, and extended by N different extension sequences to reach the user.
  • the purpose of inter-interference randomization; the extended symbol sequence is then modulated by carrier modulation to form a transmit signal and then transmitted.
  • the flow of the multi-user code division multiple access communication method on the transmitter side in the preferred embodiment 1 of the present invention is as shown in FIG. 7, and includes:
  • Step S702 determining N different extension sequences to be used (so that each sequence length is L) is generated by a pseudo-random sequence generator;
  • Step S704 N data symbols modulated by using one channel coding code block to be transmitted by using the N extended sequences are expanded one by one to generate an extended symbol sequence.
  • the extension processing in this step S704 means that each modulated data symbol after coding and modulation is multiplied by each element of a corresponding one L long spreading sequence, and the spreading sequence for different modulation symbols corresponding to one code block is not completely the same. of. Such a modulation symbol spreads to form a symbol sequence of length L, and finally the N modulation symbols corresponding to one code block are expanded to form a symbol sequence of length N ⁇ L.
  • Step S706 transmitting the extended symbol sequence.
  • step S706 preferably, the transmitted signal is formed and transmitted by performing multi-carrier modulation on the extended symbol sequence.
  • the N non-identical L long spreading sequences to be used in the above step S702 are N ⁇ L long sequences generated by some pseudo random sequence generator, and then N ⁇ L long. The sequence is divided into N parts:
  • the N ⁇ L long sequence described above may be directly output by a pseudo-random sequence generator or by repetition;
  • N ⁇ L complex numbers constitute the above-mentioned N ⁇ L long complex sequence
  • N ⁇ L complex numbers constitute the above-mentioned N ⁇ L long complex sequence
  • a pseudo-random integer sequence generator may be directly generated or repeatedly generated by an integer sequence of N ⁇ L length, and then the element of the integer sequence is used as an index to select a corresponding complex number from a complex constellation diagram to constitute the above-mentioned N ⁇ L long complex sequence.
  • N ⁇ L long sequence is equally divided into N segments to form N non-identical L long spreading sequences.
  • Embodiment 2 of the present invention provides a multi-user code division multiple access communication method and a corresponding transmitter and receiver.
  • the transmitter (such as a terminal in a transceiver system, also called a terminal transmitter) has a signal processing process as shown in FIG. 6.
  • the data bits to be transmitted are first encoded and modulated to obtain a plurality of data symbols, and the channel encoder is encoded.
  • One code block is modulated to obtain N data symbols, and the N data symbols are extended by N non-identical extension sequences to obtain an extended symbol sequence, and extended by N different extension sequences to reach the user.
  • the purpose of inter-interference randomization; the extended symbol sequence is then modulated by carrier modulation to form a transmit signal and then transmitted.
  • the flow of the multi-user code division multiple access communication method on the transmitter side of the preferred embodiment of the present invention is as shown in FIG. 8, and includes:
  • Step S802 determining N different extension sequences to be used (each sequence length is L) is selected by a pseudo-random criterion in a table composed of a plurality of L long sequences agreed by one transceiver party. Generated N times;
  • Step S804 N data symbols modulated by using one channel coding code block to be transmitted by using the N extended sequences are expanded and processed one by one to generate an extended symbol sequence.
  • the extension processing in this step means that each modulated data symbol after code modulation is multiplied by each element of a corresponding L long spreading sequence, and the spreading sequences for different modulation symbols corresponding to one code block are not completely identical. .
  • Such a modulation symbol spreads to form a symbol sequence of length L, and finally the N modulation symbols corresponding to one code block are expanded to form a symbol sequence of length N ⁇ L.
  • Step S806 transmitting the extended symbol sequence.
  • the extended symbol sequence is multi-carrier modulated to form a transmit signal and transmit.
  • the N incomplete L long spreading sequences determined to be used in the foregoing step S802 are selected from a table composed of a plurality of L long sequences and selected by a certain pseudo-random criterion N times. .
  • the N different extension sequences may also be composed of a predetermined pseudo-random criterion selected N times from a table composed of L-L long mutually orthogonal sequences.
  • the above-mentioned L-length L orthogonal sequence constitutes an L ⁇ L discrete Fourier transform matrix (DFT matrix), or constitutes an orthogonal matrix, which is an L ⁇ L discrete Fourier A matrix obtained by dividing each element of the transformation matrix by the same value.
  • the above-mentioned L-length L-orthogonal sequences may also constitute an L ⁇ L Hadamard matrix, or form an orthogonal matrix, which is an L ⁇ L Hadamard matrix. The elements are all divided by the matrix of the same value.
  • the above-described L-length L-orthogonal sequences may also constitute an L ⁇ L unit array.
  • a preferred embodiment of the present invention provides a multi-user code division multiple access communication method and a corresponding transmitter and receiver.
  • the transmitter (such as a terminal in a transceiver system, also called a terminal transmitter) has a signal processing process as shown in FIG. 6.
  • the data bits to be transmitted are first encoded and modulated to obtain a plurality of data symbols, and the channel encoder is encoded.
  • One code block is modulated to obtain N data symbols, and the N data symbols are extended by N different extended sequences to obtain an extended symbol sequence, and extended by N different extended sequences.
  • the purpose of randomization of interference between users can be achieved; the extended symbol sequence is transmitted by carrier modulation to form a transmission signal.
  • the flow of the multi-user code division multiple access communication method on the transmitter side of this embodiment is as shown in FIG. 7 or 8, and includes:
  • Step S702 or step S802 determining that the N L-length spreading sequences to be used are all complex spreading sequences, each element of the complex spreading sequence is a complex number, and the real part and the imaginary part of all the elements in the complex extended sequence The values are all from a set of M-ary real numbers, where M is an integer greater than or equal to 2;
  • the M-ary real number set is a set of M real numbers.
  • the M-ary real number set is one of the following sets:
  • the above M is an odd number, and the above-mentioned M-ary real number set is a set of M integers in the range of [-(M-1)/2, (M-1)/2]; or
  • the above M is an even number, and the above-mentioned M-ary real number set is a set of M odd numbers in the range of [-(M-1), (M-1)]; or
  • the above M is an odd number, and the set of M-ary real numbers is composed of M real numbers obtained by multiplying M integers in the range of [-(M-1)/2, (M-1)/2] by corresponding normalization coefficients, respectively. Collection; or
  • the above M is an even number, and the set of M-ary real numbers is a set of M real numbers obtained by multiplying M odd numbers in the range of [-(M-1), (M-1)] by respective normalization coefficients.
  • Step S704 or S804 performing expansion processing on the data symbols to be transmitted by using the above complex spreading sequence to generate an extended symbol sequence;
  • the extension processing in this step refers to each of the coded modulated data symbols and each of the complex extended sequences.
  • the elements (complex symbols) are multiplied by a complex number to form a sequence of complex symbols of the same length as the spreading sequence used.
  • step S706 or S806 the extended symbol sequence is transmitted.
  • the extended symbol sequence is multi-carrier modulated to form a transmit signal and transmit.
  • determining the complex extension sequence to be used in step S702 includes: generating a pseudo-random first real sequence and a second real sequence, wherein values of all elements in the first real sequence and the second real sequence are From the above-mentioned M-ary real number set, and the first real number sequence and the second real number sequence comprise the number of elements equal to the number of elements of the complex sequence N ⁇ L; the ith element of the first real number sequence is used as the real The ith element of the second real sequence is used as an imaginary part, and a complex number including the real part and the imaginary part is used as the upper part
  • N ⁇ L, L is an integer greater than or equal to 2; the obtained N ⁇ L elements are sequentially formed into the above-mentioned N ⁇ L long complex sequence And dividing the above-mentioned N ⁇ L long complex sequence into N parts to form N L-length spreading sequences, or multiplying the N parts L complex numbers by corresponding energy normalization coefficients to form the above-mentioned N pieces in sequence L long complex extension sequence.
  • the determining the complex extension sequence to be used in step S702 includes: determining the complex extension sequence to be used, comprising: generating a pseudo-random integer sequence, the integer sequence having N ⁇ L elements and wherein The values of all elements are derived from a set of M ⁇ M-ary integers, which are a set of all integers in the range [0, M ⁇ M-1] or [1, M ⁇ M], L is an integer greater than or equal to 2; according to the N ⁇ L elements in the pseudo-random integer sequence, the corresponding N ⁇ L constellation points are selected from a complex constellation of M ⁇ M points according to a preset mapping rule; Determining N ⁇ L complex numbers corresponding to the N ⁇ L constellation points, and dividing the above-mentioned N ⁇ L long complex sequence into N parts to form N L-length spreading sequences, or multiplying the N parts L complex numbers The N L long complex extension sequences are sequentially formed by sequentially normalizing the coefficients with the corresponding energy.
  • the transmitter in the multi-user code division multiple access communication system of this embodiment is as shown in FIG. 9, and includes:
  • the sequence determining means 90 is configured to determine N spreading sequences to be used, the N extended sequences are not identical, and each element of all sequences is a complex number, and the real and imaginary parts of all elements in the complex extended sequence The values are all from a set of M-ary real numbers, where M is an integer greater than or equal to 2.
  • the expansion device 92 is configured to perform expansion processing on the data symbols to be transmitted by using the complex extension sequence to generate an extended symbol sequence.
  • Signal transmitting device 94 is configured to transmit the expanded sequence of symbols.
  • the extended symbol sequence is multi-carrier modulated to form a transmit signal and transmit.
  • the values of the real part and the imaginary part of all the elements in the complex extended sequence determined by the sequence determining means 90 are derived from a set of real numbers of M elements, wherein:
  • the above M is an odd number, and the above-mentioned M-ary real number set is a set of M integers in the range of [-(M-1)/2, (M-1)/2]; or
  • the above M is an even number, and the above-mentioned M-ary real number set is a set of M odd numbers in the range of [-(M-1), (M-1)]; or
  • the above M is an odd number, and the set of M-ary real numbers is composed of M real numbers obtained by multiplying M integers in the range of [-(M-1)/2, (M-1)/2] by corresponding normalization coefficients, respectively. Collection; or
  • the above M is an even number, and the set of M-ary real numbers is a set of M real numbers obtained by multiplying M odd numbers in the range of [-(M-1), (M-1)] by respective normalization coefficients.
  • the transmitter uses a specific complex sequence as a spreading sequence to spread the data symbols to be transmitted and the receiver to identify the signal transmitted by the transmitter; the plurality of transmitters simultaneously transmit information to the receiver through the same time-frequency resource.
  • each transmitter separately spreads the data symbols to be transmitted by using respective complex spreading sequences, so that the receiver can recognize signals transmitted by different transmitters.
  • each user expands its modulation symbols using a plurality of different spreading sequences, the interference between users can be effectively randomized or averaged.
  • the complex sequence that is, each element in the sequence is a complex number
  • the solution can achieve better code division multiple access performance, thereby supporting a higher system overload level and improving the user's non-orthogonal overload access and communication experience.
  • a preferred embodiment 4 of the present invention relates to a receiver-side multi-user code division multiple access communication method and a corresponding receiver.
  • the receiver (such as a base station in a transceiver system) receives signals and processes as shown in FIG. Figure 10 shows the signals transmitted by K transmitters (the processing when each transmitter transmits a signal is shown in Figure 6). After airborne wireless propagation, the receiver receives the signals transmitted by K transmitters. The superimposed signal, the interference cancellation signal detector performs reception detection on the superimposed signal, and obtains data transmitted by each transmitter.
  • the interference cancellation signal detector is a Serial Interference Cancellation (SIC) signal detector.
  • SIC Serial Interference Cancellation
  • FIG. 11 shows a flow of a multi-user code division multiple access communication method on the receiver side, including:
  • Step S1102 Receive signals transmitted by multiple transmitters, where the signals transmitted by the multiple transmitters are extended by the plurality of transmitters respectively using respective extension sequences, and then the generated extended symbols are generated.
  • the symbol sequences are respectively modulated onto the same time-frequency resource;
  • each of the above-mentioned transmitters adopts a different extended sequence, which is generated by a pseudo-random sequence generator, or a table composed of a plurality of L long sequences agreed by a transmitting and receiving party. It is generated by selecting several times with a certain pseudo-random criterion.
  • Step S1104 The interference cancellation signal detector is used to perform reception detection on the received signals transmitted by the plurality of transmitters, and the extended sequence used by the plurality of transmitters is used in the detection.
  • the preferred embodiment of the present invention does not impose any limitations on a particular method of receiving detection. However, during the detection process, the receiver needs to use the spreading sequence used by the above multiple transmitters to identify the signals transmitted by the respective terminals.
  • the receiver in the multi-user code division multiple access communication system of this embodiment is as shown in FIG. 12, and includes:
  • the signal receiving device 1200 is configured to receive signals transmitted by the plurality of transmitters, and the signals transmitted by the plurality of transmitters are respectively extended by the plurality of transmitters by using respective extended sequences to process data symbols to be sent, and then generated The expanded symbol sequences are respectively modulated onto the same time-frequency resource;
  • the receiving detecting means 1202 is configured to receive and detect the received signals transmitted by the plurality of transmitters by using an interference cancellation signal detector, and use the spreading sequence adopted by the plurality of transmitters in the detecting.
  • the number of the foregoing spreading sequences is the same as the number of modulation symbols corresponding to one channel coded code block, and is not completely the same.
  • the schemes of the above preferred embodiment 1 and the preferred embodiment 2 can be applied to the MC in specific applications.
  • the CDMA system can be applied to a contention access scenario, a schedule-free access scenario, and the like.
  • the transmitter uses the above-mentioned N different spreading sequences to spread the N modulation symbols corresponding to one code block (that is, the number of spreading sequences and the number of modulation symbols corresponding to the channel coding code block)
  • the extended symbol sequence is obtained and then sent to the receiver; multiple transmitters can use the same frequency domain bandwidth or subcarrier resources.
  • the receiver uses the interference cancellation signal detector to receive and detect the signals transmitted by the multiple transmitters, which can effectively distinguish multiple terminals using the same time-frequency resource, thereby effectively improving
  • the system capacity which loads more terminal accesses under certain transmission rate conditions, supports higher system overload levels, and improves user non-orthogonal overload access and communication experience.
  • each terminal transmitter When applied to a contention access scenario, multiple or even a large number of user terminals request an access system at the same time, and each terminal transmitter separately performs transmission processing on the transmitted data symbols by using the above specific extension sequence, and then the receiver uses an interference cancellation signal detector. Receiving and detecting the signals transmitted by the respective terminal transmitters can effectively distinguish the signals transmitted by the respective terminals, thereby supporting a higher system overload level, effectively improving system access efficiency, and improving the terminal access experience.
  • the user terminal When applied to a schedule-free access scenario, the user terminal needs to transmit data on the available time-frequency resources, and there are multiple user terminals simultaneously using the same time-frequency resource for data transmission; each terminal transmitter Transmitting the transmitted data symbols by using the above specific spreading sequence, respectively, and receiving
  • the machine uses the interference cancellation signal detector to receive and detect the signals transmitted by each terminal transmitter, which can effectively distinguish the signals transmitted by each terminal, thereby supporting a higher system overload level and improving the experience of the user terminal from scheduling access and communication. It can reduce system scheduling signaling and reduce terminal access delay.
  • the embodiment provides a method for generating N L long complex extension sequences.
  • the transmitter first generates an N ⁇ L long complex sequence according to two pseudo-random real numbers, and all the two pseudo-random real numbers are in the sequence.
  • the values of the elements are all derived from the M-ary real number set as described in the third embodiment, and the lengths of the two pseudo-random real numbers are the same as the length of the complex extended sequence.
  • the N ⁇ L long complex sequence is equally divided into N segments to generate the required N L long complex spreading sequences.
  • two pseudo-random real numbers are respectively generated independently by two pseudo-random sequence generators in the transmitter, as shown in FIG. 13, the first pseudo-random sequence generator generates a length of N ⁇ L.
  • the second pseudo-random sequence generator generates a pseudo-random second real sequence of length N x L.
  • a pseudo-random basic real sequence of length 2 ⁇ N ⁇ L is generated by a pseudo-random sequence generator in the transmitter, and all elements in the basic real sequence are The values are all obtained from the M-ary real number set as described in Embodiment 3, and then the pseudo-random basic real sequence is serial-to-parallel transformed or segmented or periodically sampled to form a pseudo-random first with a length of N ⁇ L.
  • a real sequence and a pseudorandom second real sequence are examples of the basic real sequence.
  • the length of the pseudo-random base real sequence is assumed to be 2 ⁇ N ⁇ L, and the element index initial value of the basic real sequence is set to zero. This is equivalent to the fact that the elements of the even position of the base real sequence form a pseudo-random first real sequence, the elements of the odd-numbered positions of the base real sequence form a pseudo-random second real sequence.
  • the element in a part of the position can be periodically extracted from the basic real sequence as the pseudo-random first real sequence, and the same reason.
  • the element at another partial position is periodically taken out as a pseudo-random second real sequence.
  • the first real sequence is pseudo-random.
  • the individual elements are added bit by bit to generate a complex extension sequence, expressed as:
  • the values of all elements in the pseudo-random first real sequence and the second real sequence are from the 3-ary real set ⁇ 1, 0, -1 ⁇ .
  • the pseudo-random second real sequence is "1, -1, 0, -1, 1, 0, -1, 1”
  • each element is subjected to a 90° phase shift, which is equivalent to multiplying by ej ⁇ /2.
  • the generated complex sequence may be further energy normalized, that is, after multiplying each complex number in the complex sequence by the corresponding energy normalization coefficient, the obtained complex sequence is used as the complex extension sequence.
  • the energy normalized complex sequence is: "(-1+j)/sqrt(12), -j/sqrt(12), 1/sqrt(12), (1-j)/sqrt(12), (-1+j)/sqrt(12), 1/sqrt(12), (-1-j)/sqrt(12), j/sqrt(12)", where sqrt() represents a square root operation.
  • phase shift may also take other values between 0 and 2 ⁇ , such as 270° (or 3 ⁇ /2), -90° (or - ⁇ /2), -270° (or -3 ⁇ /2), and the like.
  • the above pseudo-random sequence generator may be constituted by a linear feedback shift register, as shown in FIG. 15, assuming that the pseudo-random sequence generator is composed of an n-stage linear feedback shift register for generating a pseudo-random real number of length Mn-1.
  • the two can use the same or different feedback functions or feedback join polynomials.
  • a preferred embodiment 6 of the present invention provides a method of generating N L long complex extension sequences, the principle of which is shown in FIG. 16 or FIG.
  • the transmitter generates an N ⁇ L long complex spreading sequence according to two N ⁇ L long pseudo-random real numbers, and finally divides the N ⁇ L long complex sequence into N segments to generate a required N L-length complex numbers. Extended sequence.
  • the process of generating the two pseudo-random real numbers is as described in Embodiment 5.
  • a pseudo-random first real sequence and a pseudo-random second real number are obtained according to a mapping relationship between two N ⁇ L pseudo-random real numbers and a complex constellation.
  • the sequence is mapped bit by bit to the complex constellation diagram to generate a complex extension sequence, which is expressed as:
  • the values of all elements in the pseudo-random first real sequence and the second real sequence are from the 3-ary real set ⁇ 1, 0, -1 ⁇ .
  • the predefined complex constellation is formed by 9 complex coordinates 1+j, j, -1+j, 1, 0, -1, 1-j, -j, -1-j 9 constellation points, and the predefined (Seq1i, Seq2i) values are mapped to complex 1+j when the value is (1, 1), and complex j is obtained when the value is (0, 1), and the value is (-1).
  • the time map is complex -1+j, the mapping is complex 1 when (1,0), the complex number is 0 when the value is (0,0), and the complex number is when the value is (-1,0)- 1.
  • the value is (1, -1)
  • it is mapped to the complex number 1-j.
  • the value is (0, -1)
  • it is mapped to the complex number -j.
  • the value is (-1, -1)
  • it is mapped to the complex number - 1-j, as shown in Figure 13.
  • the pseudo-random first real sequence is "-1, 0, 1, 1, -1, 1, -1, 0”
  • the pseudo-random second real sequence is "1, -1” , 0, -1, 1, 0, -1, 1" according to the mapping relationship between two pseudo-random real numbers and a 9-point complex constellation, the pseudo-random first real sequence, pseudo-random second The real sequence is mapped bit by bit to the complex constellation points on the 9-point complex constellation, and the complex sequence is: "-1+j, -j, 1, 1-j, -1+j, 1, -1-j, j", the sequence can be used as a generated complex extension sequence.
  • the complex extension sequence can be further energy normalized and used as the complex extension sequence.
  • the energy normalization coefficient used may also be the reciprocal of the sum of the energy of the nine complex constellation points on the complex constellation.
  • the values of all elements in the pseudo-random first real sequence and the second real sequence are from the 4-ary real set ⁇ 3, 1, -1, and -3 ⁇ .
  • the predefined complex constellation is 16 complex coordinates 3+3j, 3+j, 3-j, 3-3j, 1+3j, 1+j, 1-j, 1-3j 16 constellation points formed by -1+3j, -1+j, -1-j, -1-3j, -3+3j, -3+j, -3-j, -3-3j, and predefined (Seq1i, Seq2i) is mapped to a complex number 3+3j when the value is (3, 3), and is mapped to a complex number 3+j when the value is (3, 1), and is mapped to a complex number when the value is (3, -1) 3-j, (3, -3) is mapped to complex 3-3j, (1,3) is mapped to complex 1+3j, and when it is (1,1),
  • (1, -1) is mapped to the complex number 1-j
  • (1, -3) is mapped to the complex number 1-3j
  • (-1, 3) is mapped to the complex number -1 + 3j
  • the value is (-1, 1)
  • the time map is a complex number -1+j, the value is (-1, -1) when mapped to the complex number -1j, and the (-1, -3) is mapped to the complex number -1-3j, (-3, 3)
  • the time map is complex -3 + 3j, the value is (-3, 1), the map is complex -3 + j, and the value is (-3, -1), the map is complex -3-j, (- 3, -3) is mapped to the complex number -3-3j, as shown in FIG.
  • the pseudo-random first real sequence is "-1, 3, 1, -3, 1, 3, -1, -3”
  • the pseudo-random second real sequence is "3, 1 , -3, -1, 1, -1, -3, 3”
  • the pseudo-random first real sequence and the second real sequence are based on a mapping relationship between two pseudo-random real numbers and a 16-point complex constellation
  • the bitwise mapping is mapped to the complex constellation points on the 16-point complex constellation, and the complex sequence is: "-1+3j, 3+j, 1-3j, -3-j, 1+j, 3-j, -1 -3j, -3-3j"
  • the sequence can be used as the generated complex extension sequence.
  • the complex sequence may be further energy normalized and used as the complex extension sequence.
  • the set of values of the elements of the two pseudo-random real sequences may also be numbered by a binary index, for example, (1, 1) 0000, (-1, 1) is represented as 0001, ..., (3, -3) is represented as 1111; similarly, the 16 complex constellation points of the 16-point complex constellation are also numbered according to the same rule, for example, 1+j Expressed as 0000, -1+j is represented as 0001,...,3-3j is represented as 1111, that is, each value set of elements of two quaternary pseudo-random sequences forms a one-to-one correspondence with 16 complex constellation points; then, According to the mapping relationship, the generated two pseudo-random real numbers are collectively mapped bit by bit to the constellation points on the 16 complex constellation diagrams to obtain a complex sequence, and the complex sequence is used as the complex extended sequence, or the complex number The sequence is subjected to energy normalization to obtain the above complex extension sequence.
  • the pseudo-random first real sequence is "01100011”
  • the pseudo-random second real sequence is "10111010”
  • two elements are simultaneously extracted from the pseudo-random first real sequence and the pseudo-random second real sequence, and then the mapping is performed. (01, 10) is mapped to the complex constellation points indicated by 0110 on the 16-point complex constellation diagram, (10, 11) is mapped to the complex constellation points indicated by 1011 on the 16-point complex constellation, and so on.
  • the above complex constellation diagram and the mapping relationship between two pseudo-random real number sequences and complex constellation diagrams may also be defined in other forms, and may also define a complex constellation diagram composed of more complex constellation points and more than two pseudo-frames.
  • the mapping relationship between the random real sequence and the complex constellation is similar to the above principle and will not be described again.
  • a preferred embodiment of the present invention provides a method for generating N L long complex extension sequences, the principle of which is shown in FIG. 20 or FIG.
  • the transmitter is a sequence of pseudo-random integers of length N ⁇ L.
  • the above-mentioned sequence of integers has N ⁇ L elements and the values of all the elements are derived from a set of M ⁇ M (M by M) meta integers.
  • ⁇ M yuan The set of integers is a set of all integers in the range [0, M ⁇ M-1] or [1, M ⁇ M], where M and L are integers greater than or equal to 2;
  • the corresponding N ⁇ L constellation points are selected from a complex constellation of M ⁇ M points according to a preset mapping rule to form a complex sequence of N ⁇ L length.
  • the N ⁇ L long complex sequence is equally divided into N segments to generate the required N L long complex spreading sequences.
  • the N sets of L complex sequences are multiplied by the corresponding energy normalization coefficients to form the above-mentioned N L long complex spread sequences.
  • the complex extension sequence here is the same as that of the third embodiment, wherein each element is a complex number, and the values of the real part and the imaginary part of all elements in the above complex extension sequence are derived from a set of M-ary real numbers.
  • the pseudo-random integer sequence described above may be generated by a pseudo-random sequence generator, which may be constructed of a linear feedback shift register as described in the fifth embodiment.
  • the transmitter generates a pseudo-random integer sequence, and the element values of the integer sequence are all from a 9-ary integer set ⁇ 0, 1, 2,... ,8 ⁇ .
  • Mapping the pseudo-random integer sequence bit by bit to a 9-point complex constellation according to the mapping relationship between the elements in the 9-ary integer set and the complex constellation points of the M ⁇ M 9-point complex constellation (as shown in FIG. 20)
  • the complex constellation points (each complex constellation point represents a complex number) generate a complex extension sequence, which is formulated as follows:
  • the transmitter generates a pseudo-random integer sequence
  • the complex constellation points of the 16-point complex constellation diagram generate a complex extension sequence, which is expressed as follows:
  • M ⁇ M-ary integer set M ⁇ M-point complex constellation diagram, and the mapping relationship between the two may also be defined as other forms, which are similar to the above principles and will not be described again.
  • the embodiment of the invention provides a method for generating N L long extended sequences, as follows:
  • the above-mentioned N different extension sequences may also be formed by a certain pseudo-random criterion selected N times from a table composed of a plurality of L long sequences which are agreed by both the transmitting and receiving parties.
  • the terminal transmitter selects N L-length extended sequences from the sequence set according to a randomly generated index or an index calculated according to a predefined formula, or the base station notifies the terminal of the selection method of the extended sequence by signaling.
  • the transmitter and the terminal transmitter obtain the sequence from the sequence set or the sequence table as the extended sequence according to the selection method.
  • Table 1 is a system-predefined complex sequence set, and the complex sequence set includes n complex sequences, each sequence having a length of L:
  • the terminal transmitter randomly generates N pseudo-random integers between 0 and n-1 as a table index, and if the first index generated is 1, select a complex sequence with index 1 as the first one from Table 1.
  • the base station notifies the terminal transmitter of the index generation method of the complex extension sequence by using signaling, for example, the first index generated by the base station by the signaling index generation method is 1, and the terminal transmitter according to the The index selects the complex sequence with index 1 from Table 1 as the extended sequence of its first modulation symbol.
  • all or part of the steps of the above embodiments may also be implemented by using an integrated circuit. These steps may be separately fabricated into individual integrated circuit modules, or multiple modules or steps may be fabricated into a single integrated circuit module. achieve. Thus, the invention is not limited to any specific combination of hardware and software.
  • a storage medium is further provided, wherein the software includes the above-mentioned software, including but not limited to: an optical disk, a floppy disk, a hard disk, an erasable memory, and the like.
  • the embodiment of the present invention achieves the following technical effects: solving the problem that the user inter-user interference caused by a user using only one extended sequence to spread all modulation symbols cannot be effectively randomized or averaged in the related art.
  • the problem is that each access user can use a plurality of different spreading sequences to expand its modulation symbols, so that interference between users can be effectively randomized or averaged, and the performance of multiple access is improved.
  • modules or steps of the present invention described above can be implemented by a general-purpose computing device that can be centralized on a single computing device or distributed across a network of multiple computing devices. Alternatively, they may be implemented by program code executable by the computing device such that they may be stored in the storage device by the computing device and, in some cases, may be different from the order herein.
  • the steps shown or described are performed, or they are separately fabricated into individual integrated circuit modules, or a plurality of modules or steps thereof are fabricated as a single integrated circuit module.
  • the invention is not limited to any specific combination of hardware and software.
  • the above technical solution provided by the present invention can be applied to a multi-user communication process of code division multiple access, and a technical solution for expanding modulation symbols by using N extended sequences with at least two different spreading sequences is solved, and the related solution is solved.
  • a user only uses one extended sequence to spread all modulation symbols, and the inter-user interference is not effectively randomized or averaged, which improves the multi-access performance, and each access user can use multiple Different spreading sequences extend their modulation symbols so that interference between users can be effectively randomized or averaged.

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Quality & Reliability (AREA)
  • Digital Transmission Methods That Use Modulated Carrier Waves (AREA)
  • Mobile Radio Communication Systems (AREA)

Abstract

本发明提供了一种码分多址接入的多用户通信方法及装置，其中，所述方法包括：获取信道编码器编出的码块经调制后所得的N个调制符号，其中，N为大于或者等于2的正整数；根据N个指定长度的扩展序列对所述N个调制符号进行扩展，其中，所述N个指定长度的扩展序列中至少存在两个扩展序列不同；发送扩展后的调制符号。采用本发明提供的上述技术方案，解决了相关技术中一个用户只使用一条扩展序列对全部调制符号进行扩展而导致的用户间干扰得不到有效的随机化或者平均化的问题，改善了多接入性能，每个接入用户可以使用多种不同的扩展序列对其调制符号进行扩展的，这样用户间的干扰可以有效的随机化或者说平均化。

Description

码分多址接入的多用户通信方法及装置 技术领域
本发明涉及通信领域，具体而言，涉及一种码分多址接入的多用户通信方法及装置。
背景技术
上行多用户接入可以通过不同的多址接入技术如：时分多址(Time Division Multiple Access，TDMA)，频分多址(Frequency Division Multiple Access，FDMA)，码分多址(Code Division Multiple Access，CDMA)和空分多址(Space Division Multiple Access，SDMA)。其中多用户码分多址接入通信技术是上行多用户接入通信技术的一个非常重要的类别，可以提供优良的接入性能，因而已被多个无线通信标准所采纳。
采用码分多址接入的接入过程中，首先，每个接入终端都先用一定长度的扩展序列(如，长度为L的扩展序列是指这个扩展序列由L个符号构成，也可以说是由L个元素构成，此处的L个符号/L个元素可以是L个数字符号)对数字幅相调制后的数据符号进行扩展。扩展过程是指每个已调制的数据符号与扩展序列的每个符号相乘，最终形成与所用扩展序列长度相同的符号序列的过程。扩展过程中每个已调制的数据符号(例如采用正交振幅调制(Quadrature Amplitude Modulation，简称为QAM)调制后的星座点符号)与扩展序列的每个符号相乘，最终每个已调制的数据符号会被扩展成为与所用扩展序列长度相同的符号序列，如使用长度为L的扩展序列则每个已调制符号会被扩展成L个符号，也可以说每一个已调制的数据符号承载在一条长度为L的扩展序列上了。然后，所有接入终端的扩展后符号序列可以在相同的时频资源上发送。最后，基站收到的是所有接入终端的扩展信号叠加在一起的合信号，并通过多用户接收机技术从合信号中分离出各个终端的有用信息。
应用码分多址接入的通信技术常被归为扩频通信的类别，这是因为终端的调制符号会被扩展为L倍的符号，如果扩展后的L倍符号的传输时间要求等于扩展前调制符号的话，则所需的带宽必然会扩展L倍。这也是为什么扩展序列常称为扩频序列。
如果每个终端的扩展后符号是通过多载波技术(如Orthogonal Frequency Division Multiplexing，简称为OFDM)，滤波器组多载波(filter bank multi-carrier，简称为FBMC))来传输，则这两种技术的结合就是被称为多载波码分多址接入(Multi-Carrier Code Division Multiple Access，MC-CDMA)的技术。
码分多址接入技术中，发射侧的扩展过程倒是比较简单的，只需把每个调制符号，如每个QAM调制后的符号，与一条长度为L的扩展序列的每个符号相乘就可以得到扩展后的L个符号，然后扩展后的符号就可以通过单载波或多载波技术发射出去。相对的，基站的接收过程并不简单。
如何取得优良的码分多址接入性能？或更直接的说基站怎样才能准确地从合信号中分离出各终端的有用数据信息？这就是码分多址系统的关键，主要涉及两个方面：扩展序列和接收机，扩展序列的选取是性能基础，接收机的设计是性能保障。
具体来讲，要取得优良的接入性能，不同终端采用的扩展序列首先需要有良好的互相关特性。如果扩展序列是直接在无线多径信道中传输的话，如单载波的码分复用技术，则还要求序列具有良好的自相关特性来对抗序列自身的时延多径扩展。
多载波码分复用技术由于可以依靠多载波技术来对抗多径，所以扩展序列可以只需考虑利于多用户信息分离的互相关特性。这也是单载波码分复用与多载波码分复用两种技术对序列选取的最大区别！
良好的扩展序列是性能的基础，最终多用户信息的分离是在基站侧完成的，基站采用不同的多用户接收技术会取得相应的性能。要获取最优的多用户数据分离性能，基站需要采用高性能、但高复杂度的多用户接收机技术，如串行干扰消除接收机技术。
正因为扩展序列的重要性，不同的码分多址接入技术主要区别在于扩展序列的选取上。直接序列扩频码分多址接入(Direct Sequence-Code Division Multiple Access，DS-CDMA)技术是最为常用的码分多址接入技术，已经被多种无线通信标准采纳为上行多用户接入技术，其扩展序列是基于最简单的二元伪随机(Pseudo-Noise，PN)实数序列的。由于序列的简单性，基于PN序列的DS-CDMA也是多载波码分复用的最主要技术之一，在此技术中，每个已调制符号会先被一个二元伪随机实数序列扩展，然后再通过多载波技术发射出去。
二元伪随机实数序列还可以称为二进制伪随机序列，序列中的每个符号取值通常表示为0或1，也可以进一步表示为双极性序列，即0表示为+1，1表示为-1，或者，0表示为-1，1表示为+1。
扩展序列的长度也是码分多址技术的一个关键量。扩展序列越长，各终端所采用的扩展序列之间的低互相关度越容易保证，并且，越容易找到更多的具有低互相关的序列，从而支持更多的同时接入终端。如果同时接入的终端数量大于扩展序列的长度， 则可以说该多用户接入系统处于过载状态了。值得一提的是，能实现系统过载是码分多址接入技术在未来无线通信中大放光彩的关键属性之一。
为了提供灵活的系统设计，支持更多的用户同时接入，通常接入终端采用的扩展序列不是互相正交，从多用户信息论角度而言，上行采用非正交的多址方式是可以取得比正交多址方式更大的系统容量或边缘吞吐量的。因为各终端的扩展序列不是互相正交，所以一般情况下每个用户的解调性能会随着同时接入用户数量的增加而变差。当系统过载时，多用户之间的干扰会变得更加严重。目前码分多址技术的一种较大的应用场景是随机接入或者竞争资源的接入。由于各接入用户对自己调制符号用扩展序列扩展后是在相同的时频资源里发射的，因此是竞争地使用相同时频资源的。
在相关技术中，码分多址的一个重要的制约性能的因素是一个用户只使用一条扩展序列对全部调制符号进行扩展，即全部调制符号都使用相同的序列进行扩展。这种方式对接收机采用串行干扰消除技术是实现上有便利的，可以简化串行干扰消除的实现过程，但单一扩展序列的方案由于其用户间干扰得不到有效的随机化或者说平均化，因而其对非正交码分多址的接入性能是不利的。
针对相关技术中，一个用户只使用一条扩展序列对全部调制符号进行扩展而导致的用户间干扰得不到有效的随机化或者平均化的问题，尚未提出有效的技术方案。
发明内容
为了解决上述技术问题，本发明实施例提供了一种码分多址接入的多用户通信方法及装置。
根据本发明的一个实施例，提供了一种码分多址接入的多用户通信方法，应用于发射机，包括：获取信道编码器编出的码块经调制后所得的N个调制符号，其中，N为大于或者等于2的正整数；根据N个指定长度的扩展序列对所述N个调制符号进行扩展，其中，所述N个指定长度的扩展序列中至少存在两个扩展序列不同；发送扩展后的调制符号。
在本发明实施例中，通过以下之一方式获取所述N个指定长度的扩展序列：根据伪随机序列发生器的输出序列确定所述N个指定长度的扩展序列；按照预设准则从预设列表中获取所述N个指定长度的扩展序列，其中，所述预设列表中包含有多个长度为所述指定长度的序列。
在本发明实施例中，根据伪随机序列发生器的输出序列确定所述N个指定长度的扩展序列包括：所述伪随机序列发生器生成长度为R的序列，其中R＝N×L，L为所述指定长度所指示的值；将所述长度为R的序列等分成N个指定长度的序列；将所述N个指定长度的序列作为所述N个指定长度的扩展序列。
在本发明实施例中，根据伪随机序列发生器的输出序列确定所述N个指定长度的扩展序列包括：所述伪随机序列发生器生成长度为预设长度的序列；将所述预设长度的序列重复指定次数生成长度为R的序列，其中R＝N×L，L为所述指定长度所指示的值；将所述长度为R的序列等分成N个指定长度的序列；将所述N个指定长度的序列作为所述N个指定长度的扩展序列。
在本发明实施例中，所述预设列表中有L条长度均为L的序列，所述序列构成L阶正交矩阵，其中，L为所述指定长度所指示的值。
在本发明实施例中，所述序列构成L阶正交矩阵，包括：所述L条长度为L的序列排列成L×L离散傅里叶变换矩阵；或者，所述L×L离散傅里叶变换矩阵中每个元素乘以第一预定值构成所述L阶正交矩阵。
在本发明实施例中，所述序列构成L阶正交矩阵，包括：所述L条长度为L的序列排列成L×L哈达玛矩阵；或者，所述L×L哈达玛矩阵中每个元素乘以第二预定值构成所述L阶正交矩阵。
在本发明实施例中，所述正交矩阵为单位矩阵。
在本发明实施例中，所述扩展序列包括以下至少之一：实数序列，复数序列。
在本发明实施例中，通过以下方式确定所述复数序列：根据第一伪随机序列发生器产生长度为R的第一实数序列，根据第二伪随机序列发生器产生长度为R的第二实数序列，其中，R＝N×L，L为所述指定长度所指示的值；将所述第一实数序列的第i个元素作为所述复数序列的实部，将所述第二实数序列的第i个元素作为所述复数序列的虚部，将包含所述实部和所述虚部的复数作为所述复数序列的第i个复数元素，其中，i＝1，2，3……，R；将得到的R个复数元素依次组成所述长度为R的复数序列，将所述长度为R的复数序列N等分为所述指定长度的复数序列。
在本发明实施例中，将所述长度为R的复数序列N等分为所述指定长度的复数序列之后，还包括：将N个所述指定长度的复数序列分别乘以所述N个指定长度的复数序列的能量归一化系数后得到归一化后的N个指定长度的复数序列。
在本发明实施例中，通过以下方式确定所述复数序列：根据伪随机序列发生器产生长度为R的整数序列，其中，所述整数序列的元素来自整数集合{0，1，……，D}或者集合{1，2，……，D}，R＝N×L，L为所述指定长度所指示的值，D为复数星座图中星座点的数量；将所述长度为R的整数序列的元素按照预设映射规则在复数星座图中与选取与所述元素对应的星座点；根据所述星座点确定所述复数序列。
在本发明实施例中，通过以下方式确定所述复数序列：使用能产生M元实数的伪随机序列产生器产生所述复数序列中所有复数元素的实部和虚部，或者从M元实数集合中以一定伪随机准则选取所述复数序列中所有复数元素的实部和虚部，其中，M为大于或者等于2的整数。
在本发明实施例中，所述M元实数集合满足以下至少之一条件：所述M是奇数，所述实数集合是[-(M-1)/2,(M-1)/2]范围内的M个整数组成的集合；所述M是偶数，所述实数集合是[-(M-1),(M-1)]范围内的M个奇数组成的集合；所述M是奇数，所述实数集合是[-(M-1)/2,(M-1)/2]范围内的M个整数分别乘以所述实数集合相应的能量归一化系数得到的M个实数组成的集合；所述M是偶数，所述实数集合是[-(M-1),(M-1)]范围内的M个奇数分别乘以所述实数集合相应的能量归一化系数得到的M个实数组成的集合。
在本发明实施例中，通过以下方式确定所述复数序列：根据所述M元实数集合生成长度为R的第一实数序列和长度为R的第二实数序列，其中，所述第一实数序列和所述第二实数序列均从所述M元实数集合取值，其中R＝N×L，L为所述指定长度所指示的值；将所述第一实数序列的第i个元素作为所述复数序列的实部，将所述第二实数序列的第i个元素作为所述复数序列的虚部，将包含所述实部和所述虚部的复数作为所述复数序列的第i个复数元素，其中，i＝1，2，3……，R；将得到的R个元素依次组成所述长度为R的复数序列，将所述长度为R的复数序列N等分为所述指定长度的复数序列。
在本发明实施例中，将所述长度为R的复数序列N等分为所述指定长度的复数序列之后，还包括：将N个所述指定长度的复数序列分别乘以所述N个指定长度的复数序列的能量归一化系数后得到归一化后的N个指定长度的复数序列。
在本发明实施例中，通过以下方式确定所述复数序列：生成长度为R的整数序列，其中，所述整数序列取值来自M×M元整数集合，所述M×M元整数集合是[0，M×M-1]或[1，M×M]范围内的所有整数组成的集合；将所述长度为R的整数序列的元素 按照预设映射规则在复数星座图中与选取与所述元素对应的星座点；根据所述星座点确定所述复数序列。
在本发明实施例中，所述M取值包括以下至少之一：2、3、4。
在本发明实施例中，发送扩展后的调制符号包括：将所述调制符号进行多载波调制；将调制后的调制符号作为所述发射机的发射信号。
根据本发明实施例的另一个实施例，还提供了一种码分多址接入的多用户通信方法，应用于接收机，包括：接收K个发射机发射的发射信号，其中，所述发射信号为所述K个发射机分别采用指定长度的扩展序列对调制信号进行扩展处理后，再分别将所述扩展后的调制信号调制到相同时频资源形成的信号，对于每一个发射机，针对N个调制符号，存在有N个指定长度的扩展序列，且所述N个指定长度的扩展序列中至少存在两个扩展序列不同，N和K均为正整数；根据所述扩展序列对所述发射信号进行检测。
根据本发明实施例的另一个实施例，还提供了一种码分多址接入的多用户通信装置，应用于发射机，包括：第一获取模块，用于获取信道编码器编出的码块经调制后所得的N个调制符号，其中，N为大于或者等于2的正整数；扩展模块，用于根据N个指定长度的扩展序列对所述N个调制符号进行扩展，其中，所述N个指定长度的扩展序列中至少存在两个扩展序列不同；发送模块，用于发送扩展后的调制符号。
在本发明实施例中，所述装置还包括：第一确定模块，用于根据伪随机序列发生器的输出序列确定所述N个指定长度的扩展序列；第二获取模块，用于按照预设准则从预设列表中获取所述N个指定长度的扩展序列，其中，所述预设列表中包含有多个长度为所述指定长度的序列。
在本发明实施例中，所述扩展序列包括以下至少之一：实数序列、复数序列，所述装置还包括：产生模块，用于根据第一伪随机序列发生器产生长度为R的第一实数序列，根据第二伪随机序列发生器产生长度为R的第二实数序列，其中，R＝N×L，L为所述指定长度所指示的值；第二确定模块，用于将所述第一实数序列的第i个元素作为所述复数序列的实部，将所述第二实数序列的第i个元素作为所述复数序列的虚部，将包含所述实部和所述虚部的复数作为所述复数序列的第i个复数元素，其中，i＝1，2，3……，R；组成模块，用于将得到的R个复数元素依次组成所述长度为R的复数序列，将所述长度为R的复数序列N等分为所述指定长度的复数序列。
在本发明实施例中，所述产生模块，还用于根据伪随机序列发生器产生长度为R的整数序列，其中，所述整数序列的元素来自整数集合{0，1，……，D}或者集合{1，2，……，D}，R＝N×L，L为所述指定长度所指示的值，D为复数星座图中星座点的数量；选取模块，用于将所述长度为R的整数序列的元素按照预设映射规则在复数星座图中与选取与所述元素对应的星座点；第三确定模块，用于根据所述星座点确定所述复数序列。
在本发明实施例中，所述选取模块，用于使用能产生M元实数的伪随机序列产生器产生所述复数序列中所有复数元素的实部和虚部，或者从M元实数集合中以一定伪随机准则选取所述复数序列中所有复数元素的实部和虚部，其中，M为大于或者等于2的整数。
根据本发明的另一个实施例，还提供了一种码分多址接入的多用户通信装置，应用于接收机，包括：接收模块，用于接收K个发射机发射的发射信号，其中，所述发射信号为所述K个发射机分别采用指定长度的扩展序列对调制信号进行扩展处理后，再分别将所述扩展后的调制信号调制到相同时频资源形成的信号，对于每一个发射机，针对N个调制符号，存在有N个指定长度的扩展序列，且所述N个指定长度的扩展序列中至少存在两个扩展序列不同，N和K均为正整数；检测模块，设置为根据所述扩展序列对所述发射信号进行检测。
通过本发明实施例，采用利用至少有两个扩展序列不同的N个扩展序列对调制符号进行扩展的技术方案，解决了相关技术中一个用户只使用一条扩展序列对全部调制符号进行扩展而导致的用户间干扰得不到有效的随机化或者平均化的问题，改善了多接入性能，每个接入用户可以使用多种不同的扩展序列对其调制符号进行扩展的，这样用户间的干扰可以有效的随机化或者说平均化。
附图说明
此处所说明的附图用来提供对本发明的进一步理解，构成本申请的一部分，本发明的示意性实施例及其说明用于解释本发明，并不构成对本发明的不当限定。在附图中：
图1是根据本发明实施例的码分多址的多用户通信方法的流程图；
图2是根据本发明实施例的码分多址的多用户通信装置的结构框图；
图3是根据本发明实施例的码分多址的多用户通信装置的再一结构框图；
图4是根据本发明实施例的码分多址的多用户通信方法的另一流程图；
图5是根据本发明实施例的码分多址的多用户通信装置的另一结构框图；
图6是本发明优选实施例一和实施例二发射机信号处理过程的示意图；
图7是本发明优选实施例一发射机侧的多用户码分多址接入通信方法的流程图；
图8是本发明优选实施例二发射机侧的多用户码分多址接入通信方法的流程图；
图9是本发明优选实施例三发射机的模块图；
图10是本发明优选实施例四接收机接收信号及处理的示意图；
图11是本发明优选实施例四接收机侧的多用户码分多址接入通信方法的流程图；
图12是本发明优选实施例四接收机的模块图；
图13是本发明优选实施例五中复数扩展序列生成的一示例的原理示意图；
图14是本发明优选实施例五中复数扩展序列生成的另一示例的原理示意图；
图15是本发明优选实施例五中M元伪随机序列生成器的原理示意图；
图16是本发明优选实施例六中复数扩展序列生成的一示例的原理示意图；
图17是本发明优选实施例六中复数扩展序列生成的另一示例的原理示意图；
图18是本发明优选实施例六中2个取值于3元实数集合的伪随机的实数序列与复数星座图之间的映射关系的示意图；
图19是本发明优选实施例六中2个取值于4元实数集合的伪随机的实数序列与复数星座图之间的映射关系的示意图；
图20是本发明优选实施例七中复数扩展序列生成的一示例的原理示意图；
图21是本发明优选实施例七中复数扩展序列生成的另一示例的原理示意图。
具体实施方式
下文中将参考附图并结合实施例来详细说明本发明。需要说明的是，在不冲突的情况下，本申请中的实施例及实施例中的特征可以相互组合。
在本实施例中提供了一种码分多址接入的多用户通信方法，应用于发射机侧，图1是根据本发明实施例的码分多址接入的多用户通信方法的流程图，如图1所示，该流程包括如下步骤：
步骤S102，获取信道编码器编出的码块经调制后所得的N个调制符号，其中，N为大于或者等于2的正整数；
步骤S104，根据N个指定长度的扩展序列对上述N个调制符号进行扩展，其中，上述N个指定长度的扩展序列中至少存在两个扩展序列不同；
步骤S106，发送扩展后的调制符号。
通过上述各个步骤，采用利用至少有两个扩展序列不同的N个扩展序列对调制符号进行扩展的技术方案，解决了相关技术中一个用户只使用一条扩展序列对全部调制符号进行扩展而导致的用户间干扰得不到有效的随机化或者平均化的问题，使得每个接入用户可以使用多种不同的扩展序列对其调制符号进行扩展的，这样用户间的干扰可以有效的随机化或者说平均化，改善了多接入的性能。
对于步骤S104中的N个指定长度的扩展序列，在本发明实施例的一个可选实施例中，提供了以下两种获取上述N个指定长度的扩展序列的方式，此处仅做一个示例，并不用于限定本发明实施例：
(1)根据伪随机序列发生器的输出序列确定上述N个指定长度的扩展序列；(2)按照预设准则从预设列表中获取上述N个指定长度的扩展序列，其中，上述预设列表中包含有多个序列。
而针对上述获取N个指定长度的扩展序列的方式(1)，在具体实施过程中，可以通过以下两种方式实现：
第一种方式
伪随机序列发生器直接输出长度为R的序列，其中R＝N×L，L为上述指定长度所指示的值；将上述长度为R的序列等分成N个指定长度的序列；将上述N个指定长度的序列作为上述N个指定长度的扩展序列。
第二种方式
伪随机序列发生器生成长度为预设长度的序列；将上述预设长度的序列重复指定次数生成长度为R的序列，其中R＝N×L，L为上述指定长度所指示的值；将上述长 度为R的序列等分成N个指定长度的序列；将上述N个指定长度的序列作为上述N个指定长度的扩展序列，如：伪随机序列发生器生成预设长度为2的序列，那么在N取4时，指定长度为3时，那么该序列重复六次，生成序列长度为12的序列，将该长度为12的序列4等分为指定长度为3的扩展序列即可。
而针对上述获取N个指定长度的扩展序列的方式(2)中，上述预设列表中有L条长度均为L的序列，上述序列能够构成L阶正交矩阵，当然，构成上述L阶正交矩阵有多种，在本发明实施例的一个优选实施例中，可以通过以下方式实现：上述长度为L的序列排列成L×L离散傅里叶变化矩阵；或者，将L×L离散傅里叶变化矩阵中每个元素乘以第一预定值构成L阶正交矩阵，或者将上述长度为L的序列排列成L×L哈达玛矩阵；或者，将L×L哈达玛矩阵中每个元素乘以第二预定值构成上述L阶正交矩阵，而对于上述第一预定值和上述第二预定值，本领域的技术人员完全可以根据经验和实际情况进行设定，本发明优选实施例对此不做限定。
为了简单方便，在实际应用中，可以直接选择单位矩阵作为上述正交矩阵。
需要说明的是，本发明实施例上述提供的扩展序列可以为实数矩阵，但在实际应用中，目前主流的码分多址技术为了实现简单，大都是基于二元伪随机实数序列作为扩展序列。但是由于二元伪随机实数序列，尤其是长度较短的二元伪随机实数序列之间的低互相关度并不容易保证，这会导致严重的多用户间干扰，必然会影响多用户接入的性能，而为了解决这个技术问题，本发明实施例还提供了以下技术方案，即上述扩展序列还可以通过复数序列实现，即每个用户还可以使用多种不同的复数扩展序列对其调制符号进行扩展，利用复序列所具有的比二元实序列更好的低互相关潜力来改善接入性能，而对于上述复数序列，本发明实施例提供了以下四种确定复数序列的方式，需要说明的是，以下提供的四种确定方式在需要的情况下可以结合或者单独使用，本发明实施例对此不作限定：
1).通过以下方式确定复数序列：根据第一伪随机序列发生器产生长度为R的第一实数序列，根据第二伪随机序列发生器产生长度为R的第二实数序列，其中，R＝N×L，L为指定长度所指示的值；将第一实数序列的第i个元素作为上述复数序列的实部，将第二实数序列的第i个元素作为上述复数序列的虚部，将包含上述实部和上述虚部的复数作为上述复数序列的第i个复数元素，其中，i＝1，2，3……，R；将得到的R个复数元素依次组成上述长度为R的复数序列，将上述长度为R的复数序列N等分为指定长度的复数序列，
可选地，还可以通过将N个指定长度的复数序列分别乘以上述N个指定长度的复数序列的能量归一化系数后得到归一化后的N个指定长度的复数序列。
在本发明实施例中，可以存在两个随机序列发生器，分别直接输出上述第一实数序列和第二实数序列，可以根据上述第一实数序列和第二实数序列直接确定复数序列的实部和虚部，当然还可以利用复数星座图来确定复数序列的实部和虚部。
2)通过以下方式确定复数序列：
根据伪随机序列发生器产生长度为R的整数序列，其中，整数序列的元素来自整数集合{0，1，……，D}或者集合{1，2，……，D}，R＝N×L，L为上述指定长度所指示的值，D为复数星座图中星座点的数量；将长度为R的整数序列的元素按照预设映射规则在复数星座图中与选取与上述元素对应的星座点；根据上述星座点确定复数序列。
3)通过以下方式确定复数序列：
使用能产生M元实数的伪随机序列产生器产生复数序列中所有复数元素的实部和虚部，或者从M元实数集合中以一定伪随机准则选取所述复数序列中所有复数元素的实部和虚部，其中，M为大于或者等于2的整数；根据选取的上述所有复数元素的上述实部和上述虚部确定上述复数序列，本发明实施例实际上也可以理解为根据确定的第一实数序列和第二实数序列确定复数序列的实部和虚部，本发明实施例是将伪随机序列发生器输出的序列，从上述序列中进行数据的抽取进而确定第一实数序列和第二实数序列进而确定复数序列的实部和虚部。
需要说明的是，上述实施例中的实数集合满足以下至少之一条件：上述实数集合是[-(M-1)/2,(M-1)/2]范围内的M个整数组成的集合，其中，M是奇数；上述实数集合是[-(M-1),(M-1)]范围内的M个奇数组成的集合，其中，M是偶数；上述实数集合是[-(M-1)/2,(M-1)/2]范围内的M个整数分别乘以上述实数集合相应的能量归一化系数得到的M个实数组成的集合，其中，M是奇数；上述实数集合是[-(M-1),(M-1)]范围内的M个奇数分别乘以上述实数集合相应的能量归一化系数得到的M个实数组成的集合，其中，M是偶数，其中，M取值包括以下至少之一：2、3、4。
则通过以下方式确定复数序列：根据上述M元实数集合生成长度为R的第一实数序列和长度为R的第二实数序列，其中，第一实数序列和第二实数序列均从M元实数集合取值，其中R＝N×L，L为指定长度所指示的值；将第一实数序列的第i个元素作为复数序列的实部，将第二实数序列的第i个元素作为复数序列的虚部，将包含上述 实部和上述虚部的复数作为上述复数序列的第i个复数元素，其中，i＝1，2，3……，R；将得到的R个元素依次组成长度为R的复数序列，将长度为R的复数序列N等分为上述指定长度的复数序列。
可选地，为了使得复数序列的结果更加标准化，将上述长度为R的复数序列N等分为上述指定长度的复数序列之后，还可以执行以下过程：将N个上述指定长度的复数序列分别乘以上述N个指定长度的复数序列的能量归一化系数后得到归一化后的N个指定长度的复数序列。
4)通过以下方式确定复数序列：生成长度为R的整数序列，其中上述整数序列取值来自M×M元整数集合，上述M×M元整数集合是[0，M×M-1]或[1，M×M]范围内的所有整数组成的集合；将上述长度为R的整数序列的元素按照预设映射规则在复数星座图中与选取与上述元素对应的星座点；在执行完上述确定扩展序列的过程后，并根据上述扩展序列对调制符号进行扩展后，上述步骤S106可以通过以下方式实现：将上述调制符号进行多载波调制；将调制后的调制符号作为上述发射机的发射信号。
在本实施例中还提供了一种码分多址接入的多用户通信装置，应用于发射机，该装置用于实现上述实施例及优选实施方式，已经进行过说明的不再赘述。如以下所使用的，术语“模块”可以实现预定功能的软件和/或硬件的组合。尽管以下实施例所描述的装置较佳地以软件来实现，但是硬件，或者软件和硬件的组合的实现也是可能并被构想的。
图2是根据本发明实施例的码分多址接入的多用户通信装置的结构框图，如图2所示，该装置包括：
第一获取模块20，设置为获取信道编码器编出的码块经调制后所得的N个调制符号，其中，N为大于或者等于2的正整数；
扩展模块22，与第一获取模块20连接，设置为根据N个指定长度的扩展序列对上述N个调制符号进行扩展，其中，上述N个指定长度的扩展序列中至少存在两个扩展序列不同；
发送模块24，与扩展模块22连接，设置为发送扩展后的调制符号。
通过上述各个模块的综合作用，采用利用至少有两个扩展序列不同的N个扩展序列对调制符号进行扩展的技术方案，解决了相关技术中一个用户只使用一条扩展序列 对全部调制符号进行扩展而导致的用户间干扰得不到有效的随机化或者平均化的问题，使得每个接入用户可以使用多种不同的扩展序列对其调制符号进行扩展的，这样用户间的干扰可以有效的随机化或者说平均化，改善了多接入的性能。
为了确定上述实施例中的扩展序列，如图3所示，上述装置还包括：第一确定模块26，与扩展模块22连接，设置为根据伪随机序列发生器的输出序列确定上述N个指定长度的扩展序列；第二获取模块28，与扩展模块22连接，设置为按照预设准则从预设列表中获取上述N个指定长度的扩展序列，其中，上述预设列表中包含有多个序列。
可选地，当上述扩展序列包括以下至少之一：实数序列，复数序列时，上述装置还包括：产生模块30，设置为根据第一伪随机序列发生器产生长度为R的第一实数序列，根据第二伪随机序列发生器产生长度为R的第二实数序列，其中，R＝N×L，L为上述指定长度所指示的值；
第二确定模块32，与产生模块30连接，设置为将上述第一实数序列的第i个元素作为上述复数序列的实部，将上述第二实数序列的第i个元素作为上述复数序列的虚部，将包含上述实部和上述虚部的复数作为上述复数序列的第i个复数元素，其中，i＝1，2，3……，R；
组成模块34，与第二确定模块32连接，设置为将得到的R个复数元素依次组成上述长度为R的复数序列，将上述长度为R的复数序列N等分为上述指定长度的复数序列。
本发明实施例对上述技术方案的进一步改进在于，产生模块30，还设置为根据伪随机序列发生器产生长度为R的整数序列，其中，所述整数序列的元素来自整数集合{0，1，……，D}或者集合{1，2，……，D}，R＝N×L，L为所述指定长度所指示的值，D为复数星座图中星座点的数量；选取模块36，与产生模块30连接，设置为将上述长度为R的整数序列的元素按照预设映射规则在复数星座图中与选取与上述元素对应的星座点；第三确定模块38，与选取模块36连接，设置为根据上述星座点确定上述复数序列。
可选地，选取模块36，设置为使用能产生M元实数的伪随机序列产生器产生复数序列中所有复数元素的实部和虚部，或者从M元实数集合中以一定伪随机准则选取复数序列中所有复数元素的实部和虚部，其中，M为大于或者等于2的整数；第三确定模块38，设置为根据选取的上述所有复数元素的上述实部和上述虚部确定上述复数序列。
为了更加完善上述实施例提供的技术方案，在本实施例中，提供了一种码分多址接入的多用户通信方法，应用于接收机侧，图4是根据本发明实施例的码分多址接入的多用户通信方法的流程图，如图4所示，该流程包括如下步骤：
步骤S402，接收K个发射机发射的发射信号，其中，上述发射信号为上述K个发射机分别采用指定长度的扩展序列对调制信号进行扩展处理后，再分别将上述扩展后的调制信号调制到相同时频资源形成的信号，对于每一个发射机，针对N个调制符号，存在有N个指定长度的扩展序列，且上述N个指定长度的扩展序列中至少存在两个扩展序列不同，N和K均为正整数；
步骤S404，根据上述扩展序列对上述发射信号进行检测。
通过上述各个步骤，采用接收发射机发送的根据至少存在两个扩展序列不同的N个扩展序列对每一个发射机内的调制符号进行扩展处理的技术方案，解决了相关技术中一个用户只使用一条扩展序列对全部调制符号进行扩展而导致的用户间干扰得不到有效的随机化或者平均化的问题，使得每个接入用户可以使用多种不同的扩展序列对其调制符号进行扩展的，这样用户间的干扰可以有效的随机化或者说平均化，改善了多接入的性能。
在本实施例中还提供了一种码分多址接入的多用户通信装置，应用于接收机，该装置用于实现上述实施例及优选实施方式，已经进行过说明的不再赘述。如以下所使用的，术语“模块”可以实现预定功能的软件和/或硬件的组合。尽管以下实施例所描述的装置较佳地以软件来实现，但是硬件，或者软件和硬件的组合的实现也是可能并被构想的。
图5是根据本发明实施例的码分多址接入的多用户通信装置的结构框图，如图5所示，该装置包括：
接收模块50，设置为接收K个发射机发射的发射信号，其中，上述发射信号为上述K个发射机分别采用指定长度的扩展序列对调制信号进行扩展处理后，再分别将上述扩展后的调制信号调制到相同时频资源形成的信号，对于每一个发射机，针对N个调制符号，存在有N个指定长度的扩展序列，且上述N个指定长度的扩展序列中至少存在两个扩展序列不同，N和K均为正整数；
检测模块52，与接收模块50连接，设置为根据上述扩展序列对上述发射信号进行检测。
通过上述各个模块的综合作用，采用接收发射机发送的根据至少存在两个扩展序列不同的N个扩展序列对每一个发射机内的调制符号进行扩展处理的技术方案，解决了相关技术中一个用户只使用一条扩展序列对全部调制符号进行扩展而导致的用户间干扰得不到有效的随机化或者平均化的问题，使得每个接入用户可以使用多种不同的扩展序列对其调制符号进行扩展的，这样用户间的干扰可以有效的随机化或者说平均化，改善了多接入的性能。
为了更好的理解上述实施例的码分多址接入的多用户通信过程，以下结合几个优选实施例进行说明，但不限定本发明实施例。
需要说明的是，本发明优选示例中的“L”可以理解为是本发明上述实施例中的指定长度。
优选实施例一
图6为根据本发明优选实施例一的发射机信号处理流程图，如图6所示，本实施例提供了一种多用户码分多址接入通信方法和相应的发射机、接收机。该发射机(如收发系统中的终端，也称为终端发射机)对信号处理过程如图6所示，待发送的数据比特先经过编码调制得到若干个数据符号，这里设信道编码器编码所得的一个码块经调制后得到N个数据符号，这N个数据符号用N个不完全相同的扩展序列进行扩展得到扩展后的符号序列，用N个不完全相同的扩展序列进行扩展可以达到用户间干扰随机化的目的；扩展后的符号序列再经载波调制形成发射信号后发射。
本发明优选实施例一中发射机侧的多用户码分多址接入通信方法的流程如图7所示，包括：
步骤S702，确定要使用的N个不完全相同的扩展序列(设每个序列长度为L)是通过某种伪随机序列发生器产生；
步骤S704，采用上述N个扩展序列对待发送的一个信道编码码块调制而成的N个数据符号逐个进行扩展处理，生成扩展后的符号序列；
本步骤S704中的扩展处理是指编码调制后的每个调制数据符号与对应的一条L长扩展序列的每个元素进行相乘，一个码块对应的不同调制符号用的扩展序列是不完全相同的。这样一个调制符号扩展形成长度为L的符号序列，最终一个码块对应的N个调制符号扩展形成长度为N×L的符号序列。
步骤S706，发送上述扩展后的符号序列。
本步骤S706中，较佳地，可以通过对上述扩展后的符号序列进行多载波调制，形成发射信号并发射。
在一个可选示例中，上述步骤S702中确定要使用的N个不完全相同的L长扩展序列，是通过某种伪随机序列发生器生成的N×L长的序列，然后将N×L长的序列等分N份而成：
可以由某种伪随机序列发生器直接输出或通过重复而生成上述的N×L长序列；
也可以是由两个伪随机实数序列发生器直接输出或重复而生成两个N×L长的实数序列，然后将这两个实数序列的元素分别作为N×L个复数的实部和虚部，这N×L个复数构成上述的N×L长复序列；
也可以是由一个伪随机实数序列发生器直接输出或重复而生成一个2×N×L长的实数序列，然后分别取其N×L个偶数位置和N×L个奇数位置的元素作为N×L个复数的实部和虚部，这N×L个复数构成上述的N×L长复序列；
也可以通过某种伪随机整数序列发生器直接产生或通过重复产生一个N×L长的整数序列，然后由该整数序列的元素作为索引去从一个复数星座图中选取相应的复数而构成上述的N×L长复序列。
最后将上面这N×L长序列等分成N段而成N个不完全相同的L长扩展序列。
优选实施例二
本发明实施例二提供了一种多用户码分多址接入通信方法和相应的发射机、接收机。该发射机(如收发系统中的终端，也称为终端发射机)对信号处理过程如图6所示，待发送的数据比特先经过编码调制得到若干个数据符号，这里设信道编码器编码所得的一个码块经调制后得到N个数据符号，这N个数据符号用N个不完全相同的扩展序列进行扩展得到扩展后的符号序列，用N个不完全相同的扩展序列进行扩展可以达到用户间干扰随机化的目的；扩展后的符号序列再经载波调制形成发射信号后发射。
本发明优选实施例发射机侧的多用户码分多址接入通信方法的流程如图8所示，包括：
步骤S802，确定要使用的N个不完全相同的扩展序列(设每个序列长度为L)是通过从一个收发双方约定好的、由若干条L长序列组成的表格中以一定伪随机准则选取N次而生成；
步骤S804，采用上述N个扩展序列对待发送的一个信道编码码块调制而成的N个数据符号逐个进行扩展处理，生成扩展后的符号序列；
本步骤中的扩展处理是指编码调制后的每个调制数据符号与对应的一条L长扩展序列的每个元素进行相乘，一个码块对应的不同调制符号用的扩展序列是不完全相同的。这样一个调制符号扩展形成长度为L的符号序列，最终一个码块对应的N个调制符号扩展形成长度为N×L的符号序列。
步骤S806，发送上述扩展后的符号序列。
本步骤中，较佳地，对上述扩展后的符号序列进行多载波调制，形成发射信号并发射。
在一个示例中，上述步骤S802中确定要使用的N个不完全的L长扩展序列是从一个收发双方约定好的、由若干条L长序列组成的表格中以一定伪随机准则选取N次构成。
上述N个不完全相同的扩展序列也可以是从一个收发双方约定好的、由L条L长的相互正交序列组成的表格中以一定伪随机准则选取N次构成。这里上述的L条L长相互正交的序列构成一个L×L的离散傅里叶变换矩阵(DFT matrix)，或者构成一个正交阵，该正交阵是一个由L×L离散傅里叶变换矩阵每个元素都除以同一个值所得的矩阵。这里上述的L条L长相互正交的序列也可以构成一个L×L的哈达玛矩阵(Hadamard matrix)，或者构成一个正交阵，该正交阵是一个由L×L的哈达玛矩阵每个元素都除以同一个值所得的矩阵。这里上述的L条L长相互正交的序列也可以构成一个L×L的单位阵。
优选实施例三
本发明优选实施例提供了一种多用户码分多址接入通信方法和相应的发射机、接收机。该发射机(如收发系统中的终端，也称为终端发射机)对信号处理过程如图6所示，待发送的数据比特先经过编码调制得到若干个数据符号，这里设信道编码器编码所得的一个码块经调制后得到N个数据符号，这N个数据符号用N个不完全相同的扩展序列进行扩展得到扩展后的符号序列，用N个不完全相同的扩展序列进行扩展 可以达到用户间干扰随机化的目的；扩展后的符号序列再经载波调制形成发射信号后发射。
本实施例发射机侧的多用户码分多址接入通信方法的流程如图7或8所示，包括：
步骤S702或步骤S802，确定要使用的N条L长的扩展序列都是复数扩展序列，上述复数扩展序列的每一元素为一个复数，且上述复数扩展序列中所有元素的实部和虚部的取值均来自于一个M元实数集合，其中，M是大于等于2的整数；
所谓M元实数集合是M个实数组成的集合，较佳地，上述M元实数集合为以下集合中的一种：
上述M是奇数，上述M元实数集合是[-(M-1)/2,(M-1)/2]范围内的M个整数组成的集合；或者
上述M是偶数，上述M元实数集合是[-(M-1),(M-1)]范围内的M个奇数组成的集合；或者
上述M是奇数，上述M元实数集合是[-(M-1)/2,(M-1)/2]范围内的M个整数分别乘以相应的归一化系数得到的M个实数组成的集合；或者
上述M是偶数，上述M元实数集合是[-(M-1),(M-1)]范围内的M个奇数分别乘以相应的归一化系数得到的M个实数组成的集合。
步骤S704或S804，采用上述复数扩展序列对待发送的数据符号进行扩展处理，生成扩展后的符号序列；本步骤中的扩展处理是指每个编码调制后的数据符号与上述复数扩展序列的每个元素(复数符号)进行复数相乘，最终形成与所用扩展序列长度相同的复数符号序列。
步骤S706或S806，发送上述扩展后的符号序列。
本步骤中，较佳地，对上述扩展后的符号序列进行多载波调制，形成发射信号并发射。
在一个示例中，上述步骤S702中确定要使用的复数扩展序列，包括：生成伪随机的第一实数序列和第二实数序列，上述第一实数序列和第二实数序列中所有元素的取值均来自于上述M元实数集合，且上述第一实数序列和第二实数序列包含的元素个数均等于上述复数序列的元素个数N×L；将上述第一实数序列的第i个元素作为实部，将上述第二实数序列的第i个元素作为虚部，将包括该实部和该虚部的一复数作为上 述复数扩展序列的第i个元素，其中，i＝1,2,…,N×L，L为大于等于2的整数；将得到的N×L个元素依次组成上述N×L长的复数序列，将上述的N×L长的复数序列等分N份，形成N个L长的扩展序列，或者，将上述N份L个复数乘以相应的能量归一化系数后依次组成上述的N个L长复数扩展序列。
在另一个示例中，上述步骤S702中确定要使用的复数扩展序列，包括：上述确定要使用的复数扩展序列，包括：生成一个伪随机的整数序列，上述整数序列具有N×L个元素且其中所有元素的取值均来自于一个M×M元整数集合，上述M×M元整数集合是[0，M×M-1]或[1，M×M]范围内的所有整数组成的集合，L为大于等于2的整数；根据上述伪随机的整数序列中的N×L个元素，按照预设的映射规则从一个M×M点的复数星座图中选取对应的N×L个星座点；确定上述N×L个星座点对应的N×L个复数，将上述的N×L长的复数序列等分N份，形成N个L长的扩展序列，或者，将上述N份L个复数乘以相应的能量归一化系数后依次组成上述的N个L长复数扩展序列。
相应地，本实施例多用户码分多址接入通信系统中的发射机如图9所示，包括：
序列确定装置90，配置为确定要使用的N条扩展序列，上述N条扩展序列不完全相同，且所有序列的每一元素为一个复数，且上述复数扩展序列中所有元素的实部和虚部的取值均来自于一个M元实数集合，其中，M是大于等于2的整数。
扩展装置92，配置为采用上述复数扩展序列对待发送的数据符号进行扩展处理，生成扩展后的符号序列。
信号发射装置94，配置为发送上述扩展后的符号序列。较佳地，对上述扩展后的符号序列进行多载波调制，形成发射信号并发射。
较佳地，上述序列确定装置90确定的上述复数扩展序列中所有元素的实部和虚部的取值都来自于一个M元实数集合，其中：
上述M是奇数，上述M元实数集合是[-(M-1)/2,(M-1)/2]范围内的M个整数组成的集合；或者
上述M是偶数，上述M元实数集合是[-(M-1),(M-1)]范围内的M个奇数组成的集合；或者
上述M是奇数，上述M元实数集合是[-(M-1)/2,(M-1)/2]范围内的M个整数分别乘以相应的归一化系数得到的M个实数组成的集合；或者
上述M是偶数，上述M元实数集合是[-(M-1),(M-1)]范围内的M个奇数分别乘以相应的归一化系数得到的M个实数组成的集合。
上述方案中，发射机采用特定的复数序列作为扩展序列对待发送的数据符号进行扩展处理和供接收机识别上述发射机发射的信号；多个发射机通过相同的时频资源同时向接收机发送信息时，各个发射机分别采用各自的复数扩展序列对各自待发送的数据符号进行扩展处理，使得接收机可以识别不同发射机发射的信号。
由于每个用户使用多种不同的扩展序列对其调制符号进行扩展的，这样用户间的干扰可以有效的随机化或者说平均化。又由于复数序列(即序列中的每一个元素都是一个复数)可以比二元实数序列有更大的设计自由度，更加容易选取具有低互相关的序列集合来作为码分多址的扩展序列集。因而本方案可以取得更优的码分多址接入性能，从而支持更高的系统过载水平，提升用户非正交过载接入与通信的体验。
优选实施例四
本发明优选实施例四涉及接收机侧的多用户码分多址接入通信方法及相应的接收机，该接收机(如为收发系统中的基站)接收信号及处理的原理如图10所示，图10中示出了K个发射机发射的信号(每一发射机发射信号时的处理见图6所示)，经过空中无线传播后，接收机接收到的是K个发射机发射的信号的叠加信号，干扰消除信号检测器对该叠加信号进行接收检测，得到各个发射机发送的数据。在本发明实施例中，上述干扰消除信号检测器为串行干扰消除(Successive Interference Cancellation，SIC)信号检测器。
图11示出了接收机侧的多用户码分多址接入通信方法的流程，包括：
步骤S1102，接收多个发射机发射的信号，上述多个发射机发射的信号是上述多个发射机分别采用各自的扩展序列对各自待发送的数据符号进行扩展处理，再将生成的扩展后的符号序列分别调制到相同的时频资源上形成的；
本步骤S1102中，上述的每个发射机采用的扩展序列是不完全相同的，通过某种伪随机序列发生器产生，或者通过从一个收发双方约定好的、由若干条L长序列组成的表格中以一定伪随机准则选取若干次而生成。
步骤S1104，采用干扰消除信号检测器对接收的上述多个发射机发射的信号进行接收检测，检测时使用上述多个发射机所采用的扩展序列。
对于具体的接收检测方法，本发明优选实施例不做任何的局限。但在检测过程中，接收机都需要使用到上述多个发射机所采用的扩展序列以识别出各个终端发射的信号。
相应地，本实施例的多用户码分多址接入通信系统中的接收机如图12所示，包括：
信号接收装置1200，配置为接收多个发射机发射的信号，上述多个发射机发射的信号是上述多个发射机分别采用各自的扩展序列对各自待发送的数据符号进行扩展处理，再将生成的扩展后的符号序列分别调制到相同的时频资源上形成的；
接收检测装置1202，配置为采用干扰消除信号检测器对接收的上述多个发射机发射的信号进行接收检测，检测时使用上述多个发射机所采用的扩展序列。
其中，上述扩展序列的数量与一个信道编码码块对应的调制符号数量一样，且不完全相同。
上述优选实施例一和优选实施例二的方案(发射机侧和接收机侧的多用户码分多址接入通信方法与相应的发射机和接收机)，在具体应用时，可以应用于MC-CDMA系统，可以应用于竞争接入场景、免调度接入场景等。
应用于MC-CDMA系统时，发射机采用上述N条不完全相同的扩展序列，对一个码块对应的N个调制符号进行扩展处理(即扩展序列的数量与信道编码码块对应的调制符号数量是一样)，得到扩展后的符号序列，然后发送给接收机；多个发射机可以使用相同的频域带宽或子载波资源。相应的，接收机接收到多个发射机发射的信号后，采用干扰消除信号检测器对多个发射机发射的信号进行接收检测，可以有效区分使用相同时频资源的多个终端，从而有效提高系统容量，在一定传输速率条件下负载更多的终端接入数量，支持更高的系统过载水平，提升用户非正交过载接入与通信的体验。
应用于竞争接入场景时，多个甚至大量用户终端会同时请求接入系统，各个终端发射机分别采用上述特定的扩展序列对发送数据符号进行扩展处理，那么，接收机采用干扰消除信号检测器对各个终端发射机发射的信号进行接收检测，可以有效区分各个终端发射的信号，从而支持更高的系统过载水平，有效改善系统接入效率，改善终端接入体验。
应用于免调度接入场景时，用户终端需要发送数据时即可在可用的时频资源上进行数据传输，存在多个用户终端同时使用相同的时频资源进行数据传输的情况；各个终端发射机分别采用上述特定的扩展序列对发送数据符号进行扩展处理，并且，接收 机采用干扰消除信号检测器对各个终端发射机发射的信号进行接收检测，可以有效区分各个终端发射的信号，从而支持更高的系统过载水平，提升用户终端免调度接入与通信的体验，还可以减少系统调度信令，降低终端接入时延。
优选实施例五
本实施例提供了一种生成N个L长复数扩展序列的方法，发射机先根据两个伪随机的实数序列来生成N×L长的复数扩展序列，该两个伪随机的实数序列中所有元素的取值均来自于如实施例三上述的M元实数集合，并且，该两个伪随机的实数序列的长度与复数扩展序列的长度相同。最后将这N×L长的复数序列等分成N段而生成所需的N个L长的复数扩展序列。
本发明优选实施例中，两个伪随机的实数序列分别由发射机中的两个伪随机序列生成器独立生成的，如图13所示，第一伪随机序列生成器生成长度为N×L的伪随机的第一实数序列，第二伪随机序列生成器生成长度为N×L的伪随机的第二实数序列。
在另一实施例中，如图14所示，先由发射机中的一个伪随机序列生成器生成的一个长度为2×N×L伪随机的基础实数序列，该基础实数序列中所有元素的取值均来自于如实施例三上述的M元实数集合，再对该伪随机的基础实数序列进行串并变换或者分段存储或者周期抽样，形成长度都为N×L的伪随机的第一实数序列和伪随机的第二实数序列。
其中，如果采用串并变换方式，假设伪随机的基础实数序列的长度2×N×L，并把该基础实数序列的元素索引初始值设置为0。这相当于，该基础实数序列的偶数位置的元素形成了伪随机的第一实数序列，该基础实数序列的奇数位置的元素形成了伪随机的第二实数序列。
如果采用周期抽样方式，假设伪随机的基础实数序列的长度为N×L的多倍，则可以从该基础实数序列中周期地取出一部分位置上的元素作为伪随机的第一实数序列，同理，周期地取出另一部分位置上的元素作为伪随机的第二实数序列。
本实施例中，如图13、图14所示，对伪随机的第二实数序列的各个元素进行90°的相位偏移(或乘以ejπ/2)后，与伪随机的第一实数序列的各个元素逐位相加生成复数扩展序列，表示为：
ComplexSeq＝Seq1+Seq2×ejπ/2
其中，ComplexSeq表示复数扩展序列，Seq1表示伪随机的第一实数序列，Seq2表示伪随机的第二实数序列；对Seq2的各个元素进行90°的相位偏移(或乘以ejπ/2)相当于把Seq2作为ComplexSeq的虚部。应当说明的是，上述公式中的相加表示的是逐位相加，即将Seq1的第i个元素作为实部，将Seq2的第i个元素作为虚部，将包括该实部和该虚部的一个复数作为ComplexSeq的第i个元素，i＝1,2,…,L。
以M＝3为例，即伪随机的第一实数序列和第二实数序列中所有元素的取值均来自于3元实数集合{1，0，-1}。假设伪随机的第二实数序列为“1,-1,0,-1,1,0,-1,1”，对其中的各个元素进行90°相位偏移，相当于乘以ejπ/2，得到“ejπ/2,-ejπ/2,0,-ejπ/2,ejπ/2,0,-ejπ/2,ejπ/2”；假设伪随机的第一实数序列为“-1,0,1,1,-1,1,-1,0”，则二者逐位相加生成的复数序列为：“-1+ejπ/2,-ejπ/2,1,1-ejπ/2,-1+ejπ/2,1,-1-ejπ/2,ejπ/2”，该复数序列也可以表示为：“-1+j,-j,1,1-j,-1+j,1,-1-j,j”。该复数序列可作为上述复数扩展序列。此外，还可以对生成的复数序列进一步进行能量归一化，即将该复数序列中的每一复数乘以相应的能量归一化系数后，得到的复数序列再作为上述复数扩展序列。复数序列对应的能量归一化系数可以采用该复数序列各元素的能量之和的倒数，如复数序列“-1+j,-j,1,1-j,-1+j,1,-1-j,j”的能量之和为2+1+1+2+2+1+2+1＝12。则能量归一化后的复数序列为：“(-1+j)/sqrt(12),-j/sqrt(12),1/sqrt(12),(1-j)/sqrt(12),(-1+j)/sqrt(12),1/sqrt(12),(-1-j)/sqrt(12),j/sqrt(12)”，其中，sqrt()表示求平方根运算。
上述相位偏移也可以取0到2π之间的其他值，例如270°(或3π/2)，-90°(或-π/2)，-270°(或-3π/2)等。
上述伪随机序列生成器可以由线性反馈移位寄存器构成，如图15所示，假设伪随机序列生成器由n级线性反馈移位寄存器构成，用于生成长度为Mn-1的伪随机的实数序列，反馈函数或反馈连接多项式可以表示为f＝m0x0+m1x1+…+mn-1xn-1+mnxn，其中，(m0,m1,…,mn-1,mn)为反馈系数；时钟用于控制移位寄存操作。对于图13中的两个伪随机序列生成器，二者可以采用相同或不同的反馈函数或反馈连接多项式。
优选实施例六
本发明优选实施例六提供了一种生成N个L长复数扩展序列的方法，该方法的原理如图16或图17所示。发射机根据两个N×L长的伪随机的实数序列生成N×L长的复数扩展序列，最后将这N×L长的复数序列等分成N段而生成所需的N个L长的复数扩展序列。并且，该两个伪随机的实数序列的生成过程如实施例五上述。
本实施例中，如图18、图19所示，根据两个N×L伪随机的实数序列与复数星座图之间的映射关系，把伪随机的第一实数序列、伪随机的第二实数序列逐位共同映射到复数星座图生成复数扩展序列，用公式表示为：
(Seq1i,Seq2i)—>ComplexSeqi
其中，ComplexSeqi表示复数扩展序列的第i个元素，根据伪随机的实数序列与复数星座图之间的映射关系由(Seq1i,Seq2i)映射得到，Seq1i表示伪随机的第一实数序列的第i个元素，Seq2i表示伪随机的第二实数序列的第i个元素。
以M＝3为例，即伪随机的第一实数序列和第二实数序列中所有元素的取值均来自于3元实数集合{1，0，-1}。对于两个伪随机的实数序列，预定义复数星座图为9个复数坐标1+j、j、-1+j、1、0、-1、1-j、-j、-1-j形成的9个星座点，并预定义(Seq1i,Seq2i)取值为(1,1)时映射为复数1+j，取值为(0,1)时映射为复数j，取值为(-1,1)时映射为复数-1+j，(1,0)时映射为复数1，取值为(0,0)时映射为复数0，取值为(-1,0)时映射为复数-1，取值为(1,-1)时映射为复数1-j，取值为(0,-1)时映射为复数-j，取值为(-1,-1)时映射为复数-1-j，如图13所示。
本发明优选实施例中，假设伪随机的第一实数序列为“-1,0,1,1,-1,1,-1,0”，伪随机的第二实数序列为“1,-1,0,-1,1,0,-1,1”，根据两个伪随机的实数序列与9点复数星座图之间的映射关系，把伪随机的第一实数序列、伪随机的第二实数序列逐位共同映射到9点复数星座图上的复数星座点，得到复数序列为：“-1+j,-j,1,1-j,-1+j,1,-1-j,j”，该序列可作为生成的复数扩展序列。另外，可以对该复数扩展序列进一步进行能量归一化，再作为上述复数扩展序列。此处能量归一化时，使用的能量归一化系数也可以是复数星座图上9个复数星座点的能量之和的倒数。
以M＝4为例，即伪随机的第一实数序列和第二实数序列中所有元素的取值均来自于4元实数集合{3、1、-1和-3}。对于两个伪随机的实数序列，预定义复数星座图为16个复数坐标3+3j、3+j、3-j、3-3j、1+3j、1+j、1-j、1-3j、-1+3j、-1+j、-1-j、-1-3j、-3+3j、-3+j、-3-j、-3-3j形成的16个星座点，并预定义(Seq1i,Seq2i)取值为(3,3)时映射为复数3+3j，取值为(3,1)时映射为复数3+j，取值为(3,-1)时映射为复数3-j，(3,-3)时映射为复数3-3j，(1,3)时映射为复数1+3j，取值为(1,1)时映射为复数1+j，取值为(1,-1)时映射为复数1-j，(1,-3)时映射为复数1-3j，(-1,3)时映射为复数-1+3j，取值为(-1,1)时映射为复数-1+j，取值为(-1,-1)时映射为复数-1-j，(-1,-3)时映射为复数-1-3j，(-3,3)时映射为复数-3+3j，取值为(-3,1)时映射为复数-3+j，取值为(-3,-1)时映射为复数-3-j，(-3,-3)时映射为复数-3-3j，如图14所示。
本发明优选实施例中，假设伪随机的第一实数序列为“-1,3,1,-3,1,3,-1,-3”，伪随机的第二实数序列为“3,1,-3,-1,1,-1,-3,3”，根据两个伪随机的实数序列与16点复数星座图之间的映射关系把伪随机的第一实数序列和第二实数序列逐位共同映射到16点复数星座图上的复数星座点，得到复数序列为：“-1+3j,3+j,1-3j,-3-j,1+j,3-j,-1-3j,-3-3j”，该序列可作为生成的复数扩展序列。另外，也可以对该复数序列进一步进行能量归一化，再作为上述复数扩展序列。
对于上述两个伪随机的实数序列与16点复数星座图之间的映射关系，也可以把两个伪随机的实数序列的元素的各个取值集合用二进制索引编号，例如(1,1)表示为0000，(-1,1)表示为0001，…，(3,-3)表示为1111；同理，把16点复数星座图的16个复数星座点也按照同样规则编号，例如1+j表示为0000，-1+j表示为0001，…，3-3j表示为1111，即两个四元伪随机序列的元素的各个取值集合与16个复数星座点形成一一对应关系；然后，即可根据该映射关系把生成的两个伪随机的实数序列逐位共同映射到16个复数星座图上的星座点，得到复数序列，将该复数序列作为上述复数扩展序列，或者，对该复数序列进行能量归一化后得到上述复数扩展序列。
除了上述描述的M＝4时两个伪随机的实数序列与16点复数星座图进行映射外，还可以利用M＝2时生成的两个伪随机的实数序列与16点复数星座图进行映射；由于M＝2时伪随机的实数序列的元素取值为0或1，或者，1或-1，那么，需要每次利用实数序列中的2个元素参与映射，例如，假设M＝2时的伪随机的第一实数序列为“01100011”，伪随机的第二实数序列为“10111010”，依次从伪随机的第一实数序列和伪随机的第二实数序列同时取出两个元素进行映射，则(01,10)映射为16点复数星座图上0110表示的复数星座点，(10，11)映射为16点复数星座图上1011表示的复数星座点，等等。
上述复数星座图以及两个伪随机的实数序列与复数星座图之间的映射关系也可以定义为其他形式，还可以定义具有更多个复数星座点构成的复数星座图以及多于两个的伪随机的实数序列与复数星座图之间的映射关系，与上述原理类似，不再赘述。
优选实施例七
本发明优选实施例提供了一种生成N个L长复数扩展序列的方法，该方法的原理如图20或图21所示。
发射机先生成一个N×L长的伪随机的整数序列，上述整数序列具有N×L个元素且其中所有元素的取值均来自于一个M×M(M乘M)元整数集合，上述M×M元 整数集合是[0，M×M-1]或[1，M×M]范围内的所有整数组成的集合，其中，M、L均为大于等于2的整数；
根据上述伪随机的整数序列中的N×L个元素，按照预设的映射规则从一个M×M点的复数星座图中选取对应的N×L个星座点从而形成N×L长的复数序列，最后将这N×L长的复数序列等分成N段而生成所需的N个L长的复数扩展序列。或者，将上述N组L个复数的序列乘以相应的能量归一化系数后依次组成上述个N个L长的复数扩展序列。
这里的复数扩展序列与实施例三相同，其中每一元素为一个复数，且上述复数扩展序列中所有元素的实部和虚部的取值均来自于一个M元实数集合。
上述伪随机的整数序列可以由伪随机序列生成器生成，该伪随机序列生成器可以由线性反馈移位寄存器构成，如实施例五上述。
本实施例中，以M×M＝9元整数集合为例，发射机生成一个伪随机的整数序列，该整数序列的元素取值均来自于一个9元整数集合{0,1,2,…,8}。根据9元整数集合中的元素与M×M＝9点复数星座图的复数星座点之间的映射关系(如图20所示)把该伪随机的整数序列逐位映射到9点复数星座图的复数星座点(每一复数星座点表示一个复数)生成复数扩展序列，用公式表示如下：
Seqi—>ComplexSeqi
其中，ComplexSeqi表示复数扩展序列的第i个元素，根据9元整数集合中的元素与9点复数星座图的复数星座点之间的映射关系由Seqi映射得到，Seqi表示伪随机的整数序列的第i个元素。
在另一实施例中，以M×M＝1整数集合为例，发射机生成一个伪随机的整数序列，该整数序列的元素取值均来自于一个16元整数集合{0,1,2,…,15}，根据16元整数集合中的元素与M×M＝16点复数星座图的复数星座点之间的映射关系(如图21所示)把该伪随机的整数序列逐位映射到16点复数星座图的复数星座点，生成复数扩展序列，用公式表示如下：
Seqi—>ComplexSeqi
其中，ComplexSeqi表示复数扩展序列的第i个值，根据16元整数集合中的元素与16点复数星座图的复数星座点之间的映射关系由Seqi映射得到，Seqi表示伪随机的整数序列的第i个元素。
上述M×M元整数集合、M×M点复数星座图、以及两者之间的映射关系也可以定义为其他形式，与上述原理类似，不再赘述。
优选实施例八
本发明实施例提供了一种生成N个L长扩展序列的方法，如下上述：
上述N个不完全相同的扩展序列也可以是从一个收发双方约定好的、由若干条L长序列组成的表格中以一定伪随机准则选取N次构成。
例如，终端发射机根据随机生成的索引或者根据预定义的公式计算出的索引从序列集合中选取N次生成N个L长扩展序列，或者，基站通过信令把扩展序列的选取方法通知给终端发射机，终端发射机根据该选取方法从序列集合或序列表中获取序列作为扩展序列。
本实施例中，假设表1为系统预定义的复数序列集合，该复数序列集合包括n个复数序列，每个序列长度为L：
表1
索引 0 1 … L-1
0 1+j 0 … -1-j
1 -j 1 … -1+j
… … … … …
n-1 1-j -1+j … 0
上述复数序列集合或复数序列表也可以定义为其他形式，与上述原理类似，不再赘述。
终端发射机根据随机生成N个伪随机的位于0到n-1之间的整数作为表格索引，如生成的第一个索引为1，从表1中选择索引为1的复数序列作为其第一个调制符号的扩展序列；或者，终端发射机根据预定义的公式计算出的索引，例如计算出的第一个索引为1，从表1中选择索引为1的复数序列作为其第一个调制符号的扩展序列。
在另一实施方式中，基站通过信令把复数扩展序列的索引生成方法通知给终端发射机，例如，基站通过信令通知的索引生成方法生成的第一个索引为1，终端发射机根据该索引从表1中选择索引为1的复数序列作为其第一个调制符号的扩展序列。
可选地，上述实施例的全部或部分步骤也可以使用集成电路来实现，这些步骤可以被分别制作成一个个集成电路模块，或者将它们中的多个模块或步骤制作成单个集成电路模块来实现。这样，本发明不限制于任何特定的硬件和软件结合。
在另外一个实施例中，还提供了一种软件，该软件用于执行上述实施例及优选实施方式中描述的技术方案。
在另外一个实施例中，还提供了一种存储介质，该存储介质中存储有上述软件，该存储介质包括但不限于：光盘、软盘、硬盘、可擦写存储器等。
需要说明的是，本发明的说明书和权利要求书及上述附图中的术语“第一”、“第二”等是用于区别类似的对象，而不必用于描述特定的顺序或先后次序。应该理解这样使用的对象在适当情况下可以互换，以便这里描述的本发明的实施例能够以除了在这里图示或描述的那些以外的顺序实施。此外，术语“包括”和“具有”以及他们的任何变形，意图在于覆盖不排他的包含，例如，包含了一系列步骤或单元的过程、方法、系统、产品或设备不必限于清楚地列出的那些步骤或单元，而是可包括没有清楚地列出的或对于这些过程、方法、产品或设备固有的其它步骤或单元。
综上所述，本发明实施例达到了以下技术效果：解决了相关技术中一个用户只使用一条扩展序列对全部调制符号进行扩展而导致的用户间干扰得不到有效的随机化或者平均化的问题，使得每个接入用户可以使用多种不同的扩展序列对其调制符号进行扩展的，这样用户间的干扰可以有效的随机化或者说平均化，改善了多接入的性能。
显然，本领域的技术人员应该明白，上述的本发明的各模块或各步骤可以用通用的计算装置来实现，它们可以集中在单个的计算装置上，或者分布在多个计算装置所组成的网络上，可选地，它们可以用计算装置可执行的程序代码来实现，从而，可以将它们存储在存储装置中由计算装置来执行，并且在某些情况下，可以以不同于此处的顺序执行所示出或描述的步骤，或者将它们分别制作成各个集成电路模块，或者将它们中的多个模块或步骤制作成单个集成电路模块来实现。这样，本发明不限制于任何特定的硬件和软件结合。
以上所述仅为本发明的优选实施例而已，并不用于限制本发明，对于本领域的技术人员来说，本发明可以有各种更改和变化。凡在本发明的精神和原则之内，所作的任何修改、等同替换、改进等，均应包含在本发明的保护范围之内。
工业实用性
本发明提供的上述技术方案，可以应用于码分多址接入的多用户通信过程中，采用利用至少有两个扩展序列不同的N个扩展序列对调制符号进行扩展的技术方案，解决了相关技术中一个用户只使用一条扩展序列对全部调制符号进行扩展而导致的用户间干扰得不到有效的随机化或者平均化的问题，改善了多接入性能，每个接入用户可以使用多种不同的扩展序列对其调制符号进行扩展的，这样用户间的干扰可以有效的随机化或者说平均化。

Claims (26)

  1. 一种码分多址接入的多用户通信方法，应用于发射机，包括：
    获取信道编码器编出的码块经调制后所得的N个调制符号，其中，N为大于或者等于2的正整数；
    根据N个指定长度的扩展序列对所述N个调制符号进行扩展，其中，所述N个指定长度的扩展序列中至少存在两个扩展序列不同；
    发送扩展后的调制符号。
  2. 根据权利要求1所述的方法，其中，通过以下之一方式获取所述N个指定长度的扩展序列：
    根据伪随机序列发生器的输出序列确定所述N个指定长度的扩展序列；
    按照预设准则从预设列表中获取所述N个指定长度的扩展序列，其中，所述预设列表中包含有多个长度为所述指定长度的序列。
  3. 根据权利要求2所述的方法，其中，根据伪随机序列发生器的输出序列确定所述N个指定长度的扩展序列包括：
    所述伪随机序列发生器生成长度为R的序列，其中R＝N×L，L为所述指定长度所指示的值；
    将所述长度为R的序列等分成N个指定长度的序列；
    将所述N个指定长度的序列作为所述N个指定长度的扩展序列。
  4. 根据权利要求2所述的方法，其中，根据伪随机序列发生器的输出序列确定所述N个指定长度的扩展序列包括：
    所述伪随机序列发生器生成长度为预设长度的序列；
    将所述预设长度的序列重复指定次数生成长度为R的序列，其中，R＝N×L，L为所述指定长度所指示的值；
    将所述长度为R的序列等分成N个指定长度的序列；
    将所述N个指定长度的序列作为所述N个指定长度的扩展序列。
  5. 根据权利要求2所述的方法，其中，所述预设列表中有L条长度均为L的序列，所述序列构成L阶正交矩阵，其中，L为所述指定长度所指示的值。
  6. 根据权利要求5所述的方法，其中，所述序列构成L阶正交矩阵，包括：
    所述L条长度为L的序列排列成L×L离散傅里叶变换矩阵；或者，所述L×L离散傅里叶变换矩阵中每个元素乘以第一预定值构成所述L阶正交矩阵。
  7. 根据权利要求5所述的方法，其中，所述序列构成L阶正交矩阵，包括：
    所述L条长度为L的序列排列成L×L哈达玛矩阵；或者，所述L×L哈达玛矩阵中每个元素乘以第二预定值构成所述L阶正交矩阵。
  8. 根据权利要求5所述的方法，其中，所述正交矩阵为单位矩阵。
  9. 根据权利要求1所述的方法，其中，所述扩展序列包括以下至少之一：实数序列，复数序列。
  10. 根据权利要求9所述的方法，其中，通过以下方式确定所述复数序列：
    根据第一伪随机序列发生器产生长度为R的第一实数序列，根据第二伪随机序列发生器产生长度为R的第二实数序列，其中，R＝N×L，L为所述指定长度所指示的值；
    将所述第一实数序列的第i个元素作为所述复数序列的实部，将所述第二实数序列的第i个元素作为所述复数序列的虚部，将包含所述实部和所述虚部的复数作为所述复数序列的第i个复数元素，其中，i＝1，2，3……，R；
    将得到的R个复数元素依次组成所述长度为R的复数序列，将所述长度为R的复数序列N等分为所述指定长度的复数序列。
  11. 根据权利要求10所述的方法，其中，将所述长度为R的复数序列N等分为所述指定长度的复数序列之后，还包括：
    将N个所述指定长度的复数序列分别乘以所述N个指定长度的复数序列的能量归一化系数后得到归一化后的N个指定长度的复数序列。
  12. 根据权利要求9所述的方法，其中，通过以下方式确定所述复数序列：
    根据伪随机序列发生器产生长度为R的整数序列，其中，所述整数序列的元素来自整数集合{0，1，……，D}或者集合{1，2，……，D}，R＝N×L，L为所述指定长度所指示的值，D为复数星座图中星座点的数量；
    将所述长度为R的整数序列的元素按照预设映射规则在所述复数星座图中与选取与所述元素对应的星座点；
    根据所述星座点确定所述复数序列。
  13. 根据权利要求9所述的方法，其中，通过以下方式确定所述复数序列：
    使用能产生M元实数的伪随机序列产生器产生所述复数序列中所有复数元素的实部和虚部，或者从M元实数集合中以一定伪随机准则选取所述复数序列中所有复数元素的实部和虚部，其中，M为大于或者等于2的整数；
    根据选取的所述所有复数元素的所述实部和所述虚部确定所述复数序列。
  14. 根据权利要求13所述的方法，其中，所述M元实数集合满足以下至少之一条件：
    所述M是奇数，所述实数集合是[-(M-1)/2,(M-1)/2]范围内的M个整数组成的集合；
    所述M是偶数，所述实数集合是[-(M-1),(M-1)]范围内的M个奇数组成的集合；
    所述M是奇数，所述实数集合是[-(M-1)/2,(M-1)/2]范围内的M个整数分别乘以所述实数集合相应的能量归一化系数得到的M个实数组成的集合；
    所述M是偶数，所述实数集合是[-(M-1),(M-1)]范围内的M个奇数分别乘以所述实数集合相应的能量归一化系数得到的M个实数组成的集合。
  15. 根据权利要求13所述的方法，其中，通过以下方式确定所述复数序列：
    根据所述M元实数集合生成长度为R的第一实数序列和长度为R的第二实数序列，其中，所述第一实数序列和所述第二实数序列均从所述M元实数集合取值，其中，R＝N×L，L为所述指定长度所指示的值；
    将所述第一实数序列的第i个元素作为所述复数序列的实部，将所述第二实数序列的第i个元素作为所述复数序列的虚部，将包含所述实部和所述虚部的复数作为所述复数序列的第i个复数元素，其中，i＝1，2，3……，R；
    将得到的R个元素依次组成所述长度为R的复数序列，将所述长度为R的复数序列N等分为所述指定长度的复数序列。
  16. 根据权利要求15所述的方法，其中，将所述长度为R的复数序列N等分为所述指定长度的复数序列之后，还包括：
    将N个所述指定长度的复数序列分别乘以所述N个指定长度的复数序列的能量归一化系数后得到归一化后的N个指定长度的复数序列。
  17. 根据权利要求13所述的方法，其中，通过以下方式确定所述复数序列：
    生成长度为R的整数序列，其中所述整数序列取值来自M×M元整数集合，所述M×M元整数集合是[0，M×M-1]或[1，M×M]范围内的所有整数组成的集合；
    将所述长度为R的整数序列的元素按照预设映射规则在复数星座图中与选取与所述元素对应的星座点；
    根据所述星座点确定所述复数序列。
  18. 根据权利要求13-17任一项所述的方法，其中，所述M取值包括以下至少之一：2、3、4。
  19. 根据权利要求1所述的方法，其中，发送扩展后的调制符号包括：
    将所述调制符号进行多载波调制；
    将调制后的调制符号作为所述发射机的发射信号。
  20. 一种码分多址接入的多用户通信方法，应用于接收机，包括：
    接收K个发射机发射的发射信号，其中，所述发射信号为所述K个发射机分别采用指定长度的扩展序列对调制信号进行扩展处理后，再分别将所述扩展后的调制信号调制到相同时频资源形成的信号，对于每一个发射机，针对N个调制符号，存在有N个指定长度的扩展序列，且所述N个指定长度的扩展序列中至少存在两个扩展序列不同，N和K均为正整数；
    根据所述扩展序列对所述发射信号进行检测。
  21. 一种码分多址接入的多用户通信装置，应用于发射机，包括：
    第一获取模块，设置为获取信道编码器编出的码块经调制后所得的N个调制符号，其中，N为大于或者等于2的正整数；
    扩展模块，设置为根据N个指定长度的扩展序列对所述N个调制符号进行扩展，其中，所述N个指定长度的扩展序列中至少存在两个扩展序列不同；
    发送模块，设置为发送扩展后的调制符号。
  22. 根据权利要求21所述的装置，其中，所述装置还包括：
    第一确定模块，设置为根据伪随机序列发生器的输出序列确定所述N个指定长度的扩展序列；
    第二获取模块，设置为按照预设准则从预设列表中获取所述N个指定长度的扩展序列，其中，所述预设列表中包含有多个长度为所述指定长度序列。
  23. 根据权利要求21所述的装置，其中，所述扩展序列包括以下至少之一：实数序列、复数序列，所述装置还包括：
    产生模块，设置为根据第一伪随机序列发生器产生长度为R的第一实数序列，根据第二伪随机序列发生器产生长度为R的第二实数序列，其中，R＝N×L，L为所述指定长度所指示的值；
    第二确定模块，设置为将所述第一实数序列的第i个元素作为所述复数序列的实部，将所述第二实数序列的第i个元素作为所述复数序列的虚部，将包含所述实部和所述虚部的复数作为所述复数序列的第i个复数元素，其中，i＝1，2，3……，R；
    组成模块，设置为将得到的R个复数元素依次组成所述长度为R的复数序列，将所述长度为R的复数序列N等分为所述指定长度的复数序列。
  24. 根据权利要求23所述的装置，其中，
    所述产生模块，还设置为根据伪随机序列发生器产生长度为R的整数序列，其中，所述整数序列的元素来自整数集合{0，1，……，D}或者集合{1，2，……，D}，R＝N×L，L为所述指定长度所指示的值，D为复数星座图中星座点的数量；
    选取模块，设置为将所述长度为R的整数序列的元素按照预设映射规则在所述复数星座图中与选取与所述元素对应的星座点；
    第三确定模块，设置为根据所述星座点确定所述复数序列。
  25. 根据权利要求24所述的装置，其中，
    所述选取模块，设置为使用能产生M元实数的伪随机序列产生器产生所述复数序列中所有复数元素的实部和虚部，或者从M元实数集合中以一定伪随机准则选取所述复数序列中所有复数元素的实部和虚部，其中，M为大于或者等于2的整数；
    所述第三确定模块，设置为根据选取的所述所有复数元素的所述实部和所述虚部确定所述复数序列。
  26. 一种码分多址接入的多用户通信装置，应用于接收机，包括：
    接收模块，设置为接收K个发射机发射的发射信号，其中，所述发射信号为所述K个发射机分别采用指定长度的扩展序列对调制信号进行扩展处理后，再分别将所述扩展后的调制信号调制到相同时频资源形成的信号，对于每一个发射机，针对N个调制符号，存在有N个指定长度的扩展序列，且所述N个指定长度的扩展序列中至少存在两个扩展序列不同，N和K均为正整数；
    检测模块，设置为根据所述扩展序列对所述发射信号进行检测。
PCT/CN2015/083479 2014-10-21 2015-07-07 码分多址接入的多用户通信方法及装置 WO2016062120A1 (zh)

Priority Applications (4)

Application Number Priority Date Filing Date Title
JP2017522059A JP6598857B2 (ja) 2014-10-21 2015-07-07 符号分割多元接続によるマルチユーザ通信方法及び装置
US15/521,096 US10651887B2 (en) 2014-10-21 2015-07-07 Multiuser communication methods and devices for code division multiple access (CDMA)
KR1020177013426A KR102432449B1 (ko) 2014-10-21 2015-07-07 코드분할 다중접속의 다중 사용자 통신 방법 및 장치
EP15853508.8A EP3211846A4 (en) 2014-10-21 2015-07-07 Multi-user communication method and apparatus of code division multiple access

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN201410564307.4A CN105591994B (zh) 2014-10-21 2014-10-21 码分多址接入的多用户通信方法及装置
CN201410564307.4 2014-10-21

Publications (1)

Publication Number Publication Date
WO2016062120A1 true WO2016062120A1 (zh) 2016-04-28

Family

ID=55760242

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2015/083479 WO2016062120A1 (zh) 2014-10-21 2015-07-07 码分多址接入的多用户通信方法及装置

Country Status (6)

Country Link
US (1) US10651887B2 (zh)
EP (1) EP3211846A4 (zh)
JP (1) JP6598857B2 (zh)
KR (1) KR102432449B1 (zh)
CN (1) CN105591994B (zh)
WO (1) WO2016062120A1 (zh)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP3651382A4 (en) * 2017-07-03 2021-03-17 ZTE Corporation DATA PROCESSING APPARATUS, DEVICE, DATA MEDIA, AND PROCESSOR

Families Citing this family (14)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
KR20190067762A (ko) * 2016-10-20 2019-06-17 광동 오포 모바일 텔레커뮤니케이션즈 코포레이션 리미티드 업링크 데이터 전송 방법, 네트워크 측 기기 및 단말 기기
CN108123903B (zh) * 2016-11-29 2021-12-14 上海诺基亚贝尔股份有限公司 通信系统中的信号处理方法和设备
CN108206723B (zh) * 2016-12-16 2022-04-29 中兴通讯股份有限公司 信号发送、信息提取方法及装置、发射器、接收器
CN112511285B (zh) * 2017-09-08 2021-11-19 华为技术有限公司 基于序列的信号处理方法及装置
WO2019095426A1 (zh) * 2017-11-17 2019-05-23 华为技术有限公司 信息处理方法和无线传输设备
CN109962751B (zh) * 2017-12-25 2022-03-01 中兴通讯股份有限公司 一种数据处理方法及装置
WO2019136697A1 (en) * 2018-01-12 2019-07-18 Zte Corporation Signal spreading techniques for multiple access in wireless networks
SG11202106944PA (en) * 2018-03-05 2021-07-29 Zte Corp Transmissions using spreading codes
US11271691B2 (en) * 2018-07-09 2022-03-08 Huawei Technologies Canada Co. Ltd. Dynamic spectrum spreading of data symbols for multiple access transmission
CN110768922B (zh) * 2018-07-26 2022-06-24 中兴通讯股份有限公司 一种数据调制方法、装置及计算机存储介质
CN110875794B (zh) * 2018-08-13 2022-04-15 中兴通讯股份有限公司 一种多址接入方法和装置、及终端
EP3878105A4 (en) * 2018-11-09 2021-11-03 ZTE Corporation DESIGN OF FLOW DIAGRAMS BASED ON GROUPS OF SYMBOLS
WO2023090481A1 (ko) * 2021-11-18 2023-05-25 엘지전자 주식회사 무선 통신 시스템에서 무선 신호 송수신 방법 및 장치
CN114337901B (zh) * 2021-12-28 2024-03-22 哈尔滨工业大学 适用于多址接入系统的多幅值序列集合的构造方法

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101043725A (zh) * 2006-03-21 2007-09-26 华为技术有限公司 一种无线通信系统中寻呼的方法
CN101366205A (zh) * 2006-03-17 2009-02-11 华为技术有限公司 一种在基于ofdma的通信系统中实现软切换的方法及装置
CN103634065A (zh) * 2012-08-24 2014-03-12 意法半导体(R&D)有限公司 Cdma信号的生成和处理

Family Cites Families (11)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP3029389B2 (ja) 1995-06-08 2000-04-04 沖電気工業株式会社 レイク方式の復調装置
US6233271B1 (en) * 1997-12-31 2001-05-15 Sony Corporation Method and apparatus for decoding trellis coded direct sequence spread spectrum communication signals
JP4107761B2 (ja) * 1999-04-12 2008-06-25 三菱電機株式会社 光子数状態発生装置
KR100696232B1 (ko) * 2000-03-23 2007-03-21 인터디지탈 테크날러지 코포레이션 대역 확산 통신 시스템에 효과적인 확산기
KR100591904B1 (ko) * 2004-03-18 2006-06-20 한국전자통신연구원 시공간 부호를 이용한 부호분할 다중접속 시스템의 전송다이버시티 송수신 장치, 및 그 방법
JP4539969B2 (ja) 2004-08-25 2010-09-08 モトローラ・インコーポレイテッド マルチキャリアスペクトル拡散通信装置及びマルチキャリアスペクトル拡散通信方法
US7376173B2 (en) 2004-09-27 2008-05-20 Mitsubishi Electric Research Laboratories, Inc. Unambiguously encoding and decoding signals for wireless channels
US7389099B2 (en) 2005-04-22 2008-06-17 Telefonaktiebolaget L M Ericsson (Publ) Method and apparatus for canceling interference from high power, high data rate signals
US8457221B2 (en) 2006-09-08 2013-06-04 Qualcomm Incorporated Signaling transmission with localized spreading for wireless communication
KR101104829B1 (ko) * 2006-10-03 2012-01-16 콸콤 인코포레이티드 무선 통신에서 1차 동기 신호와 2차 동기 신호를 처리하는 방법 및 장치
WO2014053064A1 (en) * 2012-10-05 2014-04-10 Sierra Wireless, Inc. Enhancement for lte communication systems

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101366205A (zh) * 2006-03-17 2009-02-11 华为技术有限公司 一种在基于ofdma的通信系统中实现软切换的方法及装置
CN101043725A (zh) * 2006-03-21 2007-09-26 华为技术有限公司 一种无线通信系统中寻呼的方法
CN103634065A (zh) * 2012-08-24 2014-03-12 意法半导体(R&D)有限公司 Cdma信号的生成和处理

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
See also references of EP3211846A4 *

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP3651382A4 (en) * 2017-07-03 2021-03-17 ZTE Corporation DATA PROCESSING APPARATUS, DEVICE, DATA MEDIA, AND PROCESSOR
US11489609B2 (en) 2017-07-03 2022-11-01 Zte Corporation Data processing method and apparatus, device, storage medium, and processor

Also Published As

Publication number Publication date
CN105591994B (zh) 2019-08-02
US10651887B2 (en) 2020-05-12
JP6598857B2 (ja) 2019-10-30
EP3211846A1 (en) 2017-08-30
EP3211846A4 (en) 2017-11-29
CN105591994A (zh) 2016-05-18
KR102432449B1 (ko) 2022-08-16
JP2017537512A (ja) 2017-12-14
US20170353213A1 (en) 2017-12-07
KR20170072919A (ko) 2017-06-27

Similar Documents

Publication Publication Date Title
WO2016062120A1 (zh) 码分多址接入的多用户通信方法及装置
AU2019200710B2 (en) Multi-user code division multiple access communication method, and corresponding transmitter and receiver
RU2404529C2 (ru) Способ и устройство для мультиплексирования пилот-сигнала в системе беспроводной связи
WO2016078303A1 (zh) 数据传输方法及装置
WO2016150241A1 (zh) 一种数据传输方法及装置
JP2010529769A (ja) データの符号化変調およびチャネル推定のためのシーケンスを設計するシステムおよび方法
WO2016155390A1 (zh) 一种数据传输方法及装置
US10171128B2 (en) Data transmission method and apparatus
US20230128676A1 (en) Generation and reception of signals comprising cyclically shifted orthogonal basis functions
GB2537149A (en) Method and apparatus for wireless communication in a multiuser environment

Legal Events

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

Ref document number: 15853508

Country of ref document: EP

Kind code of ref document: A1

ENP Entry into the national phase

Ref document number: 2017522059

Country of ref document: JP

Kind code of ref document: A

NENP Non-entry into the national phase

Ref country code: DE

WWE Wipo information: entry into national phase

Ref document number: 15521096

Country of ref document: US

REEP Request for entry into the european phase

Ref document number: 2015853508

Country of ref document: EP

ENP Entry into the national phase

Ref document number: 20177013426

Country of ref document: KR

Kind code of ref document: A