PATENT CLAIM ANALYSIS

Application Number: 16009185
Application Type: Utility
Filing Date: 2018-06
Publication Date: 2018-10
Patent Classification: ["370", "329000"]

Abstract:
This application discloses a downlink channel reconstruction method and apparatus. In one embodiment, the method includes: sending, by a base station, multiple different weighted pilot signals to a terminal, where each of the weighted pilot signals includes a product of a pilot signal and a weighting matrix; receiving, by the base station, multiple different optimal code words returned by the terminal, where each of the optimal code words is obtained based on a channel estimation of a weighted pilot signal; and reconstructing, by the base station, a downlink channel according to the multiple different optimal code words. According to the foregoing method, a quantization error can be reduced, so that a beam direction of a reconstructed channel correctly points to the terminal.

Claim (Index 16):
The apparatus according to  claim 9 , wherein the programming instructions further instruct the processor to:\n constructing multiple real vectors b t  according to matrices corresponding to the multiple different optimal code words returned by the terminal, wherein\n b t =[e 1 ,L,e N T ,f 1,2 ,g 1,2 L,f 1,N T ,g 1,N T ,f 2,3 ,g 2,3 L,f 2,N T ,g 2,N T ,L,f N T \u22121 ,g N T \u22121,N T ] T , \n k and l are free variables, e k =|a t,k | 2 , f k,l =2R(a t,k *a t,l ), g k,l =\u22122I(a t,k *a t,l ), R(g) represents an operation of obtaining a real part of a complex number, I(g) represents an operation of obtaining an imaginary part of a complex number, [a t,l ,L,a t,N T ] T =Q s(t) w(t), t is a time at which a weighted pilot signal is sent, Q s(t)  is a weighting matrix used for the weighted pilot signal that is sent at time t, and w(t) is a precoding matrix corresponding to an optimal code word that is returned by the terminal according to the weighted pilot signal sent at time t; forming a linear function (1) according to the multiple real vectors b t , and solving the linear function (1) to obtain a vector X=[x 1  L x N T 2 ] T , wherein [ b t L b t - T + 1 ] T \ue8a0 [ x 1 M x N T 2 ] = [ \u03b3 ^ t M \u03b3 ^ t - T + 1 ] , ( 1 ) \u0177 is a quantized value of \u03b3, \u03b3 = P N 0 \ue89e w H \ue89e H H \ue89e Hw , P is a transmit power of the base station, N o  is a downlink-noise interference power measured by the terminal, w = max w i \u2208 W \ue89e w i H \ue89e H H \ue89e Hw i , W={w 0 ,L, w L-1 } is a precoding codebook, L is a quantity of precoding matrices w i  in the precoding codebook, H={h 0 ,L, h N T }, and h i  represents a channel from an antenna port i of the base station to each antenna of a user; and\n reconstructing a downlink channel {circumflex over (R)} according to the vector X={x 1  L x N T 2 } T , wherein \n R ^ = [ r ^ 1 , 1 r ^ 1 , 2 L r ^ 1 , N T r ^ 1 , 2 * r ^ 2 , 2 L r ^ 2 , N T M M O M r ^ 1 , N T * r ^ 2 , N T * L r ^ N T , N T * ] ; a diagonal element of {circumflex over (R)} is {circumflex over (r)} k,k =x k ; an upper triangular element of {circumflex over (R)} is {circumflex over (r)} k,l =x p(k,l) +j\u00b7x p(k,l)+1 ,k=1,L,N T \u22121;k<l; p(k,l)=N T +(2N T \u2212k)(k\u22121)+2(l\u2212k\u22121)+1, where k and l are free variables, and N T  is a quantity of antenna ports of the base station; and a lower triangular element of {circumflex over (R)} and an upper triangular element of {circumflex over (R)} are conjugately symmetrical around a diagonal.

Metadata:
- Claim Count in Document: 32.0
- Percentile: 94.0
- Lexical Diversity: 2.20635
- Patent Class: 370.0
- Transitional Phrase Type: none
- Component Type: 0
- Foreign Priority: True
- Related Applications: ['12937521', '15503677', '15371840', '15326218', '12477255']

Analysis Scores:
- 35 USC 101 Eligibility (BERT): 0.5929956439114225
- 35 USC 102 Novelty (BERT): 0.5036977085448526
- Combined Prediction Score: 0.5840658503747654
- Mean Citation Score: 221.723384
- Max Citation Score: 228.8104
- Similarity Product: 141.23607555856702

Labels:
- Claim Label 101: 1
- Claim Label 102: 1
- Claim Label 103: 1
- Claim Label 112: 1
- Combined Label: 1
- Label 101 Adjusted: 1

Dataset: test