Code Design for Non-Coherent Detection of Frame Headers in Precoded Satellite Systems

In this paper we propose a simple method for generating short-length rate-compatible codes over $\mathbb{Z}_M$ that are robust to non-coherent detection for $M$-PSK constellations. First, a greedy algorithm is used to construct a family of rotationally invariant codes for a given constellation. Then, by properly modifying such codes we obtain codes that are robust to non-coherent detection. We briefly discuss the optimality of the constructed codes for special cases of BPSK and QPSK constellations. Our method provides an upper bound for the length of optimal codes with a given desired non-coherent distance. We also derive a simple asymptotic upper bound on the frame error rate (FER) of such codes and provide the simulation results for a selected set of proposed codes. Finally, we briefly discuss the problem of designing binary codes that are robust to non-coherent detection for QPSK constellation.Comment: 11 pages, 5 figure

Combined trellis coding and feedforward processing for MSS applications

The idea of using a multiple (more than two) symbol observation interval to improve error probability performance is applied to differential detection of trellis coded MPSK over a mobile satellite (fading) channel. Results are obtained via computer simulation. It is shown that only a slight increase (e.g., one symbol) in the length of the observation interval will provide a significant improvement in bit error probability performance both in AWGN and fading environments

Fixed-rank Rayleigh Quotient Maximization by an MMPSK Sequence

Certain optimization problems in communication systems, such as limited-feedback constant-envelope beamforming or noncoherent $M$-ary phase-shift keying ($M$PSK) sequence detection, result in the maximization of a fixed-rank positive semidefinite quadratic form over the $M$PSK alphabet. This form is a special case of the Rayleigh quotient of a matrix and, in general, its maximization by an $M$PSK sequence is $\mathcal{NP}$-hard. However, if the rank of the matrix is not a function of its size, then the optimal solution can be computed with polynomial complexity in the matrix size. In this work, we develop a new technique to efficiently solve this problem by utilizing auxiliary continuous-valued angles and partitioning the resulting continuous space of solutions into a polynomial-size set of regions, each of which corresponds to a distinct $M$PSK sequence. The sequence that maximizes the Rayleigh quotient is shown to belong to this polynomial-size set of sequences, thus efficiently reducing the size of the feasible set from exponential to polynomial. Based on this analysis, we also develop an algorithm that constructs this set in polynomial time and show that it is fully parallelizable, memory efficient, and rank scalable. The proposed algorithm compares favorably with other solvers for this problem that have appeared recently in the literature.Comment: 15 pages, 12 figures, To appear in IEEE Transactions on Communication

Digital communications over fading channels

In this report, the probabilities of bit error for the most commonly used digital modulation techniques are analyzed. Analytic solutions are developed for the probability of bit error when the signal is affected by the most commonly encountered impairment to system performance for a wireless channel, the transmission of the signal over a fading channel. In this report, the effect of a slow, flat Ricean fading channel on communications systems performance is examined. Since channel fading significantly degrades the performance of a communication system, the performance of digital communication systems that also use forward error correction channel coding is analyzed for hard decision decoding and, where appropriate, for soft decision decoding. Diversity, another technique to mitigate the effect of fading channels on digital communication systems performance, is also discussed. Also included is a discussion of the effect of narrowband noise interference, both continuous and pulsed, on digital communication systems. We then discuss the analysis of the probability of bit error for the combination of error correction coding and diversity. Following this, we briefly discuss spread spectrum systems. Next, we examine the link budget analysis and various models for channel loss. Finally, we examine in detail the second generation digital wireless standard Global System for Mobile (GSM).Approved for public release; distribution is unlimited

A low complexity distributed differential scheme based on orthogonal space time block coding for decode-and-forward wireless relay networks

This work proposes a new differential cooperative diversity scheme with high data rate and low decoding complexity using the decode-and-forward protocol. The proposed model does not require either differential encoding or channel state information at the source node, relay nodes, or destination node where the data sequence is directly transmitted and the differential detection method is applied at the relay nodes and the destination node. The proposed technique enjoys a low encoding and decoding complexity at the source node, the relay nodes, and the destination node. Furthermore, the performance of the proposed strategy is analyzed by computer simulations in quasi-static Rayleigh fading channel and using the decode-and-forward protocol. The simulation results show that the proposed differential technique outperforms the corresponding reference strategies

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

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