公开(公告)号：US20200287774A1

公开(公告)日：2020-09-10

申请号：US16727944

申请日：2019-12-27

Applicant: HUAZHONG UNIVERSITY OF SCIENCE AND TECHNOLOGY

Inventor： Li Peng ,  Si Jia Chen ,  Ying Long Shi ,  Ya Yu Gao ,  Bin Dai ,  Lin Zhang ,  Kun Liang ,  Bo Zhou ,  Zhen Qin

IPC: H04L27/36

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,xi of the (n, n(n−1), n−1) permutation group code based on coset partition. The constellation Γn is a coset code in which 2k1 cosets are included and each coset includes 2k2 permutation 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.

公开(公告)号：US11038738B2

公开(公告)日：2021-06-15

申请号：US16727944

申请日：2019-12-27

Applicant: HUAZHONG UNIVERSITY OF SCIENCE AND TECHNOLOGY

Inventor： Li Peng ,  Si Jia Chen ,  Ying Long Shi ,  Ya Yu Gao ,  Bin Dai ,  Lin Zhang ,  Kun Liang ,  Bo Zhou ,  Zhen Qin

IPC: H04L27/36 ,  H03M7/30 ,  H03M7/40

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,xi of the (n, n(n−1), n−1) permutation group code based on coset partition. The constellation Γn is a coset code in which 2k1 cosets are included and each coset includes 2k2 permutation 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.