A Constellation Space Dimensionality Reduced Sub-Optimal Receiver for Orthogonal STBC CPM Modulation in a MIMO Channel
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 it...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
CTU Central Library
2009-01-01
|
| Series: | Acta Polytechnica |
| Subjects: | |
| Online Access: | https://ojs.cvut.cz/ojs/index.php/ap/article/view/1107 |
| Summary: | 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. |
|---|---|
| ISSN: | 1210-2709 1805-2363 |