CN113114278A - Duobinary Turbo decoding implementation method, system, equipment and application - Google Patents
Duobinary Turbo decoding implementation method, system, equipment and application Download PDFInfo
- Publication number
- CN113114278A CN113114278A CN202110248043.1A CN202110248043A CN113114278A CN 113114278 A CN113114278 A CN 113114278A CN 202110248043 A CN202110248043 A CN 202110248043A CN 113114278 A CN113114278 A CN 113114278A
- Authority
- CN
- China
- Prior art keywords
- decoder
- decoding
- sub
- information
- module
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
- 238000000034 method Methods 0.000 title claims abstract description 79
- 230000008569 process Effects 0.000 claims abstract description 31
- 238000004364 calculation method Methods 0.000 claims abstract description 23
- 230000007704 transition Effects 0.000 claims description 15
- 230000005540 biological transmission Effects 0.000 claims description 9
- 238000005259 measurement Methods 0.000 claims description 8
- 238000012545 processing Methods 0.000 claims description 8
- 238000010295 mobile communication Methods 0.000 claims description 5
- 238000005070 sampling Methods 0.000 claims description 5
- 238000006243 chemical reaction Methods 0.000 claims description 3
- 238000004590 computer program Methods 0.000 claims description 3
- 230000000630 rising effect Effects 0.000 claims description 3
- 238000004891 communication Methods 0.000 abstract description 14
- 125000004122 cyclic group Chemical group 0.000 description 16
- 238000004422 calculation algorithm Methods 0.000 description 10
- 102100026191 Class E basic helix-loop-helix protein 40 Human genes 0.000 description 8
- 101710130550 Class E basic helix-loop-helix protein 40 Proteins 0.000 description 8
- 238000010586 diagram Methods 0.000 description 7
- 102100026190 Class E basic helix-loop-helix protein 41 Human genes 0.000 description 6
- 101000765033 Homo sapiens Class E basic helix-loop-helix protein 41 Proteins 0.000 description 6
- 238000005516 engineering process Methods 0.000 description 4
- 230000006870 function Effects 0.000 description 4
- 230000007547 defect Effects 0.000 description 3
- 238000001514 detection method Methods 0.000 description 3
- 230000006872 improvement Effects 0.000 description 3
- 238000007796 conventional method Methods 0.000 description 2
- 238000013461 design Methods 0.000 description 2
- 238000011161 development Methods 0.000 description 2
- 238000005457 optimization Methods 0.000 description 2
- 238000011160 research Methods 0.000 description 2
- 238000012546 transfer Methods 0.000 description 2
- 101150012579 ADSL gene Proteins 0.000 description 1
- 102100020775 Adenylosuccinate lyase Human genes 0.000 description 1
- 108700040193 Adenylosuccinate lyases Proteins 0.000 description 1
- 238000004458 analytical method Methods 0.000 description 1
- 238000013459 approach Methods 0.000 description 1
- 230000003139 buffering effect Effects 0.000 description 1
- 230000008859 change Effects 0.000 description 1
- 238000013500 data storage Methods 0.000 description 1
- 230000001934 delay Effects 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 239000000835 fiber Substances 0.000 description 1
- 238000012804 iterative process Methods 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 230000003287 optical effect Effects 0.000 description 1
- 230000008092 positive effect Effects 0.000 description 1
- 239000004065 semiconductor Substances 0.000 description 1
- 238000000926 separation method Methods 0.000 description 1
- 239000007787 solid Substances 0.000 description 1
Images
Classifications
-
- H—ELECTRICITY
- H03—ELECTRONIC CIRCUITRY
- H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
- H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
- H03M13/29—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes combining two or more codes or code structures, e.g. product codes, generalised product codes, concatenated codes, inner and outer codes
Landscapes
- Physics & Mathematics (AREA)
- Probability & Statistics with Applications (AREA)
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Error Detection And Correction (AREA)
Abstract
本发明属于通信技术领域，公开了一种双二进制Turbo译码实现方法、系统、设备及应用，所述双二进制Turbo译码实现系统包括：子译码器模块DEC、顶层控制模块、循环状态计算模块、数据缓存模块、交织模块、解交织模块、硬判决模块、输出模块。本发明通过改进整个译码器模块的电路结构，合理的安排整个译码模块的电路结构，使得整个电路只用一个子译码器模块就可以完成整个译码过程，节省大量的硬件资源，减少硬件资源消耗，降低成本；采用新的循环状态获取方法，使得在较低的时延和硬件复杂度下稳定的获取循环状态，减少译码过程的延迟。同时，本发明在译码器顶层控制模块中，无需增加额外的电路消耗，只通过迭代次数就可以控制整个译码流程。
The invention belongs to the technical field of communication, and discloses a dual-binary turbo decoding implementation method, system, device and application. The dual-binary turbo decoding implementation system includes: a sub-decoder module DEC, a top-level control module, and a loop state calculation system. module, data buffer module, interleaving module, de-interleaving module, hard decision module, output module. By improving the circuit structure of the entire decoder module, the present invention reasonably arranges the circuit structure of the entire decoder module, so that the entire circuit can complete the entire decoding process with only one sub-decoder module, saves a lot of hardware resources, reduces the Hardware resource consumption and cost reduction; a new loop state acquisition method is adopted to obtain the loop state stably with lower delay and hardware complexity, reducing the delay of the decoding process. At the same time, in the top-level control module of the decoder, the present invention can control the entire decoding process only through the number of iterations without adding additional circuit consumption.
Description
Technical Field
The invention belongs to the technical field of communication, and particularly relates to a duo-binary Turbo decoding implementation method, a duo-binary Turbo decoding implementation system, duo-binary Turbo decoding equipment and application.
Background
At present, along with the rapid development of modern science and technology, information is visible everywhere in daily life of people, and meanwhile, the information transmission is extremely important. Modern communications are developed towards broadband, digitalization and mobility, and information dissemination into ISDN, ADSL, GSM, CDMA and wireless multimedia technologies is constantly updated, but the most basic requirement of a communication system is to be able to transmit information reliably and quickly. Shannon first stated the channel coding theorem in 1948 and indicated that communication with arbitrarily small error probability can be achieved with channel coding. In modern communications, therefore, the quality of the communication is directly affected by the quality of the channel coding technique. In 1993, Berrou et al proposed a Turbo code, the performance of which approaches the shannon channel capacity limit; the channel coding technique then enters a completely new phase. Currently, Turbo codes are regarded as the most popular technical achievement in information and coding theory research make internal disorder or usurp since the advent of trellis coded modulation technology, which is a milestone in information and coding theory research.
Turbo code is also called as parallel concatenated convolutional code, and its coding actually uses short code to construct pseudo-random code, and adopts iterative decoding idea based on soft input and soft output at receiving end, so that it fully utilizes the advantages of concatenated code, and can approximately implement random coding, and can change short code into long code. In terms of practical application, Turbo codes have not made a major breakthrough in practice for some time due to the complexity and latency of their implementation. Through the development of more than ten years, the Turbo code station is a mainstream stage and has great diversity in the communication field. In the field of deep space communication, Turbo codes are used as a coding standard for deep space remote sensing Data by the council for spatial Data standards council (CCSDS). In the field of mobile communication, Turbo codes have been used as channel coding standards for transmitting high-speed data in third generation mobile communication systems. In addition, in view of the code division multiple access system,
WCDMA, CDMA-2000 and TD-SCDMA all adopt Turbo codes in channel coding.
Bcrrou proposed duobinary Turbo codes in 1996 on the basis of the Tubro code, i.e., the component codes used in Turbo codes adopt RSCs with a basic code rate of 2/3. Compared with the common binary Turbo code, the duobinary Turbo code has the following advantages:
(1) the code rate of the component code is 2/3, which improves the coding efficiency.
(2) The interleaving length is reduced, and the decoding delay is reduced.
(3) The impact of puncturing on decoding performance is reduced.
(4) On the premise of the same complexity, the performance of the duobinary Turbo code is better.
Due to the excellent performance of the duobinary Turbo code, the duobinary Turbo code is widely applied, such as WiMAX and DVB-RCS.
Referring to the Turbo decoding method for the OFDM power line communication system, the overall architecture of the duo-binary Turbo decoding method is shown in fig. 5, and the duo-binary Turbo decoding method includes two sub-decoders DEC1 and DEC2, where the two sub-decoders perform serial iterative decoding. The sub-decoder DEC1 pairs the soft value Y based on the received information bitska、YkbAnd checking the soft bit values to calculate conditional transition probabilities in the branch metrics; the sub-decoder DEC2 calculates conditional transition probabilities in the branch metrics based on the interleaved information bit-pair soft values and the check bit soft values. The sub-decoder DEC1 decodes the information bits by using the self-stored conditional transition probability and the prior information transmitted from the sub-decoder DEC2, and outputs the posterior log-likelihood ratio L (u) of the information bits after decodingk) The hard decision bits based on the LLR and the extrinsic information are interleaved and then transmitted to the sub-decoder DEC2 as a priori information. Then the sub-decoder DEC2 decodes the data using the conditional transition probabilities stored in itself and the prior probabilities transmitted from DEC1, the decoding process is the same as that of the sub-decoder DEC1, but the data output from the sub-decoder DEC2 needs to be deinterleaved and then transmitted to the sub-decoder DEC1 as prior information. Thus, after a plurality of iterative decoding processes, in the ith iterative decoding process (i)>1) And after the decoding of each sub-decoder is finished, iteration termination judgment is carried out, if termination conditions are met, iteration is terminated, a hard judgment result is output, decoding output bits are obtained, and if not, next iteration decoding is carried out.
When the initial state and the termination state of the encoder are consistent, the receiving end needs to accurately predict the state. The general solution to this problem is to obtain the loop state S by means of pre-decoding before starting decodingcThe predicted cycle state is then passed to a formally decoded decoder and the forward and backward state metrics are measuredThe metric state of the state metric β is initialized. The method comprises the following concrete implementation steps:
1. for the pre-decoding first iteration, the initial state is uncertain, so all states are set to equal probability:
α0(s)＝βN(s)＝-mlog2；
2. the loop state is detected once in each iteration, and the detection formula is as follows:
the latter two terms are constant terms, and the omission of constant term calculation does not affect the relative magnitude between the cycle states.
3. Before the next iteration, according to the predicted loop state pair alpha0(s) and betaN(s) initialization:
4. after M rounds of pre-iteration, a reliable loop state S is considered to have been obtainedcAnd then performing a formal iterative process, wherein the initial value of the state metric refers to the formula in the step (3).
In the prior art, the entire duobinary decoder includes two sub-decoders for performing serial iterative decoding. Since the two sub-decoders function identically and each sub-decoder module requires a large amount of computational and memory resources, using this technique consumes a large amount of hardware resources, increasing the cost of baseband signal processing.
In the prior art, the loop state is obtained by one-time pre-decoding, but the loop state detected by each iteration of the pre-decoding is not necessarily the same, and the prediction result tends to be stable only after the pre-decoding iteration reaches a certain number of times.
Duobinary Turbo codes are widely applied to modern digital communication, but because the decoding schemes of the duobinary Turbo codes are all in units of blocks, particularly when an iterative decoding algorithm based on soft input and soft output is used, the decoding algorithm is complex, and large hardware resource consumption and decoding delay are generated in the decoding process, so that the performance of a decoding module can be greatly influenced by the optimization of the decoding algorithm.
In the traditional duo-binary Turbo decoding cyclic iteration process, two sub-decoder modules are required to perform alternate serial decoding. Each sub-decoder module has the same function, and needs to calculate state transition metrics, extrinsic information, likelihood ratio information, etc. according to the input soft information, and a large amount of calculation and storage resources need to be consumed in the calculation process. Therefore, the existence of two sub-decoder modules in the circuit at the same time causes the whole duo-binary Turbo decoding module to consume a large amount of hardware resources, so that the cost of baseband signal processing in the processor is increased.
The duobinary Turbo coding method is 8-state self-tailing cyclic convolutional code, and the initial state and the final state of the coder are always the same. However, at the receiving end, the duobinary Turbo decoder only knows that the initial state and the final state are the same, and cannot know the specific value of the cyclic state. If the loop state cannot be predicted accurately, the overall performance of the decoder is reduced. The conventional method is to make the data pass through a pre-decoding module to obtain the value of the cyclic state, that is, to make the input data perform a decoding process, and to use the last state obtained after the decoding process as the initial state of the decoder, and then perform the subsequent decoding process. This corresponds to an increase in the number of decoding iterations, causing additional decoding delay.
Through the above analysis, the problems and defects of the prior art are as follows:
(1) in the existing duo-binary decoder, because the two sub-decoders have the same function and each sub-decoder module needs a large amount of calculation and storage resources, the use of the technology consumes a large amount of hardware resources and increases the cost of baseband signal processing.
(2) In the existing duo-binary decoder, a cyclic state is obtained through one-time pre-decoding, a prediction result tends to be stable after pre-decoding iteration reaches a certain number of times, and the decoder can start decoding only after waiting for a detection result of the cyclic state, so that the delay of the decoder is increased.
(3) Because the decoding scheme of the duo-binary Turbo code is based on the block unit, when the iterative decoding algorithm based on soft input and soft output is used, the decoding algorithm is more complex, and the decoding process has larger hardware resource consumption and decoding delay, the performance of a decoding module can be greatly influenced by the optimization of the decoding algorithm.
(4) In the traditional duobinary Turbo decoding calculation process, a large amount of calculation and storage resources are required to be consumed, and the fact that two sub-decoder modules exist in a circuit at the same time can cause the whole duobinary Turbo decoding module to consume a large amount of hardware resources, so that the cost of baseband signal processing in a processor is increased.
(5) In the duobinary Turbo coding method, a duobinary Turbo decoder at a receiving end only knows that the initial state and the final state are the same, but cannot know the specific value of the cycle state. If the loop state cannot be predicted accurately, the overall performance of the decoder is reduced. The conventional method increases the number of decoding iterations, resulting in additional decoding delay.
The difficulty in solving the above problems and defects is:
the duo-binary Turbo decoding adopts a cyclic iterative decoding algorithm, and is compared with other channel decoding schemes; the duo-binary Turbo decoding algorithm has very high complexity and very high hardware implementation difficulty, and a lot of storage resources and calculation resources are consumed in the process. And the decoding requires repeated iterations, the decoding delay is large. Two sub-decoder modules are required in the traditional duobinary decoding module, and the resource consumption of each sub-decoder module is very large, so that the whole decoding module needs to consume more resources. The conventional way of pre-decoding to obtain the loop state results in a larger decoding delay. Therefore, the whole decoding module must take into account many factors such as hardware implementation complexity, resource consumption, time delay, decoding performance, etc., and obtain an optimal solution on the basis.
The significance of solving the problems and the defects is as follows: the baseband signal processing is a vital part of the whole communication system, and the channel decoding module affects the accuracy and transmission rate of data transmission of the whole communication system. Therefore, the design of a decoding circuit with low complexity, small time delay and low resource consumption has great effect on the performance improvement of the whole communication system.
Disclosure of Invention
Aiming at the problems in the prior art, the invention provides a duo-binary Turbo decoding implementation method, a duo-binary Turbo decoding implementation system, duo-binary Turbo decoding equipment and application.
The invention is realized in this way, a duo-binary Turbo decoding realization method, which includes the following steps:
step one, the sub-decoder module receives the soft value Y of the information bitkp1、Ykp2And checking the bit soft value Yka、YkbCaching, wherein a top-level control module controls the soft value of the information bit to be interleaved and cached;
step two, the top control module judges the current iteration times to select the information bit soft value or the interleaved information bit soft value as the information sequence input by the current sub-decoder;
step three, selecting a soft value Y of the check bitkaOr YkbAs the check sequence input to the current sub-decoder; selecting interleaving or de-interleaving module to output prior information L as current sub-decoder inputa(uk) The first iterative decoding defaults to 0;
step four, the control parameters are input into the sub-decoder module to calculate the state transition measurement, the external information and the output soft information; and after the decoding of each sub-decoder module is finished, the top-layer control module judges whether the iteration times are reached.
The method comprises the following steps: turbo coding is a cyclic iterative coding, and requires buffering of input soft information for each iterative decoding.
Step two: the encoder circuit has two identical component encoder modules, wherein the input bits of the first component encoder module are original information bits, and the input of the second component encoder module is interleaved information bits. And the decoder circuit corresponds to the encoder circuit. Since there is only one sub-decoder block in the decoding circuit, each iteration requires the control of the soft information input of the sub-decoder block. The iteration times are used for controlling the process, and the hardware implementation complexity is reduced.
Step three: turbo decoding is cyclic iterative decoding, and decoding information is exchanged between two sub-decoders to improve decoding performance. It is therefore necessary to control the outer information output of the sub-decoder to interleave or deinterleave. Because the whole circuit only uses one sub-decoder module, the external information output of the sub-decoder module is controlled to be interleaved or de-interleaved in each iteration and is used as the prior information input of the next sub-decoder.
Step four: the Turbo decoder is responsible for the calculation among the state transition measurement, the external information and the soft information in the whole decoding process. By adopting the design of module separation, the sub-decoder module is only responsible for calculating the input information, and the control is realized by the top module, so that the whole decoding circuit has simpler structure and more convenient debugging.
Further, in step four, the determining, by the top-level control module, whether the number of iterations is reached includes:
if so, stopping iteration, controlling output soft information to perform de-interleaving, and performing hard decision to obtain a decoding sequence; if not, selecting the output external information of the sub-decoder to enter an interleaver or a de-interleaver, calculating the boundary state output by the sub-decoder module as the initial state value of the next sub-decoder module, and continuing iteration.
Further, the control process of the top control module comprises:
(1) controlling the input information bit soft value and the check bit soft value to perform serial-parallel conversion, and dividing the input information bit soft value and the check bit soft value into two lines to be cached in a BRAM (broadband remote access module); meanwhile, counting the input enabling signal and determining the Tubro decoding code length L; inputting the soft value of the information bit into an interleaving module for interleaving, and caching the interleaved information sequence;
(2) top layerThe control module starts decoding, the iteration number cnt of the initialized parameter decoding is 0, and the prior information La(uk) Is 0, code length L;
(3) when the cnt value is judged to be an even number, the information bit soft value and the check bit soft value Y are selectedkaThe output of the de-interleaver is used as the input of the information sequence, the check sequence and the prior information of the sub-decoder, and the output of the external information L is controlled after the decoding of the sub-decoder is finishede(uk) Entering an interleaver for interleaving; when the cnt value is judged to be odd, the soft value of the interleaved information bit and the soft value Y of the check bit are selectedkbThe output of the interleaver is used as the input of the information sequence, the check sequence and the prior information of the sub-decoder, and the output of the external information L is controlled after the decoding of the sub-decoder is finishede(uk) Entering a de-interleaver for de-interleaving;
(4) after each time of decoding of the sub-decoder, performing rising edge sampling on an output effective signal of the sub-decoder; when the sampling signal is valid, the cnt value is increased by 1;
(5) judging whether the cnt value reaches the number of the loop iteration times; if so, ending the loop iteration, and controlling the sub-decoder to output soft information for de-interleaving; soft information enters a hard decision module after de-interleaving to obtain a decoding output sequence; if not, returning to the step (3) and continuing the iteration.
Further, the control process of the loop state calculation module includes:
(1) in the first iteration, all states are set to be equal, and N states are set in total, so that the initial state P is-log (N);
(2) inputting the initial state into a sub-decoder module, and obtaining a forward state metric end state alpha after the first iteration is completed through the calculation of the sub-decoder moduleN(s) and last state of backward state metric beta0(s) post output, s ═ 1,2,3 …, 8;
(3) to prevent forward state metrics alphak(s, s') and a backward state metric βk(s, s') overflowing in the iterative computation, converting the cycle state value into a cycle state probability value for transmission;
(4) initializing forward state metrics and backward state metrics of the sub-decoder module with initial _ state(s) before the start of the next decoding iteration;
(5) and (4) circularly iterating according to the method from the step (2) to the step (4) until the decoding is completed.
Further, in the step (3), the calculation of the cycle state probability value includes the following steps:
1) find the sum state _ sum(s) of the forward state metric and the backward state metric:
state_sum(s)＝αN(s)+β0(s)；
2) the initial _ state(s) is calculated as follows:
further, in step (4), initializing the forward state metric and the backward state metric of the sub-decoder module with initial _ state(s) before the next decoding iteration starts, including:
α1～8 0(s)＝β1～8 N(s)＝initial_state(s)。
it is a further object of the invention to provide a computer device comprising a memory and a processor, the memory storing a computer program which, when executed by the processor, causes the processor to perform the steps of:
the sub-decoder module receives the soft value Y of the information bitkp1、Ykp2And checking the bit soft value Yka、YkbCaching, wherein a top-level control module controls the soft value of the information bit to be interleaved and cached;
the top-level control module judges the current iteration times to select the information bit soft value or the interleaved information bit soft value as the information sequence input by the current sub-decoder;
selecting soft value Y of check bitkaOr YkbAs the check sequence input to the current sub-decoder; selecting the output of the interleaving or de-interleaving module as the input of the current sub-decoderA priori information La(uk) The first iterative decoding defaults to 0;
the control parameters are input into the sub-decoder module to calculate the state transition measurement, the external information and the output soft information; and after the decoding of each sub-decoder module is finished, the top-layer control module judges whether the iteration times are reached.
The invention also aims to provide an information data processing terminal, which is used for realizing the duo-binary Turbo decoding realization method.
Another objective of the present invention is to provide a duo-binary Turbo decoding implementation system for implementing the duo-binary Turbo decoding implementation method, wherein the duo-binary Turbo decoding implementation system comprises:
a sub-decoder module DEC for soft values Y of the received information bitskp1、Ykp2And checking the bit soft value Yka、YkbCaching, calculating state transition measurement, external information and output soft information;
the top-level control module is used for controlling the soft value of the information bit to be interleaved and cached, and judging the current iteration times to select the soft value of the information bit or the interleaved soft value of the information bit as an information sequence input by the current sub-decoder; meanwhile, after the decoding of each sub-decoder module is finished, whether the iteration times are reached is judged;
the loop state calculation module is used for performing loop iteration until decoding is completed;
a data buffer module for performing soft value Y of information bitkp1、Ykp2And checking the bit soft value Yka、YkbCaching;
an interleaving module for outputting the prior information L as the input of the current sub-decodera(uk) The first iterative decoding defaults to 0;
a de-interleaving module for outputting the prior information L as the input of the current sub-decodera(uk) The first iterative decoding defaults to 0.
The invention also aims to provide a mobile communication control system, which is used for realizing the duo-binary Turbo decoding realization method.
By combining all the technical schemes, the invention has the advantages and positive effects that: according to the duobinary Turbo decoding implementation system provided by the invention, the circuit structure of the whole decoder module is improved, and the circuit structure of the whole decoder module is reasonably arranged, so that the whole decoding process can be completed by only one sub-decoder module of the whole circuit, a large amount of hardware resources are saved, the hardware resource consumption is reduced, and the cost is reduced; by adopting the new method for acquiring the circulation state, the circulation state can be stably acquired under the condition of lower time delay and hardware complexity, and the delay of the decoding process is reduced.
In the duobinary Turbo decoder, extra circuit consumption is not increased in a control module at the top layer of the decoder, and the whole decoding process can be controlled only by iteration times. The structure of the duo-binary Turbo decoding circuit is reasonably arranged, so that only one sub-decoder module is arranged in the whole circuit. A large amount of hardware resources are saved, and the hardware cost is reduced.
The receiving end of the invention fully embodies the idea of iterative decoding through the feedback type cyclic state acquisition method, and the structure of the original decoder is not changed, so the method can stably acquire the cyclic state without pre-decoding on the basis of not increasing the complexity of hardware realization, thereby effectively reducing the decoding time delay. In the process of transmitting the circulating state, the circulating state transmission is further improved in consideration of calculating overflow, and the circulating state value is converted into the state probability for transmission.
Drawings
In order to more clearly illustrate the technical solutions of the embodiments of the present invention, the drawings needed to be used in the embodiments of the present invention will be briefly described below, and it is obvious that the drawings described below are only some embodiments of the present invention, and it is obvious for those skilled in the art that other drawings can be obtained according to the drawings without creative efforts.
FIG. 1 is a block diagram of a duo-binary Turbo decoding implementation system according to an embodiment of the present invention;
in the figure: 1. a sub-decoder module DEC; 2. a top layer control module; 3. a cycle state calculation module; 4. a data caching module; 5. an interleaving module; 6. a de-interleaving module; 7. a hard decision module; 8. and a soft output module.
FIG. 2 is a schematic diagram of a duo-binary Turbo decoding implementation system according to an embodiment of the present invention.
FIG. 3 is a flowchart of a duo-binary Turbo decoding implementation method according to an embodiment of the present invention.
Fig. 4 is a loop state acquisition diagram provided by an embodiment of the invention.
FIG. 5 is a block diagram of a prior art duobinary decoding framework according to an embodiment of the present invention.
FIG. 6 is a decoding performance diagram of two loop state acquisition modes according to an embodiment of the present invention.
Detailed Description
In order to make the objects, technical solutions and advantages of the present invention more apparent, the present invention is further described in detail with reference to the following embodiments. It should be understood that the specific embodiments described herein are merely illustrative of the invention and are not intended to limit the invention.
The decoding algorithm is deeply understood, and on the basis of ensuring the decoding performance, the complexity of decoding implementation is simplified, the resource consumption is reduced, and the decoding delay is reduced. The circuit structure is adjusted by simplifying the decoding algorithm. The resource consumption is reduced by increasing the idea of module multiplexing; the two sub-decoders in the conventional decoder are identical, so that the resource consumption is reduced by multiplexing the sub-decoder modules. Duobinary Turbo decoding is cyclic iterative decoding, so the number of iterations determines the decoding delay. The conventional loop state acquisition method needs several pre-decoding, which undoubtedly increases the number of iterations and delays in decoding. Therefore, the method of feedback type loop iteration acquisition is adopted, and the decoding delay is reduced on the basis of ensuring the decoding performance. And moreover, the overflow of data in the hardware implementation process is considered, the state transfer is normalized, and the cycle state transfer is ensured to be correct.
Aiming at the problems in the prior art, the invention provides a duo-binary Turbo decoding implementation method, a duo-binary Turbo decoding implementation system, duo-binary Turbo decoding equipment and application, and the duo-binary Turbo decoding implementation system, duo-binary Turbo decoding implementation equipment and application are described in detail below with reference to the accompanying drawings.
As shown in fig. 1, a duo-binary Turbo decoding implementation system provided in the embodiment of the present invention includes: the device comprises a sub decoder module DEC1, a top layer control module 2, a cycle state calculation module 3, a data cache module 4, an interleaving module 5, a de-interleaving module 6, a hard decision module 7 and a soft output module 8.
A sub-decoder module DEC1 for receiving the soft value Y of the information bitskp1、Ykp2And checking the bit soft value Yka、YkbCaching, calculating state transition measurement, external information and output soft information;
the top-level control module 2 is used for controlling the soft value of the information bit to be interleaved and cached, and judging the current iteration times to select the soft value of the information bit or the interleaved soft value of the information bit as an information sequence input by the current sub-decoder; meanwhile, after the decoding of each sub-decoder module is finished, whether the iteration times are reached is judged;
the loop state calculation module 3 is used for performing loop iteration until decoding is completed;
a data buffer module 4 for carrying out the information bit soft value Ykp1、Ykp2And checking the bit soft value Yka、YkbCaching;
an interleaving module 5 for outputting the prior information L as the input of the current sub-decodera(uk) The first iterative decoding defaults to 0;
a de-interleaving module 6 for outputting the prior information L as the input of the current sub-decodera(uk) The first iterative decoding defaults to 0.
The schematic diagram of a duo-binary Turbo decoding implementation system provided by the embodiment of the invention is shown in fig. 2.
As shown in fig. 3, the duo-binary Turbo decoding implementation method provided by the embodiment of the present invention includes the following steps:
s101, the sub-decoder module receives the soft value Y of the information bitkp1、Ykp2And checking the bit soft value Yka、YkbCaching, wherein a top-level control module controls the soft value of the information bit to be interleaved and cached;
s102, the top control module judges the current iteration times to select the information bit soft value or the interleaved information bit soft value as the information sequence input by the current sub-decoder;
s103, selecting a soft value Y of the check bitkaOr YkbAs the check sequence input to the current sub-decoder; selecting interleaving or de-interleaving module to output prior information L as current sub-decoder inputa(uk) The first iterative decoding defaults to 0;
s104, inputting control parameters into the sub-decoder module to calculate state transition metrics, external information and output soft information; and after the decoding of each sub-decoder module is finished, the top-layer control module judges whether the iteration times are reached.
The technical solution of the present invention is further described with reference to the following examples.
1. It is a first object of the present invention to improve the circuit structure of the entire decoder block so that the entire decoding process can be completed with only one sub-decoder block. Hardware resource consumption is reduced, and cost is reduced. The second purpose of the invention is to obtain the loop iteration state in a new mode, and the loop iteration state can be stably and accurately obtained without pre-decoding, so that the time delay of a decoder is reduced.
2. The block diagram of the duo-binary Turbo decoder aimed at by the invention is shown in fig. 2, and comprises a sub-decoder module DEC; firstly, the received information bit soft value Ykp1、Ykp2And checking the bit soft value Yka、YkbAnd (6) caching. The top control module controls the soft value of the information bit to be interleaved and buffered. Then the top control module judges the current iteration times to select the information bit soft value or the interleaved information bit soft value as the information sequence input by the current sub-decoder; selecting soft value Y of check bitkaOr YkbAs the check sequence input to the current sub-decoder; selectively interleaving or deinterleaving module outputGiving out prior information L as input to current sub-decodera(uk) (the first iterative decoding defaults to 0). The control parameters are input to the sub-decoder module to calculate the state transition metrics, extrinsic information, and output soft information. After the decoding of each sub-decoder module is finished, the top-level control module judges whether the iteration times are reached; if so, stopping iteration, controlling output soft information to perform de-interleaving, and performing hard decision to obtain a decoding sequence. If not, selecting the output external information of the sub-decoder to enter an interleaver or a de-interleaver, calculating the boundary state output by the sub-decoder module as the initial state value of the next sub-decoder module, and continuing iteration.
In the Turbo decoding mode in the specific implementation of the present invention, the control process of the top control module includes the following steps:
(1) controlling the input information bit soft value and the check bit soft value to perform serial-parallel conversion, and dividing the input information bit soft value and the check bit soft value into two lines to be cached in a BRAM (broadband remote access module); meanwhile, the input enable signal is counted to determine the Tubro decoding code length L. Then, the soft value of the information bit is input to an interleaving module for interleaving, and the interleaved information sequence is cached.
(2) The top-level control module starts decoding, the number cnt of initialization parameter decoding iterations is 0, the prior information La (uk) is 0, and the code length L.
(3) When the cnt value is judged to be an even number, the information bit soft value and the check bit soft value Y are selectedkaThe output of the de-interleaver is used as the input of the information sequence, the check sequence and the prior information of the sub-decoder, and the output of the external information L is controlled after the decoding of the sub-decoder is finishede(uk) And entering an interleaver for interleaving. When the cnt value is judged to be odd, the soft value of the interleaved information bit and the soft value Y of the check bit are selectedkbThe output of the interleaver is used as the input of the information sequence, the check sequence and the prior information of the sub-decoder, and the output of the external information L is controlled after the decoding of the sub-decoder is finishede(uk) And entering a de-interleaver for de-interleaving.
(4) After each time of decoding of the sub-decoder, performing rising edge sampling on an output effective signal of the sub-decoder; when the sample signal is active, the cnt value is incremented by 1.
(5) And judging whether the cnt value reaches the number of the loop iteration, if so, ending the loop iteration, and controlling the sub-decoder to output soft information for de-interleaving. And after de-interleaving, the soft information enters a hard decision module to obtain a decoding output sequence. If not, returning to the step (3) and continuing the iteration.
As shown in fig. 4, in the Turbo decoding mode in the specific implementation of the present invention, the loop state calculation module includes the following steps:
(1) in the first iteration, all states are set to be equal, and the initial state P is equal to-log (N) if N states are set.
(2) Inputting the initial state into a sub-decoder module, and obtaining a forward state metric end state alpha after the first iteration is completed through the calculation of the sub-decoder moduleN(s) and last state of backward state metric beta0(s) and then output, s is 1,2,3 …, 8.
(3) To prevent forward state metrics alphak(s, s') and a backward state metric βk(s, s') overflow in the iterative computation, and the cycle state value is converted into a cycle state probability value to be transmitted. The calculation steps of the cycle state probability value are as follows:
1) find the sum state _ sum(s) of the forward state metric and the backward state metric:
state_sum(s)＝αN(s)+β0(s)；
2) the initial _ state(s) is calculated as follows:
(4) initializing forward state metrics and backward state metrics of the sub-decoder module with initial _ state(s) before the start of the next decoding iteration, comprising:
α1～8 0(s)＝β1～8 N(s)＝initial_state(s)。
(5) and (4) circularly iterating according to the method from the step (2) to the step (4) until the decoding is completed.
3. Key point and point to be protected of the invention
(1) In the duobinary Turbo decoder, extra circuit consumption is not increased in a control module at the top layer of the decoder, and the whole decoding process can be controlled only by iteration times. The structure of the duo-binary Turbo decoding circuit is reasonably arranged, so that only one sub-decoder module is arranged in the whole circuit. A large amount of hardware resources are saved, and the hardware cost is reduced.
(2) The receiving end of the invention fully embodies the idea of iterative decoding through the feedback type cyclic state acquisition method, and the structure of the original decoder is not changed, so the method can stably acquire the cyclic state without pre-decoding on the basis of not increasing the complexity of hardware realization, thereby effectively reducing the decoding time delay. In the process of transmitting the circulating state, the circulating state transmission is further improved in consideration of calculating overflow, and the circulating state value is converted into the state probability for transmission.
4. Advantages of the invention
(1) The invention can complete the whole decoding process by only using one sub-decoder through reasonably arranging the decoder circuit structure, thereby saving the hardware resource of one sub-decoder and reducing the hardware cost.
(2) The invention is stable and accurate by a feedback type cyclic state acquisition method, and effectively reduces the decoding delay.
In the duo-binary Turbo decoder, the code length is 520 bytes, and the code rate is 1/2. Respectively implementing hardware of the traditional scheme and the scheme of the invention under the same parameters, and respectively integrating the traditional duo binary Turbo decoding module and the new duo binary Turbo decoding module in Vivado 2017.4 to obtain the resource consumption contrast:
matlab simulates the two cyclic state acquisition methods to acquire an error rate curve graph. The Turbo code length is 520 bytes, the code rate is 1/2, and the Turbo code is pre-decoded once and formally decoded four times by the traditional method. The number of decoding iterations of the feedback iteration method is 4.
As can be seen from fig. 6, in the case of one-time pre-decoding, the decoding performance is very poor because the accuracy of obtaining the loop state is not high after one-time pre-decoding iteration, and if the detection is wrong, the performance of formal iterative decoding is reduced, and the pre-decoding mode has an error code platform in a high signal-to-noise ratio region, and the decoding performance is improved little along with the improvement of the signal-to-noise ratio. If better decoding performance is desired by the pre-decoding method, the number of pre-decoding operations is increased, which increases the decoding delay. And the loop state is obtained by adopting feedback iteration, the decoding performance is good, and the time for pre-decoding can be saved, thereby effectively reducing the decoding delay.
In the above embodiments, the implementation may be wholly or partially realized by software, hardware, firmware, or any combination thereof. When used in whole or in part, can be implemented in a computer program product that includes one or more computer instructions. When loaded or executed on a computer, cause the flow or functions according to embodiments of the invention to occur, in whole or in part. The computer may be a general purpose computer, a special purpose computer, a network of computers, or other programmable device. The computer instructions may be stored in a computer readable storage medium or transmitted from one computer readable storage medium to another, for example, the computer instructions may be transmitted from one website site, computer, server, or data center to another website site, computer, server, or data center via wire (e.g., coaxial cable, fiber optic, Digital Subscriber Line (DSL), or wireless (e.g., infrared, wireless, microwave, etc.)). The computer-readable storage medium can be any available medium that can be accessed by a computer or a data storage device, such as a server, a data center, etc., that includes one or more of the available media. The usable medium may be a magnetic medium (e.g., floppy Disk, hard Disk, magnetic tape), an optical medium (e.g., DVD), or a semiconductor medium (e.g., Solid State Disk (SSD)), among others.
The above description is only for the purpose of illustrating the present invention and the appended claims are not to be construed as limiting the scope of the invention, which is intended to cover all modifications, equivalents and improvements that are within the spirit and scope of the invention as defined by the appended claims.
Claims (10)
1. A duo-binary Turbo decoding implementation method is characterized in that the duo-binary Turbo decoding implementation method comprises the following steps:
the sub-decoder module receives the soft value Y of the information bitkp1、Ykp2And checking the bit soft value Yka、YkbCaching, wherein a top-level control module controls the soft value of the information bit to be interleaved and cached;
the top-level control module judges the current iteration times to select the information bit soft value or the interleaved information bit soft value as the information sequence input by the current sub-decoder;
selecting soft value Y of check bitkaOr YkbAs the check sequence input to the current sub-decoder; selecting interleaving or de-interleaving module to output prior information L as current sub-decoder inputa(uk) The first iterative decoding defaults to 0;
the control parameters are input into the sub-decoder module to calculate the state transition measurement, the external information and the output soft information; and after the decoding of each sub-decoder module is finished, the top-layer control module judges whether the iteration times are reached.
2. The duo-binary Turbo decoding implementation method of claim 1, wherein the determining, by the top-level control module, whether the number of iterations is reached includes: if so, stopping iteration, controlling output soft information to perform de-interleaving, and performing hard decision to obtain a decoding sequence; if not, selecting the output external information of the sub-decoder to enter an interleaver or a de-interleaver, calculating the boundary state output by the sub-decoder module as the initial state value of the next sub-decoder module, and continuing iteration.
3. The duobinary Turbo decoding implementation method of claim 1, wherein the control process of the top control module comprises:
(1) controlling the input information bit soft value and the check bit soft value to perform serial-parallel conversion, and dividing the input information bit soft value and the check bit soft value into two lines to be cached in a BRAM (broadband remote access module); meanwhile, counting the input enabling signal and determining the Tubro decoding code length L; inputting the soft value of the information bit into an interleaving module for interleaving, and caching the interleaved information sequence;
(2) the top-level control module starts decoding, the iteration number cnt of the initialized parameter decoding is 0, and the prior information La(uk) Is 0, code length L;
(3) when the cnt value is judged to be an even number, the information bit soft value and the check bit soft value Y are selectedkaThe output of the de-interleaver is used as the input of the information sequence, the check sequence and the prior information of the sub-decoder, and the output of the external information L is controlled after the decoding of the sub-decoder is finishede(uk) Entering an interleaver for interleaving; when the cnt value is judged to be odd, the soft value of the interleaved information bit and the soft value Y of the check bit are selectedkbThe output of the interleaver is used as the input of the information sequence, the check sequence and the prior information of the sub-decoder, and the output of the external information L is controlled after the decoding of the sub-decoder is finishede(uk) Entering a de-interleaver for de-interleaving;
(4) after each time of decoding of the sub-decoder, performing rising edge sampling on an output effective signal of the sub-decoder; when the sampling signal is valid, the cnt value is increased by 1;
(5) judging whether the cnt value reaches the number of the loop iteration times; if so, ending the loop iteration, and controlling the sub-decoder to output soft information for de-interleaving; soft information enters a hard decision module after de-interleaving to obtain a decoding output sequence; if not, returning to the step (3) and continuing the iteration.
4. The duobinary Turbo decoding implementation method of claim 1, wherein the control process of the round-robin state calculation module includes:
(1) in the first iteration, all states are set to be equal, and N states are set in total, so that the initial state P is-log (N);
(2) inputting the initial state into a sub-decoder module, and obtaining a forward state metric end state alpha after the first iteration is completed through the calculation of the sub-decoder moduleN(s) and last state of backward state metric beta0(s) post output, s ═ 1,2,3 …, 8;
(3) to prevent forward state metrics alphak(s, s') and a backward state metric βk(s, s') overflowing in the iterative computation, converting the cycle state value into a cycle state probability value for transmission;
(4) initializing forward state metrics and backward state metrics of the sub-decoder module with initial _ state(s) before the start of the next decoding iteration;
(5) and (4) circularly iterating according to the method from the step (2) to the step (4) until the decoding is completed.
5. The duobinary Turbo decoding implementation method of claim 4, wherein in the step (3), the calculation of the cycle state probability value comprises the following steps:
1) find the sum state _ sum(s) of the forward state metric and the backward state metric:
state_sum(s)＝αN(s)+β0(s)；
2) the initial _ state(s) is calculated as follows:
6. the duobinary Turbo decoding implementation method of claim 4, wherein in the step (4), the initializing the forward state metric and the backward state metric of the sub-decoder module with initial _ state(s) before the next decoding iteration starts comprises:
α1～8 0(s)＝β1～8 N(s)＝initial_state(s)。
7. a computer device, characterized in that the computer device comprises a memory and a processor, the memory storing a computer program which, when executed by the processor, causes the processor to carry out the steps of:
the sub-decoder module receives the soft value Y of the information bitkp1、Ykp2And checking the bit soft value Yka、YkbCaching, wherein a top-level control module controls the soft value of the information bit to be interleaved and cached;
the top-level control module judges the current iteration times to select the information bit soft value or the interleaved information bit soft value as the information sequence input by the current sub-decoder;
selecting soft value Y of check bitkaOr YkbAs the check sequence input to the current sub-decoder; selecting interleaving or de-interleaving module to output prior information L as current sub-decoder inputa(uk) The first iterative decoding defaults to 0;
the control parameters are input into the sub-decoder module to calculate the state transition measurement, the external information and the output soft information; and after the decoding of each sub-decoder module is finished, the top-layer control module judges whether the iteration times are reached.
8. An information data processing terminal, characterized in that the information data processing terminal is used for implementing the duo-binary Turbo decoding implementation method of any one of claims 1 to 6.
9. A duobinary Turbo decoding implementation system for implementing the duobinary Turbo decoding implementation method according to any one of claims 1 to 6, wherein the duobinary Turbo decoding implementation system comprises:
a sub-decoder module DEC for soft values Y of the received information bitskp1、Ykp2And checking the bit soft value Yka、YkbCaching, calculating state transition measurement, external information and output soft information;
the top-level control module is used for controlling the soft value of the information bit to be interleaved and cached, and judging the current iteration times to select the soft value of the information bit or the interleaved soft value of the information bit as an information sequence input by the current sub-decoder; meanwhile, after the decoding of each sub-decoder module is finished, whether the iteration times are reached is judged;
the loop state calculation module is used for performing loop iteration until decoding is completed;
a data buffer module for performing soft value Y of information bitkp1、Ykp2And checking the bit soft value Yka、YkbCaching;
an interleaving module for outputting the prior information L as the input of the current sub-decodera(uk) The first iterative decoding defaults to 0;
a de-interleaving module for outputting the prior information L as the input of the current sub-decodera(uk) The first iterative decoding defaults to 0.
10. A mobile communication control system, wherein the mobile communication control system is configured to implement the duo-binary Turbo decoding implementation method according to any one of claims 1 to 6.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110248043.1A CN113114278B (en) | 2021-03-07 | 2021-03-07 | Duobinary Turbo decoding implementation method, system, equipment and application |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110248043.1A CN113114278B (en) | 2021-03-07 | 2021-03-07 | Duobinary Turbo decoding implementation method, system, equipment and application |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN113114278A true CN113114278A (en) | 2021-07-13 |
| CN113114278B CN113114278B (en) | 2023-03-14 |
Family
ID=76711015
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202110248043.1A Active CN113114278B (en) | 2021-03-07 | 2021-03-07 | Duobinary Turbo decoding implementation method, system, equipment and application |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN113114278B (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN116979974A (en) * | 2023-08-17 | 2023-10-31 | 石家庄市经纬度科技有限公司 | Turbo code decoding method and Turbo code decoder |
Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20010039636A1 (en) * | 2000-02-10 | 2001-11-08 | Roger Hammons | System and method employing a modular decoder for decoding turbo and turbo-like codes in a communications network |
| US20070300139A1 (en) * | 2006-06-09 | 2007-12-27 | Samsung Electronics Co., Ltd. | Unified stopping criteria for binary and duobinary turbo decoding in a software-defined radio system |
| CN101286817A (en) * | 2008-04-03 | 2008-10-15 | 浙江大学 | Universal Decoding Method for Traditional Binary and Duobinary Turbo Codes |
| US20120106683A1 (en) * | 2009-06-18 | 2012-05-03 | Zte Corporation | Method and apparatus for parallel turbo decoding in long term evolution system (lte) |
| CN102523076A (en) * | 2012-01-04 | 2012-06-27 | 西安电子科技大学 | Universal and configurable high-speed Turbo code decoding system and method thereof |
| CN103354483A (en) * | 2013-06-20 | 2013-10-16 | 西安电子科技大学 | General high-performance Radix-4SOVA decoder and decoding method |
| CN104092470A (en) * | 2014-07-25 | 2014-10-08 | 中国人民解放军国防科学技术大学 | A turbo code decoding device and method |
| CN104579369A (en) * | 2014-12-18 | 2015-04-29 | 中国科学院自动化研究所 | Turbo iterative decoding method and device |
-
2021
- 2021-03-07 CN CN202110248043.1A patent/CN113114278B/en active Active
Patent Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20010039636A1 (en) * | 2000-02-10 | 2001-11-08 | Roger Hammons | System and method employing a modular decoder for decoding turbo and turbo-like codes in a communications network |
| US20070300139A1 (en) * | 2006-06-09 | 2007-12-27 | Samsung Electronics Co., Ltd. | Unified stopping criteria for binary and duobinary turbo decoding in a software-defined radio system |
| CN101286817A (en) * | 2008-04-03 | 2008-10-15 | 浙江大学 | Universal Decoding Method for Traditional Binary and Duobinary Turbo Codes |
| US20120106683A1 (en) * | 2009-06-18 | 2012-05-03 | Zte Corporation | Method and apparatus for parallel turbo decoding in long term evolution system (lte) |
| CN102523076A (en) * | 2012-01-04 | 2012-06-27 | 西安电子科技大学 | Universal and configurable high-speed Turbo code decoding system and method thereof |
| CN103354483A (en) * | 2013-06-20 | 2013-10-16 | 西安电子科技大学 | General high-performance Radix-4SOVA decoder and decoding method |
| CN104092470A (en) * | 2014-07-25 | 2014-10-08 | 中国人民解放军国防科学技术大学 | A turbo code decoding device and method |
| CN104579369A (en) * | 2014-12-18 | 2015-04-29 | 中国科学院自动化研究所 | Turbo iterative decoding method and device |
Non-Patent Citations (2)
| Title |
|---|
| Y. SAOUTER: ""Decoding M-binary turbo codes by the dual method"", 《PROCEEDINGS 2003 IEEE INFORMATION THEORY WORKSHOP (CAT. NO.03EX674)》 * |
| 姜春强等: ""一种低复杂度双二元卷积Turbo码译码算法"", 《电讯技术》 * |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN116979974A (en) * | 2023-08-17 | 2023-10-31 | 石家庄市经纬度科技有限公司 | Turbo code decoding method and Turbo code decoder |
Also Published As
| Publication number | Publication date |
|---|---|
| CN113114278B (en) | 2023-03-14 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN107911195B (en) | CVA-based tail-biting convolutional code channel decoding method | |
| US8719658B2 (en) | Accessing memory during parallel turbo decoding | |
| CN104092470B (en) | A kind of Turbo code code translator and method | |
| WO2014075267A1 (en) | Decoding processing method and decoder | |
| CN104579369B (en) | A kind of Turbo iterative decodings method and code translator | |
| US8112698B2 (en) | High speed turbo codes decoder for 3G using pipelined SISO Log-MAP decoders architecture | |
| CN105634508B (en) | A kind of implementation method of the Turbo decoder of the nearly performance limit of low complex degree | |
| CN101286817A (en) | Universal Decoding Method for Traditional Binary and Duobinary Turbo Codes | |
| CN102523076A (en) | Universal and configurable high-speed Turbo code decoding system and method thereof | |
| CN103427850A (en) | Multi-mode viterbi decoding apparatus and decoding method thereof | |
| CN104767537B (en) | A kind of Turbo interpretation methods for OFDM electric line communication systems | |
| CN103354483B (en) | General high-performance Radix-4SOVA decoder and interpretation method thereof | |
| US7925964B2 (en) | High-throughput memory-efficient BI-SOVA decoder architecture | |
| CN113114278B (en) | Duobinary Turbo decoding implementation method, system, equipment and application | |
| CN107147401B (en) | A Decoding Method Based on Simplified Bibinary Turbo Code Metrics | |
| CN117713928A (en) | A Turbo code change interleaving depth encoding and decoding method for atmospheric laser communications | |
| CN102832954A (en) | Turbo code iterative decoding stopping method based on soft information average minimum value | |
| Lin et al. | Analysis and power evaluation of window‐stopped parallel turbo decoding for LTE rate matching | |
| CN103701475B (en) | Decoding method for Turbo codes with word length of eight bits in mobile communication system | |
| CN108400788A (en) | The hardware implementation method of Turbo decodings | |
| CN101257315A (en) | Method of Iterative Decoding of Duobinary Turbo Code | |
| Huang et al. | A high speed turbo decoder implementation for CPU-based SDR system | |
| Mathana et al. | Low complexity reconfigurable turbo decoder for wireless communication systems | |
| Berns et al. | Channel decoder architecture for 3G mobile wireless terminals | |
| CN111970008B (en) | Turbo code decoder and soft input and soft output method, device and storage medium |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |