Convolutional coded generalized nonlinear CPM
โ Scribed by Ken-ichiro Shinoi; Gunawan Wibisono; Iwao Sasase
- Publisher
- John Wiley and Sons
- Year
- 1998
- Tongue
- English
- Weight
- 235 KB
- Volume
- 81
- Category
- Article
- ISSN
- 8756-6621
No coin nor oath required. For personal study only.
โฆ Synopsis
Continuous phase modulation (CPM) is known for its attractive spectral properties. Furthermore, CPM has the property that the modulation signal maintains a constant envelope, so CPM is effective for satellite communications. Recently, generalized nonlinear CPM (GNCPM), which can achieve a larger minimum Euclidean distance than ordinary CPM, was introduced. In this paper, we propose a convolutional coded GNCPM to improve the bit error rate (BER) performance of uncoded GNCPM without expanding bandwidth. Combination CPM with convolutional coding causes an increased number of phase trajectory patterns which can cause the bandwidth expansion. Therefore, in our proposed model, to control the bandwidth, we pay attention to the phase trajectory pattern which is already owned by uncoded GNCPM and change the modulation index appropriately, depending on the input symbols, to keep the number of phase trajectory patterns the same as in uncoded GNCPM. First, we consider the most suitable assignment of the modulation index which can increase the Euclidean distances without bandwidth expansion. Next, we theoretically derive the upper bound on the error event probability of the proposed model in additive white Gaussian noise (AWGN). The performance of the proposed convolutional GNCPM, obtained by computer simulation, shows that the proposed model can improve BER performance without bandwidth expansion.
๐ SIMILAR VOLUMES
Generalized concatenation of inner and outer convolutional codes is studied. The essential problem is the partitioning of the inner code. A construction procedure to obtain a suitable equivalent description for a given code is derived, which gives the best possible distances in the partitioned subco
Carlet, C., A general case of formal duality between binary nonlinear codes, Discrete Mathematics 111 (1993) 77-85. We give a general context in which a binary code C admits at least one code whose weight enumerator is dual to that of C. We study two examples of applications of this general result,