34results about How to "Low decoding complexity" patented technology

The invention discloses a hybrid automatic repeat request transmission method based on a polarization code. The hybrid automatic repeat request transmission method based on the polarization code comprises the following steps: after a coding bit sequence obtained after polarization coding is carried out to a sent information bit sequence is punched via a sending end, sending into a channel to be transmitted; decoding a received signal by a receiving end for CRC (cyclic redundancy check); if the received signal passes the check, feeding back an ACK (acknowledgement character) signal to the sending end, and otherwise, sending a NACK (negative acknowledgement) signal; if the sending end receives the NACK signal, sending one part of uncoded information bits to a receiving end again; according to the coding bit received for the first time and a newly-received information bit, decoding again by the receiving end; if a decoding result still does not pass the CRC, sending the other part of uncoded information bits to the receiving end again by the sending end; according to the coding bit received for the first time, the information bit received in the previous time and the newly-received information bit, decoding again by the receiving end; continuously executing the process; and finishing one whole transmission process until the sending end receives the ACK signal or the number of sending times reaches a preset maximum value.

The invention discloses a pre-coding method, a system and a device in a MIMO system. The method, the system and the device which are related to by the invention can be applied in the orthogonal space-time coding circumstance. The inventive method adopts a non-unitary matrix for pre-coding, and the non-unitary matrix is obtained by judging the obtained optimal pre-coding vector construction. The inventive system includes a transmitter and a receiver, wherein, the transmitter includes a code list, a pre-coding matrix construction unit and a pre-coding unit; the receiver includes a channel estimation unit, the code list and a judgement unit. The simulation and the analysis show that, compared with the prior art, the usage of the inventive proposal can lower the bit error rate and reduce the complexity of decoding simultaneously in the situation of the same signal-to-noise ratio.

The invention discloses a method for constructing an eIRA-like quasi-cyclic low-density parity-check (LDPC) code check matrix and belongs to the field of communication channel encoding and decoding. On the basis of an LDPC code check matrix with a cyclic structure, the method for constructing the eIRA-like quasi-cyclic low-density parity-check (LDPC) code check matrix is provided by referring to an eIRA code check matrix in term of the thought of increasing the minimum girth. Furthermore, the shortest girth in the eIRA code check matrix is further increased by a short girth eliminating algorithm, so that a process with relatively high complexity of searching an eIRA code by a computer is eliminated.

The invention relates to a matrix partitioning-based realizing method of a high-speed LDPC encoder, which pertains to the technical field of channel coding. The method of the invention comprises the following specific steps that: (1) an LDPC code provided with a partitioning check matrix is constructed; firstly, a check matrix is constructed by using an algebraic approach; the check matrix has no circlet so as to guarantee the performance of the constructed code word; and then the rows of the check matrix are rearranged according to a certain rule to lead the rearranged check matrix to have the partition structure; (2) under a state that the check matrix of the LDPC code has the partition structure, the high-speed parallel decoding of the LDPC code is realized. The realizing method of the invention can realize the high-speed parallel decoding of the LDPC code in engineering; the complexity of the decoding is very low and the constructed code word has no circlet but good performance which is comparable to that of the code word which is constructed randomly.

The invention discloses a dual recursion based block Markov superposition encoding method. The method includes the following steps: taking an error correction code C[n, k] of which the code length isn and the information bit length is k as a basic code, and encoding an information sequence u of which the length is K=kL into a codeword c of which the length is N=n(L+T); the encoding method furtherincludes the following steps: firstly, dividing the information sequence u of which the length is kL into L equal-length packets u, that is expressed as u=(u(0), u(1),..., u(L-1)), wherein the lengthof each packet is k; for the time t=-1, -2, ..., -m1, setting a sequence w1(t) of which the length is n to a full-zero sequence; for the time t=-1, -2, ..., -m2, setting a sequence w2(t) of which thelength is n to the full-zero sequence; and then, at the time t=0, 1, ..., L-1, transmitting the sequence formula 1 (as shown in the original document) of which the length is k to an encoder ENC of the basic code C[n, k] for encoding, further obtaining a sequence formula 2 (as shown in the original document) of which the length is n, and combining a formula 3 and a formula 4 (as shown in the original document) that are fed back to calculate the t-th sub-sequence c(t) of the codeword c. The scheme of the invention has the advantages of simple encoding, low decoding complexity, channel capacityapproximability and the like, and compared with a traditional block Markov superposition encoding method, the scheme of the invention has a lower decoding error floor and lower decoding complexity.

The invention discloses a relay transmission method applied to a multiple access relay network and mainly solves the problems of low relay node forwarding efficiency and high destination node decoding complexity in the prior art. The method comprises the following implementation steps: N source nodes broadcast respective transmit signals to a relay node and a destination node; the relay node firstly carries out Turbo decoding on received signals, then judges if decoded estimation information sequences are correct, carries out Turbo coding and network coding modulation on the correct estimation information sequences and finally selects corresponding data from network coding modulation sequences to constitute transmitting sequences so as to complete the forwarding within a time slot; and a destination node respectively decodes signals corresponding to an error decoding set and a correct decoding set. The relay transmission method disclosed by the invention can be used for realizing effective compromise between the relay node forwarding efficiency and the destination node decoding performance, has the advantage of low complexity of decoding and can be applied to a wireless multiple access relay network.

The invention discloses a circular view finding graphic quick response code and generation and interpretation methods thereof. The quick response code comprises a view finding graph composed of threebig black circles and a matrix composed of small black circles, and the circular centers of three big black circles form an isosceles right triangle. The generation method of the quick response code comprises the steps that a data stream is converted into a byte stream, coding is carried out, the size of the quick response code is determined, the view finding graph is arranged and converted into amatrix, the matrix is arranged, and a quick response code image is generated. The interpretation method of the quick response code comprises the steps that the quick response code image is scanned and processed, the view finding graph is searched for, the quick response code is corrected and converted into a 0/1 matrix, the matrix is decoded and interpreted into data information, and interpretation is completed. Both the view finding graph and the matrix are circular, the structure is simple, an anti-fuzziness performance is high, identification is easy, a Hough transformation algorithm can be used for detection, and the decoding speed is improved. LDPC in intermediate and short code lengths are used for coding, and the error correction performance is higher than that of an RS algorithm.

The invention discloses a short code length block code decoder device based on two finite group symbols, and belongs to the error control coding field of digital communications. The decoder device disclosed by the invention comprises a control circuit, an input buffer unit, an output buffer unit and a decoding calculation unit, wherein the decoding calculation unit is the core part of the decoder and comprises a prior probability generation circuit, a prior probability storage unit, a posterior probability calculation circuit and a sequencing decision circuit which are connected in sequence. The prior probability generation circuit uses a plurality of basic units which are connected in sequence, has a regular structure, and is convenient for the circuit realization; the prior probability storage unit realizes data interleaving through a read-write address and is relatively low in complexity; and both the posterior probability calculation circuit and the sequencing decision circuit use a realizing method which is relatively low in complexity. In conclusion, the short code length block code decoder device based on two finite group symbols is realized, the complexity of the hardware is relatively low, and the performance is good.

The invention discloses a transmission and decoding method based on a gold code applied to an MIMO downlink system. The method comprises the following steps of 1, designing a pre-coding codebook; 2, selecting a pre-coding codebook; 3, sending a signal by a base station through using pre-coding; 4, receiving a signal matrix Y by a user side; and 5, decoding the signal matrix Y. The method providedby the invention has the beneficial effect as follows: the gold code generally adopts an ML decoding method, and the decoding complexity is relatively high. When r is equal to 1, the scheme provided by the invention has linear decoding complexity and can achieve a full rate, that is to say a signal symbol is sent at a time. When r is equal to 2, the decoding complexity of the joint decoding methodprovided by the invention can be adjusted via a threshold value A, the partial linear decoding can be achieved, and thus the decoding complexity is reduced, and the joint decoding method can achievethe performance similar to that of the ML decoding method. And meanwhile, the transmission scheme provided by the invention is low in decoding complexity and meanwhile also improved in system performance.

The invention discloses an error correcting code decoder. The error correcting code decoder comprises a generating flow from ImpulseC software to FPGA (Field Programmable Gate Array) hardware. The generating flow comprises the following steps: performing C preprocessing on an ImpulseC design file, and performing C language analysis; determining hardware and software processes in application by using a compiler at a C language analysis state; performing an initial optimizing flow, and converting corresponding loops into equivalent concurrent statements by using the compiler at a loop unrolling stage; performing secondary optimization to generate a simulation-supporting HDL (Hardware Description Language) file which describes various processes, flows and elements described in an ImpulseC source element; and generating FPGA decoder hardware. Through the way, the error correcting code decoder can be applied to the fields of digital television demodulation chips, high-speed broadband mobile communication systems, compressed image transmission, wireless local area networks and the like, is used for performing error control and detecting and correcting errors introduced in a signal transmission process, and is an important component for ensuring reliable transmission of data.

The invention discloses a random multiple access method based on fountain coding (FC), comprising the following steps: on the basis of an NC-RMA method, carrying out the fountain coding on raw information of users at a transmitting terminal, and carrying out block transmission on coded symbols; and based on the fountain coding, decoding all the users by adopting a simple random multiple access belief propagation decoding method at a receiving terminal. The FC-RMA method disclosed by the invention obviously realizes higher throughput performance and effectively solves the problem that throughput performance of the existing NC-RMA method is degraded sharply at high access probability.

The present invention discloses a low complexity decoding method for a large-scale antenna system. The method compries the steps of (1) designing sending and receiving signals, (2) decoding an input signal matrix X: (a) obtaining an estimation channel H (shown in the patent specification) according to a sent training matrix Fai and a corresponding receiving signal Y0, (b) carrying out data decoding of the information xlk of a kth user in a first base station, and defining G (shown in the patent specification), in an MIMO system, when M is much larger than LK and M is large, defining Hl and Bl (shown in the patent specification), and carrying out approximated representation of G (shown in the patent specification), (3) decoding the data information xlk of the kth user in the given first base station (shown in the patent specification), and (4) decoding the steps (1), (2), and (3) by using the data in the step (2), and deocding the data information wlk of all users.

The invention relates to a hard decision decoding algorithm for an LDPC code. The method comprises the following steps of computing a checksum at the beginning of each iteration, and judging whether the decoding is finished or not according to the checksum and current iterations; and for each code element in a current decoding code word, firstly, judging whether the code element is equal to the corresponding code element in the received code word or not; secondly, computing the sum of checksum values connected to the code element; and thirdly, generating a random penalty term with a value of 0or 1 based on a preset probability value. The sum of the three parts is an energy value of the code element. The energy value reflects the reliability of each code element, and the code element withthe largest corresponding energy value will be turned over. According to the algorithm, only hard messages need to be used for decoding, so that the decoding complexity is very low. Through the application of the algorithm, the probability that the hard decision decoding is trapped in a capturing set can be greatly reduced. In the case that a soft message, such as a BEC channel, cannot be obtained, the error correction capability of the transmission data is greatly improved through the decoding algorithm disclosed by the invention.

The invention provides a universal decoding method and device, equipment and a storage medium, and the method comprises the steps: receiving a to-be-decoded target code word, and grouping the target code word into decoding blocks; according to the decoding block, a decoding result corresponding to the target code word is output through a target universal decoder, and the decoding result is a decoding bit; wherein the target universal decoder is obtained by training a convolutional neural network from a codeword training set corresponding to multiple code patterns and multiple code rates, and the convolutional neural network is used for representing a decoding network. The method provided by the invention is high in decoding flexibility.