Multi-ary code modulation mapping method and device
A modulation mapping and multivariate technology, applied in the field of communication, which can solve the problems of unbalanced reliability and low reliability.
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment 1
[0124] Such as figure 1 As shown, this embodiment provides a multi-ary code modulation mapping method, the method comprising:
[0125] Step S110: Perform multivariate domain encoding on the first sequence including K multivariate code words to obtain a second sequence including N multivariate code words; wherein, said N=K / u, and said K is not less than 1 is an integer, the u is a code rate, and the value is a positive number not greater than 1;
[0126] Step S120: Calculate K according to the number of elements in the multivariate field q and the modulation order M 1 and K 2 ; where K 1 * log 2 q=K 2 * log 2 M, and the K 1 and K 2 Both are integers not less than 2, and both q and M are powers of 2; the number of elements in the multivariate field is the total number of multivariate code words in the multivariate field;
[0127] Step S130: put the second sequence in K 1 multi-element code word is a group, is divided into z multi-element code groups; Wherein, said ...
example 1
[0205] This example is an application example of the multi-ary code modulation mapping method based on direct full mapping. Such as figure 2 with image 3 As shown, the first sequence is A 0 ,A 1 ,...,A K-1 Including K multi-code codewords; where A l Represents a multi-element code word; said l is a natural number smaller than K. Natural numbers include zero and positive integers. The first sequence is subjected to GF (8) low-density parity check (Low-density Parity-check, LDPC) coding, obtains the second sequence B comprising N multi-code codewords 0 ,B 1 ,...,B N-1 . Wherein, the size of N depends on K and the code rate of the multi-element field coding.
[0206] Let α be the primitive element on the Gala field GF(q)(q>2), α -∞ =0, each power of α 0 =1,α,…,α q-2 constitutes all the field elements on the GF(q) field, and these field elements form a cyclic group. By using primitive polynomial transformation, each power of α can be transformed into p=log of α 2 ...
example 2
[0223] This example is a specific application example based on one of the I / Q way mapping methods.
[0224] Such as Figure 4 with Figure 5 As shown, the first: will include the first sequence A of K multi-code codewords 0 ,A1 ,...,A K-1 Carry out GF (64) LDPC encoding, obtain the second sequence B of N multiple code code words 0 ,B 1 ,...,B N-1 .
[0225] Second: If it is necessary to perform 16QAM modulation mapping on the codeword sequence of the multivariate code, q=64, M=16, K is calculated by formula (1) and formula (2) 1 = 2,K 2 =3; Among them, the formula (1):
[0226]
[0227] Formula (2): K 2 = K 1 *p / m.
[0228] The third: add behind the second sequence comprising N multi-code codewords zero codewords, and then add the back length to the back The multi-element code code word sequence is grouped by 2 multi-element code code words.
[0229] Fourth: the 2 encoded GF(64) domain multi-code codewords [C i,0 C i,1 ], where the jth GF(64) domain multi-...
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