2005
DOI: 10.1109/tit.2005.853312
|View full text |Cite
|
Sign up to set email alerts
|

Convergence Analysis and Optimal Scheduling for Multiple Concatenated Codes

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

1
155
0

Year Published

2007
2007
2017
2017

Publication Types

Select...
4
4

Relationship

0
8

Authors

Journals

citations
Cited by 162 publications
(156 citation statements)
references
References 12 publications
1
155
0
Order By: Relevance
“…The outer decoder system setup is shown in Figure 4. The modulo-two sum code bits of users is represented by c, which are modelled as random independent Gaussian distributed variables with a mean value of σ 2 L /2 and a variance of σ 2 L to form the decoder input in terms of LLRs, L c a [31]. The decoder employs the maximum a posteriori algorithm in the logarithm domain (Log-MAP) to provide information about the source bits.…”
Section: Setup Exit Functionmentioning
confidence: 99%
“…The outer decoder system setup is shown in Figure 4. The modulo-two sum code bits of users is represented by c, which are modelled as random independent Gaussian distributed variables with a mean value of σ 2 L /2 and a variance of σ 2 L to form the decoder input in terms of LLRs, L c a [31]. The decoder employs the maximum a posteriori algorithm in the logarithm domain (Log-MAP) to provide information about the source bits.…”
Section: Setup Exit Functionmentioning
confidence: 99%
“…where the mapping-specific parameters are H 1 = 0.3073, H 2 = 0.8935, and H 3 = 1.1064, which are obtained by leastsquared curve fitting [13]. Furthermore, the inverse function of (6) is given by…”
Section: B Signal Modelmentioning
confidence: 99%
“…Furthermore, since we have B i = exp(γ i ), (13) and (14) may be rewritten as Figure 3 shows on EXIT chart analysis model. Based on (6) representing the variance of the LLR-to-MI conversion, the LLRs α i , β i and γ i are transformed to the corresponding MI, which are denoted by I α i , I β i and I γ i , respectively.…”
Section: A Iterative Decoding Of the Jcn Codesmentioning
confidence: 99%
“…2 allows us to decouple the effects of systematic bits, outer parity bits and inner parity bits on the performance. A similar description of serially concatenated codes was used in [9] and [10] for convergence analysis and in [6,7] for deriving upper bounds on the error probability.…”
Section: Designsmentioning
confidence: 99%
“…Here, the optimization of the puncturing patterns and the permeability rates is based on both upper bounds assuming uniform interleavers, and on EXIT functions assuming infinite interleavers. The design procedure based on EXIT functions is also suggested in [9,13] for multiple concatenated codes. The permeability rates are there optimized in terms of minimizing the convergence threshold in the WF region, i.e., minimizing the required SNR to reach a specific target BER.…”
Section: Code Design Criteriamentioning
confidence: 99%