Wireless communication methods and related apparatuses

Abstract

A wireless communication method and related apparatus are provided. The method includes: receiving first information, wherein the first information is used to determine first frequency resource elements in the first frequency resources for carrying at least one first sequence, and a reference signal corresponding to the at least one first sequence is used to measure a channel on the first frequency resources; the first frequency resource elements in the first frequency resources are determined based on the interleaving of second frequency resource elements, the second frequency resource elements belonging to the first frequency resources. This interleaving ensures that the first frequency resource elements possess the quasi-random characteristics required by compressed sensing algorithms; in other words, the reference signal carried on the first frequency resources can be arranged in a quasi-random manner, enabling compressed sensing algorithms to be used to estimate the channel on the first frequency resources, thus reducing the resource elements used for channel estimation, i.e., reducing channel estimation overhead, thereby freeing up more resource elements for other uses.

Description

Technical Field

[0001] This application relates to the field of communication technology, and in particular to a wireless communication method and related apparatus. Background Technology

[0002] In multiple-input multiple-output (MIMO) systems, devices (such as network devices or terminals) can perform channel estimation based on a reference signal and then recover the data signal transmitted through the data channel based on the channel estimation. Therefore, reference signal allocation is crucial for MIMO systems.

[0003] The amount of time and frequency resources required for channel estimation is called channel estimation overhead (or simply overhead). This overhead is measured in units of resource elements (REs). There is a trade-off between the accuracy and overhead of channel estimation. When the overhead is too high, the channel estimation accuracy is high, but fewer REs are available for data transmission, resulting in a decrease in capacity. When the overhead is too low, although a large number of REs are available for data transmission, the channel estimation accuracy will be poor, which will also lead to a decrease in capacity.

[0004] This background information is provided to disclose information that the applicant believes may be relevant to this application. No such information is permitted or should be construed as constituting prior art to this application. Summary of the Invention

[0005] In a first aspect, this disclosure provides a wireless communication method, the method comprising:

[0006] Receive first information, wherein the first information is used to determine a first frequency resource element in a first frequency resource for carrying at least one first sequence, and a reference signal corresponding to the at least one first sequence is used to measure the channel on the first frequency resource;

[0007] The first frequency resource unit in the first frequency resource is determined based on the interleaving of the second frequency resource unit, and the second frequency resource unit belongs to the first frequency resource.

[0008] The first frequency resource unit is determined based on the interleaving of the second frequency resource unit. This interleaving ensures that the first frequency resource unit has the quasi-random characteristics required by the compressed sensing algorithm. In other words, the reference signal carried on the first frequency resource can be allocated quasi-randomly, so that the compressed sensing algorithm can be used to estimate the channel on the first frequency resource. This reduces the resource elements used for channel estimation, thereby reducing the channel estimation overhead and freeing up more resource elements for other purposes.

[0009] The above-mentioned wireless communication method can be applied to a first network element, which can be a terminal device, a communication module in the terminal, or a circuit or chip (e.g., a modem chip, also known as a baseband chip, or a system on chip (SoC) including a modem core with communication function in the terminal, or a system in package (SIP) chip).

[0010] In one possible implementation of the first aspect, at least one parameter of the interleaving is associated with the total number of resource elements (REs) included in the first frequency resource.

[0011] When the total number of REs changes, one or more parameters associated with interleaving can be adjusted accordingly. When selecting one or more parameters associated with interleaving, the total number of resource elements included in the first frequency resource needs to be taken into account.

[0012] In one possible implementation of the first aspect, the location of the second frequency resource unit is associated with the type of interleaving.

[0013] The location of the second frequency resource unit may vary depending on the type of interleaving; that is, if different types of interleaving are used, the frequency resource unit pattern before interleaving may also be different.

[0014] In one possible implementation of the first aspect, the interleaving includes applying at least one of the following: a cubic permutation polynomial (CPP) interleaver, a quadratic permutation polynomial (QPP) interleaver, a Takeshita-Costello interleaver, a Welch-Costas interleaver, an interleaver based on a pseudo-noise (PN) sequence, or an interleaver based on a random integer sequence.

[0015] This interleaving can be performed using a CPP interleaver, a QPP interleaver, a Takeshita-Costello interleaver, a Welch-Costas interleaver, a PN sequence-based interleaver, or a random integer sequence-based interleaver, or a combination of two or more of these interleavers. This provides flexibility for the interleaving, allowing the design of interleaving strategies based on specific needs.

[0016] In one possible implementation of the first aspect, the interleaving includes applying the QPP interleaver; the interleaving is based on a first coefficient and a second coefficient, the first coefficient and the second coefficient being used to determine the sampling pattern of all frequency resource elements in the first frequency resource.

[0017] In one possible implementation of the first aspect, the first coefficient and the second coefficient are used to obtain a one-to-one correspondence between the location of the second frequency resource unit and the location of the first frequency resource unit.

[0018] For example, the sampling pattern of all frequency resource units in the first frequency resource can refer to a single pattern: the position of the reference signal used for channel estimation is 1, and the other positions are 0. This is because transmitting the reference signal on the first frequency resource unit is equivalent to sampling the channel on the first frequency resource. By setting appropriate first and second coefficients, a one-to-one correspondence is established between the positions of the second and first frequency resource units, and the positions of the first frequency resource units can be quasi-randomly assigned. Furthermore, by appropriately selecting the first and second coefficients, the signal recovery performance when using the CS algorithm can be improved.

[0019] In one possible implementation of the first aspect, the first factorization of the first coefficient is represented as the product of a plurality of first integers and an interleaving factor, wherein the interleaving factor is an integer that is not divisible by any of the plurality of first integers, and each of the plurality of first integers is a prime number.

[0020] In one possible implementation of the first aspect, the second factor decomposition of the total number of resource elements in the first frequency resource is represented as the product of each term obtained by taking the plurality of first powers corresponding to the plurality of first integers, wherein at least one of the first powers is greater than 1; the second coefficient cannot be divided by any of the plurality of first integers.

[0021] In one possible implementation of the first aspect, the first coefficient and the second coefficient are predefined, or the first information indicates the first coefficient and the second coefficient.

[0022] The first and second coefficients can be predefined by the first network element, or they can be obtained by the first network element from the second network element. For example, the second network element can directly send or indirectly instruct the first network element on the first coefficients, thereby improving the flexibility of obtaining the coefficients.

[0023] In one possible implementation of the first aspect, the first coefficient and the second coefficient are determined based on a table.

[0024] If the first network element stores a table that represents the correspondence between indices and coefficients, the first network element can easily obtain the required first and second coefficients based on this correspondence and the target index indicated by the second network element. This saves signaling.

[0025] In one possible implementation of the first aspect, at least one first frequency resource unit in the first frequency resource unit includes a plurality of resource elements; the position of the third frequency resource unit in the second frequency resource is determined based on the positions of the QPP interleaver and the at least one first frequency resource unit, wherein the second frequency resource and the first frequency resource are located on different symbols, and the third frequency resource unit is used to carry at least one second sequence.

[0026] When the second frequency resource unit includes multiple resource elements, this means that interleaving can be performed block-by-block, and frequency hopping can also be performed in this case. The hopping position of the third frequency resource unit after frequency hopping depends on the position of at least one of the first frequency resource units. Therefore, at least one first frequency resource unit is considered as the frequency resource unit before interleaving, and the third frequency resource unit is considered as the frequency resource unit after interleaving. Thus, the position of the third frequency resource unit can be obtained by inputting the position of at least one first frequency resource unit into the QPP interleaver. The position of the frequency resource unit after frequency hopping is associated with the starting position of the frequency resource unit and the QPP interleaver. Unlike conventional frequency hopping, which requires occupying all available frequency resource units, the above frequency hopping can skip some frequency resource units thanks to the QPP interleaver design, thereby reducing channel estimation overhead.

[0027] In one possible implementation of the first aspect, the interleaving includes applying the interleaver based on the PN sequence, wherein the total number of resource elements in the first frequency resource is equal to a power of 2.

[0028] In one possible implementation of the first aspect, the first information further indicates the second frequency resource unit.

[0029] In this way, the first network element can obtain the second frequency resource unit before interleaving and directly perform interleaving based on predefined rules to obtain the first frequency resource unit. In this case, the second network element does not need to send the interleaved first frequency resource unit to the first network element.

[0030] In one possible implementation of the first aspect, the first information includes a bitmap for indicating the second frequency resource unit.

[0031] In one possible implementation of the first aspect, at least one of the first frequency resource units includes a plurality of resource elements, or each of the first frequency resource units includes one resource element.

[0032] The above interleaving can be performed at the block level (block-by-block), where a block contains multiple resource elements; or at the resource element level (element-by-element).

[0033] In one possible implementation of the first aspect, the method further includes: transmitting the at least one first sequence on the first frequency resource.

[0034] The first network element sends at least one first sequence to the second network element, so the reference signal corresponding to the at least one first sequence can be used for uplink channel estimation.

[0035] In one possible implementation of the first aspect, the reference signal corresponding to the at least one first sequence is a sounding reference signal (SRS) or a demodulation reference signal (DMRS).

[0036] In one possible implementation of the first aspect, the method further includes: receiving the at least one first sequence on the first frequency resource, wherein the reference signal corresponding to the at least one first sequence is a channel state information reference signal (CSI-RS).

[0037] The first network element receives at least one first sequence from the second network element, and therefore the reference signal corresponding to the at least one first sequence can be used for downlink channel estimation.

[0038] In one possible implementation of the first aspect, the first information is carried in at least one of the following: MAC control element (MAC CE), downlink control information (DCI), or radio resource control (RRC).

[0039] In one possible implementation of the first aspect, the method further includes:

[0040] Receive second information, wherein the second information is used to determine a fourth frequency resource element in a third frequency resource for carrying at least one third sequence, and a reference signal corresponding to the at least one third sequence is used to measure the channel on the third frequency resource;

[0041] The first frequency resource unit and the fourth frequency resource unit do not overlap in the frequency domain.

[0042] More than one antenna can exist to transmit or receive reference signals using non-overlapping frequency resource elements, and the process of transmitting or receiving reference signals by each antenna is similar.

[0043] In a second aspect, this disclosure provides a wireless communication method, the method comprising:

[0044] Send first information, wherein the first information is used to determine a first frequency resource element in a first frequency resource for carrying at least one first sequence, and a reference signal corresponding to the at least one first sequence is used to measure the channel on the first frequency resource;

[0045] The first frequency resource unit in the first frequency resource is determined based on the interleaving of the second frequency resource unit, and the second frequency resource unit belongs to the first frequency resource.

[0046] The first frequency resource unit is determined based on the interleaving of the second frequency resource unit. This interleaving ensures that the first frequency resource unit has the quasi-random characteristics required by the compressed sensing (CS) algorithm. In other words, the reference signal carried on the first frequency resource can be allocated quasi-randomly, so that the compressed sensing algorithm can be used to estimate the channel on the first frequency resource. This reduces the resource elements used for channel estimation, thereby reducing the channel estimation overhead and freeing up more resource elements for other purposes.

[0047] The above-described wireless communication method can be applied to a second network element, which may be a network device or a component (e.g., a circuit, chip, or chip system) in a network device.

[0048] In one possible implementation of the second aspect, at least one parameter of the interleaving is associated with the total number of resource elements (REs) included in the first frequency resource.

[0049] When the total number of REs changes, one or more parameters associated with interleaving can be adjusted accordingly. When selecting one or more parameters associated with interleaving, the total number of resource elements included in the first frequency resource needs to be taken into account.

[0050] In one possible implementation of the second aspect, the location of the second frequency resource unit is associated with the type of interleaving.

[0051] The location of the second frequency resource unit may vary depending on the type of interleaving; that is, if different types of interleaving are used, the frequency resource unit pattern before interleaving may also be different.

[0052] In one possible implementation of the second aspect, the interleaving includes applying at least one of the following: a cubic permutation polynomial (CPP) interleaver, a quadratic permutation polynomial (QPP) interleaver, a Takeshita-Costello interleaver, a Welch-Costas interleaver, an interleaver based on a pseudo-noise (PN) sequence, or an interleaver based on a random integer sequence.

[0053] This interleaving can be performed using a CPP interleaver, a QPP interleaver, a Takeshita-Costello interleaver, a Welch-Costas interleaver, a PN sequence-based interleaver, or a random integer sequence-based interleaver, or a combination of two or more of these interleavers. This provides flexibility for the interleaving, allowing the design of interleaving strategies based on specific needs.

[0054] In one possible implementation of the second aspect, the interleaving includes applying the QPP interleaver; the interleaving is based on a first coefficient and a second coefficient, the first coefficient and the second coefficient being used to determine the sampling pattern of all frequency resource elements in the first frequency resource.

[0055] In one possible implementation of the second aspect, the first coefficient and the second coefficient are used to obtain a one-to-one correspondence between the location of the second frequency resource unit and the location of the first frequency resource unit.

[0056] By setting appropriate first and second coefficients, a one-to-one correspondence is established between the positions of the second and first frequency resource units, and the positions of the first frequency resource units can be quasi-randomly assigned. Furthermore, by appropriately selecting the first and second coefficients, the signal recovery performance when using the CS algorithm can be improved.

[0057] In one possible implementation of the second aspect, the first factorization of the first coefficient is represented as the product of a plurality of first integers and an interleaving factor, wherein the interleaving factor is an integer that is not divisible by any of the plurality of first integers, and each of the plurality of first integers is a prime number.

[0058] In one possible implementation of the second aspect, the second factor decomposition of the total number of resource elements in the first frequency resource is represented as the product of each term obtained by taking the plurality of first powers corresponding to the plurality of first integers, wherein at least one of the first powers is greater than 1; the second coefficient cannot be divided by any of the plurality of first integers.

[0059] In one possible implementation of the second aspect, the first coefficient and the second coefficient are predefined, or the first information indicates the first coefficient and the second coefficient.

[0060] The first and second coefficients can be predefined by the first network element, or they can be sent from the second network element to the first network element. For example, the second network element can directly send or indirectly indicate the first and second coefficients to the first network element, thereby improving the flexibility of obtaining the coefficients.

[0061] In one possible implementation of the second aspect, the first coefficient and the second coefficient are determined based on a table.

[0062] If the first network element stores a table that represents the correspondence between indices and coefficients, the first network element can easily obtain the required first and second coefficients through the target index indicated by the second network element. This saves signaling.

[0063] In one possible implementation of the second aspect, at least one first frequency resource unit in the first frequency resource unit includes a plurality of resource elements; the position of the third frequency resource unit in the second frequency resource is determined based on the positions of the QPP interleaver and the at least one first frequency resource unit, wherein the second frequency resource and the first frequency resource are located on different symbols, and the third frequency resource unit is used to carry at least one second sequence.

[0064] When the second frequency resource unit includes multiple resource elements, this means that interleaving can be performed at the block level, and frequency hopping can also be performed in this case. The hopping position of the third frequency resource unit after frequency hopping depends on the position of at least one of the first frequency resource units. Therefore, at least one first frequency resource unit is considered as the frequency resource unit before interleaving, and the third frequency resource unit is considered as the frequency resource unit after interleaving. Thus, the position of the third frequency resource unit can be obtained by inputting the position of at least one first frequency resource unit into the QPP interleaver. The position of the frequency resource unit after frequency hopping is associated with the starting position of the frequency resource unit and the QPP interleaver. Unlike conventional frequency hopping, which requires occupying all available frequency resource units, the above frequency hopping can skip some frequency resource units thanks to the QPP interleaver design, thereby reducing channel estimation overhead.

[0065] In one possible implementation of the second aspect, the interleaving includes applying the interleaver based on the PN sequence, wherein the total number of resource elements in the first frequency resource is equal to a power of 2.

[0066] In one possible implementation of the second aspect, the first information further indicates the second frequency resource unit.

[0067] The second network element can indicate the second frequency resource unit before interleaving to the first network element, allowing the first network element to directly perform interleaving based on predefined rules to obtain the first frequency resource unit. In this case, the second network element does not need to indicate the first frequency resource unit after interleaving to the first network element.

[0068] In one possible implementation of the second aspect, the first information includes a bitmap for indicating the second frequency resource unit.

[0069] In one possible implementation of the second aspect, at least one of the first frequency resource units includes a plurality of resource elements, or each of the first frequency resource units includes one resource element.

[0070] The above interleaving can be performed at the block level, where a block contains multiple resource elements; or at the resource element level.

[0071] In one possible implementation of the second aspect, the method further includes: receiving the at least one first sequence on the first frequency resource.

[0072] The second network element receives at least one first sequence from the first network element, and therefore the reference signal corresponding to the at least one first sequence can be used for uplink channel estimation.

[0073] In one possible implementation of the second aspect, the reference signal corresponding to the at least one first sequence is a sounding reference signal (SRS) or a demodulation reference signal (DMRS).

[0074] In one possible implementation of the second aspect, the method further includes: transmitting the at least one first sequence on the first frequency resource, wherein the reference signal corresponding to the at least one first sequence is a channel state information reference signal (CSI-RS).

[0075] The second network element sends at least one first sequence to the first network element, so the reference signal corresponding to the at least one first sequence can be used for downlink channel estimation.

[0076] In one possible implementation of the second aspect, the first information is carried in at least one of the following: MAC control element (MAC CE), downlink control information (DCI), or radio resource control (RRC).

[0077] In one possible implementation of the second aspect, the method further includes:

[0078] Send a second message, wherein the second message is used to determine a fourth frequency resource element in the third frequency resource for carrying at least one third sequence, and a reference signal corresponding to the at least one third sequence is used to measure the channel on the third frequency resource;

[0079] The first frequency resource unit and the fourth frequency resource unit do not overlap in the frequency domain.

[0080] More than one antenna can exist to transmit or receive reference signals using non-overlapping frequency resource elements, and the process of transmitting or receiving reference signals by each antenna is similar.

[0081] In a third aspect, this disclosure provides a wireless communication apparatus comprising various modules for performing the wireless communication method according to the first aspect or any possible implementation thereof.

[0082] In a fourth aspect, this disclosure provides a wireless communication apparatus comprising various modules for performing the wireless communication method according to the second aspect or any possible implementation thereof.

[0083] In a fifth aspect, this disclosure provides a wireless communication apparatus comprising at least one processor, wherein the at least one processor is configured to perform the wireless communication method according to the first aspect or any possible implementation thereof, or according to the second aspect or any possible implementation thereof.

[0084] In one possible implementation of the fifth aspect, the apparatus may further include a memory storing instructions that cause the at least one processor to perform the wireless communication method according to the first aspect or any possible implementation thereof, or according to the second aspect or any possible implementation thereof.

[0085] In a sixth aspect, this disclosure provides a wireless communication apparatus for performing the wireless communication method according to the first aspect or any possible implementation thereof, or according to the second aspect or any possible implementation thereof.

[0086] In a seventh aspect, this disclosure provides a first network element, the first network element including processing circuitry for performing the wireless communication method according to the first aspect or any possible implementation thereof.

[0087] In an eighth aspect, this disclosure provides a second network element, the second network element including processing circuitry for performing the wireless communication method according to the second aspect or any possible implementation thereof.

[0088] In a ninth aspect, this disclosure provides a wireless communication system comprising a first network element according to a seventh aspect and a second network element according to an eighth aspect.

[0089] In a tenth aspect, this disclosure provides a chip including an input / output (I / O) interface and a processor, wherein the processor is configured to invoke and execute computer execution instructions stored in a memory, such that a device equipped with the chip is capable of performing the wireless communication method according to the first aspect or any possible implementation thereof, or according to the second aspect or any possible implementation thereof.

[0090] In an eleventh aspect, this disclosure provides a computer-readable medium storing computer-executable instructions, wherein, when executed by a processor, the computer-executable instructions cause the processor to perform the wireless communication method according to the first aspect or any possible implementation thereof, or according to the second aspect or any possible implementation thereof.

[0091] In a twelfth aspect, this disclosure provides a computer program product comprising computer execution instructions, wherein, when executed by a processor, the computer execution instructions cause the processor to perform the wireless communication method according to the first aspect or any possible implementation thereof, or according to the second aspect or any possible implementation thereof.

[0092] This disclosure provides a wireless communication method and related apparatus. A second network element sends first information to a first network element, wherein the first information is used to determine a first frequency resource element in a first frequency resource for carrying at least one first sequence, and a reference signal corresponding to the at least one first sequence is used to measure the channel on the first frequency resource; the first frequency resource element in the first frequency resource is determined based on the interleaving of second frequency resource elements, the second frequency resource elements belonging to the first frequency resource. This interleaving ensures that the first frequency resource element has the quasi-random characteristics required by the compressed sensing algorithm; in other words, the reference signal carried on the first frequency resource can be quasi-randomly allocated, so that the compressed sensing algorithm can be used to estimate the channel on the first frequency resource, thus reducing the resource elements used for channel estimation, i.e., reducing the channel estimation overhead, thereby freeing up more resource elements for other uses. Attached Figure Description

[0093] The accompanying drawings are provided to further understand this disclosure and form part of this specification. They are used to explain this disclosure in conjunction with the following specific embodiments, but should not be construed as limiting this disclosure.

[0094] Figure 1 This is a schematic diagram of a communication system provided in one or more embodiments of this disclosure.

[0095] Figure 2 This is another schematic diagram of a communication system provided in one or more embodiments of this disclosure.

[0096] Figure 3 This is a schematic diagram of the basic component structure of a communication system provided in one or more embodiments of this disclosure.

[0097] Figure 4 A block diagram of a device in a communication system provided by one or more embodiments of the present disclosure is shown.

[0098] Figure 5 This is a schematic diagram illustrating the effect of comb-structured reference signal allocation provided in one or more embodiments of this disclosure on the channel impulse response (CIR) of a single antenna.

[0099] Figure 6 This is a schematic diagram illustrating channel estimation of multiple antennas based on measurement results on the same subcarrier, provided by one or more embodiments of this disclosure.

[0100] Figure 7 This is a schematic diagram illustrating the extraction of a single-antenna CIR from a cyclically shifted CIR and the acquisition of frequency domain channel estimation results provided by one or more embodiments of this disclosure.

[0101] Figure 8 This is a schematic diagram illustrating the aliasing effect of comb-8 sampling in the frequency domain provided by one or more embodiments of this disclosure.

[0102] Figure 9 This is a schematic diagram of the aliasing effect of a channel using comb-4 sampling and a cyclic shift interval of 2, provided by one or more embodiments of this disclosure.

[0103] Figure 10 This is a schematic diagram illustrating the impact of aliasing on channel estimation quality provided in one or more embodiments of this disclosure.

[0104] Figure 11 This is a schematic diagram of a uniform random sampling pattern and the corresponding sampling effect provided in one or more embodiments of this disclosure.

[0105] Figure 12 This is a schematic diagram of another sampling pattern and corresponding sampling effect provided in one or more embodiments of this disclosure.

[0106] Figure 13 This is a flowchart of a wireless communication method provided in one embodiment of the present disclosure.

[0107] Figure 14 This is a schematic diagram of a sequence generated by a PN sequence-based interleaver, provided in one or more embodiments of this disclosure.

[0108] Figure 15 This is a flowchart of another wireless communication method provided in one embodiment of the present disclosure.

[0109] Figure 16a This is a schematic diagram of a resource unit configuration provided by one or more embodiments of this disclosure.

[0110] Figure 16b This is a schematic diagram of another resource unit configuration provided by one or more embodiments of this disclosure.

[0111] Figure 16c This is a schematic diagram of another resource unit configuration provided by one or more embodiments of this disclosure.

[0112] Figure 17 This is a schematic diagram of generating quasi-random sampling patterns element by element according to one or more embodiments of this disclosure.

[0113] Figure 18A This is a schematic diagram of generating quasi-random sampling patterns block by block according to one or more embodiments of this disclosure.

[0114] Figure 18B This is a schematic diagram of a frequency hopping scheme provided by one or more embodiments of this disclosure.

[0115] Figure 18C This is a schematic diagram of another frequency hopping scheme provided by one or more embodiments of this disclosure.

[0116] Figure 19A This is a schematic diagram illustrating channel estimation using a compressed sensing algorithm provided in one or more embodiments of this disclosure.

[0117] Figure 19B This is a schematic diagram illustrating the relationship between mutual coherence and side lobes provided in one or more embodiments of this disclosure.

[0118] Figure 20 This is a block diagram of a wireless communication device provided in one or more embodiments of this disclosure.

[0119] Figure 21 This is a block diagram of another wireless communication device provided in one or more embodiments of the present disclosure.

[0120] Figure 22 A schematic diagram of the structure of a wireless communication device provided in one or more embodiments of the present disclosure is shown. Detailed Implementation

[0121] In the following description, reference is made to the accompanying drawings, which form a part of this disclosure, which illustrate by way of description specific aspects of embodiments of this disclosure or aspects that may be used with embodiments of this disclosure. It should be understood that embodiments of this disclosure can be used in other aspects and include structural or logical variations not depicted in the drawings. Therefore, the following detailed description should not be construed in a limiting sense, and the scope of this disclosure is defined by the appended claims.

[0122] To aid in understanding this disclosure, examples of wireless communication systems and devices are described below.

[0123] Exemplary communication systems and devices

[0124] refer to Figure 1 , Figure 1 This is a non-limiting illustrative example providing a simplified schematic of a communication system. Communication system 100 includes a radio access network 120. Radio access network 120 can be a next-generation (such as sixth-generation, 6G, or later) radio access network or a traditional (such as 5G, 4G, 3G, or 2G) radio access network. One or more electronic devices (EDs) 110a to 110j (collectively referred to as 110) can be interconnected with each other or connected to one or more network nodes (170a, 170b, collectively referred to as 170) within radio access network 120. Core network 130 can be part of the communication system and can depend on or be independent of the radio access technology used in communication system 100. Furthermore, communication system 100 includes a public switched telephone network (PSTN) 140, the Internet 150, and other networks 160.

[0125] Figure 2 An exemplary communication system 100 is illustrated. Generally, the communication system 100 enables multiple wireless or wired units to transmit data and other content. The purpose of the communication system 100 may be to provide content such as voice, data, video, and / or text via broadcast, multicast, and unicast. The communication system 100 can operate by sharing resources such as carrier spectrum bandwidth among its constituent units. The communication system 100 may include terrestrial communication systems and / or non-terrestrial communication systems. The communication system 100 can provide a wide variety of communication services and applications (such as earth monitoring, remote sensing, passive sensing and positioning, navigation and tracking, automated delivery, and mobility). The communication system 100 can provide high availability and robustness through the joint operation of terrestrial and non-terrestrial communication systems. For example, integrating a non-terrestrial communication system (or components thereof) into a terrestrial communication system can form a multi-layered heterogeneous network. Compared to traditional communication networks, heterogeneous networks can achieve better overall performance through efficient multi-link joint operation between terrestrial and non-terrestrial networks, more flexible function sharing, and faster physical layer link switching.

[0126] Terrestrial and non-terrestrial communication systems can be subsystems of a communication system. In the example shown, communication system 100 includes electronic devices (EDs) 110a to 110d (collectively referred to as ED 110), radio access networks (RANs) 120a and 120b, a non-terrestrial communication network 120c, a core network 130, a public switched telephone network (PSTN) 140, the Internet 150, and other networks 160. RANs 120a and 120b include corresponding base stations (BSs) 170a and 170b, which are generally referred to as terrestrial transmit and receive points (T-TRPs) 170a and 170b. The non-terrestrial communication network 120c includes access nodes 120c, which are generally referred to as non-terrestrial transmit and receive points (NT-TRPs) 172.

[0127] Alternatively or additionally, any ED 110 can be used to connect, access, or communicate with any other T-TRP 170a and 170b, NT-TRP 172, Internet 150, core network 130, PSTN 140, other network 160, or any combination thereof. In some examples, ED 110a can perform uplink and / or downlink transmissions with T-TRP 170a via interface 190a. In some examples, ED 110a, 110b, 110c, and 110d can also communicate directly with each other via one or more sidelink air interfaces 190b. In some examples, ED 110d can perform uplink and / or downlink transmissions with NT-TRP 172 via interface 190c.

[0128] Air interfaces 190a and 190b can employ similar communication technologies, such as any suitable wireless access technology. For example, communication system 100 can implement one or more channel access methods in air interfaces 190a and 190b, such as code division multiple access (CDMA), time division multiple access (TDMA), frequency division multiple access (FDMA), orthogonal FDMA (OFDMA), or single-carrier FDMA (SC-FDMA). Air interfaces 190a and 190b can utilize other higher-dimensional signal spaces, which may involve combinations of orthogonal and / or non-orthogonal dimensions.

[0129] The 190c air interface enables communication between the ED 110d and one or more NT-TRP172s via a wireless link or simply via a link. In some examples, the link is a dedicated connection for unicast transmission, a connection for broadcast transmission, or a connection between a group of EDs and one or more NT-TRPs for multicast transmission.

[0130] RANs 120a and 120b communicate with the core network 130 to provide various services, such as voice, data, and other services, to EDs 110a, 110b, and 110c. RANs 120a and 120b, and / or the core network 130, can communicate directly or indirectly with one or more other RANs (not shown), which may or may not be directly served by the core network 130, and may or may not use the same radio access technology as RANs 120a and / or RAN 120b. The core network 130 can also serve as a gateway access between (i) RANs 120a and 120b, or EDs 110a, 110b, and 110c, or both, and (ii) other networks (such as PSTN 140, Internet 150, and other networks 160). Additionally, some or all of the EDs in EDs 110a, 110b, and 110c may include functionality for communicating with different wireless networks via different radio links using different radio technologies and / or protocols. ED 110a, 110b, and 110c can communicate with a service provider or exchange (not shown) via a wired communication channel and with the Internet 150, rather than via wireless communication (or via wired communication in addition to wireless communication). PSTN 140 may include a circuit-switched telephone network for providing plain old telephone service (POTS). The Internet 150 may include a computer network and / or subnet (internal network) and employ protocols such as Internet Protocol (IP), Transmission Control Protocol (TCP), and User Datagram Protocol (UDP). ED 110a, 110b, and 110c may be multimode devices capable of operating under various wireless access technologies and integrate multiple transceivers required to support such technologies.

[0131] Basic component structure

[0132] Figure 3Another example of an ED 110 and base stations 170a, 170b, and / or 170c is shown. The ED 110 is used to connect people, things, machines, etc. The ED 110 can be widely used in various scenarios, such as cellular communication, device-to-device (D2D), vehicle-to-everything (V2X), peer-to-peer (P2P), machine-to-machine (M2M), machine-type communication (MTC), Internet of Things (IoT), virtual reality (VR), augmented reality (AR), industrial control, autonomous driving, telemedicine, smart grids, smart furniture, smart offices, smart wearables, smart transportation, smart cities, drones, robots, remote sensing, passive sensing, positioning, navigation and tracking, autonomous delivery, and mobility.

[0133] Each ED 110 represents any suitable end-user equipment for wireless operation and may include (or be referred to as) devices such as: user equipment / device (UE), wireless transmit / receive unit (WTRU), mobile station, fixed or mobile subscriber unit, cellular phone, station (STA), machine type communication (MTC) device, personal digital assistant (PDA), smartphone, laptop, computer, tablet, wireless sensor, consumer electronics, smartbook, vehicle, automobile, truck, bus, train, or IoT device, industrial equipment, or devices within the aforementioned equipment (such as communication modules, modems, or chips), etc. Next-generation ED 110 may be referred to using other terms. Base stations 170a and 170b are T-TRPs, referred to below as T-TRP 170. Similarly... Figure 3 As shown, NT-TRP is referred to as NT-TRP 172 below. Each ED 110 connected to T-TRP 170 and / or NT-TRP 172 can be dynamically or semi-statically started (i.e., established, activated, or enabled), shut down (i.e., released, deactivated, or disabled), and / or configured in response to one or more of connectivity availability and connectivity necessity.

[0134] ED 110 includes a transmitter 201 and a receiver 203 coupled to one or more antennas 204. Only one antenna 204 is shown. One, some, or all of the antennas may also be panels. The transmitter 201 and receiver 203 may be integrated, for example, integrated as a transceiver. The transceiver is used to modulate data or other content for transmission through at least one antenna 204 or a network interface controller (NIC). The transceiver may also be used to demodulate data or other content received through at least one antenna 204. Each transceiver includes any suitable structure for generating signals for wireless or wired transmission and / or for processing signals received wirelessly or wiredly. Each antenna 204 includes any suitable structure for transmitting and / or receiving wireless or wired signals.

[0135] ED 110 includes at least one memory 208. Memory 208 stores instructions and data used, generated, or collected by ED 110. For example, memory 208 may store software instructions or modules for implementing some or all of the functions and / or embodiments described herein and executed by one or more processing units 210. Each memory 208 includes any suitable one or more volatile and / or non-volatile storage and retrieval devices. Any suitable type of memory can be used, such as random access memory (RAM), read-only memory (ROM), hard disk, optical disk, subscriber identity module (SIM) card, memory stick, secure digital (SD) card, and processor cache, etc.

[0136] ED 110 may also include one or more input / output devices (not shown) or interfaces (such as those connected to...). Figure 1 (Wired interface of Internet 150 in the network). Input / output devices support interaction with the user or other devices in the network. Each input / output device includes any suitable structure for providing or receiving information from the user (including for network interface communication), such as a speaker, microphone, keypad, keyboard, display, or touchscreen.

[0137] ED 110 also includes a processor 210 for performing the following operations: operations related to preparing to transmit uplink transmissions to NT-TRP 172 and / or T-TRP 170, operations related to processing downlink transmissions received from NT-TRP 172 and / or T-TRP 170, and operations related to processing sidelink transmissions transmitted to and from other ED 110s. Processing operations related to preparing to transmit uplink transmissions may include operations such as encoding, modulation, transmit beamforming, and generating symbols for transmission. Processing operations related to processing downlink transmissions may include operations such as receive beamforming, demodulation, and decoding of received symbols. According to a specific embodiment, the downlink transmission may be received by receiver 203 via receive beamforming, and processor 210 may extract signaling from the downlink transmission (e.g., by detecting and / or decoding signaling). For example, the signaling may be a reference signal transmitted by NT-TRP 172 and / or T-TRP 170. In some embodiments, processor 276 performs transmit beamforming and / or receive beamforming based on beam direction indications (such as beam angle information (BAI)) received from T-TRP 170. In some embodiments, processor 210 may perform operations related to network access (such as initial access) and / or downlink synchronization, such as operations related to detecting synchronization sequences, decoding, and acquiring system information. In some embodiments, processor 210 may perform channel estimation, for example, using reference signals received from NT-TRP 172 and / or T-TRP 170.

[0138] Although not shown, processor 210 may be part of transmitter 201 and / or receiver 203. Although not shown, memory 208 may be part of processor 210.

[0139] The processing components in processor 210, transmitter 201, and receiver 203 may be implemented by the same or different processors, which execute instructions stored in memory (such as memory 208). Alternatively, some or all of the processing components in processor 210, transmitter 201, and receiver 203 may be implemented using special-purpose circuits such as a field-programmable gate array (FPGA), a graphics processing unit (GPU), or an application-specific integrated circuit (ASIC).

[0140] In some implementations, the T-TRP 170 can have other names, such as base station, basetransceiver station (BTS), wireless base station, network node, network device, network-side device, transmit / receive node, NodeB, evolved NodeB (eNodeB or eNB), home eNodeB, next-generation NodeB (gNB), transmission point (TP), site controller, access point (AP), or wireless router, relay station, ground node, ground network device, or ground base station, baseband unit (BBU), remote radio unit (RRU), radio unit (RU), active antenna unit (AAU), remote radio head (RRH), central unit (CU), distributed unit (DU), positioning node, etc. T-TRP 170 can be a macro BS, a pico BS, a relay node, or a donor node, or a combination thereof. T-TRP 170 can refer to the aforementioned equipment or to a component within such equipment (such as a communication module, modem, or chip).

[0141] In some embodiments, the various parts of T-TRP 170 may be distributed. For example, some modules in T-TRP 170 may be located remotely from the device housing the antenna of T-TRP 170 and may be coupled to the device housing the antenna via a communication link (not shown), sometimes referred to as a fronthaul, such as the Common Public Radio Interface (CPRI). Therefore, in some embodiments, the term "T-TRP 170" may also refer to network-side modules that perform processing operations such as determining the location of ED 110, resource allocation (scheduling), message generation, and encoding / decoding; these modules are not necessarily part of the device housing the antenna of T-TRP 170. These modules may also be coupled to other T-TRPs. In some embodiments, T-TRP 170 may actually be multiple T-TRPs operating together to serve ED 110, such as through cooperative multicast.

[0142] T-TRP 170 includes at least one transmitter 252 and at least one receiver 254 coupled to one or more antennas 256. Only one antenna 256 is shown. One, some, or all of the antennas may also be panels. The transmitter 252 and receiver 254 may be integrated as a transceiver. T-TRP 170 also includes a processor 260 for performing operations related to: preparing downlink transmissions to ED 110, processing uplink transmissions received from ED 110, preparing backlink transmissions to NT-TRP 172, and processing transmissions received from NT-TRP 172 via backlink. Processing operations related to preparing downlink or backlink transmissions may include operations such as encoding, modulation, precoding (e.g., MIMO precoding), transmit beamforming, and generating symbols for transmission. Processing operations related to processing received transmissions in the uplink or backlink may include operations such as receive beamforming, demodulation, and decoding of received symbols. Processor 260 can also perform operations related to network access (such as initial access) and / or downlink synchronization, such as generating the contents of a synchronization signal block (SSB), generating system information, etc. In some embodiments, processor 260 also generates beam direction indications, such as BAIs, that can be scheduled for transmission by scheduler 253. Processor 260 performs other network-side processing operations described herein, such as determining the location of ED 110, determining the location for deploying NT-TRP 172, etc. In some embodiments, processor 260 can generate signaling, for example, to configure one or more parameters of ED 110 and / or one or more parameters of NT-TRP 172. Any signaling generated by processor 260 is transmitted by transmitter 252. It should be noted that the term "signaling" as used herein can also be referred to as control signaling. Dynamic signaling can be transmitted in control channels such as the physical downlink control channel (PDCCH), while static or semi-static higher-layer signaling can be included in data packets that are transmitted in data channels such as the physical downlink shared channel (PDSCH).

[0143] Scheduler 253 may be coupled to processor 260. Scheduler 253 may be included within T-TRP 170 or may operate separately from T-TRP 170. Scheduler 253 may schedule uplink, downlink, and / or backlink transmissions, including issuing scheduling grants and / or configuring schedule-free (“configuration grants”) resources. T-TRP 170 also includes memory 258 for storing information and data. Memory 258 stores instructions and data used, generated, or collected by T-TRP 170. For example, memory 258 may store software instructions or modules for implementing some or all of the functions and / or embodiments described herein and executed by processor 260.

[0144] Although not shown, processor 260 may be part of transmitter 252 and / or receiver 254. Furthermore, although not shown, processor 260 may implement scheduler 253. Although not shown, memory 258 may be part of processor 260.

[0145] The processing components in processor 260, scheduler 253, transmitter 252, and receiver 254 can be implemented by the same or different processors, which execute instructions stored in memory (such as memory 258). Alternatively, some or all of the processing components in processor 260, scheduler 253, transmitter 252, and receiver 254 can be implemented using dedicated circuitry such as FPGA, GPU, or ASIC.

[0146] Although the NT-TRP 172 is only exemplified as a drone, it can be implemented in any suitable non-terrestrial form. It should be noted that the NT-TRP 172 can be omitted in some scenarios. Furthermore, in some implementations, the NT-TRP 172 may have other names, such as a non-terrestrial node, a non-terrestrial network device, or a non-terrestrial base station. The NT-TRP 172 includes a transmitter 272 and a receiver 274 coupled to one or more antennas 280. Only one antenna 280 is shown. One, some, or all of the antennas may also be panels. The transmitter 272 and receiver 274 may be integrated as a transceiver. The NT-TRP 172 also includes a processor 276 for performing operations related to: preparing downlink transmissions to ED 110, processing uplink transmissions received from ED 110, preparing return transmissions to T-TRP 170, and processing transmissions received from T-TRP 170 via return. Processing operations related to preparing downlink or backhaul transmissions may include operations such as encoding, modulation, precoding (e.g., MIMO precoding), transmit beamforming, and generating symbols for transmission. Processing operations related to processing receive transmissions in the uplink or backhaul may include operations such as receive beamforming, demodulation, and decoding of received symbols. In some embodiments, processor 276 performs transmit beamforming and / or receive beamforming based on beam direction information (e.g., BAI) received from T-TRP 170. In some embodiments, processor 276 may generate signaling, for example, to configure one or more parameters of ED110. In some embodiments, NT-TRP 172 implements physical layer processing but does not implement higher-layer functions, such as those in the medium access control (MAC) layer or radio link control (RLC) layer. Since this is only an example, NT-TRP 172 typically implements higher-layer functions in addition to physical layer processing.

[0147] The NT-TRP 172 also includes a memory 278 for storing information and data. Although not shown, a processor 276 may be part of the transmitter 272 and / or the receiver 274. Although not shown, the memory 278 may be part of the processor 276.

[0148] The processing components in processor 276, transmitter 272, and receiver 274 may be implemented by the same or different processors for executing instructions stored in memory (such as memory 278). Alternatively, some or all of the processing components in processor 276, transmitter 272, and receiver 274 may be implemented using dedicated circuitry such as a programmed FPGA, GPU, or ASIC. In some embodiments, NT-TRP 172 may actually be multiple NT-TRPs operating together to serve ED 110, such as through cooperative multicast.

[0149] T-TRP 170, NT-TRP 172 and / or ED 110 may include other components, but for clarity these components are omitted.

[0150] Basic module structure

[0151] One or more steps of the exemplary methods provided in this document can be derived from... Figure 4 The corresponding unit or module provided will be executed. Figure 4 The diagram illustrates units or modules within a device (such as ED 110, T-TRP 170, or NT-TRP 172). For example, signals can be transmitted by a transmitting unit or transmitting module. Signals can be received by a receiving unit or receiving module. Signals can be processed by a processing unit or processing module. Other steps can be performed by an artificial intelligence (AI) module or a machine learning (ML) module, which may be selected or omitted depending on actual needs. The corresponding units or modules can be implemented by hardware, one or more components or devices executing software, or a combination thereof. For example, one or more of these units or modules can be integrated circuits, such as a programmed FPGA, GPU, or ASIC. It should be understood that if these modules are implemented in software for execution by a processor, etc., these modules can be retrieved by the processor, in whole or in part, individually or collectively, for processing, in one or more instances, and these modules themselves may include instructions for further deployment and instantiation. It should be noted that... Figure 4 The modules shown are merely illustrative and should not be construed as limiting the embodiments of this disclosure. The device may include more or fewer modules, and this is not a limitation. For example, the transmitting and receiving modules can be replaced by a single transceiver module. Furthermore, depending on actual needs, the ML module may or may not be included in the device.

[0152] Further details regarding ED 110, T-TRP 170, and NT-TRP 172 are known to those skilled in the art. Therefore, these details are omitted herein.

[0153] Exemplary concepts of some terms

[0154] Delay spread: The difference in arrival time between the earliest arriving beam and the latest arriving beam.

[0155] Downlink: The channel from the BS to the UE.

[0156] Uplink: The channel from UE to BS.

[0157] Scheduler: The hardware and software components in a BS responsible for allocating frequency and time resources between users and antennas / ports.

[0158] Resource Element (RE): A resource atom consisting of a subcarrier and a time-domain symbol, which is the smallest unit of resource allocation.

[0159] Resource Block (RB): A group of 12 consecutive resource elements in the subcarrier domain (frequency domain).

[0160] Resource Block Group (RBG): A group consisting of multiple Resource Blocks (RBs).

[0161] Capacity: The maximum amount of data that the system can transmit per second.

[0162] Pilot: A reference signal in the frequency domain.

[0163] Symbol: The smallest unit of resources in the time domain.

[0164] The foregoing has described possible scenarios or general descriptions of examples of this disclosure; the following will explain the motivation and technical concept of this disclosure.

[0165] Multi-frequency transmission schemes are common in modern wireless communications. Orthogonal Frequency Division Multiplexing (OFDM) is one of the classic multi-frequency schemes, used in Wi-Fi, 4G LTE, and 5G NR. OFDM can transmit data simultaneously on several frequencies. These frequencies are called subcarriers. During propagation through the environment, the signal on each subcarrier will be distorted. The impact of the environment is characterized by the propagation channel. To compensate for these distortions, channel estimation is required.

[0166] To estimate the channel, some subcarriers are not used for data transmission, but instead to carry a special signal called a pilot or reference signal. Both the transmitter and receiver are aware of the reference signal (RS) and its frequency domain location. The receiver can estimate the channel on the RS subcarriers and then recover the channel for all subcarriers.

[0167] The amount of time and frequency resources required for channel estimation is called channel estimation overhead (or simply overhead). This overhead is measured in units of resource elements (REs). There is a trade-off between the accuracy and overhead of channel estimation. When the overhead is too high, the estimation accuracy is high, but fewer REs are available for data transmission, resulting in a decrease in capacity. When the overhead is too low, although a large number of REs are available for data transmission, the channel estimation accuracy will be poor, which will also lead to a decrease in capacity.

[0168] In existing schemes, the reference signal in the frequency domain is allocated using a comb structure, and the spacing between subcarriers is fixed. Increasing the spacing between pilot subcarriers can reduce overhead, but this spacing is limited by the estimated channel characteristics. That is, in scenarios with multipath propagation, there is a beam that arrives at the receiver first and a beam that arrives last. The difference in arrival times of these two beams is called the delay spread. The maximum spacing between pilot subcarriers is limited by the typical delay spread value in this scenario.

[0169] Reference signals for different antennas can be allocated on the same subcarrier. In this case, a sequence with cyclic shift (such as the Zadoff-Chu sequence) is used to multiplex the antennas. The maximum number of antennas that can be multiplexed is also limited by the delay spread.

[0170] The following section further elaborates on the limitations of delay spread in existing channel estimation schemes, using a probe reference signal as an example for channel estimation. However, it should be noted that other types of signals can also be used as reference signals for channel estimation, and this disclosure does not limit this approach.

[0171] Existing channel estimation techniques are based on the wideband sounding reference signal (SRS) transmitted by the UE to the BS. The SRS is mapped onto a comb-shaped reference signal. SRS corresponding to the same TX antenna can be mapped onto the same subcarrier and spaced apart by cyclic shift. Therefore, there are two parameters: comb (comb spacing) and cyclic shift (csh).

[0172] The parameter `comb` specifies the spacing between the reference signal subcarriers in the frequency domain, such as... Figure 5As shown. In OFDM systems, the spacing between subcarriers is defined by the subcarrier spacing (SCS), measured in Hz. In the time domain, this type of system can distinguish between 0 and 100 Hz. Latency within the range of seconds. When using comb, the measured spacing between subcarriers becomes... The uniquely identifiable time delay range is thus reduced, equal to The channel impulse response (CIR) estimated using comb will repeat 'comb' times in the time delay domain. This is true as long as the delay spread of the CIR is less than 'comb' times. This sampling method still achieves good channel estimation. Therefore, the parameter comb can be used to reduce the overhead of channel estimation for a single TX antenna.

[0173] Another parameter is cyclic shift (csh), which enables channel estimation for multiple antennas on the same subcarrier. Assuming all available subcarriers are used for channel estimation, and the goal is to estimate the channel corresponding to csh antennas on the same subcarrier within one symbol, a base sequence (such as the Zadoff-Chu sequence) is chosen. Figure 6 (Represented by small rectangles in the diagram). For antenna / port 1, the sequence is transmitted directly. For antenna / port 2, the nth element of the sequence is multiplied by a complex exponent with a linear phase increment before transmission, as shown below. Figure 6 As shown. For each subsequent antenna, the linear phase increment increases. At the receiver, the sum of all transmitted sequences is received. This sum is multiplied element-wise by the original unshifted sequence, and then an Inverse Discrete Fourier Transform (IDFT) is performed, as shown. Figure 6 As shown. When estimating csh antennas in this way, the estimable time delay spread must not exceed [a certain value]. .

[0174] `comb` and `csh` can be used simultaneously to estimate more antennas at the same time (within the same symbol). In this case, the sequence is mapped to comb subcarriers. The maximum delay spread that can be estimated when using the parameters `comb` and `csh` simultaneously is... .

[0175] CIR of a specific antenna / port is obtained through windowing from Figure 6 Extracted from the multiplexed CIR, such as Figure 7As shown. After the desired CIR is separated from the other CIRs, the cyclic shift of the desired CIR is compensated based on a known port-cyclic shift scheme. The final channel estimation result is obtained through some interpolation algorithm, the simplest of which is to use a zero-filled Discrete Fourier Transform (DFT).

[0176] As mentioned above, the maximum values ​​of parameters comb and csh are limited by the delay spread of the channel to be estimated. If the delay spread is greater than... In this case, aliasing will occur in the time delay domain, leading to a deterioration in estimation quality. For example, if we consider single-antenna CIR estimation, where csh=1, comb=8, and the time delay spread is greater than 1, then aliasing will occur in the time delay domain, resulting in a deterioration in estimation quality. This will cause self-interference due to aliasing, such as Figure 8 As shown. The same conclusion applies when using cyclic shifting on regular comb-like structures, such as... Figure 9 As shown. In this situation, interference can occur between CIRs of different antennas (which may belong to the same UE or different UEs), such as... Figure 9 As shown. After extracting the required antenna / port CIR through windowing, aliasing still exists in the CIR within the window. This effect increases the error of subsequent channel estimation, such as... Figure 10 As shown. It should be noted that the specific values ​​of the parameters such as comb and csh mentioned above are for illustrative purposes only and should not be construed as limiting the embodiments of this disclosure.

[0177] Therefore, the reduction in overhead in existing channel estimation is limited by the maximum delay spread of the channel to be estimated. Furthermore, overhead reduction beyond this limit can lead to distorted channel estimation results due to aliasing.

[0178] In view of the above, this disclosure provides a reference signal allocation scheme to reduce channel estimation overhead, thereby using fewer reference signals to estimate a given channel while achieving the same / similar channel estimation accuracy as existing schemes.

[0179] Studies typically show that compressed sensing (CS) algorithms can reduce overhead when the reference signal position is random. However, to ensure the applicability of the CS algorithm, the main task is to formulate deterministic rules for the reference signal position, whose performance is close to that of randomly arranged reference signals.

[0180] To address this objective, the inventors observed that in existing technologies, interleavers can be used for permutation purposes, and transferring this permutation from existing scenarios to channel estimation scenarios would offer significant advantages. Therefore, in this disclosure, an interleaver is used to achieve random arrangement (random sampling or quasi-random sampling) of the reference signal. In this way, the present disclosure can utilize the interleaver to complete the random arrangement task of the reference signal (RS), thereby ensuring the applicability of the CS algorithm and achieving channel estimation using fewer RSs. Furthermore, compared to existing solutions, the technical solution of this disclosure achieves better channel estimation performance using the same number of RSs.

[0181] In addition, some existing interleavers are not designed specifically for channel estimation and therefore cannot be used directly. The specific reasons are explained below.

[0182] Regarding the existing interleaver design, in the forward error correction (FEC) part of the existing structure, the interleaver is defined as an internal interleaver for Turbo codes. The main task of the bit interleaver in Turbo codes is to spread the bits as far apart as possible. This operation improves the performance of the FEC algorithm. The bit interleaver used is a quadratic permutation polynomial (QPP) interleaver. For a sequence of N bits, it is defined by the following simple formula:

[0183] .

[0184] coefficient and Carefully selected to ensure maximum bit distribution. For each number of input bits... ,coefficient and All have been optimized to maximize the dispersion factor. :

[0185]

[0186] in, This represents the distance between the i-th bit and the j-th bit before dispersion. This represents the spacing between the two bits after they are dispersed.

[0187] However, QPP bit interleavers are designed specifically for FEC, and the main goal of QPP coefficient optimization is to achieve maximum bit dispersion (after interleaving, adjacent bits should be as separated as possible). Given a length of The bit blocks, with their bit indices interleaved according to the following rules:

[0188]

[0189] Among them, coefficient and It is for each value The coefficients specified in the table, Indicates the position of the new bit.

[0190] Returning to the core idea of ​​this disclosure: using an interleaver to obtain a quasi-random sampling pattern, which differs from the regular comb sampling patterns used in existing channel estimation. The basic idea of ​​this disclosure stems from the observation that when a universal uniform random function (e.g., from MATLAB) is used to generate the sampling pattern, the IDFT exhibits a sharp peak and nearly constant "sidelobes," such as... Figure 11 As shown. This indicates that this sampling method does not produce aliasing, but there may still be small and acceptable self-interference caused by sidelobes in the signal. However, it is difficult to efficiently generate quasi-random patterns with zero intersection (zero common subcarriers) using a general uniform random generator. One feasible solution is to use a permutation interleaver. The permutation guarantees that if there is no intersection before the permutation, there will also be no intersection after the permutation.

[0191] If the quasi-random sampling pattern is generated based on the existing structure described above, by interleaving consecutive pilot blocks using QPP and coefficients, the sidelobe level after IDFT will be too high. Figure 12 An example is shown: using the same number of pilots (the same number of 1s in the sampling mask), a much higher sidelobe level is produced if a QPP interleaver (or QPP) with coefficients taken from the FEC portion is used. In this specific example, the sequence length is K=2304, and the QPP coefficients are: =253, =216. High sidelobe levels introduce high interference and distort the impulse response of the channel after sampling. Therefore, the coefficients of the QPP need to be carefully selected to produce a permutation with low IDFT sidelobe levels. Since the coefficients in the existing structure cannot be used in this disclosure, a quasi-random sampling rule needs to be designed, which needs to take into account the characteristics required by the compressed sensing algorithm, as detailed later.

[0192] The technical concept of this disclosure has been briefly described above, and the specific embodiments of this disclosure will be described in detail below.

[0193] One embodiment of this disclosure provides a wireless communication method, such as... Figure 13 As shown, the method includes:

[0194] Step 1302, receive first information, wherein the first information is used to determine a first frequency resource element in the first frequency resource for carrying at least one first sequence, and a reference signal corresponding to the at least one first sequence is used to measure the channel on the first frequency resource;

[0195] The first frequency resource unit in the first frequency resource is determined based on the interleaving of the second frequency resource unit, and the second frequency resource unit belongs to the first frequency resource.

[0196] The above method can be implemented by a first network element, which can be a terminal device (such as a UE or a combination thereof). Figure 2 and Figure 3 The ED 110 can be implemented in any possible way, or it can be part of the terminal device (such as being implemented as a module that can be integrated into the device), and this is not limited here. It should be noted that when the first network element is implemented as a module, the receiving operation can also be an input operation. Therefore, it is not necessary to receive the first information from a device with receiving function, but only to input the first information. The detailed content of the receiving operation performed by the first network element in this document also applies to the input operation.

[0197] The first information can be received by the first network element from the second network element. This second network element can be a network device (such as a BS or a combination thereof). Figure 2 and Figure 3 The T-TRP 170 described herein can be any possible implementation, or it can be part of the network device (such as being implemented as a module that can be integrated into the device), and this is not limited here. It should be noted that when the second network element is implemented as a module, the sending operation can also be an output operation. Therefore, it is not necessary to send the first information to a device with sending function, but only to output the first information. The detailed description of the sending operation performed by the second network element in this document also applies to the output operation.

[0198] It should be noted that in scenarios where the UE and BS communicate with each other, the first network element can be the UE and the second network element can be the BS.

[0199] The first information can be information from the second network element, such as configuration information or indication information. In one possible implementation, the first information can be carried in at least one of the following: MAC control element (MAC CE), downlink control information (DCI), or radio resource control (RRC), without limitation here.

[0200] The first sequence is carried on the first frequency resource unit, and the number of first sequences is not limited here. For example, when there is one first sequence, it means that there is no antenna multiplexing on the same subcarrier (csh=1); when there is more than one first sequence, it means that there is antenna multiplexing on the same subcarrier (csh≠1). When there are multiple first sequences, different first sequences are multiplexed on the same first frequency resource unit, that is, their positions are the same, but they are cyclically shifted (e.g., as shown in the image). Figure 6 The cyclic shift shown is different.

[0201] The first frequency resource units are interleaved frequency resource units, corresponding to the first sampling pattern of the channel on the first frequency resource. These first frequency resource units are obtained from second frequency resource units, which are pre-interleaved frequency resource units and correspond to the second sampling pattern of the channel on the first frequency resource. The second sampling pattern differs from the first sampling pattern. For example, the first frequency resource may include frequency resource units, and the sampling pattern of these units may refer to a pattern where the reference signal used for channel estimation is set to 1 at one position and 0 at other positions. This is because transmitting the reference signal on the first frequency resource unit is equivalent to sampling the channel on the first frequency resource.

[0202] Both the first frequency resource element and the second frequency resource element are located within or belong to the first frequency resource, but they will not exist simultaneously. The second frequency resource element is mentioned only to describe the interleaving process; the resulting first frequency resource element will be used for subsequent reference signal transmission or reception.

[0203] The interleaving from the second frequency resource unit to the first frequency resource unit ensures that the first sampling pattern is a quasi-random sampling pattern. In this way, the reference signal used for channel estimation can be placed according to this quasi-random sampling pattern, thereby realizing the randomization of the reference signal position. Therefore, the CS algorithm can be used to recover the channel CIR on the first frequency resource, thereby reducing the channel estimation overhead.

[0204] Regarding the number of resource elements included in a single frequency resource unit, in one possible implementation, at least one of the first frequency resource units includes multiple resource elements, or each of the first frequency resource units includes one resource element. This means that the above interleaving can be performed at the block level (block-by-block), where one block includes multiple resource elements; or it can be performed at the resource element level (element-by-element).

[0205] Regarding the interleaving design in this disclosure, in one possible implementation, at least one parameter of the interleaving is associated with the total number of resource elements (REs) included in the first frequency resource. When the total number of REs changes, one or more parameters associated with the interleaving can be adjusted accordingly. When selecting one or more parameters associated with the interleaving, the total number of resource elements included in the first frequency resource needs to be taken into consideration. For example, the aforementioned interleaving can be implemented based on a correspondence between the total number of REs included in the first frequency resource and interleaving parameters (e.g., a table storing this correspondence; no specific interleaving implementation is limited here). Subsequently, the index in this table can be used to locate one or more parameters associated with the interleaving.

[0206] For example, when interleaving is implemented using an interleaver, the parameters of the interleaver are related to the total number of REs included in the first frequency resource. The specific method for designing the interleaver parameters will be described later. Alternatively, when interleaving is implemented using a predefined table storing the above correspondences, the interleaving parameters can be obtained by looking up the total number of REs included in the first frequency resource in that predefined table. Table 1 below is an example of such a predefined table.

[0207] The above section focused on explaining the basic design principles of interleaving parameters. The following section will explain the types of interleaving.

[0208] In one possible implementation, the location of the second frequency resource element is associated with the type of interleaving. The type of interleaving (or interleaving pattern) defines a general rule for mapping the second frequency resource element to the first frequency resource element. When interleaving is implemented using an interleaver, the interleaving type refers to the specific type of interleaver, such as a quadratic permutation polynomial (QPP) interleaver, a pseudo-noise (PN) sequence-based interleaver, etc. Different types of interleaving can generate different patterns, upon which the reference signal used for channel estimation can be placed. The location of the second frequency resource element may vary depending on the type of interleaving; that is, if different types of interleaving are used, the pattern of the frequency resource element before interleaving may also be different. For example, when the interleaving type corresponds to a QPP interleaver, the pattern of the second frequency resource element will appear as large blocks of resource elements. Similarly, when the interleaving type corresponds to a PN sequence-based interleaver, the pattern of the second frequency resource element will exhibit a regular distribution. Furthermore, different interleavers with different parameters but the same interleaving type can be applied to frequency resource elements with the same pattern before interleaving, but they are themselves different interleavers. For example, when using a QPP interleaver, different parameters represent different interleavers, but these interleavers can be applied to the second frequency resource unit with the same pattern.

[0209] In one possible implementation, the aforementioned interleaving includes applying at least one of the following: a cubic permutation polynomial (CPP) interleaver, a quadratic permutation polynomial (QPP) interleaver, a Takeshita-Costello interleaver, a Welch-Costas interleaver, an interleaver based on a pseudo-noise (PN) sequence, or an interleaver based on a random integer sequence. This interleaving can be performed using a CPP interleaver, a QPP interleaver, a Takeshita-Costello interleaver, a Welch-Costas interleaver, a PN-sequence-based interleaver, or a random integer sequence-based interleaver, or a combination of two or more of the above interleavers. This provides flexibility for designing interleaving strategies according to specific needs. It should be noted that the listed interleavers are for illustrative purposes only and are not restrictive.

[0210] Next, we will discuss the specific design method for receiving interleaver parameters, taking the implementation of interleaving via a QPP interleaver as an example.

[0211] In one possible implementation, the interleaving includes applying a QPP interleaver; the interleaving is based on a first coefficient and a second coefficient, which are used to determine the sampling pattern of all frequency resource elements in the first frequency resource. In another possible implementation, the first and second coefficients are used to obtain a one-to-one correspondence between the positions of the second frequency resource elements and the positions of the first frequency resource elements. The first coefficient is represented by the coefficient in the above QPP interleaver formula. The second coefficient is represented by the coefficient in the QPP interleaver formula above. By setting appropriate first and second coefficients, a one-to-one correspondence is established between the positions of the second and first frequency resource units, ensuring that the positions of the first frequency resource units are randomly arranged. Furthermore, by appropriately selecting the first and second coefficients, the signal recovery performance when using the CS algorithm can be improved.

[0212] In one possible implementation, the first factorization of the first coefficient is expressed as the product of multiple first integers and an interleaving factor, where the interleaving factor is an integer not divisible by any of the multiple first integers, and each of the multiple first integers is a prime number. In another possible implementation, the second factorization of the total number of resource elements in the first frequency resource is expressed as the product of the multiple first integers raised to their respective first powers, where at least one of the first powers is greater than 1; the second coefficient is not divisible by any of the multiple first integers, meaning that each of the multiple first integers has its corresponding first power in the expression of the second factorization. As mentioned above, here the first coefficient is represented as a coefficient. The second coefficient is expressed as coefficient. It should be noted that, in the following text, multiple first integers can be represented as follows: The interleaving factor can be expressed as The total number of resource elements in the first frequency resource can be expressed as Multiple first powers can be represented as follows: .

[0213] coefficient and The selection of QPP must satisfy the following two conditions: both ensuring that QPP constitutes a permutation and minimizing the maximum sidelobe level of the sampling pattern generated by QPP. More specifically, the factorization of the total number of REs in the first frequency resource is as follows: ,in, It is a prime number. If the integer is a natural number, then the coefficients of the QPP interleaver must satisfy the following conditions:

[0214] Cannot be Divisible by any number in the range;

[0215] ,in, It cannot be Any integer divisible by any number in the set.

[0216] Regarding how the first network element obtains the QPP interleaver parameters, in one possible implementation, the first and second coefficients are predefined, or the first information indicates the first and second coefficients. That is, the first and second coefficients can be predefined by the first network element (e.g., predefined by both the first and second network elements), or the first network element can obtain them from the second network element. For example, the second network element can directly send or indirectly indicate the first and second coefficients to the first network element, thereby improving the flexibility of coefficient acquisition.

[0217] In one possible implementation, a correspondence can exist between the first coefficient and the second coefficient. For example, this correspondence can be implemented as a table, allowing the first and second coefficients to be determined based on the table. If the first network element stores a table, this table represents the correspondence between indices and coefficients, as shown in Table 1 below. In Table 1, It means cannot be Any prime factor (as mentioned above) Any natural number divisible by , Any of the listed values ​​can be applied to a given number of REs, while The specific values ​​can be fixed or further specified according to actual needs. It should be noted that Table 1 is for illustrative purposes only and not as a limitation; such a table may include more or fewer entries. The first network element can easily obtain the required first and second coefficients through the target index indicated by the second network element. This saves signaling.

[0218] Table 1: Exemplary coefficients of QPP interleaver

[0219]

[0220] With the introduction of a QPP interleaver, the frequency hopping scheme in this disclosure may differ from existing frequency hopping schemes. In one possible implementation, at least one first frequency resource unit in the first frequency resource unit includes multiple resource elements; the position of the third frequency resource unit in the second frequency resource is determined based on the QPP interleaver and the position of at least one first frequency resource unit, wherein the second frequency resource and the first frequency resource can be located on different symbols, and the third frequency resource unit is used to carry at least one second sequence. The second frequency resource refers to another first frequency resource (or yet another first frequency resource), which and the aforementioned first frequency resource can be located on different symbols, i.e., they can be located on adjacent symbols or on discontinuous symbols. Therefore, frequency hopping is applied between at least one second frequency resource unit and the third frequency resource unit. The hopping position of the third frequency resource unit after frequency hopping depends on the position of the aforementioned at least one first frequency resource unit. Therefore, at least one first frequency resource unit is regarded as the frequency resource unit before interleaving, and the third frequency resource unit is regarded as the frequency resource unit after interleaving. Thus, the position of the third frequency resource unit can be obtained by inputting the position of at least one first frequency resource unit into the QPP interleaver. It should be noted that at least one first frequency resource unit may include multiple first frequency resource units, that is, there are multiple first frequency resource units, each of which includes multiple resource elements (the number of resource elements in each first frequency resource unit may be different), and then after frequency hopping, each first frequency resource unit has its corresponding third frequency resource unit.

[0221] When the second frequency resource unit comprises multiple resource elements, this means that interleaving can be performed at the block level, and frequency hopping can also be performed in this case. The position of the frequency resource unit after hopping is associated with the starting position of the frequency resource unit and the QPP interleaver. Unlike conventional frequency hopping, which requires occupying all available frequency resource units, the above frequency hopping can skip some frequency resource units thanks to the QPP interleaver design, thereby reducing channel estimation overhead.

[0222] As mentioned above, in addition to the QPP interleaver, other interleavers may be used in this disclosure, some of which will be further described below.

[0223] CPP interleaver or general interleaver based on permutation polynomial

[0224] For a sequence of N bits, the CPP interleaver is defined by the following formula:

[0225]

[0226] All coefficients are integers. , and Specific rules must also be met to ensure that the CPP interleaver generates permutations (the elements before and after interleaving maintain a one-to-one correspondence). Other coefficients must also meet other rules to ensure low sidelobe levels.

[0227] For a sequence of N bits, the general permutation-type interleaver in the form of a D-order permutation polynomial is defined as follows:

[0228]

[0229] The above rules also apply to the general interleaver based on permutation polynomials. All coefficients are integers. Specific rules must also be met to ensure that the interleaver generates permutations (the elements before and after interleaving maintain a one-to-one correspondence). In addition, specific rules are designed for each coefficient to ensure that the sidelobe level is low.

[0230] It should be noted that this polynomial can usually also include coefficients. ,Right now:

[0231]

[0232] However, The value of has no effect on the interleaver performance. For this reason, it is usually assumed to be 0.

[0233] PN sequence-based interleaver

[0234] Because PN sequences have good sidelobe levels, they can also be applied to channel estimation scenarios. However, these sequences cannot be directly used for pilot subcarrier interleaving because, for a given length... The number of 0s and 1s is fixed. In this disclosure, 1 indicates the presence of a pilot signal, and it is desirable to implement an interleaver that is of the same length. Internal energy can adapt to different numbers of 1.

[0235] Although PN sequences cannot directly meet the requirements of this disclosure, there is still a method to use these sequences to generate interleaving patterns with the desired characteristics (low sidelobes). In one possible implementation, the interleaving involves applying a PN sequence-based interleaver where the total number of resource elements in the first frequency resource is a power of 2. That is, for a certain natural number... It can generate a length of The PN sequence is generated by appending an extra 0 during the permutation process. The PN sequence can be generated using a linear feedback shift register, with its feedback connection provided by... Definition of a primitive polynomial.

[0236] Given such a sequence of 0s and 1s, a negated sequence can be defined. The design of the interleaver can be described by the following process: For a given PN sequence, append a 0 to its end. Therefore, according to the properties of the PN sequence, the number of 1s and 0s in the resulting sequence is equal. Next, perform element-wise negation (NOT) on the 0-padded PN sequence to generate the negated PN sequence, as follows: Figure 14 As shown in (a) above. Then, for each element in the inverted PN sequence, the index of that element is associated with the element in the non-inverted PN sequence that has the same value and is closest in position, as shown below. Figure 14 As shown in (b) and (c). For example, inverting the first 0 in the PN sequence ( ) and the first 0 in the non-inverted PN sequence ( The association is performed by taking the next element (the second 0) in the inverted PN sequence. The index of ) and the second 0 in the non-inverted sequence ( The index is associated with the next element. And so on, such as Figure 14 As shown in (c) in the figure.

[0237] After processing all the elements of the inverted PN sequence in this way, the permutation rule is obtained. This interleaver works well when applied to comb-like structures.

[0238] Interleaver based on random integer sequences

[0239] Similar sampling patterns can also be constructed based on general random integer generation algorithms or their improved versions. Such random integer generation algorithms include the Mersenne Twister (and its improved versions), the Combined Multiple Recursive Random Numbers generator, and the Lagged Fibonacci generator. Of course, other random number generators can also be used, which will only result in minor performance differences.

[0240] Given the maximum number of subcarriers and seed value The generator produces values ​​in the range of 1 to N at each step. The sequence formed by these values ​​exhibits a uniformly random distribution, determined by a seed value. Definition, therefore different The values ​​will generate different random sequences. However, values ​​may be repeated within these sequences, thus failing to form a permutation. To obtain a permutation from the random integer generator, all generated random numbers can be tracked. If, at some step, the random generator outputs a value that has already been generated, the output for that step is discarded, and the generator is called again. This process is repeated until all values ​​have been generated. There are several different values.

[0241] This is a simple and intuitive algorithm, and further optimizations and improvements can be made based on similar approaches. From the perspective of the communication system, only the seed and subcarrier number need to be notified to define the permutation on both the second and first network element sides. Therefore, this type of interleaver has low notification overhead.

[0242] Takeshita-Costello interleaving

[0243] When the length is At that time, these interleavers are defined according to the following formula:

[0244]

[0245] in, and It is an integer.

[0246] In this case, the Takeshita-Costello interleaver is a QPP interleaver with non-integer coefficients. and and non-zero coefficients As shown in the following formula:

[0247]

[0248] When length Non-power of 2 ( When using existing algorithms, the Takeshita-Costello interleaver can be implemented, which will not be elaborated here.

[0249] It should be noted that, in most cases, if both interleavers can provide good sidelobe levels, then the combination of the two can also provide good sidelobe levels. That is, if interleaver 1 is defined as... Define interleaver 2 as Their combination is defined as Different interleavers or interleavers of the same type can be combined in this way. For example, and It can be a QPP interleaver with different coefficients, or, for example, It can be an interleaver based on a random number generator, and It can be an interleaver based on PN sequences. Furthermore, multiple levels of combination are possible, for example... .

[0250] The first network element can directly receive information about a first frequency resource unit used to carry at least one first sequence from the first frequency resources. In this case, the first frequency resource unit can be determined by the second network element. It should be noted that the first frequency resource unit can also be determined by the first network element. In one possible implementation, the first information can indicate a second frequency resource unit. The first network element can obtain the second frequency resource unit before interleaving and perform interleaving based on predefined rules to obtain the first frequency resource unit. In this case, the second network element does not need to notify the first network element of the first frequency resource unit after interleaving. As an example of indicating the second frequency resource unit, the first information may include a bitmap for indicating the second frequency resource unit.

[0251] In this disclosure, channel estimation can be performed by a second network element (such as a BS), i.e., performing uplink channel estimation. In this case, a first network element (such as a UE) receives first information and transmits at least one first sequence on a first frequency resource. That is, the UE transmits reference signals corresponding to at least one first sequence to the BS, and then the BS performs channel estimation based on these reference signals. In one possible implementation, the reference signal corresponding to at least one first sequence is a sounding reference signal (SRS) or a demodulation reference signal (DMRS).

[0252] The aforementioned uplink channel estimation can be used in Time Division Duplex (TDD) MIMO OFDM systems. In one possible implementation, the BS configures a second frequency resource element (RFI) for each antenna of a group of UEs. The BS selects the number of REs to be occupied by the reference signal and the time-domain location of the reference signal for each second RRFI. The BS then transmits this configuration to the UEs via a control channel. The UEs can use a predefined table to determine the coefficients of the QPP interleaver based on a given number of subcarriers (REs). Based on these coefficients and the information from the second RRFI, the UE determines a first RRFI. The UE then uses the first RRFI to transmit a reference signal (e.g., a probe reference signal) to the BS. Based on the received reference signal, the BS performs channel estimation using a compressed sensing algorithm.

[0253] Channel estimation can also be performed by a second network element (such as a BS), i.e., performing downlink channel estimation. In this case, a first network element (such as a UE) receives first information and receives at least one first sequence on a first frequency resource. That is, the BS sends a reference signal corresponding to at least one first sequence to the UE, and then the UE performs channel estimation based on the reference signal. In one possible implementation, the reference signal corresponding to at least one first sequence is a channel state information reference signal (CSI-RS).

[0254] The downlink channel estimation described above can be used in Frequency Division Duplex (FDD) MIMO OFDM systems. In one possible implementation, the BS configures a second frequency resource element for each antenna of a group of UEs. The BS then sends the second frequency resource element information to each UE via a control channel. Based on the second frequency resource element, the BS uses a QPP interleaver that obtains coefficients from a predefined table to determine a first frequency resource element. The BS uses the first frequency resource element to determine the CSI-RS configuration for each UE and then sends the CSI-RS signal to the UE. The UE also calculates the first frequency resource element based on the received second frequency resource element and the coefficients in the predefined table. Therefore, the UE determines the CSI-RS configuration adopted by the BS. The UE then receives the CSI-RS from the BS and performs channel estimation using a compressed sensing algorithm based on these reference signals.

[0255] In one possible implementation, still referencing Figure 13 The above methods include:

[0256] Step 1302, receive first information, wherein the first information is used to determine a first frequency resource element in the first frequency resource for carrying at least one first sequence, and a reference signal corresponding to the at least one first sequence is used to measure the channel on the first frequency resource;

[0257] The first frequency resource unit in the first frequency resource is determined based on the interleaving of the second frequency resource unit, and the second frequency resource unit belongs to the first frequency resource.

[0258] Step 1304: Receive second information, wherein the second information is used to determine a fourth frequency resource element in the third frequency resource for carrying at least one third sequence, and a reference signal corresponding to the at least one third sequence is used to measure the channel on the third frequency resource.

[0259] The first frequency resource unit and the fourth frequency resource unit do not overlap in the frequency domain.

[0260] The first and second information are used only to distinguish frequency resource units allocated to different antennas. It should be noted that the first and second information can be combined into one message or split into two messages, as long as the corresponding information can be received; this is not limited here. The type of the reference signal corresponding to at least one third sequence is the same as the type of the reference signal corresponding to at least one third sequence. More than one antenna may use non-overlapping frequency resource units to transmit or receive reference signals, and the process of transmitting or receiving reference signals for each antenna is similar.

[0261] At least one third sequence may also include one or more sequences. For example, the presence of one third sequence indicates no antenna multiplexing on the same subcarrier (csh=1); the presence of more than one third sequence indicates antenna multiplexing on the same subcarrier (csh≠1). In the case of multiple third sequences, different third sequences are multiplexed on the same fourth frequency resource element, i.e., their positions are the same, but they are cyclically shifted (e.g., as shown). Figure 6 The cyclic shift shown is different.

[0262] In the wireless communication method provided in this disclosure, the first frequency resource unit is determined based on the interleaving of the second frequency resource unit. This interleaving ensures that the first frequency resource unit has the quasi-random characteristics required by the CS algorithm. In other words, the reference signal carried on the first frequency resource can be randomly arranged, so that the compressed sensing algorithm can be used to estimate the channel on the first frequency resource. Therefore, the resource elements used for channel estimation are reduced, that is, the channel estimation overhead can be reduced, so that more resource elements can be reserved for other purposes.

[0263] The preceding text described the wireless communication method of this disclosure from the perspective of the first network element. The following text will combine... Figure 15 The wireless communication method of this disclosure is described from the perspective of a second network element. Figure 15 A schematic flowchart of another wireless communication method provided by one or more embodiments of this disclosure is shown. This method can be implemented by a second network element. Figure 15 As shown, the method may include:

[0264] Step 1502: Send first information, wherein the first information is used to determine a first frequency resource element in the first frequency resource for carrying at least one first sequence, and a reference signal corresponding to the at least one first sequence is used to measure the channel on the first frequency resource.

[0265] The first frequency resource unit in the first frequency resource is determined based on the interleaving of the second frequency resource unit, and the second frequency resource unit belongs to the first frequency resource.

[0266] The second network element can be a network device or a part of that network device (such as being implemented as a module that can be integrated into the device), and there is no limitation here. It should be noted that when the second network element is implemented as a module, the sending operation can also be an output operation. Therefore, it is not necessary to send the first information to a device with sending function, but only to output the first information. The detailed content of the sending operation performed by the second network element in this article also applies to the output operation.

[0267] The above steps can be referred to the relevant description of the first network element above, and will not be repeated here.

[0268] In one possible implementation, at least one parameter of the aforementioned interleaving is associated with the total number of resource elements (REs) included in the first frequency resource.

[0269] In one possible implementation, the location of the second frequency resource unit is associated with the type of interleaving.

[0270] In one possible implementation, the above interleaving includes applying at least one of the following: a cubic permutation polynomial (CPP) interleaver, a quadratic permutation polynomial (QPP) interleaver, a Takeshita-Costello interleaver, a Welch-Costas interleaver, an interleaver based on a pseudo-noise (PN) sequence, or an interleaver based on a random integer sequence.

[0271] In one possible implementation, the above interleaving includes applying a QPP interleaver; the interleaving is based on a first coefficient and a second coefficient, which are used to determine the sampling pattern of all frequency resource elements in the first frequency resource.

[0272] In one possible implementation, the first coefficient and the second coefficient are used to obtain a one-to-one correspondence between the location of the second frequency resource unit and the location of the first frequency resource unit.

[0273] In one possible implementation, the first factorization of the first coefficient is represented as the product of a plurality of first integers and an interleaving factor, wherein the interleaving factor is an integer that is not divisible by any of the plurality of first integers, and each of the plurality of first integers is a prime number.

[0274] In one possible implementation, the second factor decomposition of the total number of resource elements in the first frequency resource is represented as the product of multiple first integers after each of them is raised to a power corresponding to the first integer, wherein at least one of the first powers is greater than 1; the second coefficient cannot be divided by any of the multiple first integers.

[0275] In one possible implementation, the first coefficient and the second coefficient are predefined, or the first information indicates the first coefficient and the second coefficient.

[0276] In one possible implementation, the first and second coefficients are determined based on a table.

[0277] In one possible implementation, at least one first frequency resource unit in the first frequency resource unit includes multiple resource elements; the position of the third frequency resource unit in the second frequency resource is determined based on the position of the QPP interleaver and at least one first frequency resource unit, wherein the second frequency resource and the first frequency resource are located on different symbols, and the third frequency resource unit is used to carry at least one second sequence.

[0278] In one possible implementation, the above interleaving includes applying a PN sequence-based interleaver, wherein the total number of resource elements in the first frequency resource is equal to a power of 2.

[0279] In one possible implementation, the first information also indicates a second frequency resource unit.

[0280] In one possible implementation, the first information includes a bitmap for indicating the second frequency resource unit.

[0281] In one possible implementation, at least one of the first frequency resource units includes a plurality of resource elements, or each of the first frequency resource units includes one resource element.

[0282] In one possible implementation, the method further includes receiving at least one first sequence on a first frequency resource.

[0283] In one possible implementation, the reference signal corresponding to at least one first sequence is a sounding reference signal (SRS) or a demodulation reference signal (DMRS).

[0284] In one possible implementation, the method further includes transmitting at least one first sequence on a first frequency resource, wherein the reference signal corresponding to the at least one first sequence is a channel state information reference signal (CSI-RS).

[0285] In one possible implementation, the first information is carried in at least one of the following: MAC control element (MAC CE), downlink control information (DCI), or radio resource control (RRC).

[0286] In one possible implementation, still referencing Figure 15 The above methods include:

[0287] Step 1502: Send first information, wherein the first information is used to determine a first frequency resource element in the first frequency resource for carrying at least one first sequence, and a reference signal corresponding to the at least one first sequence is used to measure the channel on the first frequency resource.

[0288] The first frequency resource unit in the first frequency resource is determined based on the interleaving of the second frequency resource unit, and the second frequency resource unit belongs to the first frequency resource.

[0289] Step 1504: Send second information, wherein the second information is used to determine a fourth frequency resource element in the third frequency resource for carrying at least one third sequence, and a reference signal corresponding to the at least one third sequence is used to measure the channel on the third frequency resource.

[0290] The first frequency resource unit and the fourth frequency resource unit do not overlap in the frequency domain.

[0291] Those skilled in the art should understand that, in conjunction with the relevant description of the wireless communication method from the perspective of the first network element in the embodiments of this disclosure, the relevant description of the wireless communication method from the perspective of the second network element in the embodiments of this disclosure can be understood.

[0292] To more clearly illustrate the wireless communication method of this disclosure, the following will describe the method in detail using element-by-element interleaving and block-by-block interleaving as examples.

[0293] The following will use specific examples to illustrate the scheme disclosed herein more clearly.

[0294] First, a resource unit (RU) can be defined in the frequency domain. This RU is a set of three cases: one or more consecutive REs (subcarriers), such as... Figure 16a As shown; one or more discontinuous REs, such as Figure 16b As shown; or a combination of multiple consecutive REs and discontinuous REs, such as Figure 16c As shown.

[0295] The scheduler on the BS side can configure frequency resources according to existing schemes, for example, Figure 17 As shown. In this example, there are 16 RUs, each defining a regular comb pilot subcarrier pattern (comb16). These RUs are distinguished from each other by offset values ​​varying from 0 to 15. These 16 RUs have no overlap in the frequency domain. All 16 RUs collectively cover all available REs. For example, on symbol #7, these 16 RUs are assigned to antennas / ports 1 to 16; on symbol #8, the same 16 RUs are assigned to antennas / ports 17 to 32. The type of symbol can be OFDM or SC-FDMA, and this disclosure is not limited thereto.

[0296] The scheduler determines the second RU (a tag block of one antenna on one symbol, which includes multiple consecutive REs), for example, by placing all pilot subcarriers in consecutive blocks, such as... Figure 17 As shown, there are also 16 RUs, but the pilot signals are located at different positions in the frequency domain. The RUs do not overlap in the frequency domain, and all RUs collectively cover all available REs. Here, the resources occupied by a column of antennas on a symbol can be a specific example of the first frequency resource mentioned above. Figure 17 The label block shown (comprising multiple consecutive REs) can be a specific example of the second frequency resource unit mentioned above.

[0297] It should be noted that, Figure 17Only one possible implementation of the second RU is shown. For a single RU, the tag block can also be divided into two smaller second frequency resource units, and multiple distribution methods are possible as long as the second frequency resource units are irregularly distributed.

[0298] Next, a QPP interleaver is applied to each second RU to obtain the corresponding first RU, thereby determining a tag block on a symbol for each first RU (a column) for an antenna, until all first RUs are determined. The aforementioned second frequency resource unit can be... Figure 17 The frequency resource unit (a consecutive RE in the tag block) on the second RU (a column) mentioned above can be a frequency resource unit on the second RU (a column). Figure 17 The frequency resource units (tag blocks) are located on the first RU (column). Let the total number of REs be N. Pilot positions are defined by binary arrays, where 1 indicates the presence of a pilot and 0 indicates its absence. Such arrays can be generated for each antenna / port within the second RU. Then, QPP is applied to each of these binary arrays to obtain the interleaved pilot positions, as shown below:

[0299]

[0300] Among them, coefficient and Selected according to the rules mentioned above. It is the location of the RE included in the second RU. This refers to the position of the RE in the first RU. Then, the first RU is used to determine the reference subcarrier to be used for reference signal transmission, such as... Figure 17 As shown.

[0301] The receiver needs to obtain information about the first frequency RU or the second frequency RU from the transmitter through the control channel. and coefficients and Therefore, the receiver knows which REs correspond to which TX antennas / ports. Channel estimation can be performed using compressed sensing algorithms, including but not limited to orthogonal matched pursuit algorithms.

[0302] The quasi-random sampling pattern proposed in this disclosure can be configured by setting N frequency RUs in the frequency domain and L1 time-domain units (such as OFDM or SC-FDMA symbols) in the time domain. The first frequency RU and the second frequency RU may include K frequency RUs in the frequency domain and L2 time-domain units in the time domain. The specific values ​​of K, L1, and L2 are not limited here. Generally, K can be greater than or equal to N, and L1 can be different from L2.

[0303] Channel estimation can be performed using a wideband reference signal, such as... Figure 17 As shown; it can also be executed via frequency hopping. This will be combined with... Figures 18A to 18C Describe the frequency hopping scheme.

[0304] In this example, it is assumed that a total of 10 RBGs are used for RS transmission. Figure 18A (1) and Figure 18B In the existing scheme shown in (1), the corresponding frequency hopping scheme can be: one symbol uses one RBG, there is no gap between two adjacent RBGs, and 10 symbols are needed to perform channel estimation for one port.

[0305] Compared to existing solutions, if frequency hopping is performed using the approach disclosed herein, only 5 symbols are needed to perform channel estimation for one port, and the interval between two adjacent RBGs can be unequal. Frequency hopping can be implemented using a QPP interleaver, because a QPP interleaver (or any other interleaver) can not only perform frequency hopping as described above... Figure 17 As shown, this is used for interleaving (subcarrier-level interleaving) the RE index, and can also be done as follows: Figure 18A The lower half ( Figure 18A As shown in (2)), it is used for interleaving the resource block group index (RBG, one RB = 12 REs, one RBG = 48 REs). Figure 18A As shown in (2), the positions of the 5 RBGs are associated with the QPP interleaver. The remaining 5 symbols can be used for channel estimation at other ports. Specifically, in Figure 18A In (2), the first 5 blocks are selected for interleaving, and each selected block includes multiple REs for transmitting RS. However, as Figure 18A The upper part of the middle (such as Figure 18A As shown in (1)), in the existing scheme, all blocks must include RS (each block has a comb structure). It can be seen that when measuring the same bandwidth (using the same number of REs, i.e., N), RE When using this method, fewer blocks are used than in existing schemes.

[0306] Similarly, in Figure 18C In (2), instead of selecting the first 5 blocks, the specified 5 blocks are selected for interleaving. The specific interleaving can be performed with... Figure 18A Similar to (2) in the previous section, for the sake of brevity, it will not be repeated here.

[0307] It should be noted that the location of the frequency resource units (RUs) before interleaving is related to the type of interleaver. For example, for QPP, the RUs before interleaving consist of one or more blocks, each of which can employ a comb-like or continuous structure. For QPP, the frequency resource units before interleaving should not be regularly distributed, because using such a comb-like structure as input to QPP will result in a comb-like output, which is not beneficial to this disclosure. Furthermore, for PN sequence-based interleavers, a comb-like distribution of the original RUs at the RE stage can actually yield good results. Therefore, the choice of the RU location before interleaving usually depends on the type of interleaver.

[0308] Regarding channel estimation, for example, Figure 19A As shown, Channel estimation on each pilot subcarrier It can be used as a measurement signal ( Figure 19A The left-hand side of the formula (a row selection matrix containing only one 1 per row). It can be viewed as a measurement matrix, a DFT, or a truncated DFT matrix. It can be viewed as a dictionary, a pure channel impulse response. This can be viewed as a sparse signal to be estimated. It's important to note that the sampling pattern defines the measurement matrix. Specifically, the measurement matrix A submatrix constructed as the identity matrix. Given by A sampling pattern vector consisting of n elements, where 1 indicates the presence of a pilot and 0 indicates the absence of a pilot. If the nth element in the sampling pattern... If the nth element is equal to 1, then the nth element in the identity matrix can be selected. Yes. Any existing compressed sensing algorithm can be used to solve this equation.

[0309] One of the compressed sensing algorithms that can be used to recover CIR is the Orthogonal Matching Pursuit (OMP), which can be described as follows.

[0310] The input parameters for this algorithm include:

[0311] Channel measurement vector on pilot subcarrier ;

[0312] The row selection matrix P has only one 1 in each row and all others are 0; matrix P is determined by the sampling pattern (the position of the pilot subcarriers);

[0313] Dictionary F (usually a DFT matrix).

[0314] Stopping criteria (such as maximum number of iterations or residual norm)

[0315] The initialization steps of the algorithm are as follows: Set the residual Set the perception matrix to Selected index set Initialize to an empty set Initialize the iteration counter k to 1; initialize the sparse signal (CIR) to be estimated as a zero vector. .

[0316] If the stopping criteria are not met, proceed with the following steps.

[0317] Step 1: Calculate the residuals The dot product of the perceptual matrix A with all available columns. The indices of the available columns do not belong to the index set. Find the index of the column in A that has the largest dot product with the residual. .

[0318] Step 2: Add i to the index set middle.

[0319] Step 3: Update the estimate of the sparse signal (CIR) For sets All indexes in , will The elements are updated to the solution of the following least squares problem:

[0320]

[0321] The index is not present. In The coefficient is set to 0:

[0322]

[0323] Step 4: Use the current estimate of the sparse signal Non-zero elements and sensing matrix The selected column updates the current estimate of the signal on the left. :

[0324]

[0325] Step 5: Update the residuals as follows:

[0326]

[0327] The iteration counter increments by k = k + 1.

[0328] The stopping criterion could be, for example, the maximum number of iterations. Or the residual norm is less than a specified threshold , Provided as an input parameter.

[0329] The least squares problem in step 3 can be solved using Moore-Penrose pseudoinverse, etc.

[0330]

[0331] Given measurement matrix and dictionary The recovery properties can be described using a cross-coherence metric. To define cross-coherence, the perceptron matrix can first be constructed as follows: Mutual dependence Defined as a matrix The maximum absolute value of the normalized dot product between different columns:

[0332]

[0333] Where N is the perception matrix The total number of columns in the data. Represents the dot product. This represents the Frobenius norm.

[0334] The lower the mutual coherence, the better the recovery performance of any compressed sensing algorithm. For orthogonal sensing matrices, The minimum possible value of is 0. For Figure 19A The compressed sensing task shown, when the dictionary When the DFT matrix is ​​fixed or truncated, minimizing cross-coherence is equivalent to minimizing sidelobe levels. In this case, the... Column and number The nonnormalized dot product between columns is ,in, It is the number of pilot signals. It is the first One pilot in The position within each subcarrier. Simultaneously, the... The expression for each side lobe is: Therefore, the dot product between the i-th column and the j-th column is equal to the product between the i-th column and the Each side lobe (m=i–j) is the same, such as Figure 19B As shown.

[0335] The coherence of matrices has a theoretical lower bound. This lower bound is called the Welch bound. For a total number of subcarriers... And only For pilot signals, the lower bound of mutual coherence is as follows:

[0336]

[0337] As mentioned above, coefficient and Designed for QPP interleavers, it aims to ensure signal recovery performance, such as achieving the lowest possible cross-coherence for the corresponding sensing matrix. For example, when the factorization of the total number of subcarriers includes 2 and 3, the cross-coherence may be less than twice the Welch bound. Similarly, when the factorization of the total number of subcarriers includes 2, 3, and 5, the cross-coherence may be less than four times the Welch bound.

[0338] In summary, in order to improve the channel estimation accuracy of low-overhead schemes (especially in large-scale or ultra-large-scale MIMO systems) and thus increase the capacity of MIMO systems, this disclosure provides an interleaved quasi-random sampling pattern for signal recovery based on compressed sensing algorithms.

[0339] It should be noted that the pilot positions after QPP interleaving mentioned above can be used to enhance the carrier frequency offset estimator. The above scheme can also be applied to Wi-Fi channel estimation, or to broadcast services using OFDM modulation, such as the second-generation digital video broadcasting-Terrestrial 2 (DVB-T2) system.

[0340] The following will describe embodiments of products related to wireless communication methods.

[0341] Figure 20 A schematic diagram of the structure of a wireless communication device provided in one or more embodiments of this disclosure is shown. Figure 20 As shown, the wireless communication device 2000 may include:

[0342] The first receiving module 2002 is used to receive first information, wherein the first information is used to determine a first frequency resource unit in the first frequency resource for carrying at least one first sequence, and a reference signal corresponding to the at least one first sequence is used to measure the channel on the first frequency resource.

[0343] The first frequency resource unit in the first frequency resource is determined based on the interleaving of the second frequency resource unit, and the second frequency resource unit belongs to the first frequency resource.

[0344] In one possible implementation, at least one parameter of the aforementioned interleaving is associated with the total number of resource elements (REs) included in the first frequency resource.

[0345] In one possible implementation, the location of the second frequency resource unit is associated with the type of interleaving.

[0346] In one possible implementation, the above interleaving includes applying at least one of the following: a cubic permutation polynomial (CPP) interleaver, a quadratic permutation polynomial (QPP) interleaver, a Takeshita-Costello interleaver, a Welch-Costas interleaver, an interleaver based on a pseudo-noise (PN) sequence, or an interleaver based on a random integer sequence.

[0347] In one possible implementation, the above interleaving includes applying a QPP interleaver; the interleaving is based on a first coefficient and a second coefficient, which are used to determine the sampling pattern of all frequency resource elements in the first frequency resource.

[0348] In one possible implementation, the first coefficient and the second coefficient are used to obtain a one-to-one correspondence between the location of the second frequency resource unit and the location of the first frequency resource unit.

[0349] In one possible implementation, the first factorization of the first coefficient is represented as the product of a plurality of first integers and an interleaving factor, wherein the interleaving factor is an integer that is not divisible by any of the plurality of first integers, and each of the plurality of first integers is a prime number.

[0350] In one possible implementation, the second factor decomposition of the total number of resource elements in the first frequency resource is represented as the product of multiple first integers after each of them is raised to a power corresponding to the first integer, wherein at least one of the first powers is greater than 1; the second coefficient cannot be divided by any of the multiple first integers.

[0351] In one possible implementation, the first coefficient and the second coefficient are predefined, or the first information indicates the first coefficient and the second coefficient.

[0352] In one possible implementation, the first and second coefficients are determined based on a table.

[0353] In one possible implementation, at least one first frequency resource unit in the first frequency resource unit includes multiple resource elements; the position of the third frequency resource unit in the second frequency resource is determined based on the position of the QPP interleaver and at least one first frequency resource unit, wherein the second frequency resource and the first frequency resource are located on different symbols, and the third frequency resource unit is used to carry at least one second sequence.

[0354] In one possible implementation, the above interleaving includes applying a PN sequence-based interleaver, wherein the total number of resource elements in the first frequency resource is equal to a power of 2.

[0355] In one possible implementation, the first information also indicates a second frequency resource unit.

[0356] In one possible implementation, the first information includes a bitmap for indicating the second frequency resource unit.

[0357] In one possible implementation, at least one of the first frequency resource units includes a plurality of resource elements, or each of the first frequency resource units includes one resource element.

[0358] In one possible implementation, the above apparatus further includes: a first transmitting module for transmitting at least one first sequence on a first frequency resource.

[0359] In one possible implementation, the reference signal corresponding to at least one first sequence is a sounding reference signal (SRS) or a demodulation reference signal (DMRS).

[0360] In one possible implementation, the apparatus further includes a second receiving module 2004, configured to receive at least one first sequence on a first frequency resource, wherein the reference signal corresponding to the at least one first sequence is a channel state information reference signal (CSI-RS).

[0361] In one possible implementation, the first information is carried in at least one of the following: MAC control element (MAC CE), downlink control information (DCI), or radio resource control (RRC).

[0362] In one possible implementation, the above apparatus further includes: a third receiving module 2006, configured to receive second information, wherein the second information is used to determine a fourth frequency resource unit in the third frequency resource for carrying at least one third sequence, and a reference signal corresponding to the at least one third sequence is used to measure the channel on the third frequency resource; the first frequency resource unit and the fourth frequency resource unit do not overlap in the frequency domain.

[0363] It should be noted that the first receiving module, the second receiving module, and the third receiving module are used only to illustrate their functions; in actual applications, the functions of the first receiving module, the second receiving module, and the third receiving module can be implemented by a single receiving module, and this is not a limitation here. It should also be noted that the functions of the receiving module and the first transmitting module can also be implemented by a transceiver module.

[0364] The aforementioned wireless communication device can be applied to the first network element described in the above method embodiments, or can be the first network element described in the above method embodiments. Those skilled in the art should understand that the relevant descriptions of the above modules in the embodiments of this disclosure can be understood in conjunction with the relevant descriptions of the wireless communication methods in the embodiments of this disclosure.

[0365] Figure 21 A schematic diagram of another wireless communication device provided in one or more embodiments of this disclosure is shown. Figure 21 As shown, the wireless communication device 2100 may include:

[0366] The first transmitting module 2102 is used to transmit first information, wherein the first information is used to determine a first frequency resource unit in the first frequency resource for carrying at least one first sequence, and a reference signal corresponding to the at least one first sequence is used to measure the channel on the first frequency resource.

[0367] The first frequency resource unit in the first frequency resource is determined based on the interleaving of the second frequency resource unit, and the second frequency resource unit belongs to the first frequency resource.

[0368] In one possible implementation, at least one parameter of the aforementioned interleaving is associated with the total number of resource elements (REs) included in the first frequency resource.

[0369] In one possible implementation, the location of the second frequency resource unit is associated with the type of interleaving.

[0370] In one possible implementation, the above interleaving includes applying at least one of the following: a cubic permutation polynomial (CPP) interleaver, a quadratic permutation polynomial (QPP) interleaver, a Takeshita-Costello interleaver, a Welch-Costas interleaver, an interleaver based on a pseudo-noise (PN) sequence, or an interleaver based on a random integer sequence.

[0371] In one possible implementation, the above interleaving includes applying a QPP interleaver; the interleaving is based on a first coefficient and a second coefficient, which are used to determine the time-domain pattern of all frequency resource elements in the first frequency resource.

[0372] In one possible implementation, the first coefficient and the second coefficient are used to obtain a one-to-one correspondence between the location of the second frequency resource unit and the location of the first frequency resource unit.

[0373] In one possible implementation, the first factorization of the first coefficient is represented as the product of a plurality of first integers and an interleaving factor, wherein the interleaving factor is an integer that is not divisible by any of the plurality of first integers, and each of the plurality of first integers is a prime number.

[0374] In one possible implementation, the second factorization of the total number of resource elements in the first frequency resource is represented as the product of multiple first integers, each of which is raised to a power corresponding to a power of 1, wherein at least one of the powers is greater than 1; the second coefficient cannot be divided by any of the multiple first integers.

[0375] In one possible implementation, the first coefficient and the second coefficient are predefined, or the first information indicates the first coefficient and the second coefficient.

[0376] In one possible implementation, the first and second coefficients are determined based on a table.

[0377] In one possible implementation, at least one first frequency resource unit in the first frequency resource unit includes multiple resource elements; the position of the third frequency resource unit in the second frequency resource is determined based on the position of the QPP interleaver and at least one first frequency resource unit, wherein the second frequency resource and the first frequency resource are located on different symbols, and the third frequency resource unit is used to carry at least one second sequence.

[0378] In one possible implementation, the above interleaving includes applying a PN sequence-based interleaver, wherein the total number of resource elements in the first frequency resource is equal to a power of 2.

[0379] In one possible implementation, the first information also indicates a second frequency resource unit.

[0380] In one possible implementation, the first information includes a bitmap for indicating the second frequency resource unit.

[0381] In one possible implementation, at least one of the first frequency resource units includes a plurality of resource elements, or each of the first frequency resource units includes one resource element.

[0382] In one possible implementation, the above apparatus further includes: a first receiving module for receiving at least one first sequence on a first frequency resource.

[0383] In one possible implementation, the reference signal corresponding to at least one first sequence is a sounding reference signal (SRS) or a demodulation reference signal (DMRS).

[0384] In one possible implementation, the above apparatus further includes: a second transmitting module 2104, configured to transmit at least one first sequence on a first frequency resource, wherein the reference signal corresponding to the at least one first sequence is a channel state information reference signal (CSI-RS).

[0385] In one possible implementation, the first information is carried in at least one of the following: MAC control element (MAC CE), downlink control information (DCI), or radio resource control (RRC).

[0386] In one possible implementation, the above apparatus further includes: a third transmitting module 2106, configured to transmit second information, wherein the second information is used to determine a fourth frequency resource unit in the third frequency resource for carrying at least one third sequence, and a reference signal corresponding to the at least one third sequence is used to measure the channel on the third frequency resource; the first frequency resource unit and the fourth frequency resource unit do not overlap in the frequency domain.

[0387] It should be noted that the first, second, and third sending modules are used only to illustrate their functions; in actual applications, the functions of the first, second, and third sending modules can be implemented by a single sending module, and this is not a limitation here. It should also be noted that the functions of the sending module and the first receiving module can also be implemented by a transceiver module.

[0388] The aforementioned wireless communication device can be applied to the second network element described in the above method embodiments, or can be the second network element described in the above method embodiments. Those skilled in the art should understand that the relevant descriptions of the above modules in the embodiments of this disclosure can be understood in conjunction with the relevant descriptions of the wireless communication methods in the embodiments of this disclosure.

[0389] Figure 22This is a schematic diagram of the structure of a wireless communication device provided in one or more embodiments of this disclosure. The device may be a second network element or a first network element. Figure 22 As shown, the wireless communication device 2200 includes a processor 2202, an interface 2204 for communicating with other devices, and a memory 2206. The memory 2206 may store computer execution instructions, and the processor 2202 executes the computer execution instructions stored in the memory 2206 to enable the device to perform any of the aforementioned wireless communication methods.

[0390] In some aspects of this disclosure, a first network element is provided, including processing circuitry for performing any of the above-described wireless communication methods. It should be understood that the first network element is capable of performing the steps executed by the first network element in the above method embodiments, which will not be elaborated further here.

[0391] In some aspects of this disclosure, a second network element is provided, including processing circuitry for performing any of the above-described wireless communication methods. It should be understood that the second network element is capable of performing the steps executed by the second network element in the above method embodiments, which will not be elaborated further here.

[0392] In some aspects of this disclosure, a wireless communication device is provided, including a processor and a memory. The memory stores instructions that cause the processor to perform any of the aforementioned wireless communication methods.

[0393] In some aspects of this disclosure, a wireless communication system is provided, including a second network element and a first network element. The second network element is used to perform the steps performed by the second network element in any of the above-described wireless communication methods, and the first network element is used to perform the steps performed by the first network element in any of the above-described wireless communication methods.

[0394] In some aspects of this disclosure, a chip is provided, including an input / output (I / O) interface and a processor, wherein the processor is configured to invoke and execute computer execution instructions stored in memory to enable a device equipped with the chip to perform any of the aforementioned wireless communication methods.

[0395] In some aspects of this disclosure, a computer-readable medium is provided that stores computer-executable instructions, wherein, when executed by a processor, the processor causes the processor to perform any of the aforementioned wireless communication methods.

[0396] In some aspects of this disclosure, a computer program product including computer-executable instructions is provided, wherein, when executed by a processor, the computer-executable instructions cause the processor to perform any of the aforementioned wireless communication methods.

[0397] Although this disclosure describes methods and processes by way of steps performed in a certain order, one or more steps in the methods and processes may be omitted or modified as appropriate. Where appropriate, one or more steps may be performed in an order other than that described.

[0398] It is important to note that the expression "at least one of A or B" used in this document is interchangeable with the expression "A and / or B". This expression refers to a list in which A or B or A and B can be selected. Similarly, the expression "at least one of A, B, or C" used in this document is interchangeable with "A and / or B and / or C" or "A, B, and / or C". This expression refers to a list in which the following can be selected: A or B or C, or A and B, or A and C, or B and C, or all of A, B, and C. The same principle applies to longer lists with the same format.

[0399] While this disclosure describes at least part of the methodological aspects, those skilled in the art will understand that this disclosure also relates to various components, whether hardware components, software, or any combination thereof, for performing at least some aspects and features of the methods. Accordingly, the technical solutions of this disclosure can be embodied in the form of a software product. Suitable software products can be stored in pre-recorded storage devices or other similar non-volatile or non-transitory computer-readable media, including DVDs, CD-ROMs, USB flash drives, removable hard drives, or other storage media. The software product includes instructions tangibly stored thereon that cause a processing device (e.g., a personal computer, server, or network device) to perform examples of the methods disclosed herein. Machine-executable instructions can be in the form of sequences of code, configuration information, or other data that, when executed, cause a machine (e.g., a processor or other processing device) to perform the steps in the methods provided in the examples of this disclosure.

[0400] This disclosure may be implemented in other specific forms without departing from the subject matter of the claims. The exemplary embodiments described are illustrative in all respects and not restrictive. Features selected from one or more of the foregoing embodiments may be combined to create alternative embodiments not explicitly described, and features suitable for such combinations will be understood within the scope of this disclosure.

[0401] All values ​​and subranges within the scope of the disclosure are also disclosed. Furthermore, while the systems, devices, and processes disclosed and shown herein may include a specific number of elements / components, the systems, devices, and components may be modified to include more or fewer such elements / components. For example, while any element / component disclosed may be referenced as a single quantity, embodiments disclosed herein may be modified to include multiple such elements / components. The subject matter described herein is intended to cover and encompass all appropriate technical changes.

[0402] Although embodiments have been described above with reference to the accompanying drawings, those skilled in the art will understand that variations and modifications can be made without departing from the scope defined by the appended claims.

Claims

1. A wireless communication method, characterized in that, include: Receive first information, wherein the first information is used to determine a first frequency resource element in a first frequency resource for carrying at least one first sequence, and a reference signal corresponding to the at least one first sequence is used to measure the channel on the first frequency resource; The first frequency resource unit in the first frequency resource is determined based on the interleaving of the second frequency resource unit, and the second frequency resource unit belongs to the first frequency resource.

2. The method according to claim 1, characterized in that, At least one parameter of the interleaving is associated with the total number of resource elements (REs) included in the first frequency resource.

3. The method according to claim 1 or 2, characterized in that, The location of the second frequency resource unit is associated with the type of interleaving.

4. The method according to any one of claims 1 to 3, characterized in that, The interleaving includes the application of at least one of the following: a cubic permutation polynomial (CPP) interleaver, a quadratic permutation polynomial (QPP) interleaver, a Takeshita-Costello interleaver, a Welch-Costas interleaver, an interleaver based on a pseudo-noise PN sequence, or an interleaver based on a random integer sequence.

5. The method according to claim 4, characterized in that, The interleaving includes applying the QPP interleaving device; The interleaving is based on a first coefficient and a second coefficient, which are used to determine the sampling pattern of all frequency resource units in the first frequency resource.

6. The method according to claim 5, characterized in that, The first coefficient and the second coefficient are used to obtain a one-to-one correspondence between the location of the second frequency resource unit and the location of the first frequency resource unit.

7. The method according to claim 5 or 6, characterized in that, The first factorization of the first coefficient is expressed as the product of a plurality of first integers and an interleaving factor, wherein the interleaving factor is an integer that cannot be divided by any of the plurality of first integers, and each of the plurality of first integers is a prime number.

8. The method according to claim 7, characterized in that, The second factor decomposition of the total number of resource elements in the first frequency resource is represented as the product of each term obtained by taking the first power corresponding to the first integer, wherein at least one of the first powers is greater than 1; The second coefficient cannot be divided by any of the plurality of first integers.

9. The method according to any one of claims 6 to 8, characterized in that, The first coefficient and the second coefficient are predefined, or The first information indicates the first coefficient and the second coefficient.

10. The method according to claim 9, characterized in that, The first and second coefficients were determined based on a table.

11. The method according to any one of claims 5 to 10, characterized in that, At least one of the first frequency resource units includes multiple resource elements; The position of the third frequency resource unit in the second frequency resource is determined based on the positions of the QPP interleaver and the at least one first frequency resource unit, wherein the second frequency resource and the first frequency resource are located on different symbols, and the third frequency resource unit is used to carry at least one second sequence.

12. The method according to claim 4, characterized in that, The interleaving includes applying the interleaving based on the PN sequence, wherein the total number of resource elements in the first frequency resource is equal to a power of 2.

13. The method according to any one of claims 1 to 12, characterized in that, The first information also indicates the second frequency resource unit.

14. The method according to claim 13, characterized in that, The first information includes a bitmap for indicating the second frequency resource unit.

15. The method according to any one of claims 1 to 14, characterized in that, At least one of the first frequency resource units includes multiple resource elements, or Each of the first frequency resource units includes a resource element.

16. The method according to any one of claims 1 to 15, characterized in that, Also includes: Transmit the at least one first sequence on the first frequency resource.

17. The method according to claim 16, characterized in that, The reference signal corresponding to the at least one first sequence is a probe reference signal SRS or a demodulation reference signal DMRS.

18. The method according to any one of claims 1 to 15, characterized in that, Also includes: The at least one first sequence is received on the first frequency resource, wherein the reference signal corresponding to the at least one first sequence is a channel state information reference signal (CSI-RS).

19. The method according to any one of claims 1 to 18, characterized in that, The first information is carried in at least one of the following: MAC control element MAC CE, downlink control information DCI, or radio resource control RRC.

20. The method according to any one of claims 1 to 19, characterized in that, Also includes: Receive second information, wherein the second information is used to determine a fourth frequency resource element in a third frequency resource for carrying at least one third sequence, and a reference signal corresponding to the at least one third sequence is used to measure the channel on the third frequency resource; The first frequency resource unit and the fourth frequency resource unit do not overlap in the frequency domain.

21. A wireless communication method, characterized in that, include: Send first information, wherein the first information is used to determine a first frequency resource element in a first frequency resource for carrying at least one first sequence, and a reference signal corresponding to the at least one first sequence is used to measure the channel on the first frequency resource; The first frequency resource unit in the first frequency resource is determined based on the interleaving of the second frequency resource unit, and the second frequency resource unit belongs to the first frequency resource.

22. The method according to claim 21, characterized in that, At least one parameter of the interleaving is associated with the total number of resource elements (REs) included in the first frequency resource.

23. The method according to claim 21 or 22, characterized in that, The location of the second frequency resource unit is associated with the type of interleaving.

24. The method according to any one of claims 21 to 23, characterized in that, The interleaving includes the application of at least one of the following: a cubic permutation polynomial (CPP) interleaver, a quadratic permutation polynomial (QPP) interleaver, a Takeshita-Costello interleaver, a Welch-Costas interleaver, an interleaver based on a pseudo-noise PN sequence, or an interleaver based on a random integer sequence.

25. The method according to claim 24, characterized in that, The interleaving includes applying the QPP interleaving device; The interleaving is based on a first coefficient and a second coefficient, which are used to determine the time-domain pattern of all frequency resource units in the first frequency resource.

26. The method according to claim 25, characterized in that, The first coefficient and the second coefficient are used to obtain a one-to-one correspondence between the location of the second frequency resource unit and the location of the first frequency resource unit.

27. The method according to claim 25 or 26, characterized in that, The first factorization of the first coefficient is expressed as the product of a plurality of first integers and an interleaving factor, wherein the interleaving factor is an integer that cannot be divided by any of the plurality of first integers, and each of the plurality of first integers is a prime number.

28. The method according to claim 27, characterized in that, The second factor decomposition of the total number of resource elements in the first frequency resource is represented as the product of each term obtained by taking the first power corresponding to the first integer, wherein at least one of the first powers is greater than 1; The second coefficient cannot be divided by any of the plurality of first integers.

29. The method according to any one of claims 26 to 28, characterized in that, The first coefficient and the second coefficient are predefined, or The first information indicates the first coefficient and the second coefficient.

30. The method according to claim 29, characterized in that, The first and second coefficients were determined based on a table.

31. The method according to any one of claims 25 to 30, characterized in that, At least one of the first frequency resource units includes multiple resource elements; The position of the third frequency resource unit in the second frequency resource is determined based on the positions of the QPP interleaver and the at least one first frequency resource unit, wherein the second frequency resource and the first frequency resource are located on different symbols, and the third frequency resource unit is used to carry at least one second sequence.

32. The method according to claim 24, characterized in that, The interleaving includes applying the interleaving based on the PN sequence, wherein the total number of resource elements in the first frequency resource is equal to a power of 2.

33. The method according to any one of claims 21 to 32, characterized in that, The first information also indicates the second frequency resource unit.

34. The method according to claim 33, characterized in that, The first information includes a bitmap for indicating the second frequency resource unit.

35. The method according to any one of claims 21 to 34, characterized in that, At least one of the first frequency resource units includes multiple resource elements, or Each of the first frequency resource units includes a resource element.

36. The method according to any one of claims 21 to 35, characterized in that, Also includes: Receive the at least one first sequence on the first frequency resource.

37. The method according to claim 36, characterized in that, The reference signal corresponding to the at least one first sequence is a probe reference signal SRS or a demodulation reference signal DMRS.

38. The method according to any one of claims 21 to 35, characterized in that, Also includes: The at least one first sequence is transmitted on the first frequency resource, wherein the reference signal corresponding to the at least one first sequence is a channel state information reference signal (CSI-RS).

39. The method according to any one of claims 21 to 38, characterized in that, The first information is carried in at least one of the following: MAC control element MAC CE, downlink control information DCI, or radio resource control RRC.

40. The method according to any one of claims 21 to 39, characterized in that, Also includes: Send a second message, wherein the second message is used to determine a fourth frequency resource element in the third frequency resource for carrying at least one third sequence, and a reference signal corresponding to the at least one third sequence is used to measure the channel on the third frequency resource; The first frequency resource unit and the fourth frequency resource unit do not overlap in the frequency domain.

41. A wireless communication device, characterized in that, Includes a module for performing the method according to any one of claims 1 to 20.

42. A wireless communication device, characterized in that, Includes a module for performing the method according to any one of claims 21 to 40.

43. A computer-readable medium, characterized in that, The storage includes computer execution instructions that, when executed by a processor, cause the processor to perform the method according to any one of claims 1 to 20 or the method according to any one of claims 21 to 40.

44. A computer program product, characterized in that, Includes computer execution instructions, which, when executed by a processor, cause the processor to perform the method according to any one of claims 1 to 20 or the method according to any one of claims 21 to 40.

45. A chip, characterized in that, It includes an input / output I / O interface and a processor, wherein the processor is configured to invoke and execute computer execution instructions stored in memory to cause a device on which the chip is mounted to perform the method according to any one of claims 1 to 20 or the method according to any one of claims 21 to 40.

Images