WO2021087774A1

WO2021087774A1 - Communication method and related device

Info

Publication number: WO2021087774A1
Application number: PCT/CN2019/115811
Authority: WO
Inventors: 郭文婷; 向铮铮; 苏宏家; 卢磊
Original assignee: 华为技术有限公司
Priority date: 2019-11-05
Filing date: 2019-11-05
Publication date: 2021-05-14
Also published as: CN114556828A

Abstract

Disclosed are a communication method and a related device. The communication method comprises: a first terminal device receives first data from a second terminal device in a first time slot, the first time slot being one of N time slots, N being an integer greater than or equal to 1; the first terminal device sends a first response sequence to the second terminal device on a first time-frequency resource according to the first data, the first response sequence being one of the sequences allocated to the first time slot from among M code division multiplexing sequences, the M code division multiplexing sequences being used for responding on the first time-frequency resource to the data sent in the N time slots, and M being an integer multiple of N. Network overhead can be saved according to the embodiments of the present application.

Description

Communication method and related device

Technical field

The present invention relates to the field of communication technology, and in particular to a communication method and related devices.

Background technique

With the development of wireless communication technology, people’s demand for high data rates and user experience is increasing. At the same time, people’s demand for proximity services that understand and communicate with people or things around them is gradually increasing. Therefore, device-to-device (device-to-device) device, D2D) technology came into being. The application of D2D technology can reduce the burden on cellular networks, reduce battery power consumption of user equipment, increase data rates, and meet the needs of proximity services.

Under the network of long-term evolution (LTE) technology proposed by the 3rd generation partnership project (3GPP), the vehicle-to-everything (V2X) vehicle networking technology It has been proposed that V2X communication refers to the communication between the vehicle and the outside world, including vehicle-to-vehicle communication (V2V), vehicle-to-pedestrian communication (V2P), and vehicle-to-infrastructure communication ( vehicle to infrastructure, V2I), vehicle to network communication (V2N). V2X communication is aimed at high-speed equipment communication technology represented by vehicles. It is the basic technology and key technology applied in scenarios with very high communication delay requirements in the future, such as smart cars, autonomous driving, intelligent transportation systems and other scenarios. LTE V2X solves some of the basic requirements in V2X scenarios, but for future application scenarios such as fully intelligent driving and autonomous driving, LTE V2X at this stage cannot effectively support it.

With the development of 5G new radio (NR) technology in the 3GPP standard organization, 5G NR V2X will also be further developed, for example, it can support lower transmission delay, more reliable communication transmission, and higher throughput. Better user experience to meet the needs of a wider range of application scenarios.

LTE V2X defines broadcast transmission on the side link, and NR V2X introduces unicast and multicast transmission on the side link. In unicast/multicast transmission, in order to improve transmission reliability and reduce transmission delay, the physical layer hybrid automatic repeat request (HARQ) technology can be used. The 3GPP standard defines the physical layer sidelink feedback channel (PSFCH) on the side link, which is used to send sidelink feedback control information (SFCI), which can at least be used to receive user equipment (user equipment). equipment, UE) to send a feedback confirmation message to the sending UE whether the reception is successful, and may also include channel status information (channel status information, CSI), etc. The time domain resources of the PSFCH may be configured or pre-configured by the network for the resource pool, and the frequency domain resources and/or code domain resources of the PSFCH are also configured. However, there is no standard for how to configure these resources in the prior art.

The prior art supports UE feedback on downlink data transmission, and the base station fully controls the allocation of time-frequency resources. Therefore, a UE sends a decoding result of one or more downlink data on the time-frequency resource configured by the base station. However, in multicast communication, for application scenarios where there is no central controller such as base station control scheduling, when multiple users in multiple time slots need to feed back HARQ information on the same time-frequency resource, how to allocate time-frequency resources to users is People in the field need to study and solve problems.

Summary of the invention

The present invention provides a communication method and related devices. When unicast, multicast, and broadcast coexist in the same resource pool, no additional signaling overhead is required, and each time slot is assigned a corresponding response sequence and response sequence in advance. Time-frequency resources are used to respond to the received data, thereby reducing network overhead.

In the first aspect, an embodiment of the present invention provides a communication method. The method includes: a first terminal device receives first data from a second terminal device in a first time slot; and the first time slot has N time slots. For one time slot in the slot, the N is an integer greater than or equal to 1;

The first terminal device sends a first response sequence to the second terminal device on a first time-frequency resource according to the first data, and the first response sequence is allocated to all of the M code division multiplexing sequences. One of the sequences of the first time slot, the M code division multiplexing sequences are used to respond to the data sent on the N time slots on the first time-frequency resource, and the M is the N Integer multiples of.

This scheme uses code division multiplexing sequence, so that each time slot can be allocated to the corresponding response sequence. When unicast, multicast, and broadcast coexist in the same resource pool, no additional signaling overhead is needed. Each time slot is allocated in advance with a corresponding response sequence and time-frequency resource for responding to the received data, so that it can Reduce network overhead.

In one of the implementation manners, the signal bandwidth of each of the M code division multiplexing sequences is the same as the bandwidth of the first time-frequency resource, and the bandwidth of the first time-frequency resource is the same as the bandwidth of the first time-frequency resource. The bandwidth of the sub-channel where the time-frequency resource is located is the same.

In this embodiment, the signal bandwidth of the code division multiplexing sequence is designed to be the same as the bandwidth for transmitting the sequence, so that the time-frequency resource can be fully utilized.

In one of the implementation manners, the M code division multiplexing sequences are used to evenly allocate the N time slots, and each of the N time slots is allocated M/N code division multiplexing. Sequence; the M/N code division multiplexing sequences are used to allocate P=M/(2*N) devices; each of the P devices is allocated two sequences, and the two sequences include For the ACK sequence of confirmation characters and the NACK sequence of negative characters, the P is a positive integer, and the M is an integer multiple of P.

In this embodiment, M code division multiplexing sequences that can be multiplexed in a time-frequency resource are evenly allocated to N time slots configured by the system, and then two sequences are assigned to each device to respond to the received The situation of correct and wrong decoding after data.

In one of the embodiments, the M code division multiplexing sequences are obtained by a base sequence γ by cyclic shifting in the time domain, or the M code division multiplexing sequences are obtained by a base sequence γ through Obtained by phase rotation in the frequency domain; the M code division multiplexing sequences are expressed as:

r(n)=γ*e ^{-j*(2*π/M)*n} ,n=0,1,2,3,...,M-1

Wherein, the N represents the index number of the M code division multiplexing sequences;

The M/N code division multiplexing sequences allocated to each of the N time slots are M/N sequences with consecutive index labels.

In this embodiment, a formula expressing the above M code division multiplexing sequences is given, and the index labels of the multiple code division multiplexing sequences allocated to each of the N time slots are designed to be continuous, thereby ensuring the sequence The distribution is organized, reducing the trouble of sorting out.

In one of the implementation manners, the M/N code division multiplexing sequences obtained by the allocation of the i-th time slot among the N time slots are expressed as:

Wherein, the m ₀ represents the initial phase of the base sequence γ, and the i=0,1,2,...,N-1;

Alternatively, the M/N code division multiplexing sequences obtained by the allocation of the i-th time slot among the N time slots are expressed as:

This embodiment provides an expression formula representing the sequence allocated by each of the above N time slots. Analysis from the formula also shows that the index labels of the multiple code division multiplexing sequences of each time slot are continuous.

In one of the implementation manners, the P ACK sequences allocated by the i-th time slot among the N time slots are P consecutive sequences with index labels, and the i-th time slot among the N time slots The allocated P NACK sequences are P sequences with consecutive index labels.

In the embodiment of the present application, the index labels of the P ACK sequences and P NACK sequences in each time slot are designed to be continuous, so as to reduce the mutual interference between the ACK and NACK sequences in the same time slot.

Wherein, said ρ=0,1,2,...,P-1;

In the i-th time slot, _{the code division multiplexing sequence obtained under the condition of m cs} =ρ is P consecutive ACK sequences with index labels, and the code division multiplexing sequence obtained under the condition of m _cs =ρ+P Use the sequence as P consecutive NACK sequences with index labels;

Or, in the i-th time slot, _{the code division multiplexing sequence obtained in the case of m cs} =ρ is P NACK sequences with consecutive index labels, and the code obtained in the case of _{m cs =ρ+P} The multiplexing sequence is P ACK sequences with consecutive index labels;

The code division multiplexing sequence generated when m _cs =ρ and the code division multiplexing sequence generated when m _cs =ρ+P form a code division multiplexing sequence pair.

In the embodiment of the present application, the expression formulas for the consecutive sequences of ACK and NACK in each time slot are given, and the pairing mode of ACK and NACK sequence pairs is designed.

Wherein, the m ₀ represents the initial phase of the base sequence γ, the m ₀ =P/2, the ρ=0,1,2,...,P-1, the i=0,1,2 ,...,N-1;

In the i-th time slot, the code division multiplexing sequence obtained in the case of _{m cs} =ρ is P ACK sequences, and the code division multiplexing sequence obtained in the case of _{m cs =ρ+P is P} NACK sequence;

Or, in the i-th time slot, the code division multiplexing sequence obtained in the case of _{m cs} =ρ is P NACK sequences, and the code division multiplexing sequence obtained in the case of _{m cs =ρ+P} Is P ACK sequences;

The code division multiplexing sequence generated when m _cs =ρ and the code division multiplexing sequence generated when m _cs =ρ+P form a code division multiplexing sequence pair; When allocating to devices, they are allocated in the order of ρ=0, 1, 2, ..., P-1.

In the embodiment of the present application, by changing the relative order of the ACK sequence and the NACK sequence in the same time slot, the interference during the feedback sequence between the multicast time slot and the unicast time slot is reduced.

In the i-th time slot, _{the code division multiplexing sequence obtained in the case of m q} =0 is P consecutive ACK sequences with index labels, and the code division multiplexing sequence obtained in the case of _{m q ＝P} Are P NACK sequences with consecutive index labels;

Or, in the i-th time slot, _{the code division multiplexing sequence obtained in the case of m q} =0 is P NACK sequences with consecutive index labels, and the code division multiplexing sequence obtained in the case of _{m q =P} Use the sequence as P consecutive ACK sequences with index labels;

When the values of ρ are equal, the _{code division multiplexing sequence generated when m q} =0 and the code division multiplexing sequence _{generated when m q} ＝P form a code division multiplexing sequence pair; When the generated P sequence pairs are allocated to the device, they are allocated in the order of ρ=0, 1, 2, ..., P-1.

On the basis of the previous embodiment, the embodiment of the present application further changes the relative order of the ACK sequence and the NACK sequence in the same time slot to reduce the interference caused by the feedback sequence between the multicast time slot and the unicast time slot. At the same time, the mutual interference between the ACK sequence and the NACK sequence in the same time slot is reduced.

In one of the implementation manners, the first data is received by the first terminal device on a plurality of subchannels, and the first terminal device sends the data to the first time-frequency resource according to the first data. The second terminal device sends the first response sequence, including:

In the case that the communication between the second terminal device and the first terminal device is unicast communication, the first terminal device selects one sub-channel from the plurality of sub-channels according to the first data. Sending the first response sequence to the second terminal device on the first time-frequency resource;

Alternatively, in a case where the communication between the second terminal device and the first terminal device is unicast communication, the first terminal device occupies the plurality of sub-channels in the first data according to the first data. Sending the first response sequence to the second terminal device on a time-frequency resource.

In one of the implementation manners, the first data is received by the first terminal device on a plurality of sub-channels, and when the first data is multicast data, the receiving device to which the multicast belongs The sequence in which each device responds to the first data occupies the multiple sub-channels for transmission;

Or, in a case where the first data is multicast data, each of all receiving devices of the multicast occupies one of the multiple subchannels to send in response to the sequence of the first data.

In the above two embodiments, for data channels using multiple subchannels, the response sequence mapping methods are designed for unicast and multicast respectively. In a multicast time slot, only one subchannel is occupied to send the response sequence to achieve multicast expansion.

In a second aspect, an embodiment of the present invention provides a communication method. The method includes: a second terminal device sends first data to a first terminal device in a first time slot; the first time slot is N time slots In one of the time slots, the N is an integer greater than or equal to 1;

The second terminal device receives a first response sequence sent by the first terminal device based on the first data on a first time-frequency resource, where the first response sequence is allocated among M code division multiplexing sequences For one of the sequences of the first time slot, the M code division multiplexing sequences are used to respond to the data sent on the N time slots on the first time-frequency resource, and the M is all The integer multiple of N.

r(n)=γ*e ^{-j*(2*π/M)*n} , n=0,1,2,3,...,M-1,

Wherein, said ρ=0,1,2,...,P-1;

In one of the implementation manners, the second terminal device sending the first data to the first terminal device in the first time slot includes: the second terminal device occupies a plurality of sub-channels in the first time slot to transmit the first data to the first terminal device. The first terminal device transmits the first data.

For the beneficial effects of any of the methods described in the second aspect, reference may be made to the description in the first aspect, which will not be repeated here.

In a third aspect, an embodiment of the present invention provides a terminal device. The terminal device may also be a communication device. The terminal device includes: a receiving unit configured to receive first data from a second terminal device in a first time slot ; The first time slot is one of N time slots, and the N is an integer greater than or equal to 1;

The sending unit is configured to send a first response sequence to the second terminal device on a first time-frequency resource according to the first data, where the first response sequence is allocated to the M code division multiplexing sequence One of the sequences of the first time slot, the M code division multiplexing sequences are used to respond to the data sent on the N time slots on the first time-frequency resource, and the M is the time of the N Integer multiples.

r(n)=γ*e ^{-j*(2*π/M)*n} , n=0,1,2,3,...,M-1,

Wherein, said ρ=0,1,2,...,P-1;

In one of the implementation manners, the first data is received by the terminal device on multiple sub-channels, and the sending unit is specifically configured to:

In a case where the communication between the second terminal device and the terminal device is unicast communication, select one sub-channel from the plurality of sub-channels based on the first data to be on the first time-frequency resource Sending the first response sequence to the second terminal device;

Or, in a case where the communication between the second terminal device and the terminal device is unicast communication, occupying the multiple subchannels according to the first data to the first time-frequency resource The second terminal device transmits the first response sequence.

In one of the implementation manners, the first data is received by the terminal device on a plurality of sub-channels. In the case that the first data is multicast data, the multicast data in the receiving device to which the multicast belongs The sequence in which each device responds to the first data occupies the multiple sub-channels for transmission;

For the beneficial effects of the method described in any one of the third aspect, reference may be made to the description in the first aspect, which will not be repeated here.

In a fourth aspect, an embodiment of the present application provides a terminal device. The terminal device may also be a communication device. The terminal device includes: a sending unit configured to send first data to the first terminal device in a first time slot; The first time slot is one time slot of N time slots, and the N is an integer greater than or equal to 1;

The receiving unit is configured to receive a first response sequence sent by the first terminal device according to the first data on the first time-frequency resource, where the first response sequence is allocated to M code division multiplexing sequences One of the sequences of the first time slot, the M code division multiplexing sequences are used to respond to the data sent on the N time slots on the first time-frequency resource, and the M is the An integer multiple of N.

r(n)=γ*e ^{-j*(2*π/M)*n} , n=0,1,2,3,...,M-1,

Wherein, said ρ=0,1,2,...,P-1;

In one of the implementation manners, the sending unit is specifically configured to: occupy multiple subchannels in the first time slot to send the first data to the first terminal device.

For the beneficial effects of the method described in any one of the fourth aspect, reference may be made to the description in the first aspect, which will not be repeated here.

In a fifth aspect, an embodiment of the present invention provides a terminal device. The terminal device may also be a communication device. The terminal device includes a processor, a transmitter, a receiver, and a memory. The memory is used to store computer programs and / Or data, the processor is configured to execute a computer program stored in the memory, so that the terminal device performs the following operations:

Receiving the first data from the second terminal device on the first time slot by the receiver; the first time slot is one time slot of N time slots, and the N is an integer greater than or equal to 1;

According to the first data, a first response sequence is sent to the second terminal device through the transmitter on a first time-frequency resource, where the first response sequence is allocated to the second terminal device among M code division multiplexing sequences. One of the sequences of the first time slot, the M code division multiplexing sequences are used to respond to the data sent on the N time slots on the first time-frequency resource, and the M is the time of the N Integer multiples.

r(n)=γ*e ^{-j*(2*π/M)*n} , n=0,1,2,3,...,M-1,

Wherein, said ρ=0,1,2,...,P-1;

In one of the implementation manners, the sending a first response sequence to the second terminal device through the transmitter on the first time-frequency resource according to the first data includes

In a case where the communication between the second terminal device and the terminal device is unicast communication, select one sub-channel from the plurality of sub-channels based on the first data to be on the first time-frequency resource Sending the first response sequence to the second terminal device through the transmitter;

Or, in the case that the communication between the second terminal device and the terminal device is unicast communication, occupying the plurality of subchannels according to the first data to pass through the first time-frequency resource The transmitter transmits the first response sequence to the second terminal device.

For the beneficial effects of the method described in any one of the fifth aspect, reference may be made to the description in the first aspect, which will not be repeated here.

In a sixth aspect, an embodiment of the present invention provides a terminal device. The terminal device may also be a communication device. The terminal device includes a processor, a transmitter, a receiver, and a memory. The memory is used to store computer programs and / Or data, the processor is configured to execute a computer program stored in the memory, so that the terminal device performs the following operations:

Sending the first data to the first terminal device in the first time slot by the transmitter; the first time slot is one time slot in N time slots, and the N is an integer greater than or equal to 1;

The first response sequence sent by the first terminal device on the first time-frequency resource according to the first data is received by the receiver, where the first response sequence is allocated to M code division multiplexing sequences One of the sequences of the first time slot, the M code division multiplexing sequences are used to respond to the data sent on the N time slots on the first time-frequency resource, and the M is the An integer multiple of N.

r(n)=γ*e ^{-j*(2*π/M)*n} , n=0,1,2,3,...,M-1

Wherein, said ρ=0,1,2,...,P-1;

In one of the implementation manners, the sending the first data to the first terminal device in the first time slot by the transmitter includes: occupying a plurality of sub-channels in the first time slot by the transmitter to send the first data to the first terminal device. The first terminal device transmits the first data.

For the beneficial effects of the method according to any one of the sixth aspect, please refer to the description in the first aspect, which will not be repeated here.

In a seventh aspect, an embodiment of the present invention provides a communication system, which includes a first terminal device and a second terminal device, wherein the first terminal device is the terminal device according to any one of the above third aspects, The second terminal device is the terminal device according to any one of the foregoing fourth aspects.

In an eighth aspect, an embodiment of the present invention provides a communication system including a first terminal device and a second terminal device, wherein the first terminal device is the terminal device according to any one of the fifth aspects, The second terminal device is the terminal device according to any one of the above-mentioned sixth aspects.

In a ninth aspect, an embodiment of the present invention provides a computer-readable storage medium or a non-volatile storage medium, the computer-readable storage medium or the non-volatile storage medium stores a computer program, and the computer program is Execute to realize the communication method according to any one of the above-mentioned first aspect.

In a tenth aspect, an embodiment of the present invention provides a computer-readable storage medium or a non-volatile storage medium, the computer-readable storage medium or the non-volatile storage medium stores a computer program, and the computer program is Execute to realize the communication method according to any one of the above-mentioned second aspect.

In an eleventh aspect, an embodiment of the present invention provides a computer program product. When the computer program product is read and executed by a computer, the communication method according to any one of the foregoing first aspect or any one of the foregoing second aspect Will be executed.

In a twelfth aspect, an embodiment of the present invention provides a computer program that, when the computer program is executed on a computer, will enable the computer to implement any one of the above-mentioned first aspect or any one of the above-mentioned second aspect Communication method.

In a thirteenth aspect, an embodiment of the present invention provides a communication chip including a processor and a communication interface, and the communication chip is configured to execute any one of the foregoing first aspect or any one of the foregoing second aspect. method.

In summary, through the method of the foregoing embodiment, a method in which N time slots share a time-frequency resource to send a response sequence to received data is designed. This solution achieves the purpose of code division multiplexing by using phase rotation in the frequency domain or cyclic shift in the time domain. So that each time slot can be allocated to the corresponding response sequence. When unicast, multicast, and broadcast coexist in the same resource pool, no additional signaling overhead is needed, and corresponding time-frequency resources are allocated for each time slot in advance. In addition, considering that the response sequence sent by the device in multicast or broadcast has a certain consistency, the NACK and ACK sequences in the response sequence corresponding to a feedback time slot are designed to be continuous respectively to reduce the interference between the NACK and ACK sequences.

Description of the drawings

FIG. 1 is a schematic diagram of the system architecture used by the communication method provided by the embodiment of the solution;

FIG. 2 is a schematic diagram of the interaction flow of the communication method provided by the embodiment of the solution;

FIG. 3 is a schematic diagram of the system frame structure in the communication method provided by the embodiment of the solution; FIG.

4 is a schematic diagram of phase rotation in the communication method provided by the embodiment of the solution;

FIG. 5 is a schematic diagram of the phase distribution of the sequence in the communication method provided by the embodiment of the solution; FIG.

6 is a schematic diagram of the phase distribution of another sequence in the communication method provided by the embodiment of the solution;

FIG. 7 is a schematic diagram of the phase distribution of another sequence in the communication method provided by the embodiment of the solution; FIG.

FIG. 8 is a schematic diagram of a logical structure of a terminal device provided by an embodiment of the application;

FIG. 9 is a schematic diagram of the hardware structure of a terminal device provided by an embodiment of the application;

10 is a schematic diagram of the logical structure of another terminal device provided by an embodiment of the application;

11 is a schematic diagram of the hardware structure of another terminal device provided by an embodiment of the application;

FIG. 12 is a schematic structural diagram of a communication chip provided by an embodiment of this application.

Detailed ways

In order to enable those skilled in the art to better understand the solutions of the present invention, the technical solutions in the embodiments of the present application will be described below in conjunction with the drawings in the embodiments of the present application.

The following first describes an exemplary system architecture to which a communication method provided in an embodiment of the present invention is applicable. Referring to FIG. 1, the system architecture shown in FIG. 1 includes multiple vehicle devices, and the multiple vehicle devices can communicate with each other in a unicast, multicast, or broadcast manner. For example, in Figure 1, device 1 sends data to device 2, device 3, and device 4 respectively. After receiving the data, device 2, device 3, and device 4 will decode the data, and if the decoding is correct, send the decode to device 1. The correct response information is an acknowledge character (acknowledge character, ACK), and if it is decoded incorrectly, the response message of the decoded error, that is, a negative acknowledge character (NACK), is sent to the device 1.

The embodiments of the present invention can not only be applied to V2V scenarios of vehicle-to-vehicle communication, but also applicable to scenarios such as vehicle-to-pedestrian communications V2P, vehicle-to-infrastructure communications V2I, and other vehicle networking scenarios. In addition, the embodiments of the present invention can also be applied to scenarios of the Internet of Things such as the communication V2N between the car and the network and the interconnection of home appliances.

The communication device in the embodiment of the present invention may include a vehicle-mounted communication module or other embedded communication modules, or a handheld communication device, including mobile phones, tablet computers, etc., and may also include roadside units (RSU), household appliances, etc. Devices in the network.

Based on the foregoing description, the communication method provided by the embodiments of the present application will be described below with reference to the accompanying drawings.

Refer to FIG. 2 for a schematic diagram of the interaction flow of the communication method provided by the embodiment of the present application. The method described in Figure 2 may include the following steps:

Step 201: The second terminal device sends the first data to the first terminal device.

Specifically, the second terminal device may send the above-mentioned first data to the first terminal device in a first time slot, where the first time slot is a time slot among N time slots, and the N time slots are transmission time slots. The N is an integer greater than or equal to 1.

In a specific embodiment, the first terminal device and the second terminal device in the foregoing steps may be the vehicle equipment shown in FIG. 1, or may be the devices in the Internet of Vehicles or the Internet of Things described above.

Step 202: The first terminal device receives the above-mentioned first data sent by the second terminal device.

Step 203: The first terminal device sends a first response sequence to the second terminal device on the first time-frequency resource according to the first data, where the first response sequence is allocated to the second terminal device among the M code division multiplexing sequences. One of the sequences of a time slot, the M code division multiplexing sequences are used to respond to the data sent in the N time slots on the first time-frequency resource, and the M is an integer multiple of the N.

Specifically, the first terminal device decodes the first data to obtain a decoding result, and then sends a first response sequence to the second terminal device on the first time-frequency resource according to the decoding result.

Step 204: The second terminal device receives the first response sequence.

In a specific embodiment, the aforementioned N time slots may be N consecutive sending units in the time domain, or logically consecutive N sending units. The sending unit may be 1 subframe, or a time slot, or other time-frequency resources configured by the system for one transmission. The above-mentioned specific value of N can be configured by a system such as a sidelink (SL) system according to actual conditions, and this solution does not limit this.

In a specific embodiment, the foregoing M code division multiplexing sequences may be allocated to N time slots by the base station according to an allocation rule when the network is deployed. Or it can be configured to the N time slots according to a specific protocol when the network is deployed. Or it can be allocated through the base station in the later stage after the network deployment is completed. It can also be configured according to a specific protocol later after the network deployment is completed. The specific allocation time and who will allocate the allocation can be determined according to the specific situation, and this plan is not limited.

When a device sends data in the N time slots, the device that receives the data can use the above-mentioned pre-allocated sequence to reply whether the data is correctly decoded. In the embodiment of the present application, by pre-allocating the specified response sequence in the specified time-frequency resource, the network device does not need to issue resource scheduling control signaling, thereby saving network overhead.

It should be noted that in the following description, the device that receives data in the above N time slots may be the first terminal device described in FIG. 2 above, and the device that sends data in the N time slots may be the above The second terminal device described in FIG. 2.

The following describes how to allocate response sequences on the above N time slots.

Refer to the schematic diagram of the system frame structure shown in FIG. 3. In Fig. 3, a schematic diagram of the frame structure at N=1, 2, 4 is exemplarily given. Among them, the timeslots labeled a are the above N timeslots. In these timeslots, the sidelink physical layer shared channel (physical sidelink share channel, PSSCH) can be used to transmit the side link shared information, and the side link shared information can also be transmitted through the side link physical layer shared channel (PSSCH). The uplink physical layer control channel (physical sidelink coNtrol channel, PSCCH) transmits side link control information. The time slot labeled c is the time slot allocated by the system for sending the result response of whether the received data is correctly decoded through the physical sidelink feedback channel (PSFCH) of the test link physical layer feedback channel in the time slot. Labeled b is the gap between time slot a and time slot c.

In Figure 3, it can be found that the system has allocated a PSFCH for the above N time slots, which is used for the data sent in the above N time slots (for ease of description below, the data sent in the above N time slots are called target data). ) Responds, that is, the response information sent by one or more devices in response to receiving the target data is sent in the same time-frequency resource (the time-frequency resource may be the first time-frequency resource described in FIG. 2 above). Considering that different communication systems can coexist, N timeslots are defined as logically continuous timeslots, and the mapping relationship between N timeslots and their corresponding feedback resources is configured or pre-configured by the system. The corresponding feedback resource includes the time-frequency resource for transmitting the response information of the target data. Then, in order to make full use of the time-frequency resource to send the response information, the embodiment of the present application adopts a code division multiplexing manner to send the response information on the time-frequency resource.

In addition, the data transmission mode in the above N time slots may be one or more of unicast, multicast, and broadcast. For example, each of the N time slots can use unicast, multicast, or broadcast to transmit data, or some time slots can use unicast, and some time slots can use multicast to transmit data. Data transmission, or other combinations of using the three data transmission methods to transmit data. Since the system cannot predict whether the information to be transmitted in a time slot in the future will be unicast, multicast or broadcast, if the frequency division method is used to allocate feedback time-frequency resources for each time slot, then when the data in a time slot is When the transmission mode is broadcast, that is, there is no need to respond to the received data, which will cause a waste of time-frequency resources. If the code division multiplexing method is used to allocate the corresponding time-frequency resource for each time slot, when one or more of the N time slots is broadcast or there is no signal transmission, the N time slots are Other time slots carrying unicast or multicast services can use all the time-frequency resource bandwidth, especially if only one of the N time slots needs to feedback the response sequence, it is equivalent to that the receiving device on this time slot can Exclusive use of the first time-frequency resource, thereby maximizing the use of the time-frequency resource.

In the embodiment of the present application, a code division multiplexing sequence is used as the above response sequence, and different sequences are used to respond to different information. Similar to the sequence of format 0 in the five formats of the NR physical uplink control channel (PUCCH), this embodiment also uses a low peak-to-average ratio zadoff-chu sequence as the base sequence. And by performing a cyclic shift in the time domain based on a base sequence, different sequences are obtained as response sequences, or it can be said that phase rotation is performed in the frequency domain based on a base sequence to obtain sequences with different phases as response sequences. This is because according to the nature of the signal in the time and frequency domain, the phase rotation of a signal in the frequency domain is equivalent to the cyclic shift of the signal in the time domain.

When performing phase rotation, it is necessary to consider whether multiple sequences will interfere with or alias each other when they are transmitted on the same time-frequency resource. Theoretically, 360° of the phase domain can be divided into infinite parts as long as they can be distinguished in phase. However, due to the existence of the channel multipath effect, a transmission signal is caused to extend in the time domain at the receiving end, which will cause the signal to be shifted in phase. Then when multiple signals are not sufficiently distinguished in phase, the phase rotation It will cause aliasing of multiple users, that is, seriously affect its detection probability. Therefore, when a sequence is multiplexed by phase rotation, the maximum number of multiplexable sequences needs to consider the maximum transmission delay caused by its channel characteristics and communication range.

Based on the above-mentioned phase rotation theory, the sequence obtained by performing phase rotation on a base sequence in the frequency domain can be called a phase quadrature sequence. If these phase-orthogonal sequences are multiplexed onto the same time-frequency resource for transmission, then these phase-orthogonal sequences can be called code division multiplexing sequences.

In the embodiment of the present application, the phase orthogonality of the two sequences does not necessarily require that the phase difference between the two sequences is 90 degrees. As long as the two sequences can be distinguished and correctly detected at the receiving end, then the two sequences are The phase can be said to be orthogonal.

In order to facilitate the understanding of the above-mentioned concept of phase rotation, reference may be made to the schematic diagram of phase rotation exemplarily shown in FIG. In Figure 4, assuming that the initial phase of the base sequence is 0, and 12 sequences can be code-division multiplexed on the same channel, the phase difference between two adjacent sequences of the 12 sequences is 2π/12= π/6. Well. On the basis that the phase of the base sequence is 0, perform phase rotation of 1 times π/6, 2 times π/6, 3 times π/6, ..., 11 times π/6 to obtain other code division multiplexed sequences.

The following uses a subchannel as an example to illustrate how to allocate response sequences in the above N time slots.

In the embodiment of this application, assuming that on a time domain symbol of a subchannel, according to the above phase rotation method, the total number of sequences that can be multiplexed theoretically is M', but because each device that receives the data Two sequences need to be allocated. One sequence is used to reply to the correct decoded confirmation message (ACK) when the data is decoded correctly, and the other is used to reply the decoded error message (NACK) when the data is decoded incorrectly . In addition, in an embodiment, it is designed that the M'sequences can be evenly allocated to the above N time slots, then the number of response sequences actually available for the subchannel is M=floor(M'/(2*N ))*2*N. Among them, floor is a "round down" function, that is, an integer not greater than M'/(2*N). For example, if it is assumed that M'=17 and N=2, then M'/(2*N)=4.25, then floor(M'/(2*N))=4. This is only an exemplary description, and the specific values of M'and N are determined according to actual conditions. However, in this solution, the value of M can be a positive even number greater than or equal to 2.

Assuming that the base sequence multiplexed in the above-mentioned sub-channel sequence is γ, then the M sequences multiplexed in the above-mentioned sub-channel can be expressed as:

r(n)=γ*e ^{-j*(2*π/M)*n} , n=0,1,2,3,...,M-1 (1) where the N represents the M sequences The index label.

The M sequences multiplexed in the above sub-channels can also be expressed as:

r(n)=γ*e ^-j*θ*n , n=0,1,2,3,...,M-1 (2) where the θ=2*π/M. From the above formula, it can be known that the phase difference between the two sequence sequences r(j) and sequence r(j+1) adjacent to the index labels of any two sequences is θ. For example, the phase difference between the sequence r(0) and the sequence r(1) is θ. Among them, j here can take the

value

0,1,2,...,M-2.

In an embodiment, the M sequences multiplexed on the subchannels are equally allocated to the N time slots for use by the equipment that receives the data sent on the N time slots, then each The number of sequences obtained by the allocation of time slots is M/N. In addition, since each device that receives data on the above N time slots needs to allocate two sequences as response sequences, the M/N sequences allocated on each time slot can be divided into P=M/(2*N ) Sequence pairs can be used to allocate to P devices. Each of the P sequence pairs includes an ACK sequence and a NACK sequence. That is, among the M/N sequences allocated in each time slot, P sequences are ACK sequences and P NACK sequences.

Based on the above description, assuming that i is used to represent the time slot number of the above N time slots, then i=0,1,2,...,N-1. In an implementation manner, the M/N sequences obtained by the allocation of the i-th time slot among the above N time slots can be expressed as:

Wherein, the above-mentioned m ₀ represents the initial phase of the above-mentioned base sequence γ, and _{the value of m 0} may be configured by the system or the network side. The value of m ₀ can also be configured as 0 by default. In this case, the M/N sequences allocated by the i-th time slot among the above N time slots are expressed as:

It should be noted that 2*π/M in the above formula (3) and formula (4) can be expressed by the above θ.

According to the above formula (3) or formula (4), it can be seen that the M/N sequences allocated by the i-th time slot of the above N time slots are the consecutive index numbers of the M sequences multiplexed in the above subchannels sequence. In addition, the M/N sequences allocated by the i+1th time slot among the above N time slots are the M/N sequences allocated by the i-th time slot among the above N time slots. The sequence after 2P is added to the index label. For example, assuming that M=16 and N=2, each of the above N time slots is allocated to obtain 8 sequences. Then the 8 sequences obtained by the allocation of the i=0th time slot among the N time slots are the 8 sequences with the index number N=0,1,2,3,4,5,6,7, the N time slots The 8 sequences obtained by the allocation of the i=1 time slot are the 8 sequences of index number N=8,9,10,11,12,13,14,15. Of course, 4 of the 8 sequences allocated for each time slot are ACK sequences, and the other 4 are NACK sequences. This is only an exemplary description, and the specific values of M and N are determined according to actual conditions, and this solution does not impose restrictions on this.

In a possible implementation manner, the M/N sequences allocated in the i-th time slot of the above N time slots are the basis of the above sequence multiplexed in the M sequences of the above subchannels with consecutive index numbers. Above, among the M/N sequences allocated for each time slot, M/(2*N), that is, P ACK sequences are also sequences with consecutive index labels in the above M sequences. Similarly, P NACK sequences are also the above A sequence with consecutive index labels among M sequences. In addition, P ACK sequences and P NACK sequences can form P sequence pairs.

For example, based on the previous example, in the sequence of 8 index numbers N = 0,1,2,3,4,5,6,7 allocated by the i = 0th time slot among N time slots, the index number The sequence of N=0,1,2,3 is the ACK sequence, the sequence of the index number N=4,5,6,7 is the NACK sequence, of course, the sequence of the index number N=0,1,2,3 is NACK sequence, the sequence with index number N=4, 5, 6, 7 is ACK sequence. Then index numbers 0 and 4 can form a sequence pair, index numbers 1 and 5 can form a sequence pair, index numbers 2 and 6 can form a sequence pair, and index numbers 3 and 7 can form a sequence pair. Or it can be other combinations to form 4 sequence pairs. This is only an exemplary description, and the specific order depends on the actual situation, and this solution does not limit this.

In a specific embodiment, in the case where the index numbers of the ACK sequence and the NACK sequence allocated in each time slot are consecutive, the M/N time slots allocated from the i-th time slot among the above N time slots The sequence can be expressed as:

Among them, ρ=0,1,2,...,P-1. Or, in _{the case where the value of m 0} is configured as 0 by default, the M/N sequences allocated by the i-th time slot among the above N time slots can be expressed as:

It should be noted that 2*π/M in the above formula (5) and formula (6) can be expressed by the above θ.

According to the above formula (5) or formula (6), in the above i-th time slot, _{the sequence calculated under the condition of m cs} =ρ is a sequence of P consecutive index labels, where m _cs =ρ+P In the case of, the calculated sequence is another P consecutive sequences with index labels. The _{calculated sequence in the case of m cs} =ρ is the ACK sequence, and the calculated sequence in _{the case of m cs} =ρ+P is the NACK sequence. Alternatively, _{the sequence calculated in the case of m cs} =ρ is the NACK sequence, and the sequence calculated in the case of m _cs =ρ+P is the ACK sequence. The specific sorting distribution here is determined according to the actual situation, and this solution does not impose restrictions on this.

In addition, the _{response sequence generated when m cs} =ρ and the response sequence generated when m _cs =ρ+P form a response sequence pair.

In a specific embodiment, the above formula (5) can be decomposed into two formulas, which respectively represent the formulas of the ACK sequence and the NACK sequence. The formula obtained by decomposing formula (5) is as follows:

Through the above formula (7) and formula (8), P sequences with consecutive index labels in the above M sequences are obtained respectively. Similarly, the P sequences obtained by formula (7) are ACK sequences, and the sequences obtained by formula (8) are NACK sequences. It may also be that the P sequences obtained by formula (7) are NACK sequences, and the sequences obtained by formula (8) are ACK sequences. The specific sorting distribution is determined according to the actual situation, and this solution does not impose restrictions on this.

In order to facilitate the understanding that the M/N sequences allocated for each of the above N time slots are sequences with consecutive index labels, and the index labels of the P ACK sequences and NACK sequences in the M/N sequence sequences are continuous, respectively, See Figure 5. FIG. 5 exemplarily shows a schematic diagram of the phase distribution of the sequence calculated by the above formula (5) or formula (6) or by formula (7) and formula (8) when _{the above m 0 is configured as 0.}

It can be seen in Figure 5 that the ACK sequence and the NACK sequence in each slot are continuous. Specifically, the index numbers of P NACK sequences in time slot 0 are 0,1,2,...,P-1, and the index numbers of P ACK sequences are P,P+1,P+2,...,2P -1. The index numbers of P NACK sequences in time slot 1 are 2P, 2P+1, 2P+2,..., 3P-1, and the index numbers of P ACK sequences are 3P, 3P+1, 3P+2,..., 4P-1. In addition, the sequence with index number 0 and phase 0 in Fig. 5 is the base sequence, because each subsequent sequence is obtained from the base sequence after phase rotation in the frequency domain, and the sequence obtained by phase rotation is It is obtained by offsetting 2*π/M on the basis of the previous sequence, so the phase difference between every two adjacent sequences is θ=2*π/M.

In addition, in Figure 5, it can be seen that the first sequence in each time slot is calculated when ρ = 0, and the first sequence of the P ACKs and P NACKs in each time slot is also at the beginning. Calculated when ρ=0.

In a possible implementation manner, the M/N sequences obtained by the i-th time slot allocation among the above N time slots are P sequence pairs, and each sequence pair can be determined by the above formula (7) and formula ( 8) When ρ is the same, it is composed of two sequences calculated at the time. That is, when ρ=0, the two sequences calculated by the above formula (7) and formula (8) are a sequence pair, that is, when ρ=1, the two sequences calculated by the above formula (7) and formula (8) are A sequence pair, and so on, until ρ=P-1, the two sequences calculated by the above formula (7) and formula (8) are a sequence pair, thereby obtaining P sequence pairs.

In a specific embodiment, after the above P sequence pairs are allocated to the i-th time slot, when a device sends data to multiple devices in the i-th time slot, ρ=0, 1, 2, ... , P-1 calculates the sequence of the sequence pairs to allocate the sequence pairs to the multiple devices for feeding back the response sequence to the device sending the data. For example, suppose 1 sends data to device 2 and device 3 in the i-th time slot, then the sequence pair calculated by ρ=0 can be allocated to device 2, and the sequence pair calculated by ρ=1 can be allocated to device 3. .

Based on the above method, sequence pairs can be allocated to devices in the order of sequence pairs calculated by ρ=0,1,2,...,P-1 for feeding back the response sequence to the device sending data. Two methods are introduced below. Possible optimized embodiments. These two embodiments are based on the above-mentioned sequence allocation embodiment, which can reduce the interference between sequences sent on the same time-frequency resource to a certain extent.

In the first possible embodiment, assuming that the i-th time slot among the above N time slots is a multicast transmission mode, and the i+1-th time slot is a unicast transmission mode, then at the i+1-th time slot The sequence used for feedback allocated by the device that receives the data in the slot is a sequence pair calculated when ρ=0 on the time slot. According to the sequence allocation method shown in Figure 5, the phase of the sequence fed back by the device that receives the data in the i+1th time slot is closer to the phase of the last sequence of the response sequence of the i-th time slot, that is, the phase The difference is small and it is easy to interfere with each other.

Then, in order to reduce this interference, when assigning the sequence allocated in each time slot to the device, it is not necessary to start with the smallest index label of the sequence and assign it from the smallest to the largest index label. You can start with the second index label of the sequence. Start with the sequence of the smallest or the third smallest or the fourth smallest, etc., and then allocate from smallest to largest according to the index label, until the sequence with the largest index label in the time slot is allocated, and then start from the sequence with the smallest index label and start with the smallest index label To the large allocation, until all the sequences are allocated.

A possible solution to the above-mentioned interference is given as an example below. First, the above m ₀ =P/2 can be configured, then the M/N sequences obtained by the allocation of the i-th time slot among the above N time slots can be expressed as:

It should be noted that 2*π/M in the above formula (9) can be expressed by the above θ.

In the above i-th time slot, the response sequence obtained in the case of _{m cs} _{=ρ is P ACK sequences, and the response sequence obtained in the case of m cs} =ρ+P is P NACK sequences. Or, in the i-th time slot, the response sequence obtained in the case of _{m cs} _{=ρ is P NACK sequences, and the response sequence obtained in the case of m cs} =ρ+P is P ACK sequences.

The _{response sequence generated when m cs} =ρ and the response sequence generated when m _cs =ρ+P form a response sequence pair; when the P sequence pairs generated above are allocated to the device, the above-mentioned ρ=0,1 , 2, ..., P-1 are allocated in sequence.

Of course _{, the value of m 0} can also be configured to other values, such as m ₀ =3P/2, etc. _{The value range of m 0} can be an integer greater than or equal to 1, but less than 2*P and not equal to P. The specific value can be determined according to the actual situation, and this solution does not limit this.

For ease of understanding, refer to Figure 6. Figure 6 uses "In the above i-th time slot, the response sequence obtained in the case of _{m cs} _{=ρ is P NACK sequences, and the response sequence obtained in the case of m cs} =ρ+P is P ACK sequences. "This situation exemplifies the process of assigning a sequence.

As can be seen in Figure 6, the sequence assigned to the device by formula (9), the index labels of the P ACK sequences in time slot 0 are no longer continuous, because when the sequence is allocated, it is no longer from the index. The sequence labeled 0 is allocated starting from the sequence labeled Q (Q can be m ₀ ), but in order to reduce the interference between NACK and ACK, try to make the NACK sequence and the ACK sequence have their respective index labels consecutive the sequence of. Since this scheme first allocates from the NACK sequence, the index numbers of the NACK sequence are still continuous. Assign P sequences starting from the index number Q as NACK sequences, and the index number of the last sequence of the P sequences is Q+P-1. Then start to allocate the ACK sequence, starting from Q+P, when the sequence with the largest index label in the time slot is allocated, return to the sequence with the index label of 0 and continue to allocate until P ACK sequences.

The allocation process in other time slots such as time slot 1 is similar to the allocation process to equipment in time slot 0 described above, and will not be repeated here. With this design, the sequence in each time slot is still a sequence with consecutive index labels, but the NACK sequence and ACK sequence in the time slot will have a set of sequences that are not consecutive sequences with index labels.

Still referring to Figure 6, when a device sends data in a multicast manner in time slot 0 and sends data in a unicast manner in time slot 1, if the device that receives the data in time slot 1 decodes the data incorrectly, Then, the NACK sequence with the index number 2P+Q can be allocated as the response sequence. The minimum phase difference between the 2P+Q NACK sequence and the sequence in slot 0 is θ*(2P+Q-(2P-1))=θ*(Q+1). Compared with Figure 5, it can be seen that the phase interval is increased by θ*Q, thereby reducing interference and increasing the probability of correct sequence detection.

In addition, if the device that received the data in the time slot 1 decodes the data correctly, the ACK sequence with the index number Q+3P can be assigned as the response sequence. The minimum phase difference between the Q+3P ACK sequence and the sequence in slot 0 is θ*(Q+3P-(2P-1))=θ*(P+Q+1). Compared with Figure 5, it can be seen that the phase interval also greatly increases θ*Q, thereby reducing interference and increasing the probability of correct sequence detection.

Of course, the foregoing is only an exemplary introduction, and there are other possible implementation manners, which are not listed here.

The second possible embodiment. In the first possible embodiment mentioned above, although the interference between the sequences between the time slots is reduced in the example of FIG. 6, the index numbers of the ACK sequences are no longer continuous, so they are NACKed. The sequence separation increases the interference between the ACK sequence and the NACK sequence in the same time slot. In order to solve this problem, the arrangement of the ACK sequence and the NACK sequence in each time slot can be adjusted while ensuring that the interference of the sequence between the time slots is reduced, so that the index numbers of the ACK sequence and the NACK sequence are respectively continuous.

A possible solution to the above-mentioned problem is given as an example below. First of all, it is still possible to configure the above m ₀ =P/2, then the M/N sequences obtained by the i-th time slot allocation among the above N time slots can be expressed as

It should be noted that 2*π/M in the above formula (10) can be expressed by the above θ.

In the above i-th time slot, _{the response sequence obtained in the case of m q} =0 is P consecutive ACK sequences with index labels, and the response sequence obtained in the case of _{m q =P is P consecutive index labels} NACK sequence;

Or, in the i-th time slot, _{the response sequence obtained in the case of m q} =0 is P NACK sequences with consecutive index labels, and the response sequence obtained in the case of _{m q =P is P index labels} Continuous ACK sequence.

When the values of ρ are equal, _{the response sequence generated when m q} =0 and the response sequence generated when m _q ＝P form a response sequence pair; when the P sequence pairs generated above are allocated to the device, follow The above ρ=0, 1, 2, ..., P-1 are allocated in sequence.

same. In the embodiment of this application, _{the value of m 0} can also be configured as other values, such as m ₀ =P or m ₀ =3P/2, etc. _{The value range of m 0} can be greater than or equal to 1, but less than 2*P And is not equal to an integer of P. The specific value can be determined according to the actual situation, and this solution does not limit this.

In a specific embodiment, the above formula (10) can be decomposed into two formulas, which respectively represent the formulas of the ACK sequence and the NACK sequence. The formula obtained by decomposing formula (10) is as follows:

Through the above formula (11) and formula (12), P sequences with consecutive index labels in the above M sequences are obtained respectively. Similarly, the P sequences obtained by formula (11) are ACK sequences, and the sequences obtained by formula (12) are NACK sequences. It may also be that the P sequences obtained by formula (11) are NACK sequences, and the sequences obtained by formula (12) are ACK sequences. The specific sorting distribution is determined according to the actual situation, and this solution does not impose restrictions on this.

For ease of understanding, refer to Figure 7. Figure 7 takes "In the above i-th time slot, _{the response sequence obtained in the case of m q} =0 is P NACK sequences with consecutive index labels, and the response sequence obtained in the case of _{m q =P is P} The “ACK sequence with consecutive index labels” is an example of the process of allocating sequences.

It can be seen in Fig. 7 that in the sequence allocated to the device by formula (10), or formula (11) and formula (12), the index labels of the ACK and NACK sequences in each time slot are respectively continuous. However, the allocation of the sequence in FIG. 7 is different from the allocation of the sequence in FIG. 5. The following takes time slot 0 as an example for illustration.

In time slot 0 in Figure 5, when the sequence is allocated to the device for use, it is allocated from the sequence pair with index labels 0 and P in the order of the index labels from small to large, for example, first label the indexes with 0 and P The sequence pair of is allocated to device 1, and then the sequence pair with index number 1 and P+1 is allocated to device 2, and then the sequence pair with index number 2 and P+2 is allocated to device 3 and so on.

However, in time slot 0 of Fig. 7, when the sequence is allocated to the device for use, it is allocated from the sequence pair with the index number G and P+G in the descending order of the index label. When the sequence is allocated to the index label When it is a sequence pair of P-1 and 2P-1, it is possible to return to the sequence pair with index labels 0 and P to allocate in ascending order of index labels, until the sequence pairs in the time slot are allocated. For example, first assign the sequence pair with index labels G and P+G to device 1 for use, then assign the sequence pair with index labels G+1 and P+G+1 to device 2 for use, and then label the index as G The sequence pairs +2 and P+G+2 are allocated to device 3 for use, etc., after the sequence pairs with index numbers P-1 and 2P-1 are allocated to device w for use, return to the index number 0 and P The sequence pair is allocated to the device w+1 for use and so on.

The allocation process in other time slots such as time slot 1 is similar to the allocation process to equipment in time slot 0 described above, and will not be repeated here.

The value of the index label G in FIG. 7 can be calculated by (m ₀ mod P) mod M.

The embodiment of the present application can reduce the interference between the ACK sequence and the NACK sequence in the time slot while ensuring that the interference of the sequence between the time slots is reduced through the above sequence allocation method.

In one of the possible implementation manners, the signal bandwidth of each of the M code division multiplexing sequences is the same as the bandwidth of the first time-frequency resource, and the bandwidth of the first time-frequency resource is the same as the bandwidth of the first time-frequency resource. The bandwidth of the sub-channel where the resource is located is the same. . This design can make full use of resources, and can increase the probability of correct signal detection.

In one of the possible implementation manners, the device occupies multiple subchannels for transmission when sending data in the i-th time slot of the above N time slots, for example, it occupies K subchannels for transmission, where K is greater than or equal to 2. Integer. If the device occupies the K sub-channels to separately send the data to another device, that is, the communication between the device and the other device is unicast communication. In this case, after the other device receives the data, It is possible to choose to send a sequence in response to whether the data is decoded correctly to the above-mentioned device that sends the data on the K subchannels. The other device may also select one or more of the K sub-channels to send a sequence that responds to whether the data is decoded correctly to the device that sends the data. Of course, the response sequence sent by the other device to the device that sends the data is a sequence allocated to the other device based on the allocation method described above. For specific allocation, refer to the description of the foregoing method embodiment, which is not repeated here.

In one of the possible implementation manners, the device occupies multiple subchannels for transmission when sending data in the i-th time slot of the above N time slots, for example, occupies K subchannels for transmission. If the device occupies the K sub-channels to send the data to multiple devices, that is, the communication between the device and the multiple devices is multicast communication, that is, the data is multicast data. In this case, the Multiple devices may respectively occupy the K sub-channels to send a sequence that responds to whether the data is decoded correctly to the device that sends the data. This indicates that on the K subchannels, only P response sequences can be sent at most, because at most P pairs of sequence pairs are allocated on the i-th time slot, and each feedback sequence occupies K subchannels to send.

In another possible implementation manner, the above-mentioned multiple devices may also select one of the above-mentioned K sub-channels to send a sequence that responds to whether the data is decoded correctly to the above-mentioned device that sends the data. This indicates that at most K*P response sequences can be sent on the K subchannels. This implementation method increases the capacity of the device response sequence in the multicast transmission mode by means of frequency division multiplexing, and achieves the purpose of multicast expansion.

In another possible implementation manner, the above-mentioned multiple devices may also select more than one sub-channel on the above-mentioned K sub-channels to send a sequence that responds to whether the data is decoded correctly to the above-mentioned device that sends the data. The specific selection of occupying several sub-channels to transmit the sequence is determined according to the actual situation, and this solution does not limit it many times.

Of course, the response sequence sent by the multiple devices to the device that sends the data is a sequence allocated to the multiple devices based on the foregoing allocation method. For specific allocation, refer to the description of the foregoing method embodiment, which is not repeated here.

Through the method of the above-mentioned embodiment, a method is designed in which N time slots share a time-frequency resource to send a response sequence of whether the received data is decoded correctly. This solution achieves the purpose of code division multiplexing by using phase rotation in the frequency domain or cyclic shift in the time domain. So that each time slot can be allocated to the corresponding response sequence. When unicast, multicast, and broadcast coexist in the same resource pool, no additional signaling overhead is needed, and corresponding time-frequency resources are allocated for each time slot in advance. In addition, considering that the response sequences sent by devices in multicast or broadcast have a certain consistency, the NACK and ACK sequences in the response sequence corresponding to a feedback time slot are designed to be continuous to reduce the interference between NACK and ACK sequences.

The foregoing mainly introduces the solution provided by the embodiment of the present application from the perspective of interaction between terminal devices and how to allocate response sequences for the foregoing N time slots. It can be understood that, in order to realize the above-mentioned functions, each terminal device includes a hardware structure and/or software module corresponding to each function. Those skilled in the art should easily realize that in combination with the terminal devices and algorithm steps of the examples described in the embodiments disclosed herein, the present application can be implemented in the form of hardware or a combination of hardware and computer software. Whether a certain function is executed by hardware or computer software-driven hardware depends on the specific application and design constraint conditions of the technical solution. Professionals and technicians can use different methods for each specific application to implement the described functions, but such implementation should not be considered beyond the scope of this application.

The embodiment of the present application may divide the terminal device into functional modules according to the foregoing method examples. For example, each functional module may be divided corresponding to each function, or two or more functions may be integrated into one processing module. The above-mentioned integrated modules can be implemented in the form of hardware or software function modules. It should be noted that the division of modules in the embodiments of the present application is illustrative, and is only a logical function division, and there may be other division methods in actual implementation.

In the case of dividing each functional module corresponding to each function, FIG. 8 shows a schematic diagram of a possible logical structure of the first terminal device involved in the foregoing embodiment. The first terminal device 800 includes: a receiving unit 801 and a transmitting unit 801; Unit 802. Exemplarily, the receiving unit 801 is configured to support the first terminal device to perform the steps of receiving information in the method embodiment shown above. The sending unit 802 is configured to support the first terminal device to perform the steps of sending information in the foregoing method embodiment.

Optionally, the first terminal device 800 may further include a processing unit and a storage unit. The storage unit is used to store computer programs and data. The processing unit may call the computer program and/or data of the storage unit, so that the first terminal device 800 receives the first data from the second terminal device in the first time slot; the first time slot is one of the N time slots For a time slot, the N is an integer greater than or equal to 1; then, according to the first data, a first response sequence is sent to the second terminal device on the first time-frequency resource, where the first response sequence is One of the M code division multiplexing sequences allocated to the first time slot, and the M code division multiplexing sequences are used to respond to the N time slots on the first time-frequency resource For sent data, the M is an integer multiple of the N.

In terms of hardware implementation, the foregoing processing unit may be a processor or a processing circuit. The receiving unit 801 may be a transceiving unit, a transceiver, a receiver, or a receiving circuit or an interface circuit. The sending unit 802 may be a transceiving unit, a transceiver, a transmitter, or a sending circuit or an interface circuit. The aforementioned storage unit may be a memory. The foregoing processing unit, receiving unit, sending unit, and storage unit may be integrated or coupled together, or may be separated.

FIG. 9 shows a schematic diagram of a possible hardware structure of the first terminal device involved in the above-mentioned embodiments provided by the embodiments of this application. As shown in FIG. 9, the first terminal device 900 may include: one or more processors 901, one or more memories 902, a network interface 903, one or more receivers 905, one or more transmitters 906, and one Or multiple antennas 907. These components can be connected through a bus 904 or in other ways. FIG. 9 uses a bus connection as an example. among them:

The network interface 903 can be used for the first terminal device 900 to communicate with other communication devices, such as network devices. Specifically, the network interface 903 may be a wired interface.

The receiver 905 may also be used to perform reception processing on the mobile communication signal received by the antenna 907, such as signal demodulation. The transmitter 906 may be used to transmit the signal output by the processor 901, such as signal modulation. In some embodiments of the present application, the receiver 905 may be regarded as a wireless demodulator, and the transmitter 906 may be regarded as a wireless modulator. In the first terminal device 900, the number of receivers 905 may be one or more, and the number of transmitters 906 may also be one or more. The antenna 907 can be used to convert electromagnetic energy in a transmission line into electromagnetic waves in a free space, or convert electromagnetic waves in a free space into electromagnetic energy in a transmission line. The number of antennas 907 may be one or more.

The memory 902 may be coupled with the processor 901 through a bus 904 or an input/output port, and the memory 902 may also be integrated with the processor 901. The memory 902 is used to store various software programs and/or multiple sets of instructions or data. Specifically, the memory 902 may include a high-speed random access memory, and may also include a non-volatile memory, such as one or more magnetic disk storage devices, flash memory devices, or other non-volatile solid-state storage devices. The memory 902 may store an operating system (hereinafter referred to as the system), such as embedded operating systems such as uCOS, VxWorks, and RTLinux. The memory 902 may also store a network communication program, and the network communication program may be used to communicate with one or more additional devices, one or more user devices, and one or more network devices.

The processor 901 may be a central processing unit, a general-purpose processor, a digital signal processor, an application specific integrated circuit, a field programmable gate array, or other programmable logic devices, transistor logic devices, hardware components, or any combination thereof. It can implement or execute various exemplary logical blocks, modules, and circuits described in conjunction with the disclosure of this application. The processor may also be a combination for realizing certain functions, for example, including a combination of one or more microprocessors, a combination of a digital signal processor and a microprocessor, and so on.

In the embodiment of the present application, the processor 901 may be used to read and execute computer-readable instructions. Specifically, the processor 901 may be configured to call a program stored in the memory 902, such as a program for implementing the communication method provided by one or more embodiments of the present application on the first terminal device side, and execute instructions contained in the program.

It should be noted that the first terminal device 900 shown in FIG. 9 is only an implementation of the embodiment of the present application. In practical applications, the first terminal device 900 may also include more or fewer components, which is not limited here. . For the specific implementation of the first terminal device 900, reference may be made to the related description in the foregoing method embodiment, which will not be repeated here.

In the case of dividing each functional module corresponding to each function, FIG. 10 shows a schematic diagram of a possible logical structure of the second terminal device involved in the above embodiment. The second terminal device 1000 includes: a receiving unit 1001 and a transmitting unit 1001. Unit 1002. Exemplarily, the receiving unit 1001 is configured to support the second terminal device to perform the steps of receiving information in the method embodiment shown above. The sending unit 1002 is configured to support the second terminal device to perform the steps of sending information in the foregoing method embodiment.

Optionally, the second terminal device 1000 may further include a processing unit and a storage unit. The storage unit is used to store computer programs and data. The processing unit may call the computer program and/or data of the storage unit, so that the second terminal device 1000 sends the first data to the first terminal device in the first time slot; the first time slot is one of the N time slots For the time slot, the N is an integer greater than or equal to 1; then, the first response sequence sent by the first terminal device on the first time-frequency resource according to the first data is received, the first response sequence Is one of the M code division multiplexing sequences allocated to the first time slot, and the M code division multiplexing sequences are used to respond to the N time slots on the first time-frequency resource For data sent on the above, the M is an integer multiple of the N.

In terms of hardware implementation, the foregoing processing unit may be a processor or a processing circuit. The receiving unit 1001 may be a transceiving unit, a transceiver, a receiver, or a receiving circuit or an interface circuit, or the like. The sending unit 1002 may be a transceiving unit, a transceiver, a transmitter, or a sending circuit or an interface circuit. The aforementioned storage unit may be a memory. The foregoing processing unit, receiving unit, sending unit, and storage unit may be integrated or coupled together, or may be separated.

FIG. 11 shows a schematic diagram of a possible hardware structure of the second terminal device involved in the above-mentioned embodiments provided by the embodiments of this application. As shown in FIG. 11, the second terminal device 1100 may include: one or more processors 1101, one or more memories 1102, a network interface 1103, one or more receivers 1105, one or more transmitters 1106, and one Or multiple antennas 1107. These components can be connected through a bus 1104 or other ways. FIG. 11 uses a bus connection as an example. among them:

The network interface 1103 can be used for the second terminal device 1100 to communicate with other communication devices, such as network devices. Specifically, the network interface 1103 may be a wired interface.

The receiver 1105 may also be used to perform receiving processing on the mobile communication signal received by the antenna 1107, such as signal demodulation. The transmitter 1106 may be used to transmit the signal output by the processor 1101, such as signal modulation. In some embodiments of the present application, the receiver 1105 may be regarded as a wireless demodulator, and the transmitter 1106 may be regarded as a wireless modulator. In the second terminal device 1100, the number of receivers 1105 may be one or more, and the number of transmitters 1106 may also be one or more. The antenna 1107 can be used to convert electromagnetic energy in a transmission line into electromagnetic waves in a free space, or convert electromagnetic waves in a free space into electromagnetic energy in a transmission line. The number of antennas 1107 may be one or more.

The memory 1102 may be coupled with the processor 1101 through a bus 1104 or an input/output port, and the memory 1102 may also be integrated with the processor 1101. The memory 1102 is used to store various software programs and/or multiple sets of instructions or data. Specifically, the memory 1102 may include a high-speed random access memory, and may also include a non-volatile memory, such as one or more magnetic disk storage devices, flash memory devices, or other non-volatile solid-state storage devices. The memory 1102 may store an operating system (hereinafter referred to as the system), such as embedded operating systems such as uCOS, VxWorks, and RTLinux. The memory 1102 may also store a network communication program, and the network communication program may be used to communicate with one or more additional devices, one or more user devices, and one or more network devices.

The processor 1101 may be a central processing unit, a general-purpose processor, a digital signal processor, an application specific integrated circuit, a field programmable gate array or other programmable logic devices, transistor logic devices, hardware components, or any combination thereof. It can implement or execute various exemplary logical blocks, modules, and circuits described in conjunction with the disclosure of this application. The processor may also be a combination for realizing certain functions, for example, including a combination of one or more microprocessors, a combination of a digital signal processor and a microprocessor, and so on.

In the embodiment of the present application, the processor 1101 may be used to read and execute computer-readable instructions. Specifically, the processor 1101 communication chip 1200 may be used to call a program stored in the memory 1102, such as the implementation program of the communication method provided by one or more embodiments of the present application on the second terminal device side, and execute the program included in the program. instruction.

It should be noted that the second terminal device 1100 shown in FIG. 11 is only an implementation of the embodiment of the present application. In practical applications, the second terminal device 1100 may also include more or fewer components, which is not limited here. . For the specific implementation of the second terminal device 1100, reference may be made to the relevant description in the foregoing method embodiment, which will not be repeated here.

Another aspect of the present application provides a communication system. The communication system includes one or more first terminal devices and one or more second terminal devices. The first terminal device may be the first terminal device shown in FIG. 8. The terminal device 800, the second terminal device may be the second terminal device 1000 described in FIG. 10. Alternatively, the first terminal device may be the first terminal device 900 described in FIG. 9, and the second terminal device may be the second terminal device 1100 described in FIG. 11.

Refer to FIG. 12, which shows a schematic structural diagram of a communication chip provided by the present application. As shown in FIG. 12, the communication chip 1200 may include: a processor 1201, and one or more interfaces 1202 coupled to the processor 1201. among them:

The processor 1201 can be used to read and execute computer readable instructions. In specific implementation, the processor 1201 may mainly include a controller, an arithmetic unit, and a register. Among them, the controller is mainly responsible for the instruction decoding, and sends out control signals for the operation corresponding to the instruction. The arithmetic unit is mainly responsible for performing fixed-point or floating-point arithmetic operations, shift operations and logic operations, etc., and can also perform address operations and conversions. The register is mainly responsible for storing the register operands and intermediate operation results temporarily stored during the execution of the instruction. In specific implementation, the hardware architecture of the processor 1201 may be an application specific integrated circuit (ASIC) architecture, a microprocessor without interlocked pipeline stage architecture (MIPS) architecture, and advanced streamlining. Instruction set machine (advanced RISC machines, ARM) architecture or NP architecture, etc. The processor 1201 may be single-core or multi-core.

The interface 1202 can be used to input data to be processed to the processor 1201, and can output the processing result of the processor 1201 to the outside. In specific implementation, the interface 1202 may be a general purpose input output (GPIO) interface, and may be connected to multiple peripheral devices (such as a display (LCD), radio frequency (RF) module, etc.). The interface 1202 may be connected to the processor 1201 through the bus 1203.

In the present application, the processor 1201 may be configured to call the implementation program of the communication method provided by one or more embodiments of the present application on the side of the first terminal device or the second terminal device from the memory, and execute the instructions contained in the program. The memory may be integrated with the processor 1201. In this case, the memory is used as a part of the communication chip 1200. Alternatively, the memory is used as an external component of the communication chip 1200, and the processor 1201 calls the instructions or data stored in the memory through the interface 1202.

The interface 1202 can be used to output the execution result of the processor 1201. For the communication methods provided by one or more embodiments of the present application, reference may be made to the foregoing embodiments, and details are not described herein again.

In a possible embodiment, the aforementioned communication chip 1200 may be a system chip (System on a Chip, SoC).

It should be noted that the respective functions of the processor 1201 and the interface 1202 may be implemented through hardware design, may also be implemented through software design, or may be implemented through a combination of software and hardware, which is not limited here.

The embodiment of the present invention also provides a computer-readable storage medium, the computer-readable storage medium stores a computer program, and the computer program is executed by a processor to implement any one of the foregoing on the first terminal device side. Communication method.

The embodiment of the present invention also provides a computer-readable storage medium, the computer-readable storage medium stores a computer program, and the computer program is executed by a processor to implement any one of the foregoing on the second terminal device side. Communication method.

The embodiment of the present invention also provides a computer program product. When the computer program product is read and executed by a computer, any one of the aforementioned items on the first terminal device or any one of the aforementioned items on the second terminal device is executed. The communication method described will be executed.

The embodiment of the present invention also provides a computer program. When the computer program is executed on a computer, it will enable the computer to implement any of the foregoing on the first terminal device or any of the foregoing on the second terminal device. The communication method described in one item.

The first terminal device or the second terminal device in the embodiment of the present invention may be replaced by a communication device.

To sum up, through the method of the foregoing embodiment, a method is designed in which N time slots share a time-frequency resource to send a response sequence to whether the received data is decoded correctly. This solution achieves the purpose of code division multiplexing by using phase rotation in the frequency domain or cyclic shift in the time domain. So that each time slot can be allocated to the corresponding response sequence. When unicast, multicast, and broadcast coexist in the same resource pool, no additional signaling overhead is needed, and corresponding time-frequency resources are allocated for each time slot in advance. In addition, considering that the response sequence sent by the device in multicast or broadcast has a certain consistency, the NACK and ACK sequences in the response sequence corresponding to a feedback time slot are designed to be continuous respectively to reduce the interference between the NACK and ACK sequences.

In the above-mentioned embodiments, it may be implemented in whole or in part by software, hardware, firmware, or any combination thereof. When implemented by software, it can be implemented in the form of a computer program product in whole or in part. The computer program product includes one or more computer instructions. When the computer program instructions are loaded and executed on the computer, the processes or functions according to the embodiments of the present invention are generated in whole or in part. The computer can be a general-purpose computer, a special-purpose computer, a computer network, or other programmable devices. 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, computer instructions may be transmitted from a website, computer, server, or data center through a cable (such as Coaxial cable, optical fiber, digital subscriber line (DSL)) or wireless (such as infrared, wireless, microwave, etc.) to transmit to another website site, computer, server or data center. The computer-readable storage medium may be any available medium that can be accessed by a computer or a data storage device such as a server or data center integrated with one or more available media. The usable medium may be a magnetic medium (for example, a floppy disk, a hard disk, and a magnetic tape), an optical medium (for example, a DVD), or a semiconductor medium (for example, a solid state disk (SSD)).

In summary, the above are only preferred embodiments of the present invention, and are not intended to limit the protection scope of the present invention. Any modification, equivalent replacement, improvement, etc. made within the spirit and principle of the present invention should be included in the protection scope of the present invention.

Claims

A communication method, characterized in that it comprises:

The first terminal device receives the first data from the second terminal device on the first time slot; the first time slot is one time slot of N time slots, and the N is an integer greater than or equal to 1;

The first terminal device sends a first response sequence to the second terminal device on a first time-frequency resource according to the first data, and the first response sequence is allocated to all of the M code division multiplexing sequences. One of the sequences of the first time slot, the M code division multiplexing sequences are used to respond to the data sent on the N time slots on the first time-frequency resource, and the M is the N Integer multiples of.
The method according to claim 1, wherein the signal bandwidth of each of the M code division multiplexing sequences is the same as the bandwidth of the first time-frequency resource, and the bandwidth of the first time-frequency resource is the same as the bandwidth of the first time-frequency resource. The bandwidths of the sub-channels where the first time-frequency resources are located are the same.
The method according to claim 1 or 2, wherein the M code division multiplexing sequences are used to evenly allocate the N time slots, and each of the N time slots is allocated M/ N code division multiplexing sequences; the M/N code division multiplexing sequences are used to allocate P=M/(2*N) devices; each of the P devices is allocated two sequences, The two sequences include an acknowledgment character ACK sequence and a negative character NACK sequence, the P is a positive integer, and the M is an integer multiple of P.
The method according to claim 3, wherein the M code division multiplexing sequences are obtained from a base sequence γ by cyclic shifting in the time domain, or the M code division multiplexing sequences are obtained from a base sequence γ. The sequence γ is obtained by phase rotation in the frequency domain; the M code division multiplexing sequences are expressed as:

r(n)=γ*e -j*(2*π/M)*n , n=0,1,2,3,...,M-1,

Wherein, the N represents the index number of the M code division multiplexing sequences;

The M/N code division multiplexing sequences allocated to each of the N time slots are M/N sequences with consecutive index labels.
The method according to claim 4, wherein the M/N code division multiplexing sequences obtained by the i-th time slot allocation among the N time slots are expressed as:

Wherein, the m 0 represents the initial phase of the base sequence γ, and the i=0,1,2,...,N-1;

Alternatively, the M/N code division multiplexing sequences obtained by the allocation of the i-th time slot among the N time slots are expressed as:
The method according to claim 4 or 5, wherein the P ACK sequences allocated by the i-th time slot among the N time slots are P consecutive sequences with index labels, and the N time slots The P NACK sequences allocated by the i-th time slot are P consecutive sequences with index labels.
The method according to claim 6, wherein the M/N code division multiplexing sequences obtained by the i-th time slot allocation among the N time slots are expressed as:

Wherein, said ρ=0,1,2,...,P-1;

Alternatively, the M/N code division multiplexing sequences obtained by the allocation of the i-th time slot among the N time slots are expressed as:

In the i-th time slot, the code division multiplexing sequence obtained under the condition of m cs =ρ is P consecutive ACK sequences with index labels, and the code division multiplexing sequence obtained under the condition of m cs =ρ+P Use the sequence as P consecutive NACK sequences with index labels;

Or, in the i-th time slot, the code division multiplexing sequence obtained in the case of m cs =ρ is P NACK sequences with consecutive index labels, and the code obtained in the case of m cs =ρ+P The multiplexing sequence is P ACK sequences with consecutive index labels;

The code division multiplexing sequence generated when m cs =ρ and the code division multiplexing sequence generated when m cs =ρ+P form a code division multiplexing sequence pair.
The method according to claim 4, wherein the M/N code division multiplexing sequences obtained by the i-th time slot allocation among the N time slots are expressed as:

Wherein, the m 0 represents the initial phase of the base sequence γ, the m 0 =P/2, the ρ=0,1,2,...,P-1, the i=0,1,2 ,...,N-1;

In the i-th time slot, the code division multiplexing sequence obtained in the case of m cs =ρ is P ACK sequences, and the code division multiplexing sequence obtained in the case of m cs =ρ+P is P NACK sequence;

Or, in the i-th time slot, the code division multiplexing sequence obtained in the case of m cs =ρ is P NACK sequences, and the code division multiplexing sequence obtained in the case of m cs =ρ+P Is P ACK sequences;

The code division multiplexing sequence generated when m cs =ρ and the code division multiplexing sequence generated when m cs =ρ+P form a code division multiplexing sequence pair; When allocating to devices, they are allocated in the order of ρ=0, 1, 2, ..., P-1.
The method according to claim 4, wherein the M/N code division multiplexing sequences obtained by the i-th time slot allocation among the N time slots are expressed as:

Wherein, the m 0 represents the initial phase of the base sequence γ, the m 0 =P/2, the ρ=0,1,2,...,P-1, the i=0,1,2 ,...,N-1;

In the i-th time slot, the code division multiplexing sequence obtained in the case of m q =0 is P consecutive ACK sequences with index labels, and the code division multiplexing sequence obtained in the case of m q ＝P Are P NACK sequences with consecutive index labels;

Or, in the i-th time slot, the code division multiplexing sequence obtained in the case of m q =0 is P NACK sequences with consecutive index labels, and the code division multiplexing sequence obtained in the case of m q =P Use the sequence as P consecutive ACK sequences with index labels;

When the values of ρ are equal, the code division multiplexing sequence generated when m q =0 and the code division multiplexing sequence generated when m q ＝P form a code division multiplexing sequence pair; When the generated P sequence pairs are allocated to the device, they are allocated in the order of ρ=0, 1, 2, ..., P-1.
The method according to any one of claims 1 to 9, wherein the first data is received by the first terminal device on a plurality of sub-channels, and the first terminal device transmits data according to the first data Sending a first response sequence to the second terminal device on the first time-frequency resource includes:

In the case that the communication between the second terminal device and the first terminal device is unicast communication, the first terminal device selects one sub-channel from the plurality of sub-channels according to the first data. Sending the first response sequence to the second terminal device on the first time-frequency resource;

Alternatively, in a case where the communication between the second terminal device and the first terminal device is unicast communication, the first terminal device occupies the plurality of sub-channels in the first data according to the first data. Sending the first response sequence to the second terminal device on a time-frequency resource.
The method according to any one of claims 1 to 9, wherein the first data is received by the first terminal device on multiple sub-channels, and when the first data is multicast data , Each of the receiving devices to which the multicast belongs in response to the sequence of the first data occupies the multiple sub-channels for transmission;

Or, in a case where the first data is multicast data, each of all receiving devices of the multicast occupies one of the multiple subchannels to send in response to the sequence of the first data.
A communication method, characterized in that it comprises:

The second terminal device sends the first data to the first terminal device in the first time slot; the first time slot is one of N time slots, and the N is an integer greater than or equal to 1;

The second terminal device receives a first response sequence sent by the first terminal device based on the first data on a first time-frequency resource, where the first response sequence is allocated among M code division multiplexing sequences For one of the sequences of the first time slot, the M code division multiplexing sequences are used to respond to the data sent on the N time slots on the first time-frequency resource, and the M is all The integer multiple of N.
The method according to claim 12, wherein the signal bandwidth of each of the M code division multiplexing sequences is the same as the bandwidth of the first time-frequency resource, and the bandwidth of the first time-frequency resource is the same as the bandwidth of the first time-frequency resource. The bandwidths of the sub-channels where the first time-frequency resources are located are the same.
The method according to claim 12 or 13, wherein the M code division multiplexing sequences are used to evenly allocate the N time slots, and each of the N time slots is allocated with M/ N code division multiplexing sequences; the M/N code division multiplexing sequences are used to allocate P=M/(2*N) devices; each of the P devices is allocated two sequences, The two sequences include an acknowledgment character ACK sequence and a negative character NACK sequence, the P is a positive integer, and the M is an integer multiple of P.
The method according to claim 14, wherein the M code division multiplexing sequences are obtained from a base sequence γ by cyclic shifting in the time domain, or the M code division multiplexing sequences are obtained from a base sequence γ. The sequence γ is obtained by phase rotation in the frequency domain; the M code division multiplexing sequences are expressed as:

r(n)=γ*e -j*(2*π/M)*n , n=0,1,2,3,...,M-1,

Wherein, the N represents the index number of the M code division multiplexing sequences;

The M/N code division multiplexing sequences allocated to each of the N time slots are M/N sequences with consecutive index labels.
The method according to claim 15, wherein the M/N code division multiplexing sequences obtained by the allocation of the i-th time slot among the N time slots are expressed as:

Wherein, the m 0 represents the initial phase of the base sequence γ, and the i=0,1,2,...,N-1;

Alternatively, the M/N code division multiplexing sequences obtained by the allocation of the i-th time slot among the N time slots are expressed as:
The method according to claim 15 or 16, characterized in that the P ACK sequences allocated by the i-th time slot among the N time slots are P consecutive sequences with index labels, and in the N time slots The P NACK sequences allocated by the i-th time slot are P consecutive sequences with index labels.
The method according to claim 17, wherein the M/N code division multiplexing sequences obtained by the allocation of the i-th time slot among the N time slots are expressed as:

Wherein, said ρ=0,1,2,...,P-1;

Alternatively, the M/N code division multiplexing sequences obtained by the allocation of the i-th time slot among the N time slots are expressed as:

In the i-th time slot, the code division multiplexing sequence obtained under the condition of m cs =ρ is P consecutive ACK sequences with index labels, and the code division multiplexing sequence obtained under the condition of m cs =ρ+P Use the sequence as P consecutive NACK sequences with index labels;

Or, in the i-th time slot, the code division multiplexing sequence obtained in the case of m cs =ρ is P NACK sequences with consecutive index labels, and the code obtained in the case of m cs =ρ+P The multiplexing sequence is P ACK sequences with consecutive index labels;

The code division multiplexing sequence generated when m cs =ρ and the code division multiplexing sequence generated when m cs =ρ+P form a code division multiplexing sequence pair.
The method according to claim 15, wherein the M/N code division multiplexing sequences obtained by the allocation of the i-th time slot among the N time slots are expressed as:

Wherein, the m 0 represents the initial phase of the base sequence γ, the m 0 =P/2, the ρ=0,1,2,...,P-1, the i=0,1,2 ,...,N-1;

In the i-th time slot, the code division multiplexing sequence obtained in the case of m cs =ρ is P ACK sequences, and the code division multiplexing sequence obtained in the case of m cs =ρ+P is P NACK sequence;

Or, in the i-th time slot, the code division multiplexing sequence obtained in the case of m cs =ρ is P NACK sequences, and the code division multiplexing sequence obtained in the case of m cs =ρ+P Is P ACK sequences;

The code division multiplexing sequence generated when m cs =ρ and the code division multiplexing sequence generated when m cs =ρ+P form a code division multiplexing sequence pair; When allocating to devices, they are allocated in the order of ρ=0,1,2,...,P-1.
The method according to claim 15, wherein the M/N code division multiplexing sequences obtained by the allocation of the i-th time slot among the N time slots are expressed as:

Wherein, the m 0 represents the initial phase of the base sequence γ, the m 0 =P/2, the ρ=0,1,2,...,P-1, the i=0,1,2 ,...,N-1;

In the i-th time slot, the code division multiplexing sequence obtained in the case of m q =0 is P consecutive ACK sequences with index labels, and the code division multiplexing sequence obtained in the case of m q ＝P Are P NACK sequences with consecutive index labels;

Or, in the i-th time slot, the code division multiplexing sequence obtained in the case of m q =0 is P NACK sequences with consecutive index labels, and the code division multiplexing sequence obtained in the case of m q =P Use the sequence as P consecutive ACK sequences with index labels;

When the values of ρ are equal, the code division multiplexing sequence generated when m q =0 and the code division multiplexing sequence generated when m q ＝P form a code division multiplexing sequence pair; When the generated P sequence pairs are allocated to the device, they are allocated in the order of ρ=0, 1, 2, ..., P-1.
The method according to any one of claims 12 to 20, wherein the second terminal device sending the first data to the first terminal device in the first time slot comprises:

The second terminal device occupies a plurality of subchannels in the first time slot to transmit the first data to the first terminal device.
A terminal device, characterized in that it comprises:

A receiving unit, configured to receive first data from a second terminal device on a first time slot; the first time slot is one time slot of N time slots, and the N is an integer greater than or equal to 1;

The sending unit is configured to send a first response sequence to the second terminal device on a first time-frequency resource according to the first data, where the first response sequence is allocated to the M code division multiplexing sequence One of the sequences of the first time slot, the M code division multiplexing sequences are used to respond to the data sent on the N time slots on the first time-frequency resource, and the M is the time of the N Integer multiples.
The terminal device according to claim 22, wherein the signal bandwidth of each of the M code division multiplexing sequences is the same as the bandwidth of the first time-frequency resource, and the bandwidth of the first time-frequency resource is the same as that of the first time-frequency resource. The bandwidth is the same as the bandwidth of the sub-channel where the first time-frequency resource is located.
The terminal device according to claim 22 or 23, wherein the M code division multiplexing sequences are used to evenly allocate the N time slots, and each of the N time slots is allocated with M /N code division multiplexing sequences; the M/N code division multiplexing sequences are used to allocate P=M/(2*N) devices; each of the P devices is allocated two sequences The two sequences include an acknowledgment character ACK sequence and a negative character NACK sequence, the P is a positive integer, and the M is an integer multiple of P.
The terminal device according to claim 24, wherein the M code division multiplexing sequences are obtained from a base sequence γ by cyclic shifting in the time domain, or the M code division multiplexing sequences are obtained from one base sequence γ. The base sequence γ is obtained by phase rotation in the frequency domain; the M code division multiplexing sequences are expressed as:

r(n)=γ*e -j*(2*π/M)*n , n=0,1,2,3,...,M-1

Wherein, the N represents the index number of the M code division multiplexing sequences;

The M/N code division multiplexing sequences allocated to each of the N time slots are M/N sequences with consecutive index labels.
The terminal device according to claim 25, wherein the M/N code division multiplexing sequences obtained by the i-th time slot allocation among the N time slots are expressed as:

Wherein, the m 0 represents the initial phase of the base sequence γ, and the i=0,1,2,...,N-1;

Alternatively, the M/N code division multiplexing sequences obtained by the allocation of the i-th time slot among the N time slots are expressed as:
The terminal device according to claim 25 or 26, wherein the P ACK sequences allocated by the i-th time slot among the N time slots are sequences with P consecutive index numbers, and the N time slots The P NACK sequences allocated by the i-th time slot in are P consecutive sequences with index labels.
The terminal device according to claim 27, wherein the M/N code division multiplexing sequences obtained by the i-th time slot allocation among the N time slots are expressed as:

Wherein, said ρ=0,1,2,...,P-1;

Alternatively, the M/N code division multiplexing sequences obtained by the allocation of the i-th time slot among the N time slots are expressed as:

In the i-th time slot, the code division multiplexing sequence obtained under the condition of m cs =ρ is P consecutive ACK sequences with index labels, and the code division multiplexing sequence obtained under the condition of m cs =ρ+P Use the sequence as P consecutive NACK sequences with index labels;

Or, in the i-th time slot, the code division multiplexing sequence obtained in the case of m cs =ρ is P NACK sequences with consecutive index labels, and the code obtained in the case of m cs =ρ+P The multiplexing sequence is P ACK sequences with consecutive index labels;

The code division multiplexing sequence generated when m cs =ρ and the code division multiplexing sequence generated when m cs =ρ+P form a code division multiplexing sequence pair.
The terminal device according to claim 25, wherein the M/N code division multiplexing sequences obtained by the i-th time slot allocation among the N time slots are expressed as:

Wherein, the m 0 represents the initial phase of the base sequence γ, the m 0 =P/2, the ρ=0,1,2,...,P-1, the i=0,1,2 ,...,N-1;

In the i-th time slot, the code division multiplexing sequence obtained in the case of m cs =ρ is P ACK sequences, and the code division multiplexing sequence obtained in the case of m cs =ρ+P is P NACK sequence;

Or, in the i-th time slot, the code division multiplexing sequence obtained in the case of m cs =ρ is P NACK sequences, and the code division multiplexing sequence obtained in the case of m cs =ρ+P Is P ACK sequences;

The code division multiplexing sequence generated when m cs =ρ and the code division multiplexing sequence generated when m cs =ρ+P form a code division multiplexing sequence pair; When allocating to devices, they are allocated in the order of ρ=0, 1, 2, ..., P-1.
The terminal device according to claim 25, wherein the M/N code division multiplexing sequences obtained by the i-th time slot allocation among the N time slots are expressed as:

Wherein, the m 0 represents the initial phase of the base sequence γ, the m 0 =P/2, the ρ=0,1,2,...,P-1, the i=0,1,2 ,...,N-1;

In the i-th time slot, the code division multiplexing sequence obtained in the case of m q =0 is P consecutive ACK sequences with index labels, and the code division multiplexing sequence obtained in the case of m q ＝P Are P NACK sequences with consecutive index labels;

Or, in the i-th time slot, the code division multiplexing sequence obtained in the case of m q =0 is P NACK sequences with consecutive index labels, and the code division multiplexing sequence obtained in the case of m q =P Use the sequence as P consecutive ACK sequences with index labels;

When the values of ρ are equal, the code division multiplexing sequence generated when m q =0 and the code division multiplexing sequence generated when m q ＝P form a code division multiplexing sequence pair; When the generated P sequence pairs are allocated to the device, they are allocated in the order of ρ=0, 1, 2, ..., P-1.
The terminal device according to any one of claims 22 to 30, wherein the first data is received by the terminal device on multiple sub-channels, and the sending unit is specifically configured to:

In a case where the communication between the second terminal device and the terminal device is unicast communication, select one sub-channel from the plurality of sub-channels based on the first data to be on the first time-frequency resource Sending the first response sequence to the second terminal device;

Or, in a case where the communication between the second terminal device and the terminal device is unicast communication, occupying the multiple subchannels according to the first data to the first time-frequency resource The second terminal device transmits the first response sequence.
The terminal device according to any one of claims 22 to 30, wherein the first data is received by the terminal device on a plurality of subchannels, and in the case that the first data is multicast data, Each of the receiving devices to which the multicast belongs in response to the sequence of the first data occupies the multiple sub-channels for transmission;

Or, in a case where the first data is multicast data, each of all receiving devices of the multicast occupies one of the multiple subchannels to send in response to the sequence of the first data.
A terminal device, characterized in that it comprises:

A sending unit, configured to send first data to the first terminal device in a first time slot; the first time slot is one time slot among N time slots, and the N is an integer greater than or equal to 1;

The receiving unit is configured to receive a first response sequence sent by the first terminal device according to the first data on the first time-frequency resource, where the first response sequence is allocated to M code division multiplexing sequences One of the sequences of the first time slot, the M code division multiplexing sequences are used to respond to the data sent on the N time slots on the first time-frequency resource, and the M is the An integer multiple of N.
The terminal device according to claim 33, wherein the signal bandwidth of each of the M code division multiplexing sequences is the same as the bandwidth of the first time-frequency resource, and the bandwidth of the first time-frequency resource is the same as that of the first time-frequency resource. The bandwidth is the same as the bandwidth of the sub-channel where the first time-frequency resource is located.
The terminal device according to claim 33 or 34, wherein the M code division multiplexing sequences are used to evenly allocate the N time slots, and each of the N time slots is allocated M /N code division multiplexing sequences; the M/N code division multiplexing sequences are used to allocate P=M/(2*N) devices; each of the P devices is allocated two sequences The two sequences include an acknowledgment character ACK sequence and a negative character NACK sequence, the P is a positive integer, and the M is an integer multiple of P.
The terminal device according to claim 35, wherein the M code division multiplexing sequences are obtained from a base sequence γ by cyclic shifting in the time domain, or the M code division multiplexing sequences are obtained from one base sequence γ. The base sequence γ is obtained by phase rotation in the frequency domain; the M code division multiplexing sequences are expressed as:

r(n)=γ*e -j*(2*π/M)*n , n=0,1,2,3,...,M-1,

Wherein, the N represents the index number of the M code division multiplexing sequences;

The M/N code division multiplexing sequences allocated to each of the N time slots are M/N sequences with consecutive index labels.
The terminal device according to claim 36, wherein the M/N code division multiplexing sequences obtained by the i-th time slot allocation among the N time slots are expressed as:

Wherein, the m 0 represents the initial phase of the base sequence γ, and the i=0,1,2,...,N-1;

Alternatively, the M/N code division multiplexing sequences obtained by the allocation of the i-th time slot among the N time slots are expressed as:
The terminal device according to claim 36 or 37, wherein the P ACK sequences allocated by the i-th time slot among the N time slots are sequences with consecutive P index numbers, and the N time slots The P NACK sequences allocated by the i-th time slot in are P consecutive sequences with index labels.
The terminal device according to claim 38, wherein the M/N code division multiplexing sequences obtained by the i-th time slot allocation among the N time slots are expressed as:

Wherein, said ρ=0,1,2,...,P-1;

Alternatively, the M/N code division multiplexing sequences obtained by the allocation of the i-th time slot among the N time slots are expressed as:

In the i-th time slot, the code division multiplexing sequence obtained under the condition of m cs =ρ is P consecutive ACK sequences with index labels, and the code division multiplexing sequence obtained under the condition of m cs =ρ+P Use the sequence as P consecutive NACK sequences with index labels;

Or, in the i-th time slot, the code division multiplexing sequence obtained in the case of m cs =ρ is P NACK sequences with consecutive index labels, and the code obtained in the case of m cs =ρ+P The multiplexing sequence is P ACK sequences with consecutive index labels;

The code division multiplexing sequence generated when m cs =ρ and the code division multiplexing sequence generated when m cs =ρ+P form a code division multiplexing sequence pair.
The terminal device according to claim 36, wherein the M/N code division multiplexing sequences obtained by the i-th time slot allocation among the N time slots are expressed as:

Wherein, the m 0 represents the initial phase of the base sequence γ, the m 0 =P/2, the ρ=0,1,2,...,P-1, the i=0,1,2 ,...,N-1;

In the i-th time slot, the code division multiplexing sequence obtained in the case of m cs =ρ is P ACK sequences, and the code division multiplexing sequence obtained in the case of m cs =ρ+P is P NACK sequence;

Or, in the i-th time slot, the code division multiplexing sequence obtained in the case of m cs =ρ is P NACK sequences, and the code division multiplexing sequence obtained in the case of m cs =ρ+P Is P ACK sequences;

The code division multiplexing sequence generated when m cs =ρ and the code division multiplexing sequence generated when m cs =ρ+P form a code division multiplexing sequence pair; When allocating to devices, they are allocated in the order of ρ=0, 1, 2, ..., P-1.
The terminal device according to claim 36, wherein the M/N code division multiplexing sequences obtained by the i-th time slot allocation among the N time slots are expressed as:

Wherein, the m 0 represents the initial phase of the base sequence γ, the m 0 =P/2, the ρ=0,1,2,...,P-1, the i=0,1,2 ,...,N-1;

In the i-th time slot, the code division multiplexing sequence obtained in the case of m q =0 is P consecutive ACK sequences with index labels, and the code division multiplexing sequence obtained in the case of m q ＝P Are P NACK sequences with consecutive index labels;

Or, in the i-th time slot, the code division multiplexing sequence obtained in the case of m q =0 is P NACK sequences with consecutive index labels, and the code division multiplexing sequence obtained in the case of m q =P Use the sequence as P consecutive ACK sequences with index labels;

When the values of ρ are equal, the code division multiplexing sequence generated when m q =0 and the code division multiplexing sequence generated when m q ＝P form a code division multiplexing sequence pair; When the generated P sequence pairs are allocated to the device, they are allocated in the order of ρ=0, 1, 2, ..., P-1.
The terminal device according to any one of claims 33 to 41, wherein the sending unit is specifically configured to:

Occupy multiple sub-channels in the first time slot to transmit the first data to the first terminal device.
A communication system, characterized by comprising a first terminal device and a second terminal device, wherein the first terminal device is the terminal device according to any one of claims 22 to 32, and the second terminal device is The terminal device according to any one of claims 33 to 42.
A computer-readable storage medium, wherein the computer-readable storage medium stores a computer program, and the computer program is executed by a processor to implement the communication method according to any one of claims 1 to 11.
A computer-readable storage medium, wherein the computer-readable storage medium stores a computer program, and the computer program is executed by a processor to implement the communication method according to any one of claims 12 to 21.
A computer program product, characterized in that when the computer program product is read and executed by a computer, the communication method according to any one of claims 1 to 11 or any one of claims 12 to 21 will be executed.
A computer program, characterized in that, when the computer program is executed on a computer, it will enable the computer to implement the communication method according to any one of claims 1 to 11 or any one of claims 12 to 21.
A communication chip, the communication chip comprising a processor and a communication interface, wherein the communication chip is configured to execute the method according to any one of claims 1 to 11 or any one of claims 12 to 21.