Abstract
We propose and compare some design criteria for the search of good systematic rate-compatible punctured turbo code (RCPTC) families. The considerations presented by S. Benedetto et al. (1998) to find the best component encoders for turbo code construction are extended to find good rate-compatible puncturing patterns for a given interleaver length N. This approach is shown to lead to codes that improve over previous ones, both in the maximum-likelihood sense (using transfer function bounds) and in the iterative decoding sense (through simulation results). To find simulation and analytical results, the coded bits are transmitted over an additive white Gaussian noise (AWGN) channel using an antipodal binary modulation. The two main applications of this technique are its use in hybrid incremental ARQ/FEC schemes and its use to achieve unequal error protection of an information sequence.
Highlights
We propose a new criterion for the choice of the puncturing patterns, based on the analytical technique introduced in [1], that leads to systematic rate-compatible codes improving over known ones with respect to both maximumlikelihood and iterative decoding criteria
We will compare through analysis and simulation the various design criteria previously described. They are applied to find a family of systematic rate-compatible punctured turbo code (RCPTC) based on a rate 1/3 mother parallel concatenated convolutional codes (PCCC)
A first set of simulation and bound results is shown in Figure 1, where we report the Eb/N0 required to obtain a bit error rate (BER) of 10−5 versus the RCPTCs rate Rc (Eb/N0 being the ratio of the received energy per bit (Eb) to the spectral noise density (N0))
Summary
We propose a new criterion for the choice of the puncturing patterns, based on the analytical technique introduced in [1], that leads to systematic rate-compatible codes improving over known ones with respect to both maximumlikelihood and iterative decoding criteria. The concept of rate-compatible codes has been presented for the first time in [2], where a particular family of convolutional codes, called in the paper rate-compatible punctured convolutional codes, is obtained by adding a ratecompatibility restriction to the puncturing rule This restriction requires that the rates are organized in a hierarchy, where all coded bits of a higher-rate code are used by all lower-rate codes; or, in other words, the high-rate codes are embedded into the lower-rate codes of the family. Design criteria for the puncturing patterns have successively appeared in [5, 6].
Sign-in/Register to view highlights & summary Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
