Title :
An extensive search for good punctured rate-k/(k+1) recursive convolutional codes for serially concatenated convolutional codes
Author :
Daneshgaran, Fred ; Laddomada, Massimiliano ; Mondin, Marina
Author_Institution :
Dept. of Electr. & Comput. Eng., California State Univ., Los Angeles, CA, USA
Abstract :
In many practical applications requiring variable-rate coding and/or high-rate coding for spectral efficiency, there is a need to employ high-rate convolutional codes (CC), either by themselves or in a parallel or serially concatenated scheme. For such applications, in order to keep the trellis complexity of the code constant and to permit the use of a simplified decoder that can accommodate multiple rates, a mother CC is punctured to obtain codes with a variety of rates. This correspondence presents the results of extensive search for optimal puncturing patterns for recursive convolutional codes leading to codes of rate k/(k+1) (k an integer) to be used in serially concatenated convolutional codes (SCCC). The code optimization is in the sense of minimizing the required signal-to-noise ratio (SNR) for two target bit-error rate (BER) and two target frame-error rate (FER) values. We provide extensive sample simulation results for rate-k/(k+1) SCCC codes employing our optimized punctured CC.
Keywords :
3G mobile communication; concatenated codes; convolutional codes; decoding; error statistics; minimisation; trellis codes; turbo codes; variable rate codes; BER; FER; SCCC; SNR minimization; UMTS code; bit-error rate; code optimization; frame-error rate; high-rate coding; multiple rates; optimal puncturing patterns; punctured rate-k/(k+1) codes; recursive convolutional codes; serially concatenated convolutional codes; signal-to-noise ratio; simplified decoder; spectral efficiency; trellis complexity; turbo codes; variable-rate coding; Bit error rate; Carbon capture and storage; Concatenated codes; Convolution; Convolutional codes; Decoding; Forward error correction; Protection; Signal to noise ratio; Viterbi algorithm;
Journal_Title :
Information Theory, IEEE Transactions on
DOI :
10.1109/TIT.2003.821981