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

公开(公告)号：US10396381B2

公开(公告)日：2019-08-27

申请号：US15312056

申请日：2016-06-03

Applicant: HUAZHONG UNIVERSITY OF SCIENCE AND TECHNOLOGY

Inventor： Xi Li ,  Jianhua Jiang ,  Zhonghua Deng ,  Lin Zhang ,  Jian Li

IPC: H01M8/04992 ,  H01M8/043 ,  H01M8/04828 ,  H01M8/0432 ,  H01M8/04746 ,  G05B11/01 ,  H01M8/04537 ,  H01M8/124

Abstract: The present invention provides a thermoelectric cooperative control method for the SOFC system based on fractional order sliding mode variable structure, comprising the following steps: S1, collecting parameters of system states and output under combinations of different input parameters of the SOFC system, acquiring an influence function of steady-state power, temperature, efficiency response characteristics and bypass valve opening BP within a full load interval on efficiency optimization, as well as an efficiency optimization function within a specified load switching interval and under a time-delay condition; S2, acquiring a local optimal steady-state operation function, a global optimal function under the steady state developed and formed, and a power tracking function with different switching intervals and different time-delay conditions; S3, calculating a sliding mode interval; S4, calculating a series reaching law function according to optimization functions; S5, eliminating chattering of the series reaching law function through a fractional order optimization method, and solving the reaching law by calculation. The present method can provide precise, flexible and stable control, greatly speed up the switch process, overcome time-delay feature of the great inertia of the SOFC system, and realize fast load switching.

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

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