Large-scale MIMO pre-coding method based on Chebyshev iterative method
A technology of Chebyshev and iterative method, which is applied in the field of massive MIMO precoding, can solve the problem of increasing complexity of inverse matrix solution, and achieve the effect of low computational complexity
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment Construction
[0032] The specific implementation will be described in detail below.
[0033] step 1)
[0034] Assuming the channel is a slow fading channel, the channel matrix is modeled as:
[0035] H=[h 1 , h 2 ,...,h K ] (1)
[0036] Among them, the number of transmitting antennas of the base station is M, and the number of single-antenna users is K. h k Indicates the kth channel vector, h k ~CN(0 M×1 ,Φ) means h k subject to mean 0 M×1 distribution with variance Φ, 0 M×1 Represents a 0 matrix with M rows and 1 column, Φ is the coherence matrix of the channel, with a bounded spectral norm
[0037] The channel matrix estimated by CSI is:
[0038]
[0039] In the formula, z k yes with h k Independent and identically distributed channel estimation noise, z k ~CN(0 M×1 , Φ), τ represents the quality of channel estimation, if the value of τ is 0, it means that the channel matrix estimated by the base station is the same as the actual channel, when the value of τ is 1, t...
PUM
Abstract
Description
Claims
Application Information
- R&D Engineer
- R&D Manager
- IP Professional
- Industry Leading Data Capabilities
- Powerful AI technology
- Patent DNA Extraction
Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.
© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com