CN117015037A

CN117015037A - Time-frequency resource limiting method and device, terminal equipment, network equipment and chip

Info

Publication number: CN117015037A
Application number: CN202210442291.4A
Authority: CN
Inventors: 周化雨; 赵思聪; 潘振岗
Original assignee: Spreadtrum Communications Shanghai Co Ltd
Current assignee: Spreadtrum Communications Shanghai Co Ltd
Priority date: 2022-04-25
Filing date: 2022-04-25
Publication date: 2023-11-07

Abstract

The application discloses a time-frequency resource limiting method and device, terminal equipment, network equipment and a chip; the method comprises the following steps: the number of allocated time-frequency resources is expected to be less than or equal to a threshold. Because the embodiment of the application only limits the number of time-frequency resources, the number of frequency domain resources and the number of time domain resources can be respectively and dynamically scheduled, thereby avoiding the limitation of the number of frequency domain resources and the fixed or preconfigured number of time domain resources. In addition, the number of time-frequency resources is limited, so that the cost of the terminal equipment can be reduced, and the possibility of not only avoiding the assumption that the number of time-domain resources is fixed or preconfigured, but also reducing the cost of the terminal equipment can be realized.

Description

Time-frequency resource limiting method and device, terminal equipment, network equipment and chip

Technical Field

The present application relates to the field of communications technologies, and in particular, to a method and apparatus for limiting time-frequency resources, a terminal device, a network device, and a chip.

Background

Currently, standard protocols defined by the third generation partnership project organization (3rd Generation Partnership Project,3GPP) introduce low cost terminal equipment. Lower cost terminal devices, i.e. low-end low cost terminal devices, may be introduced in the future.

However, for low-cost terminal devices at low end, further research is needed to avoid both assuming that the number of time domain resources is fixed or preconfigured and to reduce the cost of the terminal device.

Disclosure of Invention

The application provides a time-frequency resource limiting method and device, terminal equipment, network equipment and a chip, which aim to consider that the number of time-frequency resources is smaller than or equal to a threshold value so as to limit the number of the time-frequency resources, thereby avoiding the possibility of assuming that the number of the time-domain resources is fixed or preconfigured and reducing the cost of the terminal equipment.

In a first aspect, the present application is a time-frequency resource limitation method applied to a terminal device, including:

the number of allocated time-frequency resources is expected to be less than or equal to a threshold.

It can be seen that in order to avoid that the number of time domain resources is fixed or preconfigured, embodiments of the present application may assume that the number of time domain resources is dynamic, i.e. consider dynamically scheduled time domain resources. Meanwhile, in order to reduce the cost of the terminal equipment, the embodiment of the application can comprehensively consider the common quantity of the frequency domain resources and the time domain resources (namely, the quantity of the time domain resources), but not independently consider the quantity of the frequency domain resources or the quantity of the time domain resources, and limit the quantity of the time-frequency resources by considering that the quantity of the time-frequency resources is smaller than or equal to a threshold value.

Because the embodiment of the application only limits the number of time-frequency domain resources, the number of frequency domain resources and the number of time domain resources can be dynamically scheduled at the same time, thereby avoiding the situation that the number of time domain resources is fixed or preconfigured because the number of frequency domain resources is limited only. In addition, limiting the number of time-frequency resources is essentially limiting the number of processing resources in at least one of a PDSCH (PUSCH) memory, a PDSCH (PUSCH) processor, a hybrid automatic repeat request (HARQ) buffer (buffer), and a decoder, so as to reduce the cost of the terminal device, thereby avoiding the possibility of avoiding the assumption that the number of time-domain resources is fixed or preconfigured, and reducing the cost of the terminal device.

In a second aspect, the present application is a time-frequency resource limiting method applied to a network device, including:

and allocating time-frequency resources, wherein the number of the time-frequency resources is smaller than or equal to a threshold value.

In a third aspect, the present application is a time-frequency resource limitation method, applied to a terminal device, including:

it is desirable that the allocated time-frequency resources not map onto the symbol where CORESET is located.

It can be seen that, since the time-frequency resource is not mapped to the symbol where CORESET is located, buffering the time-frequency resource is not needed in the process of receiving PDCCH (PDCCH in CORESET), so that the computing resource and the memory can be reduced, and the cost can be reduced.

A fourth aspect of the present application is a time-frequency resource limitation method, applied to a network device, including:

and allocating time-frequency resources which are not mapped to the symbols where CORESET is located.

In a fifth aspect, the present application is a time-frequency resource limiting device, including:

and the expecting unit is used for expecting the quantity of the allocated time-frequency resources to be less than or equal to a threshold value.

A sixth aspect is a time-frequency resource limiting device of the present application, including:

and the allocation unit is used for allocating the time-frequency resources, and the number of the time-frequency resources is smaller than or equal to a threshold value.

A seventh aspect is a time-frequency resource limiting device of the present application, including:

An eighth aspect is a time-frequency resource limiting device of the present application, including:

and the expecting unit is used for expecting that the allocated time-frequency resource is not mapped to the symbol where CORESET is located.

A ninth aspect, the steps in the method as set forth in the first aspect or the third aspect are applied to a terminal device.

In a tenth aspect, the steps in the method designed in the second aspect or the fourth aspect are applied in a network device.

An eleventh aspect is a terminal device of the present application, comprising a processor, a memory and a computer program or instructions stored on the memory, wherein the processor executes the computer program or instructions to implement the steps in the method designed in the first or third aspect.

A twelfth aspect is a network device according to the present application, which includes a processor, a memory, and a computer program or instructions stored on the memory, where the processor executes the computer program or instructions to implement the steps in the method designed in the second aspect or the fourth aspect.

A thirteenth aspect is a chip according to the present application, comprising a processor, wherein the processor performs the steps in the method designed in the first aspect, the second aspect, the third aspect or the fourth aspect.

A fourteenth aspect is a chip module according to the present application, including a transceiver component and a chip, where the chip includes a processor, and the processor executes the steps in the method designed in the first aspect, the second aspect, the third aspect, or the fourth aspect.

A fifteenth aspect is a computer readable storage medium of the present application, in which a computer program or instructions are stored which, when executed, implement the steps in the method devised in the first, second, third or fourth aspects above.

A sixteenth aspect is a computer program product according to the present application, comprising a computer program or instructions which, when executed, implement the steps in the method devised in the first, second, third or fourth aspect above.

The technical effects of the second, fifth, sixth and ninth to sixteenth aspects may be seen in the technical effects of the first aspect, and are not repeated here.

The advantages of the fourth, seventh, eighth to sixteenth aspects may be seen by the advantages of the third aspect, and are not described here again.

Drawings

In order to more clearly illustrate the technical solutions of the embodiments of the present application, the drawings used in the description of the embodiments or the prior art will be briefly described below.

FIG. 1 is a schematic diagram of a communication system architecture according to an embodiment of the present application;

fig. 2 is a flowchart of a time-frequency resource limitation method according to an embodiment of the present application;

FIG. 3 is a flow chart of another time-frequency resource limitation method according to an embodiment of the present application;

FIG. 4 is a flow chart of another time-frequency resource limitation method according to an embodiment of the present application;

FIG. 5 is a flow chart of another time-frequency resource limitation method according to an embodiment of the present application;

fig. 6 is a functional unit block diagram of a time-frequency resource limiting device according to an embodiment of the present application;

fig. 7 is a functional unit block diagram of a time-frequency resource limiting device according to still another embodiment of the present application;

fig. 8 is a schematic structural diagram of a terminal device according to an embodiment of the present application;

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

Detailed Description

It should be understood that the terms "first," "second," and the like, as used in embodiments of the present application, are used for distinguishing between different objects and not for describing a particular sequential order. Furthermore, the terms "comprise" and "have," as well as any variations thereof, are intended to cover a non-exclusive inclusion. For example, a process, method, software, article, or apparatus that comprises a list of steps or elements is not limited to only those listed steps or elements but may include other steps or elements not listed or inherent to such process, method, article, or apparatus.

Reference in the specification to "an embodiment" means that a particular feature, structure, or characteristic described in connection with the embodiment may be included in at least one embodiment of the application. The appearances of such phrases in various places in the specification are not necessarily all referring to the same embodiment, nor are separate or alternative embodiments mutually exclusive of other embodiments. Those of skill in the art will explicitly and implicitly appreciate that the embodiments described herein may be combined with other embodiments.

In the embodiment of the application, "and/or" describes the association relation of the association objects, which means that three relations can exist. For example, a and/or B may represent three cases: a alone; both A and B are present; b alone. Wherein A, B can be singular or plural.

In the embodiment of the present application, the symbol "/" may indicate that the associated object is an or relationship. In addition, the symbol "/" may also denote a divisor, i.e. performing a division operation. For example, A/B may represent A divided by B.

"at least one" or the like in the embodiments of the present application means any combination of these items, including any combination of single item(s) or plural items(s), meaning one or more, and plural means two or more. For example, at least one (one) of a, b or c may represent the following seven cases: a, b, c, a and b, a and c, b and c, a, b and c. Wherein each of a, b, c may be an element or a set comprising one or more elements.

The 'equal' in the embodiment of the application can be used with the greater than the adopted technical scheme, can also be used with the lesser than the adopted technical scheme. When the combination is equal to or greater than the combination, the combination is not less than the combination; when the value is equal to or smaller than that used together, the value is not larger than that used together.

In the embodiments of the present application, "of", "corresponding" and "corresponding" may be used in combination. It should be noted that the meaning of what is meant is consistent when de-emphasizing the differences.

The "connection" in the embodiments of the present application refers to various connection modes such as direct connection or indirect connection, so as to implement communication between devices, which is not limited in any way.

The "network" in the embodiment of the present application may be expressed as the same concept as the "system", i.e. the communication system is a communication network.

The "allocation" in the embodiments of the present application may be expressed as the same concept as "scheduling" or "configuration" or the like.

The "number" in the embodiment of the present application may be expressed as the same concept as "size" (number), "number", "value", or "size" (size), etc.

The following describes related content, concepts, meanings, technical problems, technical schemes, beneficial effects and the like related to the embodiment of the application.

1. Communication system, terminal device and network device

1. Communication system

The technical scheme of the embodiment of the application can be applied to various communication systems, such as: general packet Radio service (General Packet Radio Service, GPRS), long term evolution (Long Term Evolution, LTE) system, long term evolution advanced (Advanced Long Term Evolution, LTE-a) system, new Radio (NR) system, evolution system of NR system, LTE-based Access to Unlicensed Spectrum on unlicensed spectrum (LTE-U) system, NR-based Access to Unlicensed Spectrum on unlicensed spectrum (NR-U) system, non-terrestrial communication network (Non-Terrestrial Networks, NTN) system, universal mobile communication system (Universal Mobile Telecommunication System, UMTS), wireless local area network (Wireless Local Area Networks, WLAN), wireless fidelity (Wireless Fidelity, wi-Fi), 6th Generation (6 th-Generation, 6G) communication system, or other communication system, etc.

It should be noted that, the number of connections supported by the conventional communication system is limited and easy to implement. However, with the development of communication technology, the communication system may support not only a conventional communication system, but also, for example, a device-to-device (D2D) communication, a machine-to-machine (machine to machine, M2M) communication, a machine type communication (machine type communication, MTC), an inter-vehicle (vehicle to vehicle, V2V) communication, an internet of vehicles (vehicle to everything, V2X) communication, a narrowband internet of things (narrow band internet of things, NB-IoT) communication, and the like, so the technical solution of the embodiment of the present application may also be applied to the above-described communication system.

In addition, the technical scheme of the embodiment of the application can be applied to beamforming (beamforming), carrier aggregation (carrier aggregation, CA), dual-connection (dual connectivity, DC), independent (SA) deployment scenarios and the like.

In the embodiment of the present application, the frequency spectrum used for communication between the terminal device and the network device, or the frequency spectrum used for communication between the terminal device and the terminal device may be an authorized frequency spectrum or an unauthorized frequency spectrum, which is not limited. In addition, unlicensed spectrum may be understood as shared spectrum, and licensed spectrum may be understood as unshared spectrum.

Since the embodiments of the present application are described in connection with terminal devices and network devices, the terminal devices and network devices involved will be specifically described below.

2. Terminal equipment

In the embodiment of the present application, the terminal device may be a device with a transceiver function, which may also be referred to as a terminal, a User Equipment (UE), a remote terminal device (remote UE), a relay device (relay UE), an access terminal device, a subscriber unit, a subscriber station, a mobile station, a remote station, a mobile device, a user terminal device, an intelligent terminal device, a wireless communication device, a user agent, or a user equipment. The relay device is a terminal device capable of providing a relay service to other terminal devices (including a remote terminal device).

In some possible implementations, the terminal device may be deployed on land, including indoors or outdoors, hand-held, wearable, or vehicle-mounted; can be deployed on the water surface (such as ships, etc.); may be deployed in the air (e.g., aircraft, balloons, satellites, etc.).

In some possible implementations, the terminal device may be a mobile phone (mobile phone), a tablet (Pad), a computer with wireless transceiving functionality, a Virtual Reality (VR) terminal device, an augmented reality (augmented reality, AR) terminal device, a wireless terminal device in industrial control (industrial control), a wireless terminal device in unmanned autopilot, a wireless terminal device in telemedicine (remote media), a wireless terminal device in smart grid (smart grid), a wireless terminal device in transportation security (transportation safety), a wireless terminal device in smart city (smart city), or a wireless terminal device in smart home (smart home), etc.

In some possible implementations, the terminal device may be a cellular telephone, a cordless telephone, a session initiation protocol (session initiation protocol, SIP) phone, a wireless local loop (wireless local loop, WLL) station, a personal digital assistant (personal digital assistant, PDA), a handheld device with wireless communication capabilities, a computing device or other processing device connected to a wireless modem, an in-vehicle device, a wearable device, a terminal device in a next generation communication system (e.g., NR communication system, 6G communication system) or a terminal device in a future evolved public land mobile communication network (public land mobile network, PLMN), etc., without particular limitation.

In some possible implementations, the terminal device may be a low cost terminal device, which may be a low-end (low-end) low cost terminal device.

In some possible implementations, the terminal device may include means for wireless communication functions, such as a chip system, a chip module. By way of example, the system-on-chip may include a chip, and may include other discrete devices.

3. Network equipment

In the embodiment of the present application, the network device may be a device with a transceiver function, which is used for communication with the terminal device. For example, the network device may be responsible for radio resource management (radio resource management, RRM), quality of service (quality of service, qoS) management, data compression and encryption, data transceiving, etc. on the air side. The network device may be a Base Station (BS) in a communication system or a device deployed in a radio access network (radio access network, RAN) for providing wireless communication functions. For example, an evolved node B (evolutional node B, eNB or eNodeB) in the LTE communication system, a next generation evolved node B (next generation evolved node B, ng-eNB) in the NR communication system, a next generation node B (next generation node B, gNB) in the NR communication system, a Master Node (MN) in the dual connectivity architecture, a second node or Secondary Node (SN) in the dual connectivity architecture, and the like are not particularly limited thereto.

In some possible implementations, the network device may also be a device in a Core Network (CN), such as an access and mobility management function (access and mobility management function, AMF), a user plane function (user plane function, UPF), etc.; but also Access Points (APs) in a wireless local area network (wireless local area network, WLAN), relay stations, communication devices in a future evolved PLMN network, communication devices in an NTN network, etc.

In some possible implementations, the network device may include a device, such as a system-on-chip, a chip module, having means to provide wireless communication functionality for the terminal device. The chip system may include a chip, for example, or may include other discrete devices.

In some possible implementations, the network device may communicate with an internet protocol (Internet Protocol, IP) network. Such as the internet, a private IP network or other data network, etc.

In some possible implementations, the network device may be a single node to implement the functionality of the base station or the network device may include two or more separate nodes to implement the functionality of the base station. For example, network devices include Centralized Units (CUs) and Distributed Units (DUs), such as gNB-CUs and gNB-DUs. Further, in other embodiments of the application, the network device may further comprise an active antenna unit (active antenna unit, AAU). Wherein a CU implements a portion of the functions of the network device and a DU implements another portion of the functions of the network device. For example, a CU is responsible for handling non-real-time protocols and services, implementing the functions of a radio resource control (radio resource control, RRC) layer, a service data adaptation (service data adaptation protocol, SDAP) layer, and a packet data convergence (packet data convergence protocol, PDCP) layer. The DUs are responsible for handling physical layer protocols and real-time services, implementing the functions of the radio link control (radio link control, RLC), medium access control (medium access control, MAC) and Physical (PHY) layers. In addition, the AAU can realize partial physical layer processing function, radio frequency processing and related functions of the active antenna. Since the information of the RRC layer eventually becomes or is converted from the information of the PHY layer, in this network deployment, higher layer signaling (e.g., RRC signaling) may be considered to be transmitted by the DU or transmitted by both the DU and the AAU. It is understood that the network device may include at least one of CU, DU, AAU. In addition, the CU may be divided into network devices in the RAN, or may be divided into network devices in the core network, which is not particularly limited.

In some possible implementations, the network device may be any one of multiple sites that perform coherent cooperative transmission with the terminal device, or other sites outside the multiple sites, or other network devices that perform network communication with the terminal device, which is not limited specifically. The multi-site coherent joint transmission may be a multi-site coherent joint transmission, or different data belonging to the same physical downlink shared channel (Physical Downlink Shared Channel, PDSCH) are sent from different sites to the terminal device, or the multiple sites are virtualized into one site for transmission, and names with the same meaning specified in other standards are also applicable to the present application, i.e. the present application is not limited to the names of these parameters. The stations in the multi-station coherent joint transmission may be remote radio heads (Remote Radio Head, RRH), transmission receiving points (transmission and reception point, TRP), network devices, and the like, which are not particularly limited.

In some possible implementations, the network device may be any one of multiple sites that perform incoherent cooperative transmission with the terminal device, or other sites outside the multiple sites, or other network devices that perform network communication with the terminal device, which is not limited specifically. The multi-site incoherent joint transmission may be a multi-site joint incoherent transmission, or different data belonging to the same PDSCH are transmitted from different sites to the terminal device, and names with the same meaning specified in other standards are also applicable to the present application, i.e. the present application is not limited to the names of these parameters. The stations in the multi-station incoherent joint transmission may be RRHs, TRPs, network devices, etc., which are not particularly limited.

In some possible implementations, the network device may have a mobile nature, e.g., the network device may be a mobile device. Alternatively, the network device may be a satellite, a balloon station. For example, the satellite may be a Low Earth Orbit (LEO) satellite, a medium earth orbit (medium earth orbit, MEO) satellite, a geosynchronous orbit (geostationary earth orbit, GEO) satellite, a high elliptical orbit (high elliptical orbit, HEO) satellite, or the like. Alternatively, the network device may be a base station disposed on land, in a water area, or the like.

In some possible implementations, the network device may serve a cell, and terminal devices in the cell may communicate with the network device over transmission resources (e.g., spectrum resources). The cells may be macro cells (macro cells), small cells (small cells), urban cells (metro cells), micro cells (micro cells), pico cells (pico cells), femto cells (femto cells), and the like.

4. Description of the examples

An exemplary description of a communication system according to an embodiment of the present application is provided below.

Exemplary, a network architecture of a communication system according to an embodiment of the present application may refer to fig. 1. As shown in fig. 1, communication system 10 may include a network device 110 and a terminal device 120. The terminal device 120 may communicate with the network device 110 wirelessly.

Fig. 1 is merely an illustration of a network architecture of a communication system, and the network architecture of the communication system according to the embodiment of the present application is not limited thereto. For example, in the embodiment of the present application, a server or other devices may be further included in the communication system. For another example, in an embodiment of the present application, a communication system may include a plurality of network devices and/or a plurality of terminal devices.

2. Low cost terminal device, low cost terminal device at low end, limited data bandwidth, reduced cost terminal device

1. Low-cost terminal equipment and low-cost terminal equipment of low-end

The 5G New air interface (NR) may support low cost terminal equipment.

In the embodiment of the application, the low-cost terminal equipment can be terminal equipment with the bandwidth smaller than 100MHz, can be used for internet of things communication (Machine Type Communication, MTC) or universal internet of things (Internet of Thing, ioT), and can be called a reduced capability (RedCap) terminal equipment.

The bandwidth of the low cost terminal device in Frequency Range 1 (Frequency Range 1, fr 1) may be 20MHz, the number of receiving antennas is 2 or 1, and the number of transmitting antennas is 1. Thus, the peak rate of the low cost terminal device is approximately 150Mbps downstream and 75Mbps upstream.

In some scenarios, such as low-end industrial sensors, low-resolution cameras, small wearable devices (e.g., glasses), etc., a peak rate of low-cost terminal devices of only around 10Mbps is sufficient. Thus, future low cost terminal devices may be further cost effective.

For example, in FR1, the bandwidth of the low cost terminal device is reduced to 5MHz directly, or the peak rate of the low cost terminal device is reduced indirectly (e.g., by limiting the data bandwidth, limiting the transport block size (Transmission Block Size, TBS), etc.).

In summary, the embodiment of the present application may indirectly reduce the peak rate of the low-cost terminal device by limiting the data bandwidth, so that the cost of the low-cost terminal device is further reduced, i.e. the cost of the terminal device is reduced by limiting the data bandwidth.

Thus, the low-cost terminal device with further reduced cost may be collectively referred to as a low-end low-cost terminal device, and the present application may be a scheme based on limiting the data bandwidth.

2. Limiting data bandwidth

In the embodiment of the application, the limitation of the data bandwidth may be limiting the bandwidth of a physical downlink shared channel (Physical Downlink Share Channel, PDSCH) and/or a physical uplink shared channel (Physical Uplink Share Channel, PUSCH).

Limiting the bandwidth of PDSCH (PUSCH) may be understood as limiting the number of allocated (allocated) Resource Blocks (RBs) of PDSCH (PUSCH). Here, a resource block may also refer to a physical resource block (Physcial Resource Block, PRB) or a virtual resource block (Virtual Resource Block, VRB). The resource block may refer to a frequency domain resource. Wherein one resource block may be 12 consecutive subcarriers in the frequency domain. In general, the frequency domain resources of PDSCH may be measured in terms of the number of resource blocks.

In addition, the data bandwidth is limited only by limiting the number of frequency domain resources, and whether to limit the number of time domain resources is not considered.

For example, taking PDSCH as an example, limiting the number of allocated resource blocks of PDSCH only limits the number of frequency domain resources of PDSCH, and does not consider whether to limit the number of time domain resources of PDSCH.

Of course, a simple way is to assume that the number of time domain resources of PDSCH is fixed or preconfigured, which can reduce the cost of PDSCH memory (memory) and PDSCH processor (processor). This is because, by assuming that the time domain resources of the PDSCH are fixed or preconfigured, the amount of signals that need to be stored and processed becomes small. The time domain resources of PDSCH are typically measured in terms of number of symbols.

However, by assuming that the time domain resources are fixed or preconfigured, the following problems may arise:

the method comprises the steps of disabling flexible time domain resource allocation (such as flexible allocated symbol number) of a communication system (such as a 5G system), making low-cost terminal equipment at a low end difficult to access an original 5G network (even not completing initial cell selection), making the low-cost terminal equipment at the low end unable to coexist with the terminal equipment at the original 5G in a cell (cell) or a network, making the low-cost terminal equipment at the low end unable to use low delay (low latency) due to the fact that fewer symbols cannot be used, and the like.

Note that, in the embodiment of the present application, the symbol may refer to an orthogonal frequency division multiplexing (Orthogonal Frequency Division Multiplexing, OFDM) symbol, or may refer to another type of symbol, which is not limited in particular.

In summary, since a certain problem may be caused by assuming that the number of time domain resources is fixed or preconfigured, how to avoid assuming that the number of time domain resources is fixed or preconfigured and reduce the cost of the terminal device for low-cost terminal devices is a problem to be solved.

3. Cost reduction of terminal equipment by limiting data bandwidth

In the following, a description will be given of how to reduce the cost of the terminal device by limiting the bandwidth of the PDSCH, for example. As to PUSCH uniformity, this will not be described in detail.

The cost of the back-end part of the receiver of the lower terminal device is first introduced.

1) PDSCH memory

In the receiver of the terminal device, a series of sampled signals (e.g., an OFDM symbol) may be sent directly to a memory after being subjected to a fast fourier (Fast Fourier Transform, FFT) module, or may be sent to a memory after being subjected to resource demapping (resource demapping). The memory may be a buffer (buffer), flash (flash) or any form of memory, which is not particularly limited.

In the case of direct load into a memory, the memory may be referred to as a post-FFT buffer.

For the case of a memory after resource demapping, the memory may be referred to as a PDSCH buffer (PDSCH buffer). This is because the memory stores only PDSCH related signals such as PDSCH payload (payload), PDSCH demodulation Reference Signal (Demodulation Reference Signal, DMRS), channel state information Reference Signal (Channel State Information-Reference Signal, CSI-RS).

Whether post-FFT buffers or PDSCH buffers, are collectively referred to herein as PDSCH memory.

Limiting the bandwidth of the PDSCH may reduce the amount of PDSCH memory, thereby resulting in a reduction in cost of the terminal device.

The resource demapping may also be referred to as resource element demapping (Resource Element demapping, RE demapping). This is because the Resource at this time has Resource Elements (REs) as the minimum granularity.

The resource elements may refer to time-frequency domain (time domain and frequency domain) resources. One resource element may represent resources on one subcarrier (frequency domain) and one symbol (time domain).

Resource demapping may also be referred to as rate demapping (rate demapping). This is because it can be used to match the number of bits (rate) carried by the post-FFT signal to the number of bits (rate) input by the decoder. In addition, the corresponding module (hardware) of resource demapping may also be referred to as a receiver processing module (receiver processing block).

It should be noted that after resource demapping, the signal may be divided into two parts as follows:

part is the PDSCH related signal (as described above);

another part is the signal related to the physical downlink control channel (Physical Downlink Control Channel, PDCCH).

Wherein the PDCCH related signal may be stored in a control resource set (Control Resource Set, CORESET) memory.

CORESET, which may contain one or more PDCCHs, may be considered a resource container for PDCCHs.

Note that CORESET is regarded as one resource container of PDCCH because: the PDCCH requires blind detection by the terminal device, and the network device can select whether to place the PDCCH in CORESET or which number of PDCCHs, etc. according to the requirement, so that a container mode is adopted.

The application mainly solves the problem of signals related to the PDSCH, namely the problem related to the PDSCH memory. The problem with PDCCH-related signals or with CORESET memory is not within the scope of the discussion of the present application.

2) PDSCH processor

Signals in PDSCH memory need to be fed into a multiple-input multiple-output specified processing module (Multiple Input Multiple Output speific processing blocks, MIMO speific processing blocks).

MIMO speific processing blocks may comprise at least one of: a channel estimation (channel estimation) module, a MIMO receiver (also known as an equalizer), a demodulation (demodulation) module.

For simplicity, MIMO speific processing blocks may be referred to as a PDSCH processor.

Limiting the bandwidth of the PDSCH may relax the computational power (corresponding to hardware cost, such as the number of transistors) of the PDSCH processor, thereby resulting in a reduction in cost of the terminal device.

3) Hybrid automatic repeat request (HARQ) buffer (Hybird Automatic Retransmission Request)

Signals (such as soft bits) processed by the PDSCH processor need to be stored in the HARQ buffer first, so as to facilitate combining the signals (such as soft bits) to obtain a combining diversity gain when performing HARQ retransmission.

HARQ buffers may also be used to cope with the inverse of puncturing (puncturing), repetition (repetition) and/or interleaving (interleaving) in coding.

4) Decoder

The HARQ buffer signal needs to be sent to the decoder in a relatively fixed format (e.g., some predefined code rate) for the decoder to channel decode and output information bits.

The decoder is also called a channel decoder (channel decoder).

The decoder may be a low density check code (Low Density Parity Code, LDPC) decoder.

Limiting the bandwidth of the PDSCH may relax the computational power of the decoder (corresponding to hardware costs, such as the number of transistors), thereby resulting in a reduction in cost of the terminal device.

In summary, in practice, the cost of reducing the terminal device by limiting the bandwidth of PDSCH is derived from the reduction of the number of resources processed in PDSCH memory, PDSCH processor, HARQ buffer and decoder.

The cost for reducing the terminal equipment by limiting the TBS comes from the HARQ buffer and the reduced number of soft bits handled in the decoder.

3. Limiting the number of time-frequency resources

In summary, the limitation of the data bandwidth at present only limits the number of frequency domain resources, and does not consider whether to limit the number of time domain resources, which causes a certain problem when the number of time domain resources is assumed to be fixed or preconfigured.

Based on this, for low-cost terminal devices at low end, in order to avoid that the number of time domain resources is fixed or preconfigured, embodiments of the present application may assume that the number of time domain resources is dynamic, i.e. consider dynamically scheduled time domain resources. Meanwhile, in order to reduce the cost of the terminal device, the embodiment of the application can comprehensively consider the common quantity of the frequency domain resources and the time domain resources (namely, the quantity of the time domain resources), but not independently consider the quantity of the frequency domain resources or the quantity of the time domain resources, for example, consider the quantity of the frequency domain resources multiplied by the quantity of the time domain resources, and limit the quantity of the time domain resources.

Because the embodiment of the application only limits the number of time-frequency domain resources, the number of frequency domain resources and the number of time domain resources can be dynamically scheduled at the same time, thereby avoiding that the number of time domain resources is fixed or preconfigured due to the limitation of the number of frequency domain resources only. In addition, limiting the number of time-frequency resources, which is essentially limiting the number of processing resources in at least one of PDSCH memory, PDSCH processor, HARQ buffer, and decoder, can reduce the cost of the terminal device, thereby avoiding the possibility of assuming that the number of time-domain resources is fixed or preconfigured, and reducing the cost of the terminal device.

The technical scheme, beneficial effects, concepts and the like related to the embodiment of the application are described below.

1. Frequency domain resource, time domain resource and time-frequency resource

In the embodiment of the present application, the frequency domain resource may be an allocated (scheduled/configured, etc.) frequency domain resource, may be an allocated (scheduled/configured, etc.) frequency domain resource of a PDSCH (PUSCH), may be an allocated (scheduled/configured, etc.) frequency domain resource of a terminal device by a network device, may be an allocated (scheduled/configured, etc.) frequency domain resource of a PDSCH (PUSCH), etc. by a network device.

In the embodiment of the present application, the time domain resource may be an allocated (scheduled/configured, etc.) time domain resource, may be an allocated (scheduled/configured, etc.) time domain resource of a PDSCH (PUSCH), may be an allocated (scheduled/configured, etc.) time domain resource of a terminal device by a network device, may be an allocated (scheduled/configured, etc.) time domain resource of a PDSCH (PUSCH), etc. by a network device.

In addition, the frequency domain resources and the time domain resources may be referred to as time-frequency resources. The time-frequency resource may be an allocated (scheduled/configured, etc.) time-frequency resource, may be an allocated (scheduled/configured, etc.) time-frequency resource of a PDSCH (PUSCH), etc. allocated (scheduled/configured, etc.) by the network device for the terminal device, and may be an allocated (scheduled/configured, etc.) time-frequency resource of a PDSCH (PUSCH), etc. allocated (scheduled/configured, etc. by the network device for the terminal device.

That is, the time domain resource of the embodiment of the present application may include a time-frequency resource of PDSCH or a time-frequency resource of PUSCH.

In some possible implementations, the time-frequency resources are not mapped to the symbol where CORESET is located.

It can be appreciated that the terminal device expects that the symbol where CORESET is located does not have the time-frequency resource; or, the terminal device expects that the time-frequency resource is not mapped to the symbol where CORESET is located. Here, the symbol "CORESET" means a symbol overlapping with CORESET.

In other words, the terminal device does not expect the time-frequency resource on the symbol where CORESET is located; or, the terminal device does not expect the time-frequency resource to be mapped to the symbol where CORESET is located.

In this way, the terminal device does not need to buffer PDSCH or PUSCH in the process of receiving PDCCH (PDCCH in CORESET), so as to reduce computing resources and memory, thereby reducing cost.

2. Number of frequency domain resources and number of time domain resources

In the embodiment of the present application, the number of frequency domain resources may include the number of Resource Blocks (RBs) or the number of Resource Elements (REs). The number of resource blocks is understood as the number/size of resource blocks; the number of resource elements is understood to be the number/size of resource elements, etc.

In the embodiment of the present application, the number of time domain resources may include the number of symbols. The number of symbols is understood as the number/size of symbols, etc. The symbols in the embodiments of the present application may refer to OFDM symbols, or may refer to other types of symbols, which are not particularly limited.

3. Number of time-frequency resources

In combination with the above, in the embodiment of the present application, the number of time-frequency resources may be determined by the number of frequency-domain resources and the number of time-domain resources.

In some possible implementations, the number of time-frequency resources may represent the total number of resources required for a transport block.

In some possible implementations, the number of time-frequency resources may characterize a cost of at least one of a PDSCH (PUSCH) memory, a PDSCH (PUSCH) processor, a HARQ buffer, and a decoder.

In some possible implementations, the number of time-frequency resources may include at least one of:

the product of the number of resource blocks of the time-frequency resource and the number of symbols of the time-frequency resource;

it is understood that the number of time-frequency resources may be the product of the number of frequency domain resources and the number of time domain resources, and may be the product of the number of allocated (scheduled/configured, etc.) resource blocks and the number of allocated (scheduled/configured, etc.) symbols.

In some possible implementations, the product of the number of resource blocks of the time-frequency resource and the number of symbols of the time-frequency resource may include: the product of the number of resource blocks for PDSCH (PUSCH) and the number of symbols for PDSCH (PUSCH).

Subtracting the symbol number of the first resource block from the product of the symbol number of the time-frequency resource and the resource block number of the time-frequency resource;

in some possible implementations, subtracting the first number of resource block symbols from a product of the number of resource blocks of the time-frequency resource and the number of symbols of the time-frequency resource may include: the first number of resource block symbols is subtracted from the product of the number of resource blocks for PDSCH (PUSCH) and the number of symbols for PDSCH (PUSCH).

The first number of resource block symbols may represent a product of the number of resource blocks not used for mapping PDSCH (PUSCH) and the number of symbols, and may be used for rate matching of PDSCH (PUSCH).

The first number of resource block symbols may be the number/size/value/size of resource block symbols (RB symbols). The resource block symbol may represent a resource unit formed by the resource block and the symbol, and includes a frequency domain (resource block) and a time domain (symbol).

That is, PDSCH (PUSCH) requires rate matching for (around) the first number of resource block symbols. Therefore, when subtracting the first number of resource block symbols from the number of resource block symbols for PDSCH (PUSCH), it is the actual resource blocks and symbols used (mapped) by PDSCH (PUSCH), and accurate control of time-frequency resources is achieved.

In some possible implementations, the first number of resource block symbols may be network configured, pre-configured, or protocol specified.

For example, taking network configuration as an example, the embodiment of the present application may configure the first resource block symbol number through higher layer signaling (such as DCI, RRC signaling, etc.).

In some possible implementations, the first number of resource block symbols may include at least one of PDCCH, CORESET, CSI-RS or SSB; alternatively, the first resource block symbol may include at least one of PUCCH, SRS, PRACH.

The product of the number of resource elements of the time-frequency resource and the number of symbols of the time-frequency resource;

it is understood that the number of time-frequency resources may be the product of the number of frequency domain resources and the number of time domain resources, and may be the product of the number of allocated (scheduled/configured, etc.) resource elements and the number of allocated (scheduled/configured, etc.) symbols.

In some possible implementations, the product of the number of resource blocks of the time-frequency resource and the number of symbols of the time-frequency resource may include: the product of the number of resource elements for PDSCH (PUSCH) and the number of symbols for PDSCH (PUSCH).

Subtracting the first resource element symbol number from the product of the number of resource elements of the time-frequency resource and the symbol number of the time-frequency resource;

in some possible implementations, subtracting the first number of resource element symbols from a product of the number of resource elements of the time-frequency resource and the number of symbols of the time-frequency resource may include: the first number of resource element symbols is subtracted from the product of the number of resource elements for PDSCH (PUSCH) and the number of symbols for PUSCH.

Note that, the first number of resource element symbols may represent a product of the number of resource elements not used for mapping PDSCH (PUSCH) and the number of symbols, and the first number of resource element symbols may be used for rate matching of PDSCH (PUSCH).

The first number of resource element symbols may be the number/size/value/size of resource block symbols (RE symbols). The resource element symbol may represent a resource unit formed by the resource element and the symbol, and includes a frequency domain (resource element) and a time domain (symbol).

That is, PDSCH (PUSCH) requires rate matching for (around) the first number of resource element symbols. Therefore, when subtracting the first number of resource element symbols from the number of resource element symbols for PDSCH (PUSCH), it is the actual resource elements and symbols used (mapped) by PDSCH (PUSCH), and accurate control of time-frequency resources is achieved.

In some possible implementations, the first number of resource element symbols may be network configured, pre-configured, or protocol specified.

For example, using network configuration as an example, embodiments of the present application may configure the first number of resource element symbols through higher layer signaling (e.g., DCI, RRC signaling, etc.).

In some possible implementations, the first number of resource element symbols may include at least one of PDCCH, CORESET, CSI-RS or SSB; alternatively, the first resource element symbol may comprise at least one of PUCCH, SRS, PRACH.

4. Limiting the number of time-frequency resources

In combination with the above description, the embodiment of the present application may enable the number of time domain resources to be less than or equal to a threshold N (N may be a positive integer) when allocating (scheduling/configuring, etc.) time domain resources, so as to limit the number of time-frequency resources.

The threshold N may be used to characterize the amount of memory or the computational power of at least one of the PDSCH memory, the PDSCH processor, the HARQ buffer, and the decoder. That is, the embodiment of the present application may determine one threshold N according to the number of memory spaces or the computational power of at least one of a PDSCH (PUSCH) memory, a PDSCH (PUSCH) processor, a HARQ buffer, and a decoder.

In some possible implementations, the threshold N may be network configured, preconfigured, predefined, or protocol specified.

For example, using network configuration as an example, embodiments of the present application may configure a threshold N through higher layer signaling (e.g., RRC signaling, DCI, etc.).

In combination with the content of "3 and the number of time-frequency resources", the following embodiments of the present application take network devices and terminal devices as examples, and describe how to limit the number of time-frequency resources.

Example 1:

for a network device, the network device may allocate a time-frequency resource, where the product of the number of resource blocks of the time-frequency resource and the number of symbols of the time-frequency resource is less than or equal to a threshold N.

Correspondingly, for the terminal device, the product of the number of resource blocks of the allocated time-frequency resource and the number of symbols of the time-frequency resource can be expected to be less than or equal to a threshold N by the terminal device;

or, the product of the number of resource blocks of the time-frequency resource and the number of symbols of the time-frequency resource which are not expected to be allocated by the terminal device is greater than or equal to a threshold value N.

The time-frequency resources may be allocated (configured) as time-frequency resources. Wherein the network device may implement allocation (scheduling/configuration, etc.) of time-frequency resources through higher layer signaling (e.g., DCI).

In standard protocols, it is expected that it will be understood that the terminal device determines whether a certain value is legal or valid.

In this regard, it is desirable that the product of the number of resource blocks of the allocated time-frequency resource and the number of symbols of the time-frequency resource is less than or equal to a threshold N, it may be determined whether the product of the number of resource blocks of the allocated time-frequency resource and the number of symbols of the time-frequency resource is less than or equal to a threshold N or whether the product of the number of resource blocks of the allocated time-frequency resource and the number of symbols of the time-frequency resource is legal or valid, or it is determined that the product of the number of resource blocks of the allocated time-frequency resource and the number of symbols of the time-frequency resource is less than or equal to a threshold N, or the like.

In "example 1", since the present application comprehensively considers the common number of frequency domain resources and time domain resources (i.e., the number of time-frequency resources), the number of time-frequency resources may be the total number of resources required for the current transport block, and may reflect the cost of at least one of PDSCH (PUSCH) memory, PDSCH (PUSCH) processor, HARQ buffer, and decoder.

The number of the frequency domain resources is expressed by the number of the resource blocks, so that the method is simpler; the number of time domain resources is expressed in terms of number of symbols, which is relatively simple.

In addition, by limiting the product of the number of resource blocks of the time-frequency resource and the number of symbols of the time-frequency resource to be less than or equal to a threshold N, the following can be achieved:

let n=24×14, 24×14 denote the product of 24 and 14, i.e. the terminal device allows (expects) a maximum of 24 resource blocks of allocated time-frequency resources, and a maximum of 14 symbols of allocated time-frequency resources. The number of resource blocks is at most 24, and the number of resource blocks in the 5MHz bandwidth is at most 24 when the subcarrier spacing is 15 kHz. The number of symbols is at most 14 and the number of symbols from one slot is at most 14.

When the number of allocated symbols is 14, it is naturally allowable to allocate up to 24 resource blocks, and when the number of allocated symbols is 4, it is allowable to allocate up to 84 resource blocks, and PDSCH (PUSCH) may occupy more frequency resources (i.e. 84 resource blocks), but the terminal device needs to process still only 24 x 14 "resource block symbol" (RB symbol) units, so that there is no need to increase the cost of at least one of PDSCH (PUSCH) memory, PDSCH (PUSCH) processor, HARQ buffer, and decoder.

Here, a "resource block symbol" may represent one resource unit composed of a resource block and a symbol together, including a frequency domain (resource block) and a time domain (symbol).

In addition to n=24×14, the values of N are the following:

n=24×13, 24×13 denotes the product of 24 and 13, i.e. the number of resource blocks of the (expected) allocated time-frequency resources is at most 24 and the number of symbols of the allocated time-frequency resources is at most 13. The number of symbols is at most 13 and the number of symbols from one slot is at most 14, but one symbol is used for CORESET.

N=24×12, 24×12 means the product of 24 and 12, i.e. the number of resource blocks of the allocated (expected) time-frequency resources is at most 24 and the number of symbols of the allocated time-frequency resources is at most 12. The number of symbols is at most 12 and the number of symbols from one slot is at most 14, but two of them are used for CORESET.

N=12×14, 12×14 denotes the product of 12 and 14, i.e. the number of resource blocks of the allocated (expected) time-frequency resources is at most 12 and the number of symbols of the allocated time-frequency resources is at most 14. The number of resource blocks is at most 12, and when the subcarrier spacing is 30kHz, the number of resource blocks of the 5MHz bandwidth is at most 12. The number of symbols is at most 14 and the number of symbols from one slot is at most 14.

N=12×13, 12×13 denotes the product of 12 and 13, i.e. the number of resource blocks of the time-frequency resources that the terminal device is allowed (expected) to allocate is at most 12, and the number of symbols of the allocated time-frequency resources is at most 13. The number of symbols is at most 13 and the number of symbols from one slot is at most 14, but one symbol is used for CORESET.

N=12×12, 12×12 denotes the product of 12 and 12, i.e. the number of resource blocks of the time-frequency resources that the terminal device is allowed (expected) to allocate is at most 12, and the number of symbols of the allocated time-frequency resources is at most 12. The number of symbols is at most 12 and the number of symbols from one slot is at most 14, but two of them are used for CORESET.

In addition, the number of allocated symbols is 4, and there are many application scenarios. For example, in the initial cell selection of the original 5G network, the network device may only allocate 4 symbols to the terminal device; or when the terminal equipment and the original 5G terminal equipment coexist in a cell or a network, the network equipment distributes only 4 symbols to the low-cost terminal equipment at the low end; alternatively, to obtain low latency, the network device allocates only 4 symbols to the low-cost terminal device at the low end.

In addition, the threshold N may be a predefined value. In this way, the amount of memory or computational power of at least one of the PDSCH (PUSCH) memory, the PDSCH (PUSCH) processor, the HARQ buffer, and the decoder may be a predefined value, so that when manufacturing a low-cost terminal device of a low end, the corresponding at least one of the PDSCH (PUSCH) memory, the PDSCH (PUSCH) processor, the HARQ buffer, the decoder may be pre-designed.

Example 2:

for the network device, the network device allocates a time-frequency resource, and a difference between a product of a number of resource blocks of the time-frequency resource and a number of symbols of the time-frequency resource minus a number of symbols of the first resource block is less than or equal to a threshold N.

Correspondingly, for the terminal equipment, the difference value of the product of the number of the resource blocks of the time-frequency resource and the number of the symbols of the time-frequency resource, which is expected to be allocated by the terminal equipment, minus the number of the symbols of the first resource block is smaller than or equal to a threshold value N;

or the difference of the product of the number of resource blocks of the time-frequency resource and the number of symbols of the time-frequency resource, which is not expected to be allocated by the terminal equipment, minus the number of symbols of the first resource block is greater than or equal to a threshold value N.

Note that "allocation" and "desire" are consistent with "example 1" described above, and are not particularly limited thereto.

Thus, in comparison with the above-described "example 1", in "example 2", the present application can subtract the resource blocks and symbols not used for mapping PDSCH represented by the first number of resource block symbols. That is, PDSCH (PUSCH) requires rate matching for (around) the first number of resource block symbols.

Therefore, the first number of resource block symbols is subtracted from the actual number of resource blocks and symbols used (mapped, etc.) by the PDSCH (PUSCH), thereby realizing accurate control of the time-frequency resources.

In addition, if the time-frequency resource includes a time-frequency resource of the PDSCH, the first resource block symbol may include at least one of PDCCH, CORESET, CSI-RS, SSB. Thus, at least one of PDCCH, CORESET, CSI-RS, SSB is not used for mapping PDSCH. That is, the PDSCH needs to be rate matched for (around) at least one of PDCCH, CORESET, CSI-RS, SSB. Since the number of resources at the resource block level is limited here, the rate matching herein refers to rate matching at the resource block level, or rate matching at the resource block symbol level.

In addition, if the time-frequency resource includes a time-frequency resource of PUSCH, the first resource block symbol may include at least one of a physical uplink control channel (Physical Uplink Control Channel, PUCCH), a sounding reference channel (Sounding Reference Signal, SRS), and a physical random access channel (Physical Random Access Channel, PRACH). As such, at least one of PUCCH, SRS, PRACH is not used to map PUSCH. That is, PUSCH requires rate matching for at least one of (surrounding) PUCCH, SRS, PRACH. Since the number of resources at the resource block level is limited here, the rate matching herein refers to rate matching at the resource block level, or rate matching at the resource block symbol level.

The threshold value N corresponds to the above "example 1", and will not be described in detail.

Example 3:

for a network device, the network device allocates a time-frequency resource, the product of the number of resource elements of the time-frequency resource and the number of symbols of the time-frequency resource being less than or equal to a threshold N.

Correspondingly, for the terminal equipment, the product of the number of resource elements of the time-frequency resource and the number of symbols of the time-frequency resource which are expected to be allocated by the terminal equipment is smaller than or equal to a threshold N;

alternatively, the product of the number of resource elements of the time-frequency resource and the number of symbols of the time-frequency resource that the terminal device does not expect to allocate is greater than or equal to a threshold N.

In "example 3", since the present application comprehensively considers the number of frequency domain resources and the number of time domain resources (i.e., the number of time-frequency resources), the number of time-frequency resources may be the total number of resources required for the current transport block, and may reflect the cost of at least one of PDSCH (PUSCH) memory, PDSCH (PUSCH) processor, HARQ buffer, and decoder.

In addition, in comparison with the above-described "example 1", in "example 3", the granularity of the resource elements is finer than the granularity of the resource blocks, it is possible to cope with the case when the allocated frequency domain resources have the resource elements as the granularity,

In addition, the threshold N here may be the threshold N multiplied by 12 in the above "example 1", which will not be described again. Since the threshold N corresponds to the number of resource elements of the time-frequency resource, and the threshold N in the above "example 1" corresponds to the number of resource blocks of the time-frequency resource, there are 12 resource elements in one resource block, and the ratio relationship between the two is 12 times.

Example 4:

for the network device, the network device allocates a time-frequency resource, and a difference between a number of resource elements of the time-frequency resource and a number of symbols of the time-frequency resource minus a number of symbols of the first resource element is less than or equal to a threshold N.

Correspondingly, for the terminal equipment, the difference value of the product of the number of resource elements of the time-frequency resource and the number of symbols of the time-frequency resource, which is expected to be allocated by the terminal equipment, minus the number of symbols of the first resource element is smaller than or equal to a threshold value N;

or the difference of the product of the number of resource blocks of the time-frequency resource and the number of symbols of the time-frequency resource, which is not expected to be allocated by the terminal equipment, minus the number of symbols of the first resource element is greater than or equal to a threshold value N.

In comparison to the above "example 3", in "example 4", the present application may subtract the resource elements and symbols not used for mapping PDSCH (PUSCH) represented by the first number of resource element symbols. That is, PDSCH (PUSCH) requires rate matching for (around) the first number of resource element symbols.

Therefore, the first number of resource element symbols is subtracted from the actual number of resource elements and symbols used (mapped, etc.) by the PDSCH (PUSCH), thereby achieving accurate control of the time-frequency resources.

In comparison with the above-described "example 3", in "example 4", the granularity of the resource elements is finer than the granularity of the resource blocks, and it is possible to cope with the case when the allocated resources have the resource elements as the granularity.

In addition, if the time-frequency resource includes a time-frequency resource of PDSCH, the first resource element symbol may include at least one of PDCCH, CORESET, CSI-RS, SSB. Thus, at least one of PDCCH, CORESET, CSI-RS, SSB is not used for mapping PDSCH. That is, the PDSCH needs to be rate matched for (around) at least one of PDCCH, CORESET, CSI-RS, SSB. Since the number of resources at the resource element level is limited here, the rate matching here refers to rate matching at the resource element level.

In addition, if the time-frequency resource includes a time-frequency resource of PUSCH, the first resource element symbol may include at least one of PUCCH, SRS, PRACH. As such, at least one of PUCCH, SRS, PRACH is not used to map PUSCH. That is, PUSCH requires rate matching for at least one of (surrounding) PUCCH, SRS, PRACH. Since the number of resources at the resource element level is limited here, the rate matching here refers to rate matching at the resource element level. In addition, the threshold N may be the threshold N multiplied by 12 in the above "example 1", which will not be described herein. Since the threshold N corresponds to the number of resource elements of the time-frequency resource, and the threshold N in the above "example 1" corresponds to the number of resource blocks of the time-frequency resource, there are 12 resource elements in one resource block, and the ratio relationship between the two is 12 times.

4. An example illustration of a time-frequency resource limitation method

In combination with the foregoing, an example of a time-frequency resource limitation method according to an embodiment of the present application is described below. The execution subject of the method may be a terminal device, and may be a chip, a chip module, a module, or the like. That is, the method is applied to the terminal device, which is not particularly limited.

Fig. 2 is a schematic flow chart of a time-frequency resource limiting method according to an embodiment of the present application, which specifically includes the following steps:

s210, the number of time-frequency resources to be allocated is expected to be less than or equal to a threshold.

It should be noted that, for the "number of time-frequency resources", "desiring", "allocating", etc., the contents of the "three, limit the number of time-frequency resources" or other related contents may be described in detail, which will not be described herein.

The time-frequency resource may include a time-frequency resource of PDSCH or a time-frequency resource of PUSCH.

Because the embodiment of the application only limits the number of time-frequency domain resources, the number of frequency domain resources and the number of time domain resources can be dynamically scheduled at the same time, thereby avoiding the situation that the number of time domain resources is fixed or preconfigured because the number of frequency domain resources is limited only. In addition, limiting the number of time-frequency resources is essentially limiting the number of processing resources in at least one of a PDSCH (PUSCH) memory, a PDSCH (PUSCH) processor, a HARQ buffer, and a decoder, so as to reduce the cost of the terminal device, thereby avoiding the possibility of not only assuming that the number of time-domain resources is fixed or preconfigured, but also reducing the cost of the terminal device. The number of the frequency domain resources is expressed by the number of the resource blocks, so that the method is simpler; the number of time domain resources is expressed in terms of number of symbols, which is relatively simple.

In some possible implementations, the number of time-frequency resources is less than or equal to a threshold N, which may include:

the product of the number of time-frequency resource blocks and the number of symbols of the time-frequency resource is less than or equal to a threshold N.

It should be noted that, in combination with the content of the foregoing "example 1" or other related content, since the present application comprehensively considers the common number of frequency domain resources and time domain resources (i.e., the number of time-frequency resources), the number of time-frequency resources may be the total number of resources required for the current transport block, and may reflect the cost of at least one of the PDSCH (PUSCH) memory, the PDSCH (PUSCH) processor, the HARQ buffer, and the decoder. In addition, the number of the frequency domain resources is expressed by the number of the resource blocks, so that the method is simpler; the number of time domain resources is expressed in terms of number of symbols, which is relatively simple.

the difference of the product of the number of resource blocks of the time-frequency resource and the number of symbols of the time-frequency resource minus the number of symbols of the first resource block is less than or equal to a threshold.

It should be noted that, in combination with the content of the foregoing "example 2" or other related content, the present application may subtract the resource block and the symbol that are not used for mapping PDSCH (PUSCH) and represented by the first number of resource block symbols. That is, PDSCH (PUSCH) requires rate matching for (around) the first number of resource block symbols.

Therefore, the first number of resource block symbols is subtracted from the actual number of resource blocks and symbols used (mapped, etc.) by the PDSCH (PUSCH), thereby realizing accurate control of the time-frequency resources. In addition, the number of the frequency domain resources is expressed by the number of the resource blocks, so that the method is simpler; the number of time domain resources is expressed in terms of number of symbols, which is relatively simple.

In some possible implementations, the first resource block symbol includes at least one of a Physical Downlink Control Channel (PDCCH), a control resource set (Control Resource Set, CORESET), a channel state information reference signal (Channel State Information Reference Signal, CSI-RS for short), and a synchronization signal block (SS/PBCH block, SSB for short).

It should be noted that, in combination with the content in the foregoing "example 2" or other related content, the first resource block symbol may include at least one of PDCCH, CORESET, CSI-RS and SSB. Thus, at least one of PDCCH, CORESET, CSI-RS, SSB is not used for mapping PDSCH. That is, the PDSCH needs to be rate matched for (around) at least one of PDCCH, CORESET, CSI-RS, SSB. Since the number of resources at the resource block level is limited here, the rate matching herein refers to rate matching at the resource block level, or rate matching at the resource block symbol level.

In some possible implementations, the first resource block symbol includes at least one of PUCCH, SRS, PRACH.

It should be noted that, in combination with the content in the foregoing "example 2" or other related content, the first resource block symbol may include at least one item of PUCCH, SRS, PRACH. As such, at least one of PUCCH, SRS, PRACH is not used to map PUSCH. That is, PUSCH requires rate matching for at least one of (surrounding) PUCCH, SRS, PRACH. Since the number of resources at the resource block level is limited here, the rate matching herein refers to rate matching at the resource block level, or rate matching at the resource block symbol level.

In some possible implementations, the number of time-frequency resources is less than or equal to a threshold, which may include:

the product of the number of resource elements of the time-frequency resource and the number of symbols of the time-frequency resource is less than or equal to a threshold.

It should be noted that, in combination with the content of the foregoing "example 3" or other related content, since the present application comprehensively considers the common number of frequency domain resources and time domain resources (i.e., the number of time-frequency resources), the number of time-frequency resources may be the total number of resources required for the current transport block, and may reflect the cost of at least one of PDSCH (PUSCH) memory, PDSCH (PUSCH) processor, HARQ buffer, and decoder. In addition, the number of the frequency domain resources is expressed by the number of resource elements, so that the method is simpler; the number of time domain resources is expressed in terms of number of symbols, which is relatively simple.

the difference of the product of the number of resource elements of the time-frequency resource and the number of symbols of the time-frequency resource minus the number of symbols of the first resource element is less than or equal to a threshold.

It should be noted that, in combination with the content of the foregoing "example 4" or other related content, the present application may subtract the resource block and the symbol that are not used for mapping PDSCH (PUSCH) and represented by the first number of resource element symbols. That is, PDSCH (PUSCH) requires rate matching for (around) the first number of resource element symbols.

Therefore, the first number of resource block symbols is subtracted from the actual number of resource blocks and symbols used (mapped, etc.) by the PDSCH (PUSCH), thereby realizing accurate control of the time-frequency resources. In addition, the number of the frequency domain resources is expressed by resource elements, so that the method is simpler; the number of time domain resources is expressed in terms of number of symbols, which is relatively simple.

In some possible implementations, the first resource element symbol may include at least one of PDCCH, CORESET, CSI-RS, SSB.

It should be noted that, in combination with the content in the foregoing "example 4" or other related content, the first resource element symbol may include at least one of PDCCH, CORESET, CSI-RS and SSB. Thus, at least one of PDCCH, CORESET, CSI-RS, SSB is not used for mapping PDSCH. That is, the PDSCH needs to be rate matched for (around) at least one of PDCCH, CORESET, CSI-RS, SSB. Since the number of resources at the resource element level is limited here, the rate matching here refers to rate matching at the resource element level, or rate matching at the resource element symbol level.

In some possible implementations, the first resource element symbol may include at least one of PUCCH, SRS, PRACH.

It should be noted that, in combination with the content in the above "example 4" or other related content, the first resource element symbol may include at least one item of PUCCH, SRS, PRACH. As such, at least one of PUCCH, SRS, PRACH is not used to map PUSCH. That is, PUSCH requires rate matching for at least one of (surrounding) PUCCH, SRS, PRACH. Since the number of resources at the resource element level is limited here, the rate matching here refers to rate matching at the resource element level, or rate matching at the resource element symbol level.

In some possible implementations, the threshold N is a predefined positive integer.

It should be noted that the threshold value N may be a predefined value. In this way, the amount of memory or computational power of at least one of the PDSCH (PUSCH) memory, the PDSCH (PUSCH) processor, the HARQ buffer, and the decoder may be a predefined value, so that when manufacturing a low-cost terminal device of a low end, the corresponding at least one of the PDSCH (PUSCH) memory, the PDSCH (PUSCH) processor, the HARQ buffer, the decoder may be pre-designed.

5. Yet another exemplary illustration of a method of time-frequency resource limitation

In combination with the foregoing, a further exemplary description of a method for limiting time-frequency resources according to an embodiment of the present application is provided below. The execution subject of the method may be a network device, and may be a chip, a chip module, a module, or the like. That is, the method is applied to the network device, which is not particularly limited.

Fig. 3 is a schematic flow chart of another time-frequency resource limiting method according to an embodiment of the present application, which specifically includes the following steps:

s310, time-frequency resources are allocated, and the number of the time-frequency resources is smaller than or equal to a threshold value.

It should be noted that, for the "number of time-frequency resources", "allocation", etc., the contents of the "three, limit the number of time-frequency resources" or other related contents may be described in detail, which will not be described herein.

Because the embodiment of the application only limits the number of time-frequency domain resources, the number of frequency domain resources and the number of time domain resources can be dynamically scheduled at the same time, thereby avoiding the situation that the number of time domain resources is fixed or preconfigured because the number of frequency domain resources is limited only. In addition, limiting the number of time-frequency resources is essentially limiting the number of processing resources in at least one of a PDSCH (PUSCH) memory, a PDSCH (PUSCH) processor, a HARQ buffer, and a decoder, so as to reduce the cost of the terminal device, thereby avoiding the possibility of not only assuming that the number of time-domain resources is fixed or preconfigured, but also reducing the cost of the terminal device.

the product of the number of time-frequency resource blocks and the number of symbols of the time-frequency resource is less than or equal to a threshold.

In some possible implementations, the first resource block symbol includes at least one of PDCCH, CORESET, CSI-RS, SSB.

In some possible implementations, the threshold is a predefined positive integer.

6. Yet another exemplary illustration of a method of time-frequency resource limitation

In combination with the foregoing, a further exemplary description of a method for limiting time-frequency resources according to an embodiment of the present application is provided below. The execution subject of the method may be a terminal device, and may be a chip, a chip module, a module, or the like. That is, the method is applied to the terminal device, which is not particularly limited.

Fig. 4 is a schematic flow chart of another time-frequency resource limiting method according to an embodiment of the present application, which specifically includes the following steps:

s410, the expected allocated time-frequency resources are not mapped to the symbols where CORESET is located. Or, it is not desirable that the allocated time-frequency resources not be mapped to the symbol where CORESET is located.

It should be noted that the time-frequency resource is not mapped to the symbol where CORESET is located, which may be understood that the symbol where CORESET is expected by the terminal device does not have the time-frequency resource, or the symbol where CORESET is expected by the terminal device to be not mapped to the time-frequency resource.

For example, taking an example that the time-frequency resource includes the time-frequency resource of the PDSCH, the time-frequency resource of the PDSCH is not mapped to the symbol where the CORESET is located, which may be understood as the time-frequency resource where the terminal device expects the CORESET to be located without the PDSCH, or the time-frequency resource where the terminal device expects the PDSCH is not mapped to the symbol where the CORESET is located.

In other words, the terminal device does not expect the time-frequency resource on the symbol where CORESET is located, or the time-frequency resource is mapped to the symbol where CORESET is located.

In this way, the terminal device does not need to buffer the time-frequency resource map in the process of receiving the PDCCH (PDCCH in CORESET), so that the computing resource and the memory can be reduced, and the cost is reduced.

7. Yet another exemplary illustration of a method of time-frequency resource limitation

Fig. 5 is a schematic flow chart of another time-frequency resource limiting method according to an embodiment of the present application, which specifically includes the following steps:

s510, allocating time-frequency resources which are not mapped to symbols where CORESET is located.

It should be noted that, the time-frequency resource is not mapped to the symbol where CORESET is located, and it can be understood that the symbol where CORESET is located does not have the time-frequency resource.

In this way, the terminal device does not need to buffer the time-frequency resource in the process of receiving the PDCCH (PDCCH in CORESET), so that the computing resource and the memory can be reduced, and the cost is reduced.

8. An illustration of a time-frequency resource limiting device

The foregoing description of the embodiments of the present application has been presented primarily from a method-side perspective. It will be appreciated that the terminal device or network device, in order to implement the above-described functions, includes corresponding hardware structures and/or software modules that perform the respective functions. Those of skill in the art will readily appreciate that the various illustrative elements and algorithm steps described in connection with the embodiments disclosed herein may be implemented as hardware or combinations of hardware and computer software. Whether a function is implemented as hardware or computer software driven hardware depends upon the particular application and design constraints imposed on the solution. Those skilled in the art may implement the described functionality using different approaches for each particular application, but such implementation decisions should not be interpreted as causing a departure from the scope of the present application.

The embodiment of the application can divide the functional units of the terminal equipment or the network equipment according to the method example. For example, each functional unit may be divided corresponding to each function, or two or more functions may be integrated in one processing unit. The integrated units described above may be implemented either in hardware or in software program modules. It should be noted that, in the embodiment of the present application, the division of the units is schematic, but only one logic function is divided, and another division manner may be adopted in actual implementation.

In the case of using integrated units, fig. 6 is a block diagram showing functional units of a time-frequency resource limiting device according to an embodiment of the present application. The time-frequency resource limiting apparatus 600 includes: the unit 601 is desired.

In some possible implementations, the desired unit 601 may be a module unit for processing signals, data, information, and the like, which is not particularly limited.

In some possible implementations, the time-frequency resource limitation device 600 may further include a storage unit for storing computer program code or instructions executed by the time-frequency resource limitation device 600. The memory unit may be a memory.

In some possible implementations, the time-frequency resource limitation device 600 may be a chip or a chip module.

In some possible implementations, it is desirable that the unit 601 may be integrated in one unit.

For example, the desired unit 601 may be integrated in a communication unit. The communication unit may be a communication interface, transceiver circuit, etc.

For another example, the desired unit 601 may be integrated in a processing unit. The processing unit may be a processor or a controller, and may be, for example, a baseband processor, a baseband chip, a central processing unit (central processing unit, CPU), a general purpose processor, a digital signal processor (digital signal processor, DSP), an application-specific integrated circuit (ASIC), a field programmable gate array (field programmable gate array, FPGA) or other programmable logic device, a transistor logic device, a hardware component, or any combination thereof. Which may implement or perform the various exemplary logical blocks, modules, and circuits described in connection with the present disclosure. The processing unit may also be a combination that implements computing functionality, e.g., comprising one or more microprocessor combinations, a combination of DSPs and microprocessors, etc.

In some possible implementations, the unit 601 is expected to perform any step, such as sending or receiving, of data transmission performed by the network device/terminal device/chip module, etc., as in the above-described method embodiments. The following is a detailed description.

In particular implementations, it is desirable for the unit 601 to perform any of the steps of the method embodiments described above, and when performing data transmission such as sending, other units may be selectively invoked to complete the corresponding operations. The following is a detailed description.

A desiring unit 601 is configured to desire the number of allocated time-frequency resources to be less than or equal to a threshold.

Or, the desiring unit 601 is configured to expect that the allocated time-frequency resource is not mapped to the symbol where CORESET is located.

It should be noted that, the specific implementation of each operation in the embodiment shown in fig. 6 may be described in detail in the above-shown method embodiment, and will not be described in detail herein.

It should be noted that, in combination with the content of the foregoing "example 1" or other related content, since the present application comprehensively considers the common number of frequency domain resources and time domain resources (i.e. the number of time-frequency resources), the number of time-frequency resources may be the total number of resources required by the current transport block, and may reflect the cost of at least one of PDSCH memory, PDSCH processor, HARQ buffer and decoder. In addition, the number of the frequency domain resources is expressed by the number of the resource blocks, so that the method is simpler; the number of time domain resources is expressed in terms of number of symbols, which is relatively simple.

It should be noted that, in combination with the content of the foregoing "example 2" or other related content, the present application may subtract the resource block and the symbol that are not used for mapping PDSCH and are represented by the first number of resource block symbols. That is, PDSCH needs to be rate matched for (around) the first number of resource block symbols.

Therefore, the first number of resource block symbols is subtracted from the actual number of resource blocks and symbols used (mapped, etc.) by the PDSCH, thereby realizing accurate control of the time-frequency resources. In addition, the number of the frequency domain resources is expressed by the number of the resource blocks, so that the method is simpler; the number of time domain resources is expressed in terms of number of symbols, which is relatively simple.

In some possible implementations, the first resource block symbol includes at least one of a physical downlink control channel PDCCH, a control resource set CORESET, a channel state information reference signal CSI-RS, a synchronization signal block SSB.

It should be noted that, in combination with the content of the foregoing "example 3" or other related content, since the present application comprehensively considers the common number of frequency domain resources and time domain resources (i.e. the number of time-frequency resources), the number of time-frequency resources may be the total number of resources required by the current transport block, and may reflect the cost of at least one of PDSCH memory, PDSCH processor, HARQ buffer and decoder. In addition, the number of the frequency domain resources is expressed by the number of resource elements, so that the method is simpler; the number of time domain resources is expressed in terms of number of symbols, which is relatively simple.

It should be noted that, in combination with the content of the foregoing "example 4" or other related content, the present application may subtract the resource block and symbol that are not used for mapping PDSCH and are represented by the first number of resource element symbols. That is, PDSCH needs to be rate matched for (around) the first number of resource element symbols.

Therefore, the first number of resource block symbols is subtracted from the actual number of resource blocks and symbols used (mapped, etc.) by the PDSCH, thereby realizing accurate control of the time-frequency resources. In addition, the number of the frequency domain resources is expressed by resource elements, so that the method is simpler; the number of time domain resources is expressed in terms of number of symbols, which is relatively simple.

It should be noted that the threshold value N may be a predefined value. In this way, the amount of memory or computational power of at least one of the PDSCH memory, the PDSCH processor, the HARQ buffer and the decoder may be a predefined value, so that when manufacturing low-cost terminal devices of low-end, the corresponding at least one of the PDSCH memory, the PDSCH processor, the HARQ buffer and the decoder of low-cost may be pre-designed.

9. An illustration of a time-frequency resource limiting device

In the case of using integrated units, fig. 7 is a block diagram showing the functional units of a time-frequency resource limiting device according to an embodiment of the present application. The time-frequency resource limiting device 700 includes: a dispensing unit 701.

In some possible implementations, the allocation unit 701 may be a module unit for processing signals, data, information, and the like, which is not particularly limited.

In some possible implementations, the time-frequency resource limitation device 700 may further include a storage unit for storing computer program code or instructions executed by the time-frequency resource limitation device 700. The memory unit may be a memory.

In some possible implementations, the time-frequency resource limiting device 700 may be a chip or a chip module.

In some possible implementations, the dispense unit 701 may be integrated in one unit.

For example, the allocation unit 701 may be integrated in a communication unit. The communication unit may be a communication interface, transceiver circuit, etc.

For another example, the dispense unit 701 may be integrated into a processing unit. The processing unit may be a processor or a controller, and may be, for example, a baseband processor, a baseband chip, a central processing unit (central processing unit, CPU), a general purpose processor, a digital signal processor (digital signal processor, DSP), an application-specific integrated circuit (ASIC), a field programmable gate array (field programmable gate array, FPGA) or other programmable logic device, a transistor logic device, a hardware component, or any combination thereof. Which may implement or perform the various exemplary logical blocks, modules, and circuits described in connection with the present disclosure. The processing unit may also be a combination that implements computing functionality, e.g., comprising one or more microprocessor combinations, a combination of DSPs and microprocessors, etc.

In some possible implementations, the allocation unit 701 is configured to perform any step, such as sending or receiving, of data transmission performed by the network device/terminal device/chip module, etc., in the above-described method embodiments. The following is a detailed description.

In particular implementation, the allocation unit 701 is configured to perform any of the steps of the method embodiments described above, and when performing data transmission such as sending, other units may be selectively invoked to complete the corresponding operations. The following is a detailed description.

An allocation unit 701, configured to allocate time-frequency resources, where the number of the time-frequency resources is less than or equal to a threshold.

Or, the allocation unit 701 is configured to allocate a time-frequency resource, where the time-frequency resource is not mapped to a symbol where CORESET is located.

It should be noted that, the specific implementation of each operation in the embodiment shown in fig. 7 may be described in detail in the above-shown method embodiment, and will not be described in detail herein.

In some possible implementations, the first resource block symbol may include at least one of a physical downlink control channel PDCCH, a control resource set CORESET, a channel state information reference signal CSI-RS, a synchronization signal block SSB; alternatively, the first resource block symbol may include at least one of PUCCH, SRS, PRACH.

In some possible implementations, the first resource element symbol may include at least one of PDCCH, CORESET, CSI-RS, SSB; alternatively, the first resource element symbol may comprise at least one of PUCCH, SRS, PRACH.

10. Example illustration of terminal equipment

Referring to fig. 8, fig. 8 is a schematic structural diagram of a terminal device according to an embodiment of the present application. Wherein the terminal device 800 comprises a processor 810, a memory 820 and a communication bus connecting the processor 810 and the memory 820.

In some possible implementations, memory 820 includes, but is not limited to, random access memory (random access memory, RAM), read-only memory (ROM), erasable programmable read-only memory (EPROM), or portable read-only memory (compact disc read-only memory, CD-ROM), memory 820 for storing program code and transmitted data for execution by terminal device 800.

In some possible implementations, the terminal device 800 also includes a communication interface for receiving and transmitting data.

In some possible implementations, the processor 810 may be one or more Central Processing Units (CPUs), which in the case where the processor 810 is one Central Processing Unit (CPU), may be a single-core Central Processing Unit (CPU) or a multi-core Central Processing Unit (CPU).

In some possible implementations, the processor 810 may be a baseband chip, a Central Processing Unit (CPU), a general purpose processor, DSP, ASIC, FPGA, or other programmable logic device, a transistor logic device, a hardware component, or any combination thereof.

In particular implementation, the processor 810 in the terminal device 800 is configured to execute the computer program or instructions 821 stored in the memory 820 to perform the following operations:

It should be noted that, the specific implementation of each operation may be described in the above-illustrated method embodiment, and the terminal device 800 may be used to execute the above-illustrated method embodiment of the present application, which is not described herein.

In some possible implementations, the first resource block symbol includes at least one of a physical downlink control channel PDCCH, a control resource set CORESET, a channel state information reference signal CSI-RS, a synchronization signal block SSB; alternatively, the first resource block symbol includes at least one of PUCCH, SRS, PRACH.

In some possible implementations, the first resource element symbol may include at least one of PDCCH, CORESET, CSI-RS, SSB; alternatively, the first resource element symbol includes at least one of PUCCH, SRS, PRACH.

In one possible implementation, the time-frequency resources are not mapped to the symbol where CORESET is located.

11. An illustration of a network device

Referring to fig. 9, fig. 9 is a schematic structural diagram of a network device according to an embodiment of the present application. The network device 900 includes a processor 910, a memory 920, and a communication bus for connecting the processor 910 and the memory 920.

In some possible implementations, memory 920 includes, but is not limited to, RAM, ROM, EPROM or CD-ROM, which memory 920 is used to store related instructions and data.

In some possible implementations, the network device 900 also includes a communication interface for receiving and transmitting data.

In some possible implementations, the processor 910 may be one or more Central Processing Units (CPUs), and in the case where the processor 910 is one Central Processing Unit (CPU), the Central Processing Unit (CPU) may be a single-core Central Processing Unit (CPU) or a multi-core Central Processing Unit (CPU).

In some possible implementations, the processor 910 may be a baseband chip, a Central Processing Unit (CPU), a general purpose processor, DSP, ASIC, FPGA, or other programmable logic device, a transistor logic device, a hardware component, or any combination thereof.

In some possible implementations, the processor 910 in the network device 900 is configured to execute the computer program or instructions 921 stored in the memory 920 to perform the following operations:

time-frequency resources are allocated, and the number of the time-frequency resources is less than or equal to a threshold value.

It should be noted that, the specific implementation of each operation may be described in the foregoing method embodiment, and the network device 900 may be used to execute the foregoing method embodiment of the present application, which is not described herein.

In some possible implementations, the first resource block symbol includes at least one of a physical downlink control channel PDCCH, a control resource set CORESET, a channel state information reference signal CSI-RS, a synchronization signal block SSB; alternatively, a resource block symbol includes at least one of PUCCH, SRS, PRACH.

12. Other related exemplary illustrations

In some possible implementations, the above method embodiments may be applied in a terminal device. That is, the execution body of the above-described method embodiment may be a terminal device, and may be a chip, a chip module, a module, or the like, which is not particularly limited.

In some possible implementations, the above-described method embodiments may be applied in a network device. That is, the execution body of the above-mentioned method embodiment may be a network device, and may be a chip, a chip module or a module, which is not limited in particular.

The embodiment of the application also provides a chip which comprises a processor, a memory and a computer program or instructions stored on the memory, wherein the processor executes the computer program or instructions to realize the steps described in the embodiment of the method.

The embodiment of the application also provides a chip module, which comprises a receiving and transmitting assembly and a chip, wherein the chip comprises a processor, a memory and a computer program or instructions stored on the memory, and the processor executes the computer program or instructions to realize the steps described in the embodiment of the method.

The embodiments of the present application also provide a computer-readable storage medium storing a computer program or instructions which, when executed, implement the steps described in the method embodiments above.

Embodiments of the present application also provide a computer program product comprising a computer program or instructions which, when executed, implement the steps described in the method embodiments above.

For the above embodiments, for simplicity of description, the same is denoted as a series of combinations of actions. It will be appreciated by persons skilled in the art that the application is not limited by the order of acts described, as some steps in embodiments of the application may be performed in other orders or concurrently. In addition, those skilled in the art will appreciate that the embodiments described in the specification are presently preferred embodiments, and that the acts, steps, modules, or units, etc. that are described are not necessarily required by the embodiments of the application.

In the foregoing embodiments, the descriptions of the embodiments of the present application are emphasized, and in part, not described in detail in one embodiment, reference may be made to related descriptions of other embodiments.

The steps of a method or algorithm described in connection with the embodiments disclosed herein may be embodied in hardware, or may be embodied in software instructions executed by a processor. The software instructions may be comprised of corresponding software modules that may be stored in RAM, flash memory, ROM, erasable programmable read-only memory (erasable programmable ROM, EPROM), electrically erasable programmable read-only memory (EEPROM), registers, hard disk, a removable disk, a compact disc read-only memory (CD-ROM), or any other form of storage medium known in the art. An exemplary storage medium is coupled to the processor such the processor can read information from, and write information to, the storage medium. In the alternative, the storage medium may be integral to the processor. The processor and the storage medium may reside in an ASIC. In addition, the ASIC may be located in a terminal device or a management device. The processor and the storage medium may reside as discrete components in a terminal device or management device.

Those skilled in the art will appreciate that in one or more of the examples described above, the functions described in the embodiments of the present application may be implemented, in whole or in part, in software, hardware, firmware, or any combination thereof. When implemented in software, may be implemented in whole or in part in the form of a computer program product. The computer program product includes one or more computer instructions. When loaded and executed on a computer, produces a flow or function in accordance with embodiments of the present application, in whole or in part. The computer may be a general purpose computer, a special purpose computer, a computer network, or other programmable apparatus. 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 a wired (e.g., coaxial cable, fiber optic, digital subscriber line (digital subscriber line, DSL)), or wireless (e.g., infrared, wireless, microwave, etc.). The computer readable storage medium may be any available medium that can be accessed by a computer or a data storage device such as a server, data center, etc. that contains an integration of one or more available media. The usable medium may be a magnetic medium (e.g., a floppy disk, a hard disk, a magnetic tape), an optical medium (e.g., a digital video disc (digital video disc, DVD)), or a semiconductor medium (e.g., a Solid State Disk (SSD)), or the like.

The respective apparatuses and the respective modules/units included in the products described in the above embodiments may be software modules/units, may be hardware modules/units, or may be partly software modules/units, and partly hardware modules/units. For example, for each device or product applied to or integrated on a chip, each module/unit included in the device or product may be implemented in hardware such as a circuit, or at least part of the modules/units may be implemented in software program, where the software program runs on a processor integrated inside the chip, and the rest (if any) of the modules/units may be implemented in hardware such as a circuit; for each device and product applied to or integrated in the chip module, each module/unit contained in the device and product can be realized in a hardware manner such as a circuit, different modules/units can be located in the same component (such as a chip, a circuit module and the like) or different components of the chip module, or at least part of the modules/units can be realized in a software program, the software program runs on a processor integrated in the chip module, and the rest (if any) of the modules/units can be realized in a hardware manner such as a circuit; for each device, product, or application to or integrated with the terminal device, each module/unit included in the device may be implemented in hardware such as a circuit, and different modules/units may be located in the same component (e.g., a chip, a circuit module, etc.) or different components in the terminal device, or at least some modules/units may be implemented in a software program, where the software program runs on a processor integrated within the terminal device, and the remaining (if any) part of the modules/units may be implemented in hardware such as a circuit.

The foregoing detailed description of the embodiments of the present application further illustrates the purposes, technical solutions and advantageous effects of the embodiments of the present application, and it should be understood that the foregoing description is only a specific implementation of the embodiments of the present application, and is not intended to limit the scope of the embodiments of the present application, and any modifications, equivalent substitutions, improvements, etc. made on the basis of the technical solutions of the embodiments of the present application should be included in the scope of the embodiments of the present application.

Claims

1. The time-frequency resource limiting method is characterized by being applied to terminal equipment; the method comprises the following steps:

2. The method of claim 1, wherein the number of time-frequency resources is less than or equal to a threshold, comprising:

the product of the number of the time-frequency resource blocks and the number of the symbols of the time-frequency resource is smaller than or equal to a threshold value.

3. The method of claim 1, wherein the number of time-frequency resources is less than or equal to a threshold, comprising:

4. The method of claim 3, wherein the first resource block symbol comprises at least one of a physical downlink control channel PDCCH, a control resource set CORESET, a channel state information reference signal CSI-RS, a synchronization signal block SSB; or, the first resource block symbol includes at least one of a physical uplink control channel PUCCH, a sounding reference signal SRS, and a physical random access channel PRACH.

5. The method of claim 1, wherein the number of time-frequency resources is less than or equal to a threshold, comprising:

6. The method of claim 1, wherein the number of time-frequency resources is less than or equal to a threshold, comprising:

7. The method of claim 6, wherein the first resource element symbol comprises at least one of PDCCH, CORESET, CSI-RS, SSB; alternatively, the first resource element symbol includes at least one of PUCCH, SRS, PRACH.

8. The method according to any of claims 1-7, wherein the threshold is a predefined positive integer.

9. The time-frequency resource limiting method is characterized by being applied to network equipment; the method comprises the following steps:

10. The method of claim 9, wherein the number of time-frequency resources is less than or equal to a threshold, comprising:

the product of the number of resource blocks of the time-frequency resource and the number of symbols of the time-frequency resource is less than or equal to a threshold.

11. The method of claim 9, wherein the number of time-frequency resources is less than or equal to a threshold, comprising:

12. The method of claim 11, wherein the first resource block symbol comprises at least one of a physical downlink control channel PDCCH, a control resource set CORESET, a channel state information reference signal CSI-RS, a synchronization signal block SSB; or, the first resource block symbol includes at least one of a physical uplink control channel PUCCH, a sounding reference signal SRS, and a physical random access channel PRACH.

13. The method of claim 9, wherein the number of time-frequency resources is less than or equal to a threshold, comprising:

14. The method of claim 9, wherein the number of time-frequency resources is less than or equal to a threshold, comprising:

15. The method of claim 14, wherein the first resource element symbol comprises at least one of a lane PDCCH, CORESET, CSI-RS, SSB; alternatively, the first resource element symbol includes at least one of PUCCH, SRS, PRACH.

16. The method according to any of claims 9-15, wherein the threshold is specified by a network configuration, a pre-configuration, or a protocol.

17. The time-frequency resource limiting method is characterized by being applied to terminal equipment; the method comprises the following steps:

18. The time-frequency resource limiting method is characterized by being applied to network equipment; the method comprises the following steps:

19. A time-frequency resource limiting device, comprising:

20. A time-frequency resource limiting device, comprising:

21. A time-frequency resource limiting device, which is characterized by being applied to terminal equipment; the method comprises the following steps:

22. The time-frequency resource limiting method is characterized by being applied to network equipment; the method comprises the following steps:

and the allocation unit is used for allocating time-frequency resources which are not mapped to the symbols where CORESET is located.

23. A terminal device comprising a processor, a memory and a computer program or instructions stored on the memory, characterized in that the processor executes the computer program or instructions to carry out the steps of the method according to any one of claims 1-8 or 17.

24. A network device comprising a processor, a memory and a computer program or instructions stored on the memory, wherein the processor executes the computer program or instructions to implement the steps of the method of any one of claims 9-16 or 18.

25. A chip comprising a processor, wherein the processor performs the steps of the method of any one of claims 1-8, 9-16, 17 or 18.

26. A computer readable storage medium, characterized in that it stores a computer program or instructions which, when executed, implement the steps of the method of any one of claims 1-8, 9-16, 17 or 18.