A Belief Propagation Based Framework for Soft Multiple-Symbol Differential Detection

Soft noncoherent detection, which relies on calculating the \textit{a posteriori} probabilities (APPs) of the bits transmitted with no channel estimation, is imperative for achieving excellent detection performance in high-dimensional wireless communications. In this paper, a high-performance belief propagation (BP)-based soft multiple-symbol differential detection (MSDD) framework, dubbed BP-MSDD, is proposed with its illustrative application in differential space-time block-code (DSTBC)-aided ultra-wideband impulse radio (UWB-IR) systems. Firstly, we revisit the signal sampling with the aid of a trellis structure and decompose the trellis into multiple subtrellises. Furthermore, we derive an APP calculation algorithm, in which the forward-and-backward message passing mechanism of BP operates on the subtrellises. The proposed BP-MSDD is capable of significantly outperforming the conventional hard-decision MSDDs. However, the computational complexity of the BP-MSDD increases exponentially with the number of MSDD trellis states. To circumvent this excessive complexity for practical implementations, we reformulate the BP-MSDD, and additionally propose a Viterbi algorithm (VA)-based hard-decision MSDD (VA-HMSDD) and a VA-based soft-decision MSDD (VA-SMSDD). Moreover, both the proposed BP-MSDD and VA-SMSDD can be exploited in conjunction with soft channel decoding to obtain powerful iterative detection and decoding based receivers. Simulation results demonstrate the effectiveness of the proposed algorithms in DSTBC-aided UWB-IR systems.Comment: 14 pages, 12 figures, 3 tables, accepted to appear on IEEE Transactions on Wireless Communications, Aug. 201

Cyclic redundancy check-based detection algorithms for automatic identification system signals received by satellite.

This paper addresses the problem of demodulating signals transmitted in the automatic identification system. The main characteristics of such signals consist of two points: (i) they are modulated using a trellis-coded modulation, more precisely a Gaussian minimum shift keying modulation; and (ii) they are submitted to a bit stuffing procedure, which makes more difficult the detection of the transmitted information bits. This paper presents several demodulation algorithms developed in different contexts: mono-user and multi-user transmissions, and known/unknown phase shift. The proposed receiver uses the cyclic redundancy check (CRC) present in the automatic identification system signals for error correction and not for error detection only. By using this CRC, a particular Viterbi algorithm, on the basis of a so-called extended trellis, is developed. This trellis is defined by extended states composed of a trellis code state and a CRC state. Moreover, specific conditional transitions are defined to take into account the possible presence of stuffing bits. The algorithms proposed in the multi-user scenario present a small increase of computation complexity with respect to the mono-user algorithms. Some performance results are presented for several scenarios in the context of the automatic identification system and compared with those of existing techniques developed in similar scenarios

Multiple symbol differential detection of uncoded and trellis coded MPSK

A differential detection for MPSK, which uses a multiple symbol observation interval, is presented and its performance analyzed and simulated. The technique makes use of maximum-likelihood sequence estimation of the transmitted phases rather than symbol-by-symbol detection as in conventional differential detection. As such the performance of this multiple symbol detection scheme fills the gap between conventional (two-symbol observation) differentially coherent detection of MPSK and ideal coherent of MPSK with differential encoding. The amount of improvement gained over conventional differential detection depends on the number of phases, M, and the number of additional symbol intervals added to the observation. What is particularly interesting is that substantial performance improvement can be obtained for only one or two additional symbol intervals of observation. The analysis and simulation results presented are for uncoded and trellis coded MPSK

L2 Orthogonal Space Time Code for Continuous Phase Modulation

To combine the high power efficiency of Continuous Phase Modulation (CPM) with either high spectral efficiency or enhanced performance in low Signal to Noise conditions, some authors have proposed to introduce CPM in a MIMO frame, by using Space Time Codes (STC). In this paper, we address the code design problem of Space Time Block Codes combined with CPM and introduce a new design criterion based on L2 orthogonality. This L2 orthogonality condition, with the help of simplifying assumption, leads, in the 2x2 case, to a new family of codes. These codes generalize the Wang and Xia code, which was based on pointwise orthogonality. Simulations indicate that the new codes achieve full diversity and a slightly better coding gain. Moreover, one of the codes can be interpreted as two antennas fed by two conventional CPMs using the same data but with different alphabet sets. Inspection of these alphabet sets lead also to a simple explanation of the (small) spectrum broadening of Space Time Coded CPM

Successive DF relaying: MS-DIS aided interference suppression and three-stage concatenated architecture design

Conventional single-relay aided two-phase cooperative networks employing coherent detection algorithms incur a significant 50% throughput loss. Furthermore, it is unrealistic to expect that in addition to the task of relaying, the relay-station would dedicate further precious resources to the estimation of the source-relay channel in support of coherent detection. In order to circumvent these problems, we propose decode and-forward (DF) based successive relaying employing noncoherent detection schemes. A crucial challenge in this context is that of suppressing the successive relaying induced interference, despite dispensing with any channel state information (CSI). We overcome this challenge by introducing a novel adaptive Newton algorithm based multiple-symbol differential interference suppression (MS-DIS) scheme. Correspondingly, a three-stage concatenated transceiver architecture is devised. We demonstrate that our proposed system is capable of near-error-free transmissions at low signal-to-noise ratios

Nonbinary convolutional codes and modified M-FSK detectors for power-line communications channel

The Viterbi decoding algorithm, which provides maximum - likelihood decoding, is currently considered the most widely used technique for the decoding of codes having a state description, including the class of linear error-correcting convolutional codes. Two classes of nonbinary convolutional codes are presented. Distance preserving mapping convolutional codes and M-ary convolutional codes are designed, respectively, from the distancepreserving mappings technique and the implementation of the conventional convolutional codes in Galois fields of order higher than two. We also investigated the performance of these codes when combined with a multiple frequency-shift keying (M-FSK) modulation scheme to correct narrowband interference (NBI) in powerline communications channel. Themodification of certain detectors of the M-FSK demodulator to refine the selection and the detection at the decoder is also presented. M-FSK detectors used in our simulations are discussed, and their chosen values are justified. Interesting and promising obtained results have shown a very strong link between the designed codes and the selected detector for MFSK modulation. An important improvement in gain for certain values of the modified detectors was also observed. The paper also shows that the newly designed codes outperform the conventional convolutional codes in a NBI environment

Residue number system coded differential space-time-frequency coding.

Thesis (Ph.D.)-University of KwaZulu-Natal, Durban, 2007.The rapidly growing need for fast and reliable transmission over a wireless channel motivates the development of communication systems that can support high data rates at low complexity. Achieving reliable communication over a wireless channel is a challenging task largely due to the possibility of multipaths which may lead to intersymbol interference (ISI). Diversity techniques such as time, frequency and space are commonly used to combat multipath fading. Classical diversity techniques use repetition codes such that the information is replicated and transmitted over several channels that are sufficiently spaced. In fading channels, the performance across some diversity branches may be excessively attenuated, making throughput unacceptably small. In principle, more powerful coding techniques can be used to maximize the diversity order. This leads to bandwidth expansion or increased transmission power to accommodate the redundant bits. Hence there is need for coding and modulation schemes that provide low error rate performance in a bandwidth efficient manner. If diversity schemes are combined, more independent dimensions become available for information transfer. The first part of the thesis addresses achieving temporal diversity through employing error correcting coding schemes combined with interleaving. Noncoherent differential modulation does not require explicit knowledge or estimate of the channel, instead the information is encoded in the transitions. This lends itself to the possibility of turbo-like serial concatenation of a standard outer channel encoder with an inner modulation code amenable to noncoherent detection through an interleaver. An iterative approach to joint decoding and demodulation can be realized by exchanging soft information between the decoder and the demodulator. This has been shown to be effective and hold hope for approaching capacity over fast fading channels. However most of these schemes employ low rate convolutional codes as their channel encoders. In this thesis we propose the use of redundant residue number system codes. It is shown that these codes can achieve comparable performance at minimal complexity and high data rates. The second part deals with the possibility of combining several diversity dimensions into a reliable bandwidth efficient communication scheme. Orthogonal frequency division multiplexing (OFDM) has been used to combat multipaths. Combining OFDM with multiple-input multiple-output (MIMO) systems to form MIMO-OFDM not only reduces the complexity by eliminating the need for equalization but also provides large channel capacity and a high diversity potential. Space-time coded OFDM was proposed and shown to be an effective transmission technique for MIMO systems. Spacefrequency coding and space-time-frequency coding were developed out of the need to exploit the frequency diversity due to multipaths. Most of the proposed schemes in the literature maximize frequency diversity predominantly from the frequency-selective nature of the fading channel. In this thesis we propose the use of residue number system as the frequency encoder. It is shown that the proposed space-time-frequency coding scheme can maximize the diversity gains over space, time and frequency domains. The gain of MIMO-OFDM comes at the expense of increased receiver complexity. Furthermore, most of the proposed space-time-frequency coding schemes assume frequency selective block fading channels which is not an ideal assumption for broadband wireless communications. Relatively high mobility in broadband wireless communications systems may result in high Doppler frequency, hence time-selective (rapid) fading. Rapidly changing channel characteristics impedes the channel estimation process and may result in incorrect estimates of the channel coefficients. The last part of the thesis deals with the performance of differential space-time-frequency coding in fast fading channels

Bit-Interleaved Coded Energy-Based Modulation with Iterative Decoding

This paper develops a low-complexity near-optimal non-coherent receiver for a multi-level energy-based coded modulation system. Inspired by the turbo processing principle, we incorporate the fundamentals of bit-interleaved coded modulation with iterative decoding (BICM-ID) into the proposed receiver design. The resulting system is called bit-interleaved coded energy-based modulation with iterative decoding (BICEM-ID) and its error performance is analytically studied. Specifically, we derive upper bounds on the average pairwise error probability (PEP) of the non-coherent BICEM-ID system in the feedback-free (FF) and error-free feedback (EFF) scenarios. It is revealed that the definition of the nearest neighbors, which is important in the performance analysis in the FF scenario, is very different from that in the coherent BICM-ID counterpart. The analysis also reveals how the mapping from coded bits to energy levels influences the diversity order and coding gain of the BICEM-ID systems. A design criterion for good mappings is then formulated and an algorithm is proposed to find a set of best mappings for BICEM-ID. Finally, simulation results corroborate the main analytical findings

A universal space-time architecture for multiple-antenna aided systems

In this tutorial, we first review the family of conventional multiple-antenna techniques, and then we provide a general overview of the recent concept of the powerful Multiple-Input Multiple-Output (MIMO) family based on a universal Space-Time Shift Keying (STSK) philosophy. When appropriately configured, the proposed STSK scheme has the potential of outperforming conventional MIMO arrangements

Iterative amplitude/phase multiple-symbol differential sphere detection for DAPSK modulated transmissions

Differentially encoded and non-coherently detected transceivers exhibit a low complexity, since they dispense with complex channel estimation. Albeit this is achieved at the cost of requiring an increased transmit power, they are particularly beneficial, for example in cooperative communication scenarios, where the employment of channel estimation for all the mobile-to-mobile links may become unrealistic. In pursuit of high bandwidth efficiency, differential amplitude and phase shift keying (DAPSK) was devised using constellations of multiple concentric rings. In order to increase resilience against the typical high-Doppler-induced performance degradation of DAPSK and/or enhance the maximum achievable error-free transmission rate for DAPSK modulated systems, multiple-symbol differential detection (MSDD) may be invoked. However, the complexity of the maximum-a-posteriori (MAP) MSDD increases exponentially with the detection window size and hence may become excessive upon increasing the window size, especially in the context of iterative detection aided channel coded system. In order to circumvent this excessive complexity, we conceive a decomposed two-stage iterative amplitude and phase (A/P) detection framework, where the challenge of having a non-constant-modulus constellation is tackled with the aid of a specifically designed information exchange between the independent A/P detection stages, thus allowing the incorporation of reduced-complexity sphere detection (SD). Consequently, a near-MAP-MSDD performance can be achieved at a significantly reduced complexity, which may be five orders of magnitude lower than that imposed by the traditional MAP-MSDD in the 16-DAPSK scenario considered