OFDM-Aided Differential Space-Time Shift Keying Using Iterative Soft Multiple-Symbol Differential Sphere Decoding

Soft-decision multiple-symbol differential sphere decoding (MSDSD) is proposed for orthogonal frequency-division multiplexing (OFDM)-aided differential space-time shift keying (DSTSK)-aided transmission over frequency-selective channels. Specifically, the DSTSK signaling blocks are generated by the channel-encoded source information and the space-time (ST) blocks are appropriately mapped to a number of OFDM subcarriers. After OFDM demodulation, the DSTSK signal is noncoherently detected by our soft-decision MSDSD detector. A novel soft-decision MSDSD detector is designed, and the associated decision rule is derived for the DSTSK scheme. Our simulation results demonstrate that an SNR reduction of 2 dB is achieved by the proposed scheme using an MSDSD window size of N-w = 4 over the conventional soft-decision-aided differential detection benchmarker, while communicating over dispersive channels and dispensing with channel estimation (CE).

LDPC Code Designs Based on root I Matrices

LDPC codes can be constructed by tiling permutation matrices that belong to the square root of identity type and similar algebraic structures. We investigate into the properties of such codes. We also present code structures that are amenable for efficient encoding.

Secure Communication in Amplify-and-Forward Networks with Multiple Eavesdroppers: Decoding with SNR Thresholds

The problem of secure unicast communication over a two hop Amplify-and-Forward wireless relay network with multiple eavesdroppers is considered. Assuming that a receiver (destination or eavesdropper) can decode a message only if the received SNR is above a predefined threshold, we consider this problem in two scenarios. In the first scenario, we maximize the SNR at the legitimate destination, subject to the condition that the received SNR at each eavesdropper is below the target threshold. Due to the non-convex nature of the objective function and eavesdroppers' constraints, we transform variables and obtain a quadratically constrained quadratic program (QCQP) with convex constraints, which can be solved efficiently. When the constraints are not convex, we consider a semidefinite relaxation (SDR) to obtain computationally efficient approximate solution. In the second scenario, we minimize the total power consumed by all relay nodes, subject to the condition that the received SNR at the legitimate destination is above the threshold and at every eavesdropper, it is below the corresponding threshold. We propose a semidefinite relaxation of the problem in this scenario and also provide an analytical lower bound.