Multiplication-free quasi-cyclic matrix serial multiplier for WPAN (wireless personal area network)

Abstract

The invention provides a multiplication-free quasi-cyclic matrix serial multiplier for a WPAN (wireless personal area network). The multiplier is used for multiplication of a vector m and a quasi-cyclic matrix F during approximate lower triangle encoding of QC-LDPC (quasic-low-density parity-check) codes with a 1 / 2 code rate under the standard of WPAN and comprises two generator polynomial lookup tables used for prestoring cyclic matrix generator polynomials and 21-bit null vectors in 1 / 2 code rate matrix F, two 21-bit binary adders for performing modulo-two adding on generator polynomial lookup table output and shift register content and two 21-bit shift registers for storing results obtained after cyclic shift left of the sum of 21-bit binary adders for one bit respectively. According to the quasi-cyclic matrix serial multiplier, multiplication is eliminated, and the quasi-cyclic matrix serial multiplier has the advantages of few logic resources, simple structure, low power consumption, low cost and the like.

Description

technical field [0001] The invention relates to the field of channel coding, in particular to a quasi-circular matrix serial multiplier in WPAN standard 1 / 2 code rate QC-LDPC approximate lower triangular coding. Background technique [0002] Low-Density Parity-Check (Low-Density-Parity-Check, LDPC) code is one of efficient channel coding techniques, and QC-LDPC (Quasic-LDPC, QC-LDPC) code is a special LDPC code. Both the generation matrix G and the check matrix H of the QC-LDPC code are arrays composed of circulant matrices, which have the characteristics of a segmented cycle, so they are called QC-LDPC codes. The first row of the circulant matrix is ​​the result of the cyclic right shift of the last row by 1 bit, and the remaining rows are the result of the cyclic right shift of the previous row by 1 bit. Therefore, the circulant matrix is ​​completely characterized by its first row. Usually, the first row of a circulant matrix is ​​called its generator polynomial. [000...

AI Technical Summary

Problems solved by technology

One of the disadvantages of this scheme is that a large number of registers are required, which will inevitably lead to large power consumption and high cost of the circuit.

Images