Communication resource determination method and apparatus and device

Abstract

The present disclosure relates to the technical field of communications, and provides a communication resource determination method and apparatus and a device. The method comprises: determining a scheduling unit of a delay-Doppler (DD) domain, wherein the scheduling unit is used for an orthogonal time-frequency space (OTFS) modulation system. According to the method disclosed in the present disclosure, a scheduling unit of a DD domain is determined, so that the design of a scheduling unit for an OTFS system in the DD domain is realized, a signal and / or data can be mapped to the designed scheduling unit, and thus communication tasks such as signal and / or data transmission are carried out by utilizing the scheduling unit.

Description

Method, device and equipment for determining communication resources Technical Field

[0001] The present disclosure relates to the field of communication technology, and in particular to a method, apparatus, and device for determining communication resources. Background Art

[0002] Orthogonal Time-Frequency-Space (OTFS) modulation is a two-dimensional modulation scheme designed in the delay-Doppler (DD) domain. Through two-dimensional transformation, it can convert a dual-dispersion channel into a nearly flat-fading channel in the DD domain. However, there is no prior art design for a scheduling unit in the DD domain for OTFS systems.

[0003] Summary of the Invention

[0004] The communication resource determination method, apparatus, and device proposed in the present disclosure are executed by a first device to determine a scheduling unit in the delay-Doppler (DD) domain, thereby realizing a DD domain scheduling unit design that can adapt to the OTFS system.

[0005] In a first aspect, an embodiment of the present disclosure provides a method for determining communication resources, which is executed by a first device. The method includes: determining a scheduling unit in a delay-Doppler (DD) domain, wherein the scheduling unit is used in an orthogonal time-frequency-space (OTFS) modulation system.

[0006] In some embodiments of the present disclosure, the parameters of the scheduling unit include a first parameter and a second parameter, the first parameter includes: M, the number of symbols of the scheduling unit in the delay domain; N, the number of subcarriers of the scheduling unit in the Doppler domain; the second parameter includes: t, the duration of each symbol of the scheduling unit in the delay domain; f, the interval of each subcarrier of the scheduling unit in the Doppler domain.

[0007] In some embodiments of the present disclosure, the first parameter satisfies at least one of the following: M=M', where M' represents the number of subcarriers in the frequency domain of the scheduling unit in the time-frequency domain; N=N', where N' represents the number of symbols in the time domain of the scheduling unit in the time-frequency domain.

[0008] In some embodiments of the present disclosure, M = m × a, where m represents the number of resource blocks (RBs) included in the scheduling unit in the frequency domain, a represents the number of subcarriers included in each RB, and m is a positive integer; N = n × b, where n represents the number of time units included in the scheduling unit in the time domain, b represents the number of symbols included in each time unit, and n = 2 k , k is an integer greater than or equal to 0.

[0009] In some embodiments of the present disclosure, when the scheduling unit inserts the first cyclic prefix CP, a=12; b=14.

[0010] In some embodiments of the present disclosure, when the scheduling unit inserts the second cyclic prefix CP, a=12; b=12.

[0011] In some embodiments of the present disclosure, the second parameter satisfies at least one of the following: Where M' represents the number of subcarriers in the frequency domain of the scheduling unit in the time-frequency domain, f c Represents the spacing of each subcarrier in the frequency domain in the time-frequency domain; Wherein, N' represents the number of symbols in the time domain of the scheduling unit in the time-frequency domain, and T represents the duration of each symbol in the time domain in the time-frequency domain.

[0012] In some embodiments of the present disclosure, when the scheduling unit inserts the first cyclic prefix CP or the second CP, f c =15×10 3 ×2 k , where k is an integer greater than or equal to 0;

[0013] In some embodiments of the present disclosure, when the scheduling unit does not insert the first cyclic prefix CP, f c =15×10 3 ×2 k , where k is an integer greater than or equal to 0;

[0014] In some embodiments of the present disclosure, when the scheduling unit does not insert the second cyclic prefix CP, f c =15×10 3 ×2 k , where k is an integer greater than or equal to 0;

[0015] In some embodiments of the present disclosure, when the scheduling unit does not insert the second cyclic prefix CP, k is 2, that is, f c =6×10 4 ,at this time

[0016] In some embodiments of the present disclosure, the sampling period for inserting the CP by the scheduling unit is T1, the number of sampling points is K, and the scheduling unit inserts the CP every I symbols in the time domain, 1≤I≤14.

[0017] In some embodiments of the present disclosure, T1 is a time unit, which can be K is 2048, I=1, wherein the number of sampling points of the 0th CP and the 7th CP in the time domain of the scheduling unit is 160, and the number of sampling points of other CPs is 144.

[0018] In some embodiments of the present disclosure, T1 is a time unit, which can be K is 2048, 1<I≤14, where CP is added at the starting position of consecutive I symbols. The number of sampling points of the kth CP added in T1 is: where K i Indicates the number of sampling points to which CP is added to the i-th symbol when CP is added to each symbol in T1, i≤I.

[0019] In some embodiments of the present disclosure, the method further includes: mapping the signal and / or data to a scheduling unit.

[0020] In a second aspect, an embodiment of the present disclosure provides a communication resource determination device, which includes a processing unit for determining a scheduling unit in a delay-Doppler (DD) domain, wherein the scheduling unit is used in an orthogonal time-frequency-space (OTFS) modulation system.

[0021] In a third aspect, an embodiment of the present disclosure provides a communication device, comprising: a transceiver; a memory; and a processor, which is connected to the transceiver and the memory, respectively, and is configured to control the wireless signal reception and transmission of the transceiver by executing computer-executable instructions on the memory, so that the device executes the above-mentioned method of the first aspect.

[0022] In a fourth aspect, an embodiment of the present disclosure provides a computer storage medium, wherein the computer storage medium stores computer-executable instructions; after the computer-executable instructions are executed by a processor, the above-mentioned method of the first aspect can be implemented. BRIEF DESCRIPTION OF THE DRAWINGS

[0023] The above and / or additional aspects and advantages of the present disclosure will become apparent and readily understood from the following description of the embodiments in conjunction with the accompanying drawings, in which:

[0024] FIG1 is a flow chart of a method for determining communication resources according to an embodiment of the present disclosure;

[0025] FIG2 is a schematic diagram of a flow chart of an OTFS-OFDM system provided by an embodiment of the present disclosure;

[0026] FIG3 is a schematic diagram of a method for inserting a cyclic prefix CP of a symbol within a time unit provided by an embodiment of the present disclosure;

[0027] FIG4 is a schematic diagram of a method for inserting a cyclic prefix CP of a symbol within a time unit provided by an embodiment of the present disclosure;

[0028] FIG5 is a flow chart of a method for determining communication resources according to an embodiment of the present disclosure;

[0029] FIG6 is a schematic structural diagram of a communication resource determination device provided by an embodiment of the present disclosure;

[0030] FIG7 is a schematic structural diagram of a communication device provided by an embodiment of the present disclosure;

[0031] FIG8 is a schematic structural diagram of a communication device provided by an embodiment of the present disclosure, which is a chip or a chip system. DETAILED DESCRIPTION

[0032] Exemplary embodiments will be described in detail herein, with examples illustrated in the accompanying drawings. In the following description, when referring to the drawings, identical numerals in different figures represent identical or similar elements, unless otherwise indicated. The embodiments described in the following exemplary embodiments are not intended to represent all possible implementations consistent with the present disclosure. Rather, they are merely examples of apparatuses and methods consistent with certain aspects of the present disclosure, as detailed in the appended claims.

[0033] The terms used in the embodiments of the present disclosure are for the purpose of describing specific embodiments only and are not intended to limit the embodiments of the present disclosure. The singular forms "a," "an," and "the" used in the embodiments of the present disclosure and the appended claims are also intended to include plural forms unless the context clearly indicates otherwise. It should also be understood that the term "and / or" used herein refers to and includes any or all possible combinations of one or more associated listed items.

[0034] It should be understood that although the terms first, second, third, etc. may be used to describe various information in the embodiments of the present disclosure, such information should not be limited to these terms. These terms are only used to distinguish information of the same type from each other. For example, without departing from the scope of the embodiments of the present disclosure, the first information may also be referred to as the second information, and similarly, the second information may also be referred to as the first information. Depending on the context, the words "if" and "if" as used herein may be interpreted as "at the time of" or "when" or "in response to determining".

[0035] It should be understood that in the embodiments of the present disclosure, unless otherwise specified, the time unit in parameters and expressions is seconds (s), and the frequency unit is Hertz (Hz).

[0036] In some embodiments, devices, etc. can be interpreted as physical or virtual, and their names are not limited to the names recorded in the embodiments. Terms such as "device", "equipment", "device", "circuit", "network element", "node", "function", "unit", "section", "system", "network", "chip", "chip system", "entity", and "subject" can be used interchangeably.

[0037] In some embodiments, the terms "terminal", "terminal device", "user equipment (UE)", "user terminal", "mobile station (MS)", "mobile terminal (MT)", subscriber station, mobile unit, subscriber unit, wireless unit, remote unit, mobile device, wireless device, wireless communication device, remote device, mobile subscriber station, access terminal, mobile terminal, wireless terminal, remote terminal, handset, user agent, mobile client, client, etc. can be used interchangeably.

[0038] In some embodiments, the access network device, core network device, or network device may be replaced by a terminal. For example, the communication between the access network device, core network device, or network device and the terminal is replaced by the communication between multiple terminals (for example, also referred to as

[0039] The embodiments of the present disclosure may also be applied to structures such as device-to-device, vehicle-to-everything (V2X), etc. In this case, the terminal may also have a structure that has all or part of the functions of the access network device. In addition, the terms "uplink" and "downlink" may be replaced with a language corresponding to inter-terminal communication (for example, "side"). For example, uplink channel, downlink channel, etc. may be replaced with side channel, and uplink, downlink, etc. may be replaced with side link.

[0040] In some embodiments, the terminal may be replaced by an access network device, a core network device, or a network device. In this case, the access network device, the core network device, or the network device may have a structure that has all or part of the functions of the terminal.

[0041] In some embodiments, the names of information, etc. are not limited to the names described in the embodiments, and terms such as "information", "message", "signal", "signaling", "report", "configuration", "indication", "instruction", "command", "channel", "parameter", "domain", "field", "symbol", "symbol", "code element", "codebook", "code word", "code point", "bit", "data", "program", and "chip" can be used interchangeably.

[0042] In some embodiments, the terms "reference signal", "pilot", etc. can be used interchangeably.

[0043] The embodiments of the present disclosure are described in detail below. Examples of the embodiments are shown in the accompanying drawings, wherein the same or similar reference numerals represent the same or similar elements throughout. The embodiments described below with reference to the accompanying drawings are exemplary and are intended to be used to explain the present disclosure, and should not be understood as limiting the present disclosure.

[0044] To facilitate understanding, the terms involved in this application are first introduced.

[0045] 1. Orthogonal time-frequency air modulation,

[0046] Orthogonal time-frequency-space modulation is a two-dimensional modulation scheme designed in the delay-Doppler domain. Through a series of two-dimensional transformations, it can convert a dual-dispersion channel into a nearly flat-fading channel in the delay-Doppler domain. In this domain, every symbol in a data frame experiences the same, nearly constant fading.

[0047] 2. Cyclic Prefix (CP),

[0048] A cyclic prefix (CP) is a cyclic structure formed by copying a segment of data after a data symbol to the beginning of the symbol. Based on its length, the CP can be divided into a normal cyclic prefix (Normal Cyclic Prefix) and an extended cyclic prefix (Extended Cyclic Prefix). To mitigate the time-frequency domain symbol interference that occurs when data transmitted in the DD domain is mapped to the time-frequency domain via a dual Fourier transform, a cyclic prefix (CP) can be inserted in the scheduling unit.

[0049] It should be noted that the communication resource determination method provided in any embodiment of the present disclosure can be executed alone, or in combination with possible implementation methods in other embodiments, or in combination with any technical solution in related technologies.

[0050] The communication resource determination method, apparatus, and device provided by the present disclosure are described in detail below with reference to the accompanying drawings.

[0051] FIG1 is a flow chart of a method for determining communication resources provided by an embodiment of the present disclosure. The method is executed by a first device. As shown in FIG1 , the method for determining communication resources may include the following steps:

[0052] Step 101: Determine a scheduling unit in the Delay-Doppler (DD) domain.

[0053] In some embodiments of the present disclosure, the first device may determine a scheduling unit in the Delay-Doppler (DD) domain, so that the first device may call the scheduling unit to perform a communication task.

[0054] In some embodiments of the present disclosure, the scheduling unit can be used in an Orthogonal Time-Frequency-Space (OTFS) system, or in an OTFS-OFDM system formed by integrating an OTFS system with an OFDM system. For example, an OTFS-OFDM system can be formed by adding an inverse finite Fourier transform (IFT) preprocessing module to the transmitter of an OFDM system and adding an IFT module to the receiver of the OFDM system, as shown in FIG2 . The present disclosure does not limit the application system of the scheduling unit.

[0055] In some embodiments of the present disclosure, there is no limitation on the name of the first device, which may be, for example, a "scheduling device", a "resource device", etc.

[0056] In some embodiments of the present disclosure, the first device may be a device for scheduling communication resources, wherein the scheduled communication resources may be time-frequency resources in the time-frequency domain or OTFS resources in the DD domain, which is not limited by the present disclosure.

[0057] In some embodiments of the present disclosure, the first device may be a network device. It should be understood that with the development of communication technology, the first device may also be a terminal device, and the present disclosure does not limit this.

[0058] In some embodiments of the present disclosure, the first device may be a transmitting device or a receiving device, which is not limited in the present disclosure.

[0059] In some embodiments of the present disclosure, there is no limitation on determining the application transmission channel of the DD domain scheduling unit, which may be, for example, uplink transmission, downlink transmission, and sidelink transmission.

[0060] In some embodiments of the present disclosure, the parameters of the scheduling unit include a first parameter and a second parameter, wherein the first parameter includes M, the number of symbols of the scheduling unit in the delay domain; N, the number of subcarriers of the scheduling unit in the Doppler domain; the second parameter includes: t, the duration of each symbol of the scheduling unit in the delay domain; f, the interval of each subcarrier of the scheduling unit in the Doppler domain.

[0061] In some embodiments of the present disclosure, the first parameter satisfies at least one of the following: M=M', where M' represents the number of subcarriers in the frequency domain of the scheduling unit in the time-frequency domain; N=N', where N' represents the number of symbols in the time domain of the scheduling unit in the time-frequency domain.

[0062] Specifically, the number of symbols of the scheduling unit in the delay domain is M=m×a, where m represents the number of resource blocks RB included in the scheduling unit in the frequency domain, a represents the number of subcarriers included in each RB, and m is a positive integer; the number of subcarriers of the scheduling unit in the Doppler domain is N=n×b, where n represents the number of time units included in the scheduling unit in the time domain, b represents the number of symbols included in each time unit, and n=2 k , k is an integer greater than or equal to 0, and the above time unit can be a time slot.

[0063] In an optional embodiment, when the scheduling unit inserts the first cyclic prefix CP, a=12; b=14, where the first cyclic prefix is ​​a normal cyclic prefix.

[0064] In an optional embodiment, when the scheduling unit inserts the second cyclic prefix CP, a=12; b=12, wherein the second cyclic prefix is ​​an extended cyclic prefix.

[0065] In some embodiments of the present disclosure, the second parameter satisfies at least one of the following: Where M' represents the number of subcarriers in the frequency domain of the scheduling unit in the time-frequency domain, f c Represents the spacing of each subcarrier in the frequency domain in the time-frequency domain; Wherein, N' represents the number of symbols in the time domain of the scheduling unit in the time-frequency domain, and T represents the duration of each symbol in the time domain in the time-frequency domain.

[0066] In some optional embodiments, a cyclic prefix CP is inserted into the scheduling unit, and the duration T of each symbol in the time domain in the time-frequency domain should satisfy The cyclic prefix CP can be the first CP or the second CP, f c Represents the spacing of each subcarrier in the frequency domain in the time-frequency domain.

[0067] Specifically, in some optional embodiments, when the scheduling unit inserts the first cyclic prefix CP or the second CP, f c =15×10 3 ×2 k , where k is an integer greater than or equal to 0; In other words, when the scheduling unit inserts the first cyclic prefix CP, f c =15×10 3 ×2 k , where k is an integer greater than or equal to 0; When the scheduling unit inserts the second CP, the interval between each subcarrier in the frequency domain in the time-frequency domain is 6×10 4 , that is, f c =6×10 4 ,k=2, at this time

[0068] In some optional embodiments, the cyclic prefix CP is not inserted into the scheduling unit, and the duration T of each symbol in the time domain in the time-frequency domain should be equal to the quotient of one absolute time unit divided by the total number of symbols in the absolute time unit. For example, one absolute time unit is 10 -3 s, there are 14 symbols in this absolute time unit, then T should be equal to

[0069] Specifically, in some optional embodiments, when the scheduling unit does not insert the first cyclic prefix CP, that is, 10 -3 There are 14 symbols in s and the first cyclic prefix CP is not inserted before each symbol, f c =15×10 3 ×2 k , where k is an integer greater than or equal to 0;

[0070] Specifically, in some optional embodiments, when the scheduling unit does not insert the second cyclic prefix CP, that is, 10 -3 s has 12 symbols and no second cyclic prefix CP is inserted before each symbol, f c =15×10 3 ×2 k , where k is an integer greater than or equal to 0;

[0071] Specifically, in some optional embodiments, when the scheduling unit does not insert the second cyclic prefix CP, the interval of each subcarrier in the frequency domain in the time-frequency domain is 6×10 4 , that is, f c =6×10 4 ,k=2, at this time

[0072] In some embodiments of the present disclosure, CP may be inserted into the scheduling unit in the following manner: the scheduling unit inserts CP every I symbols in the time domain, 1≤I≤14, the sampling period for inserting CP by the scheduling unit is T1, and the number of sampling points is K.

[0073] Specifically, in some optional embodiments, T1 is a time unit, K is 2048, and I = 1. The scheduling unit uses 160 sampling points for the 0th and 7th CPs in the time domain, and 144 sampling points for all other CPs. In other words, a CP can be added to each time-domain symbol within a time unit. For example, as shown in FIG3 , the sampling period is one time slot, and each time slot has 2048 sampling points. Therefore, the number of CP sampling points for the 0th and 7th symbols is 160, and the number of CP sampling points for all other symbols is 144.

[0074] Specifically, in some optional embodiments, T1 is a time unit, K is 2048, 1<I≤14, wherein the CP is added at the start position of consecutive I symbols, and the number of sampling points of the kth CP added in T1 is: where K i Indicates the number of sampling points for adding a CP to the i-th symbol when a CP is added to every symbol within T1, where i ≤ I. In other words, a CP can be added to some symbols within a time unit based on a certain rule, and the number of sampling points for each CP can be the same or different. For example, as shown in Figure 4, if the sampling period is one time slot and each time slot has 2048 sampling points, then a CP can be added only to the first symbol, and the number of sampling points for this CP is 2048. For example, if the sampling period is one time slot and each time slot has 2048 sampling points, then a CP can be added every three symbols, that is, only before the 0th, 2nd, 4th, 6th, 8th, 10th, and 12th symbols.

[0075] In summary, the communication resource determination method provided in this disclosure includes determining a scheduling unit in the Delay-Doppler (DD) domain, where the scheduling unit is used in an Orthogonal Time-Frequency-Space (OTFS) modulation system. By determining the scheduling unit in the Delay-Doppler (DD) domain, the method of this disclosure implements a scheduling unit design for an OTFS system in the DD domain, enabling signals and / or data to be mapped to the designed scheduling unit, thereby utilizing the scheduling unit to perform communication tasks such as signal and / or data transmission.

[0076] FIG5 is a flow chart of a method for determining communication resources provided by an embodiment of the present disclosure. The method is executed by a first device. As shown in FIG5 , the method for determining communication resources may include the following steps:

[0077] Step 501: Map signals and / or data to a scheduling unit.

[0078] In some embodiments of the present disclosure, the first device may map the signal and / or data to the scheduling unit to send the signal and / or data using the scheduling unit.

[0079] In some embodiments of the present disclosure, there is no limitation on the name of the first device, which may be, for example, a "scheduling device", a "resource device", etc.

[0080] In some embodiments of the present disclosure, the first device may be a device for scheduling communication resources, wherein the scheduled communication resources may be time-frequency resources in the time-frequency domain or OTFS resources in the DD domain, which is not limited by the present disclosure.

[0081] In some embodiments of the present disclosure, the first device may be a network device. It should be understood that with the development of communication technology, the first device may also be a terminal device, and the present disclosure does not limit this.

[0082] In some embodiments of the present disclosure, the first device may be a transmitting device or a receiving device, which is not limited in the present disclosure.

[0083] For example, if the first device is a transmitting network device, the first device may map a channel state information reference signal (CSI-RS) to a scheduling unit to send the channel state information reference signal using the scheduling unit.

[0084] In summary, the communication resource determination method provided in this disclosure includes mapping signals and / or data to a scheduling unit. By mapping signals and / or data to a scheduling unit and utilizing the scheduling unit to perform communication tasks such as signal and / or data transmission, the disclosed solution can improve communication stability in high-mobility scenarios and reduce high signal penetration losses in scenarios with rapid and frequent signal switching.

[0085] FIG6 is a structural diagram of a communication resource determination device 600 provided in an embodiment of the present disclosure.

[0086] As shown in FIG6 , the communication resource determination apparatus 600 includes a processing unit 610 , which is configured to determine a scheduling unit in a delay-Doppler (DD) domain, wherein the scheduling unit is used in an orthogonal time-frequency-space (OTFS) modulation system.

[0087] In summary, the communication resource determination device provided by the present disclosure includes a determination device for determining a scheduling unit in the Delay-Doppler (DD) domain, wherein the scheduling unit is used in an Orthogonal Time-Frequency-Space (OTFS) modulation system. Therefore, the communication resource determination method provided by the present disclosure, by determining the scheduling unit in the Delay-Doppler (DD) domain, implements a scheduling unit design for an OTFS system in the DD domain. This allows signals and / or data to be mapped to the designed scheduling unit, thereby utilizing the scheduling unit to perform communication tasks such as signal and / or data transmission.

[0088] In some embodiments of the present disclosure, the parameters of the scheduling unit include a first parameter and a second parameter, the first parameter includes: M, the number of symbols of the scheduling unit in the delay domain; N, the number of subcarriers of the scheduling unit in the Doppler domain; the second parameter includes: t, the duration of each symbol of the scheduling unit in the delay domain; f, the interval of each subcarrier of the scheduling unit in the Doppler domain.

[0089] In some embodiments of the present disclosure, the first parameter satisfies at least one of the following: M=M', where M' represents the number of subcarriers in the frequency domain of the scheduling unit in the time-frequency domain; N=N', where N' represents the number of symbols in the time domain of the scheduling unit in the time-frequency domain.

[0090] In some embodiments of the present disclosure, M = m × a, where m represents the number of resource blocks (RBs) included in the scheduling unit in the frequency domain, a represents the number of subcarriers included in each RB, and m is a positive integer; N = n × b, where n represents the number of time units included in the scheduling unit in the time domain, b represents the number of symbols included in each time unit, and n = 2 k , k is an integer greater than or equal to 0.

[0091] In some embodiments of the present disclosure, when the scheduling unit inserts the first cyclic prefix CP, a=12; b=14.

[0092] In some embodiments of the present disclosure, when the scheduling unit inserts the second cyclic prefix CP, a=12; b=12.

[0093] In some embodiments of the present disclosure, the second parameter satisfies at least one of the following: Where M' represents the number of subcarriers in the frequency domain of the scheduling unit in the time-frequency domain, f c Represents the spacing of each subcarrier in the frequency domain in the time-frequency domain; Wherein, N' represents the number of symbols in the time domain of the scheduling unit in the time-frequency domain, and T represents the duration of each symbol in the time domain in the time-frequency domain.

[0094] In some embodiments of the present disclosure, when the scheduling unit inserts the first cyclic prefix CP or the second CP, f c =15×10 3 ×2 k , where k is an integer greater than or equal to 0;

[0095] In some embodiments of the present disclosure, when the scheduling unit does not insert the first cyclic prefix CP, f c =15×10 3 ×2 k , where k is an integer greater than or equal to 0;

[0096] In some embodiments of the present disclosure, when the scheduling unit does not insert the second cyclic prefix CP, f c =15×10 3 ×2 k , where k is an integer greater than or equal to 0;

[0097] In some embodiments of the present disclosure, when the scheduling unit does not insert the second cyclic prefix CP, k is 2, that is, f c =6×10 4 ,at this time

[0098] In some embodiments of the present disclosure, the sampling period for inserting the CP by the scheduling unit is T1, the number of sampling points is K, and the scheduling unit inserts the CP every I symbols in the time domain, 1≤I≤14.

[0099] In some embodiments of the present disclosure, T1 is a time unit, which can be K is 2048, I=1, wherein the number of sampling points of the 0th CP and the 7th CP in the time domain of the scheduling unit is 160, and the number of sampling points of other CPs is 144.

[0100] In some embodiments of the present disclosure, T1 is a time unit, which can be K is 2048, 1<I≤14, where CP is added at the starting position of consecutive I symbols. The number of sampling points of the kth CP added in T1 is: where K i Indicates the number of sampling points to which CP is added to the i-th symbol when CP is added to each symbol in T1, i≤I.

[0101] In some embodiments of the present disclosure, the processing unit 610 is further configured to map signals and / or data to a scheduling unit.

[0102] Please refer to Figure 7, which is a schematic diagram of the structure of a communication device 700 provided in an embodiment of the present application. Communication device 700 can be a network device or a terminal device, or a chip, chip system, or processor that supports a network device to implement the above method. It can also be a chip, chip system, or processor that supports a terminal device to implement the above method. This device can be used to implement the method described in the above method embodiment. For details, please refer to the description of the above method embodiment.

[0103] The communication device 700 may include one or more processors 701. The processor 701 may be a general-purpose processor or a dedicated processor. For example, it may be a baseband processor or a central processing unit. The baseband processor may be used to process communication protocols and communication data, and the central processing unit may be used to control a communication resource determination device (e.g., a base station, a baseband chip, a terminal device, a terminal device chip, a DU or CU, etc.), execute computer programs, and process computer program data.

[0104] Optionally, the communication device 700 may further include one or more memories 702, on which a computer program 704 may be stored. The processor 701 executes the computer program 704 to enable the communication device 700 to perform the method described in the above method embodiment. Optionally, the memory 702 may also store data. The communication device 700 and the memory 702 may be provided separately or integrated together.

[0105] Optionally, the communication device 700 may further include a transceiver 705 and an antenna 706. The transceiver 705 may be referred to as a transceiver unit, a transceiver, or a transceiver circuit, and is configured to implement transceiver functions. The transceiver 705 may include a receiver and a transmitter. The receiver may be referred to as a receiver or a receiving circuit, and is configured to implement a receiving function; the transmitter may be referred to as a transmitter or a transmitting circuit, and is configured to implement a transmitting function.

[0106] Optionally, the communication device 700 may further include one or more interface circuits 707. The interface circuit 707 is configured to receive code instructions and transmit the instructions to the processor 701. The processor 701 executes the code instructions to enable the communication device 700 to perform the method described in the above method embodiment.

[0107] In one implementation, the processor 701 may include a transceiver for implementing receiving and transmitting functions. For example, the transceiver may be a transceiver circuit, an interface, or an interface circuit. The transceiver circuit, interface, or interface circuit for implementing the receiving and transmitting functions may be separate or integrated. The transceiver circuit, interface, or interface circuit may be used for reading and writing code / data, or may be used for transmitting or delivering signals.

[0108] In one implementation, processor 701 may store a computer program 703. Computer program 703, when executed on processor 701, enables communication device 700 to perform the method described in the above method embodiment. Computer program 703 may be embedded in processor 701, in which case processor 701 may be implemented by hardware.

[0109] In one implementation, the communication device 700 may include a circuit that can implement the functions of sending, receiving, or communicating in the aforementioned method embodiments. The processor and transceiver described in this application can be implemented on an integrated circuit (IC), an analog IC, a radio frequency integrated circuit (RFIC), a mixed signal IC, an application specific integrated circuit (ASIC), a printed circuit board (PCB), an electronic device, etc. The processor and transceiver can also be manufactured using various IC process technologies, such as complementary metal oxide semiconductor (CMOS), N-type metal oxide semiconductor (NMOS), P-type metal oxide semiconductor (positive channel metal oxide semiconductor, PMOS), bipolar junction transistor (BJT), bipolar CMOS (BiCMOS), silicon germanium (SiGe), gallium arsenide (GaAs), etc.

[0110] The communication resource determination device described in the above embodiments may be a network device or a terminal device, but the scope of the communication resource determination device described in this application is not limited thereto, and the structure of the communication resource determination device may not be limited to FIG7 . The communication resource determination device may be an independent device or may be part of a larger device. For example, the communication resource determination device may be:

[0111] (1) An independent integrated circuit (IC), or chip, or chip system or subsystem;

[0112] (2) a collection of one or more ICs, optionally including a storage component for storing data and computer programs;

[0113] (3) ASIC, such as modem;

[0114] (4) Modules that can be embedded in other devices;

[0115] (5) Receivers, terminal devices, intelligent terminal devices, cellular phones, wireless devices, handheld devices, mobile units, vehicle-mounted devices, network devices, cloud devices, artificial intelligence devices, etc.;

[0116] (6)Others, etc.

[0117] If the communication resource determination device can be a chip or a chip system, please refer to the chip structure diagram shown in Figure 8. The chip shown in Figure 8 includes a processor 801 and an interface 802. The number of processors 801 can be one or more, and the number of interfaces 802 can be multiple.

[0118] Optionally, the chip further includes a memory 803, which is used to store necessary computer programs and data.

[0119] Those skilled in the art will also appreciate that the various illustrative logical blocks and steps listed in the embodiments of the present application can be implemented by electronic hardware, computer software, or a combination of both. Whether such functions are implemented by hardware or software depends on the specific application and the design requirements of the entire system. Those skilled in the art may use various methods to implement the functions for each specific application, but such implementation should not be construed as exceeding the scope of protection of the embodiments of the present application.

[0120] The present application also provides a readable storage medium having instructions stored thereon, which implement the functions of any of the above method embodiments when executed by a computer.

[0121] Those skilled in the art will understand that the various numerical numbers such as first and second involved in this application are only for the convenience of description and are not used to limit the scope of the embodiments of this application, and also indicate the order of precedence.

[0122] In this application, at least one can also be described as one or more, and multiple can be two, three, four or more, which is not limited in this application. In the embodiments of this application, for a technical feature, the technical features in the technical feature are distinguished by "first", "second", "third", "A", "B", "C" and "D", and there is no order of precedence or size between the technical features described by "first", "second", "third", "A", "B", "C" and "D".

[0123] The correspondences shown in the tables in this application can be configured or predefined. The values ​​of the information in each table are only examples and can be configured to other values, which are not limited by this application. When configuring the correspondence between information and various parameters, it is not necessarily required to configure all the correspondences shown in each table. For example, in the tables in this application, the correspondences shown in certain rows may not be configured. For another example, appropriate modifications and adjustments can be made based on the above tables, such as splitting, merging, etc. The names of the parameters shown in the titles of the above tables can also use other names that can be understood by the communication resource determination device, and the values ​​or representations of the parameters can also use other values ​​or representations that can be understood by the communication resource determination device. When implementing the above tables, other data structures can also be used, such as arrays, queues, containers, stacks, linear lists, pointers, linked lists, trees, graphs, structures, classes, heaps, hash tables or hash tables, etc.

[0124] The predefined in this application may be understood as defined, predefined, stored, pre-stored, pre-negotiated, pre-configured, solidified, or pre-burned.

[0125] Those skilled in the art will appreciate that the units and algorithm steps of each example described in conjunction with the embodiments disclosed herein can be implemented in electronic hardware, or a combination of computer software and electronic hardware. Whether these functions are performed in hardware or software depends on the specific application and design constraints of the technical solution. Professional and technical personnel can use different methods to implement the described functions for each specific application, but such implementation should not be considered beyond the scope of this application.

[0126] Those skilled in the art will clearly understand that, for the convenience and brevity of description, the specific working processes of the systems, devices and units described above can refer to the corresponding processes in the aforementioned method embodiments and will not be repeated here.

[0127] The above are only specific embodiments of the present application, but the scope of protection of this application is not limited thereto. Any changes or substitutions that can be easily conceived by a person skilled in the art within the technical scope disclosed in this application should be included in the scope of protection of this application. Therefore, the scope of protection of this application should be based on the scope of protection of the claims.

Claims

1. A method for determining communication resources, characterized in that: The method is performed by a first device, and includes: Determine the scheduling unit in the delay-Doppler DD domain, Wherein, the scheduling unit is used in an orthogonal time-frequency-space (OTFS) modulation system.

2. The method according to claim 1, characterized in that The parameters of the scheduling unit include a first parameter and a second parameter. The first parameter includes: M, the number of symbols of the scheduling unit in the delay domain; N, the number of subcarriers of the scheduling unit in the Doppler domain; The second parameter includes: t, the duration of each symbol of the scheduling unit in the delay domain; f, the spacing of each subcarrier of the scheduling unit in the Doppler domain.

3. The method according to claim 2, characterized in that The first parameter satisfies at least one of the following: M=M', where M' represents the number of subcarriers in the frequency domain of the scheduling unit in the time-frequency domain; N=N', where N' represents the number of symbols of the scheduling unit in the time domain in the time-frequency domain.

4. The method according to claim 2 or 3, characterized in that: M=m×a, where m represents the number of resource blocks RB included in the scheduling unit in the frequency domain, a represents the number of subcarriers included in each RB, and m is a positive integer; N = n × b, where n represents the number of time units included in the scheduling unit in the time domain, b represents the number of symbols included in each time unit, and n = 2 k , k is an integer greater than or equal to 0.

5. The method according to claim 4, characterized in that When the scheduling unit inserts the first cyclic prefix CP, a=12; b=14.

6. The method according to claim 4, characterized in that When the scheduling unit inserts the second cyclic prefix CP, a=12; b=12.

7. The method according to any one of claims 2 to 6, characterized in that The second parameter satisfies at least one of the following: Where M' represents the number of subcarriers in the frequency domain of the scheduling unit in the time-frequency domain, f c Represents the spacing of each subcarrier in the frequency domain in the time-frequency domain; Wherein N' represents the number of symbols of the scheduling unit in the time domain in the time-frequency domain, and T represents the duration of each symbol in the time domain in the time-frequency domain.

8. The method according to claim 7, characterized in that In the case where the scheduling unit inserts the first cyclic prefix CP or the second CP, f c =15×10 3 ×2 k , where k is an integer greater than or equal to 0; 9. The method according to claim 7, characterized in that: In the case where the scheduling unit does not insert the first cyclic prefix CP, f c =15×10 3 ×2 k , where k is an integer greater than or equal to 0; 10. The method according to claim 7, characterized in that In the case where the scheduling unit does not insert the second cyclic prefix CP, f c =15×10 3 ×2 k , where k is an integer greater than or equal to 0; 11. The method according to claim 10, characterized in that k is 2.

12. The method according to any one of claims 6 or 8, characterized in that The sampling period for inserting the CP by the scheduling unit is T1, and the number of sampling points is K. The scheduling unit inserts the CP once every I symbols in the time domain, 1≤I≤14.

13. The method according to claim 12, characterized in that T1 is a time unit, K is 2048, I=1, The number of sampling points of the scheduling unit in the time domain for the 0th CP and the 7th CP is 160, and the number of sampling points for other CPs is 144.

14. The method according to claim 12, characterized in that T1 is a time unit, K is 2048, 1<I≤14, The CP is added at the starting position of consecutive I symbols, and the number of sampling points of the kth CP added in T1 is: Where K i It represents the number of sampling points to which the CP is added to the i-th symbol when a CP is added to each symbol in T1, i≤I.

15. The method according to any one of claims 1 to 14, characterized in that The method further comprises: Signals and / or data are mapped to the scheduling unit.

16. A communication resource determination device, characterized in that: The device comprises: A processing unit for determining a scheduling unit in the delay-Doppler DD domain, Wherein, the scheduling unit is used in an orthogonal time-frequency-space (OTFS) modulation system.

17. A communication device, wherein: include: Transceiver; Memory; A processor is connected to the transceiver and the memory, respectively, and is configured to control the wireless signal reception and transmission of the transceiver by executing computer executable instructions on the memory, and can implement any one of the methods of claims 1-15.

18. A computer storage medium, wherein: The computer storage medium stores computer executable instructions; after the computer executable instructions are executed by the processor, the method described in any one of claims 1 to 15 can be implemented.

Images