Synchronization for capacity -approaching coded communication systems

The dissertation concentrates on synchronization of capacity approaching error-correction codes that are deployed in noisy channels with very low signal-to-noise ratio (SNR). The major topics are symbol timing synchronization and frame synchronization.;Capacity-approaching error-correction codes, like turbo codes and low-density parity-check (LDPC) codes, are capable of reaching very low bit error rates and frame error rates in noisy channels by iterative decoding. To fully achieve the potential decoding capability of Turbo codes and LDPC codes, proper symbol timing synchronization, frame synchronization and channel state estimation are required. The dissertation proposes a joint estimator of symbol time delay and channel SNR for symbol timing recovery, and a maximum a posteriori (MAP) frame synchronizer for frame synchronization.;Symbol timing recovery is implemented by sampling and interpolation. The received signal is sampled multiple times per symbol period with unknown delay and unknown SNR. A joint estimator estimates the time delay and the SNR. The signal is rebuilt by interpolating available samples using estimated time delay. The intermediate decoding results enable decision-feedback estimation. The estimates of time delay and SNR are refined by iterative processing. This refinement improves the system performance significantly.;Usually the sampling rate is assumed to be a strict integer multiple of the symbol rate. However, in a practical system the local oscillators in the transmitter and the receiver may have random drifts. Therefore the sampling rate is no longer an exact multiple of the symbol rate, and the sampling time follows a random walk. This random walk may harm the system performance severely. The dissertation analyzes the effect of random time walks and proposes to mitigate the effect by overlapped sliding windows and iterative processing.;Frame synchronization is required to find the correct boundaries of codewords. MAP frame synchronization in the sense of minimizing the frame sync failure rate is investigated. The MAP frame synchronizer explores low-density parity-check attributes of the capacity-approaching codes. The accuracy of frame synchronization is adequate for considered coded systems to work reliably under very low SNR

An Architecture for High Data Rate Very Low Frequency Communication

Very low frequency (VLF) communication is used for long range shore-to-ship broadcasting applications. This paper proposes an architecture for high data rate VLF communication using Gaussian minimum shift keying (GMSK) modulation and low delay parity check (LDPC) channel coding. Non-data aided techniques are designed and used for carrier phase synchronization, symbol timing recovery, and LDPC code frame synchronization. These require the estimation of the operative Eb/N0 for which a kurtosis based algorithm is used. Also, a method for modeling the probability density function of the received signal under the bit condition is presented in this regard. The modeling of atmospheric radio noise (ARN) that corrupts VLF signals is described and an algorithm for signal enhancement in the presence of ARN in given. The BER performance of the communication system is evaluated for bit rates of 400 bps, 600 bps, and 800 bps for communication bandwidth of ~200 Hz.Defence Science Journal, 2013, 63(1), pp.25-33, DOI:http://dx.doi.org/10.14429/dsj.63.376

Performance Study of a Near Maximum Likelihood Code-Aided Timing Recovery Technique

International audienceIn this paper, we propose a new code-aided (CA) timing recovery algorithm for various linear constant modulus constellations based on the Maximum Likelihood (ML) estimator. The first contribution is the derivation of a soft estimator expression of the transmitted symbol instead of its true or hard estimated value which is fed into the timing error detector (TED) equation. The proposed expression includes the Log-Likelihood Ratios (LLRs) obtained from a turbo decoder. Our results show that the proposed CA approach achieves almost as good results as the data-aided (DA) approach over a large interval of SNR values while achieving a higher spectral efficiency. We also derive the corresponding CA Cramer Rao Bounds (CRB) for various modulation orders. Contrarily to former work, we develop here the CRB analytical expression for different M-PSK modulation orders and validate them through comparison to empirical CRB obtained by Monte Carlo iterations. The proposed CA estimator realizes an important gain over the non data-aided approach (NDA) and achieves a smaller gap when compared to its relative CA CRB, especially at moderate SNR values where modern systems are constrained to work

New Concept of PLC Modems: Multi-Carrier System for Frequency Selective Slow-Fading Channels Based on Layered SCCC Turbocodes

The article introduces a novel concept of a PLC modem as a complement to the existing G3 and PRIME standards for communications using medium- or high-voltage overhead or cable lines. The proposed concept is based on the fact that the levels of impulse noise and frequency selectivity are lower on high-voltage lines than on low-voltage ones. Also, the demands for “cost-effective” circuitry design are not so crucial as in the case of modems for low-voltage level. In contract to these positive conditions, however, there is the need to overcome much longer distances and to take into account low SNR on the receiving side. With respect to the listed reasons, our concept makes use of MCM, instead of OFDM. The assumption of low SNR is compensated through the use of an efficient channel coding based on a serially concatenated turbo code. In addition, MCM offers lower latency and PAPR compared to OFDM. Therefore, when using MCM, it is possible to excite the line with higher power. The proposed concept has been verified during experimental transmission of testing data over a real, 5 km long, 22kV overhead line