Powered by OpenAIRE graph
Found an issue? Give us feedback
image/svg+xml Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao Closed Access logo, derived from PLoS Open Access logo. This version with transparent background. http://commons.wikimedia.org/wiki/File:Closed_Access_logo_transparent.svg Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao IEEE Transactions on...arrow_drop_down
image/svg+xml Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao Closed Access logo, derived from PLoS Open Access logo. This version with transparent background. http://commons.wikimedia.org/wiki/File:Closed_Access_logo_transparent.svg Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao
IEEE Transactions on Communications
Article . 2006 . Peer-reviewed
License: IEEE Copyright
Data sources: Crossref
DBLP
Article . 2021
Data sources: DBLP
versions View all 2 versions
addClaim

Serially concatenated continuous phase modulation with convolutional codes over rings

Authors: Ming Xiao 0001; Tor Aulin;

Serially concatenated continuous phase modulation with convolutional codes over rings

Abstract

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

Related Organizations
  • BIP!
    Impact byBIP!
    selected citations
    These citations are derived from selected sources.
    This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
    40
    popularity
    This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
    Average
    influence
    This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
    Top 10%
    impulse
    This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.
    Top 10%
Powered by OpenAIRE graph
Found an issue? Give us feedback
selected citations
These citations are derived from selected sources.
This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
BIP!Citations provided by BIP!
popularity
This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
BIP!Popularity provided by BIP!
influence
This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
BIP!Influence provided by BIP!
impulse
This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.
BIP!Impulse provided by BIP!
40
Average
Top 10%
Top 10%
Upload OA version
Are you the author of this publication? Upload your Open Access version to Zenodo!
It’s fast and easy, just two clicks!