1,518 research outputs found
Low Complexity Noncoherent Iterative Detector for Continuous Phase Modulation Systems
This paper focuses on the noncoherent iterative detection of continuous phase modulation. A class of simplified receivers based on Principal-Component-Analysis (PCA) and Exponential-Window (EW) is developed. The proposed receiver is evaluated in terms of minimum achievable Euclidean distance, simulated bit error rate and achievable capacity. The performance of the proposed receiver is discussed in the context of mismatched receiver and the equivalent Euclidean distance is derived. Analysis and numerical results reveal that the proposed algorithm can approach the coherent performance and outperforms existing algorithm in terms of complexity and performance. It is shown that the proposed receiver can significantly reduce the detection complexity while the performance is comparable with existing algorithms
Low-complexity Noncoherent Iterative CPM Demodulator for FH Communication
In this paper, we investigate the noncoherent iterative demodulation of coded continuous phase modulation (CPM) in frequency hopped (FH) systems. In this field, one important problem is that the complexity of the optimal demodulator is prohibitive unless the number of symbols per hop duration is very small. To solve this problem, we propose a novel demodulator, which reduces the complexity by applying phase quantization and exploiting the phase rotational invariance property of CPM signals. As shown by computational complexity analysis and numerical results, the proposed demodulator approaches the performance of the optimal demodulator, and provides considerable performance improvement over the existing solutions with the same computational complexity
Successive-relaying-aided decode-and-forward coherent versus noncoherent cooperative multicarrier space–time shift keying
Abstract—Successive-relaying-aided (SR) cooperative multi-carrier (MC) space–time shift keying (STSK) is proposed for frequency-selective channels. We invoke SR to mitigate the typical 50% throughput loss of conventional half-duplex relaying schemes and MC code-division multiple access (MC-CDMA) to circumvent the dispersive effects of wireless channels and to reduce the SR-induced interference. The distributed relay terminals form two virtual antenna arrays (VAAs), and the source node (SN) successively transmits frequency-domain (FD) spread signals to one of the VAAs, in addition to directly transmitting to the destination node (DN). The constituent relay nodes (RNs) of each VAA activate cyclic-redundancy-checking-based (CRC) selective decode-and-forward (DF) relaying. The DN can jointly detect the signals received via the SN-to-DN and VAA-to-DN links using a low-complexity single-stream-based joint maximum-likelihood (ML) detector. We also propose a differentially encoded cooperative MC-CDMA STSK scheme to facilitate communications over hostile dispersive channels without requiring channel estimation (CE). Dispensing with CE is important since the relays cannot be expected to altruistically estimate the SN-to-RN links for simply supporting the source. Furthermore, we propose soft-decision-aided serially concatenated recursive systematic convolutional (RSC) and unity-rate-coded (URC) cooperative MC STSK and investigate its performance in both coherent and noncoherent scenarios
LDPC Code Design for Noncoherent Physical Layer Network Coding
This work considers optimizing LDPC codes in the physical-layer network coded
two-way relay channel using noncoherent FSK modulation. The error-rate
performance of channel decoding at the relay node during the multiple-access
phase was improved through EXIT-based optimization of Tanner graph variable
node degree distributions. Codes drawn from the DVB-S2 and WiMAX standards were
used as a basis for design and performance comparison. The computational
complexity characteristics of the standard codes were preserved in the
optimized codes by maintaining the extended irregular repeat-accumulate (eIRA).
The relay receiver performance was optimized considering two modulation orders
M = {4, 8} using iterative decoding in which the decoder and demodulator refine
channel estimates by exchanging information. The code optimization procedure
yielded unique optimized codes for each case of modulation order and available
channel state information. Performance of the standard and optimized codes were
measured using Monte Carlo simulation in the flat Rayleigh fading channel, and
error rate improvements up to 1.2 dB are demonstrated depending on system
parameters.Comment: Six pages, submitted to 2015 IEEE International Conference on
Communication
- …