Method of terminal device, and terminal device
By optimizing the UCI transmission process, using partial code books and adjusting the code books structure, the problem of large UCI transmission overhead in NR communication is solved, and efficient resource utilization is achieved.
Patent Information
- Application Number
- JP2024190298
- Authority / Receiving Office
- JP · JP
- Patent Type
- Applications
- Current Assignee / Owner
- Filing Date
- 2024-10-30
- Publication Date
- 2025-01-28
AI Technical Summary
In the new radio (NR) communication standard, the transmission of Uplink Control Information (UCI) has a large overhead, especially in multi-input and multi-output (MIMO) systems, channel state information (CSI) reporting of broadband subbands and different beams leads to excessive overhead problems in UCI transmission.
By using code books divided into first and second parts between the terminal device and the network device, the enhanced Type II code books based on spatial domain (SD) and frequency domain (FD) are determined, and the UCI transmission process is optimized, including adjustment and compression of the code books, reducing unnecessary coefficient reports.
It effectively reduces the overhead of UCI transmission, improves resource utilization efficiency, and ensures effective communication under limited resource conditions.
Smart Images

Figure 2025014030000001_ABST
Abstract
Description
[Technical field]
[0001] FIELD OF THE DISCLOSURE Embodiments of the present disclosure relate generally to the field of communications, and more particularly, to methods, devices, and computer-readable media for Uplink Control Information (UCI) transmission. [Background technology]
[0002] Several communication technologies are being developed to provide common protocols that enable various wireless devices to communicate at local, national, regional and global levels. An example of a new communication standard is New Radio (NR), e.g., 5G radio access. NR is an extension set of the Long Term Evolution (LTE) mobile standard published by the Third Generation Partnership Project (3GPP). This standard is designed to better support mobile broadband Internet access by improving spectral efficiency, reducing costs, improving services, utilizing new spectrum, using OFDMA with cyclic prefix (CP) in the downlink (DL) and uplink (UL), and by supporting beamforming, multiple input multiple output (MIMO) antenna technology and carrier aggregation, and by integrating with other open standards.
[0003] In a communication system, a receiving terminal device typically estimates the channel state information (CSI) of the communication channel between the terminal device and the network device and feeds it back to the network device so that the network device can control its transmission based on the current channel conditions indicated in the CSI. According to the NR technology, it is proposed to report the channel characteristics of the wideband subbands and different beams (in MIMO systems) in UCI, but this leads to a large overhead of transmitting UCI including CSI. Summary of the Invention [Problem to be solved by the invention]
[0004] Exemplary embodiments of the present disclosure generally provide a method, device, and computer-readable medium for UCI transmission. [Means for solving the problem]
[0005] In a first aspect, a method for communication is provided. The method includes: determining, in a terminal device, a first portion of a first codebook and a second portion of a second codebook, determining a bit string based on the first and second portions, and transmitting uplink control information including the bit string to a network device. The first and second portions indicate presence or absence of gain for a plurality of pairs of spatial domain (SD) base and frequency domain (FD) base. The first and second codebooks are used in different transmission layers between the terminal device and the network device. Each bit of the bit string corresponds to one SD-based-FD-based pair among the plurality of pairs of SD-based and FD-based.
[0006] In a second aspect, a method for communication is provided. The method includes: receiving, in a network device, uplink control information from a terminal device, the uplink control information including a bit string; and determining, based on the bit string, a first part of a first codebook and a second part of a second codebook. Each bit of the bit string corresponds to a spatial domain (SD)-frequency domain (FD)-based pair among a plurality of SD-based and FD-based pairs. The first part and the second part indicate the presence or absence of gain for the plurality of SD-based and FD-based pairs. The first codebook and the second codebook are used in different transmission layers between the terminal device and the network device.
[0007] In a third aspect, a method for communication is provided. The method includes: determining, at a terminal device, an intermediate set of Frequency Domain (FD) bases for at least one transmission layer from an ordered set of FD bases; determining an indication indicating the intermediate set of FD bases based on a number of FD bases in the ordered set and a number of FD bases in the intermediate set; and transmitting uplink control information including the indication to a network device. The at least one transmission layer is configured to be used for communication between the terminal device and the network device. A first FD base in the ordered set of FD bases is included in the intermediate set.
[0008] In a fourth aspect, a method for communication is provided, comprising: receiving, at a network device, uplink control information from a terminal device, the uplink control information including an indication indicating an intermediate set of Frequency Domain (FD) bases determined by the terminal device from an ordered set of FD bases; and determining an intermediate set of FD bases for at least one transmission layer based on the indication, a number of FD bases in the ordered set, and a number of FD bases in the intermediate set. A first FD base in the ordered set of FD bases is included in the intermediate set. The at least one transmission layer is configured to be used for communication between the terminal device and the network device.
[0009] In a fifth aspect, a method for communication is provided, comprising: obtaining, in a terminal device, a power threshold for a beam configured to be used for communication between the terminal device and a network device, determining a power indication corresponding to the power threshold based on a plurality of amplitude coefficients in a frequency domain of the beam, and determining values for the plurality of amplitude coefficients such that a power determined based on the power indication is below the power threshold.
[0010] In a sixth aspect there is provided a terminal device comprising a processor and a memory coupled to the processor and having instructions stored thereon which, when executed by the processor, cause the terminal device to perform a method according to the first aspect.
[0011] In a seventh aspect there is provided a network device comprising a processor and a memory coupled to the processor and having instructions stored thereon which, when executed by the processor, cause the network device to perform a method according to the second aspect.
[0012] In an eighth aspect there is provided a terminal device comprising a processor and a memory coupled to the processor and having instructions stored thereon which, when executed by the processor, cause the terminal device to perform a method according to the third aspect.
[0013] In a ninth aspect there is provided a network device comprising a processor and a memory, coupled to the processor, on which instructions are stored, which when executed by the processor cause the network device to perform a method according to the fourth aspect.
[0014] In a tenth aspect there is provided a terminal device comprising a processor and a memory coupled to the processor and having instructions stored thereon which, when executed by the processor, cause the terminal device to perform a method according to the fifth aspect.
[0015] In an eleventh aspect, there is provided a computer readable medium having stored thereon instructions which, when executed on at least one processor, cause the at least one processor to perform a method according to the first aspect.
[0016] In a twelfth aspect, there is provided a computer readable medium having stored thereon instructions which, when executed on at least one processor, cause the at least one processor to perform a method according to the second aspect.
[0017] In a thirteenth aspect, there is provided a computer readable medium having stored thereon instructions which, when executed on at least one processor, cause the at least one processor to perform a method according to the third aspect.
[0018] In a fourteenth aspect, there is provided a computer readable medium having stored thereon instructions which, when executed on at least one processor, cause the at least one processor to perform a method according to the fourth aspect.
[0019] In a fifteenth aspect, there is provided a computer readable medium having stored thereon instructions which, when executed on at least one processor, cause the at least one processor to perform a method according to the fifth aspect.
[0020] Other features of the present disclosure will become readily apparent from the following description. [Brief description of the drawings]
[0021] Hereinafter, several embodiments of the present disclosure will be described in more detail in the drawings, so that the above and other objects, features, and advantages of the present disclosure will become more apparent.
[0022] [Figure 1] FIG. 1 illustrates a schematic diagram of a communication environment in which embodiments of some aspects of the present disclosure may be implemented.
[0023] [Diagram 2] FIG. 1 is a schematic diagram of a process of UCI transmission according to some embodiments of the present disclosure.
[0024] [Figure 3A] 1 shows a schematic diagram of a matrix adjustment according to some embodiments of the present disclosure.
[0025] [Figure 3B] 1 shows a schematic diagram of the technical effect of some embodiments of the present disclosure;
[0026] [Figure 3C] 1 shows a schematic diagram of a matrix adjustment according to some embodiments of the present disclosure.
[0027] [Figure 4A] 1 shows a schematic diagram of bitmap generation according to some embodiments of the present disclosure.
[0028] [Figure 4B] 1 shows a schematic diagram of bitmap generation according to some embodiments of the present disclosure.
[0029] [Diagram 5] FIG. 1 illustrates a schematic diagram of a process for displaying an FD-based intermediate set in accordance with some embodiments of the present disclosure.
[0030] [Figure 6] FIG. 1 shows a schematic diagram of FD-based selection according to some embodiments of the present disclosure.
[0031] [Figure 7] FIG. 1 shows a schematic diagram of a starting point according to some embodiments of the present disclosure.
[0032] [Figure 8] 1 shows a flowchart of an exemplary method according to some embodiments of the present disclosure.
[0033] [Figure 9] 1 shows a flowchart of an exemplary method according to some embodiments of the present disclosure.
[0034] [Figure 10] 1 shows a flowchart of an exemplary method according to some embodiments of the present disclosure.
[0035] [Figure 11] 1 shows a flowchart of an exemplary method according to some embodiments of the present disclosure.
[0036] [Figure 12] 1 shows a flowchart of an exemplary method according to some embodiments of the present disclosure.
[0037] [Figure 13] FIG. 1 is a schematic block diagram of a device suitable for implementing embodiments of the present disclosure.
[0038] In all figures, the same or similar reference numbers indicate the same or similar elements. DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS
[0039] The principles of the present disclosure will now be described with reference to some exemplary embodiments. It should be understood that these embodiments are merely described for illustrative purposes, to assist those skilled in the art in understanding and implementing the present disclosure, and do not imply any limitations on the scope of the present disclosure. The disclosure described herein can be implemented in various ways other than those described below.
[0040] In the following description and claims, unless otherwise defined, all technical and scientific terms used herein have the same meaning as commonly understood by one of ordinary skill in the art to which this disclosure belongs.
[0041] The term "network device" or "base station" (BS) used in the text refers to a device (equipment, equipment) capable of providing or hosting a cell or coverage in which a terminal device can communicate. Examples of network devices include, but are not limited to, a Node B (Node B or NB), an evolved Node B (eNode B or eNB), a Node B in new radio access (gNB), a remote radio unit (RRU), a radio head (RH), a remote radio head (RRH), a low power node such as a femto node or a pico node, etc. For the purpose of discussion, the following text will describe some embodiments with reference to a gNB as an example of a network device.
[0042] The term "terminal device" as used herein refers to any device capable of wireless or wired communication. Examples of terminal devices include, but are not limited to, user equipment (UE), personal computers, desktop computers, mobile phones, cellular phones, smart phones, personal digital assistants (PDAs), portable computers, image capture devices such as digital cameras, gaming devices, music storage and playback devices, or Internet devices supporting wireless or wired Internet access and browsing.
[0043] When used in the text, the singular forms "a", "one", and "the" are meant to include the plural forms unless the text clearly indicates otherwise. The term "comprises" and variations thereof should be interpreted as open terms meaning "including, but not limited to." The term "based on" should be interpreted as "based at least in part on." The terms "one embodiment" and "embodiment" should be interpreted as "at least one embodiment." The term "another embodiment" should be interpreted as "at least one other embodiment." The terms "first", "second", etc. can refer to different or the same object. Other definitions may be included in the following description, both explicitly and implicitly.
[0044] In some instances, values, programs or devices are referred to as "optimum," "lowest," "highest," "minimum," "maximum," etc. It should be understood that such descriptions are intended to indicate choices that may be made from among multiple functional alternatives that are used, and that such choices are not necessarily better, lesser, higher, or otherwise more preferred than other choices.
[0045] In NR Release 15, a codebook defined for transmission using one beam is called a Type I codebook. A terminal device reports CSI for one beam. Subband parameters are also reported. If the available resources are not enough to transmit the CSI, the terminal device can discard some CSI according to the subband. For example, parameters for even subbands can be discarded first.
[0046] Recently, NR requires terminal devices to report CSI for multiple beams (e.g., L beams), and the corresponding codebook is called Type II codebook. The codebook is enhanced by frequency domain compression. Unlike Type I codebook, there are no subband parameters based on the enhanced Type II codebook. Therefore, it is necessary to handle UCI transmission for the enhanced type II codebook, including omitting overhead and compression used for CSI reporting.
[0047] To solve the above problems and one or more other potential problems, an embodiment of the present disclosure provides a solution for UCI transmission. Hereinafter, the principle and implementation of the present disclosure will be described in detail with reference to FIGS.
[0048] 1 illustrates an exemplary communication network 100 in which the present disclosure may be implemented. The network 100 includes a network device 110 and a terminal device 120 that receives service from the network device 110. The service area of the network device 110 is referred to as a cell 102. As can be appreciated, the number of network devices and terminal devices is for illustrative purposes only and does not imply any limitation. The network 100 may include any number of network devices and terminal devices suitable for implementing the present disclosure. Although not illustrated, it should be understood that one or more terminal devices may be located within the cell 102 and may receive service from the network device 110.
[0049] In the communication network 100, the network device 110 may transmit data and control information to the terminal device 120, and the terminal device 120 may also transmit data and control information to the network device 110. The link from the network device 110 to the terminal device 120 is called the downlink (DL) or forward link, while the link from the terminal device 120 to the network device 110 is called the uplink (UL) or reverse link.
[0050] Depending on the communication technology, the network 100 may be a Code Division Multiple Access (CDMA) network, a Time Division Multiple Access (TDMA) network, a Frequency Division Multiple Access (FDMA) network, an Orthogonal Frequency-Division Multiple Access (OFDMA) network, a Single Carrier-Frequency Division Multiple Access (SC-FDMA) network, or any other network. The communications discussed with respect to the network 100 may conform to any suitable standard, including, but not limited to, New Radio Access (NR), Long Term Evolution (LTE), LTE Evolution, LTE-Advanced (LTE-A), Wideband Code Division Multiple Access (WCDMA), Code Division Multiple Access (CDMA), cdma2000, Global System for Mobile Communications (GSM), and the like. Also, communications may be performed based on any generation of communication protocols now known or developed in the future. Examples of communication protocols include, but are not limited to, first generation (1G), second generation (2G), 2.5G, 2.75G, third generation (3G), fourth generation (4G), 4.5G, and fifth generation (5G) communication protocols. The techniques described herein may be used in the wireless networks and radio technologies mentioned above as well as other wireless networks and radio technologies. For clarity, some aspects of these technologies are described below with respect to LTE, and LTE technical terminology is used in most of the following description.
[0051] During communication, the terminal device 120 is configured to estimate and report CSI of a communication channel between the terminal device 120 and the network device 110. The CSI can be determined by the terminal device 120 using a downlink reference signal transmitted from the network device 110. After performing channel estimation between the network device 110 and the terminal device 120 in a predetermined frequency range for multiple beams with different spatial orientations, the terminal device 120 can determine the CSI to be reported to the network device 110. The CSI report is transmitted using uplink resources as part of the UCI, for example, included in an uplink data channel (e.g., a physical uplink shared channel (PUSCH)).
[0052] To better understand the exemplary embodiments of the present disclosure, the enhanced type II codebook will be described first. The transmission layers used in the text can also be referred to as layers for brevity, for example, layer 1, layer 2, layer 3 and layer 4. The space-frequency matrix W of layer r can be expressed as the following equation (1):
number
[0053] When the R layer is indicated by the terminal device 120, equation (1) can be expressed as follows:
number
[0054] Layer common W 1 can be expressed as follows:
number
[0055] SD base {v l} l=0 L-1 The choice of is common to every layer r. For example, N 1 N 2 From a set of ×1 orthogonal discrete Fourier transform (DFT) vectors, L SD bases can be selected. 1 O 2 There can be groups, and the oversampling factor can be used to scale all O 1 O 2 One group can be selected from the groups.
[0056] Layer specific W f (r) can be expressed as follows:
number
[0057] FD base {f km (r)} m=0 Mr-1 The choice of is specific to each layer r. For example, M r The FD base is N3 × 1 orthogonal DFT vectors can be selected from the index k i is 1≦k i ≦N 3 , i=0,···,M r Applies to -1.
[0058] Coefficient matrix W ~ 2 (r) can be expressed as follows:
number
[0059] As part of the codebook of layer r, (r) has dimensions 2L×M r The 2LM of the CSI report can be expressed as r It can be shown by a bitmap of E (r) Each element of is SD-based v l and FD base f km (r) For example, an element with value "1" corresponds to a pair of SD-based v l and FD base f km , may indicate the presence of gain for a pair of amplitude and phase coefficients (which may be collectively referred to as non-zero coefficients) to be reported to the network device 110. For example, elements with a value of "0" may indicate the presence of gain for a pair of amplitude and phase coefficients (which may collectively be referred to as non-zero coefficients) to be reported to the network device 110. l and FD base f km It can be shown that there is no gain for pairs of
[0060] After receiving the CSI report, the network device (r) E for different layers so that (r) It is necessary to define how to report in the bitmap. Also, if some non-zero coefficients need to be discarded from the UCI, the terminal device 120 can discard the non-zero coefficients based on the position of the corresponding bit in the bitmap, and the network device 110 can know which SD-based-FD-based pair (which pairs) the non-zero coefficients of have been discarded.
[0061] FIG. 2 is a schematic diagram illustrating a process 200 for UCI transmission according to some embodiments of the present disclosure. For purposes of discussion, the process 200 is described with reference to FIG. 1. The terminal device 120 determines (205) a first portion of a first codebook and a second portion of a second codebook. The first and second portions indicate the presence or absence of gain for a number of pairs of SD and FD bases. The first and second codebooks are used at different transmission layers between the terminal device 120 and the network device 110.
[0062] For example, after estimating the channel state, the terminal device 120 may calculate E (r) For example, E for layer 1 can be determined. (1) ,E for Layer 2 (2) ,E for Layer 3 (3) Etc. can be determined. (1) can also be referred to as the first part, and E (2) can also be referred to as the second part, and so on. (r) An element of can be represented as (r, l, f), where r represents the index of the corresponding layer, l represents the SD base corresponding to the element, and f represents the FD base corresponding to the element.
[0063] E (r) If E is structured as a matrix, then l and f correspond to the row and column indices of the elements, respectively. (r) The elements of can take on values of "0" or "1", and each "1"-valued element can correspond to the gain for the corresponding SD-based and FD-based pair, i.e., the pair of amplitude and phase coefficients expected to be reported to the network device 110.
[0064] The terminal device 120 then determines a bit sequence based on the first and second parts (210). Each bit of the bit sequence corresponds to one SD-based and FD-based pair among a plurality of SD-based and FD-based pairs. For example, the terminal device 120 may determine an E (r) In the case of two layers, the terminal device 120 may generate a bitmap based on the first part E (1) and the second part E (2) Based on this, a bit string can be generated.
[0065] In some demonstrative embodiments, the bit sequence may be determined directly based on the first and second portions (and possibly further portions) initially determined by terminal device 120. For example, terminal device 120 may interleave the first portion of the first element and the second portion of the second element and generate the bit sequence based on the interleaved first and second elements.
[0066] In some demonstrative embodiments, terminal device 120 may first adjust the first and second parts and generate a bit string based on the adjusted first and second parts. When the first part is a first matrix and the second part is a second matrix, terminal device 120 may adjust or convert the matrices. For example, terminal device 120 may first adjust columns of the first matrix and columns of the second matrix and generate a bit string based on the adjusted first matrix and the adjusted second matrix.
[0067] Next, an example of how to generate a bit string will be described in detail with reference to FIGS. 3A to 3C and 4A to 4B. Before generating a bit string, first, (r) In some embodiments, E for a column can be adjusted. (r) This can be adjusted or converted to correspond to an FD-based index. (r) The columns can be adjusted in several ways.
[0068] In some exemplary embodiments, the columns between the first column and the original last column are denoted by E (r) That is, an FD-based index with a moderate value can be (r) For example, a particular column that has a certain interval with respect to the first or last column can be shifted to the last column first. That is, "0" or "M r FD-based indexes with specific values other than "-1" are (r) can be placed in the last column of
[0069] Reference is now made to FIG. 3A, which illustrates a schematic diagram 300. The schematic diagram 300 illustrates the adjustment of a matrix 310 according to some embodiments of the present disclosure. The matrix 310 is the E (r) FIG. 3A is an example of (r) Specific examples of the adjustment or conversion of the following are given, but are not intended to be limiting in any way.
[0070] For example, if the column index is ceil(M r The middle column, whose index is ceil(M / 2), can be shifted to the last column. Then, the columns adjacent to the middle column can be shifted. For example, if the column index is ceil(M r / 2)+1 can be shifted to the second last column. r The column where 0x1 / 2)-1 can be shifted to the third column from the back, and so on.
[0071] 3A, matrix 310 has five columns 301-305. After adjustment, matrix 320 has column 303 as the last column, column 304 as the second to last column, and column 302 as the third to last column. In this exemplary embodiment, the position of first column 301 does not need to be changed.
[0072] In the case of strongest coefficient indices, the amplitude coefficient(s) corresponding to the non-zero elements in the middle columns may be smaller than the amplitude coefficient(s) corresponding to the non-zero elements in the end columns. In this way, when a pair of non-zero coefficients needs to be discarded, the amplitude coefficient with the smallest value can be discarded first. See further below.
[0073] FIG. 3B shows a schematic diagram 350, which illustrates the technical effect of this exemplary embodiment. It illustrates the relationship between gain (weight) and FD-based index for a channel before (corresponding to line 345 shown in FIG. 3B) and after (corresponding to line 340 shown in FIG. 3B) the strongest coefficient is aligned with the first column. When the strongest coefficient is aligned with the first column, the gains corresponding to the first few FD-based indexes and the last few FD-based indexes are large, and the gains corresponding to other FD-based indexes are small. By shifting the FD-based indexes with moderate values to the last column, the corresponding small gains can be discarded first, and thus the large gains corresponding to the first few and the last few FD-based indexes can be avoided from being discarded before adjustment.
[0074] Reference is now made to FIG. 3C, which illustrates a schematic diagram 360. The schematic diagram 360 illustrates an adjustment of the matrix 310 according to some other embodiments of the present disclosure. The matrix 310 is the E (r) This is an example.
[0075] Before generating the bit string, first (r) In some embodiments, E can be adjusted for a column based on the column index. (r) For example, the matrix E (r) We can adjust the positions of the columns of such that in the adjusted matrix, columns with even index 2i are placed after columns with odd index 2i+1, where i is a number from (M r / 2) to 1. In this way, the column with the highest column index can be shifted to the last column.
[0076] 3C, matrix 310 has five columns 301-305. After adjustment, matrix 330 has column 304 as the last column, column 302 as the second to last column, and column 305 as the third to last column. In this exemplary embodiment, the position of first column 301 does not need to be changed.
[0077] In this exemplary embodiment, if a pair of non-zero coefficients needs to be discarded, the amplitude coefficient(s) corresponding to the non-zero element(s) in column 304 may be discarded first, followed by the amplitude coefficient(s) corresponding to the non-zero element(s) in column 302. The amplitude coefficient(s) corresponding to the non-zero element(s) in the first column 301 are least likely to be discarded.
[0078] E (r) Similar adjustments can be made to the rows of . For a particular matrix, E (r) We have explained the adjustment of E (r) The same adjustments can be made to each of them. The adjustments described above with reference to Figures 3A and 3B are for illustration purposes and are not limiting in any way.
[0079] E represented by (r,l,f) before adjustment (r) After adjustment, the elements of are, for example, (r ~ ,l ~ ,f ~ 3A and 3B, the scaling is performed on the columns, i.e. in the frequency domain. In this case, the scaled elements can be expressed as (r, l, f ~ ) can be expressed as
[0080] Now, referring to FIG. 4A and FIG. 4B, (r) 4A shows a schematic diagram 400 illustrating the generation of a bitmap 421 according to some embodiments of the present disclosure. FIG. 4B shows a schematic diagram 450 illustrating the generation of a bitmap 422 according to some embodiments of the present disclosure.
[0081] E for (multiple) layers (r) To convert the E (r) In order to interleave the elements of (r, l, f), mapping rules can be predefined. For elements (r, l, f), there are three dimensional indices: layer, spatial domain, and frequency domain. The following equations (6) to (11) are examples of mapping rules that can be used.
number
number
number
number
number
number
[0082] In the example shown in FIG. 4A, the mapping rule defined in equation (8) is applied to matrices 430 and 431. The matrices are, respectively, E (1) and E (2) As a result, in bitmap 421 generated based on matrices 430 and 431, the bits corresponding to elements 401-404 occupy the first through fourth positions, the bits corresponding to elements 405-405 occupy the fifth through eighth positions, and so on.
[0083] In the example shown in FIG. 4B, the mapping rule defined in equation (6) is applied to matrices 430 and 431. The matrices are, respectively, E (1) and E (2)As a result, in bitmap 422 generated based on matrices 430 and 431, the bit corresponding to element 401 occupies the first position, the bit corresponding to element 405 occupies the second position, the bit corresponding to element 402 occupies the third position, the bit corresponding to element 406 occupies the fourth position, the bit corresponding to element 403 occupies the fifth position, the bit corresponding to element 407 occupies the sixth position, the bit corresponding to element 404 occupies the seventh position, the bit corresponding to element 401 occupies the eighth position, and so on.
[0084] It should be understood that the matrices shown in FIGS. 4A and 4B are (r) These are merely examples and are not intended to be limiting. (r) The mapping from to a bitmap can be applied to any number of matrices with any suitable number of columns and rows. It is also worth noting that although equations (6) to (11) are expressed in terms of (r,l,f), the mapping rules are based on the transformed E (r) The same method can be applied to (r, l, f) in equations (6) to (11). ~ ,l ~ ,f ~ ) can be replaced with
[0085] 2, the terminal device 120 transmits (215) uplink control information including the bit string to the network device 110. For example, the terminal device 120 may transmit a bitmap 421 to the network device 110 as part of the CSI.
[0086] In some example embodiments, prior to transmission of the UCI, the terminal device 120 may determine whether the UCI is suitable for transmission using available uplink resources. If the terminal device 120 determines that the UCI is not suitable for transmission using available uplink resources, it may discard or drop a portion of the CSI (e.g., because there may be other information that has a higher priority than the CSI). For example, if the terminal device 120 determines that the resources available for the UCI are insufficient for transmission of the CSI report or if the terminal device 120 determines that the actual coding rate is greater than a coding rate threshold, the terminal device 120 may discard at least a portion of the CSI. In this case, the terminal device 120 may have to discard the amplitude and phase coefficients of at least one SD-based-FD-based pair.
[0087] Position-based discarding may also be employed. For example, the terminal device 120 may discard amplitude and phase coefficients from the end of the bit string. The amplitude and phase coefficients corresponding to the last bit having a predefined value (e.g., "1") may be discarded first.
[0088] In the example shown in Figure 4A, the last bit 1 of bitmap 421 corresponds to element 410 of matrix 431, and the penultimate bit 1 of bitmap 421 corresponds to element 409 of matrix 430. In this example, the amplitude and phase coefficients corresponding to element 410 are discarded first. If more coefficients need to be discarded, terminal device 120 can further discard the amplitude and phase coefficients corresponding to element 409. In this way, coefficients can continue to be discarded until the available uplink resources are suitable for transmitting the remaining part of the UCI.
[0089] In the example shown in Figure 4B, the last bit 1 of bitmap 422 corresponds to element 409 of matrix 430, and the penultimate bit 1 of bitmap 422 corresponds to element 410 of matrix 431. In this example, the amplitude and phase coefficients corresponding to element 409 are discarded first. If more coefficients need to be discarded, terminal device 120 can further discard the amplitude and phase coefficients corresponding to element 410. In this manner, coefficients can continue to be discarded until the available uplink resources are suitable for transmitting the remaining portion of the UCI.
[0090] 2, upon receiving the UCI, network device 110 determines (220) a first portion of a first codebook and a second portion of a second codebook based on the received bit sequence. For example, network device 110 may receive bitmap 421 and determine matrices 430 and 431 from bitmap 421. The determination of matrices 430 and 431 may also be based on other parameters included in the CSI report.
[0091] E for each layer r (r) In order to determine or reconstruct E, both the terminal device 120 and the network device 110 may be aware of the same adjustment and mapping rules. Thus, the network device 110 may determine E in a reverse process to that described above with reference to FIGS. (r) The network device 110 may determine or reconstruct the bits of the bit string into different matrices. For example, the network device 110 may apply the mapping rule shown in equation (8) to deinterleave the bits of the bitmap 421.
[0092] It should be noted that, with the network device 110 knowing the above discarding rules, the network device 110 can determine a codeword from the type II CSI codebook after receiving a CSI report.
[0093] In order to reduce the overhead of CSI transmission and thus the overhead of UCI transmission, a two-stage FD-based selection may be implemented to compress the CSI. In such a two-stage FD-based selection, an intermediate set of FD-based may be determined first, and then an FD-based selection for each layer may be indicated based on the intermediate set of FD-based. Therefore, it is necessary to define how to indicate the intermediate set of FD-based to a network device. Hereinafter, these embodiments will be described with reference to FIG. 5 to FIG. 7.
[0094] FIG. 5 illustrates a schematic diagram of a process 500. The process 500 is for illustrating an FD-based intermediate set according to some embodiments of the present disclosure. The terminal device 120 determines (505) an FD-based intermediate set for at least one transmission layer from the FD-based ordered set (e.g., the DFT vectors described above). The at least one transmission layer is used for communication between the terminal device 120 and the network device 110. The SCI is a coefficient matrix W ~ 2 (r) The intermediate set includes the first FD base in the ordered set of FD bases such that it is aligned with the first column of
[0095] The number of FD bases in the intermediate set is herein N 3 In an ordered set of FD bases from which an intermediate set of FD bases is selected, the number of FD bases is N 3 Such an intermediate set of FD bases can be thought of as a window. If there is only one layer, the intermediate set can be determined based on the FD bases selected by a particular layer.
[0096] In some demonstrative embodiments, the terminal device 120 may determine an FD-based first ordered subset for a first transmission tier and an FD-based second ordered subset for a second transmission tier from the FD-based ordered set, where the first transmission tier is different from the second transmission tier. The terminal device 120 may then determine an FD-based intermediate set based on a union of the FD-based first ordered subset and the FD-based second ordered subset.
[0097] This example is illustrated with reference to FIG. 6. FIG. 6 shows a schematic diagram 600. The schematic diagram 600 illustrates the selection of FD bases according to some embodiments of the present disclosure. For the purpose of explanation and not by way of limitation, the selection of FD bases is represented by bitmaps. In the example shown in FIG. 6, bitmaps 601-604 represent the subsets of FD bases selected for layers 1-4, respectively. Bitmap 605 represents the union set of FD bases. The union set of FD bases covers the union of the subsets of FD bases for each layer, layers 1-4. For bitmap 605, the starting point is M initial , size N 3 ', and the FD base of this sum set is the exponent mod(M initial +n,N 3 ), where n=0,1,...,N 3 '-1.
[0098] Intermediate set size N 3 If ' is fixed, the window start point M initial 5, based on the number of FD bases in the ordered set and the number of FD bases in the intermediate set, the terminal device 120 determines (510) an indication of the intermediate set of FD bases. For example, the terminal device 120 may report an indication of N 3 and N 3 Based on the value of ', M initial Instructions regarding the same may be determined.
[0099] This example is illustrated with reference to Figure 7. Figure 7 shows a schematic diagram 700. The schematic diagram 700 shows a starting point according to some embodiments of the present disclosure. Length 701 is a number N 3 and the length 702 is N 3 -N 3 '. The first FD base in the ordered set of FD bases should be included in the intermediate set, and the number N 3 ' is fixed, so the starting point M initial The location indication 710 of can be restricted to within the region 703. Thus, the starting point can be expressed as:
number
[0100] The value of i may be determined by the terminal device 120 as an indication of the FD-based intermediate set and reported to the network device 110. Continuing to refer to FIG. 5, the terminal device 120 may initial The terminal device 120 may then transmit uplink control information to the network device 110 including an indication of (515). For example, the terminal device 120 may transmit the determined i in part 1 of the UCI to the network device 110. The terminal device 120 may further report the FD base for each layer in part 2 of the UCI.
[0101] In this exemplary embodiment, the bit width for transmitting the instruction is set to ceil(log 2 N 3 ') can be determined as the bit width ceil(log 2 N 3 ), the overhead for reporting the starting point is reduced by M initial It becomes.
[0102] For example, upon receiving an indication of i, the network device 110 may increment the number of FD-based orders in the ordered set (N 3 ), and the number of FD bases in the intermediate set (N 3 For example, the network device 110 may use equation (12) to determine the window start point M initial can be determined.
[0103] When the terminal device 120 determines the codebook, for example, as shown in equation (1), it can apply codebook subset restriction (CBSR) to determine the parameters required for the codebook. For example, a maximum power constraint can be applied to determine the coefficient matrix W ~ 2 For a particular layer r, we can determine the amplitude coefficients of the coefficient matrix W ~ 2 can be further expressed as follows:
number
[0104] Although not shown in equation (13), the parameter M is defined as “M r " The terminal device 120 applies the maximum power constraint to each amplitude coefficient p diff The values of (l,m) can be determined, where l is between 0 and 2L and m is between 0 and M-1. In this way, the power of a particular SD beam can be constrained. This embodiment is described with reference to FIG. 8.
[0105] 8 illustrates a flowchart of an example method 800 according to some embodiments of the present disclosure. The method 800 may be implemented in the terminal device 120 illustrated in FIG. It should be understood that the method 800 may include additional blocks not illustrated and / or may omit some illustrated blocks, and the scope of the present disclosure is not limited in this respect. For ease of discussion, the method 800 will be described with reference to FIG. 1.
[0106] In block 810, the terminal device 120 obtains a power threshold for a beam configured for communication between the terminal device 120 and the network device 110. The power threshold for maximum power may be configured, for example, by a higher layer. The terminal device 120 may also obtain the power threshold by receiving higher layer signaling. The terminal device 120 may determine the power threshold in any suitable manner.
[0107] In some exemplary embodiments, the power threshold can be set separately for each layer r. In this exemplary embodiment, the power threshold is P max,r,l In some exemplary embodiments, a power threshold can be set for all layers. In this exemplary embodiment, the power threshold can be expressed as P max,l It can be expressed as:
[0108] At block 820, the terminal device 120 determines a power representation corresponding to the power threshold based on a plurality of amplitude coefficients in the frequency domain of the beam. In some exemplary embodiments, the power representation may be determined separately for each layer. In some other embodiments, the power representation may be determined based on the amplitude coefficients corresponding to each transmission layer.
[0109] In block 830, the terminal device 120 determines values of the amplitude coefficients such that the power determined based on the power indication is below the power threshold. In an example embodiment applying a maximum power constraint at each layer, the following equations (14) and (15) may be satisfied.
number
number
[0110] In the case of equation (14), l ranges from 0 to L−1, and in the case of equation (15), l ranges from L to 2L−1. The terminal device 120 determines the amplitude coefficient p diff The values of (l,m) can be determined. The amplitude coefficient p diff The values of (l,m) can be selected from among a number of predefined values.
[0111] In an example embodiment where a maximum power constraint is applied across all layers, the following equations (16) and (17) may be satisfied.
number
number
[0112] In the case of equation (16), l ranges from 0 to L−1, and in the case of equation (17), l ranges from L to 2L−1. The terminal device 120 determines the amplitude coefficient p diff The values of (l,m) can be determined. The amplitude coefficient p diff The values of (l,m) can be selected from among a number of predefined values.
[0113] 9 illustrates a flowchart of an example method 900 according to some embodiments of the present disclosure. The method 900 may be implemented in the terminal device 120 illustrated in FIG. It should be understood that the method 1000 may include additional blocks not illustrated and / or may omit some illustrated blocks, and the scope of the present disclosure is not limited in this respect. For ease of discussion, the method 1000 will be described with reference to FIG. 1.
[0114] In block 910, the terminal device 120 determines a first portion of a first codebook and a second portion of a second codebook, the first portion and the second portion indicating the presence or absence of gain for a plurality of pairs of spatial domain (SD) base and frequency domain (FD) base, and the first codebook and the second codebook are used in different transmission layers between the terminal device 120 and the network device 110.
[0115] At block 920, the terminal device 120 determines a bit sequence based on the first and second portions, where each bit of the bit sequence corresponds to an SD-FD base pair among a plurality of SD-FD base pairs.
[0116] In some embodiments, determining the bit sequence comprises interleaving a first element of the first portion and a second element of the second portion, and generating the bit sequence based on the interleaved first and second elements.
[0117] In some embodiments, the first portion is a first matrix and the second portion is a second matrix, and determining the bit sequence comprises adjusting columns of the first matrix and columns of the second matrix, and generating the bit sequence based on the adjusted first matrix and the adjusted second matrix.
[0118] In some embodiments, adjusting the columns of the first matrix comprises determining an intermediate column of the first matrix that is between the first column and the last column of the first matrix and another column adjacent to the intermediate column, shifting the intermediate column to the last column of the first matrix, and positioning the other column adjacent to the shifted intermediate column.
[0119] In some embodiments, adjusting the columns of the first matrix comprises determining from the first matrix even columns having even column indices and odd columns having odd column indices, and placing the even columns after the odd columns.
[0120] At block 930, the terminal device 120 transmits uplink control information including the bit string to the network device 110.
[0121] In some embodiments, the method 900 further comprises determining whether the uplink control information is suitable for transmission using the available uplink resources; and, in response to determining that the uplink control information is not suitable for transmission using the available uplink resources, determining a last bit in the bit string with a predefined value; determining a gain for the SD-based and FD-based pair corresponding to the last bit; and discarding the indication of the gain for the SD-based and FD-based pair from the uplink control information.
[0122] 10 illustrates a flow chart of an example method 1000 according to some embodiments of the present disclosure. Method 1000 may be implemented in network device 110 illustrated in FIG. It should be understood that method 1000 may include additional blocks not illustrated and / or may omit some illustrated blocks, and the scope of the present disclosure is not limited in this respect. For ease of discussion, method 1000 will be described with reference to FIG.
[0123] In block 1010, the network device 110 receives uplink control information including a bit string from the terminal device 120. Each bit of the bit string corresponds to one spatial domain-based and frequency domain-based pair among a plurality of spatial domain (SD)-based and frequency domain (FD)-based pairs.
[0124] In block 1020, the network device 110 determines a first part of a first codebook and a second part of a second codebook based on the bit sequence. The first and second parts indicate the presence or absence of gain for a plurality of pairs of SD base and FD base. The first and second codebooks are used in different transmission layers between the terminal device 120 and the network device 110.
[0125] In some embodiments, determining the first and second portions comprises deinterleaving bits of the bit sequence into first bits corresponding to the first portion and second bits corresponding to the second portion, and determining the first and second portions based on the first and second bits.
[0126] In some embodiments, the first portion is a first matrix and the second portion is a second matrix, and determining the bit sequence comprises generating a first intermediate matrix and a second intermediate matrix based on the bit sequence, adjusting columns of the first intermediate matrix and columns of the second intermediate matrix, and determining the adjusted first intermediate matrix as the first portion and determining the adjusted second intermediate matrix as the second portion.
[0127] 11 illustrates a flowchart of an example method 1100 according to some embodiments of the present disclosure. The method 1100 may be implemented in the terminal device 120 illustrated in FIG. It should be understood that the method 1100 may include additional blocks not illustrated and / or may omit some illustrated blocks, and the scope of the present disclosure is not limited in this respect. For ease of discussion, the method 1100 will be described with reference to FIG.
[0128] In block 1110, the terminal device 120 determines an intermediate set of frequency domain (FD) bases for at least one transmission layer from the ordered set of FD bases, the at least one transmission layer being configured to be used for communication between the terminal device 120 and the network device 110. A first FD base in the ordered set of FD bases is included in the intermediate set.
[0129] In block 1120, the terminal device 120 determines an indication of the intermediate set of FD bases based on the number of FD bases in the ordered set and the number of FD bases in the intermediate set.
[0130] In some embodiments, determining the FD-based intermediate set comprises determining, from the FD-based ordered set, a FD-based first ordered subset for a first transmission tier and a FD-based second ordered subset for a second transmission tier different from the first transmission tier, and determining the FD-based intermediate set based on a union set of the FD-based first ordered subset and the FD-based second ordered subset.
[0131] At block 1130, the terminal device 120 transmits uplink control information including the indication to the network device 110. In some embodiments, the size of the resource for the indication transmission is determined based on the number of FD bases in the intermediate set.
[0132] 12 illustrates a flowchart of an example method 1200 according to some embodiments of the present disclosure. The method 1200 may be implemented in the network device 110 illustrated in FIG. It should be understood that the method 1200 may include additional blocks not illustrated and / or may omit some illustrated blocks, and the scope of the present disclosure is not limited in this respect. For ease of discussion, the method 1200 will be described with reference to FIG.
[0133] At block 1210, the network device 110 receives uplink control information including an indication from the terminal device 120. The indication indicates an intermediate set of frequency domain (FD) bases determined by the terminal device 120 from an ordered set of FD bases. A first FD base in the ordered set of FD bases is included in the intermediate set.
[0134] At block 1220, network device 110 determines an intermediate set of FD bases for at least one transmission layer based on the indication, the number of FD bases in the ordered set, and the number of FD bases in the intermediate set, the at least one transmission layer being configured to be used for communications between terminal device 120 and network device 110.
[0135] 13 is a schematic block diagram of a device 1300 suitable for implementing embodiments of the present disclosure. The device 1300 can be considered as a further example implementation of the network device 110 or the terminal device 120 shown in FIG. 1. Thus, the device 1300 can be implemented in or as at least a part of the network device 110 or the terminal device 120.
[0136] As shown, the device 1300 includes a processor 1310, a memory 1320 coupled to the processor 1310, a suitable transmitter (TX) and receiver (RX) 1340 coupled to the processor 1310, and a communication interface coupled to the TX / RX 1340. The memory 1310 stores at least a portion of a program 1330. The TX / RX 1340 is used for bidirectional communication. The TX / RX 1340 has at least one antenna to facilitate communication, and in practice the access nodes described herein may have multiple antennas. The communication interface may represent any interface required for communication with other network elements, such as an X2 interface for bidirectional communication between eNBs, an S1 interface for communication between a Mobility Management Entity (MME) / Serving Gateway (S-GW) and an eNB, an Un interface for communication between an eNB and a Relay Node (RN), or an Uu interface for communication between an eNB and a terminal device.
[0137] Assuming that the program 1330 includes program instructions that, when executed by an associated processor 1310, cause the device 1300 to operate in accordance with embodiments of the present disclosure, as described herein with reference to Figures 8-12. The embodiments of the present disclosure may be implemented by computer software, hardware, or a combination of software and hardware executable by the processor 1310 of the device 1300. The processor 1310 may be configured to implement embodiments of the present disclosure. Additionally, the combination of the processor 1310 and the memory 1310 may form a processing means 1350 suitable for implementing embodiments of the present disclosure.
[0138] The memory 1310 may be of any type suitable for the local technology network and may be implemented by any suitable data storage technology. Examples include, but are not limited to, computer readable non-transitory storage media, semiconductor-based storage devices, magnetic storage devices and systems, optical storage devices and systems, fixed and removable memories, etc. Although only one memory 1310 is shown in the device 1300, multiple physically distinct memory modules may be installed in the device 1300. The processor 1310 may be of any type suitable for the local technology network and may include, but is not limited to, one or more of the following: general purpose computers, special purpose computers, microprocessors, digital signal processors (DSPs), and processors based on multi-core processor configurations. The device 1300 may have multiple processors, for example, application specific integrated circuit chips time-slaved to a clock synchronous with a master processor.
[0139] In general, each embodiment of the present disclosure can be implemented by hardware or dedicated circuits, software, logic, or any combination thereof. Some aspects can be implemented by hardware, and other aspects can be implemented by firmware or software executed by a controller, microprocessor, or other computing device. Although each aspect of the embodiments of the present disclosure is illustrated and described as a block diagram, a flow chart, or by some other graphical representation method, it should be understood that the blocks, apparatus, systems, techniques, or methods described herein can be implemented by, for example, but not limited to, hardware, software, firmware, dedicated circuits or logic, general-purpose hardware or controller or other computing device, or a combination thereof.
[0140] The present disclosure further provides at least one computer program product tangibly stored in a computer readable non-transitory storage medium. The computer program product includes those computer executable instructions, for example, contained in program modules. The computer executable instructions may be executed on a target physical or virtual processor device to perform the process or method described above with reference to any of Figures 2, 5, 8-12. Typically, program modules include routines, programs, libraries, objects, classes, components, data structures, etc. that perform particular tasks or implement particular abstract data types. In various embodiments, the functionality of the program modules may be combined or split among program modules as appropriate. The machine executable instructions for the program modules may be executed in local or distributed devices. In distributed devices, the program modules may be located in local and remote storage media.
[0141] The program code for carrying out the methods of the present disclosure can be written in any combination of one or more programming languages. These program codes can be provided to a processor or controller of a general purpose computer, a special purpose computer or other programmable data processing device, and when executed by the processor or controller, the functions / operations specified in the flowcharts and / or block diagrams are performed. The program code can be entirely executed on the machine, partially executed on the machine, executed as a separate software package, partially executed on the machine and partially executed on a remote machine, or entirely executed on a remote machine or server.
[0142] The above-mentioned program code may be embodied on a machine-readable medium, which may be any tangible medium that may contain or store a program provided for use by, or in connection with, an instruction execution system, apparatus, or device. The machine-readable medium may be a machine-readable signal medium or a machine-readable storage medium. The machine-readable medium may include, but is not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any suitable combination of the aforementioned media. More specific examples of machine-readable storage media include one or more electrical connections of cables, a portable computer diskette, a hard disk, a random access memory (RAM), a read-only memory (ROM), an erasable-programmable read-only memory (EPROM or flash memory), optical fiber, a portable compact disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the aforementioned media.
[0143] It should be understood that although operations are described in a particular order, it is not required that such operations be performed in the particular order or sequence shown, or that all of the operations shown be performed, in order to achieve desired results. In some circumstances, multiple tasks and parallel processing may be advantageous. Similarly, although the above discussion includes some specific implementation details, these should not be construed as limitations on the scope of the disclosure, but rather as descriptions of features that may be specific to certain embodiments. Some features described in the context of separate embodiments may be implemented in combination in a single implementation. Conversely, various features described in the context of a single embodiment may be implemented in multiple embodiments alone or in any suitable subcombination.
[0144] Although the present disclosure has been described in specific language regarding structural features and / or method and operations, it is to be understood that the present disclosure, as defined by the appended claims, is not necessarily limited to the specific features or operations described above. Rather, the specific features and operations described above are disclosed as example forms of implementing the claims.
Claims
1. 1. A method performed by a terminal device, comprising: determining a channel state information (CSI) report based on a codebook having a first number of frequency domain (FD) base vectors; transmitting the CSI report on a physical uplink shared channel (PUSCH); Equipped with The CSI report omits a portion of the CSI in the order of adjustment of the index of the FD base vector; The average coefficient amplitude associated with the index of the FD basis vector is limited to be less than a set maximum amplitude. method.
2. means for determining a channel state information (CSI) report based on a codebook having a first number of frequency domain (FD) base vectors; means for transmitting the CSI report on a physical uplink shared channel (PUSCH); Equipped with The CSI report omits a portion of the CSI in the order of adjustment of the index of the FD base vector; The average coefficient amplitude associated with the index of the FD basis vector is limited to be less than a set maximum amplitude. Terminal device.