TY - GEN
T1 - On the computation of EXIT characteristics for symbol-based iterative decoding
AU - Kliewer, Jörg
AU - Ng, Soon Xin
AU - Hanzo, Lajos
N1 - Publisher Copyright:
© 2020 TURBO - CODING 2006 - 4th International Symposium on Turbo Codes and Related Topics and 6th International ITG-Conference on Source and Channel Coding. All rights reserved.
PY - 2006
Y1 - 2006
N2 - In this contribution we propose an efficient method for computing symbol-based extrinsic information transfer (EXIT) charts, which are useful for estimating the convergence properties of non-binary iterative decoding. A standard solution is to apply a priori reliability information to the a posteriori probability (APP) constituent decoder and compute the resultant average extrinsic information at the decoder's output using multidimensional histogram measurements. However, the employment of this technique is only feasible for a low number of bits per symbol, since the complexity of this approach increases exponentially with the number of bits per symbol. We demonstrate that by averaging over a function of the extrinsic APPs for a long block the extrinsic information can be estimated at a low complexity. In contrast to using histogram measurements, the proposed technique allows us to generate EXIT charts even for a high number of bits per symbol. Our design examples using either a non-binary serial concatenated code or turbo trellis-coded modulation demonstrate the attractive benefits of the proposed approach.
AB - In this contribution we propose an efficient method for computing symbol-based extrinsic information transfer (EXIT) charts, which are useful for estimating the convergence properties of non-binary iterative decoding. A standard solution is to apply a priori reliability information to the a posteriori probability (APP) constituent decoder and compute the resultant average extrinsic information at the decoder's output using multidimensional histogram measurements. However, the employment of this technique is only feasible for a low number of bits per symbol, since the complexity of this approach increases exponentially with the number of bits per symbol. We demonstrate that by averaging over a function of the extrinsic APPs for a long block the extrinsic information can be estimated at a low complexity. In contrast to using histogram measurements, the proposed technique allows us to generate EXIT charts even for a high number of bits per symbol. Our design examples using either a non-binary serial concatenated code or turbo trellis-coded modulation demonstrate the attractive benefits of the proposed approach.
UR - http://www.scopus.com/inward/record.url?scp=85091858930&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85091858930&partnerID=8YFLogxK
M3 - Conference contribution
AN - SCOPUS:85091858930
T3 - TURBO - CODING 2006 - 4th International Symposium on Turbo Codes and Related Topics and 6th International ITG-Conference on Source and Channel Coding
BT - TURBO - CODING 2006 - 4th International Symposium on Turbo Codes and Related Topics and 6th International ITG-Conference on Source and Channel Coding
PB - VDE Verlag GmbH
T2 - 4th International Symposium on Turbo Codes and Related Topics and 6th International ITG-Conference on Source and Channel Coding, TURBOCODING 2006
Y2 - 3 April 2006 through 7 April 2006
ER -