Patents
Literature
2 results about "Irreducible polynomial" patented technology
Efficacy Topic
Property
Owner
Technical Advancement
Application Domain
Technology Topic
Technology Field Word
Patent Country/Region
Patent Type
Patent Status
Application Year
Inventor
In mathematics, an irreducible polynomial (or prime polynomial) is, roughly speaking, a non-constant polynomial that cannot be factored into the product of two non-constant polynomials. The property of irreducibility depends on the nature of the coefficients that are accepted for the possible factors, that is, the field or ring to which the coefficients of the polynomial and its possible factors are supposed to belong.
Decoding method, encoding method, device, chip and computing device
The application provides a decoding method, an encoding method, a device, a chip and a computing device. The method comprises the following steps: a decoding device acquires a first matrix, and then decodes a first code word vector according to the first matrix to obtain a decoding result. The first matrix is a 0-1 matrix representing elements in a second matrix on a polynomial ring. The second matrix is a check matrix on a finite field 2q, and the number of rows is r and the number of columns is n. A first polynomial corresponding to the polynomial ring is a q-th irreducible polynomial on a binary field. The number of 1s in the first matrix is less than the number of 1s in the 0-1 matrix representation of the second matrix. The first code word vector comprises k information code elements and r check code elements, and n=k+r. Each code element comprises q data units, and each data unit comprises at least one bit. The scheme can effectively reduce the hardware implementation complexity and cost of RS encoding and decoding.
Owner:HUAWEI TECH CO LTD
Decoding method and apparatus, encoding method and apparatus, and chip and computing device
Provided in the present application are a decoding method and apparatus, an encoding method and apparatus, and a chip and a computing device. The decoding method comprises: a decoding apparatus acquiring a first matrix, and then decoding a first codeword vector on the basis of the first matrix to obtain a decoding result, wherein the first matrix is a 0-1 matrix in which elements in a second matrix are represented on a polynomial ring, the second matrix is a check matrix having r rows and n columns on a finite field 2q, a first polynomial corresponding to the polynomial ring is an irreducible polynomial of a degree q on a binary field, and the number of "1"s in the first matrix is less than the number of "1"s in a 0-1 matrix representation of the second matrix; and the first codeword vector comprises k information symbols and r check symbols, where n=k+r, each symbol comprises q data units, and each data unit comprises at least one bit. The solution of the present application can effectively reduce the hardware implementation complexity and overheads of RS encoding and decoding.
Owner:HUAWEI TECH CO LTD