Communication method and communication apparatus

Abstract

The application relates to the field of communication, in particular to a communication method and a communication device. After modulation signals are subjected to layer mapping, if no other processing is performed, the modulation signals are directly subjected to antenna port mapping and resource mapping, each modulation signal is actually mapped to a subcarrier for transmission; if a subcarrier mapped by a modulation signal belongs to a deep fading frequency band, the transmission reliability of the modulation signal is reduced. In the application, after the modulation signals are subjected to layer mapping, the modulation signals are subjected to mapping again to obtain j second signal sets, the transmission resource corresponding to each signal in the j second signal sets comprises a plurality of frequency domain units, in this way, after each signal in the j second signal sets is subjected to precoding, the signal is finally mapped to the plurality of frequency domain units for transmission, if part of the plurality of frequency domain units belong to a deep fading frequency band, the signal mapped to the remaining frequency domain units still has a high probability of successful transmission, thereby improving the reliability of wireless transmission.

Description

Technical Field

[0001] This application relates to the field of communications, specifically to a communication method and a communication device. Background Technology

[0002] In the fifth generation (5 th In 5G mobile communication technology, the transmitting end (e.g., base station) and the receiving end (e.g., terminal) process the signal carrying data in different dimensions such as time domain, spatial domain and frequency domain to improve the reliability of wireless transmission.

[0003] For example, after the transmitting end performs layer mapping and antenna port mapping on the modulated signal carrying the data, it performs resource mapping and finally transmits the signal after resource mapping through the radio frequency circuit. Among them, layer mapping and antenna port mapping process the signal in the spatial dimension, while resource mapping processes the signal in the frequency domain and time domain.

[0004] During the aforementioned signal transmission process, the signal undergoes processing in multiple dimensions, resulting in significant improvements in coverage, capacity, and anti-interference capabilities. With the development of multi-user (MU) scenarios, the requirements for wireless transmission reliability are further increasing. Therefore, it is necessary to design new communication methods to enhance the reliability of wireless transmission. Summary of the Invention

[0005] The embodiments of this application provide a communication method, communication device, communication system, computer-readable storage medium, and computer program product that can improve the reliability of wireless transmission.

[0006] In a first aspect, embodiments of this application provide a communication method, which can be executed by a transmitting end, wherein the transmitting end can be a network device or a chip applied to a network device, or the transmitting end can be a terminal or a chip applied to a terminal. The method includes: determining a first signal set; determining j second signal sets based on the first signal set, wherein the transmission resources corresponding to each signal in the j second signal sets include multiple frequency domain units, a first mapping relationship exists between the first signal set and the j second signal sets, and j is a positive integer; precoding the j second signal sets to generate j third signal sets; and performing resource mapping on the j third signal sets.

[0007] In the above method, the first signal set is the signal set of the first spatial layer; or, the first signal set is determined based on the modulation signal set (or, complex-valued signal set, or, constellation symbol set); or, the first signal set is the modulation signal set (or, complex-valued signal set, or, constellation symbol set).

[0008] When radio frequency (RF) signals are transmitted in a wireless channel, they can travel from the transmitting antenna to the receiving antenna via multiple paths. This phenomenon is called multipath propagation, which can lead to frequency-selective fading. If, after layer mapping, the modulated signal is directly mapped to antenna ports and resources without further processing, each modulated signal is actually mapped to a subcarrier for transmission. If a subcarrier mapped to a modulated signal belongs to a deep fading frequency band, the transmission reliability of that modulated signal decreases. In this embodiment, the modulated signal is mapped again after layer mapping to obtain j sets of second signals. The transmission resources corresponding to each signal in the j sets of second signals include multiple frequency domain units. Thus, each signal in the j sets of second signals, after precoding, is ultimately mapped to multiple frequency domain units for transmission. If some of these frequency domain units belong to a deep fading frequency band, the signal mapped to the remaining frequency domain units still has a relatively high probability of successful transmission, thereby improving the reliability of wireless transmission. Furthermore, since the transmission resources corresponding to each signal in the j second signal sets include multiple frequency domain units, the precoding degree of each signal is greater. That is, the transmitter has more precoding matrices to choose from when precoding each signal. In this way, the transmitter has the opportunity to select a precoding matrix with better inter-stream interference suppression effect to precode the j second signal sets, thereby improving the inter-stream interference suppression effect.

[0009] In an optional implementation of the first aspect, the first mapping relationship includes: r (m) (n)=x (s) (t); where r (m) (n) represents a signal with index n in the second signal set with index m, r (m) (n) belongs to j sets of second signals; x (s) (t) represents a signal with index t in the first signal set, and s represents the index of the first signal set.

[0010] The second set of signals can be referred to as the set of signals in the space-frequency layer, r (m) (n) represents any signal in any spatial frequency layer, x (s) (t) represents any signal in any spatial layer. Therefore, in this embodiment, the mapping method from the spatial layer to the space-frequency layer can be any method. The transmitting end can select the specific mapping method according to the actual situation, thereby improving the flexibility of the mapping from the spatial layer to the space-frequency layer.

[0011] In an optional implementation of the first aspect, 0 ≤ s ≤ v-1, v represents the number of spatial layers, n equals i, t equals j*i+a, i is an integer greater than or equal to 0, a is an integer greater than or equal to 0, * represents multiplication, and the first mapping relationship includes: r (m) (i)=x(s) (j*i+a); where the signals in the first signal set begin to be mapped when i and a take their minimum values, and the signals in the first signal set are first mapped to j second signal sets in ascending order of a, and then mapped to j second signal sets in ascending order of i; and the number of values ​​of a is equal to j; and m changes with the change of a.

[0012] In an alternative implementation of the first aspect, m varies with a, including: m increases as a increases, or m decreases as a increases.

[0013] In an optional implementation of the first aspect, m changes as a changes, including: the absolute value of the change in m is the same as the absolute value of the change in a.

[0014] In an alternative implementation of the first aspect, m equals 0 when s equals 0.

[0015] In an optional implementation of the first aspect, resource mapping of j sets of third signals includes: mapping each signal in the j sets of third signals to a first transmission resource, the first transmission resource including L time-domain units, K frequency-domain units and P antenna ports, where L and P are both positive integers and K is a positive integer greater than 1.

[0016] In an optional implementation of the first aspect, the index of any one of the L time-domain units is l, the index of any one of the K frequency-domain units is k, and the index of any one of the P antenna ports is p; the signals mapped to time-domain unit l from the j third signal sets are mapped according to the following rules: they are mapped to the K frequency-domain units in ascending order of the value of k, and to the P antenna ports in ascending order of the value of p, wherein the value of k changes first, and p changes when the value of k traverses the set of values ​​of k; or, the value of p changes first, and k changes when the value of p traverses the set of values ​​of p.

[0017] This embodiment provides two resource mapping methods, and the sending end can choose the specific mapping method according to the actual situation, thereby improving the flexibility of resource mapping.

[0018] Secondly, embodiments of this application provide a communication method that can be executed by a receiving end, wherein the receiving end can be a network device or a chip applied to a network device, or the receiving end can be a terminal or a chip applied to a terminal. The method includes: determining a target signal; performing de-resource mapping on the target signal to determine j sets of third signals, where j is a positive integer; performing de-precoding on the j sets of third signals to generate j sets of second signals, wherein the transmission resources corresponding to each signal in the j sets of second signals include multiple frequency domain units; and determining a first signal set based on the j sets of second signals, wherein a first mapping relationship exists between the first signal set and the j sets of second signals.

[0019] In the above method, the first signal set is the signal set of the first spatial layer; or, the first signal set is determined based on the modulation signal set (or, complex-valued signal set, or, constellation symbol set); or, the first signal set is the modulation signal set (or, complex-valued signal set, or, constellation symbol set).

[0020] When radio frequency (RF) signals are transmitted in a wireless channel, they can travel from the transmitting antenna to the receiving antenna via multiple paths. This phenomenon is called multipath propagation, which can lead to frequency-selective fading. If, after layer mapping, the modulated signal is directly mapped to antenna ports and resources without further processing, each modulated signal is actually mapped to a subcarrier for transmission. If a subcarrier mapped to a modulated signal belongs to a deep fading frequency band, the transmission reliability of that modulated signal decreases. In this embodiment, the modulated signal is mapped again after layer mapping to obtain j second signal sets. The transmission resources corresponding to each signal in the j second signal sets include multiple frequency domain units. Thus, each signal in the j second signal sets, after precoding, is ultimately mapped to multiple frequency domain units for transmission. If some of these frequency domain units belong to a deep fading frequency band, the signal mapped to the remaining frequency domain units still has a relatively high probability of successful transmission. The receiving end recovers the first signal set based on the reverse process described above (e.g., de-resource mapping and de-precoding), thereby improving the reliability of wireless transmission. Furthermore, since the transmission resources corresponding to each signal in the j second signal sets include multiple frequency domain units, the precoding degree of each signal is greater. That is, the transmitter has more precoding matrices to choose from when precoding each signal. In this way, the transmitter has the opportunity to select a precoding matrix with better inter-stream interference suppression effect to precode the j second signal sets, thereby improving the inter-stream interference suppression effect.

[0021] In an optional implementation of the second aspect, the first mapping relationship includes: r (m) (n)=x (s) (t); where r (m)(n) represents a signal with index n in the second signal set with index m, r (m) (n) belongs to j sets of second signals; x (s) (t) represents a signal with index t in the first signal set, and s represents the index of the first signal set.

[0022] The second set of signals can be referred to as the set of signals in the space-frequency layer, r (m) (n) represents any signal in any spatial frequency layer, x (s) (t) represents any signal in any spatial layer. Therefore, in this embodiment, the mapping method from the spatial layer to the space-frequency layer can be any method. The transmitting end can select a specific mapping method according to the actual situation, and the receiving end performs demapping operation based on the mapping method selected by the transmitting end, thereby improving the flexibility of the mapping from the spatial layer to the space-frequency layer.

[0023] In an optional implementation of the second aspect, 0 ≤ s ≤ v-1, v represents the number of spatial layers, n equals i, t equals j*i + a, i is an integer greater than or equal to 0, a is an integer greater than or equal to 0, * represents multiplication, and the first mapping relationship includes: r (m) (i)=x (s) (j*i+a); where the signals in the first signal set begin to be mapped when i and a take their minimum values, and the signals in the first signal set are first mapped to j second signal sets in ascending order of a, and then mapped to j second signal sets in ascending order of i; and the number of values ​​of a is equal to j; and m changes with the change of a.

[0024] In an alternative implementation of the second aspect, m varies with a, including: m increases as a increases, or m decreases as a increases.

[0025] In an alternative implementation of the second aspect, m changes with a, including: the absolute value of the change in m is the same as the absolute value of the change in a.

[0026] In an alternative implementation of the second aspect, m equals 0 when s equals 0.

[0027] In an optional implementation of the second aspect, de-resource mapping of the target signal includes: de-resource mapping of the target signal according to the resource mapping method of j third signal sets, wherein the resource mapping method of the j third signal sets includes: each signal in the j third signal sets is mapped to a first transmission resource, the first transmission resource including L time domain units, K frequency domain units and P antenna ports, where L and P are both positive integers and K is a positive integer greater than 1.

[0028] In an optional implementation of the second aspect, the index of any one of the L time-domain units is l, the index of any one of the K frequency-domain units is k, and the index of any one of the P antenna ports is p; the signals mapped to time-domain unit l from the j third signal sets are mapped according to the following rules: they are mapped to the K frequency-domain units in ascending order of the value of k, and to the P antenna ports in ascending order of the value of p, wherein the value of k changes first, and p changes when the value of k traverses the set of values ​​of k; or, the value of p changes first, and k changes when the value of p traverses the set of values ​​of p.

[0029] This embodiment provides two resource mapping methods. The sending end can choose the specific mapping method according to the actual situation, and the receiving end performs demapping operation based on the mapping method selected by the sending end, thereby improving the flexibility of resource mapping.

[0030] Thirdly, embodiments of this application provide a communication device. The communication device may include a processing unit for performing: any method of the first aspect and its optional embodiments, or any method of the second aspect and its optional embodiments.

[0031] Optionally, the communication device further includes a transceiver unit, which is a sending unit when performing the sending step and a receiving unit when performing the receiving step.

[0032] Fourthly, embodiments of this application provide a communication device, which may be a base station or a chip applied to a base station. The communication device may include a processor for executing: any method of the first aspect and its optional embodiments, or any method of the second aspect and its optional embodiments.

[0033] Optionally, the communication device may also include a transceiver. When the communication device is a base station, the transceiver may be a transceiver circuit, an antenna, etc.; when the communication device is a chip used in a base station, the transceiver may be an input / output interface, pins, interface circuits, etc.

[0034] Optionally, the communication device may further include a memory for storing computer programs or instructions. The processor executes the computer programs or instructions stored in the memory to cause the communication device to perform either the first aspect and any of its optional embodiments, or the second aspect and any of its optional embodiments. When the communication device is a base station, the memory may be a read-only memory, a random access memory, etc.; when the communication device is a chip applied to a base station, the memory may be a register, a cache, etc.

[0035] Fifthly, embodiments of this application provide a communication device, which may be a terminal or a chip applied to a terminal. The communication device may include a processor for executing: any method of the first aspect and its optional embodiments, or any method of the second aspect and its optional embodiments.

[0036] Optionally, the communication device may also include a transceiver. When the communication device is a terminal, the transceiver may be a transceiver circuit, an antenna, etc.; when the communication device is a chip applied to a terminal, the transceiver may be an input / output interface, pins, interface circuits, etc.

[0037] Optionally, the communication device may further include a memory for storing computer programs or instructions. The processor executes the computer programs or instructions stored in the memory to cause the communication device to perform either the first aspect and any of its optional embodiments, or the second aspect and any of its optional embodiments. When the communication device is a terminal, the memory may be a read-only memory, a random access memory, etc.; when the communication device is a chip applied to a terminal, the memory may be a register, a cache, etc.

[0038] In a sixth aspect, embodiments of this application provide a communication system comprising: a communication device for performing any one of the methods in the first aspect and its optional embodiments, and a communication device for performing any one of the methods in the second aspect and its optional embodiments.

[0039] In a seventh aspect, embodiments of this application provide a computer-readable storage medium storing a computer program or instructions that, when executed on a communication device, cause the communication device to perform: any of the methods in the first aspect and its optional embodiments, or any of the methods in the second aspect and its optional embodiments.

[0040] Eighthly, embodiments of this application provide a computer program product comprising: a computer program or instructions that, when executed by a communication device, cause the communication device to perform: any one of the methods in the first aspect and its optional embodiments, or any one of the methods in the second aspect and its optional embodiments. Attached Figure Description

[0041] Figure 1 This is a schematic diagram of the architecture of the communication system used in the embodiments of this application;

[0042] Figure 2 This is a schematic diagram of an open wireless access network architecture provided by an embodiment of this application;

[0043] Figure 3 This is a schematic flowchart illustrating a communication method provided in an embodiment of this application;

[0044] Figure 4 This is a schematic flowchart illustrating a communication method provided in an embodiment of this application;

[0045] Figure 5 This is a schematic diagram of a first mapping relationship provided by an embodiment of this application;

[0046] Figure 6 This is a schematic diagram illustrating another first mapping relationship provided by an embodiment of this application;

[0047] Figure 7 This is a schematic diagram illustrating yet another first mapping relationship provided by an embodiment of this application;

[0048] Figure 8 This is a schematic diagram of a method for mapping from the spatial frequency layer to the spatial domain layer provided in an embodiment of this application;

[0049] Figure 9 This is a schematic diagram of the structure of a communication device provided in an embodiment of this application;

[0050] Figure 10 This is a schematic diagram of another communication device provided in an embodiment of this application. Detailed Implementation

[0051] Figure 1 This is a schematic diagram of the architecture of the communication system 1000 used in an embodiment of this application. Figure 1 As shown, the communication system includes a radio access network (RAN) 100, wherein the RAN 100 includes at least one RAN node (e.g., Figure 1 110a and 110b, collectively referred to as 110, may also include at least one terminal (such as...). Figure 1 RAN 100, denoted as RAN 120a-120j, is collectively referred to as RAN 120. RAN 100 may also include other RAN nodes, such as wireless relay equipment and / or wireless backhaul equipment. Figure 1(Not shown in the image). Terminal 120 is wirelessly connected to RAN node 110. Terminals and RAN nodes can be interconnected via wired or wireless means. Communication system 1000 may also include core network 200. RAN node 110 is connected to core network 200 via wireless or wired means. The core network equipment in core network 200 and RAN node 110 in RAN 100 can be independent physical devices, or they can be the same physical device integrating the logical functions of core network equipment and RAN node. Communication system 1000 may also include Internet 300.

[0052] RAN 100 can be an evolved universal terrestrial radio access (E-UTRA) system, a new radio (NR) system, or a future radio access system as defined in the 3rd generation partnership project (3GPP), or it can be a Wi-Fi system. RAN 100 can also include two or more of the above-mentioned different radio access systems. RAN 100 can also be an open RAN (O-RAN).

[0053] RAN nodes, also known as network devices, wireless access network devices, RAN entities, or access nodes, are used to help terminals access communication systems wirelessly.

[0054] In one application scenario, a RAN node can be a base station, an evolved NodeB (eNodeB), a transmission reception point (TRP), a next-generation NodeB (gNB) in a 5G mobile communication system, a base station in a future communication network, an access point (AP) in a Wi-Fi system, an AP in a long-range radio (LoRa) system, or an AP in a vehicle-to-everything (V2X) system. A RAN node can also be a macro base station (such as...) Figure 1 110a in the text), can also be a micro base station or an indoor station (such as... Figure 1 110b in the middle can also be a relay node or a donor node.

[0055] In another application scenario, multiple RAN nodes can collaborate to help terminals achieve wireless access, with different RAN nodes implementing different functions of the base station. For example, a RAN node can be a central unit (CU), a distributed unit (DU), or a radio unit (RU). The CU performs the functions of the base station's radio resource control (RRC) protocol and packet data convergence protocol (PDCP), and can also perform the functions of the service data adaptation protocol (SDAP). The DU performs the functions of the base station's radio link control (RLC) layer and medium access control (MAC) layer, and can also perform some or all of the physical (PHY) layer functions. For specific descriptions of these protocol layers, refer to the relevant 3GPP technical specifications. The RU can be used to implement radio frequency signal transmission and reception. The CU and DU can be set up as two independent RAN nodes, or integrated into the same RAN node, for example, integrated into the baseband unit (BBU). RUs can be included in radio frequency equipment, such as remote radio units (RRUs), active antenna units (AAUs), or remote radio heads (RRHs). CUs can be further divided into two types of RAN nodes: central unit control plane (CU-CP) and central unit user plane (CU-UP).

[0056] In different systems, RAN nodes may have different names. For example, in an O-RAN system, a CU can be called an open CU (O-CU), a DU can be called an open DU (O-DU), and a RU can be called an open RU (O-RU).

[0057] Figure 2 This is a schematic diagram of an O-RAN architecture provided by an embodiment of this application.

[0058] like Figure 2As shown, O-RAN includes O-CU, O-DU, and O-RU. Optionally, O-CU and O-DU can be integrated into BBU. BBU and O-RU can be co-located or non-co-located. O-CU can communicate with the core network via backhaul, O-CU and O-DU can communicate via midhaul, O-DU and O-RU can communicate via fronthaul, and O-RU can communicate with user equipment (UE) via air interface.

[0059] The RAN node in the embodiments of this application can be implemented through software modules, hardware modules, or a combination of software and hardware modules. For example, the RAN node can be a server loaded with the corresponding software module. The embodiments of this application do not limit the specific technology or device form used in the RAN node. For ease of description, a base station is used as an example of a RAN node in the following description.

[0060] A terminal is a device with wireless transceiver capabilities, capable of sending signals to or receiving signals from a base station. Terminals can also be called terminal equipment, user interface (UE), mobile station, mobile terminal, etc. Terminals can be widely used in various scenarios, such as device-to-device (D2D), vehicle-to-everything (V2X) communication, machine-type communication (MTC), Internet of Things (IoT), virtual reality (VR), augmented reality (AR), industrial control, autonomous driving, telemedicine, smart grids, smart furniture, smart offices, smart wearables, smart transportation, and smart cities. A terminal can be a mobile phone (e.g., a smartphone). Figure 1 120a, 120e, 120f and 120j), tablet computers (such as Figure 1 120g), printers with wireless transceiver capabilities (such as...) Figure 1 120h), wearable devices, vehicles (such as Figure 1 120b in the middle), charging piles (such as Figure 1 120c in the middle), aircraft (such as Figure 1 120i), ships, robots, robotic arms, smart home devices (such as Figure 1 Examples include 120d). The embodiments of this application do not limit the specific technology or device form used in the terminal.

[0061] By way of example and not limitation, in the embodiments of this application, wearable devices may also be referred to as wearable smart devices. This is a general term for devices that utilize wearable technology to intelligently design and develop everyday wearables, such as glasses, gloves, watches, clothing, and shoes. Wearable devices are portable devices that are worn directly on the body or integrated into a user's clothing or accessories. Wearable devices are not merely hardware devices, but also achieve powerful functions through software support, data interaction, and cloud interaction. In a broad sense, wearable smart devices include fully functional, large-sized electronic devices that can achieve complete or partial functionality without relying on a smartphone, such as smartwatches or smart glasses, or electronic devices that focus on a specific application function and require cooperation with other devices such as smartphones, such as various smart bracelets and smart jewelry for measuring vital signs.

[0062] All the terminals described above, if located in a vehicle (e.g., placed inside or installed inside a vehicle), can be considered vehicle-mounted terminals. Vehicle-mounted terminals can also be called vehicle modules, vehicle components, vehicle chips, or on-board units (OBU).

[0063] Base stations and terminals can be fixed or mobile. They can be deployed on land, including indoors or outdoors, handheld or vehicle-mounted; they can also be deployed on water; and they can be deployed on aircraft, balloons, and satellites. The embodiments of this application do not limit the application scenarios of the base stations and terminals.

[0064] The roles of base stations and terminals can be relative, for example, Figure 1 The 120i (which could be a helicopter or drone) can be configured as a mobile base station. For those 120j accessing the wireless access network 100 via the 120i, the 120i is a base station; however, for the 110a, the 120i is a terminal, meaning that the 110a and 120i communicate via a wireless air interface protocol. Of course, the 110a and 120i can also communicate via a base station-to-base station interface protocol; in this case, the 120i is also a base station relative to the 110a. Therefore, both base stations and terminals can be collectively referred to as communication devices. Figure 1 The 110a and 110b in the text can be referred to as communication devices with base station functions. Figure 1 The 120a-120j in the text can be referred to as communication devices with terminal functions.

[0065] Communication between base stations and terminals, between base stations, and between terminals can be conducted using licensed spectrum, unlicensed spectrum, or both simultaneously. Communication can be conducted using spectrum below 6 GHz, spectrum above 6 GHz, or both simultaneously. The embodiments of this application do not limit the spectrum resources used for wireless communication.

[0066] In the embodiments of this application, the functions of the base station can be executed by modules (such as chips) within the base station, or by a control subsystem that includes base station functions. This control subsystem, including base station functions, can be a control center in the aforementioned application scenarios such as smart grids, industrial control, intelligent transportation, and smart cities. Similarly, the functions of the terminal can be executed by modules (such as chips or modems) within the terminal, or by a device that includes terminal functions.

[0067] To facilitate understanding of the embodiments of this application, the technologies involved in the embodiments of this application will be briefly introduced below.

[0068] Figure 3 This is a schematic flowchart illustrating a communication method provided in an embodiment of this application.

[0069] In this communication method, the transmitting end transmits the resulting wireless signal, obtained after performing source coding, channel coding, modulation, layer mapping, precoding, and resource mapping on the source, to the receiving end. This wireless signal may be affected by noise interference during transmission over the channel between the transmitting and receiving ends. After receiving the wireless signal, the receiving end performs operations such as de-resource mapping, de-precoding, de-layer mapping, demodulation, channel decoding, and source decoding to obtain the destination (i.e., the reconstructed source). It should be noted that... Figure 3 The communication method shown is illustrative and not limiting; wireless communication systems can be adapted to specific needs. Figure 3 The processing steps can be added, reduced, or modified based on the method shown. The main steps of this communication method are briefly described below.

[0070] 1. Source coding and source decoding.

[0071] A source of information is the origin of information. The information generated by a source can be one or more of sound, images, and text, or other forms of information. For the sake of simplicity, the distinction between source and information is not made in the embodiments of this application.

[0072] Source coding is a transformation of a source aimed at improving communication efficiency, or a transformation to reduce or eliminate source redundancy. Its main metric is coding efficiency. Specifically, it involves finding a method based on the statistical characteristics of the source to transform it into the shortest possible sequence of information bits, increasing the average information content carried by each bit, while ensuring lossless reconstruction of the source.

[0073] The inverse process of source coding is source decoding, which is the process of restoring the source signal from the signal before decoding.

[0074] 2. Channel coding and channel decoding.

[0075] Channel coding, also known as error control coding, involves adding redundant bits to information bits (also called source bits or systematic bits) at the transmitting end. These redundant bits are associated with the information bits. The result of channel coding is called a code block, which includes information bits and redundant bits. After operations such as rate matching and code block concatenation, the result is called a codeword. The main goal of channel coding is to improve the reliability of information transmission.

[0076] The inverse process of channel coding is channel decoding. For example, the receiver detects and corrects errors generated during transmission based on the correlation between redundant bits and information bits, recovers the information bits, thereby combating interference during transmission and improving the reliability of data transmission.

[0077] 3. Modulation and demodulation.

[0078] Modulation refers to mapping bits in a bit sequence (e.g., codeword) onto constellation points in a constellation diagram. One or more bits in a bit sequence can be mapped to a constellation point. The signal output after modulation of a bit sequence can be called a modulation symbol or modulated signal, which is usually a complex-valued signal.

[0079] The purpose of modulation is to process the digital signal to be transmitted (e.g., the codeword mentioned above) in the time domain, frequency domain, or code domain in order to transmit as much information as possible with the smallest possible bandwidth.

[0080] The reverse process of modulation is demodulation, which is the process of recovering the bit sequence from the constellation symbols (i.e., the complex-valued signal).

[0081] 4. Layer mapping and de-mapping.

[0082] Layer mapping is used to map multiple modulated signals to different spatial layers. A spatial layer can also be called a transport layer, layer, transport stream, spatial stream, or stream. The number of spatial layers can be determined based on the rank of the channel matrix obtained from channel measurements. In multiple-input multiple-output (MIMO) techniques, a spatial layer can be viewed as an independently transmittable data stream. To improve the data transmission capability of a communication system, the transmitter can transmit data to the receiver through multiple spatial layers.

[0083] Since the number of codewords is not necessarily equal to the number of antenna ports, but the number of spatial layers is equal to the number of antenna ports, layer mapping can solve the problem of the unequal number of codewords and antenna ports.

[0084] The inverse process of layer mapping is de-mapping. For example, combining the complex-valued signals mapped to each antenna port into a modulation signal corresponding to one or more codewords.

[0085] 5. Precoding and Deprecoding.

[0086] Precoding is a technique where the transmitter, knowing the channel conditions, processes the signal to be transmitted using a precoding matrix that matches the channel conditions. The precoded signal is adapted to the channel, thus reducing the complexity of the receiver eliminating inter-channel interference. Precoding can also be used when the transmitter lacks channel information, processing the signal using a pre-set precoding matrix or weighting method. Through precoding of the signal, the quality of the received signal (e.g., signal-to-interference-plus-noise ratio) is improved.

[0087] The inverse process of precoding is deprecoding. For example, the receiver can determine the deprecoding matrix based on the precoding matrix used by the transmitter, and then multiply the received signal by the deprecoding matrix to recover the complex signals mapped to each antenna port by the transmitter.

[0088] 6. Resource mapping and de-resource mapping.

[0089] Resource mapping is the process of mapping a signal (e.g., a precoded signal) onto transmission resources (e.g., time-domain, frequency-domain, and spatial-domain resources).

[0090] The inverse process of resource mapping is de-mapping. For example, the receiving end can restore the signal mapped to the transmission resources according to the resource mapping rules of the sending end, thus obtaining the signal before resource mapping.

[0091] After resource mapping, the signal is converted into a radio frequency (RF) signal by the antenna. When the RF signal is transmitted in a wireless channel, it can travel from the transmitting antenna to the receiving antenna via multiple paths; this phenomenon is called multipath effect, which can lead to frequency-selective fading. If the modulated signal undergoes layer mapping and is directly mapped to antenna port and resources without further processing, each modulated signal is actually mapped to a subcarrier for transmission. If a modulated signal is mapped to a subcarrier that belongs to a deep fading frequency band, the transmission reliability of that modulated signal decreases. Therefore, wireless communication methods for future communication systems need to seek technological breakthroughs in new directions.

[0092] The following describes another communication method provided by an embodiment of this application.

[0093] like Figure 4 As shown, method 400 is executed by a transmitting end and a receiving end, respectively. The transmitting end can be a base station or a chip applied to a base station, or the transmitting end can be a terminal or a chip applied to a terminal. The receiving end can be a base station or a chip applied to a base station, or the receiving end can be a terminal or a chip applied to a terminal. The embodiments of this application do not limit the specific form of the receiving end and the receiving end.

[0094] Method 400 includes:

[0095] S410, determine the first signal set, the first signal set is the signal set of the first spatial layer.

[0096] The first signal set is, for example, obtained by mapping multiple modulated signals through a spatial layer. These multiple modulated signals can be obtained by modulating a single codeword or by modulating multiple codewords. The first signal set can also be referred to as a transport stream, spatial stream, spatial stream, or stream; the embodiments of this application do not limit the name of the first signal set. Furthermore, the embodiments of this application do not limit the mapping method from the modulated signals to the first signal set.

[0097] To determine the first set of signals, the transmitting end can perform the following steps.

[0098] S420, determine j second signal sets based on the first signal set, wherein the transmission resources corresponding to each signal in the j second signal sets include multiple frequency domain units and one time domain unit, and there is a first mapping relationship between the first signal set and the j second signal sets, where j is a positive integer.

[0099] Optionally, the first mapping relationship includes:

[0100] r (m) (n)=x (s) (t)(1);

[0101] Where, r (m) (n) represents a signal with index n in the second signal set with index m, r (m) (n) belongs to j sets of second signals; x (s) (t) represents a signal with index t in the first signal set, and s represents the index of the first signal set.

[0102] The second set of signals can be referred to as the set of signals in the space-frequency layer, r (m) (n) represents any signal in any spatial frequency layer, x (s) (t) represents any signal in any spatial layer. Therefore, in formula (1), the mapping method from the spatial layer to the space-frequency layer can be any method. The transmitter can choose the specific mapping method according to the actual situation, thereby improving the flexibility of the mapping from the spatial layer to the space-frequency layer.

[0103] The following are some examples of the first mapping relationship based on formula (1):

[0104] When m = 0, n = 0, s = 0, t = 0, r (0) (0)=x (0) (0) represents x (0) (0) mapped to r (0) (0), where x (0) (0) represents the signal with index 0 in the first signal set with index 0, r (0) (0) represents the signal with index 0 in the second signal set with index 0;

[0105] When m=1, n=0, s=0, t=1, r (1) (0)=x (0) (1) represents x (0) (1) Mapping to r (1) (0), where x (0) (1) represents the signal with index 1 in the first signal set with index 0, r (1) (0) represents the signal with index 0 in the second signal set with index 1;

[0106] When m = 2, n = 0, s = 1, t = 0, r (2) (0)=x (1) (0) represents x (1) (0) mapped to r (2) (0), where x (1) (0) represents the signal with index 0 in the first signal set with index 1, r (2) (0) represents the signal with index 0 in the second signal set with index 2;

[0107] When m = 0, n = 1, s = 2, t = 0, r (0) (1) = x (2) (0) represents x (2) (0) mapped to r (0) (1), where x (2) (0) represents the signal with index 0 in the first signal set with index 2, r (0) (1) represents the signal with index 1 in the second signal set with index 0.

[0108] Optionally, in formula (1), 0 ≤ s ≤ v-1, v represents the number of spatial layers, n equals i, t equals j*i+a, i is an integer greater than or equal to 0, a is an integer greater than or equal to 0, and * represents multiplication. Then the first mapping relationship includes:

[0109] r (m) (i)=x (s) (j*i+a)(2);

[0110] In this process, the signals in the first signal set are mapped starting when i and a take their minimum values. The signals in the first signal set are first mapped to j second signal sets in ascending order of a, and then mapped to j second signal sets in ascending order of i. The number of values ​​for a is equal to j. Furthermore, m changes as a changes.

[0111] In formula (2), the mapping method from the spatial domain layer to the spatial frequency layer is constrained. That is, multiple signals belonging to a spatial domain layer need to be mapped to the corresponding spatial frequency layer in ascending order of signal index.

[0112] Below, we will give a few more examples of the first mapping relationship in conjunction with formula (2).

[0113] Example 1:

[0114] like Figure 5 As shown, the transmitting end determines to perform "spatial-to-space-frequency mapping" on two first signal sets, namely the signal set of spatial layer 0 and the signal set of spatial layer 1, where the signal set of spatial layer 0 includes x. (0) (0), x (0) (1) x (0) (2) x (0) (3) x (0) (4) and x (0) (5) The signal set of spatial layer 1 includes x (1) (0), x (1) (1) x (1) (2) x (1) (3) x (1) (4) and x(1) (5).

[0115] For spatial layer 0, s = 0; if the transmitter determines to map spatial layer 0 to space frequency layer 0 and space frequency layer 1, then j = 2, m = 0 or 1; since the number of values ​​of a is equal to j, let a be equal to 0 or 1; if spatial layer 0 starts mapping from space frequency layer 0, then the initial value of m is 0; since m changes with a, let m be equal to 0 when a = 0, and m = 1 when a = 1. Substituting the values ​​of these parameters into formula (2), we can obtain the following mapping process for spatial layer 0:

[0116] When i = 0 and a = 0, m = 0, then r (0) (0)=x (0) (2*0+0), that is, r (0) (0)=x (0) (0) represents x (0) (0) mapped to r (0) (0);

[0117] When i = 0 and a = 1, m = 1, then r (1) (0)=x (0) (2*0+1), that is, r (1) (0)=x (0) (1) represents x (0) (1) Mapping to r (1) (0);

[0118] When i = 1 and a = 0, m = 0, then r (0) (1) = x (0) (2*1+0), that is, r (0) (1) = x (0) (2) represents x (0) (2) Mapping to r (0) (1);

[0119] When i = 1 and a = 1, m = 1, then r (1) (1) = x (0) (2*1+1), that is, r (1) (1) = x (0) (3) represents x (0) (3) Mapping to r (1) (1);

[0120] When i = 2 and a = 0, m = 0, then r (0) (2) = x (0) (2*2+0), that is, r (0) (2) = x (0) (4) represents x (0) (4) Mapping to r (0)(2);

[0121] When i = 2 and a = 1, m = 1, then r (1) (2) = x (0) (2*2+1), that is, r (1) (2) = x (0) (5) represents x (0) (5) Mapping to r (1) (2).

[0122] If spatial layer 0 includes more signals, then subsequent signals can be mapped to spatial frequency layer 0 and spatial frequency layer 1 according to the above rules.

[0123] For spatial layer 1, s = 1; if the transmitter determines to map spatial layer 1 to spatial frequency layers 2, 3, and 4, then j = 3, m = 2, 3, or 4; since the number of values ​​of a is equal to j, let a be equal to 0, 1, or 2; if spatial layer 1 starts mapping from spatial frequency layer 2, then the initial value of m is 2; since m changes with a, let's assume: when a = 0, m = 2, when a = 1, m = 3, and when a = 2, m = 4. Substituting these parameter values ​​into formula (2), we can obtain the following mapping process for spatial layer 1:

[0124] When i = 0 and a = 0, m = 2, then r (2) (0)=x (1) (3*0+0), that is, r (2) (0)=x (1) (0) represents x (1) (0) mapped to r (2) (0);

[0125] When i = 0 and a = 1, m = 3, then r (3) (0)=x (1) (3*0+1), that is, r (3) (0)=x (1) (1) represents x (1) (1) Mapping to r (3) (0);

[0126] When i = 0 and a = 2, m = 4, then r (4) (1) = x (1) (3*0+2), that is, r (4) (1) = x (1) (2) represents x (1) (2) Mapping to r (4) (0);

[0127] When i = 1 and a = 0, m = 2, then r (2) (1) = x (1)(3*1+0), that is, r (2) (1) = x (1) (3) represents x (1) (3) Mapping to r (2) (1);

[0128] When i = 1 and a = 1, m = 3, then r (3) (2) = x (1) (3*1+1), that is, r (3) (2) = x (1) (4) represents x (1) (4) Mapping to r (3) (1);

[0129] When i = 1 and a = 2, m = 4, then r (4) (2) = x (1) (3*1+2), that is, r (4) (2) = x (1) (5) represents x (1) (5) Mapping to r (4) (1).

[0130] If spatial layer 1 includes more signals, then subsequent signals can be mapped to spatial frequency layers 2, 3 and 4 according to the above rules.

[0131] Example 2:

[0132] like Figure 6 As shown, the transmitting end determines to perform "spatial-to-space-frequency mapping" on two first signal sets, namely the signal set of spatial layer 0 and the signal set of spatial layer 1, where the signal set of spatial layer 0 includes x. (0) (0), x (0) (1) x (0) (2) x (0) (3) x (0) (4) and x (0) (5) The signal set of spatial layer 1 includes x (1) (0), x (1) (1) x (1) (2) x (1) (3) x (1) (4) and x (1) (5).

[0133] For spatial layer 0, s = 0; if the transmitter determines to map spatial layer 0 to space frequency layer 0 and space frequency layer 2, then j = 2, m = 0 or 2; since the number of values ​​of a is equal to j, let a be equal to 0 or 1; if spatial layer 0 starts mapping from space frequency layer 0, then the initial value of m is 0; since m changes with a, let m be equal to 0 when a = 0, and m = 2 when a = 1. Substituting these parameter values ​​into formula (2), we can obtain the following mapping process for spatial layer 0:

[0134] When i = 0 and a = 0, m = 0, then r (0) (0)=x (0) (2*0+0), that is, r (0) (0)=x (0) (0) represents x (0) (0) mapped to r (0) (0);

[0135] When i = 0 and a = 1, m = 2, then r (2) (0)=x (0) (2*0+1), that is, r (2) (0)=x (0) (1) represents x (0) (1) Mapping to r (2) (0);

[0136] When i = 1 and a = 0, m = 0, then r (0) (1) = x (0) (2*1+0), that is, r (0) (1) = x (0) (2) represents x (0) (2) Mapping to r (0) (1);

[0137] When i = 1 and a = 1, m = 2, then r (2) (1) = x (0) (2*1+1), that is, r (2) (1) = x (0) (3) represents x (0) (3) Mapping to r (2) (1);

[0138] When i = 2 and a = 0, m = 0, then r (0) (2) = x (0) (2*2+0), that is, r (0) (2) = x (0) (4) represents x (0) (4) Mapping to r (0) (2);

[0139] When i = 2 and a = 1, m = 2, then r (2) (2) = x (0) (2*2+1), that is, r (2) (2) = x (0) (5) represents x (0) (5) Mapping to r (2) (2).

[0140] If spatial layer 0 includes more signals, then subsequent signals can be mapped to spatial frequency layer 0 and spatial frequency layer 2 according to the above rules.

[0141] For spatial layer 1, s = 1; if the transmitter determines to map spatial layer 1 to space frequency layer 1, space frequency layer 3, and space frequency layer 4, then j = 3, m = 1, 3, or 4; since the number of values ​​of a is equal to j, let a be equal to 0, 1, or 2; if spatial layer 1 starts mapping from space frequency layer 1, then the initial value of m is 1; since m changes with a, let m be equal to 1 when a = 0, m = 1 when a = 1, m = 3 when a = 2, and m = 4 when a = 2. Substituting these parameter values ​​into formula (2), we can obtain the following mapping process for spatial layer 1:

[0142] When i = 0 and a = 0, m = 1, then r (1) (0)=x (1) (3*0+0), that is, r (1) (0)=x (1) (0) represents x (1) (0) mapped to r (1) (0);

[0143] When i = 0 and a = 1, m = 3, then r (3) (0)=x (1) (3*0+1), that is, r (3) (0)=x (1) (1) represents x (1) (1) Mapping to r (3) (0);

[0144] When i = 0 and a = 2, m = 4, then r (4) (1) = x (1) (3*0+2), that is, r (4) (1) = x (1) (2) represents x (1) (2) Mapping to r (4) (0);

[0145] When i = 1 and a = 0, m = 1, then r (1) (1) = x (1) (3*1+0), that is, r (1) (1) = x(1) (3) represents x (1) (3) Mapping to r (1) (1);

[0146] When i = 1 and a = 1, m = 3, then r (3) (2) = x (1) (3*1+1), that is, r (3) (2) = x (1) (4) represents x (1) (4) Mapping to r (3) (1);

[0147] When i = 1 and a = 2, m = 4, then r (4) (2) = x (1) (3*1+2), that is, r (4) (2) = x (1) (5) represents x (1) (5) Mapping to r (4) (1).

[0148] If spatial layer 1 includes more signals, then subsequent signals can be mapped to spatial frequency layer 1, spatial frequency layer 3 and spatial frequency layer 4 according to the above rules.

[0149] Compared to Example 1, in Example 2, each spatial layer is no longer mapped to a continuous spatial frequency layer, but rather to spaced spatial frequency layers.

[0150] Example 3:

[0151] like Figure 7 As shown, the transmitting end determines to perform "spatial-to-space-frequency mapping" on two first signal sets, namely the signal set of spatial layer 0 and the signal set of spatial layer 1, where the signal set of spatial layer 0 includes x. (0) (0), x (0) (1) x (0) (2) x (0) (3) x (0) (4) and x (0) (5) The signal set of spatial layer 1 includes x (1) (0), x (1) (1) x (1) (2) x (1) (3) x (1) (4) and x (1) (5).

[0152] For spatial layer 0, s = 0; if the transmitter determines to map spatial layer 0 to space frequency layer 0 and space frequency layer 2, then j = 2, m = 0 or 2; since the number of values ​​of a is equal to j, let a be equal to 0 or 1; if spatial layer 0 starts mapping from space frequency layer 2, then the initial value of m is 2; since m changes with a, let's assume that when a = 0, m = 2, and when a = 1, m = 0. Substituting these parameter values ​​into formula (2), we can obtain the following mapping process for spatial layer 0:

[0153] When i = 0 and a = 0, m = 2, then r (2) (0)=x (0) (2*0+0), that is, r (2) (0)=x (0) (0) represents x (0) (0) mapped to r (2) (0);

[0154] When i = 0 and a = 1, m = 0, then r (0) (0)=x (0) (2*0+1), that is, r (0) (0)=x (0) (1) represents x (0) (1) Mapping to r (0) (0);

[0155] When i = 1 and a = 0, m = 2, then r (2) (1) = x (0) (2*1+0), that is, r (2) (1) = x (0) (2) represents x (0) (2) Mapping to r (2) (1);

[0156] When i = 1 and a = 1, m = 0, then r (0) (1) = x (0) (2*1+1), that is, r (0) (1) = x (0) (3) represents x (0) (3) Mapping to r (0) (1);

[0157] When i = 2 and a = 0, m = 2, then r (2) (2) = x (0) (2*2+0), that is, r (2) (2) = x (0) (4) represents x (0) (4) Mapping to r (2) (2);

[0158] When i = 2 and a = 1, m = 0, then r (0) (2) = x (0) (2*2+1), that is, r (0) (2) = x (0) (5) represents x (0) (5) Mapping to r (0) (2).

[0159] If spatial layer 0 includes more signals, then subsequent signals can be mapped to spatial frequency layer 0 and spatial frequency layer 2 according to the above rules.

[0160] For spatial layer 1, s = 1; if the transmitter determines to map spatial layer 1 to space frequency layer 1, space frequency layer 3, and space frequency layer 4, then j = 3, m = 1, 3, or 4; since the number of values ​​of a is equal to j, let a be equal to 0, 1, or 2; if spatial layer 1 starts mapping from space frequency layer 1, then the initial value of m is 1; since m changes with a, let m be equal to 1 when a = 0, m = 1 when a = 1, m = 3 when a = 2, and m = 4 when a = 2. Substituting these parameter values ​​into formula (2), we can obtain the following mapping process for spatial layer 1:

[0161] When i = 0 and a = 0, m = 1, then r (1) (0)=x (1) (3*0+0), that is, r (1) (0)=x (1) (0) represents x (1) (0) mapped to r (1) (0);

[0162] When i = 0 and a = 1, m = 3, then r (3) (0)=x (1) (3*0+1), that is, r (3) (0)=x (1) (1) represents x (1) (1) Mapping to r (3) (0);

[0163] When i = 0 and a = 2, m = 4, then r (4) (1) = x (1) (3*0+2), that is, r (4) (1) = x (1) (2) represents x (1) (2) Mapping to r (4) (0);

[0164] When i = 1 and a = 0, m = 1, then r (1) (1) = x (1) (3*1+0), that is, r (1) (1) = x(1) (3) represents x (1) (3) Mapping to r (1) (1);

[0165] When i = 1 and a = 1, m = 3, then r (3) (2) = x (1) (3*1+1), that is, r (3) (2) = x (1) (4) represents x (1) (4) Mapping to r (3) (1);

[0166] When i = 1 and a = 2, m = 4, then r (4) (2) = x (1) (3*1+2), that is, r (4) (2) = x (1) (5) represents x (1) (5) Mapping to r (4) (1).

[0167] If spatial layer 1 includes more signals, then subsequent signals can be mapped to spatial frequency layer 1, spatial frequency layer 3 and spatial frequency layer 4 according to the above rules.

[0168] Compared to Example 2, in Example 3, spatial layer 0 is no longer mapped in ascending order of spatial frequency layer indices, but rather in descending order of spatial frequency layer indices.

[0169] The first mapping relationship can be stored in the form of a formula at the sending end and / or receiving end. For example, the sending end and / or receiving end can store formula (2) as the first mapping relationship locally. The first mapping relationship can also be stored in the form of a table at the sending end and / or receiving end. For example, the sending end and / or receiving end can store the mapping relationships in Example 1, Example 2 and Example 3 in different tables. The first mapping relationship can also be stored in the form of a "table containing formulas" at the sending end and / or receiving end.

[0170] Below are some examples of the first mapping relationship for "tables containing formulas".

[0171] Table 1

[0172]

[0173]

[0174] In Table 1, r represents the space-frequency layer signal, and x represents the space-domain layer signal. For example, x (0) (i) represents a signal with index i in spatial layer 0, r (0) (i) represents a signal with index i in space frequency layer 0, x(1) (2i) represents a signal with index 2i in spatial layer 1, r (1) (i) represents a signal with index i in space-frequency layer 0. At the beginning of the mapping, the value of i is 0. After all space-frequency layers have been mapped once, if there are still signals remaining in the spatial domain layer, the value of i is incremented by 1, and the mapping from the spatial domain layer to the space-frequency layer continues according to the formula in Table 1.

[0175] For example, if the transmitter has generated signals from two spatial layers and determines to map these signals to five space-frequency layers, the transmitter can look up the formulas corresponding to "5 space-frequency layers and 2 spatial layers" in Table 1 and perform the mapping accordingly. The transmitter can first set i equal to 0 to obtain r. (0) (0)=x (0) (0), r (1) (0)=x (0) (1), r (2) (0)=x (1) (0), r (3) (0)=x (1) (1), r (4) (0)=x (1) (2). If there are remaining signals from these two spatial layers that have not been mapped to the spatial frequency layer, the transmitter can set i equal to 1 to obtain r. (0) (1) = x (0) (2), r (1) (1) = x (0) (3), r (2) (1) = x (1) (3), r (3) (1) = x (1) (4), r (4) (1) = x (1) (5). By analogy, the transmitter can map all the signals from these two spatial layers to the spatial frequency layer.

[0176] It should be noted that Table 1 is an example, not a limitation. The table representing the first mapping relationship can include more or less content. For example, when the number of space-frequency layers and / or the number of spatial domain layers increases, more content can be added to the "Spatial Domain Layer to Space-Frequency Layer Mapping" column in Table 1; when the number of space-frequency layers and / or the number of spatial domain layers decreases, the corresponding content can be reduced in the "Spatial Domain Layer to Space-Frequency Layer Mapping" column in Table 1; explanatory descriptions, row indexes, and column indexes can also be added to Table 1.

[0177] Optionally, the first mapping relationship can also be stored in multiple tables at the sending end and / or receiving end. For example, the first mapping relationships corresponding to different numbers of spatial layers can be stored in different tables, as shown in Tables 2 and 3.

[0178] Table 2

[0179]

[0180]

[0181] Table 3

[0182]

[0183] Table 2 is an example of the first mapping relationship when the number of spatial layers is equal to 1, and Table 3 is an example of the first mapping relationship when the number of spatial layers is equal to 2. Since the mapping relationships in Tables 2 and 3 are all mapping relationships with the same number of spatial layers, the "Number of Spatial Layers" column in Tables 2 and 3 can be deleted, and explanatory descriptions should be added to Tables 2 and 3 to explain the number of spatial layers corresponding to each table.

[0184] Optionally, as the number of spatial layers increases, the first mapping relationship can be represented by more tables. As the number of space-frequency layers increases, the "Spatial layer to space-frequency layer mapping" column of each table (e.g., Table 2 and Table 3) can also have more corresponding content added.

[0185] Optionally, the sender can save the required tables to save storage resources.

[0186] For example, if the sending end is a device with weak spatial multiplexing capability (such as an IoT device) and can only use one spatial layer for communication, then the sending end can save only Table 2 and does not need to save Table 3; if the sending end is a device with strong spatial multiplexing capability (such as a base station) and can use multiple spatial layers for communication, then the sending end can save both Table 2 and Table 3.

[0187] Optionally, if the first mapping relationship is stored in the form of multiple tables at the sending end and the receiving end, the sending end can indicate or configure the table used in the current communication.

[0188] For example, both the base station and the terminal store Table 2 and Table 3. If the base station determines to use Table 3 to send downlink data, the base station can indicate the index of Table 3 through downlink control information so that the terminal can perform space-frequency layer to spatial layer mapping based on Table 3 and recover the spatial layer signal.

[0189] For example, both the base station and the terminal store Table 2 and Table 3. The base station can configure the terminal to use Table 3 through RRC messages so that the terminal can perform space-frequency layer to spatial layer mapping based on Table 3 and recover the spatial layer signal.

[0190] When signals from multiple spatial layers need to be mapped, the transmitting end can perform space-frequency mapping on signals from multiple spatial layers simultaneously, or it can perform space-frequency mapping on signals from multiple spatial layers sequentially.

[0191] Returning to S420, after the transmitting end determines the j sets of second signals based on the first mapping relationship, it can perform the following steps.

[0192] S430, pre-encodes j sets of second signals to generate j sets of third signals.

[0193] For example, a third set of signals can be generated by multiplying each second set of signals by a precoded vector, where each signal in the third set of signals is a vector.

[0194] Optionally, the process of precoding the j sets of second signals can be represented by formula (3).

[0195]

[0196] in, Indicates index p m A signal with index i in the third set of signals, r (m) (i) represents a signal with index i in the second signal set with index m, W m represents the precoding vector, × represents matrix multiplication, and i and m are both positive integers greater than or equal to 0.

[0197] Optionally, W m The number of rows is equal to A*B, and the number of columns is equal to 1; or, W m The number of rows is equal to 1, and the number of columns is equal to A*B; where * represents multiplication; A represents the spatial degrees of freedom of the transmitter, and B represents the frequency degrees of freedom of the transmitter; or, A represents the number of antenna ports of the transmitter, and B represents the number of subcarriers corresponding to the bandwidth used by the transmitter.

[0198] For example, if the value set of m is from 0 to f-1, indicating that there are f spatial frequency layers of signals that need to be precoded, then:

[0199]

[0200] Where, r (0) (i) Multiplying by W0 yields r (1) (i) Multiplying by W1 yields And so on, r (f-1) (i) and W f-1 Multiply to get

[0201] Optionally, signals in the third signal set (e.g., and This can be referred to as the space-frequency joint port signal, r (m) (i) to The processing procedure can be referred to as space-frequency joint port mapping.

[0202] After generating j sets of third signals, the transmitting end can perform the following steps.

[0203] S440 performs resource mapping on j sets of third signals.

[0204] The transmitting end can map each signal in the j third signal sets to the first transmission resource, which includes L time domain units, K frequency domain units and P antenna ports, where L and P are both positive integers and K is a positive integer greater than 1.

[0205] Optionally, the index of any time-domain unit in the L time-domain units is l, the index of any frequency-domain unit in the K frequency-domain units is k, and the index of any antenna port in the P antenna ports is p; the signals in the j third signal sets mapped to time-domain unit l are mapped according to the following rules: they are mapped to the K frequency-domain units in ascending order of the value of k, and to the P antenna ports in ascending order of the value of p, wherein the values ​​of k and p can be selected from the following two options:

[0206] Method 1: The value of k changes first, and p changes only when the value of k has traversed the set of possible values ​​for k.

[0207] Method 2: The value of p changes first, and k changes only when the value of p has traversed the set of possible values ​​for p.

[0208] For example, if each signal in the third signal set has 100 values, the number of antenna ports at the transmitting end is 20, and the value set of the antenna port index p is 0 to 19; the number of subcarriers used by the transmitting end is 5, and the value set of the subcarrier index k is 0 to 4; and the time domain unit is an orthogonal frequency division multiplexing (OFDM) symbol, then there are the following two optional resource mapping methods.

[0209] Resource mapping method 1:

[0210] for The 100 values ​​can be mapped in the following ways:

[0211] The first five values ​​are mapped to the five subcarriers in ascending order of the value of k. At the same time, the first five values ​​are mapped to antenna port 0 and OFDM symbol 0.

[0212] The 6th to 10th values ​​are mapped to the above 5 subcarriers in ascending order of the value of k. At the same time, the 6th to 10th values ​​are mapped to antenna port 1 and OFDM symbol 0.

[0213] And so on;

[0214] The last five values ​​are mapped to the five subcarriers in ascending order of the value of k. At the same time, the last five values ​​are mapped to antenna port 19 and OFDM symbol 0.

[0215] for The 100 values ​​can be mapped in the following ways:

[0216] The first five values ​​are mapped to the five subcarriers in ascending order of the value of k. At the same time, the first five values ​​are mapped to antenna port 0 and OFDM symbol 1.

[0217] The 6th to 10th values ​​are mapped to the above 5 subcarriers in ascending order of the value of k. At the same time, the 6th to 10th values ​​are mapped to antenna port 1 and OFDM symbol 1.

[0218] And so on;

[0219] The last five values ​​are mapped to the five subcarriers in ascending order of the value of k. At the same time, the last five values ​​are mapped to antenna port 19 and OFDM symbol 1.

[0220] And so on, until... The 100 values ​​complete the resource mapping.

[0221] As can be seen from the above, resource mapping method one can be described as follows:

[0222] Each signal in the third signal set is mapped to multiple resource units (k, p, l), where the mapping order is as follows: the value of k increases first; as the value of k traverses the set of values ​​for k, the value of p increases; as the value of p traverses the set of values ​​for p, the value of l increases. Alternatively;

[0223] The value of each signal in the third signal set is divided into multiple sets, and the number of values ​​in each set is equal to the number of frequency domain units. These multiple sets are mapped to multiple resource units (p, l). The mapping order is as follows: the value of p increases first; when the value of p traverses the set of values ​​of p, the value of l increases.

[0224] Resource mapping method two:

[0225] for The 100 values ​​can be mapped in the following ways:

[0226] The first 20 values ​​are mapped to the above 20 antenna ports in ascending order of the value of p. At the same time, the first 20 values ​​are mapped to subcarrier 0 and OFDM symbol 0.

[0227] The 21st to 40th values ​​are mapped to the 20 antenna ports in ascending order of p value. At the same time, the 21st to 40th values ​​are mapped to subcarrier 1 and OFDM symbol 0.

[0228] And so on;

[0229] The last 20 values ​​are mapped to the aforementioned 20 antenna ports in ascending order of p value. At the same time, the last 20 values ​​are mapped to subcarrier 4 and OFDM symbol 0.

[0230] for The 100 values ​​can be mapped in the following ways:

[0231] The first 20 values ​​are mapped to the above 20 antenna ports in ascending order of the value of p. At the same time, the first 20 values ​​are mapped to subcarrier 0 and OFDM symbol 1.

[0232] The 21st to 40th values ​​are mapped to the 20 antenna ports in ascending order of the value of p. At the same time, the 21st to 40th values ​​are mapped to subcarrier 1 and OFDM symbol 1.

[0233] And so on;

[0234] The last 20 values ​​are mapped to the aforementioned 20 antenna ports in ascending order of p value. At the same time, the last 20 values ​​are mapped to subcarrier 4 and OFDM symbol 1.

[0235] And so on, until... The 100 values ​​complete the resource mapping.

[0236] As can be seen from the above, resource mapping method two can be described as follows:

[0237] Each signal in the third signal set is mapped to multiple resource units (k, p, l), where the mapping order is as follows: the value of p increases first; as the value of p traverses the set of values ​​for p, the value of k increases; as the value of k traverses the set of values ​​for k, the value of l increases. Alternatively;

[0238] The value of each signal in the third signal set is divided into multiple sets, and the number of values ​​in each set is equal to the number of antenna ports. These multiple sets are mapped to multiple resource units (k,l). The mapping order is as follows: the value of k increases first; when the value of k traverses the set of values ​​of k, the value of l increases.

[0239] As can be seen from resource mapping method one and resource mapping method two, each signal in the third signal set is mapped to multiple frequency domain units for transmission. If some of these frequency domain units belong to deep fading frequency bands, the signals mapped to the remaining frequency domain units still have a high probability of successful transmission, thereby improving the reliability of wireless transmission.

[0240] It should be noted that the above resource mapping method is an example and not a limitation. Other resource mapping methods may also be applicable to this application.

[0241] In addition, each signal in the third signal set can be mapped to resources simultaneously, or they can be mapped to resources sequentially according to their index values.

[0242] After the resource mapping is completed, the transmitting end can process j sets of third signals through the radio frequency circuit to generate a first radio frequency signal and perform the following steps.

[0243] S450, transmits the first radio frequency signal.

[0244] Accordingly, the receiving end receives the first radio frequency signal and performs the following steps.

[0245] S460, determine the target signal based on the first radio frequency signal.

[0246] For example, the receiver can convert the first radio frequency signal into a first baseband signal through the receiving circuit, and perform a baseband signal de-baseband operation on the first baseband signal, such as removing the cyclic prefix and performing a fast Fourier transform operation on the first baseband signal to obtain a frequency domain OFDM symbol, which is an example of the target signal.

[0247] S470, Decode the target signal by performing resource mapping to determine j sets of third signals, where j is a positive integer.

[0248] For example, when the receiving end is a terminal, the terminal can determine the resource mapping method used by the transmitting end based on the higher-layer parameters and downlink control information, and then extract j sets of third signals from the target signal according to the resource location indicated by the resource mapping method.

[0249] Optionally, the receiver may also perform signal estimation and channel equalization on the j sets of third signals, and then execute the following steps.

[0250] S480, de-pre-encode j sets of third signals to generate j sets of second signals, wherein the transmission resources corresponding to each signal in the j sets of second signals include multiple frequency domain units and one time domain unit.

[0251] For example, when the receiver is a terminal, the terminal can determine the precoding matrix used by the transmitter based on the downlink control information, and then multiply the deprecoding matrix corresponding to the precoding matrix by j sets of third signals to generate j sets of second signals.

[0252] The receiving end can then perform the following steps.

[0253] S490, determine a first signal set based on j second signal sets, the first signal set being the signal set of the first spatial layer, wherein there is a first mapping relationship between the first signal set and the j second signal sets.

[0254] For example, when the receiver is a terminal, the terminal can determine the first mapping relationship used by the transmitter based on the higher layer parameters and downlink control information, and then retrieve the first signal set from the j second signal sets according to the position indicated by the first mapping relationship.

[0255] Figure 8 This is a schematic diagram of a method for mapping from the spatial frequency layer to the spatial domain layer provided in an embodiment of this application.

[0256] After performing deprecoding, the receiver generates five second signal sets, representing signal sets from space frequency layer 0 to space frequency layer 4. The receiver then performs space frequency layer to spatial domain layer mapping according to the first mapping relationship, obtaining the following results:

[0257] r (0) (0)→x (0) (0) indicates that r (0) (0) mapped to x (0) (0);

[0258] r (1) (0)→x (0) (1) indicates that r (1) (0) mapped to x (0) (1);

[0259] r (2) (0)→x (1) (0) indicates that r (2) (0) mapped to x (1) (0);

[0260] r (3) (0)→x (1) (1) indicates that r (3) (0) mapped to x (1) (1);

[0261] r (4) (0)→x (1) (2) indicates that r (4) (0) mapped to x (1)(2);

[0262] r (0) (1)→x (0) (2) indicates that r (0) (1) Mapping to x (0) (2);

[0263] r (1) (1)→x (0) (3) indicates that r (1) (1) Mapping to x (0) (3);

[0264] r (2) (1)→x (1) (3) indicates that r (2) (1) Mapping to x (1) (3);

[0265] r (3) (1)→x (1) (4) indicates that r (3) (1) Mapping to x (1) (4);

[0266] r (4) (1)→x (1) (5) indicates that r (4) (1) Mapping to x (1) (5);

[0267] r (0) (2)→x (0) (4) indicates that r (0) (2) Mapping to x (0) (4);

[0268] r (1) (2)→x (0) (5) indicates that r (1) (2) Mapping to x (0) (5).

[0269] The receiver can also determine the signals of different spatial layers based on the set index of the x signal.

[0270] For example, the receiver can determine x (0) (0), x (0) (1) x (0) (2) x (0) (3) x (0) (4) and x (0) (5) is the signal of spatial layer 0, and x is determined. (1) (0), x (1) (1) x (1) (2) x (1)(3) x (1) (4) and x (1) (5) is the signal of spatial layer 1.

[0271] Optionally, the receiver can also demodulate the signals of each spatial layer to recover the bit sequence corresponding to the codeword.

[0272] In summary, in method 400, the modulated signal is mapped again after layer mapping to obtain j sets of second signals. Each signal in the j sets corresponds to transmission resources comprising multiple frequency domain units. Thus, each signal in the j sets of second signals, after precoding, is ultimately mapped onto multiple frequency domain units for transmission. If some of these frequency domain units belong to deep fading bands, the signal mapped onto the remaining frequency domain units still has a relatively high probability of successful transmission. The receiver recovers the first signal set based on the reverse process described above (e.g., de-mapping and de-precoding), thereby improving the reliability of wireless transmission. Furthermore, since the transmission resources corresponding to each signal in the j sets of second signals comprise multiple frequency domain units, the precoding freedom for each signal is greater. That is, the transmitter has more precoding matrices to choose from when precoding each signal. This gives the transmitter the opportunity to select a precoding matrix with better inter-stream interference suppression for precoding the j sets of second signals, thereby improving the inter-stream interference suppression effect.

[0273] The foregoing has detailed the method examples provided by the embodiments of this application. It is understood that the corresponding apparatus, in order to achieve the above functions, includes hardware structures and / or software modules corresponding to the execution of each function. Those skilled in the art should readily recognize that, based on the units and algorithm steps of the examples described in conjunction with the embodiments disclosed herein, this application can be implemented in hardware or a combination of hardware and computer software. Whether a function is executed in hardware or by computer software driving hardware depends on the specific application and design constraints of the technical solution. Those skilled in the art can use different methods to implement the described functions for each specific application, but such implementation should not be considered beyond the scope of this application.

[0274] Figure 9 and Figure 10 These are schematic diagrams illustrating the structures of two communication devices provided in embodiments of this application. These devices can be used to implement the functions of devices such as terminals or base stations in the above method embodiments, and therefore also possess the beneficial effects of the above method embodiments. In the embodiments of this application, these communication devices can be... Figure 1 The terminal shown can be Figure 1 The base station can also be a module (e.g., a chip) applied to a terminal or base station.

[0275] like Figure 9As shown, the device 900 includes a processing unit 910, and optionally, the device 900 further includes a transceiver unit 920. The transceiver unit 920 performs a receiving step and / or an output step under the control of the processing unit 910, wherein the transceiver unit 920 is a transmitting unit when performing the output step (or, sending step), and a receiving unit when performing the receiving step. The device 900 is used to implement... Figure 4 The functions of the sending end or receiving end in the method embodiment.

[0276] When the communication device 900 is used to achieve Figure 4 In the method embodiment, when the transmitting end functions, the processing unit 910 is used to: determine a first signal set, the first signal set being a signal set of a first spatial layer; determine j second signal sets based on the first signal set, wherein the transmission resources corresponding to each signal in the j second signal sets include multiple frequency domain units, a first mapping relationship exists between the first signal set and the j second signal sets, and j is a positive integer; precode the j second signal sets to generate j third signal sets; and perform resource mapping on the j third signal sets.

[0277] Optionally, the first mapping relationship includes: r (m) (n)=x (s) (t); where r (m) (n) represents a signal with index n in the second signal set with index m, r (m) (n) belongs to j sets of second signals; x (s) (t) represents a signal with index t in the first signal set, and s represents the index of the first signal set.

[0278] Optionally, 0 ≤ s ≤ v-1, v represents the number of spatial layers, n equals i, t equals j*i + a, i is an integer greater than or equal to 0, a is an integer greater than or equal to 0, * represents multiplication, and the first mapping relationship includes: r (m) (i)=x (s) (j*i+a); where the signals in the first signal set begin to be mapped when i and a take their minimum values, and the signals in the first signal set are first mapped to j second signal sets in ascending order of a, and then mapped to j second signal sets in ascending order of i; and the number of values ​​of a is equal to j; and m changes with the change of a.

[0279] Optionally, m changes with a, including: m increases as a increases, or m decreases as a increases.

[0280] Optionally, m changes as a changes, including: the absolute value of the change in m is the same as the absolute value of the change in a.

[0281] Optionally, when s equals 0, m equals 0.

[0282] Optionally, the processing unit 910 is specifically used to: map each signal in the j third signal sets to a first transmission resource, the first transmission resource including L time domain units, K frequency domain units and P antenna ports, where L and P are both positive integers and K is a positive integer greater than 1.

[0283] Optionally, the index of any one of the L time-domain units is l, the index of any one of the K frequency-domain units is k, and the index of any one of the P antenna ports is p; the signals mapped to time-domain unit l from the j third signal sets are mapped according to the following rules: they are mapped to the K frequency-domain units in ascending order of the value of k, and to the P antenna ports in ascending order of the value of p, wherein the value of k changes first, and p changes when the value of k traverses the set of values ​​of k; or, the value of p changes first, and k changes when the value of p traverses the set of values ​​of p.

[0284] When the communication device 900 is used to achieve Figure 4 In the embodiment of the method described, when the receiving end functions, the processing unit 910 is used to: determine a target signal; perform de-resource mapping on the target signal to determine j sets of third signals, where j is a positive integer; perform de-precoding on the j sets of third signals to generate j sets of second signals, wherein the transmission resources corresponding to each signal in the j sets of second signals include multiple frequency domain units; and determine a first signal set based on the j sets of second signals, wherein the first signal set is a signal set of a first spatial layer, and a first mapping relationship exists between the first signal set and the j sets of second signals.

[0285] Optionally, the first mapping relationship includes: r (m) (n)=x (s) (t); where r (m) (n) represents a signal with index n in the second signal set with index m, r (m) (n) belongs to j sets of second signals; x (s) (t) represents a signal with index t in the first signal set, and s represents the index of the first signal set.

[0286] Optionally, 0 ≤ s ≤ v-1, v represents the number of spatial layers, n equals i, t equals j*i + a, i is an integer greater than or equal to 0, a is an integer greater than or equal to 0, * represents multiplication, and the first mapping relationship includes: r (m) (i)=x (s)(j*i+a); where the signals in the first signal set begin to be mapped when i and a take their minimum values, and the signals in the first signal set are first mapped to j second signal sets in ascending order of a, and then mapped to j second signal sets in ascending order of i; and the number of values ​​of a is equal to j; and m changes with the change of a.

[0287] Optionally, m changes with a, including: m increases as a increases, or m decreases as a increases.

[0288] Optionally, m changes as a changes, including: the absolute value of the change in m is the same as the absolute value of the change in a.

[0289] Optionally, when s equals 0, m equals 0.

[0290] Optionally, the processing unit 910 is specifically used to: de-map the target signal according to the resource mapping method of the j third signal sets, wherein the resource mapping method of the j third signal sets includes: each signal in the j third signal sets is mapped to a first transmission resource, the first transmission resource includes L time domain units, K frequency domain units and P antenna ports, where L and P are both positive integers and K is a positive integer greater than 1.

[0291] Optionally, the index of any one of the L time-domain units is l, the index of any one of the K frequency-domain units is k, and the index of any one of the P antenna ports is p; the signals mapped to time-domain unit l from the j third signal sets are mapped according to the following rules: they are mapped to the K frequency-domain units in ascending order of the value of k, and to the P antenna ports in ascending order of the value of p, wherein the value of k changes first, and p changes when the value of k traverses the set of values ​​of k; or, the value of p changes first, and k changes when the value of p traverses the set of values ​​of p.

[0292] Those skilled in the art will clearly understand that when the communication device 900 is used to implement the functions of a transmitting end or a receiving end, the specific working process of the communication device 900 and the technical effects produced by the execution steps can be referred to the description in the corresponding method embodiments above. For the sake of brevity, they will not be repeated here.

[0293] The communication device 900 can be a terminal or a base station. The processing unit 910 can be implemented in hardware or software. When implemented in hardware, the processing unit 910 can be a logic circuit, integrated circuit, etc. When implemented in software, the processing unit 910 can be a general-purpose processor that reads software code stored in a storage unit. This storage unit can be integrated into the processing unit 910 or located outside the processing unit 910 and exist independently.

[0294] like Figure 10 As shown, device 1000 includes a processor 1010. Optionally, device 1000 may further include interface circuitry 1020, with the processor 1010 and interface circuitry 1020 coupled to each other. It is understood that interface circuitry 1020 may be a transceiver or an input / output interface. Optionally, device 1000 may further include a memory 1030 for storing instructions executed by the processor 1010, or storing input data required by the processor 1010 to execute instructions, or storing data generated after the processor 1010 executes instructions.

[0295] When device 1000 is used to achieve Figure 4 In the method shown, the processor 1010 is used to implement the functions of the processing unit 910, and the interface circuit 1020 is used to implement the functions of the transceiver unit 920.

[0296] When device 1000 is a terminal chip (i.e., a chip applied to a terminal), the terminal chip implements the functions of a transmitting end or a receiving end in the above method embodiments. The terminal chip receives information from the base station, which can be understood as the information being first received by other modules in the terminal (such as an RF module or antenna), and then sent to the terminal chip by these modules. The terminal chip sends information to the base station, which can be understood as the information being first sent to other modules in the terminal (such as an RF module or antenna), and then sent to the base station by these modules.

[0297] When device 1000 is a base station chip (i.e., a chip applied to a base station), the base station chip performs the functions of a transmitting end or a receiving end in the above method embodiments. The base station chip receives information from the terminal, which can be understood as the information being first received by other modules in the base station (such as an RF module or antenna), and then sent to the base station chip by these modules. The base station chip sends information to the terminal, which can be understood as the information being sent down to other modules in the base station (such as an RF module or antenna), and then sent to the terminal by these modules.

[0298] In this application, entity A sends information to entity B, either directly or indirectly through other entities. Similarly, entity B receives information from entity A, either directly or indirectly through other entities. Entities A and B can be RAN nodes, or modules within a RAN node or terminal. Information transmission and reception can be between a RAN node and a terminal, such as between a base station and a terminal; between two RAN nodes, such as between a CU and a DU; or between different modules within a single device, such as between a terminal chip and other modules of the terminal, or between a base station chip and other modules of the base station.

[0299] Embodiments of this application also provide a communication system, which may include: a device 900 for implementing the function of a transmitting end and a device 900 for implementing the function of a receiving end; or, a device 1000 for implementing the function of a transmitting end and a device 1000 for implementing the function of a receiving end.

[0300] The method steps in the embodiments of this application can be implemented in hardware or in software instructions executable by a processor. The software instructions can consist of corresponding software modules, which can be stored in random access memory, flash memory, read-only memory, programmable read-only memory, erasable programmable read-only memory, electrically erasable programmable read-only memory, registers, hard disks, portable hard disks, optical disc drives, or any other form of storage medium known in the art. An exemplary storage medium is coupled to a processor, enabling the processor to read information from and write information to the storage medium. The storage medium can also be a component of the processor. The processor and the storage medium can reside in an application-specific integrated circuit (ASIC). Alternatively, the ASIC can reside in a base station or terminal. The processor and the storage medium can also exist as discrete components in the base station or terminal.

[0301] In the above embodiments, implementation can be achieved entirely or partially through software, hardware, firmware, or any combination thereof. When implemented using software, it can be implemented entirely or partially in the form of a computer program product. The computer program product includes one or more computer programs or instructions. When the computer program or instructions are loaded and executed on a computer, the processes or functions described in the embodiments of this application are performed entirely or partially. The computer can be a general-purpose computer, a special-purpose computer, a computer network, a network device, a user equipment, or other programmable device. The computer program or instructions can be stored in a computer-readable storage medium or transferred from one computer-readable storage medium to another. For example, the computer program or instructions can be transferred from one website, computer, server, or data center to another website, computer, server, or data center via wired or wireless means. The computer-readable storage medium can be any available medium accessible to a computer or a data storage device such as a server or data center integrating one or more available media. The available medium can be a magnetic medium, such as a floppy disk, hard disk, or magnetic tape; it can also be an optical medium, such as a digital video optical disc; or it can be a semiconductor medium, such as a solid-state drive. The computer-readable storage medium may be a volatile or non-volatile storage medium, or may include both types of storage media.

[0302] Finally, the following points should be noted regarding the embodiments of this application:

[0303] First, in the embodiments of this application, the terms "first," "second," and various numerical designations are used for ease of description and are not intended to limit the scope of the embodiments of this application. The order of the process numbers does not imply the order of execution; the execution order of each process should be determined by its function and internal logic.

[0304] Second, in the embodiments of this application, "instruction" can include direct and indirect instructions, as well as explicit and implicit instructions. The information indicated by a certain piece of information is called the information to be instructed. In specific implementations, there are many ways to instruct the information to be instructed. For example, the information to be instructed can be directly instructed, such as the information to be instructed itself or its index. The information to be instructed can also be indirectly indicated by instructing other information, where there is a correlation between the other information and the information to be instructed. Furthermore, a part of the information to be instructed can be indicated, while the other parts are known or pre-agreed upon. For example, the indication of the information to be instructed can be achieved by pre-agreed upon (e.g., by a protocol specifying the existence of a certain information element), thereby reducing the instruction overhead to some extent.

[0305] Third, the “protocol” involved in the embodiments of this application may refer to standard protocols in the field of communication, such as the Long Term Evolution (LTE) protocol, the NR protocol, and related protocols in future communication systems. This application does not limit this.

[0306] Fourth, "predefined" or "preconfigured" can be achieved by pre-storing corresponding codes, tables, or other information-indicating mechanisms in the device (e.g., a terminal or base station). This application does not limit the specific implementation method. "Storing" can refer to storing in one or more memories, which can be separate installations or integrated into the processor or communication device; alternatively, some memories can be separate installations, while others are integrated into the processor or communication device. The type of memory can be any form of storage medium, and this application does not limit this.

[0307] Fifth, "at least one" means one or more, while "more than one" means two or more. "And / or" describes the relationship between related objects, indicating that three relationships can exist. For example, A and / or B can mean: A exists alone, B exists alone, or A and B exist simultaneously. Here, A and B can be a single object or multiple objects. The character " / " generally indicates that the preceding and following related objects have an "or" relationship. "At least one of the following" or similar expressions refer to any combination of these items, including any combination of single or multiple items. For example, at least one of a, b, and c can mean: a, or, b, or, c, or, a and b, or, a and c, or, b and c, or, a, b, and c. Here, a, b, and c can each be a single object or multiple objects.

[0308] Sixth, in the embodiments of this application, descriptions such as "when," "in the case of," "if," and "if" all refer to the fact that the device (e.g., a terminal or a base station) will make corresponding processing under certain objective circumstances. They are not time limits, nor do they require the device to make a judgment action when implementing it, nor do they imply any other limitations.

[0309] Seventh, in the various embodiments of this application, unless otherwise specified or logically conflicting, the terms and / or descriptions between different embodiments are consistent and can be referenced by each other, and the technical features in different embodiments can be combined to form new embodiments according to their inherent logical relationships.

Claims

1. A communication method characterized by comprising: include: Determine the first set of signals; Based on the first signal set, j second signal sets are determined, wherein the transmission resources corresponding to each signal in the j second signal sets include multiple frequency domain units, and there is a first mapping relationship between the first signal set and the j second signal sets, where j is a positive integer; The j sets of second signals are pre-encoded to generate j sets of third signals; Perform resource mapping on the j sets of third signals.

2. The method of claim 1, wherein, The first mapping relationship includes: r (m) (n) = x (s) (t); where r (m) (n) denotes one signal of the second signal set with index n, r (m) (n) belongs to the j second signal sets; x (s) (t) denotes one signal of the first signal set with index t, s denotes the index of the first signal set.

3. The method of claim 2, wherein, 0 ≤ s ≤ v - 1, v represents the number of spatial layers, n equals i, t equals j*i + a, i is an integer greater than or equal to 0, a is an integer greater than or equal to 0, * represents multiplication, and the first mapping relationship includes: r (m) (i) = x (s) (j*i+a); In this process, the signals in the first signal set are mapped starting when i and a take their minimum values. The signals in the first signal set are first mapped to the j second signal sets in ascending order of a, and then mapped to the j second signal sets in ascending order of i. The number of values ​​for a is equal to j. Furthermore, m changes as a changes.

4. The method of claim 3, wherein, The variation of m with a includes: m increases as a increases, or m decreases as a increases.

5. The method according to claim 3 or 4, characterized in that, The variation of m with a includes: The absolute value of the change in m is the same as the absolute value of the change in a.

6. The method according to any one of claims 2 to 5, characterized in that, When s equals 0, m equals 0.

7. The method according to any one of claims 1 to 6, characterized in that, The resource mapping of the j sets of third signals includes: Each signal in the j sets of third signals is mapped to a first transmission resource, which includes L time-domain units, K frequency-domain units, and P antenna ports, where L and P are both positive integers and K is a positive integer greater than 1.

8. The method of claim 7, wherein, The index of any one of the L time-domain units is l, the index of any one of the K frequency-domain units is k, and the index of any one of the P antenna ports is p; the signals in the j third signal sets mapped to time-domain unit l are mapped according to the following rules: The values ​​of k are mapped to the K frequency domain elements in ascending order, and the values ​​of p are mapped to the P antenna ports in ascending order. The value of k changes first, and then p changes as the set of possible values ​​for k is traversed; or, The value of p changes first, and k changes again as the value of p traverses the set of possible values ​​for p.

9. A communication method characterized by comprising: include: Determine the target signal; The target signal is de-resource mapped to determine j sets of third signals, where j is a positive integer; The j sets of third signals are de-precoded to generate j sets of second signals, wherein the transmission resources corresponding to each signal in the j sets of second signals include multiple frequency domain units; A first signal set is determined based on the j sets of second signals, wherein a first mapping relationship exists between the first signal set and the j sets of second signals.

10. The method of claim 9, wherein, The first mapping relationship includes: r (m) (n) = x (s) (t); where r (m) (n) denotes one signal of the second signal set with index n and index m, r (m) (n) belongs to the j second signal sets; x (s) (t) denotes one signal of the first signal set with index t and s denotes the index of the first signal set.

11. The method of claim 10, wherein, 0 ≤ s ≤ v - 1, v represents the number of spatial layers, n equals i, t equals j*i + a, i is an integer greater than or equal to 0, a is an integer greater than or equal to 0, * represents multiplication, and the first mapping relationship includes: r (m) (i) = x (s) (j*i+a); In this process, the signals in the first signal set are mapped starting when i and a take their minimum values. The signals in the first signal set are first mapped to the j second signal sets in ascending order of a, and then mapped to the j second signal sets in ascending order of i. The number of values ​​for a is equal to j. Furthermore, m changes as a changes.

12. The method of claim 11, wherein, The variation of m with a includes: m increases as a increases, or m decreases as a increases.

13. The method according to claim 11 or 12, characterized in that, The variation of m with a includes: The absolute value of the change in m is the same as the absolute value of the change in a.

14. The method according to any one of claims 10 to 13, characterized in that, When s equals 0, m equals 0.

15. The method according to any one of claims 9 to 14, characterized in that, The process of de-resource mapping the target signal includes: The target signal is de-mapped according to the resource mapping method of the j third signal sets, wherein the resource mapping method of the j third signal sets includes: each signal in the j third signal sets is mapped to a first transmission resource, the first transmission resource includes L time domain units, K frequency domain units and P antenna ports, where L and P are both positive integers and K is a positive integer greater than 1.

16. The method of claim 15, wherein, The index of any one of the L time-domain units is l, the index of any one of the K frequency-domain units is k, and the index of any one of the P antenna ports is p; the signals in the j third signal sets mapped to time-domain unit l are mapped according to the following rules: The values ​​of k are mapped to the K frequency domain elements in ascending order, and the values ​​of p are mapped to the P antenna ports in ascending order. The value of k changes first, and then p changes as the set of possible values ​​for k is traversed; or, The value of p changes first, and k changes again as the value of p traverses the set of possible values ​​for p.

17. A communications device, characterized by include: A module for performing the method of any one of claims 1 to 8, or a module for performing the method of any one of claims 9 to 16.

18. A communications device, characterized by include: A processor for implementing, via logic circuitry or by executing a computer program or instructions, the method as described in any one of claims 1 to 8, or the method as described in any one of claims 9 to 16.

19. A computer-readable storage medium, characterized in that, The computer-readable storage medium stores a computer program or instructions that, when executed by a communication device, implement the method as described in any one of claims 1 to 8, or implement the method as described in any one of claims 9 to 16.

20. A computer program product, characterised in that, The computer program product includes a computer program or instructions that, when executed by a communication device, implement the method as described in any one of claims 1 to 8, or implement the method as described in any one of claims 9 to 16.

Images