CN109547158B - Encoding method and decoding method of Turbo code - Google Patents
Encoding method and decoding method of Turbo code Download PDFInfo
- Publication number
- CN109547158B CN109547158B CN201811320422.1A CN201811320422A CN109547158B CN 109547158 B CN109547158 B CN 109547158B CN 201811320422 A CN201811320422 A CN 201811320422A CN 109547158 B CN109547158 B CN 109547158B
- Authority
- CN
- China
- Prior art keywords
- constellation point
- bits
- sub
- encoder
- symbol
- 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
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L1/00—Arrangements for detecting or preventing errors in the information received
- H04L1/0001—Systems modifying transmission characteristics according to link quality, e.g. power backoff
- H04L1/0009—Systems modifying transmission characteristics according to link quality, e.g. power backoff by adapting the channel coding
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L1/00—Arrangements for detecting or preventing errors in the information received
- H04L1/0001—Systems modifying transmission characteristics according to link quality, e.g. power backoff
- H04L1/0002—Systems modifying transmission characteristics according to link quality, e.g. power backoff by adapting the transmission rate
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L1/00—Arrangements for detecting or preventing errors in the information received
- H04L1/0001—Systems modifying transmission characteristics according to link quality, e.g. power backoff
- H04L1/0033—Systems modifying transmission characteristics according to link quality, e.g. power backoff arrangements specific to the transmitter
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L1/00—Arrangements for detecting or preventing errors in the information received
- H04L1/0001—Systems modifying transmission characteristics according to link quality, e.g. power backoff
- H04L1/0036—Systems modifying transmission characteristics according to link quality, e.g. power backoff arrangements specific to the receiver
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L1/00—Arrangements for detecting or preventing errors in the information received
- H04L1/004—Arrangements for detecting or preventing errors in the information received by using forward error control
- H04L1/0056—Systems characterized by the type of code used
- H04L1/0071—Use of interleaving
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Quality & Reliability (AREA)
- Error Detection And Correction (AREA)
Abstract
The invention discloses a Turbo code coding method and a decoding method, wherein the coding method comprises the following steps: the externally input information bits x (k) are directly subjected to low-order modulation, and the output information bits are marked as x ″ (k); simultaneously sending information bits x (k) to a first sub-encoder; the first sub-encoder receives the information bit x (k) and outputs a check bit y (k); simultaneously, attaching a return-to-zero bit at the tail part of x (k) to ensure that the first sub-encoder is in a zero state after encoding is finished; denote x (k) and the zeroed bits as x' (k); sending the x' (k) to a second sub-encoder after scrambling the sequence by using an interleaver, and outputting check bits z (k); directly carrying out high-order modulation on parity bits y (k) and z (k), and combining the parity bits into a symbol yz (k) to be output simultaneously; after x ″ (k) and yz (k) are alternately switched by the multiplexing module mux, x ″ (k) and yz (k) are alternately output to obtain a data stream Rx (k) with code rate of 1/2. The invention realizes the good error correction capability of the Turbo code under the condition of short code; and achieves better performance than the existing 1/3 code rate with the 1/2 code rate. The invention is applicable to the field of digital communication.
Description
Technical Field
The present invention relates to the field of digital communication, and more particularly, to a Turbo code encoding method and decoding method.
Background
The Turbo code in the prior art is high-performance error correction coding which is very close to the Shannon limit, and the difference between the error rate curve and the theoretical limit can be lower than 0.01 dB. Existing Turbo codes are suitable for long frames containing thousands or more symbols within each frame of data. In a short frame with each frame only containing dozens of symbols, especially in narrow-band communication or fast frequency hopping communication, the error correction capability or coding gain of the existing Turbo code is reduced sharply. Compared with common error correcting codes, such as RS codes and convolutional codes, the error correcting capability of the existing Turbo codes is not improved greatly under the condition of complex operation.
As shown in fig. 1, the construction principle of the Turbo code in the prior art is disclosed. The encoding method of the Turbo code in the prior art is as follows:
step 1: the externally input information bits x (k) are directly output to the multiplexing module mux on the one hand and are simultaneously sent to the first sub-encoder;
step 2: after the first sub-encoder receives X (k), the first sub-encoder outputs a check code Y (k), and simultaneously adds a zero bit at the tail part of X (k) so that the first sub-encoder is in a zero state after encoding is finished; marking X (k) and the zeroed bits as X' (k);
and step 3: sending the X '(k) to a second sub-encoder after the X' (k) is scrambled by an interleaver, and outputting check bits Z (k);
and 4, step 4: processing Y (k) and Z (k) by a puncture processor to obtain P (k);
and 5: and alternately taking out X '(k) from P (k) and X' (k) through a multiplexing module mux, and processing the X '(k) and the X' (k) through a BPSK mapping module to obtain TX (k).
In the prior art, both the first sub-encoder and the second encoder adopt a systematic encoding structure with a code rate of 1/2, but only parity bits y (k) and z (k) are output. Wherein: the data sequence number k is 1,2,3, …, and N is the number of bits transmitted in a frame.
The puncturer is used to puncture a part of y (k), z (k) and reduce the output parity bits p (k), thereby increasing the transmission efficiency. According to different puncturing schemes, y (k), z (k) can be alternately output to obtain p (k), i.e. the overall coding efficiency is 1/2, as shown in fig. 2, in the case of short frame communication, the transmission efficiency is higher and the error correction performance is lower. Both of them may be output, and the overall coding efficiency is 1/3, as shown in fig. 3, in the case of a short frame, the transmission efficiency is low and the error correction performance is high.
The excellent performance of the existing Turbo code is obtained by introducing an interleaver to realize pseudo-random coding, and when the frame length is short, in order to meet the pseudo-randomness as much as possible, a special design rule needs to be used for the interleaver, but the performance is still poor.
On the other hand, two check symbols y (k) and z (k) of the same information bit x (k) cannot be completely deleted, so that each information bit can be sufficiently protected, thereby further restricting the interleaver.
Disclosure of Invention
The invention provides a Turbo code encoding method and a Turbo code decoding method, aiming at solving the problems of low error correction capability and low transmission efficiency of the existing Turbo code in short frame transmission, and the Turbo code encoding method and the Turbo code decoding method can improve the error correction capability and the encoding efficiency of the Turbo code in the short frame transmission, thereby improving the transmission efficiency.
In order to achieve the purpose of the invention, the technical scheme is as follows: a coding method of Turbo code comprises the following steps:
s1: on one hand, the externally input information bits x (k) are directly subjected to low-order modulation, and at the moment, the output information bits are marked as x "(k); simultaneously sending information bits x (k) to a first sub-encoder;
s2: the first sub-encoder receives the information bit x (k) and outputs a check bit y (k); simultaneously, adding a zero bit at the tail part of x (k) so that the first sub-encoder is in a zero state after encoding is finished; denote x (k) and the zeroed bits as x' (k);
s3: sending the x' (k) to a second sub-encoder after scrambling the sequence by using an interleaver, and outputting check bits z (k);
s4: directly carrying out high-order modulation on parity bits y (k) and z (k), combining the parity bits into a symbol yz (k) and outputting the symbol yz (k) simultaneously;
s5: after x "(k) and yz (k) are alternately switched by the multiplexing module mux, x" (k) and yz (k) are alternately output to obtain a data stream Rx (k) with code rate of 1/2;
wherein: the data sequence number k is 1,2,3, …, N is the number of bits transmitted in a frame.
Preferably, in step S1, the low order modulation is modulated by using a BPSK mapping module.
Further, the BPSK mapping module may be configured to map any one of the following:
1) when x (k) is 0, the constellation point is on the left side, and when y (k) is 1, the constellation point is on the right side;
2) when x (k) is 1, the constellation point is on the left side, and when y (k) is 0, the constellation point is on the right side;
3) when x (k) is 0, the constellation point is on the upper side, and when y (k) is 1, the constellation point is on the lower side;
4) when x (k) is 1, the constellation point is on the upper side, and when y (k) is 0, the constellation point is on the lower side.
Preferably, in step S4, the high-order modulation is modulated by using a QPSK mapping module.
Further, the digital-analog signal mapping mode of the QPSK mapping module is any one of the following:
a) when y (k) is 0, the constellation point is on the left side, when y (k) is 1, the constellation point is on the right side, when z (k) is 0, the constellation point is on the lower side, and when z (k) is 1, the constellation point is on the upper side;
b) when y (k) is 1, the constellation point is on the left side, when y (k) is 0, the constellation point is on the right side, when z (k) is 1, the constellation point is on the lower side, and when z (k) is 0, the constellation point is on the upper side;
c) when y (k) is 1, the constellation point is on the upper side, when y (k) is 0, the constellation point is on the lower side, when z (k) is 1, the constellation point is on the left side, and when z (k) is 0, the constellation point is on the right side;
d) when y (k) is 0, the constellation point is on the upper side, when y (k) is 1, the constellation point is on the lower side, when z (k) is 0, the constellation point is on the left side, and when z (k) is 1, the constellation point is on the right side;
wherein: y (k) represents the real part of the QPSK symbol; z (k) represents the imaginary part of the QPSK symbol.
The invention also provides a decoding method based on the encoding method of the Turbo code, which comprises the following steps:
t1: the receiver receives the data stream Rx (k) and corresponding symbol R to yz (k)yz(k) Taking its real part and multiplying by
Obtaining the symbol R corresponding to y (k)y(k) (ii) a Get Ryz(k) And multiplied by the imaginary part of
Obtaining the symbol R corresponding to z (k)z(k)；
T2: BPSK symbol R corresponding to x (k)x(k) And combining the data to obtain a reception data sequence with the code rate of 1/3, and finishing decoding.
The invention has the following beneficial effects: the invention does not carry on the puncturing processing to check bit y (k) and z (k), but adopt QPSK mapping module to carry on the high-order modulation, merge into a symbol yz (k) and export at the same time, pass multiplexing module mux with x (k) and get 2N symbols, the code rate is 1/2; in a decoding stage, the 1/2 code rate received data is recovered into 1/3 code rate coded data, namely 1/2 code rate is used for realizing better performance than 1/3 code rate; the error correction capability under the condition of short codes is effectively improved, and the performance improvement of about 3dB can be obtained. The basic principle and the implementation method of Turbo coding and decoding are not changed, and only peripheral processing is changed, so that the compatibility is good, and the difficulty in development and application is low.
Drawings
FIG. 1 is a schematic diagram of the encoding principle of a conventional Turbo code.
Fig. 2 shows data transmitted at code rate1/2 in the encoding principle of the conventional Turbo code.
Fig. 3 shows data transmitted at code rate1/3 in the encoding principle of the conventional Turbo code.
FIG. 4 is a schematic diagram of the encoding principle of the Turbo code of the present invention.
Fig. 5 shows the content of the inventive data stream rx (k).
Fig. 6 is a BPSK constellation of the present invention.
Fig. 7 is a QPSK constellation of the present invention.
Fig. 8 shows the content of the received data stream rx (k) in the receiver according to the invention.
Fig. 9 is a reassembled received data stream of the present invention.
Fig. 10 is a graph comparing error correction performance of the present invention with that of the prior art.
Detailed Description
The invention is described in detail below with reference to the drawings and the detailed description.
Example 1
As shown in fig. 4, the encoding method of the Turbo code according to the present invention includes the following steps:
s1: on one hand, the externally input information bits x (k) are directly subjected to low-order modulation, and at the moment, the output information bits are marked as x "(k); simultaneously sending information bits x (k) to a first sub-encoder;
s2: the first sub-encoder receives the information bit x (k) and outputs a check bit y (k); simultaneously, attaching a return-to-zero bit at the tail part of x (k) to ensure that the first sub-encoder is in a zero state after encoding is finished; let x (k) and the zeroed bits be x' (k);
s3: sending the x' (k) to a second sub-encoder after scrambling the sequence by using an interleaver, and outputting check bits z (k);
s4: directly carrying out high-order modulation on parity bits y (k) and z (k), combining the parity bits into a symbol yz (k) and outputting the symbol yz (k) simultaneously;
s5: after x "(k) and yz (k) are alternately switched by the multiplexing module mux, x" (k) and yz (k) are alternately output to obtain a data stream Rx (k) with code rate of 1/2;
wherein: the data sequence number k is 1,2,3, …, N is the number of bits transmitted in a frame.
In this embodiment, the low-order modulation in step S1 is modulated by using a BPSK mapping module. The BPSK mapping module is mapped in any one of the following modes:
1) when x (k) is 0, the constellation point is on the left side, and when y (k) is 1, the constellation point is on the right side;
2) when x (k) is 1, the constellation point is on the left side, and when y (k) is 0, the constellation point is on the right side;
3) when x (k) is 0, the constellation point is on the upper side, and when y (k) is 1, the constellation point is on the lower side;
4) when x (k) is 1, the constellation point is on the upper side, and when y (k) is 0, the constellation point is on the lower side.
The high-order modulation described in this embodiment uses a QPSK mapping module for modulation. The mapping mode of the digital-analog signal of the QPSK mapping module is any one of the following modes:
a) when y (k) is 0, the constellation point is on the left side, when y (k) is 1, the constellation point is on the right side, when z (k) is 0, the constellation point is on the lower side, and when z (k) is 1, the constellation point is on the upper side; as shown in FIG. 7 (A);
b) when y (k) is 1, the constellation point is on the left side, when y (k) is 0, the constellation point is on the right side, when z (k) is 1, the constellation point is on the lower side, and when z (k) is 0, the constellation point is on the upper side; as shown in FIG. 7 (B);
c) when y (k) is 1, the constellation point is on the upper side, when y (k) is 0, the constellation point is on the lower side, when z (k) is 1, the constellation point is on the left side, and when z (k) is 0, the constellation point is on the right side; as shown in FIG. 7 (C);
d) when y (k) is 0, the constellation point is on the upper side, when y (k) is 1, the constellation point is on the lower side, when z (k) is 0, the constellation point is on the left side, and when z (k) is 1, the constellation point is on the right side; as shown in FIG. 7 (D);
wherein: y (k) represents the real part of the QPSK symbol; z (k) represents the imaginary part of the QPSK symbol.
The implementation is in the selection of BPSK constellation and QPSK constellation, the two are independent from each other, and any one group is selected.
The invention also provides a decoding method based on the encoding method of the Turbo code, and the decoding method
The method comprises the following steps:
1) the receiver will receive the data stream rx (k), as shown in fig. 8, for the symbol R corresponding to yz (k)yz(k) Taking its real part and multiplying by
Obtaining the symbol R corresponding to y (k)y(k) (ii) a Get Ryz(k) And multiplied by the imaginary part of
Obtaining the symbol R corresponding to z (k)z(k)；
2) BPSK symbol R corresponding to x (k)x(k) And combined together to obtain a 1/3 code rate received data sequence, as shown in fig. 9, and decoding is completed.
In the encoding method of the Turbo code, from the radio frequency, the frequency spectrum efficiency is equivalent to that of the prior art shown in FIG. 2, namely 1/2 code rate; the power, occupied frequency band bandwidth, duration and the like of the two are not different.
The Turbo code decoding method can recover yz (k) to y (k), z (k) in a receiver from the decoding point of view, belongs to 1/3 code rate, and has better error code performance compared with 1/2 code rate in the prior art.
As shown in FIG. 10, the error correction performance is compared
Fig. 10 is a comparison of error correction performance for three Turbo schemes when the frame length N is 32. Wherein the content of the first and second substances,
v1, Rate1/2 is the puncturing scheme of FIG. 2 in the prior art, and the number of symbols per frame is 2N;
v1, Rate1/3 is the prior art puncturing scheme of FIG. 3, the number of symbols per frame is 3N;
v2 is the scheme of the invention of fig. 5, the number of symbols per frame being 2N.
N-32 belongs to a very short code, and referring to the curve in the figure, the following conclusion is reached:
the frequency bandwidth occupied by the three schemes is the same;
(1) compared with V2, V1, Rate1/2, the number of symbols required to be transmitted is 2N, and the time utilization rates of the two are the same; BER 10 at bit error rate-6The required bit signal to noise ratio of V2 is 3dB lower; alternatively, the bit error rate of V2 is orders of magnitude lower at the same signal-to-noise ratio.
(2) Compared with V2, the check bits of V1 and the check bits of the Rate1/3 are not deleted, but the number of symbols to be transmitted of V1 and the Rate1/3 is 3N, so that the efficiency is low; BER 10 at bit error rate-6The required bit signal-to-noise ratio of V2 is 1.8dB lower.
Therefore, the invention gives consideration to the spectrum efficiency, the time efficiency and the transmission performance on the premise of basically having no other cost.
It should be understood that the above-described embodiments of the present invention are merely examples for clearly illustrating the present invention, and are not intended to limit the embodiments of the present invention. Any modification, equivalent replacement, and improvement made within the spirit and principle of the present invention should be included in the protection scope of the claims of the present invention.
Claims (1)
1. A Turbo code decoding method is characterized in that: firstly, coding is carried out, and the coding method comprises the following steps:
s1: on one hand, the externally input information bits x (k) are directly subjected to low-order modulation, and at the moment, the output information bits are marked as x "(k); simultaneously sending information bits x (k) to a first sub-encoder;
s2: the first sub-encoder receives the information bit x (k) and outputs a check bit y (k); simultaneously, attaching a return-to-zero bit at the tail part of x (k) to ensure that the first sub-encoder is in a zero state after encoding is finished; denote x (k) and the zeroed bits as x' (k);
s3: sending the x' (k) to a second sub-encoder after scrambling the sequence by using an interleaver, and outputting check bits z (k);
s4: directly carrying out high-order modulation on parity bits y (k) and z (k), and combining the parity bits into a symbol yz (k) to be output simultaneously;
s5: after x "(k) and yz (k) are alternately switched by the multiplexing module mux, x" (k) and yz (k) are alternately output to obtain a data stream Rx (k) with code rate of 1/2;
wherein: the data sequence number k is 1,2,3, …, N is the number of bits transmitted in a frame;
the mapping mode of the digital-analog signal of the QPSK mapping module is any one of the following modes:
a) when y (k) is 0, the constellation point is on the left side, when y (k) is 1, the constellation point is on the right side, when z (k) is 0, the constellation point is on the lower side, and when z (k) is 1, the constellation point is on the upper side;
b) when y (k) is 1, the constellation point is on the left side, when y (k) is 0, the constellation point is on the right side, when z (k) is 1, the constellation point is on the lower side, and when z (k) is 0, the constellation point is on the upper side;
c) when y (k) is 1, the constellation point is on the upper side, when y (k) is 0, the constellation point is on the lower side, when z (k) is 1, the constellation point is on the left side, and when z (k) is 0, the constellation point is on the right side;
d) when y (k) is 0, the constellation point is on the upper side, when y (k) is 1, the constellation point is on the lower side, when z (k) is 0, the constellation point is on the left side, and when z (k) is 1, the constellation point is on the right side;
wherein: y (k) represents the real part of the QPSK symbol; z (k) represents the imaginary part of the QPSK symbol;
in step S1, the low order modulation is modulated by using a BPSK mapping module;
the BPSK mapping module is mapped in any one of the following modes:
1) when x (k) is 0, the constellation point is on the left side, and when y (k) is 1, the constellation point is on the right side;
2) when x (k) is 1, the constellation point is on the left side, and when y (k) is 0, the constellation point is on the right side;
3) when x (k) is 0, the constellation point is on the upper side, and when y (k) is 1, the constellation point is on the lower side;
4) when x (k) is 1, the constellation point is on the upper side, and when y (k) is 0, the constellation point is on the lower side;
in step S4, the high-order modulation is modulated by using a QPSK mapping module;
decoding the encoding method of steps S1-S5, wherein the decoding steps are as follows:
t1: the receiver will receiveFor symbol R corresponding to yz (k) in data stream Rx (k) of (2)yz(k) Taking its real part and multiplying by
Obtaining the symbol R corresponding to y (k)y(k) (ii) a Get Ryz(k) And multiplied by the imaginary part of
Obtaining the symbol R corresponding to z (k)z(k)；
T2: BPSK symbol R corresponding to x (k)x(k) And combining the data sequences to obtain a 1/3 code rate received data sequence, and finishing decoding.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811320422.1A CN109547158B (en) | 2018-11-07 | 2018-11-07 | Encoding method and decoding method of Turbo code |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811320422.1A CN109547158B (en) | 2018-11-07 | 2018-11-07 | Encoding method and decoding method of Turbo code |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN109547158A CN109547158A (en) | 2019-03-29 |
| CN109547158B true CN109547158B (en) | 2022-03-22 |
Family
ID=65844560
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201811320422.1A Active CN109547158B (en) | 2018-11-07 | 2018-11-07 | Encoding method and decoding method of Turbo code |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN109547158B (en) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112751651B (en) * | 2020-12-29 | 2021-09-07 | 白盒子(上海)微电子科技有限公司 | Signal transmission method combining Turbo code and neural network |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1347200A (en) * | 2001-07-06 | 2002-05-01 | 清华大学 | Error correcting Turbo code encoder in ground system of digital television broadcast |
| CN1348310A (en) * | 2001-08-17 | 2002-05-08 | 清华大学 | Cascade error-correcting coder and its coding method |
| CN1645752A (en) * | 2005-01-21 | 2005-07-27 | 清华大学 | Coding and decoding scheme for Turbo code and multi-dimensional modulating cascade system |
| CN100571419C (en) * | 2004-12-21 | 2009-12-16 | 中兴通讯股份有限公司 | The method for transmitting and receiving of a kind of coding modulation and demodulation system and signal thereof |
| US9203558B1 (en) * | 2013-01-23 | 2015-12-01 | Viasat, Inc. | Soft-decision decoding of differential 16-QAM |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101710850B (en) * | 2008-12-26 | 2013-10-30 | 三星电子株式会社 | Convolution Turbo encoding method and device for realizing encoding method |
-
2018
- 2018-11-07 CN CN201811320422.1A patent/CN109547158B/en active Active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1347200A (en) * | 2001-07-06 | 2002-05-01 | 清华大学 | Error correcting Turbo code encoder in ground system of digital television broadcast |
| CN1348310A (en) * | 2001-08-17 | 2002-05-08 | 清华大学 | Cascade error-correcting coder and its coding method |
| CN100571419C (en) * | 2004-12-21 | 2009-12-16 | 中兴通讯股份有限公司 | The method for transmitting and receiving of a kind of coding modulation and demodulation system and signal thereof |
| CN1645752A (en) * | 2005-01-21 | 2005-07-27 | 清华大学 | Coding and decoding scheme for Turbo code and multi-dimensional modulating cascade system |
| US9203558B1 (en) * | 2013-01-23 | 2015-12-01 | Viasat, Inc. | Soft-decision decoding of differential 16-QAM |
Also Published As
| Publication number | Publication date |
|---|---|
| CN109547158A (en) | 2019-03-29 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US6678263B1 (en) | Method and constructions for space-time codes for PSK constellations for spatial diversity in multiple-element antenna systems | |
| US8140946B2 (en) | Method and apparatus for generating low rate turbo codes | |
| AU751391B2 (en) | Coding and modulation method and apparatus for its implementation | |
| CN1184768C (en) | Unequal error protection in coded modulation schemes | |
| US20070127594A1 (en) | Reduced complexity coding system using iterative decoding | |
| AU5785698A (en) | Apparatus, and associated method, for transmitting and receiving a multi-stage, encoded and interleaved digital communication signal | |
| CN101710850B (en) | Convolution Turbo encoding method and device for realizing encoding method | |
| EP1042870B1 (en) | Coding method and apparatus | |
| US7907688B2 (en) | Open loop MIMO receiver and method using hard decision feedback | |
| EP2888849B1 (en) | Soft metrics compressing method | |
| AU2010301340A1 (en) | Devices, methods and computer-readable mediums for coding a control message with determined data code block repetition | |
| US8601344B1 (en) | Method and apparatus for a parameterized interleaver design process | |
| US6279132B1 (en) | Concatenated error control method and system for a processing satellite uplink | |
| CN101262307B (en) | A serial cascaded compiling and decoding system including rotary modulation mode of constellation map | |
| EP3278479B1 (en) | Apparatus and method for non-orthogonal transmissions | |
| EP0869623A2 (en) | Method and apparatus for spectrally efficient transmission of CDMA modulated signals | |
| EP1897260A1 (en) | Method and apparatus for spatial temporal turbo channel coding/decoding in wireless network | |
| CN109547158B (en) | Encoding method and decoding method of Turbo code | |
| CN115225202B (en) | Cascade decoding method | |
| US20040184560A1 (en) | 8 PSK rotationally invariant turbo trellis coded modulation without parallel transitions | |
| JP5153588B2 (en) | Wireless communication device | |
| KR101407172B1 (en) | Data transmission method using turbo code | |
| Faraj et al. | 8.4 dB net coding gain achieved with a serially concatenated coding scheme for differential quadrature phase shift keyed optical systems | |
| KR20210036548A (en) | Turbo code decoding apparatus for i-q quantization transfer using multi relay | |
| Telecom | Design and Development of A Trellis-coded 8-PSK Satellite Modem for Potential INTELSAT Services Erich Auer, Peter Battenschlag, Wolfgang Bodenschatz |
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 |