CN112202456B - Turbo decoding method for broadband power line carrier communication - Google Patents
Turbo decoding method for broadband power line carrier communication Download PDFInfo
- Publication number
- CN112202456B CN112202456B CN202011150905.9A CN202011150905A CN112202456B CN 112202456 B CN112202456 B CN 112202456B CN 202011150905 A CN202011150905 A CN 202011150905A CN 112202456 B CN112202456 B CN 112202456B
- Authority
- CN
- China
- Prior art keywords
- decoding
- information
- iteration
- sub
- decoder
- 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.)
- Active
Links
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
The invention discloses a Turbo decoding method for broadband power line carrier communication, which is based on the tail biting characteristic of Turbo coding and improves the decoding performance by utilizing a bidirectional SOVA decoding method. Decoding is realized by initializing a decoder, performing first iteration decoding and storage, performing non-first iteration decoding and judging whether to stop iteration. Under the condition of not increasing the calculation complexity and the storage space, the invention improves the reliability of decoding by utilizing the tail biting characteristic of the code, reduces the iteration times of a decoder and shortens the decoding time.
Description
Technical Field
The invention relates to power line carrier system communication, in particular to a Turbo decoding method for broadband power line carrier communication.
Background
In recent years, with the development of the communication industry, the power line network can be used as both a power line and a network cable because of the wide coverage area. Therefore, the power line network has a potential to become the best transmission mode in wired transmission communication, but effective transmission of information must be ensured. For power line carrier communication, the reliability of the system is particularly important, and if the reliability is low, the performance of the communication system is reduced, and data transmission is affected. The power line communication technology has many difficulties, such as strong signal attenuation, accompanied by multipath time delay, and more loads on the power line, and can be switched in at any time, any place and any place, so that interference of various noises is formed, and the complexity of the noises can cause serious interference to communication signals. Therefore, the research of the encoding and decoding technology, which is a key point in power line carrier communication, has great significance for improving communication quality and constructing a robust communication system. From the proposed Turbo code, scientists have systematically clarified the iterative decoding principle and deduced the SISO (soft input soft output) algorithm, and proved that the Turbo code has a strong error correction capability by combining with the random interleaver, so that the Turbo code is widely applied to LTE, 802.16m, WCDMA and HomePlug. The traditional Log-Map algorithm is complex in calculation, needs to consume a large amount of storage space, and has large decoding delay due to multiple iterations, so that the requirement of high-speed and real-time data transmission is difficult to meet.
Disclosure of Invention
In order to overcome the defects or shortcomings of the prior art, the invention provides a Turbo decoding method for broadband power line carrier communication, which has the advantages of low decoding calculation complexity, low storage space, short decoding time and high decoding reliability.
The technical problem of the invention is solved by the following technical scheme:
a Turbo decoding method for broadband power line carrier communication comprises the following steps:
Compared with the prior art, the invention has the advantages that:
1. under the condition of not increasing the calculation complexity and the storage space, the reliability of decoding is improved by utilizing the tail biting characteristic of the code; 2. the forward decoding module of the sub-decoder performs forward decoding on input data to obtain information data soft information and the probability (survivor path metric) of each state in the last state of the encoder, the reverse decoding module performs reverse decoding on the input data to obtain information data soft information and the probability (survivor path metric) of each state in the initial state of the encoder, and the soft information and the survivor path metric are respectively merged and stored to further improve the confidence coefficients of the soft information and the survivor path metric, so that the reliability of decoding is improved; 3. when the iteration termination is judged, whether the decoding bit is really stopped or not is checked according to different iteration termination times corresponding to different signal-to-noise ratios, and the maximum iteration time is limited to prevent the occurrence of dead cycle.
Drawings
The drawings are examples of the invention for further understanding and explanation and therefore should not be considered as limiting the invention. In the drawings:
FIG. 1 is a schematic structural diagram of a decoder of a Turbo decoding method for broadband power line carrier communication according to the present invention;
FIG. 2 is a structural composition diagram of a sub-decoder of the Turbo decoding method for broadband power line carrier communication according to the present invention;
FIG. 3 is a flow chart of iterative decoding of a Turbo decoding method for broadband power line carrier communication according to the present invention;
FIG. 4 is a schematic diagram of a decoding work flow of a sub-decoder of the Turbo decoding method for broadband power line carrier communication according to the present invention;
FIG. 5 is a schematic diagram of path metric transition of the Turbo decoding method for broadband power line carrier communication according to the present invention;
FIG. 6 is a schematic diagram of survivor path metric extraction, storage and transfer of the Turbo decoding method for broadband power line carrier communication according to the present invention;
FIG. 7 is a performance comparison result diagram (PB40) of the Turbo decoding method for broadband power line carrier communication and the conventional decoding method of the present invention;
FIG. 8 is a performance comparison result diagram (PB136) of the Turbo decoding method for broadband power line carrier communication according to the present invention and the conventional decoding method;
FIG. 9 is a performance comparison result diagram (PB520) of the Turbo decoding method for broadband power line carrier communication according to the present invention and the conventional decoding method;
Detailed Description
The present invention will be described in further detail with reference to the accompanying drawings and embodiments
The parameter setting of the Turbo decoding method for broadband power line carrier communication according to the embodiment is shown in the following table 1:
TABLE 1
| Parameter(s) | Value taking |
| Coding method | (2,1,3) convolutional code in HomePlug protocol |
| Channel with a plurality of channels | AWGN |
| Modulation system | BPSK |
| |
1/2 |
| Decoding sequence length | PB40(40*8bit)、PB136(136*8bit)、PB520(520*8bit) |
| Number of |
2 |
| Number of decoding modules | 4 (each sub-decoder comprises a forward decoding module and a reverse decoding module) |
The Turbo decoding method of the embodiment is directed to a decoder structure shown in fig. 1, and the decoder includes two sub-decoders, the two sub-decoders perform serial iterative decoding, each sub-decoder includes two forward and reverse decoding modules, and the two forward and reverse decoding modules process data in parallel. For each decoding process as shown in fig. 2, the sub-decoder 1 receives the information bits versus the soft information xk1、xk2And check bit soft information pkAnd a priori information La(xk) The data is transmitted to the forward decoding module and the reverse decoding module at the same time, and the data entering the reverse decoding module is processed in reverse before the forward decoding module and the reverse decoding module, namely the data is sequentially processed from [ a ]1,a2,…,an-1,an]Become [ a ]n,an-1,…,a2,a1]The two decoding modules carry out decoding work in parallel, and the forward decoding module finishes processing the last group of effective data anTime-fetch survivor path metric M11After the last group of data a is processed by the reverse decoding module1Time-fetch survivor path metric M12Merging and storing the survivor path metrics output by the two decoding modules
The posterior soft information output after the forward and reverse decoding modules finish decoding work is respectively L used as the initial path measurement of the next iteration11(xk) And L12(xk) Wherein L is12(xk) The a posteriori soft information output by the inverse module is processed in the inverse direction, L11(xk) And L12(xk) Through merging
Processed as a posteriori soft information L output by the sub-decoder 11(xk) Posterior soft information L1(xk) Is attenuated to d by a first-stage attenuator1*L1(xk) Then, the prior information and the soft information of the information bit are subtracted to obtain d1*L1(xk)-L1(xk)-2LcxkFinally, the external information L output by the sub-decoder 1 is obtained through the correction of a secondary attenuatore(xk)＝d2*(d1*L1(xk)-L1(xk)-2Lcxk) Pairing information bits to soft information xk1、xk2Extrinsic information L output from sum sub-decoder 1e(xk) Interweaving to obtain x'k1、x′k2、L′e(xk) X'k1、x′k2、L′e(xk) And check information qkThe sub-decoder 2 has the same decoding process as the sub-decoder 1 as the input of the sub-decoder 2, but the sub-decoder 2 outputs extrinsic information L ″e(xk) The de-interleaved data is needed and then transmitted to the sub-decoder 1 for prior information. And if the termination condition is met, terminating the iteration and outputting a hard decision result to obtain a decoding output bit, otherwise, iterating to the maximum iteration times and outputting a hard decision result to obtain a decoding output bit.
As shown in fig. 3, in the Turbo decoding method of the embodiment, the iteration process in each sub-decoder includes 4 steps:
step 1) initializing a decoder.
In this step, the decoder needs to be initialized and assigned, including survivor path metrics of the two decoding modules, the backtracking length of decoding, the attenuation coefficients of the four attenuators, the prior information of the sub-decoder 1, and the like.
Initial value M of survivor path metric of sub-decoder 11(s)＝0，s＝0，1，…，7
Initial value M of survivor path metric of sub-decoder 22(s)＝0，s＝0，1，…，7
Traceback length T of sub-decoder 11＝24
Traceback length T of sub-decoder 22＝24
Attenuation coefficient d of attenuator 11＝0.5
Attenuation coefficient d of attenuator 22＝1
Attenuation coefficient d of attenuator 33＝0.5
Attenuation coefficient d of attenuator 44＝1
A priori information L of sub-decoder 1a(xk)＝0，xkFor receiving information sequences
It should be noted that the initialization assignment of the decoder in this step is not limited to the above assignment nor to the above parameters.
Step 2) first iteration decoding and storing, utilizing the initialization assignment of the decoder in step 1, and according to the received information bit, soft information xk1、xk2And check bit soft information pkForward decoding moduleParallel decoding in reverse decoding module to output posterior soft information L1(xk) And updating the survivor path metric M1As the initial value of the survivor path metric for the next iteration.
The method comprises the following specific steps:
as shown in FIG. 1, the data input into the decoder is first transferred to the sub-decoder 1, in the sub-decoder 1, one path of input is directly input into the forward decoding module, and the other path of input is processed by the reverse module, and then the data is sequentially processed by [ a ]1,a2,…,an-1,an]Become [ a ]n,an-1,…,a2,a1]And then input to a reverse decoding module.
As shown in fig. 4, the data processing method in the two decoding modules is the same, and a forward decoding module is taken as an example for explanation, and the specific steps of data processing in the forward decoding module are as follows:
step 6), in the forward decoding module, zero padding is carried out on the input data according to the set backtracking length and according to xk1、xk2、pkAccording to a formula
Branch metrics were calculated, with 8 possibilities.
Step 7), as shown in fig. 5, the initial value of the survivor path metric is used as the starting point, and the path branch is performed according to the state transition of fig. 2, wherein the path branch is formed by xk1、xk2Thus, there are 4 branch paths to each state, and the confidence of each path is obtained by summing the survivor path metric and the branch metric, i.e. the code bits of
Step 8), processing the four paths reaching each state to obtain corresponding input xk1、xk2Soft information in this state, x is obtainedk1The soft information method comprises the following steps:
to obtain xk2The soft information method comprises the following steps:
and 9), comparing the credibility of the four paths reaching each state, only reserving one path with the highest credibility as a survival path, and aiming at the encoder, wherein the total number of the survival paths is 8, so that after each update, the total number of the survival paths is reserved, and the end point of each path corresponds to one state.
And step 10), along with the processing of the input data, the survivor path continuously tends to be converged within the backtracking length range, and the calculated bit soft information is selected while the survivor path is selected.
And 11), when the index of the processed data group is larger than the trace-back length, starting to output the soft information of the bit pair.
And step 12), when the last group of effective data is processed, saving the survivor path metric at the moment as the initial value of the survivor path metric of the next decoding.
The forward decoding module and the reverse decoding module respectively output a survivor path metric M11And M12And a posteriori soft information L of bit pairs11(xk) And L12(xk) Merging survivor path metrics into
And stored as survivor path metric M of next iteration forward decoding module and backward decoding module1Combining the posterior information into
As a posteriori information L output by the sub-decoder 11(xk)。
A posteriori information L output by the sub-decoder 11(xk) Is attenuated to d by an attenuator 11*L1(xk) Then, the soft information of the prior information and the input bit pair is subtracted to obtain d1*L1(xk)-L1(xk)-2LcxkFinally, the external information L output by the sub-decoder 1 is obtained through the correction of the attenuator 2e(xk)＝d2*(d1*L1(xk)-L1(xk)-2Lcxk) The external information Le(xk) As a priori information input to the sub-decoder 2.
After the sub-decoder 1 finishes decoding, the sub-decoder 2 starts working, and the input prior information is the external information L output by the sub-decoder 1e(xk) The input information bit is x for soft informationk1、xk2Result x 'after interweaving'k1、x′k2The soft information of the check bit is qkThe operation flow of the sub-decoder 1 is repeated to output the external information L'e(xk) This extrinsic information is input as prior information for the next iteration, sub-decoder 1.
Step 3) non-first iteration decoding: the decoded output soft information is updated and the survivor path metric storage is updated.
In this step, the workflow of the two sub-decoders is the same as the workflow of the first iteration, with the difference that: a priori information L input by the sub-decoder 1a(xk) Is the extrinsic information l 'output from the last iteration sub-decoder 2'e(xk) Survival path metric M of sub-decoder 11The initial value of (1) is the survivor path metric stored in the last iteration of sub-decoder (1), the survivor path metric M of sub-decoder (2)2The initial value of (2) uses the survivor path metric stored by the last iteration of the sub-decoder.
As shown in fig. 6, in each iteration, 4 branch metrics are reached by adding branch paths (different branch metrics are formed by the possibility of input data) from the initial survival path metric as a starting point, the reliability of the four path metrics is compared, one path metric with the highest reliability is reserved for each state as the survival path metric, and when the last group of valid data is processed, the survival path metric at this time is extracted as an initial value of the survival path metric of the next iteration.
And performing iterative decoding by using the input data and the initial value, and outputting likelihood ratio soft information of corresponding bits from the starting time to the ending time. During decoding, a bidirectional SOVA decoding mode with low calculation complexity and small storage space is adopted.
Step 4) judging whether to stop iteration: judging whether the iteration is equal to the maximum iteration number, if so, stopping the iteration, performing hard judgment to output a decoding bit, otherwise, judging whether the iteration number corresponding to the signal-to-noise ratio is reached, if so, further judging, and otherwise, continuing the iteration.
If the iteration times reach the iteration times set by the corresponding signal-to-noise ratio, the output of the decoder is decoded by hard decision, whether the termination condition is met or not is judged, if so, the iteration is finished, and if not, the decoding is output by hard decision after the iteration is continued to the maximum iteration times.
The decoding termination condition is judged by performing CRC check on the hard decision decoding bit, the CRC check is passed, the decoding termination condition is considered to be met, the hard decision output can also be performed on the soft information output by the two sub-decoders, the hard decision output of the two sub-decoders is completely the same, and the decoding termination condition is considered to be met.
The CRC check method adopted in this embodiment determines whether the decoding termination condition is satisfied.
In this embodiment, the set maximum number of iterations is 4, and the number of iterations corresponding to the signal-to-noise ratio is: and decoding the signal to noise ratio (SNR) of 0-5 dB according to the maximum iteration number, wherein the SNR is 5-10 dB, the iteration number corresponding to the signal to noise ratio is 3, the SNR is 10-20 dB, the iteration number corresponding to the signal to noise ratio is 2, the SNR is more than 20dB, and the iteration number corresponding to the signal to noise ratio is 1.
By the iteration stop criterion of the above embodiment, the number of iterations can be effectively reduced, thereby reducing the decoding delay.
In order to more intuitively explain the performance of the invention, the Turbo decoding method of the embodiment is compared with the traditional bidirectional SOVA decoding method. By controlling the variable method, the parameters of the two decoding methods, such as backtracking length, attenuator coefficient, iteration times and the like, are set to be completely the same, and the difference is that: in the conventional bidirectional SOVA decoding method, a forward decoding module and a reverse decoding module in a sub-decoder initialize an initial value of a survivor path metric to a zero sequence at the beginning of each iteration. In comparison, the decoding algorithms in the embodiment and the conventional method both use a bidirectional SOVA decoding algorithm under a gaussian channel, the decoding sequences are PB40, PB136, and PB520, and BPSK modulation, and the comparison results are shown in fig. 7, 8, and 9. As can be seen from the figure, for different PB blocks, the performance of the embodiment is significantly improved in terms of both the bit error rate and the packet error rate, and the embodiment does not increase additional resource consumption. Meanwhile, the bidirectional SOVA algorithm is simple in complexity and low in resource consumption. Therefore, the embodiment improves the reliability of decoding without increasing the complexity of the algorithm and the resource consumption, and is a more excellent decoding scheme.
The foregoing is a more detailed description of the invention in connection with specific preferred embodiments and it is not intended that the invention be limited to these specific details. For those skilled in the art to which the invention pertains, several alternatives or obvious modifications can be made without departing from the spirit of the invention, and all equivalents in performance or use should be deemed to fall within the scope of the invention.
Claims (6)
1. A Turbo decoding method for broadband power line carrier communication comprises two sub-decoders, wherein each sub-decoder comprises a forward decoding module and a reverse decoding module, the two sub-decoders carry out serial iterative decoding, the forward decoding module and the reverse decoding module carry out parallel processing on data, and in addition, the Turbo decoding method also comprises a two-stage attenuator used for correcting external information, and the Turbo decoding method is characterized in that: the iterative decoding process of the two sub-decoders comprises the following steps:
step 1, initializing a decoder: before iterative decoding, carrying out initialization zero operation on prior information required to be input by a forward decoding module and a reverse decoding module in a sub-decoder 1 and initial values of survivor path metrics of the two sub-decoders;
step 2, iterative decoding and storing for the first time: the forward decoding module and the reverse decoding module respectively carry out forward decoding processing and reverse decoding processing on input information data, check data and prior information, and extract, combine and store the survivor path metrics of the two decoding modules when processing the last group of effective data in the forward direction and the reverse direction respectively, wherein the combining mode is as follows: combining by summing the corresponding states and then dividing by 2; after decoding is completed, log-likelihood ratio extrinsic information values output by the two decoding modules are stored, the extrinsic information values are used as prior information input by the sub-decoder, survivor path metrics are used as initial values of the survivor path metrics of next iteration of the sub-decoder 1, the sub-decoder is not only suitable for single-bit input calculation, but also suitable for double-bit input calculation, and the double-bit input calculation is carried out according to the following formula:
1) equation 1-branch metrics:
in the above formula, xk1、xk2For the two-bit input of the corresponding information sequence, ykTo check information, ui1Is a bipolar representation of i1 (i1 ═ 1, ui1＝1；i1＝0，ui11), likewise ui2Is a bi-polar representation of i2,
is ykBipolar representation of (1), Lk1And Lk2A priori information of i1 and i2 respectively,
(i.e. is
) Is the channel confidence;
2) equation 2-path metric:
in the above formula, the first and second carbon atoms are,
calculating a path metric for the current state for the surviving path metric and the branch metric of the previous state;
3) formula 3-xk1And xk2The log-likelihood ratio posterior information of (1) is respectively:
4) formula 4-xk1And xk2The log-likelihood ratio external information of (1) is respectively:
Le(xk1)＝d2*(d1*LLR(xk1)-Lk1-2Lcxk1)
Le(xk2)＝d2*(d1*LLR(xk2)-Lk2-2Lcxk2)
in the above formula, d1、d2Is an attenuation factor;
step 3, non-first iteration decoding: using survivor path metric information stored in last iteration as initial survivor path metric of two decoding modules in the current iteration, decoding the input data information, the check information and the prior information in parallel by the two modules, outputting likelihood ratio external information, and extracting, combining and storing the survivor path metric information when the last group of effective data is processed;
step 4, judging whether to stop iteration: judging whether the iteration times are equal to the iteration times set by the corresponding signal-to-noise ratio, if so, stopping iteration, performing hard judgment on the currently output soft information to obtain information bits, performing check judgment on the information bits, if so, finishing iteration, if not, returning to the step 3, entering the next iterative decoding process, stopping until the maximum iteration times are reached, performing hard judgment, and outputting bit information.
2. The Turbo decoding method according to claim 1, wherein:
in the step 2, the forward decoding module and the reverse decoding module are respectively used for inputting information according to the [ a ]1，a2，…，an-1，an]And according to [ a ]n，an-1，...，a2，a1]And decoding in two directions.
3. The Turbo decoding method according to claim 1, wherein:
the path metric mentioned in claim 1 can be calculated according to equation 2), and the time of the last stored surviving path metric respectively corresponds to the data a of the forward decoding module in claim 2nAnd data a of the reverse decoding module1。
4. The Turbo decoding method according to claim 1, wherein:
in step 3, the initial values of the survivor path metrics of the forward decoding module and the reverse decoding module use the survivor path metrics combined in the last iteration to extract, combine and store the survivor path metrics again when the last effective data is decoded, so as to serve as the initial values of the survivor path metrics of the next iteration.
5. The Turbo decoding method according to claim 1, wherein:
in the step 4, the corresponding iteration times are set according to the signal-to-noise ratio, the iteration times corresponding to the signal-to-noise ratio and the maximum iteration times can be configured by a user, the iteration times can be obtained by table look-up, the iteration times corresponding to the signal-to-noise ratio are less than or equal to the maximum iteration times, when the iteration times corresponding to the signal-to-noise ratio are reached, hard judgment can be performed on soft information output by two sub-decoders to obtain information bits, comparison judgment can also be performed on the soft information output by the sub-decoder 2 only to obtain information bits after hard judgment, CRC (cyclic redundancy check) judgment is performed, if the judgment is passed, the iteration is stopped, if the judgment is not passed, the iteration is continued to the maximum iteration times, the soft information output by the sub-decoder 2 is subjected to hard judgment to obtain information bits, the information bits are not checked, and are directly output.
6. The Turbo decoding method according to claim 1, wherein:
in the step 3 and the step 4, when the forward decoding module and the reverse decoding module in the sub-decoder perform decoding in parallel, a modified bidirectional SOVA (soft output viterbi decoding) algorithm is adopted.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202011150905.9A CN112202456B (en) | 2020-10-24 | 2020-10-24 | Turbo decoding method for broadband power line carrier communication |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202011150905.9A CN112202456B (en) | 2020-10-24 | 2020-10-24 | Turbo decoding method for broadband power line carrier communication |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN112202456A CN112202456A (en) | 2021-01-08 |
| CN112202456B true CN112202456B (en) | 2022-04-29 |
Family
ID=74011047
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202011150905.9A Active CN112202456B (en) | 2020-10-24 | 2020-10-24 | Turbo decoding method for broadband power line carrier communication |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN112202456B (en) |
Family Cites Families (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US7096412B2 (en) * | 2000-06-19 | 2006-08-22 | Trellisware Technologies, Inc. | Method for iterative and non-iterative data detection using reduced-state soft-input/soft-output algorithms for complexity reduction |
| US7107509B2 (en) * | 2002-08-30 | 2006-09-12 | Lucent Technologies Inc. | Higher radix Log MAP processor |
| CN101286817B (en) * | 2008-04-03 | 2011-07-20 | 浙江大学 | General decoding method for conventional binary and double-binary Turbo code |
| CN101834618B (en) * | 2009-03-13 | 2013-03-20 | 富士通株式会社 | Turbo decoding method and turbo decoder |
| CN104168032A (en) * | 2014-08-16 | 2014-11-26 | 复旦大学 | High-performance 16-base Turbo decoder with four degrees of parallelism and compatibility with LTE and WiMAX |
| CN104767537B (en) * | 2015-03-19 | 2018-01-30 | 深圳市力合微电子股份有限公司 | A kind of Turbo interpretation methods for OFDM electric line communication systems |
| CN107124213B (en) * | 2016-02-23 | 2019-12-24 | 中国科学院声学研究所 | Direct self-adaptive bidirectional turbo equalization method in multi-input multi-output system |
| CN106330207B (en) * | 2016-08-22 | 2019-01-29 | 电子科技大学 | Joint-detection decoding algorithm based on Turbo-SCMA system |
| US10491432B1 (en) * | 2018-10-01 | 2019-11-26 | Huawei Technologies Co., Ltd. | System and method for turbo equalization and decoding in a receiver |
-
2020
- 2020-10-24 CN CN202011150905.9A patent/CN112202456B/en active Active
Also Published As
| Publication number | Publication date |
|---|---|
| CN112202456A (en) | 2021-01-08 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US7992073B2 (en) | Decoding device, decoding method, and receiving apparatus | |
| US6799295B2 (en) | High speed turbo codes decoder for 3G using pipelined SISO log-map decoders architecture | |
| US8112698B2 (en) | High speed turbo codes decoder for 3G using pipelined SISO Log-MAP decoders architecture | |
| EP1480347A1 (en) | Digital transmission method of the error-correcting coding type | |
| CN107911195B (en) | CVA-based tail-biting convolutional code channel decoding method | |
| CN111277277B (en) | Method and device for reducing decoding delay of polarization code continuous cancellation table decoding algorithm | |
| US7886209B2 (en) | Decoding device, decoding method, and receiving apparatus | |
| US8413021B2 (en) | Efficient soft value generation for coded bits in a turbo decoder | |
| Wei et al. | A CRC-aided hybrid decoding algorithm for turbo codes | |
| Martin-Vega et al. | Further improvements in SOVA for high-throughput parallel turbo decoding | |
| US8983008B2 (en) | Methods and apparatus for tail termination of turbo decoding | |
| CN112039537B (en) | Polarization code decoding method and implementation device based on right information processing | |
| CN112202456B (en) | Turbo decoding method for broadband power line carrier communication | |
| CN101257315A (en) | Method for duobinary Turbo code to stop iterative decoding | |
| US7031406B1 (en) | Information processing using a soft output Viterbi algorithm | |
| Shao et al. | Early stopping turbo decoders: a high-throughput, low-energy bit-level approach and implementation | |
| Sánchez et al. | High speed low complexity radix-16 max-log-MAP SISO decoder | |
| Ang et al. | Modification of SOVA-based algorithms for efficient hardware implementation | |
| CN103701475A (en) | Decoding method for Turbo codes with word length of eight bits in mobile communication system | |
| Geldmacher et al. | Adaptive low complexity MAP decoding for turbo equalization | |
| Wang et al. | A Novel Decoding Algorithm for BICM-ID Embedded Turbo Codes | |
| Zhang et al. | Research and improvement on stopping criterion of Turbo iterative decoding | |
| CN115514377A (en) | Turbo decoding circuit and decoding method | |
| CN111130692A (en) | Received signal detection method for large-compression-ratio FTN system | |
| Kaur et al. | Iterative decoding of turbo codes |
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 |