Encoding method and encoder for (n,n(n-1),n-1) permutation group code in communication modulation system
US11038738B2 · kind B2 · utility
Assignee
Inventors
Key dates
| Filing date | Dec 27, 2019 |
| Grant date | Jun 15, 2021 |
| Priority date | — |
| Expiry date | Dec 27, 2039 |
Classification
- Technology area (CPC H)Electricity
- CPC primaryH04L27/3416
- WIPO fieldDigital communication
- WIPO sectorElectrical engineering
Abstract
The present disclosure provides an encoding method and an encoder for a (n, n(n−1), n−1) permutation group code in a communication modulation system, in which 2k k-length binary information sequences are mapped to 2k n-length permutation codeword signal points in a n-dimensional modulation constellation Γn. The constellation Γn with the coset characteristics is formed by selecting 2k n-length permutation codewords from n(n−1) permutation codewords of a code set Pn,xof the (n, n(n−1), n−1) permutation group code based on coset partition. The constellation Γn is a coset code in which 2kcosets are included and each coset includes 2kpermutation codewords, where k=k1+k2, and 2k≤n(n−1). The present disclosure utilizes the coset characteristics to realize one-to-one correspondence mapping of the binary information sequence set to the permutation code constellation, so that the time complexity of executing the encoder is at most the linear complexity of the code length n.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.