In this paper, we show that a "pragmatic" approach to coded CPM schemes suffers from a significant capacity loss. This loss can be greatly reduced by choosing an appropriate mapping different from natural or Gray, adopted so far. We propose to add to the CPM modulator a linear feedback, optimized through capacity arguments, that permits to achieve performance within 1 dB from the CPM capacity.
Recently proposed ‘turbo codes’ yield very good performance in combination with simple iterative decoding strategies. They can be thought of as parallel concatenated coding schemes employing systematic convolutional codes as constituent codes linked by an interleaver. A distinctive feature of turbo codes is that they use, as constituent codes, recursive convolutional codes. Through the application of simple analytical considerations reinforced by a complete example, we show that the presence of a recursive code is crucial to the performance of the concatenated code.
We introduce a message passing belief propagation (BP) algorithm for factor graph over linear models that uses messages in the form of Gaussian-like distributions. With respect to the regular Gaussian BP, the proposed algorithm adds two operations to the model, namely the wrapping and the discretization of variables. This addition requires the derivation of proper modifications of message representations and updating rules at the BP nodes. We named the new algorithm Analog-Digital-Belief-Propagation (ADBP). The ADBP allows to construct iterative decoders for mod-M ring encoders that have a complexity independent from the size M of the alphabets, thus yielding efficient decoders for very high spectral efficiencies.
10 August 2015 in International Journal of Satellite Communications and Networking
Next generation wireless systems will need to have higher spectral efficiency as the expected traffic volumes per unit bandwidth and dimension will inevitably grow. As a consequence, it is necessary to design coding schemes with performances close to the theoretical limits, having at the same time high flexibility and low complexity requirements at the receiver. In this paper we start by pointing out some of the main drawbacks of the Bit Interleaved Code Modulation (BICM) technique which is the state of the art adopted in several standards and then propose some lower complexity alternatives. These low complexity alternatives are obtained by applying the recently introduced Analog Digital Belief Propagation (ADBP) algorithm to a two stage encoding scheme. First we show that the loss in performance can be kept quite small by using a hard decoder in all stages of a multistage decoder (MSD) except the two lowest levels with a reasonable flexibility of choosing the code rates. Then we apply the ADBP algorithm to further reduce the decoding complexity of the soft decoded stages.
8 February 2018 in IEEE Journal on Selected Areas in Communications
Recent investigations show that high-rate telemetry systems, based on the CCSDS 131.2-B-1 standard and employed in Earth observation missions, do not fully exploit the available capacity. We thus propose and discuss possible ways to improve the data return of these systems that can be considered for a revision of the current standard. Some of them are represented by a revision and/or an extension of the currently adopted modulation and coding formats. The remaining techniques are related to an enhancement of the transceiver architecture. Different bandwidth allocation strategies are also considered. The benefits of the proposed techniques are assessed by means of computer simulations with reference to a realistic scenario where a real nonlinear amplifier, real filters, and real impairments are considered.