CN111817995A - Method for non-coherent transmission of data - Google Patents

Method for non-coherent transmission of data Download PDF

Info

Publication number
CN111817995A
CN111817995A CN201910290409.4A CN201910290409A CN111817995A CN 111817995 A CN111817995 A CN 111817995A CN 201910290409 A CN201910290409 A CN 201910290409A CN 111817995 A CN111817995 A CN 111817995A
Authority
CN
China
Prior art keywords
modulation
symbol
symbol set
symbols
matrix
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Granted
Application number
CN201910290409.4A
Other languages
Chinese (zh)
Other versions
CN111817995B (en
Inventor
秦熠
汪凡
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Huawei Technologies Co Ltd
Original Assignee
Huawei Technologies Co Ltd
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 Huawei Technologies Co Ltd filed Critical Huawei Technologies Co Ltd
Priority to CN202111497001.8A priority Critical patent/CN114844606A/en
Priority to CN201910290409.4A priority patent/CN111817995B/en
Priority to PCT/CN2020/078955 priority patent/WO2020207182A1/en
Publication of CN111817995A publication Critical patent/CN111817995A/en
Application granted granted Critical
Publication of CN111817995B publication Critical patent/CN111817995B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • 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
    • H04L27/2601—Multicarrier modulation systems
    • H04L27/2626—Arrangements specific to the transmitter only
    • H04L27/2627—Modulators
    • H04L27/2634—Inverse fast Fourier transform [IFFT] or inverse discrete Fourier transform [IDFT] modulators in combination with other circuits for modulation
    • H04L27/2636—Inverse fast Fourier transform [IFFT] or inverse discrete Fourier transform [IDFT] modulators in combination with other circuits for modulation with FFT or DFT modulators, e.g. standard single-carrier frequency-division multiple access [SC-FDMA] transmitter or DFT spread orthogonal frequency division multiplexing [DFT-SOFDM]
    • 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
    • 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
    • H04L27/2601—Multicarrier modulation systems
    • H04L27/2626—Arrangements specific to the transmitter only
    • H04L27/2627—Modulators
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L5/00—Arrangements affording multiple use of the transmission path
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L5/00—Arrangements affording multiple use of the transmission path
    • H04L5/003—Arrangements for allocating sub-channels of the transmission path
    • H04L5/0044—Arrangements for allocating sub-channels of the transmission path allocation of payload

Landscapes

  • Engineering & Computer Science (AREA)
  • Signal Processing (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Physics & Mathematics (AREA)
  • Discrete Mathematics (AREA)
  • General Physics & Mathematics (AREA)
  • Mathematical Physics (AREA)
  • Mobile Radio Communication Systems (AREA)
  • Digital Transmission Methods That Use Modulated Carrier Waves (AREA)

Abstract

An embodiment of the present application provides a data transmission method, including: a sending end maps input bits into modulation symbols in a modulation symbol set according to a modulation mapping relation between a bit value and the modulation symbols in the modulation symbol set to obtain output modulation symbols, wherein the input bits comprise b bits, the output modulation symbols comprise M multiplied by T complex numbers, b, M and T are positive integers, and T is larger than 1; the transmitting end transmits the output modulation symbols in T resource units through M antenna ports; wherein the modulation symbol set is a first symbol set, the first symbol set is obtained according to a second symbol set, and the first symbol set comprises 2bA modulation symbol, the second symbol set including 2aA and b are integers. By this method, the storage cost in the system can be reduced.

Description

Method for non-coherent transmission of data
Technical Field
The present application relates to the field of communications technologies, and in particular, to a method and an apparatus for noncoherent transmission of data.
Background
In a wireless communication system, a transmitting end and a receiving end may perform wireless communication based on various multiple access techniques, such as: code Division Multiple Access (CDMA), Time Division Multiple Access (TDMA), Frequency Division Multiple Access (FDMA), Orthogonal Frequency Division Multiple Access (OFDMA), single carrier frequency division multiple access (SC-FDMA), non-orthogonal multiple access (NOMA), and the like.
In the process of wireless communication between a transmitting end and a receiving end, modulation schemes are widely used, for example, Quadrature Amplitude Modulation (QAM) schemes such as Binary Phase Shift Keying (BPSK), Quadrature Phase Shift Keying (QPSK), 16-order quadrature amplitude modulation (16 QAM). By adopting a modulation scheme, the sending end can modulate one or more information bits into a complex symbol and send the complex symbol to the receiving end through wireless resources, so that more information bits can be sent through less wireless resources.
Disclosure of Invention
In a first aspect, a data transmission method is provided.
In one possible implementation, the method includes: mapping input bits into modulation symbols in a modulation symbol set according to a modulation mapping relation between a bit value and the modulation symbols in the modulation symbol set to obtain output modulation symbols, wherein the input bits comprise b bits, the output modulation symbols comprise M multiplied by T complex numbers, b, M and T are positive integers, and T is greater than 1; transmitting the output modulation symbols in T resource elements through M antenna ports; wherein the modulation symbol set is a first symbol set, the first symbol set is obtained according to a second symbol set, and the first symbol set comprises 2bA modulation symbol, the second symbol set including 2aA and b are integers.
In one possible implementation, the method includes: mapping input bits into modulation symbols in a modulation symbol set according to a modulation mapping relation between a bit value and the modulation symbols in the modulation symbol set to obtain output modulation symbols, wherein the input bits comprise b bits, the output modulation symbols comprise M multiplied by T complex numbers, b, M and T are positive integers, and T is greater than 1; transmitting the output modulation symbols in T resource elements through M antenna ports; when b is greater than a, the modulation symbol set is a first symbol set, when b is less than or equal to a, the second symbol set comprises the modulation symbol set, the first symbol set is obtained according to the second symbol set, and the first symbol is obtained according to the second symbol setIncluding 2 in the setbA modulation symbol, the second symbol set including 2aA and b are integers.
By the method, the modulation symbol set used for modulation can be a first symbol set, the first symbol set is obtained according to a second symbol set with less data, so that only the second symbol set can be stored without storing the first symbol set, and the first symbol set is obtained through the second symbol set according to needs, so that the storage space can be saved.
In one possible implementation, the first set of symbols is derived from the second set of symbols, including: one modulation symbol of the first set of symbols is included in the second set of symbols; or one modulation symbol in the first symbol set is determined from one modulation symbol in the second symbol set.
By the method, the elements in the second symbol set are multiplexed as the elements in the first symbol set, so that the system design can be simplified, and the calculation complexity can be reduced.
In one possible implementation, one modulation symbol in the first set of symbols is determined from one modulation symbol in a second set of symbols, including: the one modulation symbol in the first symbol set is equal to a modulation symbol obtained by dot-multiplying the one modulation symbol in the second symbol set with a first generation matrix; the first generator matrix is equal to one of T second generator matrices, or the first generator matrix is equal to a generator matrix obtained by dot multiplication of p second generator matrices, the T second generator matrices include the p second generator matrices, T is equal to b minus a, the first generator matrix includes M × T complex elements, and any one of the T second generator matrices includes M × T complex elements.
By the method, the first symbol set can be obtained under the condition of only storing t generating matrixes and the second symbol set, and the number of the modulation symbols of the first symbol set is 2^ t times of the number of the modulation symbols in the second symbol set, so that a larger symbol set can be obtained with lower storage overhead.
In one possible implementation, one modulation symbol in the first set of symbols is determined from one modulation symbol in a second set of symbols, including: the one modulation symbol in the first symbol set is equal to a modulation symbol obtained by dot-multiplying the one modulation symbol in the second symbol set with a first generation matrix; the first generating matrix is equal to one second generating matrix in one second generating matrix group in t second generating matrix groups, or the first generating matrix is equal to a generating matrix obtained by dot multiplication of p second generating matrices, the p second generating matrices are included in the p second generating matrix groups in a one-to-one manner, the p second generating matrix groups are included in the t second generating matrix groups, p is an integer with a value range of 2 to t, and t is an integer; wherein a j-th group of the t second generation matrix groups includes
Figure BDA0002024726570000023
A second one of the generating matrices is then generated,
Figure BDA0002024726570000021
j is an integer having a value ranging from 1 to t, CjAre integers.
By the method, the first symbol set capable of modulating more bit numbers can be obtained under the condition of only storing the t generating matrix groups and the second symbol set, so that a larger symbol set can be obtained with lower storage overhead.
In one possible implementation, the first set of symbols is derived from the second set of symbols, including: one modulation symbol in the first set of symbols is determined from one modulation symbol in the second set of symbols.
In one possible implementation, one modulation symbol in the first set of symbols is determined from one modulation symbol in a second set of symbols, including: the one modulation symbol of the first set of symbols is equal to the one modulation symbol of the second set of symbols and a first generation momentCarrying out dot multiplication on the matrix to obtain a modulation symbol; the first generating matrix is equal to one second generating matrix in one second generating matrix group in t second generating matrix groups, or the first generating matrix is equal to a generating matrix obtained by dot multiplication of p second generating matrices, the p second generating matrices are included in the p second generating matrix groups in a one-to-one manner, the p second generating matrix groups are included in the t second generating matrix groups, p is an integer with a value range of 2 to t, and t is an integer; wherein a j-th group of the t second generation matrix groups includes
Figure BDA0002024726570000024
A second one of the generating matrices is then generated,
Figure BDA0002024726570000022
j is an integer having a value ranging from 1 to t, CjAre integers. In one possible implementation, each second generator matrix group includes a matrix of all 1 s.
By the method, the first symbol set capable of modulating more bit numbers can be obtained under the condition of only storing the t generating matrix groups and the second symbol set, so that a larger symbol set can be obtained with lower storage overhead.
In one possible implementation, there is a non-linear relationship between any two second generator matrices. Illustratively, any two second generating matrices in the t second generating matrices have a non-linear relationship. Illustratively, any two second generating matrices are in a nonlinear relationship, and the two second generating matrices may be included in the same group of the t second generating matrix groups or may be included in different groups of the t second generating matrix groups.
By the method, the modulation symbols generated by different generation matrixes are in a nonlinear relation, so that a receiving end can distinguish different modulation symbols and the correct receiving rate of the receiving end is improved.
In one possible implementation, for one second generator matrix, the elements of the one second generator matrix are of the same magnitude. The method can ensure that the power of each element is the same during transmission, can reduce the PAPR of the data sent by the sending end, and is beneficial to the hardware realization of the sending end.
In one possible implementation, the modulation symbols in the second symbol set are orthogonal between each other. By the method, the demodulation accuracy of the receiving end can be improved, so that the data transmission rate can be improved.
In a second aspect, an apparatus is provided, where the apparatus may be a network device (or a terminal device), or an apparatus in the network device (or the terminal device), or an apparatus capable of being used in cooperation with the network device (or the terminal device). In one design, the apparatus may include a module corresponding to one or more of the methods/operations/steps/actions described in the first aspect, where the module may be implemented by hardware circuit, software, or a combination of hardware circuit and software. In one design, the apparatus may include a processing module and a communication module.
In one possible implementation, the processing module is configured to map an input bit to a modulation symbol in a modulation symbol set according to a modulation mapping relationship between a bit value and the modulation symbol in the modulation symbol set to obtain an output modulation symbol, where the input bit includes b bits, the output modulation symbol includes M × T complex numbers, b, M, and T are positive integers, and T is greater than 1; the processing module transmits the output modulation symbols in T resource units through M antenna ports by using the communication module; wherein the modulation symbol set is a first symbol set, the first symbol set is obtained according to a second symbol set, and the first symbol set comprises 2bA modulation symbol, the second symbol set including 2aA and b are integers.
In one possible implementation, the processing module is configured to map input bits into modulation symbols in a modulation symbol set according to a modulation mapping relationship between a bit value and the modulation symbols in the modulation symbol set to obtain output modulation symbols, where the input bits include b bits, the output modulation symbols include M × T complex numbers, and b, M, and T are M × T complex numbersA positive integer, T is greater than 1; the processing module transmits the output modulation symbols in T resource units through M antenna ports by using the communication module; when b is greater than a, the modulation symbol set is a first symbol set, when b is less than or equal to a, the second symbol set comprises the modulation symbol set, the first symbol set is obtained according to the second symbol set, and the first symbol set comprises 2bA modulation symbol, the second symbol set including 2aA and b are integers.
The descriptions of the first symbol set and the second symbol set are the same as the descriptions of the first aspect, and are not repeated here.
In a third aspect, an embodiment of the present application provides an apparatus, which includes a processor, and is configured to implement the method described in the first aspect. The memory is coupled to the processor, and the processor, when executing the instructions stored in the memory, may implement the method described in the first aspect above. The apparatus may also include a memory to store instructions and data. The apparatus may also include a communication interface for the apparatus to communicate with other devices, which may be, for example, a transceiver, circuit, bus, module, pin, or other type of communication interface.
In one possible design, the apparatus includes: a memory, a processor and a communication interface,
a memory for storing program instructions;
the processor is configured to map an input bit into a modulation symbol in a modulation symbol set according to a modulation mapping relationship between a bit value and the modulation symbol in the modulation symbol set, so as to obtain an output modulation symbol, where the input bit includes b bits, the output modulation symbol includes M × T complex numbers, b, M, and T are positive integers, and T is greater than 1; the processor transmits the output modulation symbols in T resource elements through M antenna ports using the communication interface; wherein the modulation symbol set is a first symbol set obtained according to a second symbol setTo, said first set of symbols comprises 2bA modulation symbol, the second symbol set including 2aA and b are integers.
In one possible design, the apparatus includes: a memory, a processor and a communication interface,
a memory for storing program instructions;
the processor is configured to map an input bit into a modulation symbol in a modulation symbol set according to a modulation mapping relationship between a bit value and the modulation symbol in the modulation symbol set, so as to obtain an output modulation symbol, where the input bit includes b bits, the output modulation symbol includes M × T complex numbers, b, M, and T are positive integers, and T is greater than 1; the processor transmits the output modulation symbols in T resource elements through M antenna ports using the communication interface; when b is greater than a, the modulation symbol set is a first symbol set, when b is less than or equal to a, the second symbol set comprises the modulation symbol set, the first symbol set is obtained according to the second symbol set, and the first symbol set comprises 2bA modulation symbol, the second symbol set including 2aA and b are integers.
The descriptions of the first symbol set and the second symbol set are the same as the descriptions of the first aspect, and are not repeated here.
In a fourth aspect, embodiments of the present application provide a computer program product containing instructions which, when run on a computer, cause the computer to perform the method described in the first aspect or any one of the possible designs of the first aspect.
In a fifth aspect, embodiments of the present application provide a computer-readable storage medium, comprising instructions that, when executed on a computer, cause the computer to perform the method described in the first aspect or any one of the possible designs of the first aspect.
In a sixth aspect, an embodiment of the present application provides a chip system, where the chip system includes a processor and may further include a memory, and is configured to implement the method described in the first aspect or any one of the possible designs of the first aspect.
In a seventh aspect, an embodiment of the present application provides a communication system, where the communication system includes any one of the apparatuses described in the second aspect and a receiving apparatus, where the receiving apparatus is configured to receive a modulation symbol transmitted by any one of the apparatuses described in the second aspect; or the communication system comprises any device described in the third aspect and a receiving device, wherein the receiving device is configured to receive the modulation symbol transmitted by any device described in the third aspect.
Drawings
Fig. 1 illustrates a non-coherent transmission method according to an embodiment of the present application;
fig. 2 is a schematic diagram of a resource grid according to an embodiment of the present application;
fig. 3 is a schematic flow chart of modulation provided in the embodiment of the present application;
fig. 4 and 5 are schematic structural diagrams of an apparatus provided in an embodiment of the present application.
Detailed Description
The technical scheme provided by the embodiment of the application can be applied to various communication systems. For example, the technical solution provided in the embodiments of the present application may be applied to a communication system capable of performing data transmission by using time-frequency resources. The technical scheme provided by the embodiment of the application can be applied to but not limited to: a fifth generation (5G) mobile communication system, a Long Term Evolution (LTE) or a future communication system. Among them, 5G may also be referred to as New Radio (NR).
The technical scheme provided by the embodiment of the application can be applied to wireless communication among communication devices. The communication device may include a network device and a terminal device. Wireless communication between communication devices may include, but is not limited to: wireless communication between a network device and a terminal device, wireless communication between a network device and a network device, and wireless communication between a terminal device and a terminal device. In the embodiments of the present application, the term "wireless communication" may also be simply referred to as "communication", and the term "communication" may also be described as "data transmission", "signal transmission", "information transmission", or "transmission", or the like. In embodiments of the present application, the transmission may comprise sending or receiving. For example, the transmission may be an uplink transmission, for example, the terminal device may send a signal to the network device; the transmission may also be downlink transmission, for example, the network device may send a signal to the terminal device. In the embodiments of the present application, the wireless communication between the communication devices may be described as: the transmitting end transmits a signal to the receiving end, and the receiving end receives the signal from the transmitting end.
The terminal device related to the embodiments of the present application may also be referred to as a terminal, and may be a device having a wireless transceiving function. The terminal can be deployed on land, including indoors or outdoors, hand-held or vehicle-mounted; can also be deployed on the water surface (such as a ship and the like); and may also be deployed in the air (e.g., airplanes, balloons, satellites, etc.). The terminal device may be a User Equipment (UE). The UE includes a handheld device, an in-vehicle device, a wearable device, or a computing device with wireless communication capabilities. Illustratively, the UE may be a mobile phone (mobile phone), a tablet computer, or a computer with wireless transceiving function. The terminal device may also be a Virtual Reality (VR) terminal device, an Augmented Reality (AR) terminal device, a wireless terminal in industrial control, a wireless terminal in unmanned driving, a wireless terminal in telemedicine, a wireless terminal in smart grid, a wireless terminal in smart city (smart city), a wireless terminal in smart home (smart volume), and so on. In the embodiment of the present application, the apparatus for implementing the function of the terminal may be a terminal; it may also be a device, such as a system-on-chip, capable of supporting the terminal to implement the function, which may be installed in the terminal. In the embodiment of the present application, the chip system may be composed of a chip, and may also include a chip and other discrete devices. In the technical solution provided in the embodiment of the present application, a device for implementing a function of a terminal is a terminal, and the terminal is a UE as an example, the technical solution provided in the embodiment of the present application is described.
The network device according to the embodiment of the present application includes a Base Station (BS), which may be a device deployed in a radio access network and capable of performing wireless communication with a terminal. The base station may have various forms, such as a macro base station, a micro base station, a relay station, an access point, and the like. For example, the base station related to the embodiment of the present application may be a base station in 5G or a base station in LTE, where the base station in 5G may also be referred to as a Transmission Reception Point (TRP) or a gnb (gnnodeb). In the embodiment of the present application, the apparatus for implementing the function of the network device may be a network device; or may be a device, such as a system-on-chip, capable of supporting the network device to implement the function, and the device may be installed in the network device. In the technical solution provided in the embodiment of the present application, a device for implementing a function of a network device is a network device, and the network device is a base station, which is taken as an example, to describe the technical solution provided in the embodiment of the present application.
When data transmission is performed between communication devices, a sending end sends data to a receiving end, and illustratively, a base station sends data to a UE, or the UE sends data to the base station. The data transmission may include coherent transmission and non-coherent transmission, among others.
In coherent transmission, a transmitting end transmits data to a receiving end through a data channel. In order to enable the receiving end to correctly receive the data carried on the data channel, the transmitting end also transmits a Reference Signal (RS) to the receiving end, where a sequence value of the RS is known by the transmitting end and the receiving end, and the RS may also be referred to as a pilot. After receiving the RS, the receiving end may perform channel estimation using the known RS sequence value and the received RS sequence value, and the channel estimation result may reflect channel state information of the RS. The receiving end can decode the data channel by using the channel state information of the RS, thereby obtaining the data carried on the data channel. In coherent transmission, a transmitting end transmits an RS to a receiving end, and the receiving end decodes a data channel according to a channel estimation result or according to channel state information.
Unlike coherent transmission, in non-coherent transmission, a transmitting end may not need to transmit an RS to a receiving end, and the receiving end may not decode a data channel according to a channel estimation result or according to channel state information. In a possible non-coherent transmission, a transmitting end maps information bits into modulation symbols in a modulation symbol set a, and transmits the obtained modulation symbols to a receiving end through a data channel. The modulation symbol set a is known information of the transmitting end and the receiving end. After receiving the modulation symbols passing through the data channel, the receiving end calculates the correlation or distance between the received modulation symbols and each modulation symbol in the modulation symbol set a, and considers that the modulation symbol corresponding to the maximum correlation value or the minimum distance in the modulation symbol set a is the modulation symbol sent by the sending end, so that the receiving end can obtain the information bits sent by the sending end. In the embodiment of the present application, a modulation symbol in a modulation symbol set may also be referred to as a codebook, and a modulation symbol set may be referred to as a codebook set.
For the non-coherent transmission method, the modulation symbol set a can be searched from a larger modulation symbol set B by a method of searching a codebook by a computer, the modulation symbol set a is a subset of the modulation symbol set B, and the distance between every two modulation symbols in the modulation symbol set a is made to be larger as much as possible, so that the decoding accuracy of a receiving end is increased. However, when the modulation symbol set a includes more modulation symbols, it is difficult to retrieve the modulation symbol set a in order to ensure that the distance between two modulation symbols in the modulation symbol set a is large. In order to implement the above method for searching codebook by computer, it is necessary to store the modulation symbol set B and the searched modulation symbol set a. If each modulation symbol in the modulation symbol set a and the modulation symbol set B is a matrix with a large dimension, a large storage space is needed to store the modulation symbol set a and the modulation symbol set B, and thus a large amount of storage equipment is needed, which is expensive.
In order to save storage cost in a non-coherent transmission method, embodiments of the present application provide a non-coherent transmission method, apparatus, and system for data.
Fig. 1 illustrates a first non-coherent transmission method according to an embodiment of the present application.
S101, the sending end modulates input bits to obtain output modulation symbols.
In one possible implementation, the sending end bases on the ratioAnd mapping the input bits into the modulation symbols in the modulation symbol set according to the mapping relation between the special value and the modulation symbols in the modulation symbol set to obtain output modulation symbols. The input bits include b bits, the output modulation symbols include M × T complex numbers, and M and T are positive integers. Illustratively, T is greater than 1. The modulation symbol set is a first symbol set, the first symbol set is obtained according to a second symbol set, and the first symbol set comprises 2bOne modulation symbol, the second symbol set including 2aA and b are integers. The method can be applied to various scenes, for example, the method can be applied to the scenes that a is smaller than b, or the method can be applied to the scenes that a is larger than or equal to b.
In the embodiments of the present application, a and b may be integers of 0, 1, 2, 3 or more. The positive integer can be 1, 2, 3, 4, or greater.
Alternatively, the method may be described as: and the sending end maps the input bits into modulation symbols in a modulation symbol set according to the constellation diagram to obtain output modulation symbols. The input bits include b bits, the output modulation symbols include M × T complex numbers, and M and T are positive integers. Illustratively, T is greater than 1. The modulation symbol set is a first symbol set, the first symbol set is obtained according to a second symbol set, and the first symbol set comprises 2bOne modulation symbol, the second symbol set including 2aA and b are integers. Alternatively, a may be greater than or equal to b, or less than b.
In a possible implementation, the transmitting end maps the input bits to the modulation symbols in the modulation symbol set according to a mapping relationship between the bit values and the modulation symbols in the modulation symbol set, so as to obtain output modulation symbols. The input bits include b bits, the output modulation symbols include M × T complex numbers, and M and T are positive integers. Illustratively, T is greater than 1. When b is larger than a, the modulation symbol set is a first symbol set; and b is less than or equal to a, the second set of symbols comprises a set of modulation symbols. The first symbol set is obtained according to the second symbol set, and the first symbol set comprises 2bPersonal keyMaking symbols, the second set of symbols including 2aA and b are integers.
Alternatively, the method may be described as: and the sending end maps the input bits into modulation symbols in a modulation symbol set according to the constellation diagram to obtain output modulation symbols. The input bits include b bits, the output modulation symbols include M × T complex numbers, and M and T are positive integers. Illustratively, T is greater than 1. When b is larger than a, the modulation symbol set is a first symbol set; and b is less than or equal to a, the second set of symbols comprises a set of modulation symbols. The first symbol set is obtained according to the second symbol set, and the first symbol set comprises 2bOne modulation symbol, the second symbol set including 2aA and b are integers.
The first symbol set comprises 2bEach modulation symbol may include M × T complex numbers therein. The second symbol set comprises 2aEach modulation symbol may include M × T complex numbers therein. In the embodiment of the present application, the inclusion of M × T complex numbers in one modulation symbol can also be described as: the modulation symbols are matrix of dimension M × T or matrix of M rows and T columns, each element in the matrix being a complex number. The values of different elements in the same matrix may be the same or different, and the application is not limited thereto. In the embodiment of the present application, for a complex number, the real part may be 0 and the imaginary part may not be 0, or the real part may not be 0 and the imaginary part may be 0, or both the real part and the imaginary part may not be 0, and the embodiment of the present application is not limited.
In S101, the input bits have a length of b, that is, the input bits include b bits, and the b bits have a total of 2bPossible values or bit values are included in the modulation symbol setbOne modulation symbol, b bits possible 2bSeed bit value and 2 of modulation symbol setbThere is a one-to-one mapping between modulation symbols, i.e. 2bOne-to-one mapping of possible bit values to the 2bAnd a modulation symbol.
In S101, the second symbol set packetInvolving a set of modulation symbols, i.e. involving 2 in a set of modulation symbolsbA modulation symbol of 2bThe modulation symbols belong to a second set of symbols. The method comprises the following steps: the second symbol set is a modulation symbol set, or a part of modulation symbols in the second symbol set constitutes the modulation symbol set. For example, when b is equal to a, the second set of symbols is a set of modulation symbols. As another example, when b is less than a, 2 in the second symbol setbThe modulation symbols forming a set of modulation symbols, e.g. 1 st to 2 nd in a second set of symbolsbThe modulation symbols forming a set of modulation symbols, or other 2bThe modulation symbols constitute a modulation symbol set, which is not limited in this application.
In the embodiments of the present application, the mapping relationship between the bit values and the modulation symbols in the modulation symbol set may also be referred to as a modulation mapping relationship. The mapping relationship may be represented in a tabular form, such as that shown in table 1; or may be expressed in the form of a formula, where the input is a bit value and the output is a modulation symbol to which the bit value is mapped; or may be represented in the form of a constellation diagram, in which a modulation symbol in a set of modulation symbols may be referred to as a constellation point, and one constellation point may correspond to one bit value. In the embodiment of the present application, one bit value may be described as one bit value.
In the embodiment of the present application, for a symbol set used for modulation, such as the modulation symbol set, the first symbol set, or the second symbol set described above, when the symbol set includes 2uWhen each modulation symbol is modulated using the symbol set, 2 corresponding to u bits may be assigned to u bits, as shown in table 1, taking u equals 2 as an exampleuOne-to-one mapping of possible bit values to the 2uAnd a modulation symbol. The modulation mapping capability of the symbol set may be referred to as u bits, or the modulation mapping capability of a constellation diagram of the modulation method may be referred to as u bits, or the modulation mapping capability of a constellation diagram corresponding to the symbol set may be referred to as u bits. Wherein u is an integer greater than or equal to 0. In the embodiments of the present application, the integer greater than or equal to 0 may be an integer of 0, 1, 2, 3, or more, and the present application is not limited.In the embodiment of the present application, the modulation mapping capability may also be referred to as a modulation capability, a mapping capability, or another name, which is not limited in the present application.
TABLE 1
u bit values, u being 2 Modulation symbols corresponding to bit values, where M is 1 and T is 4
00 X1＝[1,1,1,1]
01 X2＝[1,1,-1,-1]
10 X3＝[1,-1,1,-1]
11 X4＝[1,-1,-1,1]
By the method provided by the embodiment of the application, the sending end can modulate the input bits in the input bit stream into one or more modulation symbols and send the one or more modulation symbols to the receiving end. Illustratively, when the number of input bits in the input bit stream is greater than b bits, the sending end may perform the method provided in the embodiment on each b bits in the input bit stream, to obtain a set of output modulation symbols, where the set of output modulation symbols includes one or more modulation symbols, and the sending end may send the set of modulation symbols to the sending end. In the embodiments of the present application, the plurality may be 2, 3, 4, 5 or more, and the present application is not limited thereto.
Illustratively, the modulation symbol sets include modulation symbols X1, X2, X3 and X4 shown in table 1, the mapping relationship between the bit values and the modulation symbols is shown in table 1, and the input bit stream is 000101111110. The transmitting end may modulate each 2 bits of the input bit stream, that is, modulate 00, 01, 11, and 10, respectively, to obtain a set of output modulation symbols, where the set of output modulation symbols sequentially includes modulation symbols X1, X2, X2, X4, X4, and X3. The transmitting end may transmit the modulation symbols in the set of output modulation symbols to the receiving end.
In the embodiment of the present application, the input bitstream may be a bitstream of various channels, for example: a broadcast channel (PBCH), a Primary Synchronization Signal (PSS), a Secondary Synchronization Signal (SSS), a Physical Downlink Shared Channel (PDSCH), a Physical Downlink Control Channel (PDCCH), a Physical Uplink Shared Channel (PUSCH), a Physical Uplink Control Channel (PUCCH), various types of uplink Reference Signals (RSs), various types of downlink RSs, or other possible physical channels, and the like, and the present application is not limited thereto.
In the embodiment of the present application, the bit stream of the channel may be a bit stream a sent by the MAC layer to the physical layer; or may be a bit stream B obtained by performing a bit-level operation on the bit stream a, which is not limited in the embodiment of the present application. The bit-level operations may include one or more of code block segmentation, adding Cyclic Redundancy Check (CRC), channel coding, rate matching, code block concatenation, interleaving, and scrambling. Illustratively, the bit-level operations may include adding CRC, code block segmentation, channel coding, code block concatenation, and scrambling; alternatively, the bit-level operations may include adding CRC, code block segmentation, channel coding, code block concatenation, rate matching, interleaving, and scrambling; alternatively, the bit-level operations may include adding CRC, channel coding, rate matching, interleaving, and scrambling.
And S102, the sending end sends the obtained output modulation symbol to the receiving end. And the transmitting end transmits the output modulation symbols in the T resource units through the M antenna ports. Accordingly, the receiving end receives the modulation symbols sent by the sending end in the T resource units.
In this embodiment, when a sending end sends a signal to a receiving end, for example, when sending a modulation symbol, the sending end may directly send the signal to the receiving end through an air interface; or the signal may be processed (for example, one or more of layer mapping, precoding, resource mapping, inverse fourier transform, filtering, and up-conversion), and then the processed signal is sent over the air interface, which is not limited in this application.
In the embodiment of the present application, the resource unit may be a Resource Element (RE).
In the embodiment of the present application, an RE is a resource unit for data transmission or a resource unit for resource mapping of data to be transmitted. For one antenna port, the time-frequency resources used for data transmission may be represented as a resource grid. Fig. 2 shows a resource grid corresponding to one antenna port. As shown in fig. 2, one RE corresponds to one time domain symbol in the time domain, for example, an Orthogonal Frequency Division Multiplexing (OFDM) symbol or a discrete fourier transform spread OFDM (discrete fourier transform) symbol
DFT-s-OFDM) symbol, the frequency domain corresponds to one subcarrier. One RE may carry one complex symbol, for example, a complex symbol obtained through modulation or a complex symbol obtained through precoding, which is not limited in this application. In the frequency domain, Resource Blocks (RBs) may be defined in a resource grid, and in the frequency domain, one RB may include a positive integer number of subcarriers, e.g., 12. Further, the definition of RB may also be extended to the time domain, for example, one RB includes a positive integer number of subcarriers in the time domain and a positive integer number of symbols in the time domain, for example, one RB is a time-frequency resource block including 12 subcarriers in the frequency domain and 7 or 14 symbols in the time domain. A positive integer number of RBs may be included in the resource grid. A slot (slot) may be defined in the time domain of the resource grid or time frequency resource, and a positive integer number of time domain symbols, e.g., 7 or 14, may be included in one slot. Subframes (subframes) may be defined in a resource grid or time domain of time-frequency resources, and a subframe may include a positive integer number of symbols or a positive integer number of slots.
In the embodiment of the present application, the antenna ports are logical antenna ports, and one antenna port may correspond to one or more physical antennas. For an antenna port, a first channel for transmitting a first signal may be deduced from a second channel for transmitting a second signal at the antenna port.
Assuming that the output modulation symbol obtained by the transmitting end in S101 is denoted as X, M is 2 and T is 4, X includes 2 × 4 complex numbers, and X may be denoted as the following matrix:
Figure BDA0002024726570000091
wherein, the element x00Element x01Element x02Element x03Element x10Element x11Element x12And the element x13The number of the elements is plural, and the values between two of the elements may be the same or different, and the application is not limited. The transmitting end can transmit the element x in 4 REs through the antenna port 0 respectively00Element x01Element x02And the element x03One element is sent in each RE; the transmitting end can transmit the element x in 4 REs through the antenna port 1 respectively10Element x11Element x12And the element x13One element is sent in each RE. The 4 REs of antenna port 0 and the 4 REs of antenna port 1 may be the same resources in the time-frequency domain, e.g., corresponding to the same subcarriers in the frequency domain and the same symbols in the time domain.
And S103, the receiving end demodulates the received modulation symbol.
The modulation symbol sent by the sending end is received by the receiving end after passing through the channel. The modulation symbols may undergo various distortions such as amplitude amplification or reduction, phase offset, etc. while passing through the channel. After receiving a signal from a transmitting end at an air interface, a receiving end may process the signal, for example, down-convert, phase shift, de-precode, and the like, to obtain a complex symbol before demodulation, where the complex symbol may be referred to as a modulation symbol received by the receiving end.
After receiving the modulation symbols, the receiving end may respectively correlate the received modulation symbols with each modulation symbol in the modulation symbol set, consider that the modulation symbol corresponding to the maximum correlation value is the modulation symbol sent by the sending end, and consider that the bit value corresponding to the modulation symbol sent by the sending end is the bit value sent by the sending end.
Or, after receiving the modulation symbol, the receiving end demodulates the received modulation symbol through a Generalized Likelihood Ratio Test (GLRT) receiver. For example, the receiving end calculates distances between the received modulation symbols and the modulation symbols in the modulation symbol set, considers that the modulation symbol corresponding to the minimum distance is the modulation symbol transmitted by the transmitting end, and considers that the bit value corresponding to the modulation symbol transmitted by the transmitting end is the bit value transmitted by the transmitting end.
Illustratively, according to the method shown in fig. 1, the transmitting end and the receiving end use the mapping relationship shown in table 1 to perform non-coherent transmission. Assuming that the bit value of the input bit is 01, the transmitting end transmits a modulation symbol X2, i.e., [1,1, -1, -1], to the receiving end. The modulation symbol X2 passes through the channel H and is received by the receiving end, the modulation symbol Y received by the receiving end is H × X2+ W, where W represents noise and W is [ W1, W2, W3, W4],
y ═ H × 1+ w1, H × 1+ w2, hxx (-1) + w3, hxx (-1) + w4] ═ H + w1, H + w2, -H + w3, -H + w 4. Wherein H, w1, w2, w3 and w4 are plural numbers respectively.
The receiving end demodulates the received modulation symbol Y.
The receiving end calculates the correlation between the received modulation symbol Y and X1, X2, X3, and X4, respectively, and considers that the modulation symbol corresponding to the maximum correlation value is the modulation symbol transmitted by the transmitting end. Illustratively, in determining the correlation values, the receiving end calculates absolute values of inner products of Y with X1, X2, X3, and X4, respectively. For example, the correlation values of Y and X1 are the absolute values of the inner products of Y and X1, i.e., the absolute values of the summed products of each term of Y and the corresponding term in X1. For example, if the correlation values of Y and X1, X2, X3, and X4 are 0.4,0.9,0.5, and 0.1, respectively, the maximum correlation value is 0.9, that is, the correlation value between Y and X2 is the maximum, so the receiving end considers that X2 is a modulation symbol transmitted by the transmitting end, and therefore, the bit value 01 corresponding to X2 is considered to be information transmitted by the transmitting end as the receiving end.
Alternatively, the receiving end calculates the distances between the received modulation symbol Y and X1, X2, X3, and X4, respectively, and considers that the modulation symbol corresponding to the minimum distance is the modulation symbol transmitted by the transmitting end. For example, for the ith modulation symbol Xi in X1, X2, X3 and X4, where i is an integer ranging from 1 to 4, the distance d between Y and XiiCan be expressed as
Figure BDA0002024726570000092
Wherein, YHRepresenting the conjugate transpose of the matrix Y, XiHRepresenting the conjugate transpose of matrix Xi. Suppose d1＝0.6，d2＝0.1，d3＝0.5，d4When the minimum distance is 0.9, the receiving end considers that the modulation symbol X2 corresponding to the minimum distance of 0.1 is the modulation symbol transmitted by the transmitting end, and thus the bit value 01 corresponding to X2 is information transmitted by the transmitting end as the receiving end.
Optionally, in this embodiment, the modulation symbols in the modulation symbol set may be normalized. E.g., for any of the modulation symbols X, trace (X X X) in the first set of symbols or the second set of symbolsH) 1, wherein, XHFor conjugate transpose of X, trace (-) denotes the trace of the matrix, e.g. trace (X)H) 1 denotes a matrix X × XHTrace of (a) is 1. By the normalized design, the calculation of the distance can be simplified. Illustratively, if the transmitted signal is not normalized, e.g., trace (X)H) The calculation of the distance can be updated to P
Figure BDA0002024726570000101
To ensure that the value under the root number is not negative. Wherein P is a real number greater than 0.
In the method referred to in fig. 1, for a set of symbols used for modulation, for example, a first set of symbols or a second set of symbols, two modulation symbols in the set of symbols may be different. Illustratively, for any two modulation symbols a and B in the symbol set, each of the modulation symbols a and B includes M × T complex elements. At least one element in the modulation symbol a and the modulation symbol B is different, for example, all or part of the elements in the modulation symbol a and the modulation symbol B are different. In the embodiments of the present application, at least one of the groups may be 1, 2, 3, or more, and the present application is not limited thereto. Further illustratively, for any two modulation symbols a and B in the symbol set, the constant r1 is absent such that
r1×XA＝XBWherein X isARepresenting modulation symbols A, XBIndicating that the modulation symbols B, r1 are complex numbers. Further illustratively, for any two modulation symbols A and B in the symbol set, the square matrix H does not existrSo that H isr×XA＝XBWherein X isARepresenting modulation symbols A, XBRepresenting modulation symbols B, HrIncluding M × M complex elements.
By the method, the demodulation accuracy of the receiving end can be improved. In the non-coherent transmission method related to fig. 1, the modulation symbols carry information through the row vectors of the corresponding matrix, that is, the receiving end can demodulate by correlating or distance, so that even if the modulation symbols experience the channel, the row vectors of the modulation symbols are not transformed into the row vectors of another modulation symbol after reaching the receiving end, thereby avoiding demodulation errors.
For any two modulation symbols a and B in the above symbol set, the distance between the two modulation symbols may be designed to be as large as possible, or the minimum value of the distance between the two modulation symbols may be designed to be as large as possible (e.g., as close to 1 or M as possible). The distance between modulation symbol a and modulation symbol B can be expressed as:
Figure BDA0002024726570000102
wherein, XARepresenting modulation symbols A, XBRepresents a modulation symbol B, (X)A)HDenotes the conjugate transpose of the modulation symbol A, (X)B)HRepresenting the conjugate transpose of modulation symbol B. In the method, the larger the minimum value of the distance between every two modulation symbols in the symbol set is, the lower the demodulation error rate is, and the better the demodulation performance is.
When the receiving end receives a group of modulation symbols, each modulation symbol in the group of modulation symbols can be demodulated respectively, so that the value of the bit stream sent from the sending end to the receiving end can be obtained.
By the method shown in fig. 1, the modulation symbol set used for modulation may be a first symbol set, and the first symbol set is obtained from a second symbol set with a small amount of data, so that only the second symbol set may be stored, and the first symbol set is obtained from the second symbol set as needed, thereby saving storage space. By the non-coherent transmission method, additional pilot transmission for demodulation purposes is not required, and thus the resource overhead of data transmission can be saved.
In the method related to fig. 1, the length b of the input bit may be preconfigured, may be signaled to the UE by the base station, or may be determined by the UE, which is not limited in this application. The value of M may be preconfigured, may be signaled to the UE by the base station, or may be determined by the UE, which is not limited in this application. The value of T may be preconfigured, may be signaled to the UE by the base station, or may be determined by the UE, which is not limited in this application. For example, the determination methods of b, M and T may be described in the corresponding patent application with application number 201910207314.1 entitled "method and communication device for transmitting data" filed by 3/19/2019 to the chinese intellectual property office.
In the embodiment of the present application, the signaling may be semi-static signaling and/or dynamic signaling. Wherein, in the embodiment of the application, A and/or B can represent A, B or A and B.
The semi-static signaling may be Radio Resource Control (RRC) signaling, broadcast messages, system messages, or Medium Access Control (MAC) Control Elements (CEs). The broadcast message may include a remaining minimum system message (RMSI).
The dynamic signaling may be physical layer signaling. The physical layer signaling may be signaling carried by a physical control channel or signaling carried by a physical data channel. The physical data channel may be a downlink channel, such as a Physical Downlink Shared Channel (PDSCH). The physical control channel may be a Physical Downlink Control Channel (PDCCH), an Enhanced Physical Downlink Control Channel (EPDCCH), a Narrowband Physical Downlink Control Channel (NPDCCH), or a machine communication physical downlink control channel (MTC) MPDCCH. The signaling carried by the PDCCH or EPDCCH may also be referred to as Downlink Control Information (DCI). The physical control channel may also be a physical sidelink control channel (physical sidelink control channel), and signaling carried by the physical sidelink control channel may also be referred to as Sidelink Control Information (SCI).
The second set of symbols is described below with respect to the method referred to in fig. 1. Wherein the second set of symbols may be used to determine A first set of symbols.
Optionally, the second set of symbols is preconfigured. For example, pre-configuring the modulation symbols in the second set of symbols and/or pre-configuring a mapping between the bit values of the input bits and the modulation symbols in the second set of symbols. In the embodiment of the present application, the mapping relationship between the bit value of the input bit and the modulation symbol in the second symbol set may also be referred to as a second constellation. Optionally, the second symbol set and/or the second constellation may also be indicated by the base station for the UE through signaling.
In one possible implementation, the modulation symbols in the second set of symbols are orthogonal. In bookIn the embodiment of the application, for any two modulation symbols R1 and R2 with the same dimension, assuming that they are both a matrix of k1 rows and k2 columns, when the two modulation symbols are orthogonal, the requirement is satisfied
Figure BDA0002024726570000111
Satisfies for any i1
Figure BDA0002024726570000112
Satisfies for any i2
Figure BDA0002024726570000113
Or R1 XR 2HEqual to 0, R1HX R2 equal to 0, R1HXr 2 equal the full 0 matrix or R1 xr 2HEqual to the all 0 matrix. Wherein, represents a conjugation, R1HDenotes the conjugate transpose of R1, R2HDenotes the conjugate transpose of R2, R1i1,i2Elements of row i1 column i2 of R1, R2i1,i2Represents the element of row i1 column i2 of R2, i1 is an integer ranging from 1 to k1, i2 is an integer ranging from 1 to k 2. An all 0 matrix indicates that the elements of the matrix are all equal to 0.
Illustratively, the modulation symbols in the second set of symbols may be according to a first initial matrix C0And an extension matrix AsAnd (4) obtaining the product. Any one modulation symbol in the second symbol set is a matrix with dimension of M × T, and the any one modulation symbol includes M × T complex numbers, when T can be expressed as T ═ k × 2aWhen k is odd, then:
Figure BDA0002024726570000114
wherein i is an integer having a value ranging from 1 to a, C0Is a full 1 matrix of dimensions M x k,
Figure BDA0002024726570000115
Cathe element corresponding to each M rows and T columns in (which may also be referred to as M rows and T columns part) is an element in one modulation symbol in the second symbol set. By the method, a second symbol set with a modulation mapping capability of a bits can be generated, namely the second symbol set comprises 2aModulation ofSymbol, and 2aThe modulation symbols are orthogonal pairwise. 2 of the second set of symbols may be selecteda2 of one modulation symbol and a bitaAnd the possible bit values are in one-to-one correspondence to obtain a second constellation diagram.
In the process, CaMay include more than 2aM rows and T columns, in which case it can be selected from CaOptionally get 2 ofaM rows and T columns as part of 2 in the second symbol setaIndividual modulation symbols, optionally according to a predefined rule, from CaGet 2aM rows and T columns as part of 2 in the second symbol setaAnd (4) modulation symbols, which are not limited in the embodiments of the present application. For example, it may be derived from matrix CaThe upper left corner, the lower right corner or other positions of 2aM rows and T columns as part of 2 in the second symbol setaAnd a modulation symbol.
In the embodiment of the present application,
Figure BDA0002024726570000116
representing the kronecker product. Illustratively, when performing kronecker product on matrix a and matrix B, each element in matrix a is multiplied by matrix B, i.e. each element in matrix a is multiplied by matrix B, respectively
Figure BDA0002024726570000121
Where the matrix A is a matrix of size m × n, a11The element representing the first row and the first column of the matrix A, a1nThe element representing the n-th column of the first row in matrix A, am1Representing the element of the m-th row and the first column in the matrix A, amnAnd (3) elements of an mth row and an nth column in the matrix A are represented, wherein m and n are positive integers.
Illustratively, any one modulation symbol in the second symbol set is a matrix of dimension M × T ═ 1 × 12, since T ═ k × 2a＝3×22Then C is0Is a full 1 matrix [1, 1] of 1 × 3 dimensions, mxk ═ M]By expanding the matrix AsTo C0Expanding until Ca＝C2：
Figure BDA0002024726570000122
Figure BDA0002024726570000123
Then, C2The element corresponding to each 1 row and 12 columns in the symbol set is an element in one modulation symbol in the second symbol set, that is, the second symbol set includes 4 modulation symbols, and the 4 modulation symbols are respectively: [1,1,1,1,1,1,1, 1[ 1], 1,1,1-,1, -11, -1,11],1,1,-1,-1,-1]、[1,1,1,1,1,1,-1,-1,-1,-1,-1,-1]And [1,1,1, -1, -1, -1, -1, -1, -1,1,1,1]. The 4 modulation symbols are orthogonal to each other, for example, any two modulation symbols X in the 4 modulation symbols1And X2:X1×(X2)T0, wherein (X)2)TRepresents X2The transposing of (1). By this method, each element in one modulation symbol can be guaranteed to be constant modulus (i.e. the amplitude or magnitude of each element is the same), or each element of each modulation symbol can be guaranteed to be a BPSK symbol, e.g. each element has a value of 1 or-1. By the method, the power of each element in the modulation symbol can be consistent, so that the PAPR of the data sent by the sending end can be reduced, and the hardware realization of the sending end is facilitated.
In practical applications, other methods may also be used to determine the second symbol set, and the application is not limited thereto.
In the following, a method of determining a first set of symbols from a second set of symbols is described with respect to the method referred to in fig. 1.
Optionally, in the method related to fig. 1, the obtaining of the first symbol set according to the second symbol set includes: for a modulation symbol in the first set of symbols, the modulation symbol is included in the second set of symbols; or the modulation symbol is determined from one modulation symbol in the second set of symbols. Or the method may be described as: the first set of symbols includes modulation symbols in the second set of symbols, and one modulation symbol in the first set of symbols that does not belong to the second set of symbols is determined from one modulation symbol in the second set of symbols. By the method, the modulation symbols in the second symbol set are multiplexed to be used as the modulation symbols of the first symbol set, so that the large-distance characteristic of the part of the modulation symbols can be maintained, the demodulation accuracy is improved, the computing resource in the process of determining the first symbol set can be saved, and each modulation symbol in the first symbol set does not need to be determined again. In this method, the modulation mapping capability of the first symbol set may be greater than or equal to the modulation mapping capability of the second symbol set, which is not limited in this application.
Optionally, one modulation symbol in the first symbol set is determined according to one modulation symbol in the second symbol set, including: the one modulation symbol in the first symbol set is determined from the one modulation symbol in the second symbol set and the generator matrix.
In a first possible implementation, for any one modulation symbol in the first symbol set, the modulation symbol is a modulation symbol in the second symbol set, or the modulation symbol is equal to a modulation symbol obtained by dot-multiplying one modulation symbol in the second symbol set by the joint generator matrix (the symbol is represented by:). The first symbol set comprises modulation symbols in the second symbol set, and each modulation symbol in the second symbol set is respectively subjected to point multiplication with the joint generating matrix to obtain a symbol. The joint generating matrix is equal to one basic generating matrix in the t basic generating matrices, or is equal to a generating matrix obtained by performing point multiplication on p basic generating moments in the t basic generating matrices, and p is an integer with the value range of 2 to t. Where t is an integer equal to the modulation mapping capability b of the first set of symbols minus the modulation mapping capability a of the second set of symbols.
In the embodiment of the present application, the joint generator matrix may also be referred to as a first generator matrix or other names; the base generator matrix may also be referred to as a second generator matrix or by other names, which are not limiting in this application.
The above method can also be described as: for one modulation symbol in the first symbol set, the modulation symbol is the modulation symbol in the second symbol set, or the modulation symbol is equal to the modulation symbol obtained by point-multiplying one modulation symbol in the second symbol set by p basic generation moments (the symbol is represented by:). The first symbol set comprises modulation symbols in the second symbol set, and each modulation symbol in the second symbol set is subjected to point multiplication with p basic generation moments to obtain a symbol. Wherein p is an integer ranging from 2 to t. Where t is an integer equal to the mapping capability b of the first set of symbols minus the mapping capability a of the second set of symbols.
In this embodiment of the present application, the dot multiplication of the matrix a and the matrix B may be described as that elements of the matrix a and elements of the matrix B are multiplied one by one, respectively, to obtain a matrix C, where dimensions of the matrix a and the matrix B are the same, that is, the number of rows and the number of columns of the matrix a and the matrix B are the same, respectively. Illustratively, each element of the matrix a and the matrix B is a complex number, and the matrix a and the matrix B are 2 × 4 matrices, respectively, then the matrix C obtained by dot-multiplying the matrix a, the matrix B, and the matrix a and the matrix B is represented as follows:
Figure BDA0002024726570000131
Figure BDA0002024726570000132
in this embodiment, dot multiplication of a plurality of matrices may also be performed, which means that elements of the plurality of matrices are multiplied one by one, respectively, and the dimensions of the plurality of matrices are the same, that is, the number of rows and the number of columns of the plurality of matrices are the same, respectively. Illustratively, each element of the matrix a, the matrix B, and the matrix D is a complex number, and the matrix a, the matrix B, and the matrix D are 2 × 4 matrices, respectively, and then the matrix C obtained by dot-multiplying the matrix a, the matrix B, the matrix D, and the matrix a, the matrix B, and the matrix D is represented as follows:
Figure BDA0002024726570000133
Figure BDA0002024726570000134
examples of the inventionIllustratively, the modulation mapping capability a of the second symbol set is equal to 2, and the second symbol set comprises 2 in total24 modulation symbols, the 4 modulation symbols are respectively denoted as I1、I2、I3And I4. If the modulation mapping capability b of the first set of symbols is equal to 3, 2 is included in the first set of symbols38 modulation symbols, the 8 modulation symbols are respectively I1、I2、I3、I4、I1·G1、I2·G1、I3·G1And I4·G1Wherein G is1Representing the first underlying generator matrix.
Further illustratively, the modulation mapping capability a of the second set of symbols is equal to 2, the second set of symbols collectively comprising 224 modulation symbols, the 4 modulation symbols are respectively denoted as I1、I2、I3And I4. If the modulation mapping capability b of the first set of symbols is equal to 4, 2 is included in the first set of symbols416 modulation symbols, I1、I2、I3、I4、I1·G1、I2·G1、I3·G1、I4·G1、I1·G2、I2·G2、I3·G2、I4·G2、I1·G1·G2、I2·G1·G2、I3·G1·G2AndI4·G1·G2wherein G is1Denotes the 1 st basic generator matrix, G2Representing the 2 nd basis generator matrix.
In a second possible implementation, the symbol set j +1 is determined according to a symbol set j and a jth basic generator matrix, where the symbol set j +1 and the symbol set j each include a positive integer number of modulation symbols, j is an integer having a value ranging from 1 to t, t is an integer, and t is equal to a modulation mapping capability b of the first symbol set minus a modulation mapping capability a of the second symbol set. When j takes a value of 1, the symbol set j is a second symbol set; and when j takes the value of t, a symbol set j +1 obtained according to the symbol set j is a first symbol set. The symbol set j +1 is determined according to the symbol set j and the jth basic generating matrix, and comprises the following steps: for a modulation symbol in the symbol set j +1, the modulation symbol is the modulation symbol in the symbol set j, or the modulation symbol is equal to a modulation symbol obtained by performing point multiplication on one modulation symbol in the symbol set j and the jth basic generator matrix. The symbol set j +1 includes modulation symbols in the symbol set j, and modulation symbols obtained by performing dot multiplication on each modulation symbol in the symbol set j and a jth basic generating matrix respectively.
For symbol set j +1, the symbol set includes 2 of symbol set ja+j-1Each modulation symbol in the symbol set j and 2 obtained by dot multiplication of each modulation symbol in the symbol set j and the jth basic generation matrixa+j-1When modulating symbols, the modulation mapping capacity of the symbol set j +1 is a + j.
Alternatively, for the constellation of the symbol set j +1, the bit values 0 to 2 may be madea+j-1-1 corresponds one-to-one to 2 in the symbol set j, respectivelya+j-1Modulation symbols, which can make bit value 2a+j-1To 2a+j-1 is respectively in one-to-one correspondence with 2 obtained by dot multiplication of each modulation symbol in the symbol set j and the jth basic generator matrixa+j-1And a modulation symbol.
Alternatively, for the constellation diagram of the symbol set j +1, the bit value 0 to 2 may be set by a step size of 2a+j-2 correspond one-to-one to 2 in the symbol set j, respectivelya+j-1Modulation symbols of bit values 1 to 2a+j-1 is respectively in one-to-one correspondence with 2 obtained by dot multiplication of each modulation symbol in the symbol set j and the jth basic generator matrixa+jAnd a modulation symbol. For example, a bit value of 0 corresponds to the 1 st modulation symbol in the symbol set j, and a bit value of 1 corresponds to a modulation symbol obtained by dot-multiplying the 1 st modulation symbol in the symbol set j and the jth basic generator matrix; a bit value 2 corresponds to a 2 nd modulation symbol in the symbol set j, and a bit value 3 corresponds to a modulation symbol obtained by dot multiplication of the 2 nd modulation symbol in the symbol set j and a jth basic generation matrix; bit value 4 correspondencesA bit value of 5 corresponds to a modulation symbol obtained by dot multiplication of a 3 rd modulation symbol in the symbol set j and a jth basic generation matrix; and so on.
Optionally, for the constellation diagram of the symbol set j +1, the distance of the modulation symbols corresponding to adjacent bit values (decimal difference of bit values equal to 1 or-1, e.g., 000 and 001, or 010 and 011; or bit values of only one bit different, e.g., 001 and 101, or 001 and 011, or 001 and 000) is smaller than the threshold value. In practical applications, other design manners may be provided for the constellation diagram of the symbol set j +1, and the embodiment of the present application is not limited.
Illustratively, the modulation mapping capability a of the second symbol set is equal to 2, and the second symbol set comprises 2 in total24 modulation symbols, the 4 modulation symbols are respectively denoted as I1、I2、I3And I4. If the modulation mapping capability b of the first symbol set is equal to 4, the symbol set 1 is a second symbol set, and a matrix G is generated according to the symbol set 1 and the 1 st base1Obtaining a symbol set 2, where the symbol set 2 includes 8 modulation symbols, and the 8 modulation symbols are respectively: i is1、I2、I3、I4、I1·G1、I2·G1、I3·G1、I4·G1. Generating a matrix G from the symbol set 2 and the 2 nd basis2Obtaining a symbol set 3, wherein the symbol set 3 comprises 16 symbols, and the 16 modulation symbols are I respectively1、I2、I3、I4、I1·G1、I2·G1、I3·G1、I4·G1、I1·G2、I2·G2、I3·G2、I4·G2、I1·G1·G2、I2·G1·G2、I3·G1·G2And I4·G1·G2. The symbol set 3 is taken as the first symbol set.
Exemplarily, a diagramFig. 3 is a flowchart illustrating a method for modulation by a transmitting end according to an embodiment of the present application. Diagram 401 depicts a one-time modulation process. As shown in fig. 3, the transmitting end may determine a second symbol set, where the second symbol set includes 2aAnd a modulation symbol.
For an input bit, b bits are included in the input bit, if b is greater than a, and b-a equals t. The sending end may obtain the first symbol set according to the second symbol set, for example, the sending end may use the second symbol set as the 1 st symbol set, and cyclically perform t-group matrix expansion operations: and (3) taking a modulation symbol obtained by dot multiplication of each modulation symbol in the jth symbol set and the jth basic generation matrix and a modulation symbol in the jth symbol set as a (j + 1) th symbol set. And j takes values from 1 to t respectively, and the t +1 th symbol set is taken as a modulation symbol set. And the transmitting end modulates the input bits according to the modulation symbol set.
Alternatively, for the input bit, if b is less than a, 2 in the second symbol setbThe modulation symbols are used as modulation symbols in a modulation symbol set. And the transmitting end modulates the input bits according to the modulation symbol set. The second possible implementation is equivalent to a specific implementation of the first possible implementation.
In a third possible implementation, for any one modulation symbol in the first symbol set, the modulation symbol is a modulation symbol in the second symbol set, or the modulation symbol is equal to a modulation symbol obtained by dot-multiplying one modulation symbol in the second symbol set by the joint generator matrix (the symbol is represented by:). The first symbol set comprises modulation symbols in the second symbol set, and the modulation symbols in the second symbol set are respectively subjected to point multiplication with the joint generating matrix to obtain symbols. Wherein the joint generator matrix is equal to one basic generator matrix in one basic generator matrix group in t basic generator matrix groups, or is equal to a generator matrix obtained by performing point multiplication on p basic generator matrices in p basic generator matrix groups in the t basic generator matrix groups, wherein each of the p basic generator matrix groups comprises one basic generator matrix in the p basic generator matricesThe basis generator matrices, i.e., the p basis generator matrices, are included in the p basis generator matrix groups one-to-one. t is an integer. When t is greater than or equal to 2, p is an integer ranging from 2 to t. Wherein the j-th group of the t basic generation matrix groups includes
Figure BDA0002024726570000153
A basis generates a matrix and satisfies
Figure BDA0002024726570000151
Wherein, CjIs an integer greater than or equal to 0 (e.g., 1, 2, 3, or other value), and j is an integer ranging from 1 to t. C of different basis generator matrix groupsjMay be the same or different. Illustratively, the same C when different basis generating matrix setsjWhen the temperature of the water is higher than the set temperature,
Figure BDA0002024726570000152
b is the modulation mapping capability b of the first symbol set, and a is the modulation mapping capability a of the second symbol set. When each basis generates C of matrix groupjAll equal to 1, the third possible implementation is equivalent to the first possible implementation described above.
In this embodiment of the present application, the basic generator matrix set may also be referred to as a second generator matrix set or other names, which is not limited in this application.
The above method can also be described as: for one modulation symbol in the first symbol set, the modulation symbol is the modulation symbol in the second symbol set, or the modulation symbol is equal to the modulation symbol obtained by dot-multiplying one modulation symbol in the second symbol set by one basic generation moment, or the modulation symbol is equal to the modulation symbol obtained by dot-multiplying one modulation symbol in the second symbol set by p basic generation moments (the symbol is represented by:). The first symbol set comprises modulation symbols in the second symbol set, modulation symbols obtained by performing point multiplication on each modulation symbol in the second symbol set and the one basic generation moment, and symbols obtained by performing point multiplication on each modulation symbol in the second symbol set and the p basic generation moments. Wherein the one base generator matrix is equal to one of the t base generator matrix groups. Each of the p basic generator matrix groups includes one of the p basic generator matrices, and the p basic generator matrix groups are included in the t basic generator matrix groups. p is an integer ranging from 2 to t.
Illustratively, b-a is 6, the modulation mapping capability a of the second symbol set is equal to 3, and the second symbol set comprises 2 in total3The 8 modulation symbols are respectively denoted as I1～I8. The modulation mapping capability b of the first set of symbols is equal to 9, then the first set of symbols comprises 29There may be 2 basis generator matrix groups, with 7 basis generator matrices in each group, for 512 modulation symbols. Wherein the basic generator matrices of the first group are respectively denoted as G1～G7The basic generator matrices of the second group are denoted as G8～G14. The 512 modulation symbols in the first symbol set are I respectively1～I8、Iii·Gjj、Iii·Gu·GvWherein ii is 1 to 8, jj is 1 to 14, u is 1 to 7, and v is 8 to 14. Wherein the symbols "" represent "" to "", for example, 1 to 8 represent 8 integers from 1 to 8.
Further illustratively, b-a is 5, the modulation mapping capability a of the second symbol set is equal to 3, and the second symbol set collectively includes 23The 8 modulation symbols are respectively denoted as I1～I8. The modulation mapping capability b of the first set of symbols is equal to 8, then the first set of symbols comprises 28For 256 modulation symbols, there may be 2 basic generator matrix groups, the first and second groups comprising 3 and 7 basic generator matrices, respectively, the basic generator matrices of the first group being denoted G, respectively1～G3The basic generator matrices of the second group are denoted as G4～G10. Then 256 modulation symbols in the first symbol set are each I1～I8、Iii·Gjj、Iii·Gu·GvWherein ii is 1 to 8, jj is 1 to 10, u is 1 to 3, v is 4 to E10。
In a fourth possible implementation, the symbol set j +1 is determined according to a symbol set j and a basic generator matrix in a jth basic generator matrix group, where the symbol set j +1 and the symbol set j each include a positive integer number of modulation symbols, and j is an integer with a value range from 1 to t. When j takes a value of 1, the symbol set j is a second symbol set; and when j takes the value of t, a symbol set j +1 obtained according to the symbol set j is a first symbol set. The symbol set j +1 is determined according to the symbol set j and the jth basic generation matrix group, and comprises the following steps: for a modulation symbol in the symbol set j +1, the modulation symbol is the modulation symbol in the symbol set j, or the modulation symbol is equal to a modulation symbol obtained by dot multiplication of a modulation symbol in the symbol set j and a basic generator matrix in the jth basic generator matrix group. The symbol set j +1 includes modulation symbols in the symbol set j, and all modulation symbols obtained by performing dot multiplication on each modulation symbol in the symbol set j and each basic generation matrix in the jth basic generation matrix group. Wherein the j-th group of the t basic generation matrix groups includes
Figure BDA00020247265700001613
The basis is a generator matrix of the basis,
Figure BDA0002024726570000161
wherein, CjIs an integer (e.g., 0, 1, 2, 3, or other value) and j is an integer ranging from 1 to t. C of different basis generator matrix groupsjMay be the same or different. Illustratively, the same C when different basis generating matrix setsjWhen the temperature of the water is higher than the set temperature,
Figure BDA0002024726570000162
b is the modulation mapping capability b of the first symbol set, and a is the modulation mapping capability a of the second symbol set. When each basis generates C of matrix groupjAll equal to 1, the fourth possible implementation is equivalent to the second possible implementation described above. The fourth possible implementation is equivalent to a specific implementation of the third possible implementation.
For the symbol set j +1, the symbol set includes the symbols in the symbol set j
Figure BDA0002024726570000163
Each modulation symbol in the symbol set j is point-multiplied with each basic generation matrix in the jth basic generation matrix group
Figure BDA0002024726570000164
For each modulation symbol, the modulation mapping capability of the symbol set j +1 is
Figure BDA0002024726570000165
Wherein the jth basic generation matrix group comprises
Figure BDA0002024726570000166
A base generator matrix, the nth base generator matrix group includes
Figure BDA0002024726570000167
The basis generator matrices, nn are integers. And C00. In one possible implementation: for a constellation of symbol set j +1, bit values 0 to
Figure BDA0002024726570000168
One-to-one correspondence in the symbol set j respectively
Figure BDA0002024726570000169
Modulation symbols of which bit values can be made
Figure BDA00020247265700001610
To
Figure BDA00020247265700001611
Respectively one-to-one corresponding to each modulation symbol in the symbol set j and point-multiplied by each basic generation matrix in the jth basic generation matrix group
Figure BDA00020247265700001612
And a modulation symbol. In one possible implementation, for the constellation diagram of the symbol set j +1, the distance between the modulation symbols corresponding to adjacent bit values is smaller than a threshold value. In practical applications, other design manners may be provided for the constellation diagram of the symbol set j +1, and the embodiment of the present application is not limited.
Illustratively, the modulation mapping capability a of the second symbol set is equal to 3, and the second symbol set comprises 2 in total3The 8 modulation symbols are respectively denoted as I1～I8. If the modulation mapping capability b of the first symbol set is equal to 9, there may be 2 basic generator matrix groups, 7 basic generator matrices in each group, wherein the basic generator matrices of the first group are denoted as G1-G7, respectively, and the basic generator matrices of the second group are denoted as G8-G14, respectively. The symbol set 1 is a second symbol set, a symbol set 2 is obtained according to the symbol set 1 and basic generator matrices G1-G7 in the group 1 basic generator matrix group, the symbol set 2 includes 64 modulation symbols, and the 64 modulation symbols are respectively: i is1～I8、Iii·GjjWherein ii is 1 to 8 and jj is 1 to 7. Obtaining a symbol set 3 according to the symbol set 2 and basic generating matrixes G8-G14 in the 2 nd group of basic generating matrix groups, wherein the symbol set 3 comprises 512 symbols, and the 512 modulation symbols are I respectively1～I8、Iii·Gjj、Iii·Gu·GvWherein ii is 1 to 8, jj is 1 to 14, u is 1 to 7, and v is 8 to 14. The symbol set 3 is taken as the first symbol set.
Optionally, in the method related to fig. 1, the first symbol set is obtained according to a second symbol set, and the method includes: one modulation symbol in the first set of symbols is determined from one modulation symbol in the second set of symbols. By the method, the first symbol set is obtained according to the second symbol set, only the second symbol set can be stored, and the first symbol set is obtained through the second symbol set as required, so that the storage space can be saved. In this method, the modulation mapping capability of the first symbol set may be greater than, less than, or equal to the modulation mapping capability of the second symbol set, which is not limited in this application.
In a fifth possible implementation, for any one modulation symbol in the first symbol set, the modulation symbol is equal to a modulation symbol obtained by dot-multiplying one modulation symbol in the second symbol set by the joint generator matrix (the symbol is represented by:). The first symbol set comprises symbols obtained by performing point multiplication on modulation symbols in the second symbol set and a joint generating matrix respectively. The joint generator matrix is equal to one basic generator matrix in one basic generator matrix group in t basic generator matrix groups, or is equal to a generator matrix obtained by performing point multiplication on p basic generator matrices in p basic generator matrix groups in the t basic generator matrix groups, wherein each of the p basic generator matrix groups comprises one basic generator matrix in the p basic generator matrices, namely the p basic generator matrices are included in the p basic generator matrix groups one by one. t is an integer. When t is greater than or equal to 2, p is an integer ranging from 2 to t. Wherein the j-th group of the t basic generation matrix groups includes
Figure BDA0002024726570000171
A basis generates a matrix and satisfies
Figure BDA0002024726570000172
Wherein, CjIs an integer greater than or equal to 0 (e.g., 1, 2, 3, or other value), and j is an integer ranging from 1 to t. C of different basis generator matrix groupsjMay be the same or different. Illustratively, the same C when different basis generating matrix setsjWhen the temperature of the water is higher than the set temperature,
Figure BDA0002024726570000173
b is the modulation mapping capability b of the first symbol set, and a is the modulation mapping capability a of the second symbol set. The fifth possible implementation is equivalent to the third possible implementation described above when each basis generating matrix group includes an all-1 matrix. When each basis generates C of matrix groupjAll equal to 1, and each basis generator matrix group includes an all-1 matrix,the fifth possible implementation is equivalent to the first possible implementation described above. Wherein the full matrix indicates that each element of the matrix is 1.
Illustratively, b-a is 6, the modulation mapping capability a of the second symbol set is equal to 3, and the second symbol set comprises 2 in total3The 8 modulation symbols are respectively denoted as I1～I8. The modulation mapping capability b of the first set of symbols is equal to 9, then the first set of symbols comprises 29There may be 2 basis generator matrix groups of 8 basis generator matrices in each group, 512 modulation symbols. Wherein the basic generator matrices of the first group are respectively denoted as G1～G8The basic generator matrices of the second group are denoted as G9～G16. The 512 modulation symbols in the first symbol set are I respectivelyii·Gjj、Iii·Gu·GvWherein ii is 1 to 8, jj is 1 to 16, u is 1 to 8, and v is 9 to 16. Alternatively, G8And G16May be a full 1 matrix.
In a sixth possible implementation, the symbol set j +1 is determined according to a symbol set j and a basic generator matrix in a jth basic generator matrix group, where the symbol set j +1 and the symbol set j each include a positive integer number of modulation symbols, and j is an integer with a value range from 1 to t. When j takes a value of 1, the symbol set j is a second symbol set; and when j takes the value of t, a symbol set j +1 obtained according to the symbol set j is a first symbol set. The symbol set j +1 is determined according to the symbol set j and the jth basic generation matrix group, and comprises the following steps: for a modulation symbol in the symbol set j +1, the modulation symbol is equal to a modulation symbol obtained by performing dot multiplication on a modulation symbol in the symbol set j and a basic generator matrix in the jth basic generator matrix group. The symbol set j +1 includes all modulation symbols obtained by performing dot multiplication on each modulation symbol in the symbol set j and each basic generator matrix in the jth basic generator matrix group. Wherein the j-th group of the t basic generation matrix groups includes
Figure BDA0002024726570000176
The basis is a generator matrix of the basis,
Figure BDA0002024726570000174
wherein, CjIs an integer (e.g., 0, 1, 2, 3, or other value) and j is an integer ranging from 1 to t. C of different basis generator matrix groupsjMay be the same or different. Illustratively, the same C when different basis generating matrix setsjWhen the temperature of the water is higher than the set temperature,
Figure BDA0002024726570000175
b is the modulation mapping capability b of the first symbol set, and a is the modulation mapping capability a of the second symbol set. The sixth possible implementation is equivalent to the fourth possible implementation described above when each basis generating matrix group includes an all-1 matrix. When each basis generates C of matrix groupjAll equal to 1, and each basic generator matrix group includes one all-1 matrix, the sixth possible implementation is equivalent to the second possible implementation described above. The sixth possible implementation is equivalent to a specific implementation of the fifth possible implementation.
For example, in the third to sixth possible implementations, if each modulation symbol is a matrix with dimension 1 × T, and T is equal to 2aThen the vv-th element of the f-th base generator matrix in the j-th set of base generator matrices can be represented as
Figure BDA0002024726570000181
Wherein i is an imaginary unit, the square of i is equal to-1, j is an integer with a value range of 1 to t, and a represents the modulation mapping capability of the second symbol set. f is 1 or more and 1 or less
Figure BDA0002024726570000188
T is a positive integer,. lvvIs a vector composed of 2-bit units after vv-1 is converted into binary (for example, when T is 8 and vv is 4, l is 11 because vv-1 is 3 and the corresponding 2-bit is expressed as 11vv＝[0,1,1]) And vv ranges from 1 to T. Pj,fBinary matrix of a (each element of matrix is 0 or 1) belonging to matrix setTheta (co) withjJ is an integer from 1 to t, and t is the number of the basic generation matrix groups. Illustratively, P for different j or fj,fDifferent. Wherein the matrix set thetajIs a set of two-dimensional matrices a, wherein the difference matrix between any two matrices has a rank over the galois field GF (2) of less than or equal to a-2 j + 2. For example for any two belonging to ΘjMatrix P ofj,f1And Pj,f2，Pj1,f1-Pj2,f2The rank over the galois field GF (2) is no greater than a-2 x j + 2. The generator matrix meeting the above conditions can ensure that the distance between any two modulation symbols in the first modulation symbol set is small, and the distance between any two modulation symbols in the first modulation symbol set is not less than
Figure BDA0002024726570000182
Further, if each modulation symbol is a matrix of dimensions M x T, M>1, each modulation symbol includes M different matrices of dimension 1 × T, where each matrix of dimension 1 × T corresponds to a row of elements of the matrix of dimension M × T. Further, the matrix of M × T dimensions may be energy normalized to obtain a normalized matrix of M × T dimensions. For example, when M is 2, the modulation symbols in the first modulation symbol set may be represented as
Figure BDA0002024726570000183
Wherein a and B are two different modulation symbols in the set of modulation symbols of said matrix with modulation symbols 1 x T.
In the above method for obtaining the first symbol set through the second symbol set, for example, in the first possible implementation to the sixth possible implementation, except for the all-1 matrix described in the fifth possible implementation and the sixth possible implementation, each two basic generation matrices are different. For example, in the first and second possible implementations, the t basis generator matrices are different pairwise; in a third and fourth possible implementation, in the same and different basis generator matrix sets, the basis generator matrices are different pairwise; in the fifth and sixth possible implementations, if each basic generator matrix group includes an all-1 matrix, divideExcept all 1 matrixes, in the same and different basic generating matrix groups, every two basic generating matrixes are different. Illustratively, for any two basis generator matrices, e.g., for a first basis generator matrix and a second basis generator matrix, the first basis generator matrix and the second basis generator matrix are not equal; or a wireless relationship between the first basis generator matrix and the second basis generator matrix, without the constant r, such that r × GA＝GBWherein G isARepresenting a first basis generator matrix, GBRepresenting a second basis generator matrix, r being a complex number.
In the method for obtaining the first symbol set through the second symbol set, for one of the basic generator matrices, the basic generator matrix includes M × T complex elements. The elements in the base generator matrix are constant modulus signs, e.g., the modulus of each element in the base generator matrix is the same, e.g., the modulus of each element is constant. Illustratively, the constant is
Figure BDA0002024726570000184
In the embodiment of the application, for a complex number m1+ j × m2, the modulus of the complex number is equal to
Figure BDA0002024726570000185
Wherein m1 is the real part of the complex number, m2 is the imaginary part of the complex number, and j is the imaginary number. Wherein the modulus of the complex number may also be referred to as the magnitude or amplitude of the complex number. Illustratively, each element in the base generator matrix is a QPSK symbol, e.g., each element has a value of
Figure BDA0002024726570000186
Or
Figure BDA0002024726570000187
Where i is in units of imaginary numbers.
In the above method for obtaining the first symbol set by the second symbol set, in the first and second possible implementations, for one basic generator matrix, the basic generator matrix may be pre-configured, or may be obtained by linearly combining modulation symbols in the symbol set. For example, the jth basic generator matrix is obtained by linear combination (e.g., averaging, or weighted summation) of modulation symbols in a symbol set j, where j is an integer with a value ranging from 1 to t.
In the embodiments provided in the present application, the methods provided in the embodiments of the present application are introduced from the perspective of the sending end, the receiving end, and the interaction between the sending end and the receiving end. In order to implement each function in the method provided in the embodiment of the present application, the sending end and the receiving end may include a hardware structure and/or a software module, and implement each function in the form of a hardware structure, a software module, or a hardware structure plus a software module. Whether any of the above-described functions is implemented as a hardware structure, a software module, or a hardware structure plus a software module depends upon the particular application and design constraints imposed on the technical solution.
Fig. 4 is a schematic structural diagram of an apparatus 400 provided in an embodiment of the present application. The apparatus 400 may be a sending end (e.g., a terminal device or a network device) or a receiving end (e.g., a network device or a terminal device), and may implement the method provided in this embodiment of the present application; the apparatus 400 may also be an apparatus capable of supporting a sending end or a receiving end to implement the method provided in the embodiment of the present application, and the apparatus 400 may be installed in the sending end or the receiving end. The apparatus 400 may be a hardware structure, a software module, or a hardware structure plus a software module. The apparatus 400 may be implemented by a system-on-chip.
The apparatus 400 includes a processing module 402 and a communication module 404. The processing module 402 may generate a signal for transmission and may transmit the signal using the communication module 404. The processing module 402 may receive a signal using the communication module 404 and process the received signal. The processing module 402 and the communication module 404 are coupled.
The coupling in the embodiments of the present application is an indirect coupling or connection between devices, units or modules, which may be in an electrical, mechanical or other form, and is used for information interaction between the devices, units or modules. The coupling may be a wired connection or a wireless connection.
In this embodiment, the communication module may be a circuit, a module, a bus, an interface, a transceiver, a pin, or other devices that can implement a transceiving function, and this embodiment is not limited in this application.
Fig. 5 is a schematic structural diagram of an apparatus 500 provided in an embodiment of the present application. The apparatus 500 may be a sending end (e.g., a terminal device or a network device) or a receiving end (e.g., a network device or a terminal device), and may implement the method provided in this embodiment of the present application; the apparatus 500 may also be an apparatus, such as a chip system, capable of supporting a sending end or a receiving end to implement the method provided in the embodiment of the present application, and the apparatus 500 may be installed in the sending end or the receiving end.
As shown in fig. 5, the apparatus 500 includes a processing system 502 for implementing or supporting a sending end or a receiving end to implement the method provided in the embodiment of the present application. The processing system 502 may be a circuit that may be implemented by a system-on-a-chip. The processing system 502 includes one or more processors 522, and may be used to implement or support a sending end or a receiving end to implement the methods provided in the embodiments of the present application. When included in processing system 502 in addition to processor 522, processor 522 can also be used to manage other devices included in processing system 502, such as, for example, one or more of memory 524, bus 526, and bus interface 528 described below. For example, the processor 522 may be used to manage the memory 524, or the processor 522 may be used to manage the memory 524, the bus 526, and the bus interface 528.
One or more memories 524 may also be included in the processing system 502 for storing instructions and/or data. Memory 524 may be included in the processor 522. If the processing system 502 includes a memory 524, the processor 522 may be coupled to the memory 524. The processor 522 may cooperate with the memory 524. Processor 522 may execute instructions stored in memory 524. When the processor 522 executes the instructions stored in the memory 524, the method provided by the embodiment of the present application may be implemented or supported by a transmitting end or a receiving end. The processor 522 may also read data stored in the memory 524. Memory 524 may also store data that results from processor 522 executing instructions.
In the embodiment of the present application, the memory includes a volatile memory (volatile memory), such as a random-access memory (RAM); the memory may also include a non-volatile memory (non-volatile) such as a flash memory (flash memory), a Hard Disk Drive (HDD) or a solid-state drive (SSD); the memory may also comprise a combination of memories of the above kind; the memory may also include any other means having a memory function such as a circuit, device, or software module.
The processing system 502 may also include a bus interface 528 to provide an interface between the bus 526 and other devices. The bus interface may also be referred to as a communication interface, among others. In this embodiment of the present application, the communication interface may be a circuit, a module, a bus, an interface, a transceiver, a pin, or other devices that can implement a transceiving function, and this embodiment of the present application is not limited.
Optionally, the apparatus 500 includes a transceiver 506 for communicating with other communication devices over a transmission medium so that other apparatus used in the apparatus 500 may communicate with other communication devices. Which may be the processing system 502. Other ones of the apparatus 500 may illustratively communicate with other communication devices, receive and/or transmit corresponding information, using the transceiver 506. It can also be described that other devices in the apparatus 500 may receive corresponding information, where the corresponding information is received by the transceiver 506 via a transmission medium, where the corresponding information may interact between the transceiver 506 and the other devices in the apparatus 500 via the bus interface 528 or via the bus interface 528 and the bus 526; and/or other devices in the apparatus 500 may transmit corresponding information, where the corresponding information is transmitted by the transceiver 506 over a transmission medium, where the corresponding information may interact between the transceiver 506 and other devices in the apparatus 500 through the bus interface 528 or through the bus interface 528 and the bus 526.
The apparatus 500 may further comprise a user interface 504, the user interface 504 being an interface between a user and the apparatus 500, possibly for the user to interact with information with the apparatus 500. Illustratively, the user interface 504 may be at least one of a keyboard, a mouse, a display, a speaker (spaker), a microphone, and a joystick.
The above description has described a device structure provided by the embodiments of the present application, mainly from the perspective of the device 500. In this apparatus, the processing system 502 includes a processor 522, and may further include one or more of a memory 524, a bus 526, and a bus interface 528 for implementing the methods provided by the embodiments of the present application. The processing system 502 is also within the scope of the present application.
In the embodiment of the device of the present application, the module division of the device is a logic function division, and there may be another division manner in actual implementation. For example, each functional module of the apparatus may be integrated into one module, each functional module may exist alone, or two or more functional modules may be integrated into one module.
The method provided by the embodiment of the present application may be implemented in whole or in part by software, hardware, firmware, or any combination thereof. When implemented in software, may be implemented in whole or in part in the form of a computer program product. The computer program product includes one or more computer instructions. When loaded and executed on a computer, cause the processes or functions described in accordance with the embodiments of the invention to occur, in whole or in part. The computer may be a general purpose computer, a special purpose computer, a computer network, a network appliance, a terminal, or other programmable apparatus. The computer instructions may be stored on a computer readable storage medium or transmitted from one computer readable storage medium to another, for example, from one website, computer, server, or data center to another website, computer, server, or data center via wire (e.g., coaxial cable, fiber optic, Digital Subscriber Line (DSL)) or wireless (e.g., infrared, wireless, microwave, etc.). The computer-readable storage medium can be any available medium that can be accessed by a computer or a data storage device, such as a server, a data center, etc., that incorporates one or more of the available media. The usable medium may be a magnetic medium (e.g., floppy disk, hard disk, magnetic tape), an optical medium (e.g., Digital Video Disk (DVD)), or a semiconductor medium (e.g., SSD), among others.
In the embodiments of the present application, the embodiments may refer to each other, for example, methods and/or terms between the embodiments of the method may refer to each other, for example, functions and/or terms between the embodiments of the apparatus and the embodiments of the method may refer to each other, without logical contradiction.
The above embodiments are only used to illustrate the technical solutions of the present application, and are not used to limit the protection scope thereof. All modifications, equivalents, improvements and the like based on the technical solutions of the present application should be included in the protection scope of the present application.

Claims (11)

1. A method of data transmission, comprising:
mapping input bits into modulation symbols in a modulation symbol set according to a modulation mapping relation between a bit value and the modulation symbols in the modulation symbol set to obtain output modulation symbols, wherein the input bits comprise b bits, the output modulation symbols comprise M multiplied by T complex numbers, b, M and T are positive integers, and T is greater than 1;
transmitting the output modulation symbols in T resource elements through M antenna ports; wherein:
the modulation symbol set is a first symbol set, the first symbol set is obtained according to a second symbol set, and the first symbol set comprises 2bA modulation symbol, the second symbol set including 2aA and b are integers.
2. A method of data transmission, comprising:
mapping input bits into modulation symbols in a modulation symbol set according to a modulation mapping relation between a bit value and the modulation symbols in the modulation symbol set to obtain output modulation symbols, wherein the input bits comprise b bits, the output modulation symbols comprise M multiplied by T complex numbers, b, M and T are positive integers, and T is greater than 1;
transmitting the output modulation symbols in T resource elements through M antenna ports; wherein:
when b is greater than a, the modulation symbol set is a first symbol set, when b is less than or equal to a, the second symbol set comprises the modulation symbol set, the first symbol set is obtained according to the second symbol set, and the first symbol set comprises 2bA modulation symbol, the second symbol set including 2aA and b are integers.
3. The method according to claim 1 or 2, wherein the first set of symbols is derived from the second set of symbols, comprising:
one modulation symbol of the first set of symbols is included in the second set of symbols; or
One modulation symbol in the first set of symbols is determined from one modulation symbol in the second set of symbols.
4. The method of claim 3, wherein one modulation symbol of the first set of symbols is determined from one modulation symbol of a second set of symbols, comprising:
the one modulation symbol in the first symbol set is equal to a modulation symbol obtained by dot-multiplying the one modulation symbol in the second symbol set with a first generation matrix;
the first generating matrix is equal to one of t second generating matrices, or the first generating matrix is equal to a generating matrix obtained by dot multiplication of p second generating matrices in the t second generating matrices;
wherein T is equal to b minus a, the first generator matrix includes M × T complex elements, and any one of the T second generator matrices includes M × T complex elements.
5. The method of claim 3, wherein one modulation symbol of the first set of symbols is determined from one modulation symbol of a second set of symbols, comprising:
the one modulation symbol in the first symbol set is equal to a modulation symbol obtained by dot-multiplying the one modulation symbol in the second symbol set with a first generation matrix;
the first generating matrix is equal to one second generating matrix in one second generating matrix group in t second generating matrix groups, or the first generating matrix is equal to a generating matrix obtained by dot multiplication of p second generating matrices, the p second generating matrices are included in the p second generating matrix groups in a one-to-one manner, the p second generating matrix groups are included in the t second generating matrix groups, p is an integer with a value range of 2 to t, and t is an integer;
wherein a j-th group of the t second generation matrix groups includes
Figure FDA0002024726560000011
A second one of the generating matrices is then generated,
Figure FDA0002024726560000012
j is an integer having a value ranging from 1 to t, CjAre integers.
6. The method of claim 4 or 5, wherein there is a non-linear relationship between any two second generator matrices.
7. The method according to any one of claims 4 to 6,
for a second generator matrix, the elements of the second generator matrix have the same amplitude.
8. The method according to any one of claims 1 to 7,
modulation symbols in the second symbol set are orthogonal to each other.
9. Method according to any of claims 1-8, wherein T ═ kx 2aWherein k is an odd number.
10. An apparatus for carrying out the method of any one of claims 1 to 9.
11. An apparatus comprising a processor and a memory, the memory coupled with the processor, the processor to perform the method of any of claims 1-9.
CN201910290409.4A 2019-04-11 2019-04-11 Method for non-coherent transmission of data Active CN111817995B (en)

Priority Applications (3)

Application Number Priority Date Filing Date Title
CN202111497001.8A CN114844606A (en) 2019-04-11 2019-04-11 Method for non-coherent transmission of data
CN201910290409.4A CN111817995B (en) 2019-04-11 2019-04-11 Method for non-coherent transmission of data
PCT/CN2020/078955 WO2020207182A1 (en) 2019-04-11 2020-03-12 Incoherent transmission method for data

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201910290409.4A CN111817995B (en) 2019-04-11 2019-04-11 Method for non-coherent transmission of data

Related Child Applications (1)

Application Number Title Priority Date Filing Date
CN202111497001.8A Division CN114844606A (en) 2019-04-11 2019-04-11 Method for non-coherent transmission of data

Publications (2)

Publication Number Publication Date
CN111817995A true CN111817995A (en) 2020-10-23
CN111817995B CN111817995B (en) 2021-12-28

Family

ID=72750604

Family Applications (2)

Application Number Title Priority Date Filing Date
CN201910290409.4A Active CN111817995B (en) 2019-04-11 2019-04-11 Method for non-coherent transmission of data
CN202111497001.8A Pending CN114844606A (en) 2019-04-11 2019-04-11 Method for non-coherent transmission of data

Family Applications After (1)

Application Number Title Priority Date Filing Date
CN202111497001.8A Pending CN114844606A (en) 2019-04-11 2019-04-11 Method for non-coherent transmission of data

Country Status (2)

Country Link
CN (2) CN111817995B (en)
WO (1) WO2020207182A1 (en)

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US11997030B2 (en) * 2019-11-12 2024-05-28 Qualcomm Incorporated Architecture for non-coherent communication in wireless networks

Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101350644A (en) * 2007-07-20 2009-01-21 重庆无线绿洲通信技术有限公司 Relevant transmission method, relevant modulation method, and relevant modulator
CN101877688A (en) * 2009-04-29 2010-11-03 华为技术有限公司 Diversity transmission method and device of OFDM (Orthogonal Frequency Division Multiplexing) system
CN103957082A (en) * 2010-09-08 2014-07-30 华为技术有限公司 Information bit transmitting method, device and system
CN107846377A (en) * 2016-09-19 2018-03-27 华为技术有限公司 The method and apparatus for transmitting data
CN108028719A (en) * 2015-09-24 2018-05-11 索尼公司 Equipment, methods and procedures
US20190044530A1 (en) * 2013-10-01 2019-02-07 Texas Instruments Incorporated Apparatus and method for multilevel coding (mlc) with binary alphabet polar codes

Family Cites Families (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109076051B (en) * 2016-04-12 2020-09-08 华为技术有限公司 System and method for spread spectrum and joint orthogonal multi-stream spreading
US10728080B2 (en) * 2016-05-20 2020-07-28 Qualcomm Incorporated Polar codes and modulation mappings

Patent Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101350644A (en) * 2007-07-20 2009-01-21 重庆无线绿洲通信技术有限公司 Relevant transmission method, relevant modulation method, and relevant modulator
CN101877688A (en) * 2009-04-29 2010-11-03 华为技术有限公司 Diversity transmission method and device of OFDM (Orthogonal Frequency Division Multiplexing) system
CN103957082A (en) * 2010-09-08 2014-07-30 华为技术有限公司 Information bit transmitting method, device and system
US20190044530A1 (en) * 2013-10-01 2019-02-07 Texas Instruments Incorporated Apparatus and method for multilevel coding (mlc) with binary alphabet polar codes
CN108028719A (en) * 2015-09-24 2018-05-11 索尼公司 Equipment, methods and procedures
CN107846377A (en) * 2016-09-19 2018-03-27 华为技术有限公司 The method and apparatus for transmitting data

Non-Patent Citations (5)

* Cited by examiner, † Cited by third party
Title
CHIA-HUNG LIN，SHIN-LIN SHIEH，TZUNG-CHENG CHI,PO-NING CHEN: "Optimal Inter-Constellation Rotation Based onMinimum Distance Criterion for Uplink NOMA", 《IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY》 *
HUAWEI: "Discussion on the design of SCMA，R1-1805907", 《3GPP TSG RAN WG1 MEETING #93》 *
ZTE, SANECHIPS: "Transmitter side designs for NOMA，R1-1812172", 《3GPP TSG RAN WG1 MEETING #95》 *
ZTE: "Transmitter side designs for NOMA,R1-1808151", 《3GPP TSG RAN WG1 MEETING #94》 *
王显俊，杜洋，成聪: "《基于EXIT图的SCMA通信***多用户检测算法收敛性分析》", 《信号处理》 *

Also Published As

Publication number Publication date
CN111817995B (en) 2021-12-28
WO2020207182A1 (en) 2020-10-15
CN114844606A (en) 2022-08-02

Similar Documents

Publication Publication Date Title
US11611967B2 (en) Scrambling-based data transmission method
AU2019200710B2 (en) Multi-user code division multiple access communication method, and corresponding transmitter and receiver
CN102739368B (en) The rate matching of control information in wireless communication system
CN102119497B (en) The method and apparatus transmitted control signal in a wireless communication system
CN102884750A (en) Radio base station and user equipment and methods therein
EP3876489B1 (en) Signal transmission method and apparatus
CN111726194B (en) Method and communication device for transmitting data
WO2018100428A1 (en) Method and device for signal processing in communication system
US11546193B2 (en) Data compression method and apparatus
CN103503329B (en) Control communication means and the device of channel
CN111447665B (en) Method and device used in user equipment and base station for power adjustment
CN111817995B (en) Method for non-coherent transmission of data
WO2018171636A1 (en) Signal sending and receiving method, apparatus and system in wireless communications
WO2013183581A1 (en) Transmission device, reception device, transmission method and reception method
US12010054B2 (en) DMRS transmission
WO2020259356A1 (en) Communication method and communication apparatus
CN109728840B (en) Data transmission method and device
CN110971554B (en) Data transmission method and device
WO2022067811A1 (en) Signal sending method, signal receiving method, communication device, and storage medium
US20240204951A1 (en) Communication method and communication apparatus
CN109962751B (en) Data processing method and device
JP2023533272A (en) A cyclic shift-based mapping scheme for uplink control transmission
EP3455954A1 (en) Improving pam transmission in dl mu-mimo by choosing signaling dimensions

Legal Events

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