Method, device, medium and system for generating a channel interleaver against fading and interference based on a genetic algorithm

Abstract

The application discloses a kind of anti-fading anti-interference channel interleaver generation method, equipment, medium and system based on genetic algorithm, belong to wireless communication field, including steps: based on the structure of channel interleaver by multiple encoding blocks, from the number average degree of the number of error codes distributed in each encoding block and the position dispersion, design new target evaluation function;Based on the target fitness of new target evaluation function calculation, to control the optimization direction of interleaver, so that the block-like continuous error code number caused by channel fading or burst interference is evenly distributed, position dispersed and randomly distributed in each encoding block.The application can distribute the block-like continuous error code number caused by channel fading or burst interference evenly, position dispersed and randomly in each encoding block, and the distribution randomness and average are better than existing scheme, with better anti-fading anti-interference performance.

Description

Technical Field

[0001] This invention relates to the field of wireless communication, and more specifically, to a method, device, medium, and system for generating anti-fading and anti-interference channel interleavers based on genetic algorithms. Background Technology

[0002] When wireless communication signals are transmitted through fading channels or encounter sudden interference, long bursts of errors can occur. Channel coding alone is often insufficient to meet bit error rate (BER) requirements; channel interleaving is necessary to effectively combat channel fading and interference. Channel coding, also known as error control coding, involves adding redundant information related to the original data at the transmitting end. The receiving end uses this correlation to detect and correct errors generated during transmission, thereby reducing the BER. Channel interleaving, on the other hand, involves changing the transmission order of the data, transforming a series of burst errors into several random errors distributed across multiple coding blocks. The error correction capability of channel coding is then used to recover the correct information.

[0003] The bit error rate performance of a wireless communication system is closely related to the type of channel interleaver used. Commonly used channel interleavers include row-column interleavers, diagonal interleavers, spiral interleavers, S-random interleavers, and quadratic permutation polynomial (QPP) interleavers. However, the above interleavers are all general-purpose designs, and there is still room for improvement in their anti-fading and anti-interference performance.

[0004] Genetic algorithms are global optimization algorithms based on population evolution, possessing numerous advantages such as population optimization, species diversity, and parallel search. They exhibit excellent iterative search efficiency, and the optimization direction of the interleaver can be controlled by designing an objective evaluation function. First, local mutation is used to generate individuals with different characteristics. Then, individuals with better objective fitness are retained, and the process is iterated continuously for the selected individuals. This method is highly suitable for selecting and generating high-performance, fading-resistant interleavers.

[0005] Although the interleaver generation method based on genetic algorithm has many advantages, when the number of burst errors caused by channel fading or interference exceeds the error correction capability of a single coding block, multiple coding blocks need to be interleaved together to effectively cope with the situation. However, existing genetic interleaver generation algorithms rarely consider this situation, and the objective evaluation function is not optimized based on characteristics such as channel fading duration and interference pulse width. Further more targeted design methods are needed. Summary of the Invention

[0006] The purpose of this invention is to overcome the shortcomings of the prior art and provide a method, device, medium and system for generating anti-fading and anti-interference channel interleavers based on genetic algorithms. This method can distribute the number of block-shaped continuous bit errors caused by channel fading or sudden interference to each coding block in an average, discrete and random manner. The randomness and averageness of the distribution are better than the existing schemes, and it has better anti-fading and anti-interference performance.

[0007] The objective of this invention is achieved through the following solution: A method for generating anti-fading and anti-interference channel interleavers based on genetic algorithms includes the following steps: Based on the structure of the channel interleaver consisting of multiple coding blocks, a first objective evaluation function and a second objective evaluation function are designed from two aspects: the average distribution of the number of bit errors in each coding block and the dispersion of their positions. The smaller the first objective evaluation function, the more even the distribution of the number of consecutive bit errors among the coding blocks after deinterleaving; the larger the second objective evaluation function, the more discrete and random the distribution of consecutive bit errors within each coding block after deinterleaving. The target fitness is calculated by jointly using the first and second target evaluation functions to control the optimization direction of the interleaver, thereby distributing the number of block-like consecutive bit errors caused by channel fading or sudden interference to each coding block in an average, discrete, and random manner.

[0008] Furthermore, based on the structure of the channel interleaver consisting of multiple coding blocks, a first objective evaluation function and a second objective evaluation function are designed from two aspects: the average distribution of the number of bit errors in each coding block and the dispersion of their positions. A smaller first objective evaluation function indicates a more even distribution of consecutive bit errors across coding blocks after deinterleaving; a larger second objective evaluation function indicates a more discrete and random distribution of consecutive bit errors within each coding block after deinterleaving. The objective fitness is jointly calculated based on the first and second objective evaluation functions to control the optimization direction of the interleaver, thereby evenly, discretely, and randomly distributing the number of consecutive bit errors caused by channel fading or sudden interference to each coding block. This specifically includes the following sub-steps: Step s1: Population initialization; determine the initial number of interleavers. N With interlacing length L ,generate N Initial interleaver , ; Step s2: Replication and mutation; first, N Each interleaver is copied once, and then the interleaver address is randomly swapped to perform a mutation operation on each newly copied interleaver. Step s3: Calculate the objective evaluation function ; The smaller the value, the more evenly the number of consecutive error bits is distributed across different coding blocks after deinterleaving. Step s4: Calculate the objective evaluation function ; The larger the value, the more discrete and random the distribution of consecutive error deinterleaving within each coding block; Step s5: Calculate the target fitness; based on and The ranking results are assigned different reward coefficients, and 2 are calculated together. N The target fitness corresponding to each mutated interleaver ; Step s6: Survival of the fittest: For 2 N The target fitness of the mutated interleaver Sort in descending order, keeping the first few. N One interleaver; Step s7: Determine whether the number of evolutions has reached the preset threshold. If not, return to step s2. If it has, end the evolution and proceed to step s8. Step s8: Select the optimal interleaver; end the evolution and select the interleaver with the highest target fitness as the generation result.

[0009] Further, in step s1, the generation N Initial interleaver , Specifically, it utilizes Logistic chaotic mapping to generate... N Initial interleaver , .

[0010] Further, in step s2, the step of... N Each interleaver is copied once, and then each newly copied interleaver is mutated by randomly swapping the interleaving addresses. This process includes the following sub-steps: Step s201: Select an interleaver to be mutated; Step s202: Generate two distinct random numbers random numbers The range of values ​​is 1~l ; Step s203: According to The interleaving addresses are swapped, and the specific swapping rules are as follows: ; ; Step s204: Determine whether the number of iterations has reached the preset threshold. If not, return to step s202. If it has, end the current mutation and proceed to step s205. Step s205: Output the mutated interleaver.

[0011] Further, in step s3, the calculation of the target evaluation function Specifically, it includes the following sub-steps: Step s301: Select a mutated interleaver; Step s302: Calculate the number of interleaved lines. i The corresponding number in the segment data j Set of pre-interleaving addresses for each coded block : ; In the formula, K The number of data segments contained in an interleaving block. M The number of coded blocks contained in the interleaver. For the intertwined first i The set of addresses before interleaving corresponding to the segment data. For the first j The set of pre-interleaving addresses corresponding to each coded block; Step s303: Calculate the objective evaluation function : ; In the above formula, For set The size, i.e., the number after interlacing i The data segment corresponds to the first data segment before interleaving. j Number of bits per coded block.

[0012] Further, in step s4, the calculation of the target evaluation function Specifically, it includes the following sub-steps: Step s401: Select a mutated interleaver; Step s402: Calculate the number of interleaved lines. i The corresponding number in the segment data j Set of pre-interleaving addresses for each coded block : ; Step s403: For Sort the elements in the set from smallest to largest to get the set. : ; Step s404: Calculate the set Find the minimum difference between any two adjacent elements in the set. Minimum interval between any two adjacent addresses : ; Step s405: For K The corresponding data segments Taking the minimum value, we get:

[0013] Step s406: For M indivual Taking the minimum value yields the target evaluation function. : .

[0014] Further, in step s5, the statement based on and The ranking results are assigned different reward coefficients, and 2 are calculated together. N The target fitness corresponding to each mutated interleaver Specifically, it includes the following sub-steps: Step s501: For Sort in descending order, and denote the sorted sequence number as follows: ; Step s502: For Sort in ascending order, and denote the sorted sequence number as follows: ; Step s503: ... Convert to score The specific conversion rules are as follows:

[0015] In the above formula, To give smaller T The reward coefficient for one interleaver; Step s504: ... Convert to score The specific rules are as follows:

[0016] In the above formula, To give Larger T The reward coefficients for the two interleavers; Step s505: Calculate 2 N The target fitness of the mutated interleaver The specific calculation rules are as follows: .

[0017] A genetic algorithm-based anti-fading and anti-interference channel interleaver generation device includes a processor and a memory, wherein the memory stores a computer program, and when the computer program is loaded by the processor, it executes the genetic algorithm-based anti-fading and anti-interference channel interleaver generation method as described above.

[0018] A computer-readable storage medium storing a computer program therein, the computer program being loaded by a processor and executing the method as described in any of the preceding claims.

[0019] A fading and interference-resistant channel interleaver generation system based on a genetic algorithm includes the fading and interference-resistant channel interleaver generation device based on the genetic algorithm as described above.

[0020] The beneficial effects of this invention include: (1) Based on the structure of the channel interleaver consisting of multiple coding blocks, this invention designs a new objective evaluation function from two aspects: the average number of bit errors distributed in each coding block and the dispersion of their positions. Based on the new objective evaluation function, the objective fitness is jointly calculated to control the optimization direction of the interleaver, thereby achieving the goal of evenly distributing the number of block-shaped continuous bit errors caused by channel fading or sudden interference to each coding block in a discrete and random manner.

[0021] (2) The channel interleaver generated by the method of the present invention has better randomness of distribution in each coding block after block continuous error deinterleaving than row interleaver and diagonal interleaver, and better average distribution among coding blocks than existing schemes. It has better anti-fading and anti-interference performance and is particularly suitable for the design of channel interleaver in wireless communication systems. Attached Figure Description

[0022] To more clearly illustrate the technical solutions in the embodiments of the present invention or the prior art, the drawings used in the description of the embodiments or the prior art will be briefly introduced below. Obviously, the drawings described below are only some embodiments of the present invention. For those skilled in the art, other drawings can be obtained based on these drawings without creative effort.

[0023] Figure 1 This is a flowchart of a method for generating an anti-fading and anti-interference channel interleaver based on a genetic algorithm according to an embodiment of the present invention; Figure 2 This is a sub-flowchart of step s2 of the anti-fading and anti-interference channel interleaver generation method based on genetic algorithm according to an embodiment of the present invention; Figure 3 This is a sub-flowchart of step s3 of the anti-fading and anti-interference channel interleaver generation method based on genetic algorithm according to an embodiment of the present invention; Figure 4 This is a sub-flowchart of step s4 of the anti-fading and anti-interference channel interleaver generation method based on genetic algorithm according to an embodiment of the present invention; Figure 5 This is a sub-flowchart of step s5 of the anti-fading and anti-interference channel interleaver generation method based on genetic algorithm according to an embodiment of the present invention; Figure 6 This is a schematic diagram of the data structure before and after interleaving in the anti-fading and anti-interference channel interleaver based on a genetic algorithm according to an embodiment of the present invention. Detailed Implementation

[0024] All features disclosed in all embodiments of this specification, or steps in all methods or processes implied in the disclosure, may be combined and / or extended or replaced in any way, except for mutually exclusive features and / or steps.

[0025] It should be noted that relational terms such as "first" and "second" are used merely to distinguish one entity or operation from another, and do not necessarily require or imply any such actual relationship or order between these entities or operations. Furthermore, the terms "comprising," "including," or any other variations thereof are intended to cover non-exclusive inclusion, such that a process, method, article, or apparatus that comprises a list of elements includes not only those elements but also other elements not expressly listed, or elements inherent to such a process, method, article, or apparatus. Without further limitations, an element defined by the phrase "comprising one..." does not exclude the presence of other identical elements in the process, method, article, or apparatus that includes said element.

[0026] As a first aspect of the present invention, a method for generating an anti-fading and anti-interference channel interleaver based on a genetic algorithm is provided, comprising the following steps: Based on the structure of the channel interleaver consisting of multiple coding blocks, a first objective evaluation function and a second objective evaluation function are designed from two aspects: the average distribution of the number of bit errors in each coding block and the dispersion of their positions. The smaller the first objective evaluation function, the more even the distribution of the number of consecutive bit errors among the coding blocks after deinterleaving; the larger the second objective evaluation function, the more discrete and random the distribution of consecutive bit errors within each coding block after deinterleaving. The target fitness is calculated by jointly using the first and second target evaluation functions to control the optimization direction of the interleaver, thereby distributing the number of block-like consecutive bit errors caused by channel fading or sudden interference to each coding block in an average, discrete, and random manner.

[0027] In other embodiments, based on the above embodiments, a method for generating anti-fading and anti-interference channel interleavers based on genetic algorithms is also provided, such as... Figure 1As shown, the data before interleaving includes M coded blocks, and the data after interleaving includes K data segments, where M and K are positive integers greater than or equal to 2, and the duration of each data segment is... t seq Less than the duration of channel fading or sudden interference, specifically including the following steps: Step s1: Population initialization; determine the initial number of interleavers. N With interlacing length L Generate using Logistic chaotic mapping N Initial interleaver , ; Step s2: Replication and mutation; first, N Each interleaver is copied once, and then the interleaver address is randomly swapped to perform a mutation operation on each newly copied interleaver. Step s3: Calculate the objective evaluation function ; Minimum indicates a more even distribution of the number of consecutive error bits across different coding blocks after deinterleaving. Step s4: Calculate the objective evaluation function ; The maximum value indicates that the distribution of consecutive error deinterleavings within each coding block is more discrete and random. Step s5: Calculate the target fitness; based on and The ranking results are assigned different reward coefficients, and 2 are calculated together. N The target fitness corresponding to each mutated interleaver ; Step s6: Survival of the fittest: For 2 N The target fitness of the mutated interleaver Sort in descending order, keeping the first few. N One interleaver; Step s7: Determine whether the number of evolutions has reached the preset threshold. If not, return to step s2. If it has, end the evolution and proceed to step s8. Step s8: Select the optimal interleaver; end the evolution and select the interleaver with the highest target fitness as the generation result.

[0028] In other embodiments, based on the above embodiments, a method for generating anti-fading and anti-interference channel interleavers based on genetic algorithms is also provided, such as... Figure 1 As shown, In an optional implementation, in step s1, the generation N Initial interleaver , Specifically, it utilizes Logistic chaotic mapping to generate... NInitial interleaver , .

[0029] In other embodiments, based on the above embodiments, a method for generating anti-fading and anti-interference channel interleavers based on genetic algorithms is also provided, such as... Figure 2 As shown, in step s2, the step of... N Each interleaver is copied once, and then each newly copied interleaver is mutated by randomly swapping the interleaving addresses. This process includes the following sub-steps: Step s201: Select an interleaver to be mutated; Step s202: Generate two different random numbers random numbers The range of values ​​is 1~l ; Step s203: According to The interleaving addresses are swapped, and the specific swapping rules are as follows: ; ; Step s204: Determine whether the number of iterations has reached the preset threshold. If not, return to step s202. If it has, end the current mutation and proceed to step s205. Step s205: Output the mutated interleaver.

[0030] In other embodiments, based on the above embodiments, a method for generating anti-fading and anti-interference channel interleavers based on genetic algorithms is also provided, such as... Figure 3 As shown, in step s3, the calculation of the target evaluation function... Specifically, it includes the following sub-steps: Step s301: Select a mutated interleaver; Step s302: Calculate the number of interleaved lines. i The corresponding number in the segment data j Set of pre-interleaving addresses for each coded block : ; In the formula, K The number of data segments contained in an interleaving block. M The number of coded blocks contained in the interleaver. For the intertwined first i The set of addresses before interleaving corresponding to the segment data. For the first j The set of pre-interleaving addresses corresponding to each coded block; Step s303: Calculate the objective evaluation function : ; In the above formula, For set The size, i.e., the number after interlacing i The data segment corresponds to the first data segment before interleaving. j Number of bits per coded block.

[0031] In other embodiments, based on the above embodiments, a method for generating anti-fading and anti-interference channel interleavers based on genetic algorithms is also provided, such as... Figure 4 As shown, in step s4, the calculation of the target evaluation function... Specifically, it includes the following sub-steps: Step s401: Select a mutated interleaver; Step s402: Calculate the number of interleaved lines. i The corresponding number in the segment data j Set of pre-interleaving addresses for each coded block : ; Step s403: For Sort the elements in the set from smallest to largest to get the set. : ; Step s404: Calculate the set Find the minimum difference between any two adjacent elements in the set. Minimum interval between any two adjacent addresses : ; Step s405: For K The corresponding data segments Taking the minimum value, we get:

[0032] Step s406: For M indivual Taking the minimum value yields the target evaluation function. : .

[0033] In other embodiments, based on the above embodiments, a method for generating anti-fading and anti-interference channel interleavers based on genetic algorithms is also provided, such as... Figure 5 As shown, in step s5, the step according to and The ranking results are assigned different reward coefficients, and 2 are calculated together. N The target fitness corresponding to each mutated interleaver Specifically, it includes the following sub-steps: Step s501: For Sort in descending order, and denote the sorted sequence number as follows: ; Step s502: For Sort in ascending order, and denote the sorted sequence number as follows: ; Step s503: ... Convert to score The specific conversion rules are as follows:

[0034] In the above formula, To give smaller T The reward coefficient for one interleaver; Step s504: ... Convert to score The specific rules are as follows:

[0035] In the above formula, To give Larger T The reward coefficients for the two interleavers; Step s505: Calculate 2 N The target fitness of the mutated interleaver The specific calculation rules are as follows: .

[0036] As a second aspect of the present invention, a genetic algorithm-based anti-fading and anti-interference channel interleaver generation device is provided, comprising a processor and a memory, wherein the memory stores a computer program, and when the computer program is loaded by the processor, the genetic algorithm-based anti-fading and anti-interference channel interleaver generation method as described in any of the above embodiments is executed.

[0037] As a third aspect of the present invention, a computer-readable storage medium is provided, wherein a computer program is stored in the storage medium, the computer program being loaded by a processor to execute the method as described in any of the above embodiments.

[0038] As a fourth aspect of the present invention, a fading and interference-resistant channel interleaver generation system based on a genetic algorithm is provided, including the fading and interference-resistant channel interleaver generation device based on a genetic algorithm as described in the above embodiments.

[0039] like Figure 6As shown, the data before interleaving includes M coded blocks, and the data after interleaving using the method of this embodiment includes K data segments, where M and K are positive integers greater than or equal to 2. Compared with traditional channel interleaver generation methods based on genetic algorithms, the method of this embodiment can achieve the goal of evenly distributing the number of blocky consecutive bit errors caused by channel fading or sudden interference to each coded block in a discrete and random manner. The channel interleaver generated based on the method of this embodiment has better randomness in the distribution of blocky consecutive bit errors within each coded block than row-column interleavers and diagonal interleavers, and better averageness in the distribution among coded blocks than S-random interleavers and QPP interleavers, exhibiting better anti-fading and anti-interference performance, and is particularly suitable for the design of channel interleavers in wireless communication systems.

[0040] The units described in the embodiments of the present invention can be implemented in software or hardware, and the described units can also be located in a processor. The names of these units do not necessarily limit the specific unit itself.

[0041] According to one aspect of the present invention, a computer program product or computer program is provided, the computer program product or computer program including computer instructions stored in a computer-readable storage medium. A processor of a computer device reads the computer instructions from the computer-readable storage medium, and executes the computer instructions, causing the computer device to perform the methods provided in the various optional implementations described above.

[0042] In another aspect, embodiments of the present invention also provide a computer-readable medium, which may be included in the electronic device described in the above embodiments; or it may exist independently and not assembled into the electronic device. The computer-readable medium carries one or more programs, which, when executed by the electronic device, cause the electronic device to perform the methods described in the above embodiments.

Claims

1. A method for generating anti-fading and anti-interference channel interleavers based on genetic algorithms, characterized in that, Includes the following steps: Based on the structure of the channel interleaver consisting of multiple coding blocks, a first objective evaluation function and a second objective evaluation function are designed from two aspects: the average distribution of the number of bit errors in each coding block and the dispersion of their positions. The smaller the first objective evaluation function, the more even the distribution of the number of consecutive bit errors among the coding blocks after deinterleaving; the larger the second objective evaluation function, the more discrete and random the distribution of consecutive bit errors within each coding block after deinterleaving. The target fitness is calculated by jointly using the first and second target evaluation functions to control the optimization direction of the interleaver, thereby distributing the number of block-like consecutive bit errors caused by channel fading or sudden interference to each coding block in an average, discrete, and random manner.

2. The method for generating an anti-fading and anti-interference channel interleaver based on a genetic algorithm according to claim 1, characterized in that, The structure of the channel interleaver, composed of multiple coding blocks, is designed with a first objective evaluation function and a second objective evaluation function, considering both the average distribution and the spatial dispersion of the number of bit errors within each coding block. A smaller first objective evaluation function indicates a more even distribution of consecutive bit errors across coding blocks after deinterleaving; a larger second objective evaluation function indicates a more discrete and random distribution of consecutive bit errors within each coding block after deinterleaving. The objective fitness is jointly calculated based on the first and second objective evaluation functions to control the optimization direction of the interleaver, thereby evenly, discretely, and randomly distributing the number of consecutive bit errors caused by channel fading or sudden interference to each coding block. This process includes the following sub-steps: Step s1: Population initialization; determine the initial number of interleavers. N With interlacing length L ,generate N Initial interleaver , ; Step s2: Replication and mutation; first, N Each interleaver is copied once, and then the interleaver address is randomly swapped to perform a mutation operation on each newly copied interleaver. Step s3: Calculate the objective evaluation function ; The smaller the value, the more evenly the number of consecutive error bits is distributed across different coding blocks after deinterleaving. Step s4: Calculate the objective evaluation function ; The larger the value, the more discrete and random the distribution of consecutive error deinterleaving within each coding block; Step s5: Calculate the target fitness; based on and The ranking results are assigned different reward coefficients, and 2 are calculated together. N The target fitness corresponding to each mutated interleaver ; Step s6: Survival of the fittest: For 2 N The target fitness of the mutated interleaver Sort in descending order, keeping the first few. N One interleaver; Step s7: Determine whether the number of evolutions has reached the preset threshold. If not, return to step s2. If it has, end the evolution and proceed to step s8. Step s8: Select the optimal interleaver; end the evolution and select the interleaver with the highest target fitness as the generation result.

3. The method for generating an anti-fading and anti-interference channel interleaver based on a genetic algorithm according to claim 2, characterized in that, In step s1, the generation N Initial interleaver , Specifically, it utilizes Logistic chaotic mapping to generate... N Initial interleaver , .

4. The method for generating an anti-fading and anti-interference channel interleaver based on a genetic algorithm according to claim 2, characterized in that, In step s2, the step of... N Each interleaver is copied once, and then each newly copied interleaver is mutated by randomly swapping the interleaving addresses. This process includes the following sub-steps: Step s201: Select an interleaver to be mutated; Step s202: Generate two distinct random numbers random numbers The range of values ​​is 1~l ; Step s203: According to The interleaving addresses are swapped, and the specific swapping rules are as follows: ； ； Step s204: Determine whether the number of iterations has reached the preset threshold. If not, return to step s202. If it has, end the current mutation and proceed to step s205. Step s205: Output the mutated interleaver.

5. The method for generating an anti-fading and anti-interference channel interleaver based on a genetic algorithm according to claim 4, characterized in that, In step s3, the calculation of the target evaluation function Specifically, it includes the following sub-steps: Step s301: Select a mutated interleaver; Step s302: Calculate the number of interleaved lines. i The corresponding number in the segment data j Set of pre-interleaving addresses for each coded block : ； In the formula, K The number of data segments contained in an interleaving block. M The number of coded blocks contained in the interleaver. For the intertwined first i The set of addresses before interleaving corresponding to the segment data. For the first j The set of pre-interleaving addresses corresponding to each coded block; Step s303: Calculate the objective evaluation function : ； In the above formula, For set The size, i.e., the number after interlacing i The data segment corresponds to the first data segment before interleaving. j Number of bits per coded block.

6. The method for generating an anti-fading and anti-interference channel interleaver based on a genetic algorithm according to claim 2, characterized in that, In step s4, the calculation of the target evaluation function Specifically, it includes the following sub-steps: Step s401: Select a mutated interleaver; Step s402: Calculate the number of interleaved lines. i The corresponding number in the segment data j Set of pre-interleaving addresses for each coded block : ； Step s403: For Sort the elements in the set from smallest to largest to get the set. : ； Step s404: Calculate the set Find the minimum difference between any two adjacent elements in the set. Minimum interval between any two adjacent addresses : ； Step s405: For K The corresponding data segments Taking the minimum value, we get: Step s406: For M indivual Taking the minimum value yields the target evaluation function. : 。 7. The method for generating an anti-fading and anti-interference channel interleaver based on a genetic algorithm according to claim 2, characterized in that, In step s5, the method according to and The ranking results are assigned different reward coefficients, and 2 are calculated together. N The target fitness corresponding to each mutated interleaver Specifically, it includes the following sub-steps: Step s501: For Sort in descending order, and denote the sorted sequence number as follows: ; Step s502: For Sort in ascending order, and denote the sorted sequence number as follows: ; Step s503: ... Convert to score The specific conversion rules are as follows: In the above formula, To give smaller T The reward coefficient for one interleaver; Step s504: ... Convert to score The specific rules are as follows: In the above formula, To give Larger T The reward coefficients for the two interleavers; Step s505: Calculate 2 N The target fitness of the mutated interleaver The specific calculation rules are as follows: 。 8. A device for generating anti-fading and anti-interference channel interleavers based on genetic algorithms, characterized in that, It includes a processor and a memory, wherein the memory stores a computer program that, when loaded by the processor, executes the anti-fading and anti-interference channel interleaver generation method based on any one of claims 1 to 7.

9. A computer-readable storage medium, characterized in that, A computer program is stored in a readable storage medium, the computer program being loaded by a processor and executing the method as described in any one of claims 1 to 7.

10. A fading-resistant and interference-resistant channel interleaver generation system based on a genetic algorithm, characterized in that, Includes the anti-fading and anti-interference channel interleaver generation device based on genetic algorithm as described in claim 8.

Images