Sphere-constrained ML detection for frequency-selective channels

The maximum-likelihood (ML) sequence detection problem for channels with memory is investigated. The Viterbi algorithm (VA) provides an exact solution. Its computational complexity is linear in the length of the transmitted sequence, but exponential in the channel memory length. On the other hand, the sphere decoding (SD) algorithm also solves the ML detection problem exactly, and has expected complexity which is a low-degree polynomial (often cubic) in the length of the transmitted sequence over a wide range of signal-to-noise ratios. We combine the sphere-constrained search strategy of SD with the dynamic programming principles of the VA. The resulting algorithm has the worst-case complexity determined by the VA, but often significantly lower expected complexity

Efficient Direct Detection of M-PAM Sequences with Implicit CSI Acquisition for The FSO System

Compared to on-off keying (OOK), M-ary pulse amplitude modulation (M-PAM, M>2) is more spectrally efficient. However, to detect M-PAM signals reliably, the requirement of accurate channel state information is more stringent. Previously, for OOK systems, we have developed a receiver that requires few pilot symbols and can jointly detect the data sequence and estimate the unknown channel gain implicitly. In this paper, using the same approach, we extend our previous work and derive a generalized receiver for M-PAM systems. A Viterbi-type trellis-search algorithm coupled with a selective-store strategy is adopted, resulting in a low implementation complexity and a low memory requirement. Therefore, the receiver is efficient in terms of energy, spectra, implementation complexity and memory. Using theoretical analysis, we show that its error performance approaches that of maximum likelihood detection with perfect knowledge of the channel gain, as the observation window length increases. Also, simulation results are presented to justify the theoretical analysis.Comment: 6 page

Turbo-Coded Adaptive Modulation Versus Space-Time Trellis Codes for Transmission over Dispersive Channels

Decision feedback equalizer (DFE)-aided turbocoded wideband adaptive quadrature amplitude modulation (AQAM) is proposed, which is capable of combating the temporal channel quality variation of fading channels. A procedure is suggested for determining the AQAM switching thresholds and the specific turbo-coding rates capable of maintaining the target bit-error rate while aiming for achieving a highly effective bits per symbol throughput. As a design alternative, we also employ multiple-input/multiple-output DFE-aided space–time trellis codes, which benefit from transmit diversity and hence reduce the temporal channel quality fluctuations. The performance of both systems is characterized and compared when communicating over the COST 207 typical urban wideband fading channel. It was found that the turbo-coded AQAM scheme outperforms the two-transmitter space–time trellis coded system employing two receivers; although, its performance is inferior to the space–time trellis coded arrangement employing three receivers. Index Terms—Coded adaptive modulation, dispersive channels, space–time trellis codes

Turbo Decoding and Detection for Wireless Applications

A historical perspective of turbo coding and turbo transceivers inspired by the generic turbo principles is provided, as it evolved from Shannon’s visionary predictions. More specifically, we commence by discussing the turbo principles, which have been shown to be capable of performing close to Shannon’s capacity limit. We continue by reviewing the classic maximum a posteriori probability decoder. These discussions are followed by studying the effect of a range of system parameters in a systematic fashion, in order to gauge their performance ramifications. In the second part of this treatise, we focus our attention on the family of iterative receivers designed for wireless communication systems, which were partly inspired by the invention of turbo codes. More specifically, the family of iteratively detected joint coding and modulation schemes, turbo equalization, concatenated spacetime and channel coding arrangements, as well as multi-user detection and three-stage multimedia systems are highlighted

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

Interleaver design for trellis-coded differential 8-PSK modulation with non-coherent detection

The effect of finite interleaver size on bit error rate (BER) performance of coded 8-DPSK is determined by means of computer simulations. The losses evaluated in this way include the SNR degradation due to the timing and frequency errors of the symbol synchronizer and the automatic frequency control (AFC) of the receiver. BER measurements are presented using a conventional 2/3 rate convolutional 8-state trellis-code for typical Rayleigh and Rician fading channels. It is shown that for a Rician channel with a Rician parameter of 7 dB, a Doppler spread of 100 Hz and a data rate of 2400 bps, an interleaver with size 16 x 16 symbols performs nearly as well as a very large interleaver. It is also shown that for very fast Rayleigh channels, the BER-curves flatten out at large SNR

Space-time coding for UMTS. Performance evaluation in combination with convolutional and turbo coding

Space-time codes provide both diversity and coding gain when using multiple transmit antennas to increase spectral efficiency over wireless communications systems. Space-time block codes have already been included in the standardization process of UMTS in conjunction with conventional channel codes (convolutional and turbo codes). We discuss different encoding and decoding strategies when transmit diversity is combined with conventional channel codes, and present simulations results for the TDD and FDD modes of UTRA.Peer ReviewedPostprint (published version