On the Performance of Serially Concatenated CPM-OFDMA Schemes for Aeronautical Telemetry

2011 ◽  
Author(s):  
Marilynn Wylie ◽  
Glenn Green
Keyword(s):  
Serially Concatenated

Serially Concatenated Polar Coded CPM System with Iterative Decoding

2021 ◽  
Author(s):  
Weilong Dou ◽  
Ming-Min Zhao ◽  
Ming Lei ◽  
Min-Jian Zhao
Keyword(s):  
Iterative Decoding ◽  
Serially Concatenated

Serially concatenated OSMLD codes: design and iterative decoding

2016 ◽  
Vol 10 ◽  
pp. 2179-2188 ◽  
Author(s):  
Fouad Ayoub ◽  
Abderrazak Farchane ◽  
Askali Mohamed ◽  
Mostafa Belkasmi ◽  
Mohammed Majid Himmi
Keyword(s):  
Iterative Decoding ◽  
Serially Concatenated

The Study of Coded CPM Schemes

2012 ◽  
Vol 198-199 ◽  
pp. 1408-1412
Author(s):  
Lin Bo Su ◽  
Jian Hua Chen ◽  
Ying Peng Hu
Keyword(s):  
Fading Channels ◽  
Convolutional Codes ◽  
Continuous Phase ◽  
Coded Modulation ◽  
Superior Performance ◽  
Continuous Phase Modulation ◽  
Codes Over Rings ◽  
Constant Envelope ◽  
Modulation Schemes ◽  
Serially Concatenated

Continuous Phase Modulation (CPM) schemes belong to a class of constant-envelope digital modulation schemes, the constant-envelope nature of the CPM signals makes them robust for the nonlinear and fading channels, and very useful for the satellite and/or the mobile radio channels. Comparing to PSK modulation, CPM modulation can not only provide spectral economy, but also exhibit a “coding gain”. CPM can be decomposed into a Continuous Phase Encoder (CPE) followed by a Memoryless Modulator (MM), this allows many new coded modulation schemes of combination of convolutional encoder and CPM modulator to be possible, such as serially-concatenated CPM (SC-CPM), SC-CPM with Convolutional Codes over Rings, pragmatic CPM (P-CPM), Concatenation of convolutional endocder and extended CE（CCEC）, etc. Some simulations show that these new CPM schemes can offer superior performance.

scholarly journals Some Extended Results on the Design of Punctured Serially Concatenated Convolutional Codes

2017 ◽  
Vol 2 (3) ◽  
pp. 235
Author(s):  
Massimiliano Laddomada ◽  
Bartolo Scanavino
Keyword(s):  
Error Probability ◽  
Selection Criteria ◽  
Convolutional Codes ◽  
Companion Paper ◽  
Design Guidelines ◽  
Effective Algorithm ◽  
Signal To Noise ◽  
Convolutional Encoders ◽  
Simulation Results ◽  
Serially Concatenated

The aim of this paper is twofold. On one hand, it presents the results of the search for good punctured systematicrecursive convolutional encoders suitable for application in serially concatenated convolutional codes (SCCCs) operating in two different target regions: at low-to moderate signal-to-noise ratios (SNRs), i.e., in the so called waterfall region, and at high SNRs. On the other hand, it provides some useful design guidelines for choosing the constituent encoders in an SCCC. The results of the search for good SCCCs operating in the waterfall region rely upon an effective algorithm, based on density evolution technique, first proposed in a companion paper. Good punctured SCCCs were obtained through considerationsdeduced by the behaviour of the bit error probability of an SCCC for high values of both SNR and interleaver length, i.e., through asymptotic considerations. The mother codes in the serial concatenation are rate 1/2 recursive convolutional encoders (RCC) found by an exhaustive search for encoders tailored to SCCC schemes, using two different selection criteria. Extensive tables of optimized puncturing patterns for various mother codes and SCCCs are presented along with sample simulation results.

scholarly journals A Constellation Space Dimensionality Reduced Sub-Optimal Receiver for Orthogonal STBC CPM Modulation in a MIMO Channel

10.14311/1107 ◽  
2009 ◽  
Vol 49 (2) ◽  
Author(s):  
M. Hekrdla
Keyword(s):  
Rayleigh Fading ◽  
Dimensional Subspace ◽  
Space Time ◽  
Mimo Channel ◽  
Optimal Receiver ◽  
Computational Performance ◽  
Awgn Channel ◽  
Serially Concatenated ◽  
Optimal Subspace ◽  
Subspace Search

We consider burst orthogonal space-time block coded (OSTBC) CPM modulation in a MIMO flat slow Rayleigh fading channel. The optimal receiver must process a multidimensional non-linear CPM signal on each antenna. This task imposes a high load on the receiver computational performance and increases its complexity. We analytically derive a suboptimal receiver with a reduced number of front end matched filters (MFs) corresponding to the CPM dimension. Our derivation is made fully in the constellation signal space, and the reduction is based on the linear orthogonal projection to the optimal subspace. Criterion optimality is a standard space-time rank and determinant criterion. The optimal arbitrary-dimensional subspace search leads to the eigenvector solution. We present the condition on a sufficient subspace dimension and interpret the meaning of the corresponding eigenvalues. It is shown that the determinant and rank criterion for OSTBC CPM is equivalent to the uncoded CPM Euclidean distance criterion. Hence the proposed receiver may be practical for uncoded CPM and foremost in a serially concatenated (SC) CPM system. All the derivations are supported by suitable error simulations for binary 2REC h= 1/2, but the procedure is generally valid for any CPM variant. We consider OSTBC CPM in a Rayleigh fading AWGN channel and SC CPM in an AWGN channel. 

Sign in / Sign up

Export Citation Format

Share Document