Interleaving and de-interleaving method suitable for 4G 802.16 m protocol Turbo decoding

The interleaving and deinterleaving process of Turbo code is simplified through the packet address table and mapping relationship, and parallel processing is realized, solving the problems of interleaving and deinterleaving complexity and delay in the IEEE802.16m protocol, and improving the performance of Turbo code.

CN119051671AActive Publication Date: 2024-11-29深圳市力合微电子股份有限公司
View PDF 5 Cites 0 Cited by

Patent Information

Application Number
CN202411076846.3
Authority / Receiving Office
CN · China
Patent Type
Applications(China)
Current Assignee / Owner
Filing Date
2024-08-07
Publication Date
2024-11-29
Estimated Expiration
2044-08-07

AI Technical Summary

Technical Problem

The interleaving and deinterleaving process of Turbo codes in the IEEE802.16m protocol has a large computational complexity and storage requirements, resulting in interleaving delay and deinterleaving delay, affecting the decoding performance.

Method used

The interleaving initial address table and the deinterleaving initial address table of packets are used, combined with fixed step-by-step lengths, simplifying the calculation of interleaving and deinterleaving addresses, and the interleaving and deinterleaving interleaving interleaving interleaving interleaving interleaving interleaving interleaving interleaving interleaving interleaving interleaving interleaving interleaving interleaving interleaving interleaving interleaving interleaving interleaving interleaving interleaving interleaving interleaving interleaving interleaving interleaving interleaving interleaving interleaving interleaving interleaving interleaving interleaving interleaving interleaving interleaving interleaving interleaving interleaving interleaving interleaving interleaving interleaving interleaving interleaving interleaving interleaving interleaving interleaving interleaving interleaving interleaving interleaving interleaving interleaving interleaving interleaving interleaving interleaving interleaving interleaving interleaving interleaving interleaving interleaving Parallel processing of interleaving and deinterleaving.

Benefits of technology

The computational complexity of interleaving and deinterleaving is reduced, and the storage requirement is reduced. The interleaving and deinterleaving delay is reduced to equivalent requires only one processing slot, which improves the decoding throughput of Turbo decoding.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN119051671A_ABST
    Figure CN119051671A_ABST
Patent Text Reader

Abstract

The invention relates to an interleaving and de-interleaving method suitable for Turbo decoding of a 4G 802.16 m protocol, which aims at 39 groups of Turbo interleaving parameters supported by the 4G 802.16 m protocol, and adopts a grouped interleaving initial address table Itabinit and a step-by-step fixed interleaving step length Istep to realize simplified calculation of an interleaving address; a grouped de-interleaving initial address table Dtabinit and a step-by-step fixed de-interleaving step length Dstep are adopted to realize simplified calculation of a de-interleaving address; and processing an interleaver and a de-interleaver for Turbo iterative decoding by utilizing a mutual mapping relation of interleaving and de-interleaving, and replacing a de-interleaving table and an interleaving table iterated between component decoders. According to the interleaving and de-interleaving calculation method based on the simplified Turbo decoding, the calculation complexity is reduced, meanwhile, the interleaving and de-interleaving processing and information calculation outside the Turbo component decoder are processed in parallel by replacing an interleaving and de-interleaving table between the two component encoders, the interleaving and de-interleaving time delay is reduced to be equivalent, only one processing time slot is needed, and the processing efficiency is greatly improved. And the method is irrelevant to the interleaving depth, so that the decoding rate of Turbo decoding is improved.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present invention relates to the technical field of channel coding and encoding, and in particular to an interleaving and deinterleaving method suitable for 4G 802.16m protocol Turbo decoding. Background Art

[0002] IEEE802.16m is an upgraded version of 4G WiMax technology, designed to provide higher wireless transmission rates and improved network performance. IEEE802.16m can support wireless transmission rates up to 1Gbps, which is a significant performance improvement over previous standards, thus meeting higher data transmission and multimedia application requirements.

[0003] In the field of channel coding, Turbo code uses two component decoders for iterative decoding, and has a decoding performance close to the Shannon limit and is widely used, but its decoding scheme has a large decoding delay, which mainly includes three parts: decoding delay of component decoder, interleaving and deinterleaving delay, and iteration delay. In terms of interleaving and deinterleaving delay, the factors affecting the delay are mainly interleaving depth and interleaving computational complexity. The IEEE802.16m protocol uses dual binary Turbo coding, and in order to support diverse business needs, it supports 39 groups of Turbo interleaving parameters, with a maximum interleaving depth of 4800. There are usually two solutions for the implementation of interleavers and deinterleavers: First, direct storage is used to directly store interleaving and deinterleaving tables. Although this solution reduces computational complexity and reduces interleaving delay, it requires additional storage resources. Second, the non-storage method of direct calculation is adopted. The dual binary turbo interleaver of the 802.16m protocol adopts two-level interleaving. The calculation of the second-level interleaving index P[j] requires one multiplication, three additions, and two remainder operations. The calculation is relatively complicated, and there is no direct deinterleaving calculation formula. Therefore, the interleaver calculation is complicated and the deinterleaving table still needs to be stored. At the same time, the interleaving processing method clearly defined by the protocol requires the storage of the data to be interleaved to be completed before the interleaving processing can be started, which introduces the interleaving delay, and the interleaving delay increases exponentially with the increase in the number of iterations.

[0004] It should be noted that the information disclosed in the above background technology section is only used for understanding the background of the present application, and therefore may include information that does not constitute prior art known to ordinary technicians in the field. Summary of the invention

[0005] The main purpose of the present invention is to solve the problems existing in the above-mentioned background technology and to provide an interleaving and deinterleaving method suitable for 4G802.16m protocol Turbo decoding.

[0006] To achieve the above object, the present invention adopts the following technical solutions:

[0007] An interleaving and deinterleaving method applicable to 4G 802.16m protocol Turbo decoding, comprising:

[0008] (1) Using the grouped interleaving initial address table Itab_init and the step-by-step fixed interleaving step Istep, the simplified calculation of the interleaving address is realized;

[0009] (2) Using the grouped deinterleaving initial address table Dtab_init and the step-by-step fixed deinterleaving step Dstep, the simplified calculation of the deinterleaving address is realized;

[0010] (3) By utilizing the mutual mapping relationship between interleaving and deinterleaving, the interleaver and deinterleaver processing of Turbo iterative decoding are performed, and the iterative deinterleaving table and interleaving table between component decoders are replaced, thereby realizing an interleaving and deinterleaving scheme with the characteristics of random insertion and removal, and realizing the parallel processing of the previous stage external information calculation and the interleaver or deinterleaver.

[0011] Furthermore, in (1), the grouped interleaving initial address Itab_init and the step-by-step fixed interleaving step Istep are used, and the interleaving grouping has the following characteristics: the interleaving address calculation adopts group processing, and the group index i=mod(j,4) is used to achieve the same interleaving of index j with the same remainder, wherein the group index i=0,1,2,3, the interleaving address index j=0,1,…N-1, N is the interleaving depth.

[0012] Furthermore, in (1), the grouped interleaving initial address Itab_init and the step-by-step fixed interleaving step Istep are used, and the grouping parameter calculation has the following characteristics:

[0013] Based on the calculation rules of the interleaving length N and interleaving address P[j] specified in 802.16m, the interleaving parameters are configured by looking up the table: P0, P1, P2, P3; the interleaving initial address Itab_init[i] and the intra-group step Istep are calculated, and the group index i = 0, 1, 2, 3:

[0014]

[0015] Furthermore, in (1), the interleaver uses the grouped interleaving initial address table Itab_init and the step-by-step fixed interleaving step Istep to realize the simplified calculation of the interleaving address, which has the following characteristics: the interleaving index Intlv_Indx[i] of the initial assignment group is equal to Itab_init[i]; the four interleaving indexes of the qth iteration are calculated incrementally based on parallel iteration: Intlv_Idx[i] q =Intlv_Idx[i] q-1+Istep; Simplify the mod operation based on judgment logic, if Intlv_Idx[i] q >=N, then Intlv_Idx[i] q =Intlv_Idx[i] q -N, group internal index i = 0, 1, 2, 3, interleaving index iteration number q = 0, 1, ..., N / 4-1.

[0016] Furthermore, in (2), the grouped deinterleaving initial address table Dtab_init and the step-by-step fixed interleaving step length Dstep are used, and the grouped parameter calculation has the following characteristics: In the iterative calculation process of the interleaving index, the calculation of the parameters Dtab_init and Dstep is realized based on the simplified judgment logic: if Intlv_Idx[i] q = = j, then Dtab_init[j] = i + SIdx; if Intlv_Idx[i] q = = 5, then DStep = i + SIdx; in the above formula, the internal index of the group i, j = 0, 1, 2, 3; the number of interleaving iterations q = 0, 1, ... N / 4-1; the starting index SIdx of this iteration = q*4.

[0017] Further, in (2), the deinterleaver uses the deinterleaving initial address table Dtab_init and the step-by-step fixed interleaving step Dstep to simplify the calculation of the deinterleaving address, wherein: the deinterleaving index Dintlv_Idx[i] of the initial assignment group is = Dtab_init[i]; the four deinterleaving indexes of the qth iteration are calculated incrementally based on parallel iteration: Dintlv_Idx[i] q =Dintlv_Idx[i] q +Dstep, based on judgment logic to simplify mod operation, if Dintlv_Idx[i] q >=N, then Dintlv_Idx[i] q =Dintlv_Idx[i] q -N, group index i = 0, 1, 2, 3, number of interleaving iterations q = 0, 1, ..., N / 4-1.

[0018] Furthermore, in (3), the mapping relationship between interleaving and deinterleaving is utilized to process the interleaver and deinterleaver of Turbo iterative decoding, and the deinterleaving table and interleaving table of the iteration between the component decoders are replaced, thereby realizing an interleaving and deinterleaving scheme with the characteristics of taking and putting randomly, wherein:

[0019] For the external information output by the component decoder DEC1 of Turbo decoding, a deinterleaving table is used to implement interleaving processing;

[0020]

[0021] The number of iterations of the packet deinterleaver is q = floor(k / 4), the time of Turbo deinterleaving information is k = 0, 1, ... N-1, the group index of the packet deinterleaver is i = 0, 1, 2, 3, when k++ is processed, i++, if i is equal to 4, i is assigned to 0, so i adopts a counting method with a cycle length of 4.

[0022] Furthermore, in (3), the mapping relationship between interleaving and deinterleaving is utilized to process the interleaver and deinterleaver of Turbo iterative decoding, and the deinterleaving table and interleaving table of the iteration between the component decoders are replaced, thereby realizing an interleaving and deinterleaving scheme with the characteristics of taking and putting randomly, wherein:

[0023] For the external information output by the component decoder DEC2 of the turbo decoding, an interleaving table is used to implement deinterleaving processing.

[0024]

[0025] The number of iterations of the packet interleaver q = floor(k / 4), the time of turbo decryption information k = 0, 1, ... N-1, the group index of the packet interleaver i = 0, 1, 2, 3, when k++ is processed, i++, if i is equal to 4, i is assigned to 0, so i adopts a counting method with a cycle length of 4.

[0026] Furthermore, in (3), for the component decoders DEC1 and DEC2 of Turbo decoding, after completing the first group of external information After the calculation output is obtained, two parallel processing steps are immediately started: (1) Calculate the calculation corresponding to the interleaving or deinterleaving of the current index and convert the external information at the current time k into Stored in the corresponding prior information (2) The calculation of the external information at the next moment of synchronous calculation. This method immediately completes the replacement processing for the external information output in sequence to achieve the effect of taking it in order and putting it randomly, so as to realize the parallel calculation of the calculation of the external information and the interleaving or deinterleaving processing. The equivalent interleaving or deinterleaving delay only needs one processing time slot, which is independent of the interleaving depth.

[0027] A computer program product includes a computer program, and when the computer program is executed by a processor, the interleaving and deinterleaving method applicable to 4G 802.16m protocol Turbo decoding is implemented.

[0028] In some embodiments, the method has the following features:

[0029] (1) Based on the interleaving length N and interleaving address P[j] calculation rules specified in 802.16m, the interleaving parameters are configured by looking up the table: P0, P1, P2, P3, and the interleaving initial address Itab_init[i] and the intra-group step Istep are calculated, where i = 0, 1, 2, 3;

[0030]

[0031] (2) Interleaving index Intlv_Indx[i] of the initial assignment group = Itab_init[i]. The four interleaving indexes of the qth iteration are calculated incrementally based on parallel iteration. Meanwhile, in the iterative calculation process of the interleaving index, the calculation of the parameters Dtab_init and Dstep is realized based on the simplified judgment logic:

[0032] Intlv_Idx[i] q =Intlv_Idx[i] q-1 +Istep. Simplify the mod operation based on judgment logic. If Intlv_Idx[i] q >=N, then Intlv_Idx[i] q =Intlv_Idx[i] q -N;

[0033] If Intlv_Idx[i] q = = j, then Dtab_init[j] = i + SIdx; if Intlv_Idx[i] q = = 5, then DStep = i + SIdx; in the above formula, the internal index of the group i, j = 0, 1, 2, 3; the number of interleaving iterations q = 0, 1, ... N / 4-1; the starting index SIdx of this iteration = q*4.

[0034] (3) Based on parallel iterations, the four deinterleaving indexes of the qth iteration are calculated incrementally: Dintlv_Idx[i] q =Dintlv_Idx[i] q +Dstep, based on judgment logic to simplify mod operation, if Dintlv_Idx[i] q >=N, then Dintlv_Idx[i] q =Dintlv_Idx[i] q -N, group index i = 0, 1, 2, 3, number of interleaving iterations q = 0, 1, ..., N / 4-1;

[0035] (4) By using the mapping relationship between interleaving and deinterleaving, the interleaver and deinterleaver of Turbo iterative decoding are processed, and the deinterleaving table and interleaving table of the iteration between component decoders are replaced, thus realizing an interleaving and deinterleaving scheme with the characteristics of taking and putting randomly:

[0036] For the external information output by the component decoder DEC1 of Turbo decoding Use the deinterleaving table to implement interleaving processing and obtain prior information

[0037]

[0038] For the external information output by the component decoder DEC2 of Turbo decoding De-interleaving using interleaving tables

[0039]

[0040] The number of iterations of the packet interleaver q = floor(k / 4), the time of turbo decryption information k = 0, 1, ... N-1, the group index of the packet interleaver i = 0, 1, 2, 3, when k++ is processed, i++, if i is equal to 4, i is assigned to 0, so i adopts a counting method with a cycle length of 4.

[0041] (5) For the component decoders DEC1 and DEC2 of Turbo decoding, after completing the first group of external information After the calculation output is obtained, two parallel processing steps are immediately started: (1) Calculate the calculation corresponding to the interleaving or deinterleaving of the current index and convert the external information at the current time k into Stored in the corresponding prior information (2) The calculation of the external information at the next moment of synchronous calculation. This method immediately completes the replacement processing for the external information output in sequence to achieve the effect of taking it in order and putting it randomly, so as to realize the parallel calculation of the calculation of the external information and the interleaving or deinterleaving processing. The equivalent interleaving or deinterleaving delay only needs one processing time slot, which is independent of the interleaving depth.

[0042] The present invention has the following beneficial effects:

[0043] The present invention proposes a simplified calculation method for interleaving and deinterleaving, which is implemented by adding the initial address of the group and the incremental step, simplifying the calculation complexity. At the same time, this aspect is fully applicable to the 39 groups of Turbo interleaving parameters supported by 4G802.16m, based on the simplified calculation method, simplifies the calculation complexity of interleaving, solves the storage requirements of the deinterleaving table, and reduces the memory.

[0044] The present invention utilizes the mutual mapping relationship between interleaving and deinterleaving, and proposes an iterative deinterleaving table and an interleaving table between permuted component decoders in the interleaver and deinterleaver processing in the Turbo decoding implementation iteration to realize the interleaving and deinterleaving functions, so that the interleaving and deinterleaving processing is realized in parallel with the external information calculation of the Turbo component decoder, and the interleaving and deinterleaving delay is reduced to an equivalent processing time slot, and is independent of the interleaving depth, thereby improving the decoding throughput of the Turbo decoding.

[0045] Other beneficial effects of the embodiments of the present invention will be further described below. BRIEF DESCRIPTION OF THE DRAWINGS

[0046] Figure 1 The present invention is a flowchart of the steps of an interleaving and deinterleaving method applicable to 4G 802.16m protocol Turbo decoding according to an embodiment of the present invention.

[0047] Figure 2 This is a structural block diagram of an 802.16m protocol dual binary Turbo encoder according to an embodiment of the present invention.

[0048] Figure 3 The figure is a theoretical block diagram of the 802.16m protocol dual binary Turbo iterative decoding process according to an embodiment of the present invention.

[0049] Figure 4 The invention is a block diagram of iterative decoding of 802.16m protocol dual binary Turbo using permutation interleaving and deinterleaving tables. DETAILED DESCRIPTION

[0050] The following is a detailed description of the embodiments of the present invention. It should be emphasized that the following description is only exemplary and is not intended to limit the scope and application of the present invention.

[0051] In addition, the terms "first" and "second" are used for descriptive purposes only and should not be understood as indicating or implying relative importance or implicitly indicating the number of technical features indicated. Thus, a feature defined as "first" or "second" may explicitly or implicitly include one or more of the features. In the description of the embodiments of the present invention, the meaning of "plurality" is two or more, unless otherwise clearly and specifically defined.

[0052] The present invention proposes an interleaving and deinterleaving method suitable for 4G 802.16m protocol Turbo decoding. The method adopts a grouped interleaving initial address table Itab_init and a step-by-step fixed interleaving step Istep for 39 groups of Turbo interleaving parameters supported by the 4G 802.16m protocol to realize simplified calculation of interleaving addresses; adopts a grouped deinterleaving initial address table Dtab_init and a step-by-step fixed deinterleaving step Dstep to realize simplified calculation of deinterleaving addresses; utilizes the mutual mapping relationship between interleaving and deinterleaving to process the interleaver and deinterleaver of Turbo iterative decoding, replaces the iterative deinterleaving table and interleaving table between component decoders, realizes an interleaving and deinterleaving scheme with the characteristics of sequential and random placement, and realizes the parallel processing of the front-stage external information calculation and the interleaver or deinterleaver. The present invention is based on a simplified interleaving and deinterleaving calculation method of Turbo decoding, reduces the calculation complexity, and at the same time, by replacing the interleaving and deinterleaving tables between two component encoders, the interleaving and deinterleaving processing is realized in parallel with the external information calculation of the Turbo component decoder, and the interleaving and deinterleaving delay is reduced to an equivalent processing time slot, which is independent of the interleaving depth, thereby improving the decoding rate of Turbo decoding.

[0053] In order to more clearly explain the implementation and optimization effect of the interleaving and deinterleaving method of the present invention, based on Figure 2 The 802.16m protocol dual binary turbo encoder structure block diagram is shown, and the encoding and interleaving related provisions are briefly described. Assume that the input dual binary bit group sequence is (A, B) = (a0, b0), (a1, b1), …, (a N-1 ,b N-1 ), where N is the length of the bit pair and 2N is the length of the information bit to be encoded. The output code after encoding is six sub-blocks, namely: A, B, Y1, Y2, W1, W2 = {a0, a1, ..., a N-1 ,b0,b1,…,b N-1 ,y 1,0 ,y 1,1 ,…,y 1,N-1 ,y 2,0 ,y 2,1 ,…,y 2,N-1 ,w 1,0 ,w 1,1 ,…,w 1,N-1 ,w 2,0 ,w 2,1 ,…,w 2,N-1} , the interleaver of Turbo coding adopts two-level interleaving:

[0054] 1) Internal interleaving of bit groups. That is, for the double binary bit group sequence input to the encoder, the bit groups with odd sequence numbers (a 2i-1 ,b 2i-1) internal elements, and get (b 2i-1 ,a 2i-1 ), i=0,1,…N-1.

[0055] 2) Inter-bit group interleaving. That is, the elements in the sequence are rearranged for the result of the first-level interleaving, and P[j] is set to represent the address index of the double binary sequence after the second-level interleaving. The calculation process of the second-level interleaving uses the quadratic congruence method, and the specific calculation method is shown in the following formula.

[0056]

[0057] Where mod is the modulus operation, P0, P1, P1, P3 are interleaving parameters, and N is the length of the information bit pair. Therefore, the specific implementation algorithm of address mapping P[j] for Turbo coding interleaving is shown in the following formula:

[0058]

[0059] Where a[] and b[] are information bit sequences before interleaving, and aInt[] and bInt[] are information bit sequences after interleaving. Different interleaving parameters are configured for different information bit lengths in the protocol, as shown in Table 1 below:

[0060] Table 1 802.16m Turbo interleaving parameters

[0061]

[0062]

[0063] As shown in Table 1, the 802.316m protocol supports 39 interleaving parameters, and its interleaving depth is up to 2400. There are usually two solutions for the implementation of the interleaver and deinterleaver:

[0064] 1. Using direct storage, the storage size required for the interleaving table is: 2400*ceil(log2(2400))=28800 bits. Figure 3 The decoding block diagram of dual binary Turbo coding shown in the figure takes into account reducing the decoding delay during the decoding process, and usually adopts parallel processing of two component decoders. Therefore, it is necessary to store the interleaving and deinterleaving tables at the same time, so that the required interleaving and deinterleaving storage size is 57600 bits. Although this scheme reduces the computational complexity, it requires a certain amount of additional storage resources.

[0065] Second, the non-storage method of direct calculation is adopted. The calculation of the interleaving index P[j] in the second-level interleaving of the turbo interleaver requires one multiplication, three additions, and two remainder operations. The calculation is relatively complicated, and there is no direct deinterleaving calculation formula. Therefore, the interleaving calculation is complicated and the deinterleaving table still needs to be stored. At the same time, the interleaving method of the interleaving process Intx[i]=x[P[i]] given by (Formula-2) needs to complete the storage of X before the interleaving process can be started. The interleaving scheme is referred to as random pick and place, which introduces an interleaving delay.

[0066] In view of the problems existing in the above two solutions, the present invention utilizes the mutual mapping relationship between interleaving and deinterleaving to process the interleaver and deinterleaver of Turbo iterative decoding, and replaces the iterative deinterleaving table and interleaving table between component decoders, such as Figure 4 This specific implementation case will take the Turbo decoding length with an index table Index of 4 and an interleaving length N of 40 as an example to explain in detail the interleaving and deinterleaving method of the Turbo decoding of the present invention. The specific implementation steps are as follows:

[0067] (S1) Based on the interleaving length N being 40, the interleaving parameters are configured by looking up the table: P0=7, P1=4, P2=32, P3=36. Based on the calculation of the interleaving address P(j) (Formula-1), the interleaving initial address Itab_init[i] and the intra-group step Istep are calculated, where i=0, 1, 2, 3;

[0068]

[0069] (S2) Decode the soft information {y ka ,y kb} to perform interleaving processing and obtain the interleaved information part Where time k = 0, 1...N-1. At the same time, the deinterleaving initial address Dtab_init[i] and the deinterleaving intra-group step Dstep are obtained. The specific implementation steps are as follows:

[0070] (S2.1) Let the initial address of the current group be SIdx = 0, the number of iterations q = 0, and the interleaving index of the group be assigned an initial value Intlv_Indx[i] = Itab_init[i], i = 0, 1, 2, 3.

[0071] (S2.2) Based on the 4 interleaving indexes of the current iteration group, Intlv_Idx[i]=Intlv_Idx[i]+Istep, simplify the mod operation based on the judgment logic. If Intlv_Idx[i]>=N, then Intlv_Idx[i]=Intlv_Idx[i]-N, i=0,1,2,3, and complete the y ka ,ykb Interweaving, output

[0072] (S2.3) Find the deinterleaving initial address Dtab_init[i] based on the comparator, and the specific implementation is as follows:

[0073] If Intlv_Idx[i]<=5, proceed to step (2.4) after making the following judgment, otherwise proceed directly to step (2.4);

[0074] If Intlv_Idx[i]==j, then Dtab_init[j]=i+SIdx;

[0075] If Intlv_Idx[i]==5, then DStep=i+SIdx;

[0076] In the above formula, i, j = 0, 1, 2, 3. In this implementation case, Dtab_init = [25 0 15 30], DStep = 12; (S2.4) Counting process: SIdx = SIdx + 4, iteration number q++, and determine q, if it is less than N / 4, then return to step (S2.2), otherwise end the interleaving process, Table 2 shows the 4 interleaving indexes Intlv_Idx calculated in parallel in different iteration numbers.

[0077] Table 2 Interleaved lookup table based on iterative parallel grouping calculation

[0078]

[0079]

[0080] S3: Set the number of iterations of the component decoder DecIter = 0, the current decoding component decoder IDEC = 0, and the maximum number of iterations threshold InterThr = 6;

[0081] S4: When the Turbo component decoder completes the sub-decoding, it outputs the posterior log-likelihood ratio L of the information bit i (u k ), external information Based on the interleaving or deinterleaving table, the external information at each moment is immediately stored in the corresponding prior information of another sub-decoder. The storage address of the pre-processing is realized in parallel with the interleaving or deinterleaving device. The invention focuses on the optimization of interleaving and deinterleaving in the turbo decoding process, so the decoding process of the sub-decoder is simplified here. The specific implementation steps are as follows:

[0082] (S4.1) Let the loop count Cnt=0, the current moment K=0, and select the interleaving or deinterleaving parameters based on the current Turbo component decoder being DEC1 or DEC2.

[0083] If IDEC==0 is the component decoder DEC1, then select the deinterleaving parameter PIdx[i]=Dtab_int[i], the deinterleaving step Step=Dstep, to realize the interleaving function in turbo decoding;

[0084] If IDEC==1 for component decoder DEC2, then interleaving parameter PIdx[i]=Itab_init[i] and interleaving step Step=Istep are selected to implement deinterleaving processing in Turbo decoding.

[0085] The present invention replaces the interleaving and deinterleaving tables between two component encoders, so that the interleaving and deinterleaving processing is implemented in parallel with the output timing of the external information of the Turbo component decoder, thereby reducing the delay of interleaving and deinterleaving.

[0086] (S4.2) Based on the calculation formula of external information, calculate the external information at time k

[0087]

[0088] (S4.3) Interleaving or deinterleaving index PIdx calculated based on iteration increment:

[0089] PIdx[Cnt]=PIdx[Cnt]+step, if PIdx[Cnt]>=N, then PIdx[Cnt]=-N;

[0090] (S4.4) Based on the replacement index Paddr[Cnt], the external information is replaced to obtain the prior information:

[0091] If IDEC == 0, it is component decoder DEC1:

[0092]

[0093] If IDEC == 1, it is component decoder DEC2:

[0094]

[0095] (S4.5) For the loop count Cnt++, k++, if Cnt==4, then Cnt=0, if k==N, then go to step S5, otherwise go to step (S4.2). Table 3 shows the four interleaving indexes DIntlv_Idx calculated in parallel in different numbers of iterations in this implementation case.

[0096] Table 3 Parallel grouping calculation deinterleaving lookup table based on iteration

[0097]

[0098] (S5) Iteration number DecIter++ processing, if DecIter == 2*InterThr, then end the iterative decoding and go to step S6, otherwise IDEC = mod(IDEC+1,2) and go to (S4.1)

[0099] (S6) When the maximum number of iterations is reached, the a posteriori likelihood ratio L for the component decoder DEC2 is i (u k ) to make a hard decision and obtain the decoded bit pair u k , and use the interleaving parameters to implement deinterleaving. The specific implementation steps are:

[0100] (S6.1) Select interleaving parameter PIdx[i]=Itab_init[i], interleaving step Step=Istep, implement deinterleaving processing in Turbo decoding, and set k=0, Cnt=0.

[0101] (S6.2) The a posteriori likelihood ratio L for component decoder DEC2 i (u k ) to make a hard decision and obtain the hard decision bit pair u k :

[0102]

[0103] (S6.2) Interleaving index PIdx calculated based on iteration increment:

[0104] PIdx[Cnt]=PIdx[Cnt]+step, if PIdx[Cnt]>=N, then PIdx[Cnt]=-N;

[0105] (S6.3) Based on the permutation index Paddr[Cnt], the hard decision information is permuted to obtain the decoded output information bits:

[0106]

[0107] (S6.5) For the loop count Cnt++, k++, if Cnt==4, then Cnt=0, if k==N, then go to step S7, otherwise go to step (S6.2).

[0108] (S7) Output DecData[2N-2], DecData[2N-1], and end the entire Turbo decoding iteration.

[0109] An embodiment of the present invention further provides a storage medium for storing a computer program, which at least performs the above method when executed.

[0110] An embodiment of the present invention further provides a control device, comprising a processor and a storage medium for storing a computer program; wherein the processor is configured to execute at least the method described above when executing the computer program.

[0111] An embodiment of the present invention further provides a processor, wherein the processor executes a computer program and at least executes the method described above.

[0112] The storage medium can be implemented by any type of non-volatile storage device, or a combination thereof. Among them, the non-volatile memory can be a read-only memory (ROM), a programmable read-only memory (PROM), an erasable programmable read-only memory (EPROM), an electrically erasable programmable read-only memory (EEPROM), a magnetic random access memory (FRAM), a ferromagnetic random access memory (Flash Memory), a magnetic surface memory, an optical disc, or a compact disc read-only memory (CD-ROM); the magnetic surface memory can be a disk memory or a tape memory. The storage medium described in the embodiments of the present invention is intended to include, but is not limited to, these and any other suitable types of memory.

[0113] In the several embodiments provided by the present invention, it should be understood that the disclosed systems and methods can be implemented in other ways. The device embodiments described above are only schematic. For example, the division of the units is only a logical function division. There may be other division methods in actual implementation, such as: multiple units or components can be combined, or can be integrated into another system, or some features can be ignored or not executed. In addition, the coupling, direct coupling, or communication connection between the components shown or discussed can be through some interfaces, and the indirect coupling or communication connection of the devices or units can be electrical, mechanical or other forms.

[0114] The units described above as separate components may or may not be physically separated, and the components displayed as units may or may not be physical units, that is, they may be located in one place or distributed on multiple network units; some or all of the units may be selected according to actual needs to achieve the purpose of the present embodiment.

[0115] In addition, all functional units in the embodiments of the present invention may be integrated into one processing unit, or each unit may be separately used as a unit, or two or more units may be integrated into one unit; the above-mentioned integrated units may be implemented in the form of hardware or in the form of hardware plus software functional units.

[0116] A person skilled in the art can understand that: all or part of the steps of implementing the above method embodiment can be completed by hardware related to program instructions, and the aforementioned program can be stored in a computer-readable storage medium. When the program is executed, it executes the steps of the above method embodiment; and the aforementioned storage medium includes: mobile storage devices, read-only memories (ROM, Read-Only Memory), random access memories (RAM, Random Access Memory), disks or optical disks, etc. Various media that can store program codes.

[0117] Alternatively, if the above-mentioned integrated unit of the present invention is implemented in the form of a software function module and sold or used as an independent product, it can also be stored in a computer-readable storage medium. Based on this understanding, the technical solution of the embodiment of the present invention can be essentially or partly reflected in the form of a software product that contributes to the prior art. The computer software product is stored in a storage medium and includes several instructions for a computer device (which can be a personal computer, a server, or a network device, etc.) to execute all or part of the methods described in each embodiment of the present invention. The aforementioned storage medium includes: various media that can store program codes, such as mobile storage devices, ROM, RAM, magnetic disks or optical disks.

[0118] The methods disclosed in the several method embodiments provided by the present invention can be arbitrarily combined without conflict to obtain new method embodiments.

[0119] The features disclosed in several product embodiments provided by the present invention can be arbitrarily combined without conflict to obtain new product embodiments.

[0120] The features disclosed in several method or device embodiments provided by the present invention can be arbitrarily combined without conflict to obtain new method embodiments or device embodiments.

[0121] The above contents are further detailed descriptions of the present invention in combination with specific preferred embodiments, and it cannot be determined that the specific implementation of the present invention is limited to these descriptions. For those skilled in the art of the present invention, several equivalent substitutions or obvious variations can be made without departing from the concept of the present invention, and the performance or use is the same, which should be regarded as belonging to the protection scope of the present invention.

Claims

1. An interleaving and deinterleaving method suitable for 4G 802.16m protocol Turbo decoding, characterized in that: include: (1) Using the grouped interleaving initial address table Itab_init and the step-by-step fixed interleaving step Istep, the simplified calculation of the interleaving address is realized; (2) Using the grouped deinterleaving initial address table Dtab_init and the step-by-step fixed deinterleaving step Dstep, the simplified calculation of the deinterleaving address is realized; (3) By utilizing the mutual mapping relationship between interleaving and deinterleaving, the interleaver and deinterleaver processing of Turbo iterative decoding are performed, and the iterative deinterleaving table and interleaving table between component decoders are replaced, thereby realizing an interleaving and deinterleaving scheme with the characteristics of random insertion and removal, and realizing the parallel processing of the previous stage external information calculation and the interleaver or deinterleaver.

2. The interleaving and deinterleaving method for 4G 802.16m protocol Turbo decoding as claimed in claim 1, characterized in that: In the above (1), the interleaving initial address Itab_init of the group and the interleaving step length Istep of the step-by-step fixed interleaving are adopted, and the interleaving grouping has the following characteristics: the interleaving address calculation adopts group processing, and the group index i=mod(j,4) is realized to realize that the index j with the same remainder has the same interleaving, wherein the group index i=0,1,2,3, the interleaving address index j=0,1,…N-1, N is the interleaving depth.

3. The interleaving and deinterleaving method for 4G 802.16m protocol Turbo decoding as claimed in claim 1, characterized in that: In (1), the grouped interleaving initial address Itab_init and the step-by-step fixed interleaving step Istep are used, and the grouping parameter calculation has the following characteristics: Based on the calculation rules of the interleaving length N and interleaving address P[j] specified in 802.16m, the interleaving parameters are configured by looking up the table: P0, P1, P2, P3; the interleaving initial address Itab_init[i] and the intra-group step Istep are calculated, and the group index i = 0, 1, 2, 3:

4. The interleaving and deinterleaving method for 4G 802.16m protocol Turbo decoding as claimed in claim 1, characterized in that: In (1), the interleaver uses the grouped interleaving initial address table Itab_init and the step-by-step fixed interleaving step Istep to realize the simplified calculation of the interleaving address, which has the following characteristics: the interleaving index Intlv_Indx[i] of the initial assignment group is equal to Itab_init[i]; the four interleaving indexes of the qth iteration are calculated incrementally based on parallel iteration: Intlv_Idx[i] q =Intlv_Idx[i] q-1 +Istep; Simplify the mod operation based on judgment logic, if Intlv_Idx[i] q >=N, then Intlv_Idx[i] q =Intlv_Idx[i] q -N, group internal index i = 0, 1, 2, 3, interleaving index iteration number q = 0, 1, ..., N / 4-1.

5. The interleaving and deinterleaving method for 4G 802.16m protocol Turbo decoding as claimed in claim 1, characterized in that: In (2), the grouped deinterleaving initial address table Dtab_init and the step-by-step fixed interleaving step length Dstep are used, and the grouped parameter calculation has the following characteristics: In the iterative calculation process of the interleaving index, the calculation of the parameters Dtab_init and Dstep is realized based on the simplified judgment logic: if Intlv_Idx[i] q = = j, then Dtab_init[j] = i + SIdx; if Intlv_Idx[i] q = = 5, then DStep = i + SIdx; in the above formula, the internal index of the group i, j = 0, 1, 2, 3; the number of interleaving iterations q = 0, 1, ... N / 4-1; the starting index SIdx of this iteration = q*4.

6. The interleaving and deinterleaving method for 4G 802.16m protocol Turbo decoding as claimed in claim 1, characterized in that: In (2), the deinterleaver uses the deinterleaving initial address table Dtab_init and the step-by-step fixed interleaving step Dstep to simplify the calculation of the deinterleaving address, wherein: the deinterleaving index Dintlv_Idx[i] of the initial assignment group = Dtab_init[i]; the four deinterleaving indexes of the qth iteration are calculated incrementally based on parallel iteration: Dintlv_Idx[i] q =Dintlv_Idx[i] q +Dstep, based on judgment logic to simplify mod operation, if Dintlv_Idx[i] q >=N, then Dintlv_Idx[i] q =Dintlv_Idx[i] q -N, group index i = 0, 1, 2, 3, number of interleaving iterations q = 0, 1, ..., N / 4-1.

7. The interleaving and deinterleaving method for 4G 802.16m protocol Turbo decoding as claimed in claim 1, characterized in that: In (3), the mapping relationship between interleaving and deinterleaving is utilized to process the interleaver and deinterleaver of Turbo iterative decoding, and the deinterleaving table and interleaving table of the iteration between the component decoders are replaced, so as to realize an interleaving and deinterleaving scheme with the characteristics of taking and putting randomly, wherein: For the external information output by the component decoder DEC1 of Turbo decoding, a deinterleaving table is used to implement interleaving processing; The number of iterations of the packet deinterleaver is q = floor(k / 4), the time of Turbo deinterleaving information is k = 0, 1, ... N-1, the group index of the packet deinterleaver is i = 0, 1, 2, 3, when k++ is processed, i++, if i is equal to 4, i is assigned to 0, so i adopts a counting method with a cycle length of 4.

8. The interleaving and deinterleaving method for 4G 802.16m protocol Turbo decoding as claimed in claim 1, characterized in that: In (3), the mapping relationship between interleaving and deinterleaving is utilized to process the interleaver and deinterleaver of Turbo iterative decoding, and the deinterleaving table and interleaving table of the iteration between the component decoders are replaced, so as to realize an interleaving and deinterleaving scheme with the characteristics of taking and putting randomly, wherein: For the external information output by the component decoder DEC2 of the turbo decoding, an interleaving table is used to implement deinterleaving processing. The number of iterations of the packet interleaver q = floor(k / 4), the time of turbo decryption information k = 0, 1, ... N-1, the group index of the packet interleaver i = 0, 1, 2, 3, when k++ is processed, i++, if i is equal to 4, i is assigned to 0, so i adopts a counting method with a cycle length of 4.

9. The interleaving and deinterleaving method for 4G 802.16m protocol Turbo decoding as claimed in claim 1, characterized in that: In (3), for the component decoders DEC1 and DEC2 of Turbo decoding, after completing the first group of external information After the calculation output is obtained, two parallel processing steps are immediately started: (1) Calculate the calculation corresponding to the interleaving or deinterleaving of the current index and convert the external information at the current time k into Stored in the corresponding prior information (2) The calculation of the external information at the next moment of synchronous calculation. This method immediately completes the replacement processing for the external information output in sequence to achieve the effect of taking it in order and putting it randomly, so as to realize the parallel calculation of the calculation of the external information and the interleaving or deinterleaving processing. The equivalent interleaving or deinterleaving delay only needs one processing time slot, which is independent of the interleaving depth.

10. A computer program product, comprising a computer program, characterized in that When the computer program is executed by a processor, the interleaving and deinterleaving method applicable to 4G802.16m protocol Turbo decoding as described in any one of claims 1 to 9 is implemented.

Citation Information

Patent Citations

  • Turbo code decoder with configurable parameters

    CN104184482A

  • Device and method for decoding Turbo codes supporting LET standard

    CN106899313A

  • Iterative decoding method based on extended Turbo code and continuous phase modulation

    CN114826284A

  • Low-delay CTC code decoding device and method

    CN117424610A

  • Programmable signal processing circuit and method of interleaving

    US20100039567A1