True bit level decoding of TTCM (turbo trellis code modulation) of variable rates and signal constellations
First Claim
1. A bit level decoding method, comprising:
- receiving a signal that includes a symbol having a plurality of bits;
extracting I,Q (In-phase, Quadrature) components of the symbol;
calculating a plurality of symbol metrics for the symbol using the I,Q components;
decomposing the plurality of symbol metrics into a plurality of bit metrics;
wherein the plurality of bit metrics is representative of the individual bits of the plurality of bits of the symbol;
performing iterative decoding using the plurality of bit metrics;
wherein the plurality of bit metrics is updated during each iteration of the iterative decoding for use in a current decoding iteration, such that each respective bit metric of the plurality of bit metrics is updated using extrinsic information corresponding to that respective bit from a previous decoding iteration;
making soft bit decisions that correspond to the individual bits of the plurality of bits of the symbol; and
making hard bit decisions, based on the soft bit decisions, that correspond to best estimates of bit values of the individual bits of the plurality of bits of the symbol; and
wherein;
the signal is a variable code rate signal whose code rate varies on a symbol by symbol basis;
the symbol within the signal is encoded according to a first RC (Rate Control);
at least one additional symbol within the signal is encoded according to a second RC;
the first RC includes a first modulation having a first constellation and a first mapping; and
the second RC includes a second modulation having a second constellation and a second mapping.
6 Assignments
0 Petitions
Accused Products
Abstract
True bit level decoding of TTCM (Turbo Trellis Coded Modulation) of variable rates and signal constellations. A decoding approach is presented that allows for decoding on a bit level basis that allows for discrimination of the individual bits of a symbol. Whereas prior art approaches typically perform decoding on a symbol level basis, this decoding approach allows for an improved approach in which the hard decisions/best estimates may be made individually for each of the individual bits of an information symbol. In addition, the decoding approach allows for a reduction in the total number of calculations that need to be performed as well as the total number of values that need to be stored during the iterative decoding. The bit level decoding approach is also able to decode a signal whose code rate and/or signal constellation type (and mapping) may vary on a symbol by symbol basis.
-
Citations
105 Claims
-
1. A bit level decoding method, comprising:
-
receiving a signal that includes a symbol having a plurality of bits; extracting I,Q (In-phase, Quadrature) components of the symbol; calculating a plurality of symbol metrics for the symbol using the I,Q components; decomposing the plurality of symbol metrics into a plurality of bit metrics; wherein the plurality of bit metrics is representative of the individual bits of the plurality of bits of the symbol; performing iterative decoding using the plurality of bit metrics; wherein the plurality of bit metrics is updated during each iteration of the iterative decoding for use in a current decoding iteration, such that each respective bit metric of the plurality of bit metrics is updated using extrinsic information corresponding to that respective bit from a previous decoding iteration; making soft bit decisions that correspond to the individual bits of the plurality of bits of the symbol; and making hard bit decisions, based on the soft bit decisions, that correspond to best estimates of bit values of the individual bits of the plurality of bits of the symbol; and
wherein;the signal is a variable code rate signal whose code rate varies on a symbol by symbol basis; the symbol within the signal is encoded according to a first RC (Rate Control); at least one additional symbol within the signal is encoded according to a second RC; the first RC includes a first modulation having a first constellation and a first mapping; and the second RC includes a second modulation having a second constellation and a second mapping. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20)
-
-
21. A bit level decoding method, comprising:
-
receiving a signal that includes a symbol having a plurality of bits; extracting I,Q (In-phase, Quadrature) components of the symbol; calculating a plurality of symbol metrics for the symbol using the I,Q components; decomposing the plurality of symbol metrics into a plurality of bit metrics; wherein the plurality of bit metrics is representative of the individual bits of the plurality of bits of the symbol; performing iterative decoding using the plurality of bit metrics; wherein the plurality of bit metrics is updated during each iteration of the iterative decoding for use in a current decoding iteration, such that each respective bit metric of the plurality of bit metrics is updated using extrinsic information corresponding to that respective bit from a previous decoding iteration; making soft bit decisions that correspond to the individual bits of the plurality of bits of the symbol; and making hard bit decisions, based on the soft bit decisions, that correspond to best estimates of bit values of the individual bits of the plurality of bits of the symbol; and wherein; the signal is a variable code rate signal whose code rate varies on a symbol by symbol basis; the symbol within the signal is encoded according to a first RC (Rate Control); at least one additional symbol within the signal is encoded according to a second RC; the iterative decoding further comprises calculating a plurality of forward metrics (alphas) and a plurality of backward metrics (betas) using the plurality of bit metrics; each alpha and each beta corresponds to one individual bit of the plurality of bits of the symbol; the iterative decoding further comprises calculating a plurality of extrinsic values using the plurality of bit metrics, the plurality of forward metrics (alphas), and the plurality of backward metrics (betas); each extrinsic value of the plurality of extrinsic values corresponds to one individual bit of the plurality of bits of the symbol; the plurality of extrinsic values that are calculated during a first iteration of the iterative decoding are employed as APP (a priori probability) during a second iteration of the iterative decoding; the first RC includes a first modulation having a first constellation and a first mapping; and the second RC includes a second modulation having a second constellation and a second mapping. - View Dependent Claims (22, 23, 24, 25, 26, 27, 28, 29, 30)
-
-
31. A bit level decoding method, comprising:
-
receiving a signal that includes a symbol having a plurality of bits; extracting I,Q (In-phase, Quadrature) components of the symbol; mapping the symbol to a constellation point; calculating a squared Euclidean distance for the symbol thereby generating an intermediate metric of the symbol; directly calculating a plurality of bit metrics, using the intermediate metric; wherein the plurality of bit metrics is representative of the individual bits of the plurality of bits of the symbol; performing iterative decoding using the plurality of bit metrics; wherein the plurality of bit metrics is updated during each iteration of the iterative decoding for use in a current decoding iteration, such that each respective bit metric of the plurality of bit metrics is updated using extrinsic information corresponding to that respective bit from a previous decoding iteration; making soft bit decisions, using the plurality of bit metrics, that correspond to the individual bits of the plurality of bits of the symbol; and making hard bit decisions, based on the soft bit decisions, that correspond to best estimates of bit values of the individual bits of the plurality of bits of the symbol; and
wherein;the signal is a variable code rate signal whose code rate varies on a symbol by symbol basis; the symbol within the signal is encoded according to a first RC (Rate Control); at least one additional symbol within the signal is encoded according to a second RC; the first RC includes a first modulation having a first constellation and a first mapping; and the second RC includes a second modulation having a second constellation and a second mapping. - View Dependent Claims (32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53)
-
-
54. A bit level decoding method, comprising:
-
receiving a signal that includes a symbol having a plurality of bits; extracting I,Q (In-phase, Quadrature) components of the symbol; mapping the symbol to a constellation point; calculating a squared Euclidean distance for the symbol thereby generating an intermediate metric of the symbol; directly calculating a plurality of bit metrics, using the intermediate metric; wherein the plurality of bit metrics is representative of the individual bits of the plurality of bits of the symbol; performing iterative decoding using the plurality of bit metrics; wherein the plurality of bit metrics is updated during each iteration of the iterative decoding for use in a current decoding iteration, such that each respective bit metric of the plurality of bit metrics is updated using extrinsic information corresponding to that respective bit from a previous decoding iteration; making soft bit decisions, using the plurality of bit metrics, that correspond to the individual bits of the plurality of bits of the symbol; making hard bit decisions, based on the soft bit decisions, that correspond to best estimates of bit values of the individual bits of the plurality of bits of the symbol; and
wherein;the signal is a variable code rate signal whose code rate varies on a symbol by symbol basis; the symbol within the signal is encoded according to a first RC (Rate Control); at least one additional symbol within the signal is encoded according to a second RC; the plurality of bit metrics is calculated using min* processing; the iterative decoding further comprises calculating a plurality of forward metrics (alphas) and a plurality of backward metrics (betas) using the plurality of bit metrics; each alpha and each beta corresponds to one individual bit of the plurality of bits of the symbol; the plurality of forward metrics (alphas) and a plurality of backward metrics (betas) are calculated using min* processing; the iterative decoding further comprises calculating a plurality of extrinsic values using the plurality of bit metrics, the plurality of forward metrics (alphas), and the plurality of backward metrics (betas); each extrinsic value of the plurality of extrinsic values corresponds to one individual bit of the plurality of bits of the symbol; the plurality of extrinsic values is calculated using min* processing; the first RC includes a first modulation having a first constellation and a first mapping; and the second RC includes a second modulation having a second constellation and a second mapping. - View Dependent Claims (55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70)
-
-
71. A bit level decoding method, comprising:
-
receiving a signal that includes a symbol having a plurality of bits; extracting I,Q (In-phase, Quadrature) components of the symbol; mapping the symbol to a constellation point; calculating a squared Euclidean distance for the symbol thereby generating an intermediate metric of the symbol; directly calculating a plurality of bit metrics, using the intermediate metric; wherein the plurality of bit metrics is representative of the individual bits of the plurality of bits of the symbol; performing iterative decoding using the plurality of bit metrics; wherein the plurality of bit metrics is updated during each iteration of the iterative decoding for use in a current decoding iteration, such that each respective bit metric of the plurality of bit metrics is updated using extrinsic information corresponding to that respective bit from a previous decoding iteration; making soft bit decisions, using the plurality of bit metrics, that correspond to the individual bits of the plurality of bits of the symbol; making hard bit decisions, based on the soft bit decisions, that correspond to best estimates of bit values of the individual bits of the plurality of bits of the symbol; and
wherein;the decomposing the plurality of symbol metrics into the plurality of bit metrics involves calculating a pseudo bit metric for an LSB (Least Significant Bit) of the plurality of bits; the decomposing of the plurality of symbol metrics into the plurality of bit metrics involves calculating a bit metric for the LSB of the plurality of bits; the decomposing of the plurality of symbol metrics into the plurality of bit metrics involves calculating a bit metric for an MSB (Most Significant Bit) of the plurality of bits; the plurality of bit metrics is a plurality of state dependent bit metrics; the decomposing the plurality of symbol metrics into the plurality of bit metrics involves converting the plurality of state dependent bit metrics to a plurality of state independent bit metrics; the signal is a variable code rate signal whose code rate varies on a symbol by symbol basis; the symbol within the signal is encoded according to a first RC (Rate Control); at least one additional symbol within the signal is encoded according to a second RC; the first RC includes a first modulation having a first constellation and a first mapping; and the second RC includes a second modulation having a second constellation and a second mapping. - View Dependent Claims (72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 88, 89, 90)
-
-
91. A bit level decoder that employs a trellis to decode a signal whose code rate varies on a symbol by symbol basis according to a rate control sequence that includes a plurality of RCs (Rate Controls) arranged in a period, the decoder comprising:
-
a metric generator that calculates a plurality of metrics for each symbol of the signal according to a corresponding RC of the plurality of RCs, each symbol includes a plurality of bits; a decompose symbol metrics to initial bit metrics functional block that decomposes the plurality of symbol metrics into a plurality of bit metrics for each symbol of the signal; wherein the plurality of bit metrics are mapped to a plurality of trellis metrics for each symbol of the signal according to the corresponding RC; a top SISO (Soft-In Soft-Out decoder) that, based on a plurality of trellis metrics, calculates a first plurality of extrinsic values for each symbol of the signal according to the corresponding RC; an interleaver, communicatively coupled to the top SISO, that interleaves the first plurality of extrinsic values; a first bit metric update functional block that employs the interleaved first plurality of extrinsic values by employing first extrinsic information of a bit calculated in a previous decoding iteration to update a first bit metric of the bit for use in a current decoding iteration thereby generating a first APP (a priori probability) information, such that each respective bit metric of the plurality of bit metrics is updated using extrinsic information corresponding to that respective bit from a previous decoding iteration; a bottom SISO that, based on the plurality of trellis metrics, calculates a second plurality of extrinsic values for each symbol of the signal according to the corresponding RC; a de-interleaver, communicatively coupled to the bottom SISO, that de-interleaves the second plurality of extrinsic values; a second bit metric update functional block that employs the interleaved second plurality of extrinsic values by employing second extrinsic information of the bit calculated in the previous decoding iteration to update a second bit metric of the bit for use in the current decoding iteration thereby generating a second APP (a priori probability) information, such that each respective bit metric of the plurality of bit metrics is updated using extrinsic information corresponding to that respective bit from a previous decoding iteration; and
wherein;each extrinsic value of the first plurality of extrinsic values and the second plurality of extrinsic values corresponds to one individual bit of the plurality of bits of the symbol; the first APP information is fed back to the bottom SISO; the second APP information is fed back to the top SISO; the top SISO and the bottom SISO operate cooperatively to perform at least one iteration of iterative decoding to make soft bit decisions that correspond to the individual bits of the plurality of bits of each symbol of the signal; a first RC, of the plurality of RCs, includes a first modulation having a first constellation and a first mapping; and a second RC, of the plurality of RCs, includes a second modulation having a second constellation and a second mapping. - View Dependent Claims (92, 93, 94, 95, 96, 97, 98, 99, 100, 101, 102, 103, 104, 105)
-
Specification