CSI feedback method for large-scale MIMO system based on compressed sensing
A compressed sensing, large-scale technology, applied in the field of CSI feedback, can solve the problem of wasting measurement overhead
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
example 1
[0078] Example 1: The "sorting" example described is as follows:
[0079] Suppose N=16, S=4, then H can be expressed as H=h 1 ,h 2 ,..., h 16 T . In particular, the number N of BS antennas in an actual massive MIMO system is hundreds to thousands, and only N=16 is considered here for the convenience of writing. Among the elements of H, except h 3 ,h 6 ,h 10 ,h 14 Except for 4 elements, the other elements are all 0, that is, the support set w=3, 6, 10, 14. Suppose h 3 ,h 6 ,h 10 ,h 14 The value is
[0080] h 3 = 0.3 + j 0.25 h 6 = 0.05 - j ...
example 2
[0087] Example 2: An example of the described search "preserve sparsity" λ is as follows:
[0088] On the basis of Example 1, assuming γ=0.9, then we have
[0089]
[0090] Therefore, it can be seen that the "reserved sparsity" λ=3.
[0091] b) The MS calculates the "required measurement number" M, and then compresses the downlink CSI (that is, H) that needs to be fed back according to the compressed sensing method; the specific process is as follows:
[0092] The "required number of measurements" M mentioned in b1) is calculated according to the following formula.
[0093] M = m a x { μlog 2 N , Cλlog 2 ( N λ ) }
[0094] Among them, the "reserved sparsity" λ is obtained according to step a3), N is the number of BS antennas, C is ...
example 3
[0111] Example 3: The generation example of the "partial supporting set bitstream" G is as follows:
[0112] Suppose N=8, S=3, λ=1, thereby
[0113] [ log 2 ( N ! S - λ ! N + λ - S ! ) ] = 5
[0114] Therefore, the with 5 bits b 5 b 4 b 3 b 2 b 1 According to the mapping method from small to large (that is, 1, 2 is mapped to 00000, 1, 3 is mapped to 00001, ..., 2, 3 is mapped to 00111, ..., 7, 8 is mapped to 11011) to encode "partial support set bitstream" For G=10000 (ie b 5 b 4 b 3 b 2 b 1 = 10000).
[0115] c13) Quantize the sparsity S into a "sparsity bit stream" (denoted as S).
PUM
Login to View More Abstract
Description
Claims
Application Information
Login to View More - R&D
- Intellectual Property
- Life Sciences
- Materials
- Tech Scout
- Unparalleled Data Quality
- Higher Quality Content
- 60% Fewer Hallucinations
Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.
© 2025 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com
