Decoding of High Rate Convolutional Codes Using the Dual Trellis
Authors:
- 28 December 2009
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 56 (1) , 273-295
Abstract
This paper deals with a posteriori probability (APP) decoding of high-rate convolutional codes, using the dual code's trellis. After deriving the dual APP (DAPP) algorithm from the APP relation, its trellis-based implementation is addressed. The challenge involved in practical implementation of a DAPP decoder is then highlighted. Metric representation schemes similar to the log domain used for log-APP decoding are shown to be unattractive for DAPP decoding due to quantization requirements. After explaining the nature of the DAPP metrics, an arc hyperbolic tangent (AHT) scheme is proposed and its equivalent arithmetic operations derived. By using an efficient approximation, an addition is translated to an addition in the AHT domain. Efficient techniques for normalization and extrinsic log-likelihood ratio (LLR ) calculation are presented which reduce implementation complexity significantly. Simulation results with different high-rate codes are given to show that the AHT-DAPP decoder performs similarly to a log-APP decoder and at the same time performs better than a decoder for a punctured code. A fully fixed-point model of an AHT-DAPP decoder is shown to perform close to an optimum decoder. The decoding complexity of the log-APP and AHT-DAPP decoders are listed and compared for several rate-k/(k+1) codes. It is shown that an AHT-DAPP decoder starts to be less complex from a code rate of 7/8 . When compared against a max-log-APP decoder, the AHT-DAPP decoder is less complex at a code rate of 9/10 and above.Keywords
This publication has 25 references indexed in Scilit:
- Turbo Codes With Rate-$m/(m+ 1)$Constituent Convolutional CodesIEEE Transactions on Communications, 2005
- Reduced-Complexity Decoding of LDPC CodesIEEE Transactions on Communications, 2005
- Design of fixed-point iterative decoders for concatenated codes with interleaversIEEE Journal on Selected Areas in Communications, 2001
- Codes on graphs: normal realizationsIEEE Transactions on Information Theory, 2001
- MAP decoding of convolutional codes using reciprocal dual codesIEEE Transactions on Information Theory, 1998
- Soft‐input soft‐output modules for the construction and distributed iterative decoding of code networksEuropean Transactions on Telecommunications, 1998
- Unveiling turbo codes: some results on parallel concatenated coding schemesIEEE Transactions on Information Theory, 1996
- The dynamics of group codes: state spaces, trellis diagrams, and canonical encodersIEEE Transactions on Information Theory, 1993
- Replication decodingIEEE Transactions on Information Theory, 1979
- An optimum symbol-by-symbol decoding rule for linear codesIEEE Transactions on Information Theory, 1976