CN114556828A

CN114556828A - Communication method and related device

Info

Publication number: CN114556828A
Application number: CN201980101295.2A
Authority: CN
Inventors: 郭文婷; 向铮铮; 苏宏家; 卢磊
Original assignee: Huawei Technologies Co Ltd
Current assignee: Huawei Technologies Co Ltd
Priority date: 2019-11-05
Filing date: 2019-11-05
Publication date: 2022-05-27
Anticipated expiration: 2039-11-05
Also published as: WO2021087774A1; CN114556828B

Abstract

The embodiment of the application discloses a communication method and a related device, wherein the communication method comprises the following steps: a first terminal device receiving first data from a second terminal device on a first time slot; the first time slot is one of N time slots, wherein 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, the first response sequence is one of sequences allocated to the first time slot in M code division multiplexing sequences, the M code division multiplexing sequences are used for responding to the data sent on the N time slots on the first time-frequency resource, and M is an integer multiple of the N. By adopting the embodiment of the application, the network overhead can be saved.

Description

Communication method and related device

Technical Field

The present invention relates to the field of communications technologies, and in particular, to a communication method and a related apparatus.

Background

With the development of wireless communication technology, there is an increasing demand for high data rate and user experience, and at the same time, there is an increasing demand for proximity services that understand and communicate with surrounding people or things, so device-to-device (D2D) technology has come into play. The application of the D2D technology can reduce the burden of the cellular network, reduce the battery power consumption of the user equipment, increase the data rate, and well meet the demand of the proximity service.

Under the network of Long Term Evolution (LTE) technology proposed by the 3rd generation partnership project (3 GPP), vehicle networking technology of vehicle-to-vehicle communication (V2X) is proposed, and V2X communication refers to communication of a vehicle with anything outside, including vehicle-to-vehicle communication (V2V), vehicle-to-pedestrian communication (V2P), vehicle-to-infrastructure communication (V2I), and vehicle-to-network communication (V2N). The V2X communication is a basic technology and a key technology applied in a scene with a high requirement on communication delay in the future, such as an intelligent automobile, an automatic driving system, an intelligent transportation system, and the like, for a high-speed device communication technology represented by a vehicle. The LTE V2X solves some part of basic requirements in the V2X scenario, but the LTE V2X at present stage cannot effectively support the application scenarios such as full-intelligent driving, automatic driving and the like in the future.

With the development of a New Radio (NR) technology of 5G in the 3GPP standard organization, NR V2X of 5G will be further developed, for example, the ue can support lower transmission delay, more reliable communication transmission, higher throughput, and better user experience, so as to meet the requirements of wider application scenarios.

LTE V2X defines broadcast transmissions on the sidelink and NR V2X introduces unicast and multicast transmissions on the sidelink. In unicast/multicast transmission, in order to improve transmission reliability and reduce transmission delay, a hybrid automatic repeat request (HARQ) technique may be used. The 3GPP standard defines a physical downlink feedback channel (PSFCH) in a downlink, which is used to transmit downlink feedback control information (SFCI), and at least may be used to receive an acknowledgement message that a User Equipment (UE) feeds back to the transmitting UE whether reception is successful, and may further include Channel State Information (CSI) and the like. The time domain resources of the PSFCH may be configured or preconfigured by the network for the resource pool, while the frequency domain resources and/or code domain resources of the PSFCH are also configured, but the prior art has no standard how to configure these resources.

The prior art supports the feedback of the UE on the downlink data transmission, and the base station completely controls the allocation of the time-frequency resources, so that one UE sends the decoding result of one or more downlink data on the time-frequency resources configured by the base station. However, in multicast communication, for an application scenario without a central controller, such as a base station, for controlling scheduling, when multiple users in multiple time slots need to feed back HARQ information on the same time-frequency resource, how to allocate the time-frequency resource to the users is a problem that needs to be researched and solved by those in the art.

Disclosure of Invention

The invention provides a communication method and a related device, which can allocate a corresponding response sequence and time-frequency resources for each time slot in advance to respond to received data without additional signaling overhead when unicast, multicast and broadcast coexist in a resource pool, thereby reducing network overhead.

In a first aspect, an embodiment of the present invention provides a communication method, where the method includes: a first terminal device receiving first data from a second terminal device on a first time slot; the first time slot is one of N time slots, and 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, the first response sequence is one of sequences allocated to the first time slot in M code division multiplexing sequences, the M code division multiplexing sequences are used for responding to the data sent on the N time slots on the first time-frequency resource, and M is an integer multiple of N.

The scheme enables each time slot to be allocated to a corresponding response sequence by using a code division multiplexing sequence. When unicast, multicast and broadcast coexist in one resource pool, no extra signaling overhead is needed, and a corresponding response sequence and time-frequency resources are allocated to each time slot in advance for responding to received data, so that the network overhead can be reduced.

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

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 embodiment, the M code division multiplexing sequences are used to be allocated to the N time slots on average, and M/N code division multiplexing sequences are allocated to each of the N time slots; the M/N code division multiplexing sequences are used for being distributed to P (M/(2) N) devices; each of the P devices is assigned with two sequences, the two sequences including an acknowledgement character ACK sequence and a negative acknowledgement character NACK sequence, P being a positive integer, and M being an integer multiple of P.

In the embodiment, M code division multiplexing sequences which can be multiplexed in one time-frequency resource are averagely allocated to N time slots configured by the system, and then two sequences are allocated to each device so as to respectively respond to the situations of correct decoding and error decoding after receiving data.

In one embodiment, the M code division multiplexing sequences are obtained by cyclically shifting a base sequence γ in the time domain, or the M code division multiplexing sequences are obtained by phase rotating a base sequence γ in the frequency domain; the M code division multiplexing sequences are represented as:

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

wherein, the N represents the index label of the M code division multiplexing sequences;

and M/N code division multiplexing sequences distributed by each time slot in the N time slots are sequences with continuous M/N index labels.

This embodiment gives the formula representing the above M code division multiplexing sequences, and designs that the index labels of the multiple code division multiplexing sequences assigned to each of the N time slots are consecutive, thereby ensuring the orderliness of sequence assignment and reducing the trouble of combing.

In one embodiment, the M/N code division multiplexing sequences allocated to the ith time slot of the N time slots are represented as:

wherein, said m₀Represents the initial phase of the base sequence γ, i ═ 0,1,2, …, N-1;

or, the M/N code division multiplexing sequences allocated to the ith time slot of the N time slots are represented as:

this embodiment gives an expression formula for expressing the sequence allocated to each of the N time slots, and from the analysis of the formula, it can also be known that the index numbers of the multiple code division multiplexing sequences of each time slot are consecutive.

In one embodiment, the P ACK sequences allocated to the ith time slot of the N time slots are sequences with consecutive P index labels, and the P NACK sequences allocated to the ith time slot of the N time slots are sequences with consecutive P index labels.

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

wherein ρ is 0,1,2, …, P-1;

in the ith time slot, in m_csThe code division multiplexing sequence obtained in the case of ρ is an ACK sequence in which P index symbols continue, and m is the same as P index symbols_csThe code division multiplexing sequence obtained under the condition of rho + P is a NACK sequence with continuous P index labels;

or, in the ith time slot, in m_csThe code division multiplexing sequence obtained in the case of ρ is a NACK sequence in which P index symbols are consecutive, in m_csThe code division multiplexing sequence obtained under the condition of rho + P is an ACK sequence with continuous P index labels;

m is_csCode division multiplexing sequence generated when rho and m_csThe code division multiplexing sequences generated when the value is rho + P form a code division multiplexing sequence pair.

In the embodiment of the application, a formula for expressing the continuous sequence of the ACK and the NACK in each time slot is provided, and a pairing mode of the ACK sequence and the NACK sequence is designed.

wherein, said m₀Represents the initial phase of the base sequence gamma, the m₀P/2, where ρ is 0,1,2, …, P-1, and i is 0,1,2, …, N-1;

in the ith time slot, in m_csThe code division multiplexing sequences obtained in the case of ρ are P ACK sequences, m_csThe code division multiplexing sequences obtained under the condition of rho + P are P NACK sequences;

or, in the ith time slot, in m_csThe resulting code division multiplex sequence for ρ is P NACK sequences, at m_csThe code division multiplexing sequences obtained under the condition of rho + P are P ACK sequences;

m is said_csCode division multiplexing sequence generated when rho and m_csForming a code division multiplexing sequence pair by the code division multiplexing sequences generated when the sum is rho + P; when the generated P sequence pairs are distributed to equipment, the P sequence pairs are distributed in sequence according to the sequence of P ═ 0,1,2, … and P-1.

According to the method and the device, the relative sequence of the ACK sequence and the NACK sequence in the same time slot is changed, so that the interference of the feedback sequence between the multicast time slot and the unicast time slot is reduced.

wherein, said m₀Represents the initial phase of the base sequence gamma, the m₀P/2, P-0, 1,2, …, P-1, i-0, 1,2, …, N-1；

In the ith time slot, in m_qThe code division multiplexing sequence obtained when 0 is obtained is an ACK sequence in which P index numbers are consecutive, and m is the same as m_qThe code division multiplexing sequence obtained under the condition of P is a NACK sequence with continuous P index labels;

or, in the ith time slot, in m_qThe code division multiplexing sequence obtained when 0 is obtained is a NACK sequence in which P index symbols are consecutive, and m is a NACK sequence_qThe code division multiplexing sequence obtained under the condition of P is an ACK sequence with continuous P index labels;

when the values of rho are equal, the m_qCode division multiplexing sequence generated when 0 and the m_qForming a code division multiplexing sequence pair by the code division multiplexing sequences generated when the time is P; when the generated P sequence pairs are distributed to equipment, the P sequence pairs are distributed in sequence according to the sequence of P ═ 0,1,2, … and P-1.

On the basis of the previous embodiment, the embodiment of the application further reduces the interference between the ACK sequence and the NACK sequence in the same time slot while reducing the interference when the sequence is fed back between the multicast time slot and the unicast time slot by changing the relative ordering of the ACK sequence and the NACK sequence in the same time slot.

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

when 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 and transmits the first response sequence to the second terminal device on the first time-frequency resource;

or, when the communication between the second terminal device and the first terminal device is unicast communication, the first terminal device sends the first response sequence to the second terminal device on the first time-frequency resource by occupying the plurality of sub-channels according to the first data.

In one embodiment, the first data is received by the first terminal device on a plurality of subchannels, and in a case that the first data is multicast data, each of the receiving devices belonging to the multicast occupies the plurality of subchannels in response to the sequence of the first data to transmit;

or, in a case that the first data is multicast data, each device in all receiving devices of the multicast occupies one of the plurality of sub-channels to transmit in response to the sequence of the first data.

In the above two embodiments, for a data channel using a plurality of sub-channels, mapping manners of response sequences are designed for unicast and multicast, and in a multicast time slot, only one sub-channel is occupied to send a response sequence, so that multicast capacity expansion can be achieved.

In a second aspect, an embodiment of the present invention provides a communication method, where the method includes: the second terminal device transmits first data to the first terminal device at the first time slot; the first time slot is one of N time slots, and 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 according to the first data on a first time-frequency resource, where the first response sequence is one of sequences allocated to the first time slot in M code division multiplexing sequences, the M code division multiplexing sequences are used for responding to data sent on the N time slots on the first time-frequency resource, and M is an integer multiple of N.

r(n)＝γ*e ^{-j*(2*π/M)*n}，n＝0，1，2，3，…，M-1，

wherein ρ is 0,1,2, …, P-1;

m is_csCode division multiplexing sequence generated when being equal to rho and m_csThe code division multiplexing sequences generated when the value is rho + P form a code division multiplexing sequence pair.

m is_csCode division multiplexing sequence generated when rho and m_csForming a code division multiplexing sequence pair by the code division multiplexing sequences generated when the sum is rho + P; when the generated P sequence pairs are distributed to equipment, the P sequence pairs are distributed in sequence according to the sequence of P ═ 0,1,2, … and P-1.

or, in the ith time slot, in m_qThe code division multiplexing sequence obtained when 0 is obtained is a NACK sequence in which P index symbols are consecutive, and m is a NACK sequence _qThe code division multiplexing sequence obtained under the condition of P is an ACK sequence with continuous P index labels;

In one embodiment, the second terminal device transmits the first data to the first terminal device in the first time slot, and the method includes: and the second terminal device occupies a plurality of sub-channels on the first time slot to send the first data to the first terminal device.

The beneficial effects of the method according to any one of the second aspect may be referred to the description in the first aspect, and are not described herein again.

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

a sending unit, 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 one of sequences allocated to the first time slot in M code division multiplexing sequences, 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 M is an integer multiple of N.

r(n)＝γ*e ^{-j*(2*π/M)*n}，n＝0，1，2，3，…，M-1，

wherein ρ is 0,1,2, …, P-1;

or, in the ith time slot, in m_qThe code division multiplexing sequence obtained when 0 is obtained is a NACK sequence in which P index symbols are consecutivem _qThe code division multiplexing sequence obtained under the condition of P is an ACK sequence with continuous P index labels;

In one embodiment, the first data is received by the terminal device on a plurality of subchannels, and the sending unit is specifically configured to:

when the communication between the second terminal device and the terminal device is unicast communication, selecting one sub-channel from the plurality of sub-channels according to the first data, and sending the first response sequence to the second terminal device on the first time-frequency resource;

or, when the communication between the second terminal device and the terminal device is unicast communication, transmitting the first response sequence to the second terminal device on the first time-frequency resource according to the plurality of subchannels occupied by the first data.

In one embodiment, the first data is received by the terminal device on a plurality of subchannels, and in a case that the first data is multicast data, each of the receiving devices belonging to the multicast occupies the plurality of subchannels in response to the sequence of the first data to transmit;

The beneficial effects of any one of the methods in the third aspect may be referred to the description in the first aspect, and are not described herein again.

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

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

r(n)＝γ*e ^{-j*(2*π/M)*n}，n＝0，1，2，3，…，M-1，

wherein ρ is 0,1,2, …, P-1;

in the ith time slot, in m_csThe resulting code division multiplexing sequence in the case of ρ is an ACK sequence with consecutive index indices of P,at m_csThe code division multiplexing sequence obtained under the condition of rho + P is a NACK sequence with continuous P index labels;

or, in the ith time slot, in m_qThe code division multiplexing sequence obtained when the index number is 0 is a NACK sequence with P index numbers consecutive, m_qThe code division multiplexing sequence obtained under the condition of P is an ACK sequence with continuous P index labels;

In one embodiment, the sending unit is specifically configured to: and transmitting the first data to the first terminal device by occupying a plurality of sub-channels in a first time slot.

The beneficial effects of the method according to any one of the fourth aspects may be referred to the description in the first aspect, and are not described herein again.

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

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

and sending a first response sequence to the second terminal device through the sender on a first time-frequency resource according to the first data, wherein the first response sequence is one of sequences allocated to the first time slot in M code division multiplexing sequences, the M code division multiplexing sequences are used for responding to the data sent on the N time slots on the first time-frequency resource, and M is an integral multiple of N.

r(n)＝γ*e ^{-j*(2*π/M)*n}，n＝0，1，2，3，…，M-1，

wherein ρ is 0,1,2, …, P-1;

m is_csCode division multiplexing sequence generated when rho and m_csCode division multiplexing order generated when rho + PThe components form a code division multiplexing sequence pair; when the generated P sequence pairs are distributed to equipment, the P sequence pairs are distributed in sequence according to the sequence of P ═ 0,1,2, … and P-1.

In one embodiment, the transmitting a first response sequence to the second terminal device on a first time-frequency resource by the transmitter according to the first data includes

In a case where the communication between the second terminal device and the terminal device is unicast communication, selecting one of the plurality of sub-channels according to the first data, and transmitting the first response sequence to the second terminal device through the transmitter on the first time-frequency resource;

or, when the communication between the second terminal device and the terminal device is unicast communication, the transmitter transmits the first response sequence to the second terminal device on the first time-frequency resource according to the plurality of subchannels occupied by the first data.

The beneficial effects of the method according to any one of the fifth aspect may be referred to the description in the first aspect, and are not repeated here.

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

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

receiving, by the receiver, a first response sequence sent by the first terminal device on a first time-frequency resource according to the first data, where the first response sequence is one of sequences allocated to the first time slot in M code division multiplexing sequences, the M code division multiplexing sequences are used for responding to data sent on the N time slots on the first time-frequency resource, and M is an integer multiple of N.

r(n)＝γ*e ^{-j*(2*π/M)*n}，n＝0，1，2，3，…，M-1

wherein ρ is 0,1,2, …, P-1;

m is_csCode division multiplexing order generated when rho is equal toColumn and said m_csThe code division multiplexing sequences generated when the value is rho + P form a code division multiplexing sequence pair.

wherein, said m₀Represents the initial phase of the base sequence gamma, the m₀P/2, saidρ -0, 1,2, …, P-1, i-0, 1,2, …, N-1;

In one embodiment, the transmitting, by the transmitter, first data to a first terminal device on a first timeslot includes: transmitting, by the transmitter, the first data to the first terminal device on a first time slot occupying a plurality of subchannels.

The beneficial effects of the method according to any one of the sixth aspect may be referred to the description in the first aspect, and are not described herein again.

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

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

In a ninth aspect, the present invention provides a computer-readable storage medium or a non-volatile storage medium, where a computer program is stored, and the computer program is executed by a processor to implement the communication method according to any one of the first aspect.

In a tenth aspect, an embodiment of the present invention provides a computer-readable storage medium or a non-volatile storage medium, where a computer program is stored, and the computer program is executed by a processor to implement the communication method according to any one of the second aspects.

In an eleventh aspect, an embodiment of the present invention provides a computer program product, which when read and executed by a computer, is to perform the communication method according to any one of the above first aspect or any one of the above second aspect.

In a twelfth aspect, an embodiment of the present invention provides a computer program, which, when executed on a computer, will enable the computer to implement the communication method according to any one of the first aspect or any one of the second aspect.

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

In summary, with the method of the above embodiment, a method for transmitting a response sequence to received data by sharing a time-frequency resource by N time slots is designed. The scheme achieves the purpose of code division multiplexing by using a mode of phase rotation in a frequency domain or cyclic shift in a time domain. So that each time slot can be assigned to a corresponding response sequence. When unicast, multicast and broadcast coexist in one resource pool, no extra signaling overhead is needed, and corresponding time-frequency resources are allocated to each time slot in advance. In addition, considering that the response sequences sent by the equipment in multicast or broadcast have certain consistency, NACK and ACK sequences in the response sequence corresponding to one feedback time slot are designed to be respectively continuous, so that the interference between the NACK and the ACK sequences is reduced.

Drawings

Fig. 1 is a schematic diagram of a system architecture used in a communication method according to an embodiment of the present invention;

fig. 2 is an interaction flow diagram of a communication method according to an embodiment of the present disclosure;

fig. 3 is a schematic diagram of a system frame structure in a communication method according to an embodiment of the present invention;

fig. 4 is a schematic diagram of phase rotation in a communication method according to an embodiment of the present invention;

fig. 5 is a schematic diagram of phase distribution of a sequence in a communication method according to an embodiment of the present invention;

fig. 6 is a schematic diagram of phase distribution of another sequence in the communication method according to the embodiment of the present invention;

fig. 7 is a schematic diagram of phase distribution of another sequence in the communication method according to the embodiment of the present invention;

fig. 8 is a schematic logical structure diagram of a terminal device according to an embodiment of the present disclosure;

fig. 9 is a schematic hardware structure diagram of a terminal device according to an embodiment of the present disclosure;

fig. 10 is a schematic logical structure diagram of another terminal device according to an embodiment of the present application;

fig. 11 is a schematic hardware structure diagram of another terminal device according to an embodiment of the present disclosure;

fig. 12 is a schematic structural diagram of a communication chip according to an embodiment of the present application.

Detailed Description

In order to make the technical solutions of the present invention better understood by those skilled in the art, the technical solutions in the embodiments of the present application will be described below with reference to the drawings in the embodiments of the present application.

First, an exemplary system architecture to which a communication method provided in the embodiment of the present invention is applicable is described below. Referring to fig. 1, the system architecture shown in fig. 1 includes a plurality of vehicle devices that may communicate with each other via unicast, multicast, or broadcast. For example, in fig. 1, the device 1 sends data to the device 2, the device 3, and the device 4, respectively, and after receiving the data, the device 2, the device 3, and the device 4 decode the data, and send response information with correct decoding, that is, an Acknowledgement Character (ACK) to the device 1 if the decoding is correct, and send response information with incorrect decoding, that is, a Negative Acknowledgement Character (NACK) to the device 1 if the decoding is incorrect.

The embodiment of the invention can be applied to the scene of vehicle-to-vehicle communication V2V, and can also be applied to the scene of vehicle networking such as vehicle-to-pedestrian communication V2P, vehicle-to-infrastructure communication V2I and the like. In addition, the embodiment of the invention can also be applied to the scene of the Internet of things such as vehicle-to-network communication V2N and household appliance interconnection.

The communication device of the embodiment of the invention can comprise a vehicle-mounted communication module or other embedded communication modules, can also be a handheld communication device, comprises a mobile phone, a tablet personal computer and the like, and can also comprise equipment in the internet of things such as a roadside unit (RSU), household appliances and the like.

Based on the above description, the communication method provided by the embodiment of the present application is described below with reference to the drawings.

Referring to fig. 2, an interaction flow diagram of a communication method provided in the embodiment of the present application is shown. The method of fig. 2 may include the steps of:

step 201, the second terminal device sends the first data to the first terminal device.

Specifically, the second terminal device may send the first data to the first terminal device in a first time slot, where the first time slot is a time slot of N time slots, the N time slots are sending time slots, and 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 above steps may be vehicle devices shown in fig. 1, and may also be devices in the above-described car networking or internet of things.

Step 202, the first terminal device receives the first data transmitted by the second terminal device.

Step 203, the first terminal device transmits 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 sequences allocated to the first time slot among M code division multiplexing sequences, the M code division multiplexing sequences being used for responding to the data transmitted on the N time slots on the first time-frequency resource, the M being 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 N time slots may be N transmission units that are consecutive in a time domain, or may be N transmission units that are consecutive in a logic domain. The transmission unit may be 1 subframe, or one slot, or other time-frequency resource configured by the system for one transmission. The specific value of N may be configured by a system, such as a sidelink System (SL), according to an actual situation, which is not limited by the present solution.

In a specific embodiment, the M code division multiplexing sequences may be allocated to N timeslots by the base station according to an allocation rule when the network is deployed. Or may be configured to the N time slots according to a specific protocol when the network is deployed. Or the network can be distributed by the base station at a later stage after the network deployment is finished. Or the configuration can be carried out according to a specific protocol at the later stage after the network deployment is finished. The specific allocation time and who allocates the time may be determined according to specific situations, and the scheme is not limited to this.

When there are devices transmitting data in the N time slots, the device receiving the data may reply whether the data is correctly decoded using the pre-assigned sequence. The embodiment of the application does not need network equipment to send the resource scheduling control signaling by pre-distributing the designated response sequence sent in the designated time-frequency resource, thereby saving the network overhead.

It should be noted that, in the following description, the device that receives data in the above-mentioned N time slots may be the first terminal device described in the above-mentioned fig. 2, and the device that transmits data in the N time slots may be the second terminal device described in the above-mentioned fig. 2.

How to allocate the response sequences over the above-mentioned N time slots is described below.

See fig. 3 for a schematic diagram of a system frame structure. Fig. 3 shows an exemplary diagram of a frame structure when N is 1,2, 4. Here, the time slot denoted by a is the N time slots, and the sidelink shared information may be transmitted through a sidelink physical layer shared channel (PSCCH) in these time slots, and the sidelink coNtrol information may also be transmitted through a sidelink physical layer coNtrol channel (PSCCH). The time slot denoted by reference numeral c is a result response allocated by the system for sending whether the received data is correctly decoded on the time slot through a physical downlink feedback channel (PSFCH). The gap between time slot a and time slot c is denoted by b.

In fig. 3, it can be seen that the system allocates one PSFCH to the N timeslots for responding to data transmitted in the N timeslots (for convenience of description, the data transmitted in the N timeslots is referred to as target data in the following) that is, response information transmitted by one or more devices to receive the target data is transmitted in the same time-frequency resource (the time-frequency resource may be the first time-frequency resource described in fig. 2). Considering that different communication systems can coexist, N time slots are defined as logically continuous time slots, and the mapping relationship between the N time slots and their corresponding feedback resources is configured or preconfigured by the system. The corresponding feedback resource comprises a time frequency resource for transmitting the response information of the target data. Then, in order to fully utilize 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 N time slots can be one or more of unicast, multicast and broadcast. For example, each of the N time slots may transmit data in a unicast, multicast or broadcast manner, or some time slots may transmit data in a unicast manner, some time slots may transmit data in a multicast manner, or some other manner that uses the three data transmission manners in combination to transmit data. Since the system cannot predict whether the information transmitted in a time slot in the future is unicast, multicast or broadcast, if a frequency division manner is adopted to allocate the fed back time-frequency resource to each time slot, when the data transmission manner in a time slot is broadcast, i.e. no response is needed to the received data, the waste of the time-frequency resource is caused. If a code division multiplexing mode is adopted to allocate corresponding time frequency resources for each time slot, when one or more time slots in the N time slots are broadcast or have no signal transmission, other time slots bearing unicast or multicast services in the N time slots can use all time frequency resource bandwidths, and particularly if only one time slot in the N time slots needs to feed back a response sequence, the method is equivalent to that receiving equipment on the time slot can solely share the first time frequency resources, so that the time frequency resources are used to the maximum extent.

In the embodiment of the present application, a code division multiplexing sequence is used as the response sequence, and different information is responded by using different sequences. Similar to the sequence of format 0 format among the five formats of the NR Physical Uplink Control Channel (PUCCH), this embodiment also uses the zadoff-chu sequence with a low peak-to-average ratio as the base sequence. And different sequences are obtained as response sequences by performing cyclic shift on the basis of one base sequence in the time domain, or so to speak, sequences with different phases are obtained as response sequences by performing phase rotation on the basis of one base sequence in the frequency domain. This is because, according to the nature of the time-frequency domain of a signal, a phase rotation of a signal in the frequency domain is equivalent to a cyclic shift of the signal in the time domain.

When phase rotation is performed, a problem of whether a plurality of sequences interfere with each other or are aliased when transmitted on the same time-frequency resource needs to be considered. In theory, 360 ° of the phase domain can be divided into infinity as long as it is distinguishable in phase. However, due to the existence of channel multipath effects, a transmitted signal is extended in a time domain at a receiving end, that is, a signal is shifted in a phase, and when a plurality of signals are not distinguished enough in the phase, phase rotation causes aliasing of multiple users, that is, the detection probability of the signals is seriously affected. Therefore, when a sequence is multiplexed by phase rotation, the maximum number of the reusable sequence needs to consider the maximum transmission delay caused by the channel characteristics and the communication range.

The total sequence obtained by phase rotating one base sequence on the frequency domain based on the phase rotation theory can be called as a phase orthogonal sequence. The sequences with orthogonal phases are multiplexed to the same time frequency resource for transmission, and then the sequences with orthogonal phases can be called code division multiplexing sequences.

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

To facilitate understanding of the above-mentioned concept of phase rotation, reference may be made to a phase rotation diagram schematically shown in fig. 4. In fig. 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 pi/12 pi/6. Then it is. And performing phase rotation on the base sequence by 1 time of pi/6, 2 times of pi/6, 3 times of pi/6, … and 11 times of pi/6 on the basis of the phase of the base sequence being 0 to obtain other code division multiplexing sequences.

How to allocate the response sequence over the N time slots is exemplarily described below by taking one subchannel as an example.

In the embodiment of the present application, it is assumed 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 is M' in theory, but since each device that receives data needs to allocate two sequences, one sequence is used to reply to ACK, which is an acknowledgement message that decoding is correct, when the data is decoded correctly, and the other is used to reply to NACK, which is an information that decoding is incorrect, when the data is decoded incorrectly. In addition, in one embodiment, it is designed that the M 'sequences can be equally distributed to the N time slots, and then the number of actually available response sequences for the sub-channel is M floor (M'/(2 × N)) × 2 × N. Where floor is a "rounded down" function, i.e., taking an integer no greater than M'/(2N). For example, if it is assumed that M '/(2 × N) ═ 4.25, then floor (M'/(2 × N)) -4. Here, the values of M' and N are determined according to actual conditions. In this embodiment, however, the value of M may be a positive even number greater than or equal to 2.

Assuming that the sequence multiplexed in the sequence of the sub-channel is γ, the M sequences multiplexed in the sub-channel may be expressed as:

r(n)＝γ*e ^{-j*(2*π/M)*n}and N is 0,1,2,3, …, M-1 (1), wherein N represents index indices of the M sequences.

The M sequences multiplexed on the above subchannels can also be expressed as:

r(n)＝γ*e ^-j*θ*nn is 0,1,2,3, …, M-1 (2), wherein θ is 2 × pi/M. From the above formula, it can be seen that the phase difference between two sequences r (j) and r (j +1) adjacent to each other in the index indices of any two sequences is θ. For example, the phase difference between the sequence r (0) and the sequence r (1) is θ. Wherein j may take the

values

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

In one embodiment, the M sequences multiplexed on the subchannel are equally allocated to the N time slots for use by the device receiving the data transmitted on the N time slots, and then the sequence allocated to each time slot is M/N. In addition, since each device receiving data in the N time slots needs to allocate two sequences as response sequences, the M/N sequences allocated in each time slot may be divided into P/(2 × N) sequence pairs, which may be used for allocating P devices for use. Each of the P sequence pairs includes an ACK sequence and a NACK sequence. That is, P sequences among the M/N sequences allocated in each slot are ACK sequences and P NACK sequences.

Based on the above description, assuming that the slot numbers of the above N slots are denoted by i, i is 0,1,2, …, N-1. In an embodiment, the M/N sequences allocated to the ith time slot of the N time slots may be represented as:

wherein m is₀Represents the initial phase, m, of the base sequence gamma₀The value of (c) may be configured by the system or network side. m is₀The value of (b) may also be configured as 0 by default, in this case, the M/N sequences allocated to the ith time slot of the N time slots are represented as:

note that 2 × pi/M in the above formula (3) and formula (4) can be represented by θ.

As can be seen from the above formula (3) or formula (4), the M/N sequences allocated to the ith slot of the N slots are sequences having consecutive index numbers among the M sequences multiplexed in the subchannel. The M/N sequences allocated to the (i +1) th slot among the N slots are sequences obtained by adding 2P to the index number of each of the M/N sequences allocated to the ith slot among the N slots. For example, assuming that M is 16 and N is 2, each of the N time slots is allocated with 8 sequences. Then 8 sequences allocated to the i-th or 0-th time slot of the N time slots are 8 sequences with index numbers N-0, 1,2,3,4,5,6, and 7, and 8 sequences allocated to the i-th or 1-th time slot of the N time slots are 8 sequences with index numbers N-8, 9,10,11,12,13,14, and 15. Of course, 4 of the 8 sequences allocated to each slot are ACK sequences, and the other 4 are NACK sequences. The values of M and N are determined according to actual conditions, and the scheme is not limited to this.

In one possible embodiment, in the M/N sequences allocated to the i-th slot among the N slots, where the index number is consecutive among the M sequences multiplexed on the subchannel, M/(2 × N), that is, P ACK sequences are also consecutive among the index numbers of the M sequences, and similarly, P NACK sequences are also consecutive among the M sequences, among the M/N sequences allocated per slot. In addition, P ACK sequences and P NACK sequences may constitute P sequence pairs.

For example, in the sequence of 8 index numbers N equal to 0,1,2,3,4,5,6, and 7 allocated to the i equal to 0 slot among the N slots, the sequence of index numbers N equal to 0,1,2, and 3 is an ACK sequence, and the sequence of index numbers N equal to 4,5,6, and 7 is a NACK sequence, but it is needless to say that the sequence of index numbers N equal to 0,1,2, and 3 is a NACK sequence, and the sequence of index numbers N equal to 4,5,6, and 7 is an ACK sequence. Index numbers 0 and 4 may constitute a sequence pair, index numbers 1 and 5 may constitute a sequence pair, index numbers 2 and 6 may constitute a sequence pair, and index numbers 3 and 7 may constitute a sequence pair. Or other combinations may be used to form 4 sequence pairs. The above sequence is only exemplary, and the specific sequence is determined according to practical situations, and the present solution is not limited to this.

In a specific embodiment, when the index numbers of the ACK sequence and the NACK sequence allocated in each time slot are respectively continuous, the M/N sequences allocated to the ith time slot of the N time slots may be represented as:

where ρ is 0,1,2, …, P-1. Or, at m₀When the default configuration of (a) is 0, the M/N sequences allocated to the ith time slot of the N time slots may be represented as:

note that 2 × pi/M in the above formula (5) and formula (6) can be represented by θ.

As can be seen from the above equation (5) or (6), in the ith slot, m is_csThe sequence calculated in the case of ρ is a sequence in which P index symbols are consecutive, and m is the same as P index symbols_csThe sequence calculated when ρ + P is the sequence in which P index symbols continue. At m_csThe sequence calculated for ρ is an ACK sequence, m_csThe sequence calculated in the case of ρ + P is a NACK sequence. Or, alternatively, at m_csThe sequence calculated for ρ is a NACK sequence, at m_csThe sequence calculated in the case of ρ + P is an ACK sequence. The specific sorting assignment is determined according to the actual situation, and the scheme is not limited in this respect.

Further, m is as defined above_csA response sequence generated when the value is ρ and m described above_csThe response sequences generated when P + P constitute a pair of response sequences.

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

p sequences having consecutive index numbers among the M sequences are obtained by the above equations (7) and (8), respectively. Similarly, the P sequences obtained by equation (7) may be ACK sequences, and the sequence obtained by equation (8) may be NACK sequences. The P sequences obtained by formula (7) may be NACK sequences, and the sequence obtained by formula (8) may be ACK sequences. The specific sorting allocation is determined according to the actual situation, and the scheme is not limited to this.

In order to facilitate understanding that M/N sequences allocated to each of the N slots are sequences with consecutive index numbers, and the index numbers of P ACK sequences and NACK sequences in the M/N sequences are respectively consecutive, see fig. 5. FIG. 5 shows an example of m₀The phase distribution of the sequence calculated by the above formula (5) or formula (6), or by the above formula (7) and formula (8) when configured as 0 is shown.

It can be seen in fig. 5 that the ACK sequence and the NACK sequence in each slot are consecutive. Specifically, the index of P NACK sequences in slot 0 is denoted by 0,1,2, …, P-1, and the index of P ACK sequences is denoted by P, P +1, P +2, …, 2P-1. The index of the P NACK sequences in slot 1 is denoted 2P,2P +1,2P +2, …, 3P-1, and the index of the P ACK sequences is denoted 3P,3P +1,3P +2, …, 4P-1. In addition, since each of the subsequent sequences is obtained by phase-rotating the base sequence in the frequency domain and the phase-rotated sequence is obtained by shifting by 2 × pi/M based on the previous sequence, the phase difference between each two adjacent sequences is θ ═ 2 × pi/M.

In addition, it can be seen in fig. 5 that the first sequence in each slot is calculated when ρ ═ 0, and that the respective first sequences of P ACKs and P NACKs in each slot are also calculated when ρ ═ 0.

In a possible implementation, M/N sequences, that is, P sequence pairs, are allocated to the ith time slot of the N time slots, and each sequence pair may be composed of two sequences calculated by the above equations (7) and (8) when ρ is the same. That is, two sequences calculated by the above formula (7) and formula (8) when ρ is 0 are one sequence pair, that is, two sequences calculated by the above formula (7) and formula (8) when ρ is 1 are one sequence pair, and so on until two sequences calculated by the above formula (7) and formula (8) when ρ is P-1 are one sequence pair, thereby obtaining P sequence pairs.

In a specific embodiment, after the P sequence pairs are allocated to the ith time slot, when there is a device transmitting data to multiple devices in the ith time slot, the sequence pairs may be allocated to the multiple devices in the order of the sequence pairs calculated by ρ ═ 0,1,2, …, and P-1 for feeding back response sequences to the devices transmitting data. For example, assuming that 1 transmits data to the device 2 and the device 3 in the ith time slot, the sequence pair calculated by ρ ═ 0 may be assigned to the device 2, and the sequence pair calculated by ρ ═ 1 may be assigned to the device 3.

Based on the above-mentioned way of allocating sequence pairs to devices in order of sequence pairs calculated according to ρ ═ 0,1,2, …, and P-1 for feeding back response sequences to devices transmitting data, two possible optimized embodiments are described below, which can reduce interference between sequences transmitted on the same time-frequency resource to some extent based on the above-mentioned embodiments of sequence allocation.

In a first possible embodiment, assuming that the ith time slot of the N time slots is a multicast transmission mode and the i +1 th time slot is a unicast transmission mode, the sequence allocated to the device receiving data in the i +1 th time slot for feedback is a sequence pair calculated when ρ is 0 in the time slot. According to the allocation manner of the sequences shown in fig. 5, the phase of the sequence fed back by the device receiving data in the (i +1) th 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 difference is smaller, and mutual interference is easy to occur.

Then, to reduce this interference, when allocating the sequence allocated in each time slot to the device, it is not necessary to allocate the sequence from the smallest index number of the sequence from the smallest index number to the largest index number, and may start from the sequence with the second smallest index number, the third smallest index number, the fourth smallest index number, and so on, and then allocate the sequence from the smallest index number to the largest index number in the time slot, and then allocate the sequence from the smallest index number to the largest index number from the smallest index number until all the sequences are allocated.

A possible solution to the above mentioned interference is given as an example below. First, m can be configured₀P/2, the M/N sequences allocated to the ith time slot of the N time slots may be represented as:

note that 2 × pi/M in the above formula (9) can be represented by θ.

In the above-mentioned i-th time slot, in m_csThe response sequence obtained in case of ρ is P ACK sequences, at m_csThe resulting response sequence is P NACK sequences in the case of ρ + P. Or, in the ith time slot, m_csThe response sequence obtained in case of ρ is P NACK sequences, at m_csThe response sequence obtained in the case of ρ + P is P ACK sequences.

M is above_csA response sequence generated when the value is equal to ρ, and m_csForming a response sequence pair by the response sequences generated when the P + P is defined; when the generated P sequence pairs are distributed to equipment, the P sequences are distributed in sequence according to the sequence of P-1, 2, … and P-0.

Of course, m is as defined above₀Can also be configured to other values, e.g. m₀3P/2, etc., m₀Can be an integer greater than or equal to 1, but less than 2x P and not equal to P. The specific value can be determined according to the actual situation, and the scheme does not limit the value.

For ease of understanding, reference may be made to fig. 6. FIG. 6 shows the "in the ith slot, m_csThe response sequence obtained in case of ρ is P NACK sequences, at m_csThe response sequence obtained in the case of ρ + P is P ACK sequences "an exemplary intervention in this caseThe process of dispensing a sequence is presented.

As can be seen in fig. 6, the sequences allocated to the devices by equation (9) have index indices of P ACK sequences within slot 0 that are no longer consecutive, because when allocating a sequence, the allocation is no longer from the sequence with index 0, but from the sequence with index Q (Q may be m)₀) The sequence of (2) is initially allocated, but in order to reduce interference between NACK and ACK, it is preferable that the NACK sequence and the ACK sequence are sequences in which respective index indices are consecutive. Since the scheme is first allocated from the NACK sequence, the index of the NACK sequence is also continuous. And P sequences are allocated to be NACK sequences from the index label Q, and the index label of the last sequence of the P sequences is Q + P-1. And then, starting to allocate ACK sequences, starting from Q + P, returning to the sequence with the index number of 0 to continue allocation until P ACK sequences after the ACK sequences are allocated to the sequence with the maximum index number in the time slot.

The allocation process in other time slots such as time slot 1 is similar to the allocation process for the device in time slot 0, and will not be described again. With this arrangement, the sequence in each slot is also a sequence with consecutive index marks, but a group of sequences of NACK sequence and ACK sequence in the slot is not a sequence with consecutive index marks.

Referring also to fig. 6, when a device transmits data in a multicast manner in slot 0 and transmits data in a unicast manner in slot 1, if the device receiving the data in slot 1 decodes the data in error, a NACK sequence having an index number of 2P + Q may be assigned as a 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). As can be seen from fig. 5, the phase interval is increased by θ × Q, thereby reducing interference and increasing the probability that the sequence detection is correct.

In addition, if the device receiving the data in the above-mentioned slot 1 decodes the data correctly, an ACK sequence with index number Q +3P may be assigned as a response sequence. The ACK sequence of Q +3P has the minimum phase difference θ (Q +3P- (2P-1)) - θ (P + Q +1) from the sequence in slot 0. Compared with fig. 5, it can be seen that the phase interval is also greatly increased by θ × Q, thereby reducing interference and increasing the probability of correct sequence detection.

Of course, the above description is only exemplary, and there are other possible implementations, which are not listed here.

Second possible embodiment, in the first possible embodiment, although the interference between sequences between slots is reduced in the example of fig. 6, since the index labels of the ACK sequences are no longer consecutive and are separated by the NACK sequence, the interference between the ACK sequence and the NACK sequence in the same slot is increased. To solve this problem, the arrangement of the ACK sequence and the NACK sequence within each slot may be adjusted so that the index indices of the ACK sequence and the NACK sequence are respectively continuous, while ensuring that the interference of the sequences between the slots is reduced.

A possible solution to the above problem is given below by way of example. First, m above can be configured₀P/2, the M/N sequences allocated to the ith time slot of the N time slots may be represented as:

note that 2 × pi/M in the above formula (10) may be represented by θ.

In the above-mentioned i-th time slot, in m_qThe response sequence obtained when 0 is the ACK sequence with consecutive P index indices, m_qThe response sequence obtained in the case of P is a NACK sequence with continuous P index labels;

or, in the ith time slot, m_qThe response sequence obtained in the case of 0 is a NACK sequence with consecutive P index indices, at m_qThe response sequence obtained in the case of P is an ACK sequence in which P index numbers continue.

When the values of rho are equal, the m is_qResponse sequence generated when 0 and m above_qThe response sequence generated when P is oneA pair of response sequences; when the generated P sequence pairs are distributed to equipment, the P sequences are distributed in sequence according to the sequence of P-1, 2, … and P-0.

The same is true. In the examples of the present application, m₀Can also be configured to other values, e.g. m₀P or m₀3P/2, etc., m₀Can be an integer greater than or equal to 1, but less than 2x P and not equal to P. The specific value can be determined according to the actual situation, and the scheme does not limit the value.

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

p sequences having consecutive index numbers among the M sequences are obtained by the above equations (11) and (12), respectively. Similarly, the P sequences obtained by equation (11) may be ACK sequences, and the sequence obtained by equation (12) may be NACK sequences. The P sequences obtained by equation (11) may be NACK sequences, and the sequence obtained by equation (12) may be ACK sequences. The specific sorting allocation is determined according to the actual situation, and the scheme is not limited to this.

For ease of understanding, reference may be made to fig. 7. FIG. 7 shows the "in the ith slot, m_qThe response sequence obtained in the case of 0 is a NACK sequence with consecutive P index indices, at m_qThe procedure of allocating a sequence is exemplarily described in the case where the obtained response sequence is an ACK sequence with consecutive index indices "in the case of P.

As can be seen in fig. 7, the sequences allocated to the devices by equation (10), or equation (11) and equation (12), the index numbers of the ACK and NACK sequences in each slot are respectively consecutive. The allocation of the sequences in fig. 7 is different from the allocation of the sequences in fig. 5. The following description takes time slot 0 as an example.

In the time slot 0 of fig. 5, when the sequence is allocated to the device, the sequence is allocated in the order of smaller index numbers from the pair of index numbers 0 and P, for example, the sequence with index numbers 0 and P is allocated to the device 1, then the sequence with index numbers 1 and P +1 is allocated to the device 2, then the sequence with index numbers 2 and P +2 is allocated to the device 3, and so on.

However, in time slot 0 of fig. 7, when allocating sequences to the devices, the sequences are allocated in the order of the smaller index numbers from the pair of sequences with index numbers G and P + G, and when allocating the pairs of sequences with index numbers P-1 and 2P-1, the sequences may be allocated in the order of the smaller index numbers from the pair of sequences with index numbers 0 and P until the sequence pairs in the time slot are allocated completely. For example, the sequence pairs with index numbers G and P + G are firstly allocated to the device 1 for use, then the sequence pairs with index numbers G +1 and P + G +1 are allocated to the device 2 for use, then the sequence pairs with index numbers G +2 and P + G +2 are allocated to the device 3 for use, and the like, after the sequence pairs with index numbers P-1 and 2P-1 are allocated to the device w for use, then the sequence pairs with index numbers 0 and P are allocated to the device w +1 for use, and the like.

The allocation process in other time slots such as time slot 1 is similar to the allocation process for the device in time slot 0, and will not be described again.

The value of index G in FIG. 7 above may be represented by (m)₀mod P) mod M.

According to the method for allocating the sequences, the interference between the ACK sequences and the NACK sequences in the time slots can be reduced under the condition that the interference of the sequences among the time slots is reduced.

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

In one possible implementation, when the device transmits data in the ith time slot of the N time slots, the device occupies multiple sub-channels for transmission, for example, occupies K sub-channels for transmission, where K is an integer greater than or equal to 2. If the device occupies the K sub-channels to send the data to another device independently, that is, the communication between the device and the another device is unicast communication, in this case, after the another device receives the data, it may select whether to send a sequence responding to the decoding of the data to the device sending the data on the K sub-channels. The other device may also select one or more of the K sub-channels to send a sequence that is responsive to whether the data is decoded correctly to the device that sent the data. Of course, the response sequence transmitted by the other device to the device that transmitted the data is a sequence assigned to the other device based on the assignment method. For specific allocation, reference is made to the description of the above method embodiment, and details are not repeated here.

In one possible implementation, when the device transmits data in the ith time slot of the N time slots, the device occupies multiple sub-channels for transmission, for example, occupies K sub-channels for transmission. If the device occupies the K subchannels to send the data to the 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 subchannels to send a sequence that responds whether the data is decoded correctly to the device that sends the data. This means that only P response sequences can be transmitted at most on the K subchannels, because only P pairs of sequence pairs are allocated at most on the ith slot, and each fed back sequence occupies K subchannels to transmit.

In another possible implementation, the multiple devices may also select one of the K sub-channels on each of the multiple devices, and send a sequence that is responsive to whether the data is decoded correctly to the device that sent the data. This indicates that K × P response sequences can be sent at most on the K subchannels, and this embodiment increases the capacity of the device response sequences in the multicast transmission mode in the frequency division multiplexing mode, thereby achieving the purpose of multicast capacity expansion.

In another possible implementation, the multiple devices may also select one or more subchannels from the K subchannels, respectively, and send a sequence that is responsive to whether the data is decoded correctly to the device that sent the data. The specific selection of occupying several sub-channels to send the sequence is determined according to the actual situation, and the scheme is not limited for many times.

Of course, the response sequence transmitted from the plurality of devices to the device that transmitted the data is a sequence assigned to the plurality of devices based on the assignment method. For specific allocation, reference is made to the description of the above method embodiment, and details are not repeated here.

By the method of the embodiment, a method for transmitting a response sequence whether the received data is decoded correctly or not by sharing one time frequency resource by N time slots is designed. The scheme achieves the purpose of code division multiplexing by using a mode of phase rotation in a frequency domain or cyclic shift in a time domain. So that each time slot can be assigned to a corresponding response sequence. When unicast, multicast and broadcast coexist in a resource pool, corresponding time-frequency resources are allocated to each time slot in advance without extra signaling overhead. In addition, considering that the response sequences sent by the equipment in multicast or broadcast have certain consistency, NACK and ACK sequences in the response sequence corresponding to one feedback time slot are designed to be respectively continuous, so that the interference between the NACK and the ACK sequences is reduced.

The scheme provided by the embodiment of the present application is mainly described from the perspective of interaction between terminal devices and how to allocate response sequences to the N timeslots. It is to be understood that each terminal device includes a hardware structure and/or a software module for performing each function in order to realize the above functions. Those skilled in the art will readily appreciate that the present application is capable of being implemented in hardware or a combination of hardware and computer software for performing the various illustrative end devices and algorithm steps described in connection with the embodiments disclosed herein. Whether a function is performed as hardware or computer software drives hardware depends upon the particular application and design constraints imposed on the solution. Skilled artisans may implement the described functionality in varying ways for each particular application, but such implementation decisions should not be interpreted as causing a departure from the scope of the present application.

In the embodiment of the present application, the terminal device may be divided into the functional modules according to the method example, 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 integrated module can be realized in a hardware mode, and can also be realized in a software functional module mode. It should be noted that, in the embodiment of the present application, the division of the module is schematic, and is only one logic function division, and there may be another division manner in actual implementation.

In the case of dividing each functional module by corresponding functions, fig. 8 shows a schematic diagram of a possible logical structure of the first terminal device according to the foregoing embodiment, and the first terminal device 800 includes: a receiving unit 801 and a transmitting unit 802. Illustratively, the receiving unit 801 is configured to support the first terminal device to perform the steps of receiving information in the foregoing illustrated method embodiments. The sending unit 802 is configured to support the first terminal device to perform the steps of sending information in the foregoing illustrated method embodiment.

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

In a hardware implementation, the 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, etc. The transmitting unit 802 may be a transceiving unit, a transceiver, a transmitter or a transmitting circuit or an interface circuit, etc. The storage unit may be a memory. The processing unit, the receiving unit, the transmitting unit and the storing unit may be integrated or coupled together or may be separated.

Fig. 9 is a schematic diagram of a possible hardware structure of the first terminal device according to the foregoing embodiments, provided in an embodiment of the present application. As shown in fig. 9, the first terminal apparatus 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 more antennas 907. These components may be connected by a bus 904, or otherwise, as illustrated by FIG. 9. Wherein:

the network interface 903 may be used for the first terminal apparatus 900 to communicate with other communication devices, such as network devices. In particular, the network interface 903 may be a wired interface.

Receiver 905 may also be used for receive processing, e.g., signal demodulation, of mobile communication signals received by antenna 907. Transmitter 906 may be used for transmit processing, e.g., signal modulation, of the signal output by processor 901. In some embodiments of the present application, receiver 905 may be considered a wireless demodulator and transmitter 906 may be considered a wireless modulator. In the first terminal apparatus 900, the number of the receivers 905 may be one or more, and the number of the transmitters 906 may be one or more. The antenna 907 may be used to convert electromagnetic energy in a transmission line into electromagnetic waves in free space or vice versa. The number of the antennas 907 may be one or more.

The memory 902 may be coupled to the processor 901 via the bus 904 or an input/output port, and the memory 902 may be integrated with the processor 901. The memory 902 is used to store various software programs and/or sets of instructions or data. In particular, the memory 902 may include high-speed random access memory, and may also include 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 a system), such as an embedded operating system like uCOS, VxWorks, RTLinux, etc. The memory 902 may also store a network communication program that may be used to communicate with one or more additional devices, one or more user devices, 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 device, transistor logic, a hardware component, or any combination thereof. Which may implement or perform the various illustrative logical blocks, modules, and circuits described in connection with the disclosure. The processor may also be a combination of certain functions, including for example one or more microprocessors, a combination of digital signal processors and microprocessors, or the like.

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

It should be noted that the first terminal apparatus 900 shown in fig. 9 is only one implementation manner of the embodiment of the present application, and in practical applications, the first terminal apparatus 900 may also include more or less components, and is not limited herein. For specific implementation of the first terminal apparatus 900, reference may be made to the related description in the foregoing method embodiments, and details are not repeated here.

In the case of dividing each functional module by corresponding functions, fig. 10 shows a schematic diagram of a possible logical structure of the second terminal device according to the above embodiment, and the second terminal device 1000 includes: a receiving unit 1001 and a transmitting unit 1002. Exemplarily, the receiving unit 1001 is configured to support the second terminal device to perform the step of receiving information in the foregoing illustrated method embodiment. The transmitting unit 1002 is configured to support the second terminal device to perform the steps of transmitting information in the foregoing illustrated method embodiment.

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

In a hardware implementation, the 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, etc. The transmitting unit 1002 may be a transceiving unit, a transceiver, a transmitter or a transmitting circuit or an interface circuit, etc. The storage unit may be a memory. The processing unit, the receiving unit, the transmitting unit and the storing unit may be integrated or coupled together or may be separated.

Fig. 11 is a schematic diagram of a possible hardware structure of the second terminal device according to the foregoing embodiments, provided in an embodiment of the present application. As shown in fig. 11, the second terminal apparatus 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 more antennas 1107. These components may be connected by a bus 1104 or otherwise, as illustrated in FIG. 11 by a bus. Wherein:

the network interface 1103 may be used for the second terminal apparatus 1100 to communicate with other communication devices, such as network devices. In particular, the network interface 1103 may be a wired interface.

Receiver 1105 may also be used for receive processing, e.g., signal demodulation, of mobile communication signals received by antenna 1107. Transmitter 1106 may be used for transmit processing, e.g., signal modulation, of signals output by processor 1101. In some embodiments of the present application, receiver 1105 may be considered a wireless demodulator and transmitter 1106 may be considered a wireless modulator. In the second terminal apparatus 1100, the number of the receivers 1105 may be one or more, and the number of the transmitters 1106 may be one or more. The antenna 1107 may be used to convert electromagnetic energy in transmission line to electromagnetic wave in free space or to convert electromagnetic wave in free space to electromagnetic energy in transmission line. The number of the antennas 1107 may be one or more.

The memory 1102 may be coupled to the processor 1101 via the bus 1104 or an input-output port, and the memory 1102 may be integrated with the processor 1101. The memory 1102 is used to store various software programs and/or sets of instructions or data. In particular, the memory 1102 may include high-speed random access memory, and may also include 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 a system), such as an embedded operating system (os) like uCOS, VxWorks, RTLinux, etc. The memory 1102 may also store a network communication program that may be used to communicate with one or more additional devices, one or more user devices, one or more network devices.

The processor 1101 may be a central processing unit, general purpose processor, digital signal processor, application specific integrated circuit, field programmable gate array or other programmable logic device, transistor logic device, hardware component, or any combination thereof. Which may implement or perform the various illustrative logical blocks, modules, and circuits described in connection with the disclosure. The processor may also be a combination of certain functions, including for example one or more microprocessors, a combination of digital signal processors and microprocessors, or the like.

In an embodiment of the present application, the processor 1101 may be configured to read and execute computer readable instructions. Specifically, the processor 1101 communication chip 1200 may be configured to call a program stored in the memory 1102, for example, an implementation program of the communication method provided by one or more embodiments of the present application on the second terminal device side, and execute instructions contained in the program.

It should be noted that the second terminal device 1100 shown in fig. 11 is only one implementation manner of the embodiment of the present application, and in practical applications, the second terminal device 1100 may further include more or less components, which is not limited herein. For specific implementation of the second terminal device 1100, reference may be made to the related description in the foregoing illustrated method embodiment, and details are not repeated here.

A further aspect of the present application provides a communication system comprising one or more first terminal devices and one or more second terminal devices, wherein the first terminal device may be the first terminal device 800 described in fig. 8, and the second terminal device may be the second terminal device 1000 described in fig. 10. Alternatively, the first terminal apparatus may be the first terminal apparatus 900 described in fig. 9, and the second terminal apparatus may be the second terminal apparatus 1100 described in fig. 11.

Referring to fig. 12, fig. 12 is a schematic diagram illustrating a structure of a communication chip provided in 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. Wherein:

the processor 1201 may be configured to read and execute computer readable instructions. In a specific implementation, the processor 1201 may mainly include a controller, an operator, and a register. The controller is mainly responsible for instruction decoding and sending out control signals for operations corresponding to the instructions. The arithmetic unit is mainly responsible for executing fixed-point or floating-point arithmetic operation, shift operation, logic operation and the like, and can also execute address operation and conversion. The register is mainly responsible for storing register operands, intermediate operation results and the like temporarily stored in the instruction execution process. In a 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, an advanced reduced instruction set machine (ARM) architecture, an NP architecture, or the like. The processors 1201 may be single core or multi-core.

The interface 1202 may be used to input data to be processed to the processor 1201, and may output a processing result of the processor 1201 to the outside. In a specific implementation, the interface 1202 may be a General Purpose Input Output (GPIO) interface, and may be connected to a plurality of peripheral devices (e.g., a display (LCD), a Radio Frequency (RF) module, etc.). The interface 1202 may be coupled to the processor 1201 via a bus 1203.

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

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

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

It should be noted that the functions corresponding to the processor 1201 and the interface 1202 may be implemented by hardware design, software design, or a combination of hardware and software, which is not limited herein.

An embodiment of the present invention further provides a computer-readable storage medium, which stores a computer program, where the computer program is executed by a processor to implement the communication method described in any one of the foregoing first terminal apparatus sides.

An embodiment of the present invention further provides a computer-readable storage medium, which stores a computer program, where the computer program is executed by a processor to implement the communication method described in any one of the foregoing items on the second terminal apparatus side.

An embodiment of the present invention further provides a computer program product, wherein when the computer program product is read and executed by a computer, any one of the foregoing communication methods on the first terminal apparatus side or any one of the foregoing communication methods on the second terminal apparatus side is executed.

An embodiment of the present invention further provides a computer program, which, when executed on a computer, causes the computer to implement the communication method described in any one of the foregoing first terminal apparatus sides or any one of the foregoing second terminal apparatus sides.

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

In summary, with the method of the above embodiment, a method for sending a response sequence indicating whether the received data is decoded correctly or not by sharing one time-frequency resource by N time slots is designed. The scheme achieves the purpose of code division multiplexing by using a mode of phase rotation in a frequency domain or cyclic shift in a time domain. So that each time slot can be assigned to a corresponding response sequence. When unicast, multicast and broadcast coexist in one resource pool, no extra signaling overhead is needed, and corresponding time-frequency resources are allocated to each time slot in advance. In addition, considering that the response sequences sent by the equipment in multicast or broadcast have certain consistency, NACK (negative acknowledgement) sequences and ACK (acknowledgement) sequences in the response sequences corresponding to one feedback time slot are designed to be respectively continuous, so that the interference between the NACK sequences and the ACK sequences is reduced.

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

The above description is only a preferred embodiment of the present invention, and is not intended to limit the scope of the present invention. Any modification, equivalent replacement, or improvement made within the spirit and principle of the present invention should be included in the protection scope of the present invention.

Claims

A method of communication, comprising:

a first terminal device receiving first data from a second terminal device on a first time slot; the first time slot is one of N time slots, and 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, the first response sequence is one of sequences allocated to the first time slot in M code division multiplexing sequences, the M code division multiplexing sequences are used for responding to the data sent on the N time slots on the first time-frequency resource, and M is an integral multiple of N.
The method of claim 1, wherein a signal bandwidth of each of the M code division multiplexing sequences is the same as a bandwidth of the first time-frequency resource, and wherein the bandwidth of the first time-frequency resource is the same as a bandwidth of a sub-channel in which the first time-frequency resource is located.
The method according to claim 1 or 2, wherein the M code division multiplexing sequences are used to be allocated to the N time slots on average, and M/N code division multiplexing sequences are allocated to each of the N time slots; the M/N code division multiplexing sequences are used for being distributed to P (M/(2) N) devices; each of the P devices is assigned with two sequences, the two sequences including an acknowledgement character ACK sequence and a negative acknowledgement character NACK sequence, P being a positive integer, and M being an integer multiple of P.
The method of claim 3, wherein the M code division multiplexing sequences are obtained by cyclically shifting a base sequence γ in the time domain, or the M code division multiplexing sequences are obtained by phase rotating a base sequence γ in the frequency domain; the M code division multiplexing sequences are represented as:

r(n)＝γ*e ^{-j*(2*π/M)*n}，n＝0，1，2，3，…，M-1，

wherein, the N represents the index label of the M code division multiplexing sequences;

and M/N code division multiplexing sequences distributed by each time slot in the N time slots are sequences with continuous M/N index labels.
The method of claim 4, wherein the M/N code division multiplexing sequences allocated to the ith time slot of the N time slots are represented as:

wherein, said m₀Represents the initial phase of the base sequence γ, i ═ 0,1,2, …, N-1;

or, the M/N code division multiplexing sequences allocated to the ith time slot of the N time slots are represented as:
the method according to claim 4 or 5, wherein the P ACK sequences allocated to the ith time slot of the N time slots are P sequences with consecutive index labels, and the P NACK sequences allocated to the ith time slot of the N time slots are P sequences with consecutive index labels.
The method of claim 6, wherein the M/N code division multiplexing sequences allocated to the ith time slot of the N time slots are represented as:

wherein ρ is 0,1,2, …, P-1;

or, the M/N code division multiplexing sequences allocated to the ith time slot of the N time slots are represented as:

in the ith time slot, in m_csThe code division multiplexing sequence obtained when ρ is an ACK sequence with consecutive index numbers of P, m_csThe code division multiplexing sequence obtained under the condition of rho + P is a NACK sequence with continuous P index labels;

or, in the ith time slot, in m_csThe code division multiplexing sequence obtained in the case of ρ is a NACK sequence in which P index symbols are consecutive, in m_csThe code division multiplexing sequence obtained under the condition of rho + P is an ACK sequence with continuous P index labels;

m is_csCode division multiplexing sequence generated when rho and m_csThe code division multiplexing sequences generated when the value is rho + P form a code division multiplexing sequence pair.
The method of claim 4, wherein the M/N code division multiplexing sequences allocated to the ith time slot of the N time slots are represented as:

wherein, said m₀Represents the initial phase of the base sequence gamma, the m₀P/2, where ρ is 0,1,2, …, P-1, and i is 0,1,2, …, N-1;

in the ith time slot, in m_csThe resulting code division multiplex sequence is P ACK sequences, m_csThe code division multiplexing sequences obtained under the condition of rho + P are P NACK sequences;

or, in the ith time slot, in m_csThe resulting code division multiplex sequence for ρ is P NACK sequences, at m_csCode division multiplexing order obtained in case of ρ + PThe sequence is P ACK sequences;

m is_csCode division multiplexing sequence generated when rho and m_csForming a code division multiplexing sequence pair by the code division multiplexing sequences generated when the code division multiplexing sequence is rho + P; when the generated P sequence pairs are distributed to equipment, the P sequence pairs are distributed in sequence according to the sequence of P ═ 0,1,2, … and P-1.
The method of claim 4, wherein the M/N code division multiplexing sequences allocated to the ith time slot of the N time slots are represented as:

wherein, said m₀Represents the initial phase of the base sequence gamma, the m₀P/2, where ρ is 0,1,2, …, P-1, and i is 0,1,2, …, N-1;

in the ith time slot, in m_qThe code division multiplexing sequence obtained when 0 is obtained is an ACK sequence in which P index numbers are consecutive, and m is the same as m_qThe code division multiplexing sequence obtained under the condition of P is a NACK sequence with continuous P index labels;

or, in the ith time slot, in m_qThe code division multiplexing sequence obtained when 0 is obtained is a NACK sequence in which P index symbols are consecutive, and m is a NACK sequence_qThe code division multiplexing sequence obtained under the condition of P is an ACK sequence with continuous P index labels;

when the values of rho are equal, the m_qCode division multiplexing sequence generated when 0 and the m_qForming a code division multiplexing sequence pair by the code division multiplexing sequences generated when the time is P; when the generated P sequence pairs are distributed to equipment, the P sequence pairs are distributed in sequence according to the sequence of P ═ 0,1,2, … and P-1.
The method according to any of claims 1 to 9, wherein the first data is received by the first terminal device on a plurality of sub-channels, and wherein the first terminal device transmits a first response sequence to the second terminal device on a first time-frequency resource according to the first data, comprising:

when 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 and transmits the first response sequence to the second terminal device on the first time-frequency resource;

or, when the communication between the second terminal device and the first terminal device is unicast communication, the first terminal device sends the first response sequence to the second terminal device on the first time-frequency resource by occupying the plurality of sub-channels according to the first data.
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 in the case that the first data is multicast data, each of the receiving devices belonging to the multicast occupies the plurality of sub-channels for transmission in response to the sequence of the first data;

or, in a case that the first data is multicast data, each device in all receiving devices of the multicast occupies one of the multiple sub-channels to transmit in response to the sequence of the first data.
A method of communication, comprising:

the second terminal device transmits first data to the first terminal device at the first time slot; the first time slot is one of N time slots, and 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 according to the first data on a first time-frequency resource, wherein the first response sequence is one of sequences allocated to the first time slot in M code division multiplexing sequences, the M code division multiplexing sequences are used for responding to the data sent on the N time slots on the first time-frequency resource, and M is an integral multiple of N.
The method of claim 12, wherein a signal bandwidth of each of the M code division multiplexing sequences is the same as a bandwidth of the first time-frequency resource, and wherein the bandwidth of the first time-frequency resource is the same as a bandwidth of a sub-channel in which the first time-frequency resource is located.
The method according to claim 12 or 13, wherein the M code division multiplexing sequences are used to be allocated to the N time slots on average, and M/N code division multiplexing sequences are allocated to each of the N time slots; the M/N code division multiplexing sequences are used for being distributed to P (M/(2) N) devices; each of the P devices is assigned with two sequences, the two sequences including an acknowledgement character ACK sequence and a negative acknowledgement character NACK sequence, P being a positive integer, and M being an integer multiple of P.
The method of claim 14, wherein the M code division multiplexing sequences are obtained by cyclically shifting a base sequence γ in the time domain, or the M code division multiplexing sequences are obtained by phase rotating a base sequence γ in the frequency domain; the M code division multiplexing sequences are represented as:

r(n)＝γ*e ^{-j*(2*π/M)*n}，n＝0，1，2，3，…，M-1，

wherein, the N represents the index label of the M code division multiplexing sequences;

and M/N code division multiplexing sequences distributed by each time slot in the N time slots are sequences with continuous M/N index labels.
The method of claim 15, wherein the M/N code division multiplexing sequences allocated to the ith time slot of the N time slots are represented as:

wherein, said m₀Represents the initial phase of the base sequence γ, i ═ 0,1,2, …, N-1;

or, the M/N code division multiplexing sequences allocated to the ith time slot of the N time slots are represented as:
the method according to claim 15 or 16, wherein the P ACK sequences allocated to the ith time slot of the N time slots are sequences with consecutive P index labels, and the P NACK sequences allocated to the ith time slot of the N time slots are sequences with consecutive P index labels.
The method of claim 17, wherein the M/N code division multiplexing sequences allocated to the ith time slot of the N time slots are represented as:

wherein ρ is 0,1,2, …, P-1;

or, the M/N code division multiplexing sequences allocated to the ith time slot of the N time slots are represented as:

in the ith time slot, in m_csObtained in case of rhoThe code division multiplexing sequence of (1) is an ACK sequence with P continuous index marks in m_csThe code division multiplexing sequence obtained under the condition of rho + P is a NACK sequence with continuous P index labels;

or, in the ith time slot, in m_csThe code division multiplexing sequence obtained in the case of ρ is a NACK sequence in which P index symbols are consecutive, in m_csThe code division multiplexing sequence obtained under the condition of rho + P is an ACK sequence with continuous P index labels;

m is_csCode division multiplexing sequence generated when rho and m_csThe code division multiplexing sequences generated when the value is rho + P form a code division multiplexing sequence pair.
The method of claim 15, wherein the M/N code division multiplexing sequences allocated to the ith time slot of the N time slots are represented as:

wherein, said m₀Represents the initial phase of the base sequence gamma, the m₀P/2, where ρ is 0,1,2, …, P-1, and i is 0,1,2, …, N-1;

in the ith time slot, in m_csThe code division multiplexing sequences obtained in the case of ρ are P ACK sequences, m_csThe code division multiplexing sequences obtained under the condition of rho + P are P NACK sequences;

or, in the ith time slot, in m_csThe resulting code division multiplex sequence for ρ is P NACK sequences, at m_csThe code division multiplexing sequences obtained under the condition of rho + P are P ACK sequences;

m is_csCode division multiplexing sequence generated when rho and m_csThe code division multiplexing sequences generated when the sum of rho and P is equal to the sum of the code division multiplexing sequencesCarrying out pairing; when the generated P sequence pairs are distributed to equipment, the P sequence pairs are distributed in sequence according to the sequence of P ═ 0,1,2, … and P-1.
The method of claim 15, wherein the M/N code division multiplexing sequences allocated to the ith time slot of the N time slots are represented as:

wherein, said m₀Represents the initial phase of the base sequence gamma, the m₀P/2, where ρ is 0,1,2, …, P-1, and i is 0,1,2, …, N-1;

in the ith time slot, in m_qThe code division multiplexing sequence obtained when 0 is obtained is an ACK sequence in which P index numbers are consecutive, and m is the same as m_qThe code division multiplexing sequence obtained under the condition of P is a NACK sequence with continuous P index labels;

or, in the ith time slot, in m_qThe code division multiplexing sequence obtained when the index number is 0 is a NACK sequence with P index numbers consecutive, m_qThe code division multiplexing sequence obtained under the condition of P is an ACK sequence with continuous P index labels;

when the values of rho are equal, the m_qCode division multiplexing sequence generated when 0 and the m_qForming a code division multiplexing sequence pair by the code division multiplexing sequences generated when the time is P; when the generated P sequence pairs are distributed to equipment, the P sequence pairs are distributed in sequence according to the sequence of P ═ 0,1,2, … and P-1.
The method according to any of claims 12 to 20, wherein the second terminal device transmitting the first data to the first terminal device on the first time slot comprises:

and the second terminal device occupies a plurality of sub-channels on the first time slot to send the first data to the first terminal device.
A terminal device, comprising:

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

a sending unit, 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 one of sequences allocated to the first time slot in M code division multiplexing sequences, 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 M is an integer multiple of N.
The terminal apparatus according to claim 22, wherein a signal bandwidth of each of the M code division multiplexing sequences is the same as a bandwidth of the first time-frequency resource, and the bandwidth of the first time-frequency resource is the same as a bandwidth of a sub-channel in which the first time-frequency resource is located.
The terminal apparatus according to claim 22 or 23, wherein the M code division multiplexing sequences are used to be allocated to the N time slots on average, and M/N code division multiplexing sequences are allocated to each of the N time slots; the M/N code division multiplexing sequences are used for being distributed to P (M/(2) N) devices; each of the P devices is assigned with two sequences, the two sequences including an acknowledgement character ACK sequence and a negative acknowledgement character NACK sequence, P being a positive integer, and M being an integer multiple of P.
The terminal apparatus of claim 24, wherein the M code division multiplexing sequences are obtained by cyclic shifting a base sequence γ in time domain, or the M code division multiplexing sequences are obtained by phase rotating a base sequence γ in frequency domain; the M code division multiplexing sequences are represented as:

r(n)＝γ*e ^{-j*(2*π/M)*n}，n＝0，1，2，3，…，M-1

wherein, the N represents the index label of the M code division multiplexing sequences;

and M/N code division multiplexing sequences distributed by each time slot in the N time slots are sequences with continuous M/N index labels.
The terminal apparatus of claim 25, wherein the M/N code division multiplexing sequences allocated to the ith time slot of the N time slots are represented as:

wherein, said m₀Represents the initial phase of the base sequence γ, i ═ 0,1,2, …, N-1;

or, the M/N code division multiplexing sequences allocated to the ith time slot of the N time slots are represented as:
the terminal apparatus according to claim 25 or 26, wherein the P ACK sequences allocated to the ith slot of the N slots are sequences with consecutive P index indices, and the P NACK sequences allocated to the ith slot of the N slots are sequences with consecutive P index indices.
The terminal apparatus of claim 27, wherein the M/N code division multiplexing sequences allocated to the ith time slot of the N time slots are represented as:

wherein ρ is 0,1,2, …, P-1;

or, the M/N code division multiplexing sequences allocated to the ith time slot of the N time slots are represented as:

in the ith time slot, in m_csThe code division multiplexing sequence obtained in the case of ρ is an ACK sequence in which P index symbols continue, and m is the same as P index symbols_csThe code division multiplexing sequence obtained under the condition of rho + P is a NACK sequence with continuous P index labels;

or in the ith time slot, in m_csThe code division multiplexing sequence obtained in the case of ρ is a NACK sequence in which P index symbols are consecutive, in m_csThe code division multiplexing sequence obtained under the condition of rho + P is an ACK sequence with continuous P index labels;

m is_csCode division multiplexing sequence generated when rho and m_csThe code division multiplexing sequences generated when the value is rho + P form a code division multiplexing sequence pair.
The terminal apparatus of claim 25, wherein the M/N code division multiplexing sequences allocated to the ith time slot of the N time slots are represented as:

wherein, said m₀Represents the initial phase of the base sequence gamma, the m₀P/2, where ρ is 0,1,2, …, P-1, and i is 0,1,2, …, N-1;

in the i-th time slot, the number of the first time slots,at m_csThe code division multiplexing sequences obtained in the case of ρ are P ACK sequences, m_csThe code division multiplexing sequences obtained under the condition of rho + P are P NACK sequences;

or, in the ith time slot, in m_csThe resulting code division multiplex sequence for ρ is P NACK sequences, at m_csThe code division multiplexing sequences obtained under the condition of rho + P are P ACK sequences;

m is_csCode division multiplexing sequence generated when rho and m_csForming a code division multiplexing sequence pair by the code division multiplexing sequences generated when the sum is rho + P; when the generated P sequence pairs are distributed to equipment, the P sequence pairs are distributed in sequence according to the sequence of P ═ 0,1,2, … and P-1.
The terminal apparatus of claim 25, wherein the M/N code division multiplexing sequences allocated to the ith time slot of the N time slots are represented as:

wherein, said m₀Represents the initial phase of the base sequence gamma, the m₀P/2, where ρ is 0,1,2, …, P-1, and i is 0,1,2, …, N-1;

in the ith time slot, in m_qThe code division multiplexing sequence obtained when 0 is obtained is an ACK sequence in which P index numbers are consecutive, and m is the same as m_qThe code division multiplexing sequence obtained under the condition of P is a NACK sequence with continuous P index labels;

or, in the ith time slot, in m_qThe code division multiplexing sequence obtained when 0 is obtained is a NACK sequence in which P index symbols are consecutive, and m is a NACK sequence_qThe code division multiplexing sequence obtained under the condition of P is an ACK sequence with continuous P index labels;

when the values of rho are equal, the m_qCode division multiplexing sequence generated when 0 and the m_qForming a code division multiplexing sequence pair by the code division multiplexing sequences generated when the time is P; when the generated P sequence pairs are distributed to equipment, the P sequence pairs are distributed in sequence according to the sequence of P ═ 0,1,2, … and P-1.
The terminal device according to any of claims 22 to 30, wherein the first data is received by the terminal device on a plurality of subchannels, and the sending unit is specifically configured to:

when the communication between the second terminal device and the terminal device is unicast communication, selecting one sub-channel from the plurality of sub-channels according to the first data, and sending the first response sequence to the second terminal device on the first time-frequency resource;

or, when the communication between the second terminal device and the terminal device is unicast communication, transmitting the first response sequence to the second terminal device on the first time-frequency resource according to the plurality of subchannels occupied by the first data.
The terminal apparatus according to any one of claims 22 to 30, wherein the first data is received by the terminal apparatus on a plurality of sub-channels, and in the case that the first data is multicast data, each of the receiving devices belonging to the multicast occupies the plurality of sub-channels for transmission in response to the sequence of the first data;

or, in a case that the first data is multicast data, each device in all receiving devices of the multicast occupies one of the plurality of sub-channels to transmit in response to the sequence of the first data.
A terminal device, comprising:

a transmitting unit configured to transmit first data to a first terminal apparatus in a first slot; the first time slot is one of N time slots, and N is an integer greater than or equal to 1;

a receiving unit, configured to receive a first response sequence sent by the first terminal device according to the first data on a first time/frequency resource, where the first response sequence is one of sequences allocated to the first time slot in M code division multiplexing sequences, the M code division multiplexing sequences are used to respond to data sent on the N time slots on the first time/frequency resource, and M is an integer multiple of N.
The terminal apparatus of claim 33, wherein a signal bandwidth of each of the M code division multiplexing sequences is the same as a bandwidth of the first time-frequency resource, and wherein the bandwidth of the first time-frequency resource is the same as a bandwidth of a sub-channel in which the first time-frequency resource is located.
The terminal apparatus according to claim 33 or 34, wherein the M code division multiplexing sequences are used to be allocated to the N time slots on average, and M/N code division multiplexing sequences are allocated to each of the N time slots; the M/N code division multiplexing sequences are used for being distributed to P (M/(2) N) devices; each of the P devices is assigned with two sequences, the two sequences including an acknowledgement character ACK sequence and a negative acknowledgement character NACK sequence, P being a positive integer, and M being an integer multiple of P.
The terminal apparatus of claim 35, wherein the M code division multiplexing sequences are obtained by cyclic shifting a base sequence γ in time domain, or the M code division multiplexing sequences are obtained by phase rotating a base sequence γ in frequency domain; the M code division multiplexing sequences are represented as:

r(n)＝γ*e ^{-j*(2*π/M)*n}，n＝0，1，2，3，…，M-1，

wherein, the N represents the index label of the M code division multiplexing sequences;

and M/N code division multiplexing sequences distributed by each time slot in the N time slots are sequences with continuous M/N index labels.
The terminal apparatus of claim 36, wherein the M/N code division multiplexing sequences allocated to the ith time slot of the N time slots are represented as:

wherein, m is₀Represents the initial phase of the base sequence γ, i ═ 0,1,2, …, N-1;

or, the M/N code division multiplexing sequences allocated to the ith time slot of the N time slots are represented as:
the terminal apparatus according to claim 36 or 37, wherein the P ACK sequences allocated to the ith slot of the N slots are sequences with consecutive P index indices, and the P NACK sequences allocated to the ith slot of the N slots are sequences with consecutive P index indices.
The terminal apparatus of claim 38, wherein the M/N code division multiplexing sequences allocated to the ith time slot of the N time slots are represented as:

wherein ρ is 0,1,2, …, P-1;

or, the M/N code division multiplexing sequences allocated to the ith time slot of the N time slots are represented as:

in the ith time slot, in m_csThe code division multiplexing sequence obtained when ρ is an ACK sequence with consecutive index numbers of P, m_csThe code division multiplexing sequence obtained under the condition of rho + P is a NACK sequence with continuous P index labels;

or, in the ith time slot, in m_csThe code division multiplexing sequence obtained in the case of ρ is a NACK sequence in which P index symbols are consecutive, in m_csThe code division multiplexing sequence obtained under the condition of rho + P is an ACK sequence with continuous P index labels;

m is_csCode division multiplexing sequence generated when rho and m_csThe code division multiplexing sequences generated when the value is rho + P form a code division multiplexing sequence pair.
The terminal apparatus of claim 36, wherein the M/N code division multiplexing sequences allocated to the ith time slot of the N time slots are represented as:

wherein, said m₀Represents the initial phase of the base sequence gamma, the m₀P/2, where ρ is 0,1,2, …, P-1, and i is 0,1,2, …, N-1;

in the ith time slot, in m_csThe code division multiplexing sequences obtained in the case of ρ are P ACK sequences, m_csThe code division multiplexing sequences obtained under the condition of rho + P are P NACK sequences;

or, in the ith time slot, in m_csThe code division multiplexing sequences obtained in the case of ρ are P NACsK sequence at m_csThe code division multiplexing sequences obtained under the condition of rho + P are P ACK sequences;

m is_csCode division multiplexing sequence generated when rho and m_csForming a code division multiplexing sequence pair by the code division multiplexing sequences generated when the sum is rho + P; when the generated P sequence pairs are distributed to equipment, the P sequence pairs are distributed in sequence according to the sequence of P ═ 0,1,2, … and P-1.
The terminal apparatus of claim 36, wherein the M/N code division multiplexing sequences allocated to the ith time slot of the N time slots are represented as:

wherein, said m₀Represents the initial phase of the base sequence gamma, the m₀P/2, where ρ is 0,1,2, …, P-1, and i is 0,1,2, …, N-1;

in the ith time slot, in m_qThe code division multiplexing sequence obtained when 0 is obtained is an ACK sequence in which P index numbers are consecutive, and m is the same as m_qThe code division multiplexing sequence obtained under the condition of P is a NACK sequence with continuous P index labels;

or, in the ith time slot, in m_qThe code division multiplexing sequence obtained when 0 is obtained is a NACK sequence in which P index symbols are consecutive, and m is a NACK sequence_qThe code division multiplexing sequence obtained under the condition of P is an ACK sequence with continuous P index labels;

when the values of rho are equal, the m_qCode division multiplexing sequence generated when 0 and the m_qForming a code division multiplexing sequence pair by the code division multiplexing sequences generated when the time is P; when the generated P sequence pairs are distributed to equipment, the P sequence pairs are distributed in sequence according to the sequence of P ═ 0,1,2, … and P-1.
The terminal device according to any one of claims 33 to 41, wherein the sending unit is specifically configured to:

transmitting the first data to the first terminal device occupying a plurality of sub-channels in a first time slot.
A communication system comprising a first terminal device and a second terminal device, wherein the first terminal device is the terminal device of any one of claims 22 to 32 and the second terminal device is the terminal device of any one of claims 33 to 42.
A computer-readable storage medium, characterized in that the computer-readable storage medium stores a computer program which is executed by a processor to implement the communication method of any one of claims 1 to 11.
A computer-readable storage medium, characterized in that the computer-readable storage medium stores a computer program which is executed by a processor to implement the communication method of 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 12 to 21 is executed.
A computer program for causing a computer to carry out the communication method of any one of claims 1 to 11 or 12 to 21 when the computer program is carried out on the computer.
A communication chip comprising a processor and a communication interface, characterized in that the communication chip is configured to perform the method of any one of claims 1 to 11 or 12 to 21.