Serially concatenated continuous phase modulation with convolutional codes over rings
2006 (English)In: IEEE Transactions on Communications, ISSN 0090-6778, E-ISSN 1558-0857, Vol. 54, no 8, 1387-1396 p.Article in journal (Refereed) Published
In this paper, we investigate serially concatenated continuous phase modulation (SCCPM) with convolutional codes (CC) over rings. The transmitted signals are disturbed by additive white Gaussian noise. The properties for systems with both infinite and finite block lengths are investigated. For an infinite-length system, we check the convergence threshold using the extrinsic information transfer chart. For a finite-length system, we use union-bound techniques to estimate the error floors. In the union-bound analysis, we consider both the order and the position of nonzero permuted symbols. A simple method for determining a CPM error event through the sum of the input symbol sequence is shown. Thus, we can determine if the output symbol sequence of an error event in the ring CC can form an error event in CPM. Two properties concerning the interleaver gain (IG) are investigated. A recursive search algorithm for the maximal IG is shown. Compared with previous SCCPM with a binary CC, the proposed system shows an improvement concerning the convergence threshold or error floors.
Place, publisher, year, edition, pages
2006. Vol. 54, no 8, 1387-1396 p.
continuous phase modulation (CPM), performance analysis and systematic properties, ring convolutional codes (CCs), serially concatenated (SC) coding
IdentifiersURN: urn:nbn:se:kth:diva-29009DOI: 10.1109/TCOMM.2006.878826ISI: 000239933200006OAI: oai:DiVA.org:kth-29009DiVA: diva2:395075
IEEE International Symposium on Information Theory Chicago, IL, JUN 27-JUL 02, 2004
QC 20110204. IEEE International Symposium on Information Theory Chicago, IL, JUN 27-JUL 02, 2004.2011-02-042011-01-252012-01-20Bibliographically approved