Algebraic decoding method and decoder for (n,n(n-1),n-1)-PGC in communication modulation system
US11374596B2 · kind B2 · utility
Assignee
Inventors
Key dates
| Filing date | Dec 27, 2019 |
| Grant date | Jun 28, 2022 |
| Priority date | — |
| Expiry date | Nov 3, 2040 |
Classification
- Technology area (CPC H)Electricity
- CPC primaryH03M13/47
- WIPO fieldBasic communication processes
- WIPO sectorElectrical engineering
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.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.