公开(公告)号：US11374596B2

公开(公告)日：2022-06-28

申请号：US16727936

申请日：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

IPC: H03M13/37 ,  H03M13/00 ,  G06F17/11 ,  G06F17/00 ,  G06F17/16

Abstract: The disclosure discloses an algebraic decoding method and a decoder for a (n, n(n−1), n−1) permutation group code in a communication modulation system. The basic principle of the decoding method is: assuming that two code elements p(r1)=s1 and p(r2)=s2 can be correctly detected in a received real vector with a length of n, including their element values s1, s2 and position indices r1, r2 in the vector, an intermediate parameter w is determined by solving an equation (r1−r2)w=(s1−s2)(mod n); and each code element is calculated by w according to p(i)=(s1+(n−r1+i)w)(mod n), i=1, 2, . . . , n. The decoder is mainly composed of multiple n-dimensional registers, a w calculator, n code element calculators, and a code element buffer. In the disclosure, in a case where a receiver only correctly detects two code elements in a transmitted codeword with a length of n, the codeword can be correctly decoded by using the received information of the two code elements.

公开(公告)号：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.

公开(公告)号：US10763896B2

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

申请号：US16263947

申请日：2019-01-31

Applicant: HUAZHONG UNIVERSITY OF SCIENCE AND TECHNOLOGY

Inventor： Li Peng ,  Gaofeng Li ,  Jiaolong Wei ,  Kun Liang ,  Bo Zhou

IPC: H03M13/15 ,  H03M13/03 ,  H03M13/00 ,  H04L12/935 ,  H04B3/54

Abstract: A construction method for a (n,n(n−1),n−1) permutation group code based on coset partition is provided. The presented (n,n(n−1),n−1) permutation group code has an error-correcting capability of d−1 and features a strong anti-interference capability for channel interferences comprising multi-frequency interferences and signal fading. As n is a prime, for a permutation code family with a minimum distance of n−1 and a code set size of n(n−1), the invention provides a method of calculating n−1 orbit leader permutation codewords by On={αo1}α=1n-1(mod n) and enumerating residual codewords of the code set by Pn=CnOn={(l1)n-1On}={(rn)n-1On}. Besides, a generator of the code set thereof is provided. The (n,n(n−1),n−1) permutation group code of the invention is an algebraic-structured code, n−1 codewords of the orbit leader array can be obtained simply by adder and (mod n) calculator rather than multiplication of positive integers. Composition operations of the cyclic subgroup Cn acting on all permutations oα of the orbit leader permutation array On are replaced by well-defined cyclic shift composite operation functions (l1)n-1 and (rn)n-1 so that the action of the cyclic group acting on permutations is realized by a group of cyclic shift registers.

公开(公告)号：US10230397B2

公开(公告)日：2019-03-12

申请号：US15060111

申请日：2016-03-03

Applicant: HUAZHONG UNIVERSITY OF SCIENCE AND TECHNOLOGY

Inventor： Li Peng ,  Gaofeng Li ,  Jiaolong Wei ,  Kun Liang ,  Bo Zhou

IPC: H03M13/15 ,  H03M13/00 ,  H04L12/935 ,  H04B3/54

Abstract: A construction method for a (n,n(n−1),n−1) permutation group code based on coset partition is provided. The presented (n,n(n−1),n−1) permutation group code has an error-correcting capability of d−1 and features a strong anti-interference capability for channel interferences comprising multi-frequency interferences and signal fading. As n is a prime, for a permutation code family with a minimum distance of n−1 and a code set size of n(n−1), the invention provides a method of calculating n−1 orbit leader permutation codewords by On={αo1}α=1n−1(mod n) and enumerating residual codewords of the code set by Pn=CnOn={(l1)n−1On}={(rn)n−1On)}. Besides, a generator of the code set thereof is provided. The (n,n(n−1),n−1) permutation group code of the invention is an algebraic-structured code, n−1 codewords of the orbit leader array can be obtained simply by adder and (mod n) calculator rather than multiplication of positive integers. Composition operations of the cyclic subgroup Cn acting on all permutations oα of the orbit leader permutation array On are replaced by well-defined cyclic shift composite operation functions (l1)n−1 and (rn)n−1 so that the action of the cyclic group acting on permutations is realized by a group of cyclic shift registers.

公开(公告)号：US20200287570A1

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

申请号：US16727936

申请日：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

IPC: H03M13/37 ,  G06F17/11 ,  G06F17/16

Abstract: The disclosure discloses an algebraic decoding method and a decoder for a (n, n(n−1), n−1) permutation group code in a communication modulation system. The basic principle of the decoding method is: assuming that two code elements p(r1)=s1 and p(r2)=s2 can be correctly detected in a received real vector with a length of n, including their element values s1, s2 and position indices r1, r2 in the vector, an intermediate parameter w is determined by solving an equation (r1−r2)w=(s1−s2)(mod n); and each code element is calculated by w according to p(i)=(s1+(n−r1+i)w)(mod n), i=1, 2, . . . , n. The decoder is mainly composed of multiple n-dimensional registers, a w calculator, n code element calculators, and a code element buffer. In the disclosure, in a case where a receiver only correctly detects two code elements in a transmitted codeword with a length of n, the codeword can be correctly decoded by using the received information of the two code elements.

公开(公告)号：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.