Reference Signaling Design and Configuration

Abstract

A method and system for reference signaling design and configuration is disclosed. In one implementation, a method of wireless communication includes: determining, by a communication device, one or more channel status information reference signal resources; receiving, by the communication device, a channel status information reference signal on the one or more channel status information reference signal resources; and reporting, by the communication device, channel state information to a communication node, the channel status information including first information regarding a set of a first type of vectors, second information regarding one or more sets of a second type of vectors, and third information corresponding to D time domain units.

Description

[Technical field]

[0001] Technical Field This patent document relates generally to wireless communications. [Background technology]

[0002] background Mobile communication technologies are moving the world towards an increasingly connected and networked society. The rapid growth of mobile communications and technological advances are driving the demand for increased capacity and improved connectivity. Other aspects such as energy consumption, device cost, spectrum efficiency, and latency are also important to meet the needs of various communication scenarios. Various technologies are being discussed, including new methods to provide higher quality of service, longer battery life, and improved performance. Summary of the Invention [Means for solving the problem]

[0003] overview This patent document describes, among other things, techniques for reference signaling design and configuration.

[0004] In one aspect, a method of data communication is disclosed, the method including: determining, by a communication device, one or more channel status information reference signal resources; receiving, by the communication device, a channel status information reference signal on the one or more channel status information reference signal resources; and reporting, by the communication device, channel state information to a communication node, the channel status information including first information on a set of first type vectors, second information on one or more sets of second type vectors, and third information corresponding to D time domain units, each of the first type vectors including P / 2 elements, P being a number of channel status information reference signal ports of one of the one or more channel status information reference signal resources, each of the second type vectors including C elements each corresponding to one frequency domain unit, each of C and D being a positive integer, or at least one of C or D being a positive integer greater than 1.

[0005] In another aspect, a method of data communication is disclosed that includes determining, by a communication device, one or more channel status information reference signal resources, receiving, by the communication device, a channel status information reference signal on the one or more channel status information reference signal resources, and transmitting, by the communication device, to a first communication node, information regarding E channels between the communication device and a second communication node, where E is a positive integer.

[0006] In another exemplary aspect, a wireless communications apparatus is disclosed comprising a processor configured to perform the above-described method.

[0007] In another exemplary aspect, a computer storage medium having stored thereon code for performing the method described above is disclosed.

[0008] These and other aspects are described herein. [Brief description of the drawings]

[0009] [Figure 1] FIG. 1 illustrates an example of a wireless communication system in accordance with some exemplary embodiments of the disclosed technology.

[0010] [Diagram 2] FIG. 2 is a block diagram representation of a portion of an apparatus according to some embodiments of the disclosed technology.

[0011] [Diagram 3] FIG. 3 illustrates an example of a time domain unit according to some exemplary embodiments of the disclosed techniques.

[0012] [Figure 4] FIG. 4 illustrates example periods for reporting different portions of channel status information (CSI) in accordance with some example embodiments of the disclosed techniques.

[0013] [Diagram 5] FIG. 5 illustrates another example of time periods for reporting different portions of CSI in accordance with some example embodiments of the disclosed techniques.

[0014] [Figure 6] FIG. 6 illustrates an example of a CSI report in accordance with some example embodiments of the disclosed techniques.

[0015] [Figure 7] FIG. 7 illustrates another example of CSI reporting in accordance with some example embodiments of the disclosed techniques.

[0016] [Figure 8] FIG. 8 illustrates an example process for wireless communication in accordance with some exemplary embodiments of the disclosed technology.

[0017] [Figure 9] FIG. 9 illustrates another example of a process for wireless communication in accordance with some exemplary embodiments of the disclosed technology. DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS

[0018] Detailed Description Section headings are used herein for ease of understanding only and are not intended to limit the scope of the embodiments to the section they are written in. Furthermore, although the embodiments are described with reference to 5G examples, the disclosed techniques may be applied to wireless systems using protocols other than 5G or 3GPP protocols.

[0019] FIG. 1 illustrates an example of a wireless communication system (e.g., a Long Term Evolution (LTE), 5G, or NR cellular network) including a BS 120 and one or more user equipments (UEs) 111, 112, and 113. In some embodiments, the uplink transmissions (131, 132, 133) may include uplink control information (UCI), higher layer signaling (e.g., UE assistance information or UE capabilities), or uplink information. In some embodiments, the downlink transmissions (141, 142, 143) may include DCI or higher layer signaling or downlink information. The UEs may be, for example, smartphones, tablets, mobile computers, machine-to-machine (M2M) devices, terminals, mobile devices, Internet of Things (IoT) devices, etc.

[0020] 2 is a block diagram representation of a portion of an apparatus according to some embodiments of the disclosed techniques. An apparatus 205, such as a network device or base station or wireless device (or UE), can include processor electronics 210, such as a microprocessor, that implements one or more of the techniques presented herein. The apparatus 205 can include transceiver electronics 215 that transmits and / or receives wireless signals via one or more communication interfaces, such as an antenna 220. The apparatus 205 can include other communication interfaces for transmitting and receiving data. The apparatus 205 can include one or more memories (not explicitly shown) configured to store information, such as data and / or instructions. In some implementations, the processor electronics 210 can include at least a portion of the transceiver electronics 215. In some embodiments, at least some of the disclosed techniques, modules, or functions are implemented using the apparatus 205.

[0021] Example 1

[0022] FIG. 3 illustrates an example of a time domain unit according to some exemplary embodiments of the disclosed techniques.

[0023] The UE receives the N3 frequency domain units and the T time domain units. [ka] The precoding matrix indicator (PMI, ie, channel state information) indicating the precoding matrices. [ka] The precoding matrices include N3 precoding matrices for the N3 frequency domain units of each of the T time domain units, where each of the N3 precoding matrices for a time domain unit corresponds to one of the N3 frequency domain units.

[0024] In some implementations, the value T is greater than one.

[0025] In some implementations, the value N3 is greater than one.

[0026] For example, one precoding matrix W for frequency domain unit k, k = 0, 1, … N3-1 and time domain unit t, = 0, 1, …, T-1. k,t The lth column of [ka] The format is: [ka] and v i v is a first type of vector that includes P elements and may be referred to as a spatial domain vector. Each of the P elements corresponds to one CSI-RS port among the P CSI-RS ports of the CSI-RS resources on which the PMI is based. P is the number of one CSI-RS resources. In some implementations, v i is a discrete Fourier transform (DFT) or a two-dimensional DFT with P elements. In another implementation, v i has exactly one element equal to 1 and the rest [ka] This is a vector whose elements are 0. [ka] One [ka] In contrast, [ka] N3 can be considered as vectors, which may be called second type vectors or frequency domain vectors. [ka] is the t-th element of the third type vector corresponding to the time domain unit t. [ka] One [ka] In contrast, [ka] T can be considered as a vector, which may be called a third type vector or a time domain vector. [ka] In a third implementation, [ka] and [ka] is the appropriate number reported.

[0027] In some implementations, the T time domain units are consecutive. The last next-to-last orthogonal frequency division multiplexing (OFDM) symbol of time domain unit t−1 is the starting OFDM symbol of time domain unit t.

[0028] In some implementations, the T time domain units include the same number of OFDMs.

[0029] PMI contains information about three types of vectors for each layer l, l = 1, 2, … v. All [ka] The columns corresponding to layer l of the precoding matrices are based on the three types of vectors reported. The PMI contains information about one vector, which means that the PMI contains an index corresponding to one vector. For example, the PMI is [ka] Includes.

[0030] Example 2

[0031] FIG. 4 illustrates example periods for reporting different portions of channel status information (CSI) in accordance with some example embodiments of the disclosed techniques.

[0032] FIG. 5 illustrates another example of time periods for reporting different portions of CSI in accordance with some example embodiments of the disclosed techniques.

[0033] The time periods for reporting different portions of the CSI may be different.

[0034] As shown in Figure 4, the reporting period [ka] is the first period and the reporting period a l,i,f,t is a second period. The first period includes a plurality of second periods. l,i,f,t was recently reported [ka] Based on.

[0035] As shown in Figure 5, the reporting period [ka] is the first period and the reporting period a l,i,f,t ,CQI t is a second period. The first period includes a plurality of second periods. l,i,f,t ,CQIt was recently reported [ka] Based on.

[0036] For example, one precoding matrix W for frequency domain unit k, k = 0, 1, ..., N3-1 and time domain unit t, t = 0, 1, ..., T-1 k,t The lth column of [ka] can have the following format: [ka]

[0037] Example 3

[0038] FIG. 6 illustrates an example of a channel status information (CSI) report in accordance with some exemplary embodiments of the disclosed techniques.

[0039] FIG. 7 illustrates another example of CSI reporting in accordance with some example embodiments of the disclosed techniques.

[0040] In the case of one report reported on one time instance and one uplink channel, it includes one set of first CSI information and multiple sets of second CSI information corresponding to multiple time domain units. One set of first CSI information may apply to multiple time domain units. Each of the multiple time domain units corresponds to one respective set of second CSI information.

[0041] As shown in FIG. 6, the UE receives the reporting,i ,i=0,1,…, etc., the UE reports CSI for one CSI report at one time instance. [ka] One set of and al,i,f,t Report a set of P1 of these, where P1 is greater than 1.

[0042] As shown in FIG. 7, the UE receives the reporting,i ,i=0,1,…, and the UE reports CSI for one CSI report at one timestamp. [ka] One set of and a l,i,f,t ,CQI t We report a set of P1.

[0043] For example, one precoding matrix W for frequency domain unit k, k = 0, 1, ..., N3-1 and time domain unit t, t = 0, 1, ..., T-1 k,t The lth column of [ka] can have the following format: [ka]

[0044] The disclosed technology can be implemented in some embodiments to provide a third type of vector as described above.

[0045] Example 4

[0046] [ka] The legacy structure for remains, but the additional eigenvectors and corresponding matrices [ka] (For example, additionally [ka] or only some of them) are introduced. Next, we can consider the prediction / extrapolation structure of the eigenvectors.

[0047] Like interpretation 2, this interpretation 3 also involves CSI / PMI prediction / extrapolation, but without the full channel matrices [ka] This is based on the matrix [ka] Legacy reports, i.e. matrices [ka] Although it may introduce some more CSI feedback compared to only, it can account for the complete channel information, which may be beneficial for Doppler prediction and subsequent CSI compression.

[0048] In the above implementations, a subscript or superscript symbol index of a vector or matrix means that the vector or matrix is ​​unique to the index. For example, [ka] is specific to the layer l and the local index f of the second type of vector. An integer subscript or superscript of a vector or matrix does not mean that the vector or matrix is ​​specific to that integer, it just means the category of the vector or matrix. For example, [ka] The subscript 3 in denotes the category of n.

[0049] In some implementations, the period for reporting different portions of the CSI may be different.

[0050] The disclosed techniques may be implemented in some embodiments to determine which CSI information is reported in a first time period and which CSI information is reported in a second time period. Additionally, the disclosed techniques may be implemented in some embodiments to determine a relationship between the first time period and the second time period.

[0051] In some implementations, one report reported on one time instance and one uplink channel includes one set of first CSI information and multiple sets of second CSI information corresponding to multiple time domain units.

[0052] In some implementations, one set of first CSI information may apply to multiple time domain units, each of which corresponds to a second set of CSI information.

[0053] FIG. 8 illustrates an example process for wireless communication in accordance with some exemplary embodiments of the disclosed technology.

[0054] In some embodiments of the disclosed technology, a wireless communication method 800 includes, at 810, determining, by the communication device, one or more channel status information reference signal resources; receiving, by the communication device, a channel status information reference signal on the one or more channel status information reference signal resources, at 820; and reporting, by the communication device, channel state information to the communication node, at 830, including first information regarding a set of first type vectors, second information regarding one or more sets of second type vectors, and third information corresponding to D time domain units, where each of the first type vectors includes P / 2 elements, P being the number of channel status information reference signal ports of one of the one or more channel status information reference signal resources, and each second type vector includes C elements each corresponding to one frequency domain unit, where each of C and D is a positive integer, or at least one of C or D is a positive integer greater than 1.

[0055] FIG. 9 illustrates another example of a process for wireless communication in accordance with some exemplary embodiments of the disclosed technology.

[0056] In some embodiments of the disclosed technology, a wireless communication method 900 includes, at 910, determining, by the communications device, one or more channel status information reference signal resources; at 920, receiving, by the communications device, a channel status information reference signal on the one or more channel status information reference signal resources; and, at 930, transmitting, by the communications device, to a first communications node, information regarding E channels between the communications device and a second communications node, where E is a positive integer.

[0057] It will be appreciated that the present specification discloses techniques that may be embodied in various embodiments for determining reference signaling and configurations in wireless networks. The disclosed and other embodiments, modules and functional operations described herein may be implemented in digital electronic circuitry, or in computer software, firmware, or hardware, including the structures disclosed herein and their structural equivalents, or in one or more combinations thereof. The disclosed and other embodiments may be implemented as one or more computer program products, i.e., one or more modules of computer program instructions encoded on a computer-readable medium for execution by or for controlling the operation of a data processing apparatus. The computer-readable medium may be a machine-readable storage device, a machine-readable storage substrate, a memory device, a composite of materials that provides a machine-readable propagated signal, or one or more combinations thereof. The term "data processing apparatus" encompasses all apparatus, devices, and machines for processing data, including, by way of example, a programmable processor, a computer, or multiple processors or computers. An apparatus may include, in addition to hardware, code that creates an environment for the execution of the computer program in question, e.g., code that constitutes a processor firmware, a protocol stack, a database management system, an operating system, or one or more combinations thereof. A propagated signal is an artificially generated signal, such as a machine-generated electrical, optical, or electromagnetic signal, that is generated to encode information for transmission to an appropriate receiving device.

[0058] A computer program (also known as a program, software, software application, script, or code) can be written in any form of programming language, including compiled or interpreted languages, and can be deployed in any form, including as a stand-alone program or as a module, component, subroutine, or other unit suitable for use in a computing environment. A computer program does not necessarily correspond to a file in a file system. A program can be stored as part of a file that holds other programs or data (e.g., one or more scripts stored in a markup language document), in a single file dedicated to the program in question, or in multiple cooperating files (e.g., files that store one or more modules, subprograms, or portions of code). A computer program can be deployed to be executed on one computer or on multiple computers located at one site or distributed across multiple sites and interconnected by a communication network.

[0059] The processes and logic flows described herein may be performed by one or more programmable processors executing one or more computer programs to perform functions by manipulating input data to generate output. The processes and logic flows may also be performed by, and an apparatus may also be implemented as, special purpose logic circuitry, such as, for example, an FPGA (field programmable gate array) or an ASIC (application specific integrated circuit).

[0060] Processors suitable for executing computer programs include, by way of example, both general-purpose and special-purpose microprocessors, and any one or more processors of any kind of digital computer. Generally, a processor receives instructions and data from a read-only memory or a random-access memory, or both. The essential elements of a computer are a processor for executing instructions, and one or more memory devices for storing instructions and data. Generally, a computer also includes one or more mass storage devices for storing data, such as magnetic, magneto-optical, or optical disks, and is operatively coupled to receive data from them, transfer data to them, or both. However, a computer need not have such devices. Computer-readable media suitable for storing computer program instructions and data include, by way of example, all forms of non-volatile memory, media, and memory devices, including semiconductor memory devices, such as EPROM, EEPROM, and flash memory devices; magnetic disks, such as internal hard disks or removable disks; magneto-optical disks; and CD-ROM and DVD-ROM disks. The processor and memory can be supplemented by, or incorporated in, special-purpose logic circuitry.

[0061] Some embodiments may preferably implement one or more of the following solutions, which are listed in clause form. The following clauses are supported and further described in the above embodiments and throughout this specification. As used in the following clauses and claims, a wireless device may be a user equipment, a mobile station, or any other wireless terminal, including a fixed node such as a base station. A network device includes a base station, including a next-generation Node B (gNB), an enhanced Node B (eNB), or any other device that functions as a base station.

[0062] Item 1. A method of communication, the method including: determining, by a communications device, one or more channel status information reference signal resources; receiving, by the communications device, a channel status information reference signal on the one or more channel status information reference signal resources; and reporting, by the communications device, channel state information to a communications node, the channel status information including first information regarding a set of first type vectors, second information regarding one or more sets of second type vectors, and third information corresponding to D time domain units, each of the first type vectors including P / 2 elements, P being a number of channel status information reference signal ports of one of the one or more channel status information reference signal resources, each second type vector including C elements each corresponding to one frequency domain unit, each of C and D being a positive integer, or at least one of C or D being a positive integer greater than 1.

[0063] Term 2. The method of term 1, in which E precoding matrices are determined according to channel state information for the C frequency domain units and the D time domain units, where E is greater than or equal to 1.

[0064] Clause 3. The method of clause 2, wherein the third information includes information about one or more sets of vectors of a third type, each of which corresponds to one of the D time-domain units.

[0065] Clause 4. The method of clause 3, wherein each of the E precoding matrices is determined according to one set of vectors of a first type, one or more sets of vectors of a second type, and one or more sets of vectors of a third type.

[0066] Clause 5. The method of clause 2, wherein each set of vectors of the third type is unique to at least one of: one layer, one vector of the first type, one vector of the second type, one set of layers, one set of vectors of the first type, or one set of vectors of the second type.

[0067] Clause 6. The method of clause 2, wherein each set of vectors of the third type is unique to at least one of every layer, every vector of the first type, or every vector of the second type.

[0068] Item 7. The method of any of items 3 to 6, wherein E is the product of C and D.

[0069] Item 8. Each column of each of the E precoding matrices is [ka] [ka] and v i is one of the vectors of the first type, [ka] is the k-th element of one of the vectors of the second type, [ka] is the t-th element of one of the vectors of the third type, [ka] corresponds to a frequency domain unit with index k, k=0,1,…,C-1 and t=0,1,…,D-1, and a l,i,f,x are coefficients having amplitude and phase, [ka] is the amplitude coefficient, [ka] The method according to any one of items 3 to 7, wherein z is a phase coefficient and z is an index of one set of vectors of the third type.

[0070] In some implementations, [ka] If is shared among all layers, [ka] We can then remove the subscript l of . Then we can remove the subscript l of .

[0071] In some implementations, if the third type of vector is shared by all i, then: [ka] The subscript l of

[0072] In some implementations, [ka] of, [ka] can be replaced by one of the following:

[0073] In some implementations, β l,k,t is the following formula: [ka] [ka] where v is the number of layers configured by the communication node or reported by the communicated device.

[0074] Section 9. [ka] teeth, [ka] The method according to item 8, represented by:

[0075] Section 10. [ka] teeth, [ka] or [ka] and Q is an integer equal to or greater than 1.

[0076] Item 11. For each layer, the channel state information is calculated based on the strongest [ka] Index of [ka] and the channel state information is equal to 1. [ka] 9. The method according to claim 8, wherein the amplitude value of

[0077] Item 12. For each vector of the third type in each layer, the channel state information is calculated based on the strongest [ka] Index of [ka] and the channel state information is equal to 1. [ka] 9. The method according to claim 8, wherein the amplitude value of

[0078] Item 13. For each layer, the channel state information is [ka] The method of claim 8, further comprising: one bitmap for indicating the reported elements of.

[0079] Item 14. For each vector of the third type in each layer, the channel state information is [ka] The method of claim 8, further comprising: one bitmap for indicating the reported elements of.

[0080] Item 15. For each set of the third type vectors in each layer, the channel state information is [ka] The method of claim 8, further comprising: one bitmap for indicating the reported elements of.

[0081] Section 16.1 [ka] If a bit in the bitmap corresponding to is set to a value of 1, the corresponding amplitude information [ka] and phase information [ka] is included in the channel state information, or [ka] If a bit in the bitmap corresponding to is indicated by a value of 0, the corresponding amplitude information [ka] and phase information [ka] 16. The method according to any of clauses 13 to 15, wherein is not included in the channel state information.

[0082] Item 17. The number of bitmaps is [ka] Item 14. The method according to item 13, wherein

[0083] Item 18. The number of bitmaps is [ka] Item 15. The method according to item 14, wherein

[0084] Item 19. The number of bitmaps is [ka] and X z 16. The method of claim 15, wherein z is the number of vectors of the third type in the set having index z of the vector of the third type.

[0085] Item 20. The method of item 1, wherein each of the D time domain units includes the same number of OFDM symbols or each of the D time domain units includes the same number of slots.

[0086] Clause 21. The method of any of clauses 1 to 20, wherein each set of vectors of the second type is specific to one of a layer, a set of layers, or all layers.

[0087] Clause 22. The method of any of clauses 1 to 21, wherein each set of vectors of the first type is unique to one of a set of layers, all layers, or a set of vectors of the third type.

[0088] Clause 23. The method of any of clauses 1 to 22, wherein the first type vector is one of a discrete Fourier transform (DFT) vector, a 2-D DFT vector, or a vector having only one element equal to 1 and other elements equal to 0.

[0089] Term 24. Vector of the second type with index n3, n3 ∈ {0, 1, …, C-1} [ka] Each kth element of [ka] 24. The method of any of claims 1 to 23, wherein k=0, 1, ..., C, and the second information includes information about n3.

[0090] Term 25. Each element of the third type of vector with index is [ka] or [ka] 23. The method of any of clauses 3 to 6, 8, 12, 14 to 15, 19 and 22, wherein t=0, 1, ..., D-1, and the third information includes information regarding u, and Q is an integer greater than or equal to 1.

[0091] Clause 26. The method of any one of clauses 1 to 25, wherein the size of one time domain unit is determined according to at least one of a subcarrier space or received signaling.

[0092] Clause 27. The method of clause 2, wherein the third information includes D sets of information about the coefficients, each of the D sets of information about the coefficients corresponding to one of the D time domain units and corresponding to C of the E precoding matrices.

[0093] Item 28. For each of the D time domain units, each l-th column of each of the C precoding matrices corresponding to the corresponding time domain unit is [ka] and v i is one of the vectors of the first type, [ka] is the k-th element of one of the vectors of the second type, [ka] corresponds to the frequency domain units with index k, k=0,1,…,C-1 and t=0,1,…,D-1, [ka] is the amplitude coefficient, [ka] are the phase coefficients, and one set of information about the coefficients corresponding to a time unit t is [ka] , and an index corresponding to one strongest coefficient per layer. The first information is v i The second information includes an index of [ka] 28. The method of claim 27, further comprising an index of

[0094] Clause 29. The method of clause 27, wherein the third information includes D sets of channel quality indicators (CQIs) or D sets of reference signal received powers (RSRPs).

[0095] Clause 30. The method of clause 27 or 29, wherein each of the D sets of at least one of information related to coefficients or CQI is reported within a respective one reporting time, or the D sets of at least one of information related to coefficients or CQI is reported within a one reporting time.

[0096] Item 31. The method of any of items 1 to 30, wherein the first information and the second information are periods reported using a first period, and the third information is periods reported using a second period.

[0097] Item 32. The method of item 31, wherein one first period includes D second periods.

[0098] Clause 33. A method according to any one of clauses 1 to 32, wherein the first information and the second information for all D time domain units are the same, each of the D time units corresponds to a respective third information, each of the D sets of third time information is reported within a respective reporting time, or the D sets of third time information are reported within one reporting time.

[0099] Clause 34. The method of clause 23, wherein the first information, the second information, and the third information for all D time domain units are the same.

[0100] Clause 35. A method of communication, the method including: determining, by a communication device, one or more channel status information reference signal resources; receiving, by the communication device, a channel status information reference signal on the one or more channel status information reference signal resources; and transmitting, by the communication device, to a first communication node, information regarding E channels between the communication device and a second communication node, where E is a positive integer.

[0101] Clause 36. The method of clause 35, wherein each of the E channels corresponds to one frequency domain unit and one time domain unit.

[0102] Section 37.E states: [ka] 37. The method of claim 36, wherein C is the number of frequency domain units and D is the number of time domain units.

[0103] Item 38. Each of the E channels has a format, the format being: [ka] At least one of U j is a fourth type vector containing R elements, where R is a positive integer, and V j 38. The method of claim 37, wherein k=k, k=0,1,...C-1 is a frequency domain unit index, t=0,1,...D-1 is a time domain unit index, rx=0,1,...R-1 are receive antenna port indexes at the communication device, and tx=0,1,...P-1 is a CSI-RS port for one of the one or more CSI-RS port resources.

[0104] Term 39. The method of term 37, wherein R is the number of receive antenna ports at the communication node.

[0105] Section 40.b k,j,t teeth, [ka] and having a format including [ka] is the amplitude coefficient, [ka] is the phase coefficient, [ka] is a vector of the third type [ka] The method according to claim 37, wherein the t-th element of [ka]

[0106] Section 41. [ka] and 39. The method of claim 38, wherein t=0, 1, ..., D-1, the third information includes information about u, and Q is an integer greater than or equal to 1.

[0107] Section 42. [ka] Item 39. The method according to item 38, wherein

[0108] Section 43. [ka] 40. The method of claim 39, wherein

[0109] Clause 44. An apparatus for wireless communication comprising a processor configured to perform the method of any of clauses 1 to 43.

[0110] Clause 45. A non-transitory computer readable medium having code stored thereon, the code, when executed by a processor, causing the processor to perform a method according to any one of clauses 1 to 43.

[0111] Some of the embodiments described herein are described in the general context of a method or process that may be implemented in one embodiment by a computer program product embodied in a computer-readable medium including computer-executable instructions, such as program code, executed by a computer in a network environment. The computer-readable medium may include removable and non-removable storage devices, including but not limited to read-only memory (ROM), random access memory (RAM), compact discs (CDs), digital versatile discs (DVDs), and the like. Thus, the computer-readable medium may include non-transitory storage media. Generally, program modules may include routines, programs, objects, components, data structures, and the like that perform particular tasks or implement particular abstract data types. Computer or processor executable instructions, associated data structures, and program modules represent examples of program code for executing steps of the methods disclosed herein. A particular sequence of such executable instructions or associated data structures represents examples of corresponding acts for implementing the functions described in such steps or processes.

[0112] Some of the disclosed embodiments can be implemented as devices or modules using hardware circuits, software, or a combination thereof. For example, hardware circuit implementations can include separate analog and / or digital components integrated, for example, as part of a printed circuit board. Alternatively or additionally, the disclosed components or modules can be implemented as application specific integrated circuits (ASICs) and / or field programmable gate array (FPGA) devices. Some implementations may additionally or alternatively include digital signal processors (DSPs), which are dedicated microprocessors with architectures optimized for the operational needs of digital signal processing related to the disclosed functionality of the present application. Similarly, the various components or subcomponents within each module may be implemented in software, hardware, or firmware. Connections between modules and / or components within a module may be provided using any one of the connection methods and mediums known in the art, including, but not limited to, communication via the Internet, wired, or wireless networks using appropriate protocols.

[0113] Although the specification contains many details, these should not be construed as limitations on the scope of the claimed invention or the invention that may be claimed, but rather as descriptions of features specific to particular embodiments. Certain features described herein in the context of separate embodiments can also be implemented in combination in a single embodiment. Conversely, various features described in the context of a single embodiment can also be implemented in multiple embodiments separately or in any suitable subcombination. Furthermore, although features may be described above as acting in a particular combination and initially claimed as such, one or more features from the claimed combination may, in some cases, be cut out of the combination, and the claimed combination may be directed to a subcombination or a variation of the subcombination. Similarly, although operations are shown in the figures in a particular order, this should not be understood as requiring that such operations be performed in the particular order shown, or in the sequential order, or that all of the operations shown be performed, to achieve desirable results.

[0114] Only some implementations and examples have been described; other implementations, extensions and variations can be made based on what is described and illustrated in this disclosure.

Claims

1. 1. A method of communication, the method comprising: determining, by the communications device, one or more channel status information reference signal resources; receiving, by the communications device, a channel status information reference signal on the one or more channel status information reference signal resources; reporting, by the communication device, channel state information to a communication node, the channel state information including first information regarding a set of vectors of a first type, second information regarding one or more sets of vectors of a second type, and third information corresponding to D time domain units; Including, each of the first type vectors includes P / 2 elements, where P is a number of channel status information reference signal ports of one of the one or more channel status information reference signal resources; and each second type vector includes C elements, each corresponding to one frequency domain unit; The method, wherein each of C and D is a positive integer, or at least one of C or D is a positive integer greater than 1.

2. 2. The method of claim 1, wherein E precoding matrices are determined according to the channel state information for C frequency domain units and D time domain units, where E is equal to or greater than one.

3. The method of claim 2 , wherein the third information includes information regarding one or more sets of vectors of a third type, each vector corresponding to one of the D time domain units.

4. 4. The method of claim 3, wherein each of the E precoding matrices is determined according to the one set of vectors of a first type, the one or more sets of vectors of a second type, and the one or more sets of vectors of a third type.

5. Each set of vectors of the third type is One layer, One vector of the first type, One vector of the second type, One set of layers, a set of vectors of the first type; or One set of vectors of the second type The method of claim 2 , wherein the at least one of the following is unique:

6. Each set of vectors of the third type is All layers, all vectors of the first type, or All vectors of the second type The method of claim 2 , wherein the at least one of the following is unique:

7. The method of claim 3 , wherein E is the product of C and D.

8. Each l-th column of each of the E preceding matrices is [Number 1-1] [Number 1-2] is represented by one of v ｉ is one of the vectors of the first type, [0025] is the k-th element of one of the second type vectors, [0030] is the t-th element of one of the vectors of the third type, [0045] corresponds to a frequency domain unit with index k, k=0, 1, ... C-1 and t=0, 1, ... D-1, a ｌ，ｉ，ｆ，ｘ are coefficients having amplitude and phase, [0050] is the amplitude coefficient, [006] 8. The method according to claim 3, wherein x is a phase coefficient and z is an index of one set of vectors of the third type. 【Request 9】 【Number 7】 teeth, [0080] The method of claim 8 , wherein the 【Request 10】 【Number 9】 teeth, [0089] or ##EQU00011## and Q is an integer equal to or greater than 1.

11. For each layer, the channel state information is divided into one strongest ##EQU00012## Index of ##EQU00013## and the channel state information is equal to 1. ##EQU00014## The method of claim 8 , wherein the amplitude value of

12. For each vector of the third type of each layer, the channel state information is ##EQU00015## Index of ##EQU00016## and the channel state information is equal to 1. ##EQU00017## The method of claim 8 , wherein the amplitude value of

13. For each layer, the channel state information is [0018] 9. The method of claim 8, further comprising a bitmap for indicating the reported elements of.

14. For each vector of the third type in each layer, the channel state information is [0019] 9. The method of claim 8, further comprising a bitmap for indicating the reported elements of.

15. For each set of third type vectors for each layer, the channel state information is [0020] 9. The method of claim 8, further comprising a bitmap for indicating the reported elements of.

16. One ##EQU00021## When a bit of the bitmap corresponding to [0022] and phase information [0023] is included in the channel state information, or One ##EQU00024## If a bit of the bitmap corresponding to [0025] and phase information [0026] is not included in the channel state information, 16. The method according to any one of claims 13 to 15.

17. The number of bitmaps is [0027] The method of claim 13, wherein

18. The number of bitmaps is [0028] The method of claim 14, wherein

19. The number of bitmaps is [0029] And X ｚ 16. The method of claim 15, wherein z is the number of vectors of the third type in the set having index z of the vector of the third type.

20. each of the D time domain units includes the same number of OFDM symbols; or each of the D time domain units includes the same number of slots; The method of claim 1.

21. Each set of vectors of the second type is One layer, One set of layers, or All Layers The method according to any one of claims 1 to 20, wherein the method is specific to one of the following:

22. Each set of vectors of the first type is One set of layers, All layers, or One set of vectors of the third type The method according to any one of claims 1 to 21, wherein the method is specific to one of the following:

23. The first type of vector is Discrete Fourier Transform (DFT) vector, a 2-D DFT vector, or Only one element is equal to 1 and the other elements are equal to 0 23. The method according to any one of claims 1 to 22, wherein

24. Index n ３ , n ３ The second type vector with ∈{0, 1, ..., C-1} [0030] Each k-th element of [0031] where k=0, 1, . . . , C, and the second information is n ３ The method according to any one of claims 1 to 23, comprising information regarding:

25. Each t-th element of the third type vector with index u is [0032] 23. The method of claim 3, wherein t=0, 1, ..., D-1, and the third information includes information about u, and Q is an integer equal to or greater than 1.

26. The method according to any of claims 1 to 25, wherein the size of one time domain unit is determined according to at least one of a subcarrier spacing or received signaling.

27. 3. The method of claim 2 , wherein the third information includes D sets of information about coefficients, each of the D sets of information about coefficients corresponding to one of the D time-domain units and corresponding to C of the E precoding matrices.

28. For each of the D time domain units, each l-th column of each of the C precoding matrices corresponding to the corresponding time domain unit is [Equation 33] and v ｉ is one of the vectors of the first type, [0034] is the k-th element of one of the second type vectors, [Equation 35] corresponds to a frequency domain unit with index k, k=0, 1, ..., C-1 and t=0, 1, ..., D-1, [0036] is the amplitude coefficient, [Equation 37] is a phase coefficient, and said one set of information about the coefficients corresponding to a time unit t is [Equation 38] and an index corresponding to one strongest coefficient per layer, the first information being ｉ and the second information includes an index of [0039] 28. The method of claim 27, further comprising an index of:

29. 28. The method of claim 27, wherein the third information comprises D sets of channel quality indicators (CQIs) or D sets of reference signal received powers (RSRPs).

30. Each of the D sets of at least one of information on coefficients or CQI is reported within a respective one of the reporting periods; or the D sets of at least one of information related to coefficients or CQI are reported within one reporting period; 30. The method of claim 27 or 29.

31. 31. The method of claim 1, wherein the first information and the second information are time periods reported using a first time period and the third information is time periods reported using a second time period.

32. 32. The method of claim 31 , wherein one first period includes D second periods.

33. 33. The method of claim 1, wherein the first information and the second information for all D time domain units are the same, each of the D time units corresponds to a respective third information, each of the D sets of third time information is reported within a respective reporting time, or the D sets of third time information are reported within one reporting time.

34. 24. The method of claim 23, wherein the first information, the second information, and the third information for all D time domain units are the same.

35. 1. A method of communication, the method comprising: determining, by the communications device, one or more channel status information reference signal resources; receiving, by the communications device, a channel status information reference signal on the one or more channel status information reference signal resources; transmitting, by said communication device, to a first communication node, information regarding E channels between said communication device and a second communication node, where E is a positive integer; A method comprising:

36. 36. The method of claim 35, wherein each of the E channels corresponds to one frequency domain unit and one time domain unit.

37. E is, [0040] 37. The method of claim 36, wherein C is a number of frequency domain units and D is a number of time domain units.

38. Each of the E channels has a format, the format comprising: [0041] and U ｊ is a fourth type vector containing R elements, where R is a positive integer, and V ｊ 38. The method of claim 37, wherein k=k, k=0, 1, ... C-1 is an index of the frequency domain unit, t=0, 1, ... D-1 is an index of the time domain unit, rx=0, 1, ... R-1 are receive antenna port indices at the communications device, and tx=0, 1, ... P-1 is a CSI-RS port of one of the one or more CSI-RS port resources.

39. 38. The method of claim 37, wherein R is the number of receive antenna ports at the communication node.

40. b ｋ，ｊ，ｔ teeth, [0042] and having a format including [0043] is the amplitude coefficient, [0044] is the phase coefficient, [0045] is a third type of vector [0046] The method of claim 37, wherein the t-th element of 【Request 41】 【Number 47】 39. The method of claim 38, wherein t=0, 1, ..., D-1, the third information includes information about u, and Q is an integer greater than or equal to 1. 【Request 42】 【Number 48】 39. The method of claim 38, wherein: 【Request 43】 【Number 49】 40. The method of claim 39, wherein:

44. An apparatus for wireless communication comprising a processor configured to perform a method according to any preceding claim.

45. 44. A non-transitory computer readable medium having code stored thereon, the code, when executed by a processor, causing the processor to perform a method according to any of claims 1 to 43.

Images