TY - JOUR
T1 - Double serially concatenated convolutional codes with jointly designed S-type permutors
AU - Huebner, Axel
AU - Kliewer, Jörg
AU - Costello, Daniel J.
N1 - Funding Information:
Manuscript received August 26, 2007; revised June 03, 2009. Current version published November 20, 2009. This work was supported in part by the German Research Foundation (DFG) under Grant KL 1080/3-1, the University of Notre Dame Faculty Research Program, the National Science Foundation (NSF) under Grants CCF08-30651, CCF08-30666, and CCF05-15012, and by NASA under Grant NNX07AK536. The material in this paper was presented in part at the IEEE Information Theory Workshop, Punta del Este, Uruguay, March 2006.
PY - 2009/12
Y1 - 2009/12
N2 - In this paper, the design of double serially concatenated convolutional codes with S-type permutors, i.e., permutors that provide a nontrivial separation, is considered. Based on a newly introduced parameter, namely, the so-called symbol span, a joint design of the outer and inner permutor is presented and its impact on the minimum distance of the overall code is analyzed. It is shown that a lower bound on the minimum distance that is given by the product of the free distances of all three component codes can be guaranteed. Design tables and simulation results are presented that include comparisons with single serially concatenated convolutional codes. In addition, a comparison with double/generalized repeat accumulate codes is briefly sketched.
AB - In this paper, the design of double serially concatenated convolutional codes with S-type permutors, i.e., permutors that provide a nontrivial separation, is considered. Based on a newly introduced parameter, namely, the so-called symbol span, a joint design of the outer and inner permutor is presented and its impact on the minimum distance of the overall code is analyzed. It is shown that a lower bound on the minimum distance that is given by the product of the free distances of all three component codes can be guaranteed. Design tables and simulation results are presented that include comparisons with single serially concatenated convolutional codes. In addition, a comparison with double/generalized repeat accumulate codes is briefly sketched.
KW - Double serially concatenated convolutional codes
KW - S-type permutors
KW - Serially concatenated convolutional codes
KW - Spreading factor
UR - http://www.scopus.com/inward/record.url?scp=77955596366&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=77955596366&partnerID=8YFLogxK
U2 - 10.1109/TIT.2009.2032804
DO - 10.1109/TIT.2009.2032804
M3 - Article
AN - SCOPUS:77955596366
SN - 0018-9448
VL - 55
SP - 5811
EP - 5821
JO - IEEE Transactions on Information Theory
JF - IEEE Transactions on Information Theory
IS - 12
ER -