Abstract
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.
| Original language | English (US) |
|---|---|
| Pages (from-to) | 5811-5821 |
| Number of pages | 11 |
| Journal | IEEE Transactions on Information Theory |
| Volume | 55 |
| Issue number | 12 |
| DOIs | |
| State | Published - Dec 2009 |
| Externally published | Yes |
All Science Journal Classification (ASJC) codes
- Information Systems
- Computer Science Applications
- Library and Information Sciences
Keywords
- Double serially concatenated convolutional codes
- S-type permutors
- Serially concatenated convolutional codes
- Spreading factor
Fingerprint
Dive into the research topics of 'Double serially concatenated convolutional codes with jointly designed S-type permutors'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver