CN111194086B

CN111194086B - Method and communication device for transmitting and receiving data

Info

Publication number: CN111194086B
Application number: CN201811354053.8A
Authority: CN
Inventors: 楼群芳; 石娴文
Original assignee: Huawei Technologies Co Ltd
Current assignee: Huawei Technologies Co Ltd
Priority date: 2018-11-14
Filing date: 2018-11-14
Publication date: 2023-03-28
Anticipated expiration: 2038-11-14
Also published as: CN111194086A; WO2020098661A1

Abstract

The application provides a method and a communication device for sending and receiving data. The method is applied to a plurality of network devices, such as a first network device and a second network device, and is used for cooperatively sending data to a terminal device, and the method comprises the following steps: in the pre-allocation stage, the network devices pre-allocate beams or beam sets for the terminal devices, namely pre-allocate airspace resources; in the real scheduling phase, the multiple network devices cooperate to transmit data to the terminal device through the pre-allocated beam or beam set. According to the method and the device, the airspace resources are pre-allocated in the pre-allocation stage, the scheduling complexity can be simplified, and the two modules of the pre-allocation of the network equipment and the independent scheduling of the network equipment are relatively independent by utilizing the characteristic that the airspace of the terminal equipment is slowly changed, so that the transmission delay and the processing delay are reduced, and the transmission performance is improved.

Description

Method and communication device for transmitting and receiving data

Technical Field

The present application relates to the field of wireless communications, and more particularly, to a method and a communication apparatus for transmitting and receiving data.

Background

Coordinated multiple point (CoMP) transmission is a method for solving the inter-cell interference problem and improving the throughput of cell-edge users. In downlink coordinated multipoint transmission, a plurality of network devices, such as a plurality of cells, jointly send data to a terminal device, convert inter-cell interference into useful signals, and improve the performance of edge users.

Currently, in downlink coordinated multi-point transmission, a scheduling mode of downlink coordinated joint transmission is generally centralized scheduling, that is, a centralized node is provided to collect and manage information of multiple cells and perform joint resource allocation. In some scenarios, for example, in a Massive multiple-input multiple-output (Massive MIMO) scenario, centralized scheduling is applied, and the computational complexity may be high.

Disclosure of Invention

The application provides a method and a communication device for sending and receiving data, which can simplify a scheduling structure and reduce the computational complexity of multi-user pairing.

In a first aspect, a method for transmitting data is provided, where the method may be performed by a network device or a chip configured in the network device.

Specifically, the method comprises the following steps: the method comprises the steps that a first network device pre-allocates a first beam for a terminal device; the first network equipment sends cooperation request information to second network equipment, and the cooperation request information is used for requesting the second network equipment to cooperate with the first network equipment to send second data to the terminal equipment; the first network equipment receives cooperation response information from the second network equipment, wherein the cooperation response information is feedback information aiming at the cooperation request information; and based on the cooperation response information, the first network equipment sends first data to the terminal equipment through the first beam.

Based on the above technical solution, in cooperative joint transmission, for example, when a plurality of network devices (for example, referred to as a first network device and a second network device) perform data transmission with one terminal device, the network device (the first network device or the second network device) may adopt a beam concept during scheduling, and pre-allocate a beam or a beam set to the terminal device at a pre-allocation stage, that is, pre-allocate spatial resources, which not only can simplify scheduling complexity, but also utilize the characteristic that the spatial domain of the terminal device is slowly changed, so that two modules of pre-allocation of the network device and independent scheduling of the network device are relatively independent from each other, thereby avoiding a situation that transmission delay and processing delay of the plurality of network devices are consumed due to determination of a cooperative relationship among the plurality of network devices, and further causing scheduling errors. In addition, the scheduling architecture of the embodiment of the present application can reuse the current single cell scheduling procedure and single cell scheduling module. In some scenarios, for example, in a large-scale mimo scenario, the number of antennas is greater, the beam formed by multiple antennas is narrower, and the scheduling complexity can be greatly simplified by using the beam concept during scheduling.

In this embodiment, the first network device and the second network device may be any two or more network devices, for example, any two or more cells. Alternatively, the first network device may be a serving cell, the second network device may be a cooperative cell, the cooperative cell cooperates with the serving cell to send data to the terminal device, and the cooperative cell may be any one or more cells. Whether serving or cooperating cells, beams may be pre-allocated to the terminal device in a pre-allocation phase. The serving cell and the cooperating cell may correspond to different network devices, or may also correspond to the same network device, which is not limited in this embodiment of the present application.

In addition, the data sent by the first network device and the second network device may be the same or different, and specific data is described in the following embodiments.

With reference to the first aspect, in certain implementations of the first aspect, the method further includes: the first network equipment pre-allocates N groups of beam sets for N terminal equipments, the N terminal equipments correspond to the N groups of beam sets one by one, the N terminal equipments comprise the terminal equipment, wherein N is an integer greater than 1 or equal to 1; the first network device pre-allocates a first beam for the terminal device, including: the first network device pre-allocates a first group of beam sets for the terminal device, wherein the first beam set comprises the first beam, and the N groups of beam sets comprise the first group of beam sets.

Based on the above technical solution, when the network device pre-allocates the beam for the terminal device, a beam domain grouping (also referred to as space domain grouping or beam grouping) manner may be adopted, that is, a beam or a beam set is allocated for the terminal device, and the allocated beam or beam set is a space domain resource carried when data is transmitted to the terminal device. For example, in a large-scale mimo scenario, spatial resources may be reserved for users in a beam domain grouping manner. The N terminal devices may include a terminal device for cooperative transmission (that is, a plurality of network devices jointly transmit data to the terminal device), a terminal device for non-cooperative transmission (that is, a first network device transmits data to the terminal device), a terminal device for retransmission (that is, a network device retransmits data to the terminal device), a terminal device for new transmission (that is, a network device transmits data to the terminal device), and the like, which is not limited in this embodiment.

With reference to the first aspect, in some implementations of the first aspect, the pre-allocating, by the first network device, a first beam for the terminal device includes: and the first network equipment pre-allocates a first beam for the terminal equipment according to the channel correlation.

Based on the technical scheme, when the network equipment pre-allocates the beam for the terminal equipment, the beam can be allocated for the terminal equipment according to the channel correlation.

With reference to the first aspect, in certain implementations of the first aspect, the method further includes: the first network device sends first downlink control information and second downlink control information to the terminal device, the first downlink control information schedules the first data, the second control information schedules the second data, the first data corresponds to a first hybrid automatic repeat request process number, and the second data corresponds to a second hybrid automatic repeat request process number.

Based on the above technical solution, in cooperative joint transmission, a serving cell (for example, referred to as a first network device) may send a plurality of Downlink Control Information (DCI) through a plurality of Physical Downlink Control Channels (PDCCHs), where the plurality of DCIs respectively indicate transmission information on a plurality of network devices by using different harq process numbers. Therefore, the resources of the hybrid automatic repeat request process can be shared when being transmitted on a plurality of network devices (such as a serving cell and a cooperative cell), and the hybrid automatic repeat request process resources are saved while the hybrid automatic repeat request combining gain of the terminal device is ensured. In addition, different hybrid automatic repeat request process numbers are used by the plurality of DCIs, and the plurality of DCIs schedule the transport block buffers (TB buffers) under the plurality of different hybrid automatic repeat request process numbers at one time, so that frequency domain resources of the terminal equipment on the plurality of network equipment can be misaligned, and independent scheduling of data of the terminal equipment on the plurality of network equipment is facilitated.

With reference to the first aspect, in certain implementations of the first aspect, the method further includes: the first network device receiving information for the second data from the second network device; and the second network equipment updates the scheduling information corresponding to the second hybrid automatic repeat request process number according to the information aiming at the second data.

Based on the technical scheme, in cooperative joint transmission, after the service cell and the cooperative cell are independently scheduled respectively, the cooperative cell returns the transmission information on the branch to the service cell, and the service cell receives the transmission information and supplements the scheduling information under the hybrid automatic repeat request process number on the cooperative branch in time.

With reference to the first aspect, in certain implementations of the first aspect, the method further includes: and the first network equipment receives feedback information which is sent by the terminal equipment and aims at the first data and the second data.

Based on the above technical solution, the terminal device may feed back positive Acknowledgement (ACK) information or Negative Acknowledgement (NACK) information for the first data and the second data through a Physical Uplink Control Channel (PUCCH) of the serving cell. Alternatively, the terminal device may feed back ACK or NACK information through the respective PUCCHs on the serving cell and the cooperating cell.

With reference to the first aspect, in certain implementations of the first aspect, the method further includes: when the feedback information for the first data is negative NACK information, the first network equipment retransmits the first data to the terminal equipment; and/or, when the feedback information for the second data is NACK information, the first network device resends the second data to the terminal device.

Based on the technical scheme, the data which is transmitted by the serving cell or the cooperative cell in error is retransmitted on the serving cell.

In a second aspect, a method for transmitting data is provided, where the method may be performed by a network device or a chip configured in the network device.

Specifically, the method comprises the following steps: the method comprises the steps that a second network device receives cooperation request information from a first network device, wherein the cooperation request information is used for requesting the second network device to cooperate with the first network device to send second data to a terminal device; the second network equipment pre-allocates a second beam to the terminal equipment according to the cooperation request information; the second network device sends cooperation response information to the first network device, wherein the cooperation response information is feedback information aiming at the cooperation request information; and based on the cooperation response information, the second network equipment sends the second data to the terminal equipment through the second beam.

In the embodiment of the present application, the first network device and the second network device may be any two or more network devices, for example, any two or more cells. Alternatively, the first network device may be a serving cell, and the second network device may be a cooperating cell, where the cooperating cell is a cooperating serving cell that transmits data to the terminal device, and the cooperating cell may be any 1 or more cells. Whether serving or cooperating cells, the terminal device may be pre-assigned beams in a pre-assignment phase. The serving cell and the cooperative cell may correspond to different network devices, or may also correspond to the same network device, which is not limited in this embodiment of the present disclosure.

With reference to the second aspect, in certain implementations of the second aspect, the method further includes: the second network device pre-allocates N groups of beam sets for N terminal devices, the N terminal devices correspond to the N groups of beam sets one by one, the N terminal devices comprise the terminal devices, and N is an integer greater than 1 or equal to 1; the second network device pre-allocates a second beam to the terminal device, including: the second network device pre-allocates a second set of beam sets to the terminal device, where the second set of beam sets includes the second beam, and the N sets of beam sets includes the second set of beam sets.

With reference to the second aspect, in some implementations of the second aspect, the pre-allocating, by the second network device, a second beam to the terminal device includes: and the second network equipment pre-allocates a second beam for the terminal equipment according to the channel correlation.

In a third aspect, a method for receiving data is provided, where the method may be performed by a terminal device, and may also be performed by a chip configured in the terminal device.

Specifically, the method comprises the following steps: the terminal device receives first data from a first network device and second data from a second network device, wherein the first data is carried in a first beam, the second data is carried in a second beam, the first beam is a beam pre-allocated to the terminal device by the first network device, and the second beam is a beam pre-allocated to the terminal device by the second network device; and the terminal equipment sends feedback information aiming at the first data and the second data to the first network equipment.

Based on the above technical solution, in cooperative joint transmission, for example, when a plurality of network devices perform data transmission with one terminal device, the network device may adopt a beam concept during scheduling, and pre-allocate a beam or a beam set to the terminal device at a pre-allocation stage, that is, pre-allocate spatial resources, which not only can simplify scheduling complexity, but also utilize the slow change characteristic of the spatial domain of the terminal device to relatively independently separate the two modules of pre-allocation of the network device and independent scheduling of the network device, thereby avoiding the situation of scheduling errors caused by the consumption of transmission delay and processing delay of the plurality of network devices for determining the cooperative relationship among the plurality of network devices. In addition, the scheduling architecture of the embodiment of the application can reuse the current single-cell scheduling process and the single-cell scheduling module. In some scenarios, for example, in a large-scale mimo scenario, the number of antennas is greater, the beam formed by multiple antennas is narrower, and the scheduling complexity can be greatly simplified by using the beam concept during scheduling.

In this embodiment, the first network device and the second network device may be any two or more network devices, for example, any two or more cells. Alternatively, the first network device may be a serving cell, and the second network device may be a cooperating cell, where the cooperating cell is a cooperating serving cell that transmits data to the terminal device, and the cooperating cell may be any 1 or more cells. Whether serving or cooperating cells, the terminal device may be pre-assigned beams in a pre-assignment phase. The serving cell and the cooperating cell may correspond to different network devices, or may also correspond to the same network device, which is not limited in this embodiment of the present application.

With reference to the third aspect, in certain implementations of the third aspect, the method further includes: the terminal device receives first downlink control information and second downlink control information from the first network device, the first downlink control information schedules the first data, the second control information schedules the second data, and,

the first data corresponds to a first hybrid automatic repeat request process number, and the second data corresponds to a second hybrid automatic repeat request process number.

In a fourth aspect, a communication device is provided that comprises means for performing the method of any one of the possible implementations of the first or second aspect.

In a fifth aspect, a communications apparatus is provided that includes a processor. The processor is coupled to the memory and is operable to execute instructions in the memory to implement the method of any one of the possible implementations of the first or second aspect. Optionally, the communication device further comprises a memory. Optionally, the communication device further comprises a communication interface, the processor being coupled to the communication interface.

In one implementation, the communication device is a network device. When the communication device is a network device, the communication interface may be a transceiver, or an input/output interface.

In another implementation, the communication device is a chip configured in the network device. When the communication device is a chip configured in a network device, the communication interface may be an input/output interface.

Alternatively, the transceiver may be a transmit-receive circuit. Alternatively, the input/output interface may be an input/output circuit.

In a sixth aspect, a communication device is provided, which comprises means or units for performing the method of any of the possible implementations of the third aspect.

In a seventh aspect, a communications apparatus is provided that includes a processor. The processor is coupled to the memory and is operable to execute the instructions in the memory to implement the method of any one of the possible implementations of the third aspect. Optionally, the communication device further comprises a memory. Optionally, the communication device further comprises a communication interface, the processor being coupled to the communication interface.

In one implementation, the communication device is a terminal device. When the communication device is a terminal device, the communication interface may be a transceiver, or an input/output interface.

In another implementation, the communication device is a chip configured in the terminal equipment. When the communication device is a chip configured in a terminal device, the communication interface may be an input/output interface.

Alternatively, the transceiver may be a transceiver circuit. Alternatively, the input/output interface may be an input/output circuit.

In an eighth aspect, a processor is provided, comprising: input circuit, output circuit and processing circuit. The processing circuit is configured to receive a signal through the input circuit and transmit a signal through the output circuit, so that the processor performs the method of the first, second, or third aspect and any one of the possible implementations of the first, second, or third aspect.

In a specific implementation process, the processor may be a chip, the input circuit may be an input pin, the output circuit may be an output pin, and the processing circuit may be a transistor, a gate circuit, a flip-flop, various logic circuits, and the like. The input signal received by the input circuit may be received and input by, for example and without limitation, a receiver, the signal output by the output circuit may be output to and transmitted by a transmitter, for example and without limitation, and the input circuit and the output circuit may be the same circuit that functions as the input circuit and the output circuit, respectively, at different times. The embodiment of the present application does not limit the specific implementation manner of the processor and various circuits.

In a ninth aspect, a processing apparatus is provided that includes a processor and a memory. The processor is configured to read instructions stored in the memory and to receive signals via the receiver and transmit signals via the transmitter to perform the method of the first, second or third aspect and any possible implementation of the first, second or third aspect.

Optionally, the number of the processors is one or more, and the number of the memories is one or more.

Alternatively, the memory may be integral to the processor or provided separately from the processor.

In a specific implementation process, the memory may be a non-transient memory, such as a Read Only Memory (ROM), which may be integrated on the same chip as the processor, or may be separately disposed on different chips.

It will be appreciated that the associated data interaction process, for example, sending the indication information, may be a process of outputting the indication information from the processor, and receiving the capability information may be a process of receiving the input capability information from the processor. In particular, the data output by the processor may be output to a transmitter and the input data received by the processor may be from a receiver. The transmitter and receiver may be collectively referred to as a transceiver, among others.

The processing means in the above ninth aspect may be a chip, the processor may be implemented by hardware or may be implemented by software, and when implemented by hardware, the processor may be a logic circuit, an integrated circuit, or the like; when implemented in software, the processor may be a general-purpose processor implemented by reading software code stored in a memory, which may be integrated with the processor, located external to the processor, or stand-alone.

In a tenth aspect, there is provided a computer program product comprising: a computer program (which may also be referred to as code, or instructions), which when executed, causes a computer to perform the method of any of the possible implementations of the first, second or third aspect described above.

In an eleventh aspect, a computer-readable medium is provided, which stores a computer program (which may also be referred to as code or instructions) that, when executed on a computer, causes the computer to perform the method of any of the above-described first, second or third aspects and possible implementations of the first, second or third aspects.

In a twelfth aspect, a communication system is provided, which includes the foregoing first network device, second network device and terminal device.

Drawings

Fig. 1 is a schematic diagram of a communication system suitable for use with the method provided by the embodiments of the present application;

fig. 2 is a further schematic diagram of a communication system suitable for use with the method provided by embodiments of the present application;

FIG. 3 shows a schematic diagram of centralized scheduling;

FIG. 4 shows a schematic flow diagram of centralized scheduling;

FIG. 5 is a schematic flow chart diagram of a method of transmitting and receiving data provided in accordance with an embodiment of the present application;

FIGS. 6 (1) and (2) are schematic diagrams illustrating DMP and SMP transmission modes suitable for use in embodiments of the present application;

fig. 7 shows a schematic flowchart when scheme 1 is adopted for JT user real scheduling applied to the embodiment of the present application;

fig. 8 shows an exemplary scheduling timing diagram when scheme 2 is adopted for JT user true scheduling applicable to the embodiment of the present application;

fig. 9 shows a schematic flow chart when scheme 2 is adopted for JT user true scheduling applicable to the embodiment of the present application;

FIG. 10 is a schematic flow chart diagram of a method of transmitting and receiving data provided in accordance with yet another embodiment of the present application;

fig. 11 is a schematic diagram illustrating a serving cell and a cooperative cell reserving spatial domain resources for a user, which are suitable for an embodiment of the present application;

fig. 12 is a schematic diagram illustrating a serving cell and a cooperating cell jointly transmitting data to JT users according to an embodiment of the present application;

FIG. 13 is a schematic diagram of a method of transmitting and receiving data provided in accordance with yet another embodiment of the present application;

fig. 14 shows a schematic diagram of a HARQ process scheduling scheme in an SMP transmission mode suitable for the embodiment of the present application;

fig. 15 is a schematic diagram illustrating RTT of codeword transmission on a serving cell and a coordinated cell in SMP transmission mode applicable in the embodiment of the present application;

fig. 16 is a schematic block diagram of a communication device provided in an embodiment of the present application;

fig. 17 is a schematic structural diagram of a terminal device provided in an embodiment of the present application;

fig. 18 is a schematic structural diagram of a network device according to an embodiment of the present application.

Detailed Description

The technical solution in the present application will be described below with reference to the accompanying drawings.

The technical scheme of the embodiment of the application can be applied to various communication systems, for example: future fifth generation (5 g) systems or new wireless (NR), global system for mobile communications (GSM) systems, code Division Multiple Access (CDMA) systems, wideband Code Division Multiple Access (WCDMA) systems, general Packet Radio Service (GPRS), long Term Evolution (LTE) systems, LTE Frequency Division Duplex (FDD) systems, LTE Time Division Duplex (TDD), universal mobile telecommunications system (universal mobile telecommunications system, UMTS), universal microwave access (worldwide interoperability for microwave access, wiMAX), etc.

For the understanding of the embodiments of the present application, a communication system applicable to the embodiments of the present application will be described in detail with reference to fig. 1 and 2.

Fig. 1 shows a schematic diagram of a communication system 100 suitable for use in the method of transmitting and receiving data of an embodiment of the present application. As shown, the communication system 100 may include at least one network device, such as the network device 110 shown in fig. 1; the communication system 100 may also include at least one terminal device, such as the terminal device 120 shown in fig. 1. Network device 110 and terminal device 120 may communicate via a wireless link.

Fig. 2 shows another schematic diagram of a communication system 200 suitable for use in the method of transmitting and receiving data of an embodiment of the present application. As shown, the communication system 200 may include at least two network devices, such as

network devices

210 and 220 shown in fig. 2; the communication system 200 may also include at least one terminal device, such as the terminal device 230 shown in fig. 2. The terminal device 230 may establish wireless links with the network device 110 and the network device 120 through a Dual Connectivity (DC) technology or a multi-connectivity technology. Network device 110 may be, for example, a primary base station, and network device 120 may be, for example, a secondary base station. In this case, the network device 210 is a network device at the initial access of the terminal device 230 and is responsible for Radio Resource Control (RRC) communication with the terminal device 230, and the network device 220 may be added at the RRC reconfiguration for providing additional radio resources.

Of course, network device 120 may also be a primary base station, and network device 110 may also be a secondary base station, which is not limited in this application. In addition, the figures show the wireless connection between two network devices and the terminal device for the sake of understanding only, but this should not be construed as limiting the applicable scenarios of the present application. The terminal device may also establish wireless links with more network devices.

Each communication device, such as network device 110 or terminal device 120 in fig. 1, or network device 210, network device 220, or terminal device 230 in fig. 2, may be configured with multiple antennas. The plurality of antennas may include at least one transmit antenna for transmitting signals and at least one receive antenna for receiving signals. Additionally, each communication device can additionally include a transmitter chain and a receiver chain, each of which can in turn comprise a plurality of components associated with signal transmission and reception (e.g., processors, modulators, multiplexers, demodulators, demultiplexers, antennas, etc.), as will be appreciated by one skilled in the art. Therefore, the network equipment and the terminal equipment can communicate through the multi-antenna technology.

It should be understood that the network device in the wireless communication system may be any device having a wireless transceiving function. The network devices include, but are not limited to: an evolved Node B (eNB), a Radio Network Controller (RNC), a Node B (NB), a Base Station Controller (BSC), a Base Transceiver Station (BTS), a home base station (e.g., home evolved Node B, or home Node B, HNB), a Base Band Unit (BBU), an Access Point (AP), a Wireless relay Node, a Wireless backhaul Node, a Transmission Point (TP), or a Transmission and Reception Point (TRP) in a Wireless Fidelity (WIFI) system, and the like, and may also be 5G, such as NR, a gbb in a system, or a transmission point (TRP or TP), and one or a group of base stations in a 5G system may include multiple antennas, or panels, such as a Radio Network Controller (RNC), a distributed Node B, or a Base Band Unit (BBU).

In some deployments, the gNB may include a Centralized Unit (CU) and a DU. The gNB may also include a Radio Unit (RU). The CU implements part of the function of the gNB, and the DU implements part of the function of the gNB, for example, the CU implements Radio Resource Control (RRC) and Packet Data Convergence Protocol (PDCP) layers, and the DU implements Radio Link Control (RLC), medium Access Control (MAC) and Physical (PHY) layers. Since the information of the RRC layer eventually becomes the information of the PHY layer or is converted from the information of the PHY layer, under this architecture, higher layer signaling, such as RRC layer signaling, can also be considered to be transmitted by the DU or by the DU + CU. It will be understood that the network device may be a CU node, or a DU node, or a device comprising a CU node and a DU node. In addition, the CU may be divided into network devices in a Radio Access Network (RAN), or may be divided into network devices in a Core Network (CN), which is not limited in this application.

It should also be understood that terminal equipment in the wireless communication system may also be referred to as User Equipment (UE) (or simply user), access terminal, subscriber unit, subscriber station, mobile station, remote terminal, mobile device, user terminal, wireless communication device, user agent, or user device. The terminal device in the embodiment of the present application may be a mobile phone (mobile phone), a tablet computer (Pad), a computer with a wireless transceiving function, a Virtual Reality (VR) terminal device, an Augmented Reality (AR) terminal device, a wireless terminal in industrial control (industrial control), a wireless terminal in self driving (self driving), a wireless terminal in remote medical (remote medical), a wireless terminal in smart grid (smart grid), a wireless terminal in transportation safety (transportation safety), a wireless terminal in smart city (smart city), a wireless terminal in smart home (smart home), and the like. The embodiments of the present application do not limit the application scenarios.

To facilitate understanding of the embodiments of the present application, a brief description of several terms referred to in the present application will be given below.

1. Wave beam

The beam may be embodied in the NR protocol as spatial filters, or so-called spatial filters, or spatial parameters. A beam used for transmitting a signal may be referred to as a transmission beam (Tx beam), may be referred to as a spatial domain transmit filter (spatial domain transmit filter), or a spatial transmit parameter (spatial domain transmit parameter). The transmission beam may refer to the distribution of signal strength formed in different directions in space after the signal is transmitted through the antenna.

It should be understood that the embodiment of the NR protocol listed above for the beams is only an example and should not constitute any limitation to the present application. This application does not exclude the possibility that other terms may be defined in future protocols to have the same or similar meaning.

Further, the beam may be a wide beam, or a narrow beam, or other type of beam. The technique of forming the beam may be a beamforming technique or other technique. The beamforming technology may specifically be a digital beamforming technology, an analog beamforming technology, or a hybrid digital/analog beamforming technology. Different beams may be considered different resources. The same information or different information may be transmitted through different beams.

Alternatively, a plurality of beams having the same or similar communication characteristics are regarded as one beam. One or more antenna ports may be included in a beam for transmitting data channels, control channels, sounding signals, and the like. The one or more antenna ports forming one beam may also be regarded as one set of antenna ports.

2. Reference signal and reference signal resource

The reference signal may be used for channel measurement or channel estimation, etc. The reference signal resource may be used to configure transmission attributes of the reference signal, such as a time-frequency resource location, a port mapping relationship, a power factor, and a scrambling code, and reference may be made to the prior art. The transmitting end device may transmit the reference signal based on the reference signal resource, and the receiving end device may receive the reference signal based on the reference signal resource.

The channel measurement referred to in this application also includes beam measurement, i.e. beam quality information is obtained by measuring a reference signal, and the parameter for measuring the beam quality includes RSRP, but is not limited thereto. For example, the beam quality can also be measured by parameters such as Reference Signal Reception Quality (RSRQ), signal-to-noise ratio (SNR), signal-to-interference plus noise ratio (SINR), and the like. In the embodiments of the present application, for convenience of description, the channel measurement involved may be regarded as beam measurement without specific description.

The reference signal may include, for example, a channel state information reference signal (CSI-RS), a Synchronization Signal Block (SSB), and a Sounding Reference Signal (SRS). Correspondingly, the reference signal resource may include a CSI-RS resource (CSI-RS resource), an SSB resource, and an SRS resource (SRS resource).

The SSB may also be referred to as a synchronization signal/physical broadcast channel block (SS/PBCH block), and the corresponding SSB resource may also be referred to as a synchronization signal/physical broadcast channel block resource (SS/PBCH block resource), which may be referred to as SSB resource for short.

In order to distinguish between different reference signal resources, each reference signal resource may correspond to an identification of one reference signal resource, for example, a CSI-RS resource identification (CRI), an SSB resource identification (SSBRI), an SRS Resource Index (SRI).

The SSB resource identifier may also be referred to as an SSB identifier (SSB index).

In the following embodiments, the reference signals listed above and the corresponding reference signal resources are exemplified as an example. It should be understood that the above listed reference signals and corresponding reference signal resources are only exemplary and should not constitute any limitation to the present application, which does not exclude the possibility of defining other reference signals in future protocols to achieve the same or similar functions.

3. HARQ process number

HARQ uses stop-and-wait protocol (stop-and-wait protocol) to transmit data. Taking uplink transmission as an example, after sending a Transport Block (TB), the terminal device stops to wait for the acknowledgement information. The network device may use 1 bit of information to Acknowledge (ACK) or Negative (NACK) the transport block. But the terminal device stops waiting for an acknowledgement after each transmission, resulting in a low throughput. The terminal device may use multiple parallel HARQ processes. While one HARQ process is waiting for acknowledgement information, the terminal device may continue to transmit data using another HARQ process.

The HARQ process number is also called HARQ process Identification (ID). One HARQ process number may be used to uniquely specify one HARQ process. After the terminal device performs channel coding on the transport block, the data obtained by the channel coding may be registered in a buffer (buffer) for transmission. The transport blocks in the buffer may have a one-to-one correspondence with HARQ processes, and each transport block may correspond to one HARQ process. The correspondence between the transport block and the HARQ process may be embodied by the correspondence between the transport block and the HARQ process number. Therefore, the terminal device can determine the correspondence between the transport block and the HARQ process number in advance.

Because the network device carries the HARQ process number in the DCI, the HARQ process number has a corresponding relationship with the time-frequency resource indicated in the DCI. That is to say, when a transport block is transmitted based on the time-frequency resource indicated in the DCI, the HARQ process number corresponding to the transport block is the HARQ process number carried in the DCI. Therefore, both the network device and the terminal device can determine the corresponding relationship between the time-frequency resource and the HARQ process number.

When the data received by the network device on a certain time-frequency resource is not successfully decoded or the data is not received on a certain time-frequency resource, the HARQ process number corresponding to the time-frequency resource can be notified to the terminal device through DCI. The terminal device may determine the transport block to be retransmitted according to the corresponding relationship between the HARQ process number and the transport block.

4. Transmission Block (TB)

The transport block may be a data block from a higher layer. A transport block may contain, for example, a data block of a Media Access Control (MAC) Protocol Data Unit (PDU), and the data block may be transmitted over a time unit or may be a unit of HARQ retransmission. In existing LTE and NR, a maximum of two transport blocks can be transmitted per time unit for each terminal device. By way of example and not limitation, the time unit is a Transmission Time Interval (TTI).

5. Cell (cell): the cells are described by the higher layers from the point of view of resource management or mobility management or serving elements. The coverage area of each network device may be divided into one or more serving cells, and the serving cells may be considered to be composed of certain frequency domain resources. In the embodiment of the present application, a cell may be replaced with a serving cell or a carrier component carrier (CC, or referred to as a component carrier, a carrier, or the like).

It should be noted that a cell may be an area within the coverage of the wireless network of the network device. In the embodiment of the present application, different cells may correspond to different network devices. For example, the network device in cell #1 and the network device in cell #2 may be different network devices, such as base stations. That is, cell #1 and cell #2 may be managed by different base stations, and in this case, it may be referred to that cell #1 and cell #2 are co-sited, or co-sited. The network device in the cell #1 and the network device in the cell #2 may also be different radio frequency processing units of the same base station, for example, radio Remote Units (RRUs), that is, the cell #1 and the cell #2 may be managed by the same base station, have the same baseband processing unit and intermediate frequency processing unit, but have different radio frequency processing units. This is not particularly limited in the present application.

In the embodiment of the present application, a serving cell and a cooperating cell are referred to, and the serving cell and the cooperating cell may correspond to different network devices or may also correspond to the same network device, which is not limited in the embodiment of the present application. The serving cell and the cooperating cell may be any two or more cells that can jointly transmit data to the terminal device.

6. Centralized scheduling and distributed scheduling

Centralized scheduling: the resources of the users are jointly scheduled among a plurality of cells. Fig. 3 shows a schematic diagram of centralized scheduling. For example, a cluster can be formed according to a preset rule, and centralized scheduling is performed in the cluster. As shown in fig. 3, physical Cell IDs (PCIs) 0, PCI3, PCI6, and PCI9 are located in the PCI mod 3 aligned partition 1, and PCI1, PCI4, PCI7, and PCI10 are located in the PCI mod 3 aligned partition 2. Under centralized scheduling, there is a centralized node to collect and manage information of multiple cells and make joint resource allocation. Therefore, if centralized scheduling is applied in a Massive multiple-input multiple-output (Massive MIMO) scenario, the computational complexity is high.

In addition, generally, a multi-cell multi-user multi-input multi-output (MIMO) centralized scheduling architecture and flow is similar to that of single-cell multi-user MIMO, as shown in fig. 4. The data traffic scheduling starts, first with retransmission scheduling and second with new transmission first layer scheduling. Retransmission users are scheduled preferentially, in other words, the retransmission users allocate Resource Block (RB) resources preferentially. The retransmission scheduling adopts non-adaptive retransmission, that is, a first-transmitted allocated frequency domain and RRU resources and a first-transmitted Modulation and Coding Scheme (MCS) are used. And secondly, newly-transmitted first-layer scheduling, wherein the newly-transmitted first-layer scheduling takes Resource Block Groups (RBGs) as granularity, and sequentially schedules users with the highest Proportional Fair (PF) priority on each RBG. And the multi-user pairing is also based on the RBG granularity, and the criterion is to circularly select the user pairing with the highest PF and priority gain after the user pairing is matched with the scheduled user on each RBG until the user meeting the condition cannot be found.

When the centralized scheduling is applied to a large-scale multi-input multi-output scene, the calculation of multi-user pairing gain and the calculation of weight value bring greater calculation complexity. Centralized scheduling also does not completely eliminate the interference between centralized scheduling units. In addition, centralized scheduling is scheduling combining a plurality of cells, and is an alternative relation with single-cell scheduling, and a single-cell scheduling module cannot be reused.

Distributed scheduling: firstly, scheduling information is interacted back and forth between a service cell and a cooperative cell to perform pre-scheduling for cooperative users in advance, and resources of the cooperative users at the real scheduling time are reserved; then the service cell and the cooperation cell do real scheduling for the cooperation users. Under distributed scheduling, information can only be exchanged between every two cells, and each cell independently performs resource allocation according to a single cell. In the existing distributed scheduling, generally, real scheduling of each Transmission Time Interval (TTI) needs pre-scheduling information advanced by a certain time length (e.g., X milliseconds (ms), where X > 0).

The above-mentioned distributed scheduling needs to exchange information between cells, and the determination of the cooperation relationship between the serving cell and the cooperating cell consumes the transmission delay and processing delay between cells, which may cause scheduling error and more HARQ process resources consumption.

In view of this, the present application provides a method, which can adopt a uniform distributed scheduling architecture and a corresponding scheduling scheme to improve the perception rate of an edge user in a Centralized Radio Access Network (CRAN), an internet protocol-based radio access network (IP RAN), and different collaborative transmission mode scenarios.

The embodiments of the present application will be described in detail below with reference to the accompanying drawings.

It should be understood that in the embodiments shown below, the first, second, third, fourth and various numerical numbers are only used for convenience of description and are not used to limit the scope of the embodiments of the present application. E.g. to distinguish between different transport blocks, etc.

It should also be understood that in the embodiments of the present application, "user newly-transmitted" and "newly-transmitted user" may be mixed at times, and it should be noted that, when the differences are not emphasized, the intended meanings are consistent, and they are all used to indicate that a plurality of network devices jointly transmit data to the user. Similarly, "user retransmission" and "retransmitted user" may sometimes be mixed, and it should be noted that, when the distinction is not emphasized, the intended meaning is consistent, which is used to indicate that a plurality of network devices jointly retransmit data to the user.

It should also be understood that, in the embodiment of the present application, a time slot (slot) is taken as an example of a time domain unit to describe the method provided in the embodiment of the present application in detail, but this should not constitute any limitation to the present application. It should be understood that a slot is only one possible form of a time domain unit, and the time domain unit (also referred to as a time unit) may also be one symbol, or one Mini-slot (Mini-slot), or one subframe (subframe), etc., which is not limited in this application.

It should also be understood that, in the embodiments of the present application, the method provided in the embodiments of the present application is described in detail by taking RB as an example of a frequency domain unit, but this should not limit the present application in any way. It should be understood that an RB is only one possible form of a frequency domain unit, and the frequency domain unit may also be a Physical Resource Block (PRB) or an RBG, or a predefined subband (subband), etc., which is not limited in this application.

It should also be understood that in the embodiments illustrated below, "pre-acquisition" may include signaling by the network device or pre-definition, e.g., protocol definition. The "predefined" may be implemented by pre-saving a corresponding code, table, or other means that can be used to indicate the relevant information in the device (for example, including the terminal device and the network device), and the specific implementation manner of the present application is not limited.

It should also be understood that in the embodiments illustrated below, "save," may refer to a save in one or more memories. The one or more memories may be provided separately or integrated in the encoder or decoder, the processor, or the communication device. The one or more memories may also be provided separately, with a portion of the one or more memories being integrated into the decoder, the processor, or the communication device. The type of memory may be any form of storage medium and is not intended to be limiting of the present application.

It should also be understood that in the embodiments shown below, the "protocol" may refer to a standard protocol in the communication field, and may include, for example, an LTE protocol, an NR protocol, and related protocols applied in future communication systems, which are not limited in this application.

It is also to be understood that in the embodiments shown below, "at least one" means one or more, "a plurality" means two or more. "and/or" describes the association relationship of the associated objects, meaning that there may be three relationships, e.g., a and/or B, which may mean: a alone, A and B together, and B alone, wherein A and B may be singular or plural. The character "/" generally indicates that the former and latter associated objects are in an "or" relationship. "at least one of the following" or similar expressions refer to any combination of these items, including any combination of the singular or plural items. For example, at least one (one) of a, b, and c, may represent: a, or b, or c, or a and b, or a and c, or b and c, or a, b and c, wherein a, b and c can be single or multiple.

The technical solution of the present application may be applied to a wireless communication system, for example, the communication system 100 shown in fig. 1 or the communication system 200 shown in fig. 2. Two communication devices in a wireless communication system may have a wireless communication connection relationship between them. One of the two communication apparatuses may correspond to, for example, network device 110 shown in fig. 1, such as network device 110 or a chip configured in network device 110, and the other of the two communication apparatuses may correspond to, for example, terminal device 120 in fig. 1, such as terminal device 120 or a chip configured in terminal device 120. One of the two communication means may again correspond, for example, to network device 210 shown in fig. 2, such as may be network device 210 or a chip configured in network device 210, and the other of the two communication means may again correspond, for example, to terminal device 230 shown in fig. 2, such as may be terminal device 230 or a chip configured in terminal device 230. One of the two communication means may again, for example, correspond to the network device 220 shown in fig. 2, such as may be the network device 220 or a chip configured in the network device 220, and the other of the two communication means may again, for example, correspond to the terminal device 230 shown in fig. 2, such as may be the terminal device 230 or a chip configured in the terminal device 230.

Hereinafter, without loss of generality, the embodiments of the present application will be described in detail by taking a transmission process between a terminal device (hereinafter, referred to as a user in the embodiments) and a network device as an example. It is understood that any terminal device or chip configured in the terminal device in the wireless communication system may receive data based on the same method, and any network device or chip configured in the network device in the wireless communication system may transmit data based on the same method. This is not limited in this application.

Fig. 5 is a schematic flow chart diagram of a method 300 of transmitting data, shown from a device interaction perspective. As shown in fig. 5, in the method 300 shown in fig. 5, from the beginning of the user pre-scheduling to the end of the user pre-scheduling, steps 310 to 340 may be included. The various steps in method 300 are described in detail below in conjunction with fig. 5.

For ease of understanding, the following is an exemplary illustration of pre-scheduling for Joint Transmission (JT) users. Assuming that a plurality of cells jointly transmit data to a terminal device or jointly schedule, the terminal device is called a JT user or JT terminal device for differentiation. It should be understood that the JT subscriber or JT terminal in the embodiments of the present application is merely a name, and does not limit the scope of the embodiments of the present application.

In step 320, the serving cell: JT users prescheduled, multi-user beam domain grouping.

The service cell executes JT user pre-scheduling, for example, the service cell arranges JT users and common users in the cell together according to the initial transmission scheduling priority to make multi-user beam domain grouping, and initiates a cooperation request to the cooperation cell for the JT users successfully grouped in the multi-user beam domain.

Wherein, the JT subscriber may be a JT subscriber that satisfies a pre-scheduling precondition. Optionally, prior to step 320, method 300 includes step 310. In step 310, the serving cell: and judging the pre-scheduling precondition of the JT user.

The service cell makes a pre-scheduling judgment for the JT users, and determines which JT users are connected to participate in the JT user pre-scheduling according to the load of the cell, the specification of the number of JT users supported by the cell, the type of data transmitted by the JT users, the size of the data quantity to be transmitted by the JT users and other conditions. In step 320, the pre-scheduled JT subscriber may be a JT subscriber that satisfies the pre-scheduling precondition after the determination in step 310.

In step 320, the process of grouping the multi-user beam domains may include the following four steps:

1. after the current time slot serving cell is actually scheduled, updating Radio Link Control (RLC) Buffer areas (buffers) and initial transmission scheduling priorities of all users.

2. And establishing a pre-scheduled user queue, and sequencing the user queue from large to small according to the initial transmission scheduling priority.

3. And sequentially grouping the users in the pre-scheduling user queue by the multi-user beam domain.

In the embodiment of the application, the concept of beams is adopted during the scheduling of the network equipment, the beams are pre-allocated to the users in the pre-allocation stage, namely, pre-allocation of airspace resources is performed, not only can the scheduling complexity be simplified, but also the characteristics of slow change of the airspace of the users, such as relative fixed positions of the users and the cells, are utilized, the two modules of cell pre-allocation and cell independent scheduling are relatively and independently separated, and the situation that the transmission delay and the processing delay between the cells are consumed due to the determination of the cooperation relationship between the service cells and the cooperation cells, and then the scheduling error is caused is avoided. In some scenarios, for example, in a large-scale mimo scenario, the number of antennas is greater, the beam formed by multiple antennas is narrower, and the scheduling complexity can be greatly simplified by using the beam concept during scheduling.

In the pre-allocation stage, the method of reserving spatial resources for users at least includes the following two methods.

Mode 1, beam domain grouping.

The beam domain group, which may also be referred to as a spatial group or a beam group, is used to indicate that a beam or a beam set is allocated to a user, that is, spatial resources are reserved, and the allocated beam or the beam set is spatial resources carried when data is transmitted to the user. For example, in a large-scale mimo scenario, spatial resources may be reserved for users in a beam domain grouping manner.

Specifically, the pre-scheduled user queues may be traversed according to the initial scheduling priority, and the users in the user queues may be sequentially grouped in the beam domain. And traversing the beam sets of the existing groups, and judging whether the beam sets are overlapped with the currently traversed multi-user optimal beam sets or not to obtain the number of overlapped groups. Overlapping groupings, i.e., representing the same set of beams assigned to multiple users. Assuming that the serving cell allocates a beam set a to the user a, the following two cases are included according to the number of overlapping packets.

Case 1: the number of overlapping packets is 0.

If the number of the overlapping groups is 0 and the total number of the beams of all the groups after the new grouping is assumed to be less than or equal to the maximum number of the pairing layers, a new grouping is established for the user A, namely, a beam set A is allocated to the user A, and the beam set A is the optimal beam set of the user A. Wherein the maximum number of pairing layers may be predefined, e.g. predefined by a protocol or preset by the network device.

Case 2: the number of overlapping packets is greater than 0.

If the number of the overlapped groups is more than 0, the user A is a conflict user, the grouping fails, and the next user is traversed.

In the process of sequentially grouping the beam domains for multiple users, JT users successfully grouped by the multiple users enter a selected JT user pre-scheduling application queue. If the number of users currently entering the selected JT user pre-scheduling application exceeds a preset threshold, for example, the preset threshold is recorded as JtUeRequest _ then, or the number of the applied cooperative cells exceeds the preset threshold, for example, the preset threshold is recorded as JtCorcellRequest _ then, the dynamic grouping of the JT users is ended, and the normal multi-user grouping is continued. Wherein, the JtUeRequest _ bed and JtCorcellRequest _ bed may be predefined, for example, predefined by a protocol or preset by a network device.

In the multi-user beam domain packet, for JT user, the reference beam set participating in the dynamic packet is a static beam with the strongest RSRP for the number (Rank) of data streams (SU Rank) transmitted by a Single User (SU) of the user. E.g. SU transmission, the RSRP strength per beam is measured and the first N beams are selected according to the measured RSRP size, where N = rank. For a common user, the reference beam set participating in dynamic grouping is a static beam with the strongest RSRP for the number of data streams (MU Rank) transmitted by multiple-user (MU) of the user. The MU Rank indicates that the SU participates in multi-user pairing, that is, multiple users transmit together on the same time-frequency resource, and generally, the Rank value of the MU Rank is smaller than that of the SU Rank.

Mode 2, according to the inter-user channel correlation.

For example, spatial resources may be reserved for users according to inter-user channel correlation in a non-massive mimo scenario. For example, when the channel is in an ideal state or the correlation between channels is small, the transmitting end adopts a spatial multiplexing transmission scheme, such as a dense urban area, indoor coverage and other scenes; when the correlation between channels is large, a space-time coding transmission scheme is adopted, for example, in suburbs, rural areas and other scenes.

The channel correlation herein may refer to inter-user spatial correlation, and may be understood as being based on inter-user spatial correlation. The variation over different transmit or receive antennas is referred to as spatial correlation. For example, for two users, denoted as user 1 and user 2, the channel from user 1 to the base station is H1, and the channel from user 2 to the base station is H2. The spatial correlation between H1 and H2 means that, depending on the spatial separation between user 1 and user 2, for example, user 1 and user 2 are close to each other, the spatial correlation is relatively high, for example, user 1 and user 2 can be grouped together; if user 1 and user 2 are far apart, the spatial correlation is low, for example, user 1 and user 2 may be grouped into different groups.

In the foregoing, by means 1 and means 2, the serving cell pre-allocates the airspace resources for the user, but the embodiment of the present application is not limited thereto, and any manner that can pre-allocate the airspace resources for the user falls within the protection scope of the present application.

4. And the service cell initiates a cooperation request to the cooperation cell.

In step 340, the cooperating cell: JT users prescheduled, multi-user beam-domain grouping.

The cooperative cell performs JT user pre-scheduling, for example, the cooperative cell arranges JT users requesting cooperation from other cells and ordinary users in the cell together according to an initial scheduling priority to make multi-user beam domain grouping, and feeds back a cooperative response to other serving cells for JT users successfully grouped in the multi-user beam domain.

Wherein, the JT subscriber may be a JT subscriber that satisfies a pre-scheduling precondition. Optionally, prior to step 340, method 300 includes step 330. In step 330, the cooperating cell: and judging the pre-scheduling precondition of the JT user.

And (3) the cooperative cell makes JT user pre-scheduling precondition judgment, and whether to start cooperative response and JT user pre-scheduling is judged according to conditions such as cell load, cooperative JT user number specification supported by the cell and the like. In step 340, the pre-scheduled JT subscriber may be a JT subscriber that satisfies the pre-scheduling precondition after the determination in step 330.

In step 340, the process of multi-user beam domain grouping may include the following four steps:

1. and after the real scheduling of the current time slot cooperation cell is finished, updating RlcBuffer and initial transmission scheduling priorities of all users.

2. And establishing a pre-scheduled user queue, and sequencing the user queues from large to small according to the initial transmission scheduling priority.

In the embodiment of the application, a beam concept is adopted during scheduling, and beams are pre-allocated to users in a pre-allocation stage, that is, pre-allocation of airspace resources is performed, so that not only can the scheduling complexity be simplified, but also the cell pre-allocation and cell independent scheduling modules are relatively independently separated by using the characteristic that the airspace of the users is slowly changed, for example, the positions of the users and the cells are relatively fixed, and the situation that the transmission delay and the processing delay between the cells are consumed due to the determination of the cooperation relationship between the cooperation cells and the cooperation cells, and further the scheduling error is caused is avoided. In some scenarios, for example, in a large-scale mimo scenario, the number of antennas is greater, the beam formed by multiple antennas is narrower, and the scheduling complexity can be greatly simplified by using the beam concept during scheduling.

Mode 1, beam domain grouping.

As mentioned above, the beam domain grouping, which may also be referred to as a spatial domain grouping or a beam grouping, is used to indicate that a beam or a beam set is allocated to a user, that is, a spatial resource is reserved, and the allocated beam or the beam set is a spatial resource carried when data is transmitted to the user. For example, in a large-scale mimo scenario, spatial resources may be reserved for users in a beam domain grouping manner.

Specifically, the pre-scheduled user queues may be traversed according to the initial transmission scheduling priority, and beam domain grouping may be performed on the users in the user queues in sequence. And traversing the beam sets of the existing groups, and judging whether the beam sets are overlapped with the optimal beam set of the current traversed multi-user to obtain the number of overlapped groups. Assuming that the cooperative cell allocates the beam set a to the user a, the following two cases are included according to the number of overlapping packets.

Case 1: the number of overlapping packets is 0.

And if the number of the overlapped groups is 0 and the total beam number of all the groups after the new grouping is assumed to be less than or equal to the maximum pairing layer number, the new grouping is established for the user, namely, a beam set A is allocated to the user A, and the beam set A is the optimal beam set of the user A. Wherein the maximum number of pairing layers may be predefined, e.g. predefined by a protocol or preset by the network device.

Case 2: the number of overlapping packets is greater than 0.

In the process of sequentially making beam domain grouping for multiple users, JT users successfully grouped for multiple users enter a selected JT user pre-scheduling successful queue, and if users currently entering the selected JT user pre-scheduling successful queue exceed a preset threshold, for example, the preset threshold is denoted as JtUeAck _ then, or the number of serving cells having received a cooperation application exceeds a preset threshold, for example, the preset threshold is denoted as JtServCellAck _ then, the JT user dynamic grouping is ended, and the JT user dynamic grouping continues to be a common multiple user grouping. Wherein the JtUeAck _ then and the JtServCellAck _ then may be predefined, for example, protocol predefined or network device preset.

In the multi-user beam domain grouping, for a cooperative JT user, a reference beam set when the cooperative JT user participates in the dynamic grouping is the SU Rank static beams with the strongest RSRP, and a service beam set of the cooperative JT user in a cooperative cell is maintained by the cooperative cell; for a common user, the reference beam set participating in the dynamic grouping is the strongest static beams for MU Rank RSRP of the user.

Mode 2, according to the inter-user channel correlation.

For example, spatial resources may be reserved for users according to inter-user channel correlation in a non-massive mimo scenario. For example, when the channel is in an ideal state or the correlation between channels is small, the transmitting end adopts a spatial multiplexing transmission scheme, such as a dense urban area, indoor coverage and other scenes; when the correlation between channels is large, a space-time coding transmission scheme is adopted, for example, in suburban, rural areas and other scenarios.

Similarly, the channel correlation herein may refer to inter-user spatial correlation, and may also be understood as being based on inter-user spatial correlation.

In the above description, by means of the mode 1 and the mode 2, the cooperative cell pre-allocates the airspace resources for the user, but the embodiment of the present application is not limited thereto, and any mode that can pre-allocate the airspace resources for the user falls into the protection scope of the present application.

4. And the cooperative cell feeds back a cooperative application result to the serving cell.

The process of pre-allocating airspace resources to users in the pre-allocation stage is described above with reference to fig. 5, and the pre-scheduling and real scheduling modules are independently separated by using the characteristics of slow change of the user airspace. As can be seen from the foregoing, the cooperative distributed scheduling architecture provided in the embodiment of the present application may be applicable to scenarios with different interaction delays between cells and different cooperative transmission modes at a user level, and the architecture can reuse the current single-cell scheduling process and single-cell scheduling module.

A method 400 provided according to another embodiment of the present application is described below with reference to fig. 6 to 9, where the method 400 mainly describes a process of real scheduling for a user by a serving cell and a cooperating cell. In the method 400, the pre-scheduling process related to the serving cell or the cooperative cell as the user is described in detail in the above method 300, and is not described again for brevity.

In the embodiment of the present application, the scheduling of the real scheduling stage at least includes two schemes:

scheme 1: RB is aligned;

scheme 2: the RBs are not aligned.

Before describing the two schemes, two non-coherent JT techniques are described in conjunction with fig. 6.

Replication multi-point collaboration (DMP)

DMP, i.e. multipoint coordination, which transmits the same data stream. As shown in (1) of fig. 6, in DMP transmission, TP0 (i.e., serving cell) and TP1 (i.e., cooperating cell) transmit the same data on the same RB, i.e., on the same layer 1 (layer 1, L1) and layer 2 (layer 2, L2), and CSI measurement employs two-cell independent channel measurement. Transparent to the user, i.e. the user considers a single cell transmission.

Independent multipoint collaboration (SMP)

SMP, i.e. multipoint coordination where different data streams are sent. As shown in (2) of fig. 6, in SMP transmission, TP0 and TP1 each transmit one codeword, and two cell-independent channel measurements are used for CSI measurement. Since the scheduling information of each codeword is separately indicated using two PDCCHs, RBs when TP0 and TP1 transmit codewords may or may not be aligned when employing a transmission mode such as SMP.

Two schemes of scheduling are introduced below: scheme 1 and scheme 2.

Scheme 1: RB is aligned.

Scheme 1 is applicable to SMP and DMP in JT mode, where the RB IDs scheduled by JT users on the serving cell and cooperating cell are aligned. Fig. 7 shows a scheduling flow chart of scheme 1 adopted when JT users are actually scheduled, and each cell starts from each scheduling slot.

As shown in fig. 7, first, there is JT user pre-scheduling stage, which includes step 410 and step 420. Step 410 is performed in time slot T0, and in step 410, the serving cell preschedules JT users at L2, a multi-user beam-domain packet. In this process, the serving cell sends a cooperation request to the cooperating cell, where the cooperation request includes scheduling information of JT users. Step 420 is performed in time slot T1, and in step 420, the cooperating cells pre-schedule JT users in L2, and the multiple user beam domains are grouped. In this process, the cooperative cell sends a cooperation response to the serving cell, where the cooperation response includes an ID of a JT user, an RB bitmap (bitmap), the number of multi-user pairing layers on the cooperative cell, and so on.

The following is the JT user real scheduling phase at slot T2, including step 430 and step 440.

In step 430, for the serving cell, dynamically grouping in L2 multiuser space domain: JT users participate preferentially in the packet. Beam domain pairing at L2: within the reserved RB resources within the JT user beam group: JT retransmission > JT new transmission, i.e., the JT users for retransmission and then the JT users for new transmission can be considered. L2 correlation pairing. After the L2 is scheduled, the L1 determines information to be jointly transmitted to the JT user, where the information includes: transport block, MCS, transmit weight, etc. The serving cell sends information sent to JT users over the cooperating cell to the cooperating cell, where the information includes: transport block, MCS, transmission right, etc.

In step 430, for the cooperative cells, dynamically grouping in L2 multi-user space domain: JT users participate preferentially in the packet. Beam domain pairing at L2: and scheduling the cell outside the reserved RB resources in the JT user beam group. L2 correlation pairing: when calculating the multi-user pairing gain on the frequency domain resources (e.g., PRBs, RBs), the multi-user queue includes JT users whose beam domain pairing is successful. L1 receives data information to be sent by a cooperative cell, wherein the information comprises: transport block, MCS, transmit weight, etc.

In step 430, specifically, in the scheduling preprocessing stage, the retransmitted JT user or newly transmitted user participates in the multi-user dynamic grouping, and the successfully grouped multiple users enter the multi-user beam domain pairing in the subsequent scheduling stage. For example, basic priority single-user retransmission and new transmission scheduling queues and dynamically grouped multi-user scheduling queues can be generated respectively and used for single-user scheduling and multi-user beam domain pairing during real scheduling. Starting resource allocation, and giving up joint retransmission but participating in single-user scheduling at a user with multi-user dynamic grouping conflict or failed joint retransmission; JT multi-user retransmission and new transmission users successfully grouped by multi-user dynamic participate in beam domain pairing in a multi-user scheduling stage. And after the multi-user beam domain pairing stage, entering a multi-user correlation pairing stage, and giving up joint transmission by a newly-transmitted user of joint transmission with multi-user dynamic grouping failure, wherein the newly-transmitted user is used as a common newly-transmitted user (or a non-cooperative transmission user) to participate in multi-user correlation pairing. And after the correlation pairing is completed, if residual frequency domain resources (such as PRBs and RBs) and primary transmission connection to be scheduled with the basic priority exist, performing supplementary single-user scheduling.

In step 440, for the serving cell, L1 sends control information and data (i.e. an example of the first data) to JT users, for example, in SMP transmission, the sent content includes: 2PDCCH +, PDSCH; when DMP transmits, the transmitted content comprises: 1PDCCH + PDSCH. For a cooperative cell, L1 sends data (i.e. an example of second data) to JT users, for example, in SMP transmission, the sent content includes: a PDSCH; when DMP transmits, the transmitted content comprises: and a PDSCH.

Scheme 2: the RBs are not aligned.

Scheme 2 is applicable to SMP in JT mode, and data sent to JT users are scheduled independently on the serving cell and cooperating cell, respectively. The RBs may not be aligned. Fig. 8 and fig. 9 show scheduling timing and scheduling flow chart of scheme 2 adopted when JT users are actually scheduled, respectively, and each cell starts from each scheduling time slot.

As shown in fig. 8, the scheduling timing for JT users by the serving cell and the cooperating cell is as follows:

time slot (N-1)

The service cell determines the size of a transmission block to be transmitted by JT users on the cooperative cell 1 time slot in advance, and reserves HARQ ID i.

In this embodiment, the HARQ ID indicates an HARQ process identifier, and the HARQ process identifier may also be referred to as an HARQ process number. For example, HARQ ID i indicates the identity of the HARQ process or HARQ process number i. One HARQ process number may be used to uniquely specify one HARQ process. Each transport block may correspond to one HARQ process, i.e. a transport block transmitted by a cooperating cell may correspond to a HARQ ID i. The correspondence between the transport block and the HARQ process may be embodied by the correspondence between the transport block and the HARQ process number.

Time slot (N)

The serving cell and the cooperating cell respectively schedule JT users independently, downlink Control Information (DCI) is transmitted using their own PDCCHs, and their own PDSCHs transmit independent Codewords (CWs). A service cell independently schedules retransmission or newly transmitted JT users and uses HARQ ID j; the cooperative cell independently schedules the newly transmitted JT user using HARQ ID i.

A serving cell issues control information and data (an example of first data), which are denoted as PDCCH _ CW0 and PDSCH _ CW0; the coordinated cell issues control information and data (i.e., an example of second data), which are denoted as PDCCH _ CW1 and PDSCH _ CW1. And the user receives control information and data issued by the service cell and the cooperative cell.

After the service cell and the cooperative cell are respectively and independently scheduled in the current time slot, the cooperative cell returns the transmission information on the branch to the service cell, and the service cell timely supplements the scheduling information under the HARQ ID i on the cooperative branch after receiving the transmission information.

Time slot (N + k)

If the serving cell or the cooperative cell sends the downlink control information before the time slot (N + k), the user feeds back positive (ACK) information or Negative (NACK) information of the HARQ ID i and the HARQ ID j at the same time. A user may feed back ACK or NACK information through a Physical Uplink Control Channel (PUCCH) of a serving cell; alternatively, the user may also feed back ACK or NACK information through the respective PUCCHs on the serving cell and the cooperating cell, that is, the user may feed back ACK or NACK information of the HARQ ID j through the PUCCH on the serving cell and feed back ACK or NACK information of the HARQ ID i through the PUCCH on the cooperating cell. And the JT user retransmits the error-transmitted code words on the serving cell and the cooperative cell and retransmits the error-transmitted code words on the serving cell.

For example, as shown in fig. 8, assuming that the user feedback HARQ ID i is NACK and the HARQ ID j is ACK, which are denoted as a/N _ HARQ ID i = NACK and a/N _ HARQ ID j = ACK, the serving cell receives ACK information fed back by the user at the current time slot.

Time slot (N + k + 5)

The service cell determines the size of a transmission block to be transmitted by JT users on the cooperative cell 1 time slot in advance, and reserves HARQ ID j.

Time slot (N + k + 6)

The serving cell schedules the retransmitted JT user independently using HARQ ID i. The cooperative cell independently schedules the newly transmitted JT user using HARQ ID j.

The service cell issues control information and data, which are marked as PDCCH _ CW0 and PDSCH _ CW0; and the cooperative cell issues control information and data, which are marked as PDCCH _ CW1 and PDSCH _ CW1. And the user receives control information and data sent by the service cell and the cooperation cell.

After the service cell and the cooperative cell are respectively and independently scheduled in the current time slot, the cooperative cell returns the transmission information on the branch to the service cell, and the service cell timely supplements the scheduling information under the HARQ ID j on the cooperative branch after receiving the transmission information.

It should be noted that the time units referred to in the foregoing embodiments, such as the time slot (N-1), the time slot (N + k + 5), the time slot (N + k + 6), etc., are merely exemplary illustrations for facilitating understanding, and the embodiments of the present application are not limited thereto.

As shown in fig. 9, the procedure for scheduling JT users by the serving cell and the cooperating cell is as follows:

in slot (N-1): the service cell determines the size of a transmission block to be transmitted by JT users on the cooperative cell 1 time slot in advance, and reserves HARQ ID. The serving cell notifies scheduling information of the JT user on the cooperating cell, such as a newly transmitted transport block size, HARQ ID, outer loop offset (ollaaffset), and the like, to the cooperating cell.

In slot (N): for the serving cell, dynamically grouping in an L2 multi-user space domain: JT users participate preferentially in the packet. Beam domain pairing at L2: RB resources are allocated within JT user beam groups: JT retransmission > JT new transmission, i.e., the JT users for retransmission and then the JT users for new transmission can be considered. L2 correlation pairing: JT users may participate in relevance pairing. And the L2 supplements and updates HARQ process information on the JT user cooperative branch circuit, and receives user ACK retransmission judgment after k time slot.

In slot (N): for the cooperative cell, dynamically grouping in an L2 multi-user space domain: JT users participate preferentially in the packet. Beam domain pairing at L2: allocating RB resources within JT user beam packets: only JT users newly transmit. L2 correlation pairing: JT users may participate in relevance pairing. L2 determines information for JT users to transmit on the cooperative leg, the information including: transport block ID, MCS, transmission right, and the like.

Optionally, the cooperating cell sends information sent by the JT user on the cooperating cell to the serving cell, where the information includes an MCS, a New Data Indicator (NDI) field, a Redundancy Version (RV) field, an RB ID, and the like. Wherein the New Data Indication (NDI) field: typically, the NDI field may be used to indicate whether the resource scheduled by this DCI is for initial transmission or retransmission. For example, the NDI field may include 1 indication bit. When the indication bit is "1", the DCI may be considered for retransmission scheduling.

In slot (N): the serving cell transmits control information and data to JT users, and for example, the control information transmitted by the serving cell is referred to as PDCCH _ CW0_ SercCell and the data transmitted by the serving cell is referred to as PDSCH _ CW0_ SercCell. The cooperating cell transmits control information and data to the JT user, for example, the control information transmitted by the cooperating cell is denoted as PDCCH _ CW1_ CorpCell, and the data transmitted by the cooperating cell is denoted as PDSCH _ CW1_ CorpCell.

The pre-scheduling process applicable to the embodiment of the present application is described above with reference to fig. 5, the real scheduling process applicable to the embodiment of the present application is described with reference to fig. 6 to 9, and the method 500 provided according to another embodiment of the present application is described below with reference to fig. 10 to 12.

The method 500 includes steps 510 to 570, and mainly includes modules of JT user identification and coordination set management, JT user CSI measurement and CSI-RS, SRS resource configuration, JT user scheduling information update and maintenance, negotiation between a serving cell and a coordination cell for JT user coordination information, independent scheduling of JT users on the serving cell and the coordination cell, and the like. The method for pre-allocating airspace resources for JT users through negotiation between the serving cell and the cooperating cell, and the method for real scheduling for JT users through negotiation between the serving cell and the cooperating cell are described in detail in the above methods 300 and 400, and are not described herein again for brevity.

In step 510, the serving cell performs information update and maintenance on the L3 user candidate cooperative cell, and the serving cell receives SRS measurement results from the cooperative cell, and according to the measurement results, information update and maintenance on the L2 user candidate cooperative cell, and JT user identification and cooperative set management are performed. The service cell configures an A3 event for the accessed user, and JT user identification and cooperation set selection are carried out according to RSRP of the service cell and the adjacent cell reported by the user.

In step 520, the serving cell determines CSI information in different JT transmission modes and maintenance of an outer loop adjustment amount ollaaffset in different transmission modes according to CSI reporting and uplink SRS channel information measurement of the user.

In step 530, the serving cell makes a transmission mode initial decision according to CSI information of JT users in different transmission modes.

The transmission modes include, for example: SMP transmission mode, DMP transmission mode, single cell transmission mode, and the like.

In step 540, the serving cell and the cooperating cell perform cooperation negotiation semi-statically/periodically.

The serving cell and the cooperating cell negotiate to pre-allocate spatial resources for JT users, where a negotiation period of the serving cell and the cooperating cell may be an SRS period, or may also be predefined, for example, a protocol is predefined, and the embodiment of the present application is not limited thereto.

Fig. 11 shows a schematic diagram of a serving cell reserving spatial domain resources for a user. The serving cell performs JT user pre-scheduling: and the L2 performs JT user multi-user beam domain grouping according to the initial transmission scheduling priority, and the service cell sends a cooperation request to the cooperation cell, wherein the cooperation request carries scheduling information of JT users.

Fig. 11 also shows a schematic diagram of the cooperative cell reserving spatial resources for users. The cooperative cell executes JT user pre-scheduling: the cooperative cell arranges JT users requesting cooperation from other cells and common users of the cell together according to the initial transmission scheduling priority to make multi-user beam domain grouping, and feeds back cooperative response to other serving cells for JT users successfully grouped by the multi-user beam domain, wherein the cooperative response carries information such as JT user ID, RB bitmap, the number of multi-user pairing layers on the cooperative cell and the like.

In step 550, each slot is scheduled independently per cell. And if the cooperation is effective, the service cell and the cooperation cell perform real scheduling for JT users.

For the serving cell, dynamically grouping in an L2 multi-user space domain: JT users participate preferentially in the packet. Beam domain pairing at L2: within the reserved RB resources within the JT user beam group: JT retransmission > JT new transmission. L2 correlation pairing.

For the cooperative cells, dynamically grouping in an L2 multi-user space domain: JT users participate preferentially in the packet. Beam domain pairing at L2: and scheduling the cell outside the reserved RB resources in the JT user beam group. L2 correlation pairing: when calculating the multi-user pairing gain on the frequency domain resources (e.g., PRBs, RBs), the multi-user queue includes JT users whose beam domain pairing is successful.

In step 560, after the L2 scheduling is completed, the serving cell sends information sent to JT users over the cooperating cell to the cooperating cell, where the information may include: information such as transport block, MCS, and transmission right is referred to as { transport block, MCS, and transmission right }, for example. Accordingly, the cooperating cells receive information to be sent to the JT user.

In step 570, the serving cell and the cooperating cell simultaneously transmit data of the JT user to the air interface association.

Fig. 12 shows a schematic diagram when a serving cell and a cooperating cell jointly transmit data to JT users. And the service cell and the cooperative cell respectively use the pre-allocated space domain resources to transmit data to the JT users.

For the serving cell, L1 sends control information and data to JT users, for example, in SMP transmission, the sent content includes: 2PDCCH + PDSCH; when DMP transmits, the transmitted content comprises: 1PDCCH +, PDSCH. For a cooperative cell, L1 sends data to JT users, for example, in SMP transmission, the sent content includes: a PDSCH; when DMP transmits, the transmitted content comprises: and a PDSCH.

Fig. 13 shows a schematic diagram of a method 600 provided according to yet another embodiment of the present application from the perspective of a JT subscriber. Method 600 includes steps 610 through 630. In the method 600, the pre-scheduling process and the real scheduling process related to the serving cell or the cooperative cell as the user are described in detail in the above methods 300 and 400, respectively, and are not described again for brevity

In step 610, the serving cell and cooperating cell RSPR are measured.

First, the beam pairing relationship will be described. Beam pairing relationship: i.e. the pairing between the transmit beam and the receive beam, i.e. the pairing between the spatial transmit filter and the spatial receive filter. A large beamforming gain can be obtained for transmitting signals between the transmitting beam and the receiving beam having the beam pairing relationship.

In one implementation, a transmitting end (e.g., a serving cell) and a receiving end (e.g., a user) may obtain a beam pairing relationship through beam training. Specifically, the serving cell may transmit the reference signal in a beam scanning manner, and the user may also receive the reference signal in the beam scanning manner. Specifically, the serving cell may form beams with different directivities in space by means of beamforming, and may poll on multiple beams with different directivities to transmit the reference signal through the beams with different directivities, so that the power of the reference signal transmitting the reference signal in the direction in which the transmitted beam is directed may be maximized. The user can also form beams with different directivities in space by means of beam forming, and can poll on a plurality of beams with different directivities to receive the reference signal through the beams with different directivities, so that the power of the reference signal received by the user can be maximized in the direction in which the received beam points.

By traversing each transmitting beam and each receiving beam, the user can perform channel measurement based on the received reference signal, and report the measured result to the serving cell through the CSI. For example, a user may report a part of Reference Signal Receiving Power (RSRP) resources with a larger Reference Signal Receiving Power (RSRP) to a serving cell, such as reporting an identifier of the reference signal resource, so that the serving cell performs JT user identification and cooperating set selection according to RSRPs of the serving cell and a neighboring cell reported by the user.

In step 620, CSI measurement and reporting, SRS transmission.

The reference signal may be used for channel measurement or channel estimation, etc. The reference signal resource may be used to configure transmission attributes of the reference signal, such as spatial resource location, port mapping relationship, power factor, scrambling code, and the like, which may refer to the prior art. The channel measurement referred to in this application also includes beam measurement, i.e. beam quality information obtained by measuring reference signals, and the parameters for measuring beam quality include, but are not limited to, RSRP. For example, the beam quality can also be measured by RSRQ, SNR, SINR, etc.

The reference signal may include, for example, CSI-RS, SSB, and SRS. Correspondingly, the reference signal resource may include a CSI-RS resource, an SSB resource, and an SRS resource.

The serving cell may determine CSI information in different JT transmission modes, and maintain the outer loop adjustment amount in different transmission modes, according to CSI reporting and SRS channel information measurement of the user.

In step 630, data is received and ACK/NACK is fed back.

As in step 570 of method 500 above, the user receives data sent by the serving cell and the cooperating cell. After receiving the data, the user may perform ACK or NACK feedback on the data.

The overall flow of distributed scheduling provided according to the embodiment of the present application is described above with reference to fig. 10 to 13. The following describes a scheduling scheme of a HARQ process applicable to the embodiment of the present application with reference to fig. 14 and fig. 15.

The HARQ process scheduling scheme provided by the embodiment of the present application conforms to the current R15 protocol as much as possible:

1. the maximum HARQ process number of the users is 16;

2. still 1 MAC entity when adopting SMP transmission mode transmission, so the maximum HARQ process number is still 16 when SMP transmission;

3. the protocol does not define specific DCI indication information and ACK feedback forms under dual-DCI currently, so that an implementation scheme is adopted at present with a high possibility.

The product implementation of the HARQ process scheduling scheme provided in the embodiments of the present application:

1. a CRAN scheduling architecture, if a JT scheduling scheme 2, namely an RB non-alignment scheme, is adopted, and an SMP transmission mode is adopted, RBs can be non-aligned when a user performs combined transmission on a serving cell and a cooperative cell;

2. the double PDCCHs are issued by the service cell and the cooperation cell independently;

3. the ACK feedback of the users of two independent code words under the indication of the double DCI is received by the serving cell;

4. the user ACK feedback can be uploaded by a PUCCH of the serving cell, or can also be uploaded by respective PUCCHs of the serving cell and the cooperative cell;

5. suppose that data is sent to a user in a time slot (N), the ACK feedback capability of the user is N +8 or N +1 at present, and the time delay for releasing the HARQ process by the base station is N +6.

Taking the ACK information fed back by the user as an example, a HARQ process scheduling scheme in the SMP transmission mode is described below with reference to fig. 14.

The serving cell uses dual PDCCH, for example, denoted as PDCCH1 and PDCCH2, and the DCI format (format) may be DCI 1_1. For example, when a serving cell (denoted as TP 0) and a cooperating cell (denoted as TP 1) cooperate to transmit a transport block 1 to a user in a time slot (N), a codeword transmitted by TP0 is carried on PDCCH1, denoted as TP0CW1, and a codeword transmitted by TP1 is carried on PDCCH2, denoted as TP1CW1. For another example, when the serving cell and the cooperating cell cooperate to transmit the transport block 2 to the user in the time slot (N + 1), the codeword transmitted by TP0 is carried on PDCCH1 and denoted as TP0CW2, and the codeword transmitted by TP1 is carried on PDCCH2 and denoted as TP1CW2. For PDCCH1 and PDCCH2 in time slot (N) and PDCCH1 and PDCCH2 in time slot (N + 1), which module fails to transmit can be distinguished, for example, the terminal device is informed of which module needs to retransmit through disable identification on PDCCH.

The dual DCI uses different HARQ IDs to respectively indicate transmission information of transport blocks of a user on a serving cell and a cooperating cell in an SMP transmission mode, where PDCCH1 indicates TP0CW and PDCCH2 indicates TP1CW as shown in fig. 14. The transmission information may include: { MCS, NDI, RV }, other field information of the dual DCI may also be the same. The NDI may be used to indicate whether the resource scheduled by the DCI is for initial transmission or retransmission, for example, the NDI field may include 1 indication bit. When the indication bit is "1", the DCI may be considered for retransmission scheduling.

The codeword transmitted on the serving cell and the cooperating cell may select any one of the 2PDCCH indications. The number of RBs occupied by the codeword on the serving cell and the cooperating cell may be different.

And the user feeds back ACK: when the user feeds back ACK, the ACK information of the codewords on two TPs is fed back on the same Uplink Control Information (UCI), which is equivalent to ACK feedback under a single DCI dual-codeword.

The position of ACK for transport blocks carried on PDCCH1 on UCI is according to the bitmap index (BitMapIndex) in DCI, and the position of ACK for transport blocks carried on PDCCH2 is according to BitMapIndex +1.

Based on the above technical solution, the HARQ process scheduling scheme of the HARQ ID is defined according to the codeword or the transport block, which is beneficial to the sharing of HARQ process resources when transmitting on two transmission points (e.g. serving cell and cooperating cell), and saves HARQ process resources while ensuring the HARQ combining gain of JT users. The HARQ process scheduling scheme can be applied to dual DCI for scheduling transport block buffers (TB buffers) at a time under two different HARQ IDs, so that RBs of a user at two transmission points may be misaligned (RB IDs are different) in the SMP transmission mode, which is more beneficial to independent scheduling of user data at two transmission points in the SMP transmission mode.

The Round Trip Time (RTT) of codeword transmission on the serving cell and the cooperating cell in the SMP transmission mode is described below with reference to fig. 15.

After the user performs channel coding on the transport block, the data obtained by the channel coding may be registered in a buffer and waiting to be sent. The transport blocks in the buffer may have a one-to-one correspondence with HARQ processes, and each transport block may correspond to one HARQ process. The correspondence between the transport block and the HARQ process may be embodied by the correspondence between the transport block and the HARQ process number. Therefore, the terminal device can determine the correspondence between the transport block and the HARQ process number in advance.

The serving cell transmits a codeword from time slot (N), issues DCI0, uses HARQ ID j (or marked as HARQ Process ID: j), feeds back ACK to the time slot (N + k) user, and then releases the HARQ Process to the time slot (N + k + 6) serving cell: HARQ ID j, where the required RTT is (k + 6) slots.

The cooperative cell transmits one codeword: from the time slot (N-1), the serving cell reserves HARQ ID i in advance (or, denoted as HARQ Process ID: i), issues DCI1 in the time slot (N), feeds back ACK to the time slot (N + k) user, and then releases the HARQ Process to the (N + k + 6) serving cell: HARQ ID i, where the required RTT is (k + 6+1) slots.

It can be seen that in order for JT users to get continuous scheduling all the time in one RTT range (from slot (N-1) to slot (N + k + 6), assuming FDD), a total of (k + 6) + (k + 6+1) = (2k + 13) HARQ TB buffers are required. NR supports 16 HARQ process numbers at most, and there are equivalently 32 HARQ TB buffers according to HARQ process scheduling scheme 2. As long as (2k + 13) is less than 32 HARQ process resources are sufficient.

At present, the user feedback capability K =8 or 1, so with the present HARQ process scheduling scheme, HARQ process resources are sufficient.

Based on the above technical solution, in cooperative joint transmission, for example, when a plurality of network devices perform data transmission with one terminal device, the network device may adopt a beam concept during scheduling, and pre-allocate a beam or a beam set to the terminal device at a pre-allocation stage, that is, pre-allocate spatial resources, which not only can simplify scheduling complexity, but also utilize the slow change characteristic of the spatial domain of the terminal device to relatively independently separate the two modules of pre-allocation of the network device and independent scheduling of the network device, thereby avoiding the situation of scheduling errors caused by the consumption of transmission delay and processing delay of the plurality of network devices for determining the cooperative relationship among the plurality of network devices. In some scenarios, for example, in a large-scale mimo scenario, the number of antennas is greater, the beam formed by multiple antennas is narrower, and the scheduling complexity can be greatly simplified by using the beam concept during scheduling. In addition, the scheduling architecture of the embodiment of the application can reuse the current single-cell scheduling process and the single-cell scheduling module, and can improve the sensing rate of the CoMP user while considering that no loss is caused to the average performance of the system.

In addition, based on the above technical solution, the HARQ process scheduling scheme for defining the HARQ process number according to the codeword or the transport block is beneficial to sharing the HARQ process resource when transmitting on multiple network devices (e.g., multiple transmission points, such as multiple cells), and saves the HARQ process resource while ensuring the HARQ combining gain of the JT user.

It should be understood that, in the foregoing embodiments, the sequence numbers of the processes do not mean the execution sequence, and the execution sequence of the processes should be determined by the functions and the inherent logic of the processes, and should not constitute any limitation on the implementation process of the embodiments of the present application.

The method provided by the embodiment of the present application is described in detail above with reference to fig. 5 to 15. Hereinafter, the communication device according to the embodiment of the present application will be described in detail with reference to fig. 16 to 18.

Fig. 16 is a schematic block diagram of a communication device provided in an embodiment of the present application. As shown, the communication device 1000 may include a communication unit 1100 and a processing unit 1200.

In one possible design, the communication apparatus 1000 may correspond to the network device in the above method embodiment. For example, it may be a network device or a chip configured in a network device.

In particular, the communication apparatus 1000 may correspond to the network device in the methods 300, 400, 500, 600 according to the embodiments of the present application, and the communication apparatus 1000 may include a unit for performing the methods performed by the network devices in fig. 5 to 15. Also, the units and other operations and/or functions described above in the communication device 1000 are respectively for realizing the corresponding flows of the methods in fig. 5 to 15.

When the communication device 1000 is used to execute the method 300 in fig. 5, the communication unit 1100 may be used to execute step 320 or step 340 in the method 300, and the processing unit 1200 may be used to execute step 310 to step 340 in the method 300.

When the communication device 1000 is configured to perform the method 400 in fig. 7, the communication unit 1100 may be configured to perform step 440 in the method 400, and the processing unit 1200 may be configured to perform steps 410 to 430 in the method 400.

When the communication device 1000 is used to execute the method 500 in fig. 10, the communication unit 1100 may be used to execute step 570 in the method 500, and the processing unit 1200 may be used to execute steps 510 to 560 in the method 500.

When the communication device 1000 is configured to perform the method 600 in fig. 13, the communication unit 1100 may be configured to perform step 620 or step 630 in the method 600, and the processing unit 1200 may be configured to perform step 610 in the method 600.

It should be understood that the specific processes of the units for executing the corresponding steps are already described in detail in the above method embodiments, and therefore, for brevity, detailed descriptions thereof are omitted.

It should also be understood that when the communication apparatus 1000 is a network device, the communication unit 1100 in the communication apparatus 1000 may correspond to the transceiver 3100 in the network device 3000 shown in fig. 18, and the processing unit 1200 in the communication apparatus 1000 may correspond to the processor 3200 in the network device 3000 shown in fig. 18.

It should also be understood that when the communication device 1000 is a chip configured in a network device, the communication unit 1100 in the communication device 1000 may be an input/output interface.

In another possible design, the communication apparatus 1000 may correspond to the terminal device in the above method embodiment. For example, the terminal device may be the terminal device, or a chip configured in the terminal device.

Specifically, the communication apparatus 1000 may correspond to the terminal device in the methods 300, 400, 500, and 600 according to the embodiments of the present application, and the communication apparatus 1000 may include a unit for performing the methods performed by the terminal devices in fig. 5 to 15. Also, the units and other operations and/or functions described above in the communication device 1000 are respectively for realizing the corresponding flows of the methods in fig. 5 to 15.

Wherein, when the communication device 1000 is used to execute the method 400 in fig. 7, the communication unit 1100 may be used to execute the step 440 in the method 400, and the processing unit 1200 may be used to execute the step 410 in the method 400.

When the communication device 1000 is configured to perform the method 500 in fig. 10, the communication unit 1100 may be configured to perform step 570 in the method 500, and the processing unit 1200 may be configured to perform step 520 in the method 500.

It is further understood that when the communication apparatus 1000 is a terminal device, the communication unit in the communication apparatus 1000 may correspond to the transceiver 2020 in the terminal device 2000 shown in fig. 17, and the processing unit 1200 in the communication apparatus 1000 may correspond to the processor 2010 in the terminal device 2000 shown in fig. 17.

It should also be understood that when the communication apparatus 1000 is a chip configured in a terminal device, the communication unit 1100 in the communication apparatus 1000 may be an input/output interface.

Fig. 17 is a schematic structural diagram of a terminal device 2000 according to an embodiment of the present application. The terminal device 2000 can be applied to the system shown in fig. 1 or fig. 2, and performs the functions of the terminal device in the above method embodiment.

As shown, the terminal device 2000 includes a processor 2010 and a transceiver 2020. Optionally, the terminal device 2000 further comprises a memory 2030. The processor 2010, the transceiver 2002 and the memory 2030 may be in communication with each other via the interconnection path to transfer control and/or data signals, the memory 2030 may be used for storing a computer program, and the processor 2010 may be used for retrieving and executing the computer program from the memory 2030 to control the transceiver 2020 to transmit and receive signals. Optionally, the terminal device 2000 may further include an antenna 2040, configured to transmit uplink data or uplink control signaling output by the transceiver 2020 by using a wireless signal.

The processor 2010 and the memory 2030 may be combined into a processing device, and the processor 2010 is configured to execute the program codes stored in the memory 2030 to achieve the above functions. In particular, the memory 2030 may be integrated with the processor 2010 or may be separate from the processor 2010. The processor 2010 may correspond to the processing unit in fig. 16.

The transceiver 2020 may correspond to the communication unit in fig. 16, and may also be referred to as a transceiver unit. The transceiver 2020 may include a receiver (or receiver, receiving circuit) and a transmitter (or transmitter, transmitting circuit). The receiver is used for receiving signals, and the transmitter is used for transmitting signals.

It should be understood that terminal device 2000 shown in fig. 17 is capable of implementing various processes involving the terminal device in the method embodiments shown in fig. 5-15. The operations and/or functions of the modules in the terminal device 2000 are respectively to implement the corresponding flows in the above-described method embodiments. Reference may be made specifically to the description of the above method embodiments, and a detailed description is omitted here where appropriate to avoid repetition.

The processor 2010 may be configured to perform the actions described in the preceding method embodiments that are implemented within the terminal device, and the transceiver 2020 may be configured to perform the actions described in the preceding method embodiments that the terminal device transmits to or receives from the network device. Please refer to the description in the previous embodiment of the method, which is not repeated herein.

Optionally, the terminal device 2000 may further include a power supply 2050 for supplying power to various devices or circuits in the terminal device.

In addition, in order to further improve the functions of the terminal device, the terminal device 2000 may further include one or more of an input unit 2060, a display unit 2070, an audio circuit 2080, a camera 2090, a sensor 2100, and the like, and the audio circuit may further include a speaker 2082, a microphone 2084, and the like.

Fig. 18 is a schematic structural diagram of a network device provided in the embodiment of the present application, which may be a schematic structural diagram of a base station, for example. The base station 3000 can be applied to the system shown in fig. 1 or fig. 2, and performs the functions of the network device in the above method embodiments.

As shown, the base station 3000 may include one or more radio frequency units, such as a Remote Radio Unit (RRU) 3100 and one or more baseband units (BBUs) (also referred to as digital units, DUs) 3200. The RRU 3100 may be referred to as a transceiver unit and corresponds to the communication unit 1200 in fig. 16. Alternatively, the transceiving unit 3100 may also be referred to as a transceiver, transceiving circuit, or transceiver, etc., which may comprise at least one antenna 3101 and a radio frequency unit 3102. Alternatively, the transceiving unit 3100 may include a receiving unit and a transmitting unit, the receiving unit may correspond to a receiver (or receiver, receiving circuit), and the transmitting unit may correspond to a transmitter (or transmitter, transmitting circuit). The RRU 3100 part is mainly used for transceiving and converting radio frequency signals to baseband signals, for example, for sending indication information to a terminal device. The BBU 3200 section is mainly used for performing baseband processing, controlling a base station, and the like. The RRU 3100 and the BBU 3200 may be physically disposed together or may be physically disposed separately, i.e. distributed base stations.

The BBU 3200, which is a control center of the base station and may also be referred to as a processing unit, may correspond to the processing unit 1100 in fig. 16, and is mainly used for performing baseband processing functions, such as channel coding, multiplexing, modulation, spreading, and the like. For example, the BBU (processing unit) may be configured to control the base station to perform an operation procedure related to the network device in the foregoing method embodiment, for example, to generate the foregoing indication information.

In an example, the BBU 3200 may be formed by one or more boards, and the boards may collectively support a radio access network of a single access system (e.g., an LTE network), or may respectively support radio access networks of different access systems (e.g., an LTE network, a 5G network, or other networks). The BBU 3200 also includes a memory 3201 and a processor 3202. The memory 3201 is used to store necessary instructions and data. The processor 3202 is configured to control the base station to perform necessary actions, for example, to control the base station to perform the operation procedures related to the network device in the method embodiments described above. The memory 3201 and processor 3202 may serve one or more boards. That is, the memory and processor may be provided separately on each board. Multiple boards may share the same memory and processor. In addition, each single board can be provided with necessary circuits.

It should be understood that the base station 3000 shown in fig. 18 can implement various processes involving network devices in the method embodiments of fig. 5-15. The operations and/or functions of the respective modules in the base station 3000 are respectively for implementing the corresponding flows in the above-described method embodiments. Reference may be made specifically to the description of the above method embodiments, and a detailed description is omitted here where appropriate to avoid repetition.

BBU 3200 as described above can be used to perform actions described in previous method embodiments as being implemented internally by a network device, while RRU 3100 can be used to perform actions described in previous method embodiments as being sent by or received from a terminal device by a network device. Please refer to the description of the previous embodiment of the method, which is not repeated herein.

The embodiment of the application also provides a processing device, which comprises a processor and an interface; the processor is configured to perform the method of any of the above method embodiments.

It should be understood that the processing means may be a chip. For example, the processing device may be a Field Programmable Gate Array (FPGA), an Application Specific Integrated Circuit (ASIC), a system on chip (SoC), a Central Processing Unit (CPU), a Network Processor (NP), a digital signal processing circuit (DSP), a Microcontroller (MCU), a Programmable Logic Device (PLD), or other integrated chips.

In implementation, the steps of the above method may be performed by integrated logic circuits of hardware in a processor or instructions in the form of software. The steps of a method disclosed in connection with the embodiments of the present application may be directly implemented by a hardware processor, or may be implemented by a combination of hardware and software modules in a processor. The software module may be located in ram, flash memory, rom, prom, or eprom, registers, etc. storage media as is well known in the art. The storage medium is located in a memory, and a processor reads information in the memory and completes the steps of the method in combination with hardware of the processor. To avoid repetition, it is not described in detail here.

It should be noted that the processor in the embodiments of the present application may be an integrated circuit chip having signal processing capability. In implementation, the steps of the above method embodiments may be performed by integrated logic circuits of hardware in a processor or instructions in the form of software. The processor described above may be a general purpose processor, a Digital Signal Processor (DSP), an Application Specific Integrated Circuit (ASIC), a Field Programmable Gate Array (FPGA) or other programmable logic device, discrete gate or transistor logic, discrete hardware components. The various methods, steps, and logic blocks disclosed in the embodiments of the present application may be implemented or performed. A general purpose processor may be a microprocessor or the processor may be any conventional processor or the like. The steps of the method disclosed in connection with the embodiments of the present application may be directly implemented by a hardware decoding processor, or implemented by a combination of hardware and software modules in the decoding processor. The software module may be located in ram, flash memory, rom, prom, or eprom, registers, etc. storage media as is well known in the art. The storage medium is located in a memory, and a processor reads information in the memory and completes the steps of the method in combination with hardware of the processor.

It will be appreciated that the memory in the embodiments of the subject application can be either volatile memory or nonvolatile memory, or can include both volatile and nonvolatile memory. The non-volatile memory may be a read-only memory (ROM), a Programmable ROM (PROM), an Erasable PROM (EPROM), an Electrically Erasable PROM (EEPROM), or a flash memory. Volatile memory can be Random Access Memory (RAM), which acts as external cache memory. By way of example, but not limitation, many forms of RAM are available, such as Static Random Access Memory (SRAM), dynamic Random Access Memory (DRAM), synchronous Dynamic Random Access Memory (SDRAM), double data rate SDRAM, enhanced SDRAM, SLDRAM, synchronous Link DRAM (SLDRAM), and direct rambus RAM (DR RAM). It should be noted that the memory of the systems and methods described herein is intended to comprise, without being limited to, these and any other suitable types of memory.

According to the method provided by the embodiment of the present application, the present application further provides a computer program product, which includes: computer program code which, when run on a computer, causes the computer to perform the method of any one of the embodiments shown in figures 5 to 15.

According to the method provided by the embodiment of the present application, a computer-readable medium is further provided, and the computer-readable medium stores program codes, and when the program codes are executed on a computer, the computer is caused to execute the method of any one of the embodiments shown in fig. 5 to 15.

According to the method provided by the embodiment of the present application, the present application further provides a system, which includes the foregoing one or more terminal devices and one or more network devices.

In the above embodiments, the implementation may be wholly or partially realized by software, hardware, firmware, or any combination thereof. When implemented in software, may be implemented in whole or in part in the form of a computer program product. The computer program product includes one or more computer instructions. When loaded and executed on a computer, cause the processes or functions described in accordance with the embodiments of the application to occur, in whole or in part. The computer may be a general purpose computer, a special purpose computer, a network of computers, or other programmable device. The computer instructions may be stored in a computer readable storage medium or transmitted from one computer readable storage medium to another computer readable storage medium, for example, the computer instructions may be transmitted from one website, computer, server, or data center to another website, computer, server, or data center via wire (e.g., coaxial cable, fiber optic, digital Subscriber Line (DSL)) or wireless (e.g., infrared, wireless, microwave, etc.). The computer-readable storage medium can be any available medium that can be accessed by a computer or a data storage device, such as a server, a data center, etc., that includes one or more available media. The usable medium may be a magnetic medium (e.g., a floppy disk, a hard disk, a magnetic tape), an optical medium (e.g., a Digital Video Disk (DVD)), or a semiconductor medium (e.g., a Solid State Disk (SSD)), among others.

The network device in the foregoing device embodiments completely corresponds to the terminal device and the network device or the terminal device in the method embodiments, and the corresponding module or unit executes the corresponding steps, for example, the communication unit (transceiver) executes the steps of receiving or transmitting in the method embodiments, and other steps besides transmitting and receiving may be executed by the processing unit (processor). The functions of the specific elements may be referred to in the respective method embodiments. The number of the processors may be one or more.

As used in this specification, the terms "component," "module," "system," and the like are intended to refer to a computer-related entity, either hardware, firmware, a combination of hardware and software, or software in execution. For example, a component may be, but is not limited to being, a process running on a processor, an object, an executable, a thread of execution, a program, and/or a computer. By way of illustration, both an application running on a computing device and the computing device can be a component. One or more components can reside within a process and/or thread of execution and a component may be localized on one computer and/or distributed between two or more computers. In addition, these components can execute from various computer readable media having various data structures stored thereon. The components may communicate by way of local and/or remote processes such as in accordance with a signal having one or more data packets (e.g., data from two components interacting with another component in a local system, distributed system, and/or across a network such as the internet with other systems by way of the signal).

Those of ordinary skill in the art will appreciate that the various illustrative elements and algorithm steps described in connection with the embodiments disclosed herein may be implemented as electronic hardware or combinations of computer software and electronic hardware. Whether such functionality is implemented as hardware or software depends upon the particular application and design constraints imposed on the implementation. Skilled artisans may implement the described functionality in varying ways for each particular application, but such implementation decisions should not be interpreted as causing a departure from the scope of the present application.

It is clear to those skilled in the art that, for convenience and brevity of description, the specific working processes of the above-described systems, apparatuses and units may refer to the corresponding processes in the foregoing method embodiments, and are not described herein again.

In the several embodiments provided in the present application, it should be understood that the disclosed system, apparatus and method may be implemented in other ways. For example, the above-described apparatus embodiments are merely illustrative, and for example, the division of the units is only one logical division, and other divisions may be realized in practice, for example, a plurality of units or components may be combined or integrated into another system, or some features may be omitted, or not executed. In addition, the shown or discussed mutual coupling or direct coupling or communication connection may be an indirect coupling or communication connection through some interfaces, devices or units, and may be in an electrical, mechanical or other form.

The units described as separate parts may or may not be physically separate, and parts displayed as units may or may not be physical units, may be located in one place, or may be distributed on a plurality of network units. Some or all of the units can be selected according to actual needs to achieve the purpose of the solution of the embodiment.

In addition, functional units in the embodiments of the present application may be integrated into one processing unit, or each unit may exist alone physically, or two or more units are integrated into one unit.

The functions, if implemented in the form of software functional units and sold or used as a stand-alone product, may be stored in a computer readable storage medium. Based on such understanding, the technical solution of the present application or portions thereof that substantially contribute to the prior art may be embodied in the form of a software product stored in a storage medium and including instructions for causing a computer device (which may be a personal computer, a server, or a network device) to execute all or part of the steps of the method according to the embodiments of the present application. And the aforementioned storage medium includes: a U-disk, a portable hard disk, a read-only memory (ROM), a Random Access Memory (RAM), a magnetic disk, an optical disk, or other various media capable of storing program codes.

The above description is only for the specific embodiments of the present application, but the scope of the present application is not limited thereto, and any person skilled in the art can easily conceive of the changes or substitutions within the technical scope of the present application, and shall be covered by the scope of the present application. Therefore, the protection scope of the present application shall be subject to the protection scope of the claims.

Claims

1. A method of transmitting data, comprising:

the serving cell pre-allocates a first beam to a first joint transmission JT user according to channel correlation or a beam domain grouping mode;

the serving cell sends cooperation request information to a cooperating cell, where the cooperation request information is used to request the cooperating cell to cooperate the serving cell to send second data to the first JT user, where the cooperation request information is also used to pre-allocate a second beam to the first JT user by the cooperating cell according to the channel correlation or the beam domain grouping manner, where the beam domain grouping manner includes that JT users and common users of the cell are arranged together according to an initial scheduling priority to make a multi-user beam domain grouping, where the JT users include the first JT user;

the serving cell receives cooperation response information from the cooperation cell, wherein the cooperation response information is feedback information aiming at the cooperation request information;

based on the cooperation response information, the serving cell sends first data to the first JT user through the first beam.

2. The method of claim 1, further comprising:

the serving cell pre-allocates N groups of beam sets to N users, where the N users correspond to the N groups of beam sets one to one, and the N users include the first JT user, where N is an integer greater than 1 or equal to 1;

the serving cell pre-allocates a first beam to a first JT user, including:

the serving cell pre-allocates a first group of beam sets to the first JT user, where the first group of beam sets includes the first beam, and the N groups of beam sets includes the first group of beam sets.

3. The method according to claim 1 or 2, characterized in that the method further comprises:

the serving cell sends first downlink control information and second downlink control information to the first JT user, the first downlink control information schedules the first data, the second control information schedules the second data, and,

4. The method of claim 3, further comprising:

the serving cell receiving information for the second data from the cooperating cell;

and the serving cell updates scheduling information corresponding to the second hybrid automatic repeat request process number according to the information aiming at the second data.

5. The method of claim 3, further comprising:

and the serving cell receives feedback information aiming at the first data and feedback information aiming at the second data, which are sent by the first JT user.

6. The method of claim 5, further comprising:

when the feedback information for the first data is negative NACK information, the serving cell retransmits the first data to the first JT user; and/or the presence of a gas in the gas,

and when the feedback information for the second data is NACK information, the serving cell retransmits the second data to the first JT user.

7. A method of transmitting data, comprising:

a cooperation cell receives cooperation request information from a service cell, wherein the cooperation request information is used for requesting the cooperation cell to cooperate the service cell to send second data to a first JT user;

the cooperative cell pre-allocates a second beam to the first JT user according to the cooperation request information and the channel correlation or the beam domain grouping mode, where the beam domain grouping mode includes arranging JT users and common users of the cell together according to the initial transmission scheduling priority to make multi-user beam domain grouping, where the JT users include the first JT user;

the cooperative cell sends cooperative response information to the serving cell, wherein the cooperative response information is feedback information aiming at the cooperative request information;

and based on the cooperation response information, the cooperative cell sends the second data to the first JT user through the second beam.

8. A method of receiving data, comprising:

a first JT user receives first data from a serving cell and second data from a cooperating cell, where the first data is carried in a first beam, the second data is carried in a second beam, the first beam is a beam pre-allocated by the serving cell to the first JT user according to channel correlation or a beam domain grouping manner, the second beam is a beam pre-allocated by the cooperating cell to the first JT user according to cooperation request information and channel correlation or the beam domain grouping manner, where the cooperation request information is information sent by the serving cell to the cooperating cell, the beam domain grouping manner includes arranging multiple users and common users of the cell together according to an initial transmission scheduling priority to make a multiple user beam domain grouping, and the JT user includes the first JT user;

and the first JT user sends feedback information aiming at the first data and the second data to the serving cell.

9. The method of claim 8, further comprising:

the first JT subscriber receives first downlink control information and second downlink control information from the serving cell, the first downlink control information schedules the first data, the second control information schedules the second data, and,

10. A communications apparatus, comprising:

a processing unit, configured to pre-allocate a first beam to a first JT user according to channel correlation or a beam domain grouping manner;

a transceiver unit, configured to send cooperation request information to a cooperating cell, where the cooperation request information is used to request the cooperating cell to cooperate the apparatus to send second data to the first JT user, where the cooperation request information is further used to pre-allocate, by the cooperating cell, a second beam to the first JT user according to the channel correlation or the beam-domain grouping manner, where the beam-domain grouping manner includes that JT users and common users in the cell are arranged together according to an initial scheduling priority to form a multi-user beam-domain grouping, and the JT users include the first JT user;

the transceiver unit is further configured to: receiving cooperation response information from the cooperation cell, wherein the cooperation response information is feedback information aiming at the cooperation request information;

the transceiver unit is further configured to: and sending first data to the first JT user through the first beam based on the cooperation response information.

11. The apparatus of claim 10, wherein the processing unit is further configured to:

pre-allocating N groups of beam sets for N users, wherein the N users correspond to the N groups of beam sets one to one, the N users comprise the first JT user, and N is an integer greater than 1 or equal to 1;

the processing unit is specifically configured to:

pre-allocating a first set of beam sets to the first JT user, the first set of beam sets including the first beam, and the N sets of beam sets including the first set of beam sets.

12. The apparatus according to claim 10 or 11, wherein the transceiver unit is further configured to:

transmitting first downlink control information and second downlink control information to the first JT user, the first downlink control information scheduling the first data, the second control information scheduling the second data, and,

13. The apparatus of claim 12, wherein the transceiver unit is further configured to:

receiving information for the second data from the cooperating cell;

the processing unit is further to:

and updating the scheduling information corresponding to the second hybrid automatic repeat request process number according to the information aiming at the second data.

14. The apparatus of claim 12, wherein the transceiver unit is configured to:

and receiving feedback information aiming at the first data and feedback information aiming at the second data, which are sent by the first JT user.

15. The apparatus of claim 14, wherein the transceiver unit is further configured to:

when the feedback information for the first data is negative NACK information, retransmitting the first data to the first JT user; and/or the presence of a gas in the gas,

and when the feedback information for the second data is NACK information, retransmitting the second data to the first JT user.

16. A communications apparatus, comprising:

a transceiver unit, configured to receive cooperation request information from a serving cell, where the cooperation request information is used to request the apparatus to cooperate with the serving cell to send second data to a first JT user;

a processing unit: the method is used for pre-allocating a second beam to the first JT user according to the cooperation request information and the channel correlation or the beam domain grouping mode, where the beam domain grouping mode includes that JT users and common users of the cell are arranged together according to the initial transmission scheduling priority to make a multi-user beam domain grouping, and the JT users include the first JT user;

the transceiver unit is further configured to: sending cooperation response information to the serving cell, wherein the cooperation response information is feedback information aiming at the cooperation request information;

the transceiver unit is further configured to: and sending the second data to the first JT user through the second beam based on the cooperation response information.

17. A communications apparatus, comprising:

a transceiver unit, configured to receive first data from a serving cell and second data from a cooperating cell, where the first data is carried in a beam, and the second data is carried in a second beam, where the first beam is a beam pre-allocated by the serving cell to the apparatus according to channel correlation or a beam domain grouping manner, and the second beam is a beam pre-allocated by the cooperating cell to the apparatus according to cooperation request information and channel correlation or the beam domain grouping manner, where the cooperation request information is information sent by the serving cell to the cooperating cell, the beam domain grouping manner includes arranging JT users and common users of the serving cell together according to an initial transmission scheduling priority to form a multi-user beam domain group, and the JT users include the first JT user;

the transceiver unit is further configured to: transmitting feedback information for the first data and the second data to the serving cell.

18. The apparatus of claim 17, wherein the transceiver unit is further configured to:

receiving first downlink control information and second downlink control information from the serving cell, the first downlink control information scheduling the first data, the second control information scheduling the second data, and,

19. A communications apparatus, comprising:

a memory for storing a computer program;

a processor for executing a computer program stored in the memory to cause the apparatus to perform the method of any of claims 1 to 9.

20. A computer-readable storage medium comprising a computer program which, when run on a computer, causes the computer to perform the method of any one of claims 1 to 9.