Channel state information compression method and device
A technology of channel state information and state transition, applied in the field of communication, can solve problems such as low compression rate, and achieve the effects of enhancing dynamic adjustment, improving coding efficiency, and reducing coding length
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment 1
[0030] see figure 2 , a method for channel state information compression, the specific steps are as follows:
[0031] Step 101, searching for a replaced codeword from the Huffman coding codebook, the occurrence probability of the replaced codeword is less than a preset threshold;
[0032] Wherein, the Huffman coding codebook includes state transitions between quantization results of channel state information and corresponding codewords.
[0033] Step 102, calculate the Euclidean distance between the replaced codeword and other codewords in the Huffman codebook, and select a replacement codeword according to the calculation result, and the replacement codeword is the code with the smallest Euclidean distance to the replaced codeword Character;
[0034] Step 103, in the Huffman coding codebook, use the replacement codeword to replace the replaced codeword, and add the occurrence probability of the replaced codeword to the occurrence probability of the replacement codeword to ...
Embodiment 2
[0083] see Figure 5 , a device for compressing channel state information, the device comprising: a search module 30, a calculation selection module 31, a codebook processing module 32 and an encoding module 33;
[0084] A search module 30, configured to search for a replaced codeword from the Huffman codebook, the probability of occurrence of the replaced codeword being less than a preset threshold;
[0085] Wherein, the Huffman coding codebook includes state transitions between quantization results of channel state information and corresponding codewords.
[0086] Calculation and selection module 31 is used to calculate the Euclidean distance between the replaced codeword obtained in the search module 30 and other codewords in the Huffman codebook, and selects the replacement codeword according to the calculation result, and the replacement codeword is the same as The codeword with the smallest Euclidean distance of the replaced codeword;
[0087] The codebook processing m...
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