WO2009006812A1 - Procédé de modulation à codage, procédé de décodage et appareil de code de modulation à codage en treillis - Google Patents
Procédé de modulation à codage, procédé de décodage et appareil de code de modulation à codage en treillis Download PDFInfo
- Publication number
- WO2009006812A1 WO2009006812A1 PCT/CN2008/071349 CN2008071349W WO2009006812A1 WO 2009006812 A1 WO2009006812 A1 WO 2009006812A1 CN 2008071349 W CN2008071349 W CN 2008071349W WO 2009006812 A1 WO2009006812 A1 WO 2009006812A1
- Authority
- WO
- WIPO (PCT)
- Prior art keywords
- constellation
- bit
- constellation map
- code
- tcm
- Prior art date
Links
- 238000000034 method Methods 0.000 title claims abstract description 35
- 238000010586 diagram Methods 0.000 claims description 34
- 238000013507 mapping Methods 0.000 claims description 12
- 238000012790 confirmation Methods 0.000 claims description 3
- 230000005540 biological transmission Effects 0.000 claims 1
- 238000012545 processing Methods 0.000 description 5
- 230000011218 segmentation Effects 0.000 description 5
- 238000004088 simulation Methods 0.000 description 5
- 238000010276 construction Methods 0.000 description 3
- 238000000638 solvent extraction Methods 0.000 description 3
- 108010076504 Protein Sorting Signals Proteins 0.000 description 2
- 238000012937 correction Methods 0.000 description 2
- 238000004891 communication Methods 0.000 description 1
- 230000007547 defect Effects 0.000 description 1
- 238000013461 design Methods 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 238000010606 normalization Methods 0.000 description 1
- 230000000737 periodic effect Effects 0.000 description 1
- 230000009466 transformation Effects 0.000 description 1
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/25—Error detection or forward error correction by signal space coding, i.e. adding redundancy in the signal constellation, e.g. Trellis Coded Modulation [TCM]
- H03M13/256—Error detection or forward error correction by signal space coding, i.e. adding redundancy in the signal constellation, e.g. Trellis Coded Modulation [TCM] with trellis coding, e.g. with convolutional codes and TCM
-
- 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/25—Error detection or forward error correction by signal space coding, i.e. adding redundancy in the signal constellation, e.g. Trellis Coded Modulation [TCM]
-
- 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/27—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 using interleaving techniques
-
- 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/31—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 coding for error detection or correction and efficient use of the spectrum
Definitions
- the invention belongs to the technical field of data coding, and in particular relates to a code modulation and decoding method and device for a trellis coded modulation code. Background technique
- TCM (Trellis coded modulation) coding or trellis coded modulation technology
- trellis coded modulation technology is a "signal set space coding" that can encode and modulate without reducing the band utilization and power utilization. Combined, the redundancy of the signal set is used to obtain error correction capability.
- the number of signal points used in the constellation diagram is greater than the number of points required to encode the same type of modulation. These additional signal points provide redundancy for error correction coding.
- TCM The basic idea of TCM is to use an extended signal set to provide controllable coding redundancy, and to design convolutional coding and multi-modulation mapping uniformly, that is, to perform hierarchical segmentation mapping on the transmitted signal point set to make the coded signal sequence free.
- Euclidean distance the squared Euclidean distance is the square of the distance between two signal points, the cylinder is called the Euclidean distance
- the free Euclidean distance is defined as the bifurcation from the same state at zero time, and the two at the subsequent time have a convergence
- the TCM signal is generated as follows: At a time n, the original bit block of length k enters the encoder, and one of them enters the convolutional encoder bit ( ⁇ k) through a code rate.
- the convolutional encoder is expanded into a coded ratio of the encoded bits. Special group, the m coded bits are used to select one of the subsets of the 2 k+m - k modulation signal set, and the remaining pass bits form an uncoded bit group for use in the subset Select one of the 1" signal points as the final transmitted TCM signal.
- the division principle of the above subset (also called the set division principle) is of great significance in the construction of the TCM scheme.
- the so-called set segmentation is to divide a signal set into smaller subsets one after another, and to maximize the minimum Euclidean distance in the segmented subset.
- the minimum Euclidean distance between the signal points should increase step by step.
- the modulation signal set with 2 " ⁇ signal points is divided into m stages. Let the subset ⁇ after the i-th stage division, the inner minimum Euclidean distance is ⁇ ' ⁇ ( ⁇ 0 ' 1 '"'' m )
- the number of encoded bits corresponding to the signal points in the same subset is . . . 3 is the same (it can be said that the same signal points corresponding to the bit groups after encoding correspond to the same subset ), and in order to distinguish 2 "signal points in the same subset, the corresponding uncoded bit groups of each signal point must be different.
- the coding ratio The 1" signal points of the same group belong to the same subset, and the corresponding - uncoded bit groups must be different.
- all subsets need to conform to the set partitioning principle.
- FIG. 2 is a schematic diagram of a set division of a 16QAM (quarature amplitude modulation) signal point set.
- All modulated signals should have the same frequency of occurrence and should have as much regularity and symmetry as possible. This principle indicates that a good TCM code should have a regular structure. This is because the TCM scheme is actually a scheme for optimal segmentation of the signal space, and the modulation signal space is symmetric, so the optimal segmentation scheme should also Regular and symmetrical.
- the corresponding signal of the branching branch starting from the same state shall belong to the same subset ⁇ after the first level set. Or ⁇ ⁇ , which guarantees that the distance between different branches separated from the same state is greater than or equal to ⁇ ⁇ .
- the corresponding signal of the branch branch arriving at the same state shall belong to the same subset ⁇ after the first level set. Or ⁇ ⁇ , which guarantees that the distance between different branches reaching the same state is greater than or equal to ⁇ .
- the parallel path corresponds to the subset after the segmentation. This will ensure that the distance between parallel paths is greater than or equal to ⁇ TM .
- the code rate and modulation method are: 1/2 16QAM, 3/4 16QAM, 2/3 64QAM, 5/6 64QAM , 3/4 256QAM, 7/8 256QAM.
- the convolutional encoder used in the TCM code under Wimax SCa is a (2, 1, 7) binary convolutional code generator with a code rate of 1/2 and a beam length of 7. Its structure is shown in Figure 3.
- the 5/6 64QAM, 7/8 256QAM TCM code needs to be punctured after the convolutional encoder with a code rate of 1/2, that is, a part of the encoded bit is deleted, and the code rate is changed to 3/4.
- the punch pattern is X1Y1Y2X3, that is, every 3 groups of coded bits are punched, the first group is not punched, the second group is knocked off X, and the third group is knocked off Y.
- a raw bit field of length 2 uluO enters the TCM encoder, and the TCM encoder part uses a convolutional code of 1/2.
- the input order of uluO is ul is the first arrival bit, and uO is the backward arrival bit.
- Ul is a pass-through bit
- uO is 1/2 convolutional coding for entering the convolutional encoder bit
- a set of 3-bit constellation index b5b4b3 is obtained, which is mapped to the I path, which is related to the coordinates of the I path, where b4b3 is the encoded bit group.
- b5 is an uncoded bit group.
- Another set of original bit information group uluO is input to the encoder to obtain another set of 3-bit constellation index b2blb0, which is mapped to the Q path, which is related to the coordinates of the Q path, where blbO is the encoded bit group and b2 is the uncoded bit. group. Since it produces a 6-bit output every 4 input bits, the encoder should be called an encoder with a code rate of 4/6.
- signal points are determined in the existing 64QAM constellation map and used as the final transmitted TCM signal.
- the existing 64QAM constellation map is shown in Figure 5.
- the signal points of the same group of the I-coded bit group b4b3 and the Q-channel coded bit group blbO are the same subset, for example, the I channel and the Q channel are (110, 001), (010, 001), (110, respectively)
- the signal points of 101, (010, 101) are the same subset, wherein the bit group b4b3 after the I channel coding is 10, and the bit group blbO is 01 after the Q channel coding, and the I channel and the Q channel are respectively (110,
- the signal points of 011), (010, 011), (110, 111), (010, 111) are the same subset, wherein the bit group b4b3 after the I channel coding is 10, and the bit group blbO after the Q channel coding is 11, through It is not difficult to find these two subsets that the TCM coded output signal points (the TCM coded output signal points on the parallel path, that is, the signal points in the same subset) on the two parallel
- the Euclidean distance of the symbols (that is, the signal points in the same subset) is also long and short.
- the I and Q paths are a subset of the signal points of (110, 001), (010, 001), (110, 101), and (010, 101), respectively, and the Euclidean distance is compared with the I and Q paths respectively (
- the Euclidean distance of the subset of signal points of 110, 011), (010, 011), (110, 111), (010, 111) is short. 5/6 64QAM TCM encoder structure diagram shown in Figure 6.
- a raw bit information group u4u3u2ulu0 of length 5 enters the TCM encoder, and the TCM encoder part uses a convolutional code with a code rate of 3/4 (the original 1/2 convolutional code is punctured to make the code rate become 3/4) .
- the input order of u4u3u2ulu0 is u4, u3, u2, ul, u0.
- U2ulu0 performs 3/4 convolutional coding, and the output is c3c2clc0.
- the uncoded bit u4 and the encoded bit c3c2 are combined into a set of 3-bit constellation index b5b4b3, which is mapped to the I path, where b4b3 is the encoded bit group and b5 is the uncoded bit group.
- U3clc0 is a set of 3-bit constellation index b2blb0, mapped to the Q path, where blbO is the encoded bit group and b2 is the uncoded bit group.
- the signal point is determined in the existing 64QAM constellation map and used as the final transmitted TCM signal.
- the existing 64QAM constellation map is shown in Figure 5.
- a raw bit block u2ulu0 of length 3 enters the TCM encoder, and the TCM encoder section uses a convolutional code of 1/2.
- the input order of u2ulu0 is: u2, ul, u0.
- U2ul is a pass-through bit
- u0 performs 1/2 convolutional coding
- a set of 4-bit constellation index b7b6b5b4 is obtained, which is mapped to the I path, which is related to the coordinates of the I path, where b5b4 is the encoded bit group, and b7b6 is the uncoded bit group. .
- a set of original bit information groups u2ulu0 is input to the encoder, and another set of 4-bit constellation index b3b2blb0 is generated, which is mapped to the Q path, which is related to the coordinates of the Q path, where blbO is the encoded bit group, and b3b2 is the uncoded bit. group. Since it produces an 8-bit output for every 6 input bits, the encoder should be called an encoder with a 6/8 bit rate.
- the signal point is determined in the existing 256QAM constellation map and used as the final transmitted TCM signal.
- the current 256QAM constellation map is shown in Figure 8.
- the TCM encoder section uses a convolutional code with a code rate of 3/4 (the original 1/2 convolutional code is punctured to make the code rate 3/4).
- the input order of u6u5u4u3u2ulu0 is u6, u5, u4, u3, u2, ul, u0.
- U2ulu0 performs 3/4 convolutional coding, and the output is c3c2clc0.
- the uncoded bit group u6u5 and the encoded bit group c3c2 are combined into a set of 4-bit constellation index b7b6b5b4, which is mapped to the I path, where b5b4 is the encoded bit group and b7b6 is the uncoded bit group.
- U4u3clc0 is combined into a set of 4-bit constellation index b3b2blb0, which is mapped to the Q path, where blbO is the encoded bit group and b3b2 is the uncoded bit group.
- the signal point is determined in the existing 256QAM constellation map and used as the final transmitted TCM signal.
- the current 256QAM constellation map is shown in Figure 8.
- the decoding process of the TCM code can be roughly divided into the following two steps: subset decoding; soft decision Viterbi decoding.
- a soft decision metric is obtained for 2 TM coded bit groups, and the metric value is usually a subset decoded signal point corresponding to each coded bit group (the subset and the received symbol) The Euclidean distance of the signal point with the smallest Euclidean distance or its linear transformation. Substituting the above soft decision metric into the Viterbi decoder for decoding operation, an estimated value (decoding result) of the original bit block can be obtained.
- a defect of the prior art TCM codes with modulation orders greater than 4 is that their coding and modulation are based on existing
- the constellation map determines the signal point, determines the final transmitted TCM signal, and the TCM coded output signal points (that is, the signal points in the same subset) on each parallel path are not uniformly mapped on the Q path, which makes the Q path have children.
- the Euclidean distance of the set is long, the Euclidean distance of some subsets is short, and the shortest is the adjacent constellation. The distance between the points, as shown in FIG.
- the encoded bit groups of the four signal points marked are the same, and are the signal points in the same subset, and the distance of the Q path of the signal points in the subset is 1 ( The Euclidean distance between adjacent signal points in the constellation map is 1).
- the distance of the Q path of the signal points in the subset is 7.
- the subset of the Q-path has a long Euclidean distance, and some of the subsets have a short Euclidean distance, which deteriorates the overall performance of the TCM code.
- the decoding process is decoded according to the existing constellation diagram.
- a coding and modulation method for a TCM including:
- a signal point is determined in the constellation map as a final transmitted TCM signal based on the constellation index.
- the embodiment of the invention further provides a method for decoding a trellis coded modulation code (TCM), which includes:
- the example also provides a code modulation device for a TCM, including:
- a storage module configured to store a quadrature amplitude modulation QAM constellation with a modulation order greater than 4 as a constellation map of the TCM, and map the encoded bit groups on the constellation map I and Q on the I path and Q Repeatedly arranged on the road, respectively, and the uncoded bit groups corresponding to the coded bit groups repeatedly arranged in each cycle are different from each other;
- a constellation index obtaining module configured to obtain a constellation index including the encoded bit group and the uncoded bit group according to the original bit information group;
- the TCM signal confirmation module is configured to determine a signal point in the constellation map as a final transmitted TCM signal according to the constellation index.
- the embodiment of the invention further provides a decoding device for a trellis coded modulation code (TCM), which comprises:
- a storage module configured to store a quadrature amplitude modulation QAM constellation with a modulation order greater than 4 as a constellation map of the TCM, and map the encoded bit groups on the constellation map I and Q on the I path and Q Repeatedly arranged on the road, respectively, and the uncoded bit groups corresponding to the coded bit groups repeatedly arranged in each cycle are different from each other;
- Decoding module configured to perform decoding processing on the signal to be decoded according to the constellation map. It can be seen from the specific implementation provided by the above invention that it is precisely because the post-encoding bit group period is repeatedly arranged and the corresponding uncoded bit groups are different from each other, so that the symbols of the parallel path are uniformly mapped on the constellation map, so that the TCM code is Overall performance has improved.
- DRAWINGS 1 is a schematic diagram of a prior art TCM code modulation structure
- FIG. 2 is a schematic diagram of a 16QAM set partitioning in the prior art
- FIG. 3 is a schematic diagram showing the structure of a prior art code rate 1/2 convolutional encoder
- FIG. 4 is a schematic structural diagram of a prior art 2/3 64QAM TCM encoder
- FIG. 6 is a schematic structural diagram of a prior art 5/6 64QAM TCM encoder
- FIG. 7 is a schematic structural diagram of a prior art 3/4 256QAM TCM encoder
- FIG. 9 is a schematic structural diagram of a prior art 7/8 256QAM TCM encoder
- 10A is a schematic diagram of a prior art parallel path distance
- 10B is a schematic diagram of a prior art parallel path distance
- FIG. 11 is a flowchart of a method according to a first embodiment of the present invention.
- FIG. 12A is a 64QAM constellation map of a TCM according to a first embodiment of the present invention
- FIG. 12B is a 64QAM constellation map of a TCM according to a first embodiment of the present invention
- FIG. 12C is a 64QAM of a TCM according to a first embodiment of the present invention
- FIG. 13A is a 256QAM constellation map of a TCM according to a first embodiment of the present invention
- FIG. 13B is a 256QAM constellation map of a TCM according to a first embodiment of the present invention
- FIG. 14 is a second embodiment of the present invention.
- 15 is a schematic diagram of comparison of 2/3 64QAM TCM code BER simulation results according to an embodiment of the present invention.
- 16 is a schematic diagram of comparison of 5/6 64QAM TCM code BER simulation results according to an embodiment of the present invention
- FIG. 17 is a schematic diagram showing comparison of BER simulation results of 3/4 256QAM TCM codes according to an embodiment of the present invention.
- FIG. 18 is a comparison of BER simulation results of 7/8 256QAM TCM codes according to an embodiment of the present invention.
- FIG. 19 is a schematic structural diagram of a device according to a third embodiment of the present invention.
- FIG. 20 is a schematic structural diagram of a device according to a fourth embodiment of the present invention. detailed description
- the preferred modulation mapping method of the TCM coding structure of 2/3 64QAM, 5/6 64QAM, 3/4 256QAM, 7/8 256QAM proposed by the embodiment of the present invention is not only a kind of only one kind, but a certain mapping rule is satisfied.
- a collection of modulation mapping methods. This mapping rule is described below.
- the number of bits of the encoded bit group of the TCM code is four (the encoded bit group refers to one or more output bits after convolutional coding), and is mapped to the I and Q paths on the constellation, respectively.
- Each channel maps 2 bits.
- the modulation order be M
- the number of bits of the uncoded bit group is (M-4)
- the number of bits mapped on each path of I/Q is (M-4)/2
- uncoded bit group refers to Is a pass-through bit, one or more output bits that are not convolutionally encoded).
- the sequence of coded bit groups mapped on each I/Q of the path needs to satisfy the characteristics of periodic repetition.
- the corresponding uncoded bit groups need to be different.
- the order of uncoded bit groups has no special requirements.
- the encoded bit group sequence mapped in the I path and the Q path needs to satisfy the Gray code mapping rule respectively, that is, only one bit between the two adjacent coded bit groups in the sequence is different.
- the coding and modulation method of the trellis coded modulation code that satisfies the above mapping rule provided by the embodiment of the present invention includes: Establishing a QAM constellation diagram with a modulation order greater than 4 as a constellation map of the trellis coded modulation code, so that the coded bit groups mapped on the constellation map I and Q are periodically repeated on the I and Q paths, respectively. Arranging, and making uncoded bit groups corresponding to the coded bit groups repeatedly arranged in each cycle different from each other; obtaining a constellation index including the encoded bit group and the uncoded bit group according to the original bit information group; The signal point is determined in the constellation map as the finally transmitted trellis coded modulation code signal.
- the first embodiment provided by the present invention is a coding and modulation method of a trellis coded modulation code (TCM).
- TCM trellis coded modulation code
- Step 101 Establish a constellation map of the 5/6 64QAM TCM as shown in FIG. 12A.
- the four bits of the encoded bit group in the constellation map are respectively mapped to the combination of b4b3 of the I path and blbO, b4b3 or blbO of the Q path.
- There are 2 2 4 in total, so the period of the bit sequence repetition after encoding on each road is 4.
- the two uncoded bits are mapped to b5 of the I path and b2 of the Q path, respectively.
- the value of b5 needs to be different.
- the value of b2 needs to be different.
- the preferred mapping method therein is as follows.
- I/Q path coordinate value 7A 5A 3A A -A -3A -5A -7A (A is the constellation diagram power normalization factor)
- I road b5 0 0 0 0 1 1 1 1 (may also be 0 1 1
- Step 102 Receive a raw bit information group "10011" (corresponding respectively
- U4u3u2ulu0 Enter the 5/664QAM TCM encoder.
- the input order of "1001 ⁇ is the first "1" first arrival, the first "0" second arrival, the second "0" third arrival, the second "1” fourth arrival The third "1" finally arrived.
- Step 103 The TCM encoder encodes the original bit information group "10011" to obtain a constellation index including the encoded bit group and the uncoded bit group.
- the TCM encoder section uses a convolutional code with a code rate of 3/4 (the original 1/2 convolutional code is punctured to make the code rate 3/4). For "01 ⁇ 3/4 convolutional coding, if the initial value of the six registers of the convolutional encoder is 0, the output is "111 0" (corresponding to c3c2clc0 respectively), and the order is the first “1” first. Output, second "1" second, third "1" third, "0" last.
- Uncoded bit group "1" (u4) combined with encoded bit group "11" (c3c2) The 3-bit constellation index "ill” (b5b4b3) is mapped to the I path, where the last two “1”s (b4b3) are the encoded bit groups, and the first "1” (b5) is the uncoded bit group.
- "(u3clc0) is a set of 3-bit constellation index "010" (b2blb0) mapped to the Q path, where the last two bits “10" (blbO) are the encoded bit group, the first "0" (b2) ) is an uncoded bit group.
- Step 104 According to the obtained I-way constellation index "111" and the Q-way constellation index "010", the constellation map of the 5/664QAM TCM is established in step 101 (as shown in FIG. 12A), and the I-way coordinate is determined to be -7.
- the Q path coordinates are 3 signal points and the signal point is used as the final transmitted TCM signal.
- the constellation map of 5/664QAM TCM can also be obtained as shown in FIG. 12B and FIG. 12C, which indicates that the constellation map of 5/664QAMTCM is not unique, but satisfies the foregoing description.
- 3/4256QAM, 7/8 can also be obtained.
- the constellation map of 256QAM, and determine the final transmitted TCM signal, will not be described here.
- the constellation map in the preferred scheme of 256QAM is shown in FIG. 13A, and the constellation map of the same 256QAM is not the only one shown in FIG. 13A, and can also be as shown in FIG. 13B, which satisfies the technical principle described above. set.
- the technical solution described in the embodiments of the present invention makes signal points in the same subset on the constellation map, especially on the Q road, and the minimum Euclidean distance of the signal points in the same subset is greater than 4 in the prior art.
- a second embodiment of the present invention provides a trellis coded modulation code (TCM) decoding method, which is exemplified by a 5/6 64QAM TCM code, and includes:
- Step 201 Establish a constellation map of the 5/6 64QAM TCM. As shown in FIG. 12A, the specific scheme is the same as step 101.
- the decoding signal is subjected to subsequent decoding processing by using the prior art.
- decoding processing scheme subset decoding and soft decision Viterbi decoding may be employed.
- Step 202 Sub-set decoding, in the four signal points of each subset of the 16 subsets of the constellation map of Fig. 12A, find the signal point with the smallest Euclidean distance from the received symbol.
- the schematic diagram of determining the signal point with the smallest Euclidean distance during decoding is shown in Fig. 14.
- the circle is the position of the received signal point, and the subset corresponding to the bit group "0000" (b4b3blb0) after encoding is the four signals in Fig. 14. Point, then the upper left signal point is the subset decoding result.
- Step 203 Soft-decision Viterbi decoding, in the result of the subset decoding, obtains the Euclidean distance of the 16 encoded bit groups as its soft decision metric. By substituting the soft decision metric value into the Viterbi decoder for decoding operation, an estimated value (decoding result) for the original bit block can be obtained.
- the technical principle of the decoding process of 2/3 64QAM, 3/4 256QAM, 7/8 256QAMTCM code is the same as that of the 5/6 64QAM TCM code described above, and will not be described here.
- the decoding process is performed according to the constellation diagram provided by the embodiment of the present invention, so that the signal points in the same subset are uniformly mapped on the constellation map, especially on the Q road, and the minimum Euclidean distance of the signal points in the same subset is 4 is larger than the minimum Euclidean distance 1 in the prior art, and the minimum Euclidean distance of the TCM coded output signal point on the parallel path is larger than the minimum Euclidean distance of the prior art, and the decoding error occurs under a certain signal to noise ratio.
- the probability is less than the probability of decoding errors in the prior art, and the overall performance of the TCM code is improved.
- the TCM code described in the embodiment of the present invention can be applied to the TCM code under Wimax SCa as an improved solution. It is also applicable to other communication systems that use such TCM codes.
- BER bit error rate simulation results of 2/3 64QAM, 5/6 64QAM, 3/4 256QAM, 7/8 256QAM TCM codes defined in the prior art and preferred TCM codes described in the embodiments of the present invention
- the comparison is shown in Fig. 15, Fig. 16, Fig. 17, and Fig. 18.
- Wimax represents the TCM code defined in the Wimax protocol
- MY represents the preferred TCM code described in the embodiment of the present invention
- the channel is the AWGN channel
- Es/Nt is the ratio of the symbol energy to the noise power in the unit bandwidth, that is, normalized. Signal to noise ratio.
- the performance of the preferred TCM code described in the embodiments of the present invention is significantly improved by the 256QAM, 7/8 256QAM TCM code.
- the TCM code designed by the embodiment of the present invention can maintain the definition of the original Wimax protocol.
- the coding part of the TCM code has the same structure, and only needs to change the constellation map to obtain significant gain, which is compatible with the original protocol.
- the third embodiment of the present invention is a code modulation device of a TCM, and its structure is as shown in FIG. 19, including:
- the storage module 301 is configured to store a square QAM constellation diagram with a modulation order greater than 4 as
- a constellation map of the TCM mapping the encoded bits on the I and Q paths of the constellation map
- the groups are repeatedly arranged periodically on the I path and the Q path, and the uncoded bit groups corresponding to the coded bit groups repeatedly arranged in each cycle are different from each other;
- a constellation index obtaining module 302 configured to obtain, according to the original bit information group, a constellation index including the encoded bit group and the uncoded bit group;
- the TCM signal confirmation module 303 is configured to determine a signal point in the constellation map according to the constellation index as a final transmitted TCM signal.
- the fourth embodiment of the present invention provides a trellis coded modulation code (TCM) decoding device, and the structure thereof is as shown in FIG. 20, including:
- the storage module 401 is configured to store a square QAM constellation diagram with a modulation order greater than 4 as a constellation map of the TCM, and the coded bit groups mapped on the constellation map I and Q paths are respectively on the I road and the Q road.
- the cycle is repeatedly arranged, and the uncoded bit groups corresponding to the coded bit groups repeatedly arranged in each cycle are different from each other;
- the decoding module 402 is configured to perform decoding processing on the signal to be decoded according to the constellation map. Specifically, in practical applications, the constellation diagram used in this embodiment can be combined with the present invention.
Landscapes
- Physics & Mathematics (AREA)
- Probability & Statistics with Applications (AREA)
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Digital Transmission Methods That Use Modulated Carrier Waves (AREA)
Abstract
L'invention concerne un procédé de modulation à codage, un procédé de décodage et un appareil de code de modulation à codage en treillis. Le procédé de codage comprend les étapes consistant à établir une image de constellation de modulation d'amplitude en quadrature (QAM) qui est une image de carte de constellation de modulation à codage en treillis (TCM) avec un niveau de modulation dépassant 4 ; amener des groupes de bits codés de l'image de constellation avec une route I et une route Q à être agencés de façon périodique et répétée dans la route I et la route Q ; amener des groupes de bits non codés qui correspondent à des groupes de bits codés avec un agencement à répétition périodique à être différents les uns des autres ; obtenir un index de constellation comprenant les groupes de bits codés et non codés conformément aux groupes d'information de bits originaux ; déterminer un point de signal en tant que signal TCM finalement transmis dans la carte de constellation. Les symboles de route parallèle sont mappés de façon régulière sur la route Q de la carte de constellation car les groupes de bits codés sont agencés de façon périodique et répétée, et les performances du code TCM sont ainsi améliorées.
Applications Claiming Priority (2)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CNA2007101226575A CN101123439A (zh) | 2007-07-10 | 2007-07-10 | 一种网格编码调制码的编码调制、译码方法及装置 |
CN200710122657.5 | 2007-07-10 |
Publications (1)
Publication Number | Publication Date |
---|---|
WO2009006812A1 true WO2009006812A1 (fr) | 2009-01-15 |
Family
ID=39085638
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
PCT/CN2008/071349 WO2009006812A1 (fr) | 2007-07-10 | 2008-06-18 | Procédé de modulation à codage, procédé de décodage et appareil de code de modulation à codage en treillis |
Country Status (2)
Country | Link |
---|---|
CN (1) | CN101123439A (fr) |
WO (1) | WO2009006812A1 (fr) |
Families Citing this family (17)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN101123439A (zh) * | 2007-07-10 | 2008-02-13 | 华为技术有限公司 | 一种网格编码调制码的编码调制、译码方法及装置 |
CN101262306B (zh) * | 2008-04-30 | 2010-12-15 | 华为技术有限公司 | 一种网格编码调制码的译码方法及装置 |
CN101547182B (zh) * | 2009-04-17 | 2011-07-20 | 北京大学 | 一种qam星座图的映射和解映射方法 |
JP5615354B2 (ja) * | 2009-06-23 | 2014-10-29 | トムソン ライセンシングThomson Licensing | 繰り返しパターンを用いた3dメッシュの圧縮方法 |
CN102244640B (zh) * | 2010-05-11 | 2014-07-09 | 中国电子科技集团公司第三十六研究所 | 一种用于qam信号差分编解码的实现方法 |
CN101944976A (zh) * | 2010-10-11 | 2011-01-12 | 复旦大学 | 一种基于格雷映射的优化网格编码调制系统编码设计方法 |
US8875000B2 (en) * | 2010-11-01 | 2014-10-28 | Marvell World Trade Ltd. | Methods and systems systems for encoding and decoding in trellis coded modulation systems |
CN102088317A (zh) * | 2011-01-18 | 2011-06-08 | 北京邮电大学 | 基于tcm-64qam编码调制的高速光传输系统和方法 |
CN103580774B (zh) * | 2012-07-19 | 2019-01-04 | 中兴通讯股份有限公司 | 一种控制信令传输的方法及装置 |
CN103117837A (zh) * | 2013-01-18 | 2013-05-22 | 北京邮电大学 | 一种改进的t-ppm编码调制方法 |
CN104620507B (zh) | 2013-05-31 | 2017-12-15 | 华为技术有限公司 | 一种译码方法及译码器 |
US9641195B2 (en) * | 2014-06-06 | 2017-05-02 | Intel Corporation | Trellis coded modulation |
CN104022848B (zh) * | 2014-06-19 | 2017-04-19 | 西安电子科技大学 | 逼近信道容量的无速率tcm码的编译码方法 |
CN105553610B (zh) * | 2015-12-09 | 2019-01-01 | 中国地质大学(武汉) | 适用于无线传感器网络的三维64qam网格编码调制方法及系统 |
CN109474552B (zh) * | 2017-09-08 | 2020-05-15 | 北京科技大学 | 软符号估计方法、接收机及计算机可读介质 |
CN108881097B (zh) * | 2018-06-15 | 2021-01-22 | 中国电子科技集团公司第四十一研究所 | 一种基于格雷码的方形qam星座图编码方法和系统 |
CN110636026B (zh) * | 2018-06-25 | 2022-04-01 | 中兴通讯股份有限公司 | 一种基于格的星座图排列的方法及装置 |
Citations (5)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
EP1191699A1 (fr) * | 2000-08-22 | 2002-03-27 | Texas Instruments Incorporated | Modulation de code en trellis concaténé en parallèle avec une cartographie asymétrique du signal |
CN1518256A (zh) * | 2003-01-13 | 2004-08-04 | 华为技术有限公司 | 一种wcdma系统中用于多用户接收装置的网格编码调制方法 |
US20050254605A1 (en) * | 2003-04-24 | 2005-11-17 | Holmes Michael J | Efficient decoding of trellis coded modulation waveforms |
WO2006044427A2 (fr) * | 2004-10-13 | 2006-04-27 | Conexant Systems, Inc. | Procede et systeme de mise en oeuvre d'un schema de turbo-modulations codees en treillis pour des systemes de communication |
CN101123439A (zh) * | 2007-07-10 | 2008-02-13 | 华为技术有限公司 | 一种网格编码调制码的编码调制、译码方法及装置 |
-
2007
- 2007-07-10 CN CNA2007101226575A patent/CN101123439A/zh active Pending
-
2008
- 2008-06-18 WO PCT/CN2008/071349 patent/WO2009006812A1/fr active Application Filing
Patent Citations (5)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
EP1191699A1 (fr) * | 2000-08-22 | 2002-03-27 | Texas Instruments Incorporated | Modulation de code en trellis concaténé en parallèle avec une cartographie asymétrique du signal |
CN1518256A (zh) * | 2003-01-13 | 2004-08-04 | 华为技术有限公司 | 一种wcdma系统中用于多用户接收装置的网格编码调制方法 |
US20050254605A1 (en) * | 2003-04-24 | 2005-11-17 | Holmes Michael J | Efficient decoding of trellis coded modulation waveforms |
WO2006044427A2 (fr) * | 2004-10-13 | 2006-04-27 | Conexant Systems, Inc. | Procede et systeme de mise en oeuvre d'un schema de turbo-modulations codees en treillis pour des systemes de communication |
CN101123439A (zh) * | 2007-07-10 | 2008-02-13 | 华为技术有限公司 | 一种网格编码调制码的编码调制、译码方法及装置 |
Also Published As
Publication number | Publication date |
---|---|
CN101123439A (zh) | 2008-02-13 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
WO2009006812A1 (fr) | Procédé de modulation à codage, procédé de décodage et appareil de code de modulation à codage en treillis | |
US5408502A (en) | Apparatus and method for communicating digital data using trellis coded QAM with punctured convolutional codes | |
US7224743B2 (en) | Efficient decoding of trellis coded modulation waveforms | |
JPH05335972A (ja) | ビタビ復号器 | |
CN108270515A (zh) | 编码方法及装置 | |
JPH06104942A (ja) | データ伝送方式 | |
CN101944976A (zh) | 一种基于格雷映射的优化网格编码调制系统编码设计方法 | |
CN102420617B (zh) | 交叠rm码的译码方法及系统 | |
CN103516465B (zh) | 编码调制和解调译码方法、装置及系统 | |
CN116405120B (zh) | 一种基于符号序列的csk编码方法 | |
CN110061803B (zh) | 一种低复杂度的极化码比特交织编码调制方法 | |
CN105959082B (zh) | 基于多进制编码与高阶调制的联合编码调制方法、装置 | |
Wang et al. | Achieving short-blocklength RCU bound via CRC list decoding of TCM with probabilistic shaping | |
CN115208736B (zh) | 适用于混合自动重传请求系统的高阶调制星座设计方法 | |
Di et al. | Trellis coded modulation for code-domain non-orthogonal multiple access networks | |
CN114389708B (zh) | 一种应用于光通信系统的信号编码调制方法 | |
Abdelaziz et al. | Ternary trellis coded modulation | |
CN107196733B (zh) | 一种调制方法和装置 | |
US20220045765A1 (en) | Quadrature amplitude modulation with constellation shaping | |
CN1221113C (zh) | 基于增信删余卷积码与qam调制格码相结合的信道译码方法和系统 | |
WO2017214860A1 (fr) | Procédé et dispositif de démodulation et de décodage | |
JP5586504B2 (ja) | 復号装置 | |
Zhou et al. | Delayed bit interleaved polar coded modulation | |
CN104022848B (zh) | 逼近信道容量的无速率tcm码的编译码方法 | |
JP3628311B2 (ja) | ビタビ復号装置、通信システム及びビタビ復号方法 |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
121 | Ep: the epo has been informed by wipo that ep was designated in this application |
Ref document number: 08757758 Country of ref document: EP Kind code of ref document: A1 |
|
NENP | Non-entry into the national phase |
Ref country code: DE |
|
122 | Ep: pct application non-entry in european phase |
Ref document number: 08757758 Country of ref document: EP Kind code of ref document: A1 |