Codebook searching method and device
A search method and codebook technology, applied in the field of codebook search methods and devices, can solve problems such as ineffective application and increased computational complexity
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment 1
[0048] This embodiment provides a codebook search method, such as figure 1 As shown, the processing flow of the method of this embodiment includes the following steps:
[0049] Step 101. Search for the first optimal precoding matrix from the precoding matrix set.
[0050] Usually, a codebook is a set of several precoding matrices, that is, a set of precoding matrices, which can be expressed as C={W 0 ,W 1 ,...,W i ,...,W N-1}, and 0≤i≤N-1, the N is the number of precoding matrices in the set of precoding matrices; in the initial case, the codebook search device will search out the first The optimal precoding matrix of order 1.
[0051] Here, the codebook search device may use a traversal search method or other search methods to search all the precoding matrices in the precoding matrix set, and search for the first optimal precoding matrix from the precoding matrix set .
[0052] Optionally, the codebook search device can use the traversal search method to search for the...
Embodiment 2
[0093] The embodiment of the present invention also provides a codebook search device, such as figure 2 As shown, the device includes: a search unit 201 and a determination unit 202, wherein,
[0094] The search unit 201 is configured to search for the first optimal precoding matrix from the precoding matrix set;
[0095] The determining unit 202 is configured to determine the nth codebook search subset according to the n-1th optimal precoding matrix and the nth chord distance level searched by the searching unit 201; The nth codebook search subset is a subset of the precoding matrix set;
[0096] The searching unit 201 is further configured to search for an n-th optimal precoding matrix from the n-th codebook search subset determined by the determining unit 202; wherein, the n is 2, ..., m, the m is an integer greater than or equal to 2.
[0097] Optionally, the determining unit 202 is specifically configured to determine the n-th optimal precoding matrix and the n-th cho...
Embodiment 3
[0110] The embodiment of the present invention also provides a codebook search device, such as image 3 As shown, the device includes: a storage module 301, a codebook search selection module 302, a channel time correlation evaluation module 303, and a codebook search subset determination module 304; wherein,
[0111] The storage module 301 is configured to pre-store a corresponding relationship, and the corresponding relationship is a corresponding relationship between a precoding matrix index, a chordal distance level, and a codebook search subset;
[0112] The codebook search and selection module 302 is configured to search for the first optimal precoding matrix from the precoding matrix set;
[0113] The channel time correlation evaluation module 303 is used to monitor the channel time correlation index in real time and calculate the channel time correlation index value for the nth time;
[0114] The codebook search subset determination module 304 determines the nth chord...
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