Generation method of variable length S random interleaver

Abstract

The invention provides a generation method of a variable length S random interleaver. According to the method, a known S random interleaver having a limited length (assume the length is K) is utilized to be a reference interleaver to carry out a bitwise iteration expansion and an S random interleaver having an arbitrary length which is larger than K is generated based on an expansion characteristic condition of the reference interleaver. The expansion coefficient of the reference interleaver is adopted as the expansion coefficient parameter of the bitwise iteration expansion process to make the generated new S random interleaver can possess a diffusion performance equivalent to that of a reference interleaver, thereby guaranteeing the bit error code performance of the newly generated S random interleaver. Besides, the bitwise iteration expansion process only needs to carry out adding and subtracting operations; hence the calculating complexity is low. It is only necessary to store in the database of the generated interleaver the interlacing sequence [pai] k of the reference interleaver and the corresponding input bit sequence number jN of the interlacing address N of the bitwise expansion in an input data set; hence memory resources are saved, the interlacing time delay is reduced and the interlacing efficiency of the interleaver is improved.

Description

Technical field [0001] The invention belongs to the field of computer and communication technology, and in particular relates to a method for generating a variable length S random interleaver. Background technique [0002] The transmission of digital signals is inherently susceptible to interference, which introduces errors into the data being transmitted. Shannon's theorem states: If a sufficiently long random code is used, the Shannon channel capacity can be approximated. However, channel capacity has only existed as a theoretical limit for a long time, because traditional coding has a regular algebraic structure, which is far from random, and there is a big gap between its channel coding performance and channel capacity. [0003] In 1993, a new coding method topology code cleverly cascaded two simple component codes in parallel through a pseudo-random interleaver to construct a long code with pseudo-random characteristics, and passed between two soft input / soft output decoders....

AI Technical Summary

Problems solved by technology

However, this approach will destroy the properties of the interleaver and affect the performance of the interleaver

Images