.png){kind=icon}
返回
Serially concatenated continuous phase modulation with convolutional codes over rings
.png){kind=icon}
PRE
AI
DOI：10.1109/TCOMM.2006.878826.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
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.
Keyword:
continuous phase modulation (CPM)
performance analysis and systematic properties
ring convolutional codes (CCs)
serially concatenated (SC) coding
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
8.3
论文数:
1.2W
被引数:
3.6W
机构
暂无机构信息
引用论文
分享收藏Four novel sulfur-rich complexes: syntheses, crystal structures of three nickel(II) and one cobalt(II) complex with derivatives of Lawesson's Reagent.png)
Polyhedron
PolyhedronIF0
PREAI
分享收藏
查看更多内容